window.nostr.js 0.4.0 → 0.4.1

package/dist/iframe.js

@@ -1,4333 +1,22 @@
 "use strict";
 (() => {
-  var __defProp = Object.defineProperty;
-  var __export = (target, all) => {
-    for (var name in all)
-      __defProp(target, name, { get: all[name], enumerable: true });
-  };
-
-  // node_modules/@noble/hashes/esm/crypto.js
-  var crypto = typeof globalThis === "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-
-  // node_modules/@noble/hashes/esm/utils.js
-  var u8a = (a) => a instanceof Uint8Array;
-  var createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
-  var rotr = (word, shift) => word << 32 - shift | word >>> shift;
-  var isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-  if (!isLE)
-    throw new Error("Non little-endian hardware is not supported");
-  var hexes = Array.from({ length: 256 }, (v, i2) => i2.toString(16).padStart(2, "0"));
-  function bytesToHex(bytes4) {
-    if (!u8a(bytes4))
-      throw new Error("Uint8Array expected");
-    let hex2 = "";
-    for (let i2 = 0; i2 < bytes4.length; i2++) {
-      hex2 += hexes[bytes4[i2]];
-    }
-    return hex2;
-  }
-  function utf8ToBytes(str) {
-    if (typeof str !== "string")
-      throw new Error(`utf8ToBytes expected string, got ${typeof str}`);
-    return new Uint8Array(new TextEncoder().encode(str));
-  }
-  function toBytes(data) {
-    if (typeof data === "string")
-      data = utf8ToBytes(data);
-    if (!u8a(data))
-      throw new Error(`expected Uint8Array, got ${typeof data}`);
-    return data;
-  }
-  var Hash = class {
-    // Safe version that clones internal state
-    clone() {
-      return this._cloneInto();
-    }
-  };
-  function wrapConstructor(hashCons) {
-    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();
-    const tmp = hashCons();
-    hashC.outputLen = tmp.outputLen;
-    hashC.blockLen = tmp.blockLen;
-    hashC.create = () => hashCons();
-    return hashC;
-  }
-
-  // node_modules/@noble/curves/node_modules/@noble/hashes/esm/_assert.js
-  function number(n) {
-    if (!Number.isSafeInteger(n) || n < 0)
-      throw new Error(`Wrong positive integer: ${n}`);
-  }
-  function bytes(b, ...lengths) {
-    if (!(b instanceof Uint8Array))
-      throw new Error("Expected Uint8Array");
-    if (lengths.length > 0 && !lengths.includes(b.length))
-      throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);
-  }
-  function hash(hash3) {
-    if (typeof hash3 !== "function" || typeof hash3.create !== "function")
-      throw new Error("Hash should be wrapped by utils.wrapConstructor");
-    number(hash3.outputLen);
-    number(hash3.blockLen);
-  }
-  function exists(instance, checkFinished = true) {
-    if (instance.destroyed)
-      throw new Error("Hash instance has been destroyed");
-    if (checkFinished && instance.finished)
-      throw new Error("Hash#digest() has already been called");
-  }
-  function output(out, instance) {
-    bytes(out);
-    const min = instance.outputLen;
-    if (out.length < min) {
-      throw new Error(`digestInto() expects output buffer of length at least ${min}`);
-    }
-  }
-
-  // node_modules/@noble/curves/node_modules/@noble/hashes/esm/crypto.js
-  var crypto2 = typeof globalThis === "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-
-  // node_modules/@noble/curves/node_modules/@noble/hashes/esm/utils.js
-  var u8a2 = (a) => a instanceof Uint8Array;
-  var createView2 = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
-  var rotr2 = (word, shift) => word << 32 - shift | word >>> shift;
-  var isLE2 = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-  if (!isLE2)
-    throw new Error("Non little-endian hardware is not supported");
-  function utf8ToBytes2(str) {
-    if (typeof str !== "string")
-      throw new Error(`utf8ToBytes expected string, got ${typeof str}`);
-    return new Uint8Array(new TextEncoder().encode(str));
-  }
-  function toBytes2(data) {
-    if (typeof data === "string")
-      data = utf8ToBytes2(data);
-    if (!u8a2(data))
-      throw new Error(`expected Uint8Array, got ${typeof data}`);
-    return data;
-  }
-  function concatBytes(...arrays) {
-    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));
-    let pad = 0;
-    arrays.forEach((a) => {
-      if (!u8a2(a))
-        throw new Error("Uint8Array expected");
-      r.set(a, pad);
-      pad += a.length;
-    });
-    return r;
-  }
-  var Hash2 = class {
-    // Safe version that clones internal state
-    clone() {
-      return this._cloneInto();
-    }
-  };
-  var toStr = {}.toString;
-  function wrapConstructor2(hashCons) {
-    const hashC = (msg) => hashCons().update(toBytes2(msg)).digest();
-    const tmp = hashCons();
-    hashC.outputLen = tmp.outputLen;
-    hashC.blockLen = tmp.blockLen;
-    hashC.create = () => hashCons();
-    return hashC;
-  }
-  function randomBytes(bytesLength = 32) {
-    if (crypto2 && typeof crypto2.getRandomValues === "function") {
-      return crypto2.getRandomValues(new Uint8Array(bytesLength));
-    }
-    throw new Error("crypto.getRandomValues must be defined");
-  }
-
-  // node_modules/@noble/curves/node_modules/@noble/hashes/esm/_sha2.js
-  function setBigUint64(view, byteOffset, value, isLE4) {
-    if (typeof view.setBigUint64 === "function")
-      return view.setBigUint64(byteOffset, value, isLE4);
-    const _32n = BigInt(32);
-    const _u32_max = BigInt(4294967295);
-    const wh = Number(value >> _32n & _u32_max);
-    const wl = Number(value & _u32_max);
-    const h = isLE4 ? 4 : 0;
-    const l = isLE4 ? 0 : 4;
-    view.setUint32(byteOffset + h, wh, isLE4);
-    view.setUint32(byteOffset + l, wl, isLE4);
-  }
-  var SHA2 = class extends Hash2 {
-    constructor(blockLen, outputLen, padOffset, isLE4) {
-      super();
-      this.blockLen = blockLen;
-      this.outputLen = outputLen;
-      this.padOffset = padOffset;
-      this.isLE = isLE4;
-      this.finished = false;
-      this.length = 0;
-      this.pos = 0;
-      this.destroyed = false;
-      this.buffer = new Uint8Array(blockLen);
-      this.view = createView2(this.buffer);
-    }
-    update(data) {
-      exists(this);
-      const { view, buffer, blockLen } = this;
-      data = toBytes2(data);
-      const len = data.length;
-      for (let pos = 0; pos < len; ) {
-        const take = Math.min(blockLen - this.pos, len - pos);
-        if (take === blockLen) {
-          const dataView = createView2(data);
-          for (; blockLen <= len - pos; pos += blockLen)
-            this.process(dataView, pos);
-          continue;
-        }
-        buffer.set(data.subarray(pos, pos + take), this.pos);
-        this.pos += take;
-        pos += take;
-        if (this.pos === blockLen) {
-          this.process(view, 0);
-          this.pos = 0;
-        }
-      }
-      this.length += data.length;
-      this.roundClean();
-      return this;
-    }
-    digestInto(out) {
-      exists(this);
-      output(out, this);
-      this.finished = true;
-      const { buffer, view, blockLen, isLE: isLE4 } = this;
-      let { pos } = this;
-      buffer[pos++] = 128;
-      this.buffer.subarray(pos).fill(0);
-      if (this.padOffset > blockLen - pos) {
-        this.process(view, 0);
-        pos = 0;
-      }
-      for (let i2 = pos; i2 < blockLen; i2++)
-        buffer[i2] = 0;
-      setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE4);
-      this.process(view, 0);
-      const oview = createView2(out);
-      const len = this.outputLen;
-      if (len % 4)
-        throw new Error("_sha2: outputLen should be aligned to 32bit");
-      const outLen = len / 4;
-      const state = this.get();
-      if (outLen > state.length)
-        throw new Error("_sha2: outputLen bigger than state");
-      for (let i2 = 0; i2 < outLen; i2++)
-        oview.setUint32(4 * i2, state[i2], isLE4);
-    }
-    digest() {
-      const { buffer, outputLen } = this;
-      this.digestInto(buffer);
-      const res = buffer.slice(0, outputLen);
-      this.destroy();
-      return res;
-    }
-    _cloneInto(to) {
-      to || (to = new this.constructor());
-      to.set(...this.get());
-      const { blockLen, buffer, length, finished, destroyed, pos } = this;
-      to.length = length;
-      to.pos = pos;
-      to.finished = finished;
-      to.destroyed = destroyed;
-      if (length % blockLen)
-        to.buffer.set(buffer);
-      return to;
-    }
-  };
-
-  // node_modules/@noble/curves/node_modules/@noble/hashes/esm/sha256.js
-  var Chi = (a, b, c) => a & b ^ ~a & c;
-  var Maj = (a, b, c) => a & b ^ a & c ^ b & c;
-  var SHA256_K = /* @__PURE__ */ new Uint32Array([
-    1116352408,
-    1899447441,
-    3049323471,
-    3921009573,
-    961987163,
-    1508970993,
-    2453635748,
-    2870763221,
-    3624381080,
-    310598401,
-    607225278,
-    1426881987,
-    1925078388,
-    2162078206,
-    2614888103,
-    3248222580,
-    3835390401,
-    4022224774,
-    264347078,
-    604807628,
-    770255983,
-    1249150122,
-    1555081692,
-    1996064986,
-    2554220882,
-    2821834349,
-    2952996808,
-    3210313671,
-    3336571891,
-    3584528711,
-    113926993,
-    338241895,
-    666307205,
-    773529912,
-    1294757372,
-    1396182291,
-    1695183700,
-    1986661051,
-    2177026350,
-    2456956037,
-    2730485921,
-    2820302411,
-    3259730800,
-    3345764771,
-    3516065817,
-    3600352804,
-    4094571909,
-    275423344,
-    430227734,
-    506948616,
-    659060556,
-    883997877,
-    958139571,
-    1322822218,
-    1537002063,
-    1747873779,
-    1955562222,
-    2024104815,
-    2227730452,
-    2361852424,
-    2428436474,
-    2756734187,
-    3204031479,
-    3329325298
-  ]);
-  var IV = /* @__PURE__ */ new Uint32Array([
-    1779033703,
-    3144134277,
-    1013904242,
-    2773480762,
-    1359893119,
-    2600822924,
-    528734635,
-    1541459225
-  ]);
-  var SHA256_W = /* @__PURE__ */ new Uint32Array(64);
-  var SHA256 = class extends SHA2 {
-    constructor() {
-      super(64, 32, 8, false);
-      this.A = IV[0] | 0;
-      this.B = IV[1] | 0;
-      this.C = IV[2] | 0;
-      this.D = IV[3] | 0;
-      this.E = IV[4] | 0;
-      this.F = IV[5] | 0;
-      this.G = IV[6] | 0;
-      this.H = IV[7] | 0;
-    }
-    get() {
-      const { A, B, C, D, E, F, G, H } = this;
-      return [A, B, C, D, E, F, G, H];
-    }
-    // prettier-ignore
-    set(A, B, C, D, E, F, G, H) {
-      this.A = A | 0;
-      this.B = B | 0;
-      this.C = C | 0;
-      this.D = D | 0;
-      this.E = E | 0;
-      this.F = F | 0;
-      this.G = G | 0;
-      this.H = H | 0;
-    }
-    process(view, offset) {
-      for (let i2 = 0; i2 < 16; i2++, offset += 4)
-        SHA256_W[i2] = view.getUint32(offset, false);
-      for (let i2 = 16; i2 < 64; i2++) {
-        const W15 = SHA256_W[i2 - 15];
-        const W2 = SHA256_W[i2 - 2];
-        const s0 = rotr2(W15, 7) ^ rotr2(W15, 18) ^ W15 >>> 3;
-        const s1 = rotr2(W2, 17) ^ rotr2(W2, 19) ^ W2 >>> 10;
-        SHA256_W[i2] = s1 + SHA256_W[i2 - 7] + s0 + SHA256_W[i2 - 16] | 0;
-      }
-      let { A, B, C, D, E, F, G, H } = this;
-      for (let i2 = 0; i2 < 64; i2++) {
-        const sigma1 = rotr2(E, 6) ^ rotr2(E, 11) ^ rotr2(E, 25);
-        const T1 = H + sigma1 + Chi(E, F, G) + SHA256_K[i2] + SHA256_W[i2] | 0;
-        const sigma0 = rotr2(A, 2) ^ rotr2(A, 13) ^ rotr2(A, 22);
-        const T2 = sigma0 + Maj(A, B, C) | 0;
-        H = G;
-        G = F;
-        F = E;
-        E = D + T1 | 0;
-        D = C;
-        C = B;
-        B = A;
-        A = T1 + T2 | 0;
-      }
-      A = A + this.A | 0;
-      B = B + this.B | 0;
-      C = C + this.C | 0;
-      D = D + this.D | 0;
-      E = E + this.E | 0;
-      F = F + this.F | 0;
-      G = G + this.G | 0;
-      H = H + this.H | 0;
-      this.set(A, B, C, D, E, F, G, H);
-    }
-    roundClean() {
-      SHA256_W.fill(0);
-    }
-    destroy() {
-      this.set(0, 0, 0, 0, 0, 0, 0, 0);
-      this.buffer.fill(0);
-    }
-  };
-  var sha256 = /* @__PURE__ */ wrapConstructor2(() => new SHA256());
-
-  // node_modules/@noble/curves/esm/abstract/utils.js
-  var utils_exports = {};
-  __export(utils_exports, {
-    bitGet: () => bitGet,
-    bitLen: () => bitLen,
-    bitMask: () => bitMask,
-    bitSet: () => bitSet,
-    bytesToHex: () => bytesToHex2,
-    bytesToNumberBE: () => bytesToNumberBE,
-    bytesToNumberLE: () => bytesToNumberLE,
-    concatBytes: () => concatBytes2,
-    createHmacDrbg: () => createHmacDrbg,
-    ensureBytes: () => ensureBytes,
-    equalBytes: () => equalBytes,
-    hexToBytes: () => hexToBytes,
-    hexToNumber: () => hexToNumber,
-    numberToBytesBE: () => numberToBytesBE,
-    numberToBytesLE: () => numberToBytesLE,
-    numberToHexUnpadded: () => numberToHexUnpadded,
-    numberToVarBytesBE: () => numberToVarBytesBE,
-    utf8ToBytes: () => utf8ToBytes3,
-    validateObject: () => validateObject
-  });
-  var _0n = BigInt(0);
-  var _1n = BigInt(1);
-  var _2n = BigInt(2);
-  var u8a3 = (a) => a instanceof Uint8Array;
-  var hexes2 = /* @__PURE__ */ Array.from({ length: 256 }, (_, i2) => i2.toString(16).padStart(2, "0"));
-  function bytesToHex2(bytes4) {
-    if (!u8a3(bytes4))
-      throw new Error("Uint8Array expected");
-    let hex2 = "";
-    for (let i2 = 0; i2 < bytes4.length; i2++) {
-      hex2 += hexes2[bytes4[i2]];
-    }
-    return hex2;
-  }
-  function numberToHexUnpadded(num) {
-    const hex2 = num.toString(16);
-    return hex2.length & 1 ? `0${hex2}` : hex2;
-  }
-  function hexToNumber(hex2) {
-    if (typeof hex2 !== "string")
-      throw new Error("hex string expected, got " + typeof hex2);
-    return BigInt(hex2 === "" ? "0" : `0x${hex2}`);
-  }
-  function hexToBytes(hex2) {
-    if (typeof hex2 !== "string")
-      throw new Error("hex string expected, got " + typeof hex2);
-    const len = hex2.length;
-    if (len % 2)
-      throw new Error("padded hex string expected, got unpadded hex of length " + len);
-    const array = new Uint8Array(len / 2);
-    for (let i2 = 0; i2 < array.length; i2++) {
-      const j = i2 * 2;
-      const hexByte = hex2.slice(j, j + 2);
-      const byte = Number.parseInt(hexByte, 16);
-      if (Number.isNaN(byte) || byte < 0)
-        throw new Error("Invalid byte sequence");
-      array[i2] = byte;
-    }
-    return array;
-  }
-  function bytesToNumberBE(bytes4) {
-    return hexToNumber(bytesToHex2(bytes4));
-  }
-  function bytesToNumberLE(bytes4) {
-    if (!u8a3(bytes4))
-      throw new Error("Uint8Array expected");
-    return hexToNumber(bytesToHex2(Uint8Array.from(bytes4).reverse()));
-  }
-  function numberToBytesBE(n, len) {
-    return hexToBytes(n.toString(16).padStart(len * 2, "0"));
-  }
-  function numberToBytesLE(n, len) {
-    return numberToBytesBE(n, len).reverse();
-  }
-  function numberToVarBytesBE(n) {
-    return hexToBytes(numberToHexUnpadded(n));
-  }
-  function ensureBytes(title, hex2, expectedLength) {
-    let res;
-    if (typeof hex2 === "string") {
-      try {
-        res = hexToBytes(hex2);
-      } catch (e) {
-        throw new Error(`${title} must be valid hex string, got "${hex2}". Cause: ${e}`);
-      }
-    } else if (u8a3(hex2)) {
-      res = Uint8Array.from(hex2);
-    } else {
-      throw new Error(`${title} must be hex string or Uint8Array`);
-    }
-    const len = res.length;
-    if (typeof expectedLength === "number" && len !== expectedLength)
-      throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);
-    return res;
-  }
-  function concatBytes2(...arrays) {
-    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));
-    let pad = 0;
-    arrays.forEach((a) => {
-      if (!u8a3(a))
-        throw new Error("Uint8Array expected");
-      r.set(a, pad);
-      pad += a.length;
-    });
-    return r;
-  }
-  function equalBytes(b1, b2) {
-    if (b1.length !== b2.length)
-      return false;
-    for (let i2 = 0; i2 < b1.length; i2++)
-      if (b1[i2] !== b2[i2])
-        return false;
-    return true;
-  }
-  function utf8ToBytes3(str) {
-    if (typeof str !== "string")
-      throw new Error(`utf8ToBytes expected string, got ${typeof str}`);
-    return new Uint8Array(new TextEncoder().encode(str));
-  }
-  function bitLen(n) {
-    let len;
-    for (len = 0; n > _0n; n >>= _1n, len += 1)
-      ;
-    return len;
-  }
-  function bitGet(n, pos) {
-    return n >> BigInt(pos) & _1n;
-  }
-  var bitSet = (n, pos, value) => {
-    return n | (value ? _1n : _0n) << BigInt(pos);
-  };
-  var bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;
-  var u8n = (data) => new Uint8Array(data);
-  var u8fr = (arr) => Uint8Array.from(arr);
-  function createHmacDrbg(hashLen, qByteLen, hmacFn) {
-    if (typeof hashLen !== "number" || hashLen < 2)
-      throw new Error("hashLen must be a number");
-    if (typeof qByteLen !== "number" || qByteLen < 2)
-      throw new Error("qByteLen must be a number");
-    if (typeof hmacFn !== "function")
-      throw new Error("hmacFn must be a function");
-    let v = u8n(hashLen);
-    let k = u8n(hashLen);
-    let i2 = 0;
-    const reset = () => {
-      v.fill(1);
-      k.fill(0);
-      i2 = 0;
-    };
-    const h = (...b) => hmacFn(k, v, ...b);
-    const reseed = (seed = u8n()) => {
-      k = h(u8fr([0]), seed);
-      v = h();
-      if (seed.length === 0)
-        return;
-      k = h(u8fr([1]), seed);
-      v = h();
-    };
-    const gen = () => {
-      if (i2++ >= 1e3)
-        throw new Error("drbg: tried 1000 values");
-      let len = 0;
-      const out = [];
-      while (len < qByteLen) {
-        v = h();
-        const sl = v.slice();
-        out.push(sl);
-        len += v.length;
-      }
-      return concatBytes2(...out);
-    };
-    const genUntil = (seed, pred) => {
-      reset();
-      reseed(seed);
-      let res = void 0;
-      while (!(res = pred(gen())))
-        reseed();
-      reset();
-      return res;
-    };
-    return genUntil;
-  }
-  var validatorFns = {
-    bigint: (val) => typeof val === "bigint",
-    function: (val) => typeof val === "function",
-    boolean: (val) => typeof val === "boolean",
-    string: (val) => typeof val === "string",
-    stringOrUint8Array: (val) => typeof val === "string" || val instanceof Uint8Array,
-    isSafeInteger: (val) => Number.isSafeInteger(val),
-    array: (val) => Array.isArray(val),
-    field: (val, object) => object.Fp.isValid(val),
-    hash: (val) => typeof val === "function" && Number.isSafeInteger(val.outputLen)
-  };
-  function validateObject(object, validators, optValidators = {}) {
-    const checkField = (fieldName, type, isOptional) => {
-      const checkVal = validatorFns[type];
-      if (typeof checkVal !== "function")
-        throw new Error(`Invalid validator "${type}", expected function`);
-      const val = object[fieldName];
-      if (isOptional && val === void 0)
-        return;
-      if (!checkVal(val, object)) {
-        throw new Error(`Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`);
-      }
-    };
-    for (const [fieldName, type] of Object.entries(validators))
-      checkField(fieldName, type, false);
-    for (const [fieldName, type] of Object.entries(optValidators))
-      checkField(fieldName, type, true);
-    return object;
-  }
-
-  // node_modules/@noble/curves/esm/abstract/modular.js
-  var _0n2 = BigInt(0);
-  var _1n2 = BigInt(1);
-  var _2n2 = BigInt(2);
-  var _3n = BigInt(3);
-  var _4n = BigInt(4);
-  var _5n = BigInt(5);
-  var _8n = BigInt(8);
-  var _9n = BigInt(9);
-  var _16n = BigInt(16);
-  function mod(a, b) {
-    const result = a % b;
-    return result >= _0n2 ? result : b + result;
-  }
-  function pow(num, power, modulo) {
-    if (modulo <= _0n2 || power < _0n2)
-      throw new Error("Expected power/modulo > 0");
-    if (modulo === _1n2)
-      return _0n2;
-    let res = _1n2;
-    while (power > _0n2) {
-      if (power & _1n2)
-        res = res * num % modulo;
-      num = num * num % modulo;
-      power >>= _1n2;
-    }
-    return res;
-  }
-  function pow2(x, power, modulo) {
-    let res = x;
-    while (power-- > _0n2) {
-      res *= res;
-      res %= modulo;
-    }
-    return res;
-  }
-  function invert(number4, modulo) {
-    if (number4 === _0n2 || modulo <= _0n2) {
-      throw new Error(`invert: expected positive integers, got n=${number4} mod=${modulo}`);
-    }
-    let a = mod(number4, modulo);
-    let b = modulo;
-    let x = _0n2, y = _1n2, u = _1n2, v = _0n2;
-    while (a !== _0n2) {
-      const q = b / a;
-      const r = b % a;
-      const m = x - u * q;
-      const n = y - v * q;
-      b = a, a = r, x = u, y = v, u = m, v = n;
-    }
-    const gcd2 = b;
-    if (gcd2 !== _1n2)
-      throw new Error("invert: does not exist");
-    return mod(x, modulo);
-  }
-  function tonelliShanks(P) {
-    const legendreC = (P - _1n2) / _2n2;
-    let Q, S, Z;
-    for (Q = P - _1n2, S = 0; Q % _2n2 === _0n2; Q /= _2n2, S++)
-      ;
-    for (Z = _2n2; Z < P && pow(Z, legendreC, P) !== P - _1n2; Z++)
-      ;
-    if (S === 1) {
-      const p1div4 = (P + _1n2) / _4n;
-      return function tonelliFast(Fp2, n) {
-        const root = Fp2.pow(n, p1div4);
-        if (!Fp2.eql(Fp2.sqr(root), n))
-          throw new Error("Cannot find square root");
-        return root;
-      };
-    }
-    const Q1div2 = (Q + _1n2) / _2n2;
-    return function tonelliSlow(Fp2, n) {
-      if (Fp2.pow(n, legendreC) === Fp2.neg(Fp2.ONE))
-        throw new Error("Cannot find square root");
-      let r = S;
-      let g = Fp2.pow(Fp2.mul(Fp2.ONE, Z), Q);
-      let x = Fp2.pow(n, Q1div2);
-      let b = Fp2.pow(n, Q);
-      while (!Fp2.eql(b, Fp2.ONE)) {
-        if (Fp2.eql(b, Fp2.ZERO))
-          return Fp2.ZERO;
-        let m = 1;
-        for (let t2 = Fp2.sqr(b); m < r; m++) {
-          if (Fp2.eql(t2, Fp2.ONE))
-            break;
-          t2 = Fp2.sqr(t2);
-        }
-        const ge2 = Fp2.pow(g, _1n2 << BigInt(r - m - 1));
-        g = Fp2.sqr(ge2);
-        x = Fp2.mul(x, ge2);
-        b = Fp2.mul(b, g);
-        r = m;
-      }
-      return x;
-    };
-  }
-  function FpSqrt(P) {
-    if (P % _4n === _3n) {
-      const p1div4 = (P + _1n2) / _4n;
-      return function sqrt3mod4(Fp2, n) {
-        const root = Fp2.pow(n, p1div4);
-        if (!Fp2.eql(Fp2.sqr(root), n))
-          throw new Error("Cannot find square root");
-        return root;
-      };
-    }
-    if (P % _8n === _5n) {
-      const c1 = (P - _5n) / _8n;
-      return function sqrt5mod8(Fp2, n) {
-        const n2 = Fp2.mul(n, _2n2);
-        const v = Fp2.pow(n2, c1);
-        const nv = Fp2.mul(n, v);
-        const i2 = Fp2.mul(Fp2.mul(nv, _2n2), v);
-        const root = Fp2.mul(nv, Fp2.sub(i2, Fp2.ONE));
-        if (!Fp2.eql(Fp2.sqr(root), n))
-          throw new Error("Cannot find square root");
-        return root;
-      };
-    }
-    if (P % _16n === _9n) {
-    }
-    return tonelliShanks(P);
-  }
-  var FIELD_FIELDS = [
-    "create",
-    "isValid",
-    "is0",
-    "neg",
-    "inv",
-    "sqrt",
-    "sqr",
-    "eql",
-    "add",
-    "sub",
-    "mul",
-    "pow",
-    "div",
-    "addN",
-    "subN",
-    "mulN",
-    "sqrN"
-  ];
-  function validateField(field) {
-    const initial = {
-      ORDER: "bigint",
-      MASK: "bigint",
-      BYTES: "isSafeInteger",
-      BITS: "isSafeInteger"
-    };
-    const opts = FIELD_FIELDS.reduce((map, val) => {
-      map[val] = "function";
-      return map;
-    }, initial);
-    return validateObject(field, opts);
-  }
-  function FpPow(f, num, power) {
-    if (power < _0n2)
-      throw new Error("Expected power > 0");
-    if (power === _0n2)
-      return f.ONE;
-    if (power === _1n2)
-      return num;
-    let p = f.ONE;
-    let d = num;
-    while (power > _0n2) {
-      if (power & _1n2)
-        p = f.mul(p, d);
-      d = f.sqr(d);
-      power >>= _1n2;
-    }
-    return p;
-  }
-  function FpInvertBatch(f, nums) {
-    const tmp = new Array(nums.length);
-    const lastMultiplied = nums.reduce((acc, num, i2) => {
-      if (f.is0(num))
-        return acc;
-      tmp[i2] = acc;
-      return f.mul(acc, num);
-    }, f.ONE);
-    const inverted = f.inv(lastMultiplied);
-    nums.reduceRight((acc, num, i2) => {
-      if (f.is0(num))
-        return acc;
-      tmp[i2] = f.mul(acc, tmp[i2]);
-      return f.mul(acc, num);
-    }, inverted);
-    return tmp;
-  }
-  function nLength(n, nBitLength) {
-    const _nBitLength = nBitLength !== void 0 ? nBitLength : n.toString(2).length;
-    const nByteLength = Math.ceil(_nBitLength / 8);
-    return { nBitLength: _nBitLength, nByteLength };
-  }
-  function Field(ORDER, bitLen2, isLE4 = false, redef = {}) {
-    if (ORDER <= _0n2)
-      throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);
-    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen2);
-    if (BYTES > 2048)
-      throw new Error("Field lengths over 2048 bytes are not supported");
-    const sqrtP = FpSqrt(ORDER);
-    const f = Object.freeze({
-      ORDER,
-      BITS,
-      BYTES,
-      MASK: bitMask(BITS),
-      ZERO: _0n2,
-      ONE: _1n2,
-      create: (num) => mod(num, ORDER),
-      isValid: (num) => {
-        if (typeof num !== "bigint")
-          throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);
-        return _0n2 <= num && num < ORDER;
-      },
-      is0: (num) => num === _0n2,
-      isOdd: (num) => (num & _1n2) === _1n2,
-      neg: (num) => mod(-num, ORDER),
-      eql: (lhs, rhs) => lhs === rhs,
-      sqr: (num) => mod(num * num, ORDER),
-      add: (lhs, rhs) => mod(lhs + rhs, ORDER),
-      sub: (lhs, rhs) => mod(lhs - rhs, ORDER),
-      mul: (lhs, rhs) => mod(lhs * rhs, ORDER),
-      pow: (num, power) => FpPow(f, num, power),
-      div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),
-      // Same as above, but doesn't normalize
-      sqrN: (num) => num * num,
-      addN: (lhs, rhs) => lhs + rhs,
-      subN: (lhs, rhs) => lhs - rhs,
-      mulN: (lhs, rhs) => lhs * rhs,
-      inv: (num) => invert(num, ORDER),
-      sqrt: redef.sqrt || ((n) => sqrtP(f, n)),
-      invertBatch: (lst) => FpInvertBatch(f, lst),
-      // TODO: do we really need constant cmov?
-      // We don't have const-time bigints anyway, so probably will be not very useful
-      cmov: (a, b, c) => c ? b : a,
-      toBytes: (num) => isLE4 ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES),
-      fromBytes: (bytes4) => {
-        if (bytes4.length !== BYTES)
-          throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes4.length}`);
-        return isLE4 ? bytesToNumberLE(bytes4) : bytesToNumberBE(bytes4);
-      }
-    });
-    return Object.freeze(f);
-  }
-  function getFieldBytesLength(fieldOrder) {
-    if (typeof fieldOrder !== "bigint")
-      throw new Error("field order must be bigint");
-    const bitLength = fieldOrder.toString(2).length;
-    return Math.ceil(bitLength / 8);
-  }
-  function getMinHashLength(fieldOrder) {
-    const length = getFieldBytesLength(fieldOrder);
-    return length + Math.ceil(length / 2);
-  }
-  function mapHashToField(key, fieldOrder, isLE4 = false) {
-    const len = key.length;
-    const fieldLen = getFieldBytesLength(fieldOrder);
-    const minLen = getMinHashLength(fieldOrder);
-    if (len < 16 || len < minLen || len > 1024)
-      throw new Error(`expected ${minLen}-1024 bytes of input, got ${len}`);
-    const num = isLE4 ? bytesToNumberBE(key) : bytesToNumberLE(key);
-    const reduced = mod(num, fieldOrder - _1n2) + _1n2;
-    return isLE4 ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);
-  }
-
-  // node_modules/@noble/curves/esm/abstract/curve.js
-  var _0n3 = BigInt(0);
-  var _1n3 = BigInt(1);
-  function wNAF(c, bits) {
-    const constTimeNegate = (condition, item) => {
-      const neg = item.negate();
-      return condition ? neg : item;
-    };
-    const opts = (W) => {
-      const windows = Math.ceil(bits / W) + 1;
-      const windowSize = 2 ** (W - 1);
-      return { windows, windowSize };
-    };
-    return {
-      constTimeNegate,
-      // non-const time multiplication ladder
-      unsafeLadder(elm, n) {
-        let p = c.ZERO;
-        let d = elm;
-        while (n > _0n3) {
-          if (n & _1n3)
-            p = p.add(d);
-          d = d.double();
-          n >>= _1n3;
-        }
-        return p;
-      },
-      /**
-       * Creates a wNAF precomputation window. Used for caching.
-       * Default window size is set by `utils.precompute()` and is equal to 8.
-       * Number of precomputed points depends on the curve size:
-       * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-       * - 𝑊 is the window size
-       * - 𝑛 is the bitlength of the curve order.
-       * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-       * @returns precomputed point tables flattened to a single array
-       */
-      precomputeWindow(elm, W) {
-        const { windows, windowSize } = opts(W);
-        const points = [];
-        let p = elm;
-        let base = p;
-        for (let window2 = 0; window2 < windows; window2++) {
-          base = p;
-          points.push(base);
-          for (let i2 = 1; i2 < windowSize; i2++) {
-            base = base.add(p);
-            points.push(base);
-          }
-          p = base.double();
-        }
-        return points;
-      },
-      /**
-       * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-       * @param W window size
-       * @param precomputes precomputed tables
-       * @param n scalar (we don't check here, but should be less than curve order)
-       * @returns real and fake (for const-time) points
-       */
-      wNAF(W, precomputes, n) {
-        const { windows, windowSize } = opts(W);
-        let p = c.ZERO;
-        let f = c.BASE;
-        const mask = BigInt(2 ** W - 1);
-        const maxNumber = 2 ** W;
-        const shiftBy = BigInt(W);
-        for (let window2 = 0; window2 < windows; window2++) {
-          const offset = window2 * windowSize;
-          let wbits = Number(n & mask);
-          n >>= shiftBy;
-          if (wbits > windowSize) {
-            wbits -= maxNumber;
-            n += _1n3;
-          }
-          const offset1 = offset;
-          const offset2 = offset + Math.abs(wbits) - 1;
-          const cond1 = window2 % 2 !== 0;
-          const cond2 = wbits < 0;
-          if (wbits === 0) {
-            f = f.add(constTimeNegate(cond1, precomputes[offset1]));
-          } else {
-            p = p.add(constTimeNegate(cond2, precomputes[offset2]));
-          }
-        }
-        return { p, f };
-      },
-      wNAFCached(P, precomputesMap, n, transform) {
-        const W = P._WINDOW_SIZE || 1;
-        let comp = precomputesMap.get(P);
-        if (!comp) {
-          comp = this.precomputeWindow(P, W);
-          if (W !== 1) {
-            precomputesMap.set(P, transform(comp));
-          }
-        }
-        return this.wNAF(W, comp, n);
-      }
-    };
-  }
-  function validateBasic(curve) {
-    validateField(curve.Fp);
-    validateObject(curve, {
-      n: "bigint",
-      h: "bigint",
-      Gx: "field",
-      Gy: "field"
-    }, {
-      nBitLength: "isSafeInteger",
-      nByteLength: "isSafeInteger"
-    });
-    return Object.freeze({
-      ...nLength(curve.n, curve.nBitLength),
-      ...curve,
-      ...{ p: curve.Fp.ORDER }
-    });
-  }
-
-  // node_modules/@noble/curves/esm/abstract/weierstrass.js
-  function validatePointOpts(curve) {
-    const opts = validateBasic(curve);
-    validateObject(opts, {
-      a: "field",
-      b: "field"
-    }, {
-      allowedPrivateKeyLengths: "array",
-      wrapPrivateKey: "boolean",
-      isTorsionFree: "function",
-      clearCofactor: "function",
-      allowInfinityPoint: "boolean",
-      fromBytes: "function",
-      toBytes: "function"
-    });
-    const { endo, Fp: Fp2, a } = opts;
-    if (endo) {
-      if (!Fp2.eql(a, Fp2.ZERO)) {
-        throw new Error("Endomorphism can only be defined for Koblitz curves that have a=0");
-      }
-      if (typeof endo !== "object" || typeof endo.beta !== "bigint" || typeof endo.splitScalar !== "function") {
-        throw new Error("Expected endomorphism with beta: bigint and splitScalar: function");
-      }
-    }
-    return Object.freeze({ ...opts });
-  }
-  var { bytesToNumberBE: b2n, hexToBytes: h2b } = utils_exports;
-  var DER = {
-    // asn.1 DER encoding utils
-    Err: class DERErr extends Error {
-      constructor(m = "") {
-        super(m);
-      }
-    },
-    _parseInt(data) {
-      const { Err: E } = DER;
-      if (data.length < 2 || data[0] !== 2)
-        throw new E("Invalid signature integer tag");
-      const len = data[1];
-      const res = data.subarray(2, len + 2);
-      if (!len || res.length !== len)
-        throw new E("Invalid signature integer: wrong length");
-      if (res[0] & 128)
-        throw new E("Invalid signature integer: negative");
-      if (res[0] === 0 && !(res[1] & 128))
-        throw new E("Invalid signature integer: unnecessary leading zero");
-      return { d: b2n(res), l: data.subarray(len + 2) };
-    },
-    toSig(hex2) {
-      const { Err: E } = DER;
-      const data = typeof hex2 === "string" ? h2b(hex2) : hex2;
-      if (!(data instanceof Uint8Array))
-        throw new Error("ui8a expected");
-      let l = data.length;
-      if (l < 2 || data[0] != 48)
-        throw new E("Invalid signature tag");
-      if (data[1] !== l - 2)
-        throw new E("Invalid signature: incorrect length");
-      const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));
-      const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);
-      if (rBytesLeft.length)
-        throw new E("Invalid signature: left bytes after parsing");
-      return { r, s };
-    },
-    hexFromSig(sig) {
-      const slice = (s2) => Number.parseInt(s2[0], 16) & 8 ? "00" + s2 : s2;
-      const h = (num) => {
-        const hex2 = num.toString(16);
-        return hex2.length & 1 ? `0${hex2}` : hex2;
-      };
-      const s = slice(h(sig.s));
-      const r = slice(h(sig.r));
-      const shl = s.length / 2;
-      const rhl = r.length / 2;
-      const sl = h(shl);
-      const rl = h(rhl);
-      return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;
-    }
-  };
-  var _0n4 = BigInt(0);
-  var _1n4 = BigInt(1);
-  var _2n3 = BigInt(2);
-  var _3n2 = BigInt(3);
-  var _4n2 = BigInt(4);
-  function weierstrassPoints(opts) {
-    const CURVE = validatePointOpts(opts);
-    const { Fp: Fp2 } = CURVE;
-    const toBytes4 = CURVE.toBytes || ((_c, point, _isCompressed) => {
-      const a = point.toAffine();
-      return concatBytes2(Uint8Array.from([4]), Fp2.toBytes(a.x), Fp2.toBytes(a.y));
-    });
-    const fromBytes = CURVE.fromBytes || ((bytes4) => {
-      const tail = bytes4.subarray(1);
-      const x = Fp2.fromBytes(tail.subarray(0, Fp2.BYTES));
-      const y = Fp2.fromBytes(tail.subarray(Fp2.BYTES, 2 * Fp2.BYTES));
-      return { x, y };
-    });
-    function weierstrassEquation(x) {
-      const { a, b } = CURVE;
-      const x2 = Fp2.sqr(x);
-      const x3 = Fp2.mul(x2, x);
-      return Fp2.add(Fp2.add(x3, Fp2.mul(x, a)), b);
-    }
-    if (!Fp2.eql(Fp2.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))
-      throw new Error("bad generator point: equation left != right");
-    function isWithinCurveOrder(num) {
-      return typeof num === "bigint" && _0n4 < num && num < CURVE.n;
-    }
-    function assertGE(num) {
-      if (!isWithinCurveOrder(num))
-        throw new Error("Expected valid bigint: 0 < bigint < curve.n");
-    }
-    function normPrivateKeyToScalar(key) {
-      const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;
-      if (lengths && typeof key !== "bigint") {
-        if (key instanceof Uint8Array)
-          key = bytesToHex2(key);
-        if (typeof key !== "string" || !lengths.includes(key.length))
-          throw new Error("Invalid key");
-        key = key.padStart(nByteLength * 2, "0");
-      }
-      let num;
-      try {
-        num = typeof key === "bigint" ? key : bytesToNumberBE(ensureBytes("private key", key, nByteLength));
-      } catch (error) {
-        throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);
-      }
-      if (wrapPrivateKey)
-        num = mod(num, n);
-      assertGE(num);
-      return num;
-    }
-    const pointPrecomputes = /* @__PURE__ */ new Map();
-    function assertPrjPoint(other) {
-      if (!(other instanceof Point2))
-        throw new Error("ProjectivePoint expected");
-    }
-    class Point2 {
-      constructor(px, py, pz) {
-        this.px = px;
-        this.py = py;
-        this.pz = pz;
-        if (px == null || !Fp2.isValid(px))
-          throw new Error("x required");
-        if (py == null || !Fp2.isValid(py))
-          throw new Error("y required");
-        if (pz == null || !Fp2.isValid(pz))
-          throw new Error("z required");
-      }
-      // Does not validate if the point is on-curve.
-      // Use fromHex instead, or call assertValidity() later.
-      static fromAffine(p) {
-        const { x, y } = p || {};
-        if (!p || !Fp2.isValid(x) || !Fp2.isValid(y))
-          throw new Error("invalid affine point");
-        if (p instanceof Point2)
-          throw new Error("projective point not allowed");
-        const is0 = (i2) => Fp2.eql(i2, Fp2.ZERO);
-        if (is0(x) && is0(y))
-          return Point2.ZERO;
-        return new Point2(x, y, Fp2.ONE);
-      }
-      get x() {
-        return this.toAffine().x;
-      }
-      get y() {
-        return this.toAffine().y;
-      }
-      /**
-       * Takes a bunch of Projective Points but executes only one
-       * inversion on all of them. Inversion is very slow operation,
-       * so this improves performance massively.
-       * Optimization: converts a list of projective points to a list of identical points with Z=1.
-       */
-      static normalizeZ(points) {
-        const toInv = Fp2.invertBatch(points.map((p) => p.pz));
-        return points.map((p, i2) => p.toAffine(toInv[i2])).map(Point2.fromAffine);
-      }
-      /**
-       * Converts hash string or Uint8Array to Point.
-       * @param hex short/long ECDSA hex
-       */
-      static fromHex(hex2) {
-        const P = Point2.fromAffine(fromBytes(ensureBytes("pointHex", hex2)));
-        P.assertValidity();
-        return P;
-      }
-      // Multiplies generator point by privateKey.
-      static fromPrivateKey(privateKey) {
-        return Point2.BASE.multiply(normPrivateKeyToScalar(privateKey));
-      }
-      // "Private method", don't use it directly
-      _setWindowSize(windowSize) {
-        this._WINDOW_SIZE = windowSize;
-        pointPrecomputes.delete(this);
-      }
-      // A point on curve is valid if it conforms to equation.
-      assertValidity() {
-        if (this.is0()) {
-          if (CURVE.allowInfinityPoint && !Fp2.is0(this.py))
-            return;
-          throw new Error("bad point: ZERO");
-        }
-        const { x, y } = this.toAffine();
-        if (!Fp2.isValid(x) || !Fp2.isValid(y))
-          throw new Error("bad point: x or y not FE");
-        const left = Fp2.sqr(y);
-        const right = weierstrassEquation(x);
-        if (!Fp2.eql(left, right))
-          throw new Error("bad point: equation left != right");
-        if (!this.isTorsionFree())
-          throw new Error("bad point: not in prime-order subgroup");
-      }
-      hasEvenY() {
-        const { y } = this.toAffine();
-        if (Fp2.isOdd)
-          return !Fp2.isOdd(y);
-        throw new Error("Field doesn't support isOdd");
-      }
-      /**
-       * Compare one point to another.
-       */
-      equals(other) {
-        assertPrjPoint(other);
-        const { px: X1, py: Y1, pz: Z1 } = this;
-        const { px: X2, py: Y2, pz: Z2 } = other;
-        const U1 = Fp2.eql(Fp2.mul(X1, Z2), Fp2.mul(X2, Z1));
-        const U2 = Fp2.eql(Fp2.mul(Y1, Z2), Fp2.mul(Y2, Z1));
-        return U1 && U2;
-      }
-      /**
-       * Flips point to one corresponding to (x, -y) in Affine coordinates.
-       */
-      negate() {
-        return new Point2(this.px, Fp2.neg(this.py), this.pz);
-      }
-      // Renes-Costello-Batina exception-free doubling formula.
-      // There is 30% faster Jacobian formula, but it is not complete.
-      // https://eprint.iacr.org/2015/1060, algorithm 3
-      // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
-      double() {
-        const { a, b } = CURVE;
-        const b3 = Fp2.mul(b, _3n2);
-        const { px: X1, py: Y1, pz: Z1 } = this;
-        let X3 = Fp2.ZERO, Y3 = Fp2.ZERO, Z3 = Fp2.ZERO;
-        let t0 = Fp2.mul(X1, X1);
-        let t1 = Fp2.mul(Y1, Y1);
-        let t2 = Fp2.mul(Z1, Z1);
-        let t3 = Fp2.mul(X1, Y1);
-        t3 = Fp2.add(t3, t3);
-        Z3 = Fp2.mul(X1, Z1);
-        Z3 = Fp2.add(Z3, Z3);
-        X3 = Fp2.mul(a, Z3);
-        Y3 = Fp2.mul(b3, t2);
-        Y3 = Fp2.add(X3, Y3);
-        X3 = Fp2.sub(t1, Y3);
-        Y3 = Fp2.add(t1, Y3);
-        Y3 = Fp2.mul(X3, Y3);
-        X3 = Fp2.mul(t3, X3);
-        Z3 = Fp2.mul(b3, Z3);
-        t2 = Fp2.mul(a, t2);
-        t3 = Fp2.sub(t0, t2);
-        t3 = Fp2.mul(a, t3);
-        t3 = Fp2.add(t3, Z3);
-        Z3 = Fp2.add(t0, t0);
-        t0 = Fp2.add(Z3, t0);
-        t0 = Fp2.add(t0, t2);
-        t0 = Fp2.mul(t0, t3);
-        Y3 = Fp2.add(Y3, t0);
-        t2 = Fp2.mul(Y1, Z1);
-        t2 = Fp2.add(t2, t2);
-        t0 = Fp2.mul(t2, t3);
-        X3 = Fp2.sub(X3, t0);
-        Z3 = Fp2.mul(t2, t1);
-        Z3 = Fp2.add(Z3, Z3);
-        Z3 = Fp2.add(Z3, Z3);
-        return new Point2(X3, Y3, Z3);
-      }
-      // Renes-Costello-Batina exception-free addition formula.
-      // There is 30% faster Jacobian formula, but it is not complete.
-      // https://eprint.iacr.org/2015/1060, algorithm 1
-      // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
-      add(other) {
-        assertPrjPoint(other);
-        const { px: X1, py: Y1, pz: Z1 } = this;
-        const { px: X2, py: Y2, pz: Z2 } = other;
-        let X3 = Fp2.ZERO, Y3 = Fp2.ZERO, Z3 = Fp2.ZERO;
-        const a = CURVE.a;
-        const b3 = Fp2.mul(CURVE.b, _3n2);
-        let t0 = Fp2.mul(X1, X2);
-        let t1 = Fp2.mul(Y1, Y2);
-        let t2 = Fp2.mul(Z1, Z2);
-        let t3 = Fp2.add(X1, Y1);
-        let t4 = Fp2.add(X2, Y2);
-        t3 = Fp2.mul(t3, t4);
-        t4 = Fp2.add(t0, t1);
-        t3 = Fp2.sub(t3, t4);
-        t4 = Fp2.add(X1, Z1);
-        let t5 = Fp2.add(X2, Z2);
-        t4 = Fp2.mul(t4, t5);
-        t5 = Fp2.add(t0, t2);
-        t4 = Fp2.sub(t4, t5);
-        t5 = Fp2.add(Y1, Z1);
-        X3 = Fp2.add(Y2, Z2);
-        t5 = Fp2.mul(t5, X3);
-        X3 = Fp2.add(t1, t2);
-        t5 = Fp2.sub(t5, X3);
-        Z3 = Fp2.mul(a, t4);
-        X3 = Fp2.mul(b3, t2);
-        Z3 = Fp2.add(X3, Z3);
-        X3 = Fp2.sub(t1, Z3);
-        Z3 = Fp2.add(t1, Z3);
-        Y3 = Fp2.mul(X3, Z3);
-        t1 = Fp2.add(t0, t0);
-        t1 = Fp2.add(t1, t0);
-        t2 = Fp2.mul(a, t2);
-        t4 = Fp2.mul(b3, t4);
-        t1 = Fp2.add(t1, t2);
-        t2 = Fp2.sub(t0, t2);
-        t2 = Fp2.mul(a, t2);
-        t4 = Fp2.add(t4, t2);
-        t0 = Fp2.mul(t1, t4);
-        Y3 = Fp2.add(Y3, t0);
-        t0 = Fp2.mul(t5, t4);
-        X3 = Fp2.mul(t3, X3);
-        X3 = Fp2.sub(X3, t0);
-        t0 = Fp2.mul(t3, t1);
-        Z3 = Fp2.mul(t5, Z3);
-        Z3 = Fp2.add(Z3, t0);
-        return new Point2(X3, Y3, Z3);
-      }
-      subtract(other) {
-        return this.add(other.negate());
-      }
-      is0() {
-        return this.equals(Point2.ZERO);
-      }
-      wNAF(n) {
-        return wnaf.wNAFCached(this, pointPrecomputes, n, (comp) => {
-          const toInv = Fp2.invertBatch(comp.map((p) => p.pz));
-          return comp.map((p, i2) => p.toAffine(toInv[i2])).map(Point2.fromAffine);
-        });
-      }
-      /**
-       * Non-constant-time multiplication. Uses double-and-add algorithm.
-       * It's faster, but should only be used when you don't care about
-       * an exposed private key e.g. sig verification, which works over *public* keys.
-       */
-      multiplyUnsafe(n) {
-        const I = Point2.ZERO;
-        if (n === _0n4)
-          return I;
-        assertGE(n);
-        if (n === _1n4)
-          return this;
-        const { endo } = CURVE;
-        if (!endo)
-          return wnaf.unsafeLadder(this, n);
-        let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);
-        let k1p = I;
-        let k2p = I;
-        let d = this;
-        while (k1 > _0n4 || k2 > _0n4) {
-          if (k1 & _1n4)
-            k1p = k1p.add(d);
-          if (k2 & _1n4)
-            k2p = k2p.add(d);
-          d = d.double();
-          k1 >>= _1n4;
-          k2 >>= _1n4;
-        }
-        if (k1neg)
-          k1p = k1p.negate();
-        if (k2neg)
-          k2p = k2p.negate();
-        k2p = new Point2(Fp2.mul(k2p.px, endo.beta), k2p.py, k2p.pz);
-        return k1p.add(k2p);
-      }
-      /**
-       * Constant time multiplication.
-       * Uses wNAF method. Windowed method may be 10% faster,
-       * but takes 2x longer to generate and consumes 2x memory.
-       * Uses precomputes when available.
-       * Uses endomorphism for Koblitz curves.
-       * @param scalar by which the point would be multiplied
-       * @returns New point
-       */
-      multiply(scalar) {
-        assertGE(scalar);
-        let n = scalar;
-        let point, fake;
-        const { endo } = CURVE;
-        if (endo) {
-          const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);
-          let { p: k1p, f: f1p } = this.wNAF(k1);
-          let { p: k2p, f: f2p } = this.wNAF(k2);
-          k1p = wnaf.constTimeNegate(k1neg, k1p);
-          k2p = wnaf.constTimeNegate(k2neg, k2p);
-          k2p = new Point2(Fp2.mul(k2p.px, endo.beta), k2p.py, k2p.pz);
-          point = k1p.add(k2p);
-          fake = f1p.add(f2p);
-        } else {
-          const { p, f } = this.wNAF(n);
-          point = p;
-          fake = f;
-        }
-        return Point2.normalizeZ([point, fake])[0];
-      }
-      /**
-       * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
-       * Not using Strauss-Shamir trick: precomputation tables are faster.
-       * The trick could be useful if both P and Q are not G (not in our case).
-       * @returns non-zero affine point
-       */
-      multiplyAndAddUnsafe(Q, a, b) {
-        const G = Point2.BASE;
-        const mul3 = (P, a2) => a2 === _0n4 || a2 === _1n4 || !P.equals(G) ? P.multiplyUnsafe(a2) : P.multiply(a2);
-        const sum = mul3(this, a).add(mul3(Q, b));
-        return sum.is0() ? void 0 : sum;
-      }
-      // Converts Projective point to affine (x, y) coordinates.
-      // Can accept precomputed Z^-1 - for example, from invertBatch.
-      // (x, y, z) ∋ (x=x/z, y=y/z)
-      toAffine(iz) {
-        const { px: x, py: y, pz: z } = this;
-        const is0 = this.is0();
-        if (iz == null)
-          iz = is0 ? Fp2.ONE : Fp2.inv(z);
-        const ax = Fp2.mul(x, iz);
-        const ay = Fp2.mul(y, iz);
-        const zz = Fp2.mul(z, iz);
-        if (is0)
-          return { x: Fp2.ZERO, y: Fp2.ZERO };
-        if (!Fp2.eql(zz, Fp2.ONE))
-          throw new Error("invZ was invalid");
-        return { x: ax, y: ay };
-      }
-      isTorsionFree() {
-        const { h: cofactor, isTorsionFree } = CURVE;
-        if (cofactor === _1n4)
-          return true;
-        if (isTorsionFree)
-          return isTorsionFree(Point2, this);
-        throw new Error("isTorsionFree() has not been declared for the elliptic curve");
-      }
-      clearCofactor() {
-        const { h: cofactor, clearCofactor } = CURVE;
-        if (cofactor === _1n4)
-          return this;
-        if (clearCofactor)
-          return clearCofactor(Point2, this);
-        return this.multiplyUnsafe(CURVE.h);
-      }
-      toRawBytes(isCompressed = true) {
-        this.assertValidity();
-        return toBytes4(Point2, this, isCompressed);
-      }
-      toHex(isCompressed = true) {
-        return bytesToHex2(this.toRawBytes(isCompressed));
-      }
-    }
-    Point2.BASE = new Point2(CURVE.Gx, CURVE.Gy, Fp2.ONE);
-    Point2.ZERO = new Point2(Fp2.ZERO, Fp2.ONE, Fp2.ZERO);
-    const _bits = CURVE.nBitLength;
-    const wnaf = wNAF(Point2, CURVE.endo ? Math.ceil(_bits / 2) : _bits);
-    return {
-      CURVE,
-      ProjectivePoint: Point2,
-      normPrivateKeyToScalar,
-      weierstrassEquation,
-      isWithinCurveOrder
-    };
-  }
-  function validateOpts(curve) {
-    const opts = validateBasic(curve);
-    validateObject(opts, {
-      hash: "hash",
-      hmac: "function",
-      randomBytes: "function"
-    }, {
-      bits2int: "function",
-      bits2int_modN: "function",
-      lowS: "boolean"
-    });
-    return Object.freeze({ lowS: true, ...opts });
-  }
-  function weierstrass(curveDef) {
-    const CURVE = validateOpts(curveDef);
-    const { Fp: Fp2, n: CURVE_ORDER } = CURVE;
-    const compressedLen = Fp2.BYTES + 1;
-    const uncompressedLen = 2 * Fp2.BYTES + 1;
-    function isValidFieldElement(num) {
-      return _0n4 < num && num < Fp2.ORDER;
-    }
-    function modN2(a) {
-      return mod(a, CURVE_ORDER);
-    }
-    function invN(a) {
-      return invert(a, CURVE_ORDER);
-    }
-    const { ProjectivePoint: Point2, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder } = weierstrassPoints({
-      ...CURVE,
-      toBytes(_c, point, isCompressed) {
-        const a = point.toAffine();
-        const x = Fp2.toBytes(a.x);
-        const cat = concatBytes2;
-        if (isCompressed) {
-          return cat(Uint8Array.from([point.hasEvenY() ? 2 : 3]), x);
-        } else {
-          return cat(Uint8Array.from([4]), x, Fp2.toBytes(a.y));
-        }
-      },
-      fromBytes(bytes4) {
-        const len = bytes4.length;
-        const head = bytes4[0];
-        const tail = bytes4.subarray(1);
-        if (len === compressedLen && (head === 2 || head === 3)) {
-          const x = bytesToNumberBE(tail);
-          if (!isValidFieldElement(x))
-            throw new Error("Point is not on curve");
-          const y2 = weierstrassEquation(x);
-          let y = Fp2.sqrt(y2);
-          const isYOdd = (y & _1n4) === _1n4;
-          const isHeadOdd = (head & 1) === 1;
-          if (isHeadOdd !== isYOdd)
-            y = Fp2.neg(y);
-          return { x, y };
-        } else if (len === uncompressedLen && head === 4) {
-          const x = Fp2.fromBytes(tail.subarray(0, Fp2.BYTES));
-          const y = Fp2.fromBytes(tail.subarray(Fp2.BYTES, 2 * Fp2.BYTES));
-          return { x, y };
-        } else {
-          throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);
-        }
-      }
-    });
-    const numToNByteStr = (num) => bytesToHex2(numberToBytesBE(num, CURVE.nByteLength));
-    function isBiggerThanHalfOrder(number4) {
-      const HALF = CURVE_ORDER >> _1n4;
-      return number4 > HALF;
-    }
-    function normalizeS(s) {
-      return isBiggerThanHalfOrder(s) ? modN2(-s) : s;
-    }
-    const slcNum = (b, from, to) => bytesToNumberBE(b.slice(from, to));
-    class Signature {
-      constructor(r, s, recovery) {
-        this.r = r;
-        this.s = s;
-        this.recovery = recovery;
-        this.assertValidity();
-      }
-      // pair (bytes of r, bytes of s)
-      static fromCompact(hex2) {
-        const l = CURVE.nByteLength;
-        hex2 = ensureBytes("compactSignature", hex2, l * 2);
-        return new Signature(slcNum(hex2, 0, l), slcNum(hex2, l, 2 * l));
-      }
-      // DER encoded ECDSA signature
-      // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
-      static fromDER(hex2) {
-        const { r, s } = DER.toSig(ensureBytes("DER", hex2));
-        return new Signature(r, s);
-      }
-      assertValidity() {
-        if (!isWithinCurveOrder(this.r))
-          throw new Error("r must be 0 < r < CURVE.n");
-        if (!isWithinCurveOrder(this.s))
-          throw new Error("s must be 0 < s < CURVE.n");
-      }
-      addRecoveryBit(recovery) {
-        return new Signature(this.r, this.s, recovery);
-      }
-      recoverPublicKey(msgHash) {
-        const { r, s, recovery: rec } = this;
-        const h = bits2int_modN(ensureBytes("msgHash", msgHash));
-        if (rec == null || ![0, 1, 2, 3].includes(rec))
-          throw new Error("recovery id invalid");
-        const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;
-        if (radj >= Fp2.ORDER)
-          throw new Error("recovery id 2 or 3 invalid");
-        const prefix = (rec & 1) === 0 ? "02" : "03";
-        const R = Point2.fromHex(prefix + numToNByteStr(radj));
-        const ir = invN(radj);
-        const u1 = modN2(-h * ir);
-        const u2 = modN2(s * ir);
-        const Q = Point2.BASE.multiplyAndAddUnsafe(R, u1, u2);
-        if (!Q)
-          throw new Error("point at infinify");
-        Q.assertValidity();
-        return Q;
-      }
-      // Signatures should be low-s, to prevent malleability.
-      hasHighS() {
-        return isBiggerThanHalfOrder(this.s);
-      }
-      normalizeS() {
-        return this.hasHighS() ? new Signature(this.r, modN2(-this.s), this.recovery) : this;
-      }
-      // DER-encoded
-      toDERRawBytes() {
-        return hexToBytes(this.toDERHex());
-      }
-      toDERHex() {
-        return DER.hexFromSig({ r: this.r, s: this.s });
-      }
-      // padded bytes of r, then padded bytes of s
-      toCompactRawBytes() {
-        return hexToBytes(this.toCompactHex());
-      }
-      toCompactHex() {
-        return numToNByteStr(this.r) + numToNByteStr(this.s);
-      }
-    }
-    const utils = {
-      isValidPrivateKey(privateKey) {
-        try {
-          normPrivateKeyToScalar(privateKey);
-          return true;
-        } catch (error) {
-          return false;
-        }
-      },
-      normPrivateKeyToScalar,
-      /**
-       * Produces cryptographically secure private key from random of size
-       * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
-       */
-      randomPrivateKey: () => {
-        const length = getMinHashLength(CURVE.n);
-        return mapHashToField(CURVE.randomBytes(length), CURVE.n);
-      },
-      /**
-       * Creates precompute table for an arbitrary EC point. Makes point "cached".
-       * Allows to massively speed-up `point.multiply(scalar)`.
-       * @returns cached point
-       * @example
-       * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
-       * fast.multiply(privKey); // much faster ECDH now
-       */
-      precompute(windowSize = 8, point = Point2.BASE) {
-        point._setWindowSize(windowSize);
-        point.multiply(BigInt(3));
-        return point;
-      }
-    };
-    function getPublicKey2(privateKey, isCompressed = true) {
-      return Point2.fromPrivateKey(privateKey).toRawBytes(isCompressed);
-    }
-    function isProbPub(item) {
-      const arr = item instanceof Uint8Array;
-      const str = typeof item === "string";
-      const len = (arr || str) && item.length;
-      if (arr)
-        return len === compressedLen || len === uncompressedLen;
-      if (str)
-        return len === 2 * compressedLen || len === 2 * uncompressedLen;
-      if (item instanceof Point2)
-        return true;
-      return false;
-    }
-    function getSharedSecret(privateA, publicB, isCompressed = true) {
-      if (isProbPub(privateA))
-        throw new Error("first arg must be private key");
-      if (!isProbPub(publicB))
-        throw new Error("second arg must be public key");
-      const b = Point2.fromHex(publicB);
-      return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);
-    }
-    const bits2int = CURVE.bits2int || function(bytes4) {
-      const num = bytesToNumberBE(bytes4);
-      const delta = bytes4.length * 8 - CURVE.nBitLength;
-      return delta > 0 ? num >> BigInt(delta) : num;
-    };
-    const bits2int_modN = CURVE.bits2int_modN || function(bytes4) {
-      return modN2(bits2int(bytes4));
-    };
-    const ORDER_MASK = bitMask(CURVE.nBitLength);
-    function int2octets(num) {
-      if (typeof num !== "bigint")
-        throw new Error("bigint expected");
-      if (!(_0n4 <= num && num < ORDER_MASK))
-        throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);
-      return numberToBytesBE(num, CURVE.nByteLength);
-    }
-    function prepSig(msgHash, privateKey, opts = defaultSigOpts) {
-      if (["recovered", "canonical"].some((k) => k in opts))
-        throw new Error("sign() legacy options not supported");
-      const { hash: hash3, randomBytes: randomBytes3 } = CURVE;
-      let { lowS, prehash, extraEntropy: ent } = opts;
-      if (lowS == null)
-        lowS = true;
-      msgHash = ensureBytes("msgHash", msgHash);
-      if (prehash)
-        msgHash = ensureBytes("prehashed msgHash", hash3(msgHash));
-      const h1int = bits2int_modN(msgHash);
-      const d = normPrivateKeyToScalar(privateKey);
-      const seedArgs = [int2octets(d), int2octets(h1int)];
-      if (ent != null) {
-        const e = ent === true ? randomBytes3(Fp2.BYTES) : ent;
-        seedArgs.push(ensureBytes("extraEntropy", e));
-      }
-      const seed = concatBytes2(...seedArgs);
-      const m = h1int;
-      function k2sig(kBytes) {
-        const k = bits2int(kBytes);
-        if (!isWithinCurveOrder(k))
-          return;
-        const ik = invN(k);
-        const q = Point2.BASE.multiply(k).toAffine();
-        const r = modN2(q.x);
-        if (r === _0n4)
-          return;
-        const s = modN2(ik * modN2(m + r * d));
-        if (s === _0n4)
-          return;
-        let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n4);
-        let normS = s;
-        if (lowS && isBiggerThanHalfOrder(s)) {
-          normS = normalizeS(s);
-          recovery ^= 1;
-        }
-        return new Signature(r, normS, recovery);
-      }
-      return { seed, k2sig };
-    }
-    const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };
-    const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };
-    function sign(msgHash, privKey, opts = defaultSigOpts) {
-      const { seed, k2sig } = prepSig(msgHash, privKey, opts);
-      const C = CURVE;
-      const drbg = createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);
-      return drbg(seed, k2sig);
-    }
-    Point2.BASE._setWindowSize(8);
-    function verify(signature, msgHash, publicKey, opts = defaultVerOpts) {
-      const sg = signature;
-      msgHash = ensureBytes("msgHash", msgHash);
-      publicKey = ensureBytes("publicKey", publicKey);
-      if ("strict" in opts)
-        throw new Error("options.strict was renamed to lowS");
-      const { lowS, prehash } = opts;
-      let _sig = void 0;
-      let P;
-      try {
-        if (typeof sg === "string" || sg instanceof Uint8Array) {
-          try {
-            _sig = Signature.fromDER(sg);
-          } catch (derError) {
-            if (!(derError instanceof DER.Err))
-              throw derError;
-            _sig = Signature.fromCompact(sg);
-          }
-        } else if (typeof sg === "object" && typeof sg.r === "bigint" && typeof sg.s === "bigint") {
-          const { r: r2, s: s2 } = sg;
-          _sig = new Signature(r2, s2);
-        } else {
-          throw new Error("PARSE");
-        }
-        P = Point2.fromHex(publicKey);
-      } catch (error) {
-        if (error.message === "PARSE")
-          throw new Error(`signature must be Signature instance, Uint8Array or hex string`);
-        return false;
-      }
-      if (lowS && _sig.hasHighS())
-        return false;
-      if (prehash)
-        msgHash = CURVE.hash(msgHash);
-      const { r, s } = _sig;
-      const h = bits2int_modN(msgHash);
-      const is = invN(s);
-      const u1 = modN2(h * is);
-      const u2 = modN2(r * is);
-      const R = Point2.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine();
-      if (!R)
-        return false;
-      const v = modN2(R.x);
-      return v === r;
-    }
-    return {
-      CURVE,
-      getPublicKey: getPublicKey2,
-      getSharedSecret,
-      sign,
-      verify,
-      ProjectivePoint: Point2,
-      Signature,
-      utils
-    };
-  }
-
-  // node_modules/@noble/curves/node_modules/@noble/hashes/esm/hmac.js
-  var HMAC = class extends Hash2 {
-    constructor(hash3, _key) {
-      super();
-      this.finished = false;
-      this.destroyed = false;
-      hash(hash3);
-      const key = toBytes2(_key);
-      this.iHash = hash3.create();
-      if (typeof this.iHash.update !== "function")
-        throw new Error("Expected instance of class which extends utils.Hash");
-      this.blockLen = this.iHash.blockLen;
-      this.outputLen = this.iHash.outputLen;
-      const blockLen = this.blockLen;
-      const pad = new Uint8Array(blockLen);
-      pad.set(key.length > blockLen ? hash3.create().update(key).digest() : key);
-      for (let i2 = 0; i2 < pad.length; i2++)
-        pad[i2] ^= 54;
-      this.iHash.update(pad);
-      this.oHash = hash3.create();
-      for (let i2 = 0; i2 < pad.length; i2++)
-        pad[i2] ^= 54 ^ 92;
-      this.oHash.update(pad);
-      pad.fill(0);
-    }
-    update(buf) {
-      exists(this);
-      this.iHash.update(buf);
-      return this;
-    }
-    digestInto(out) {
-      exists(this);
-      bytes(out, this.outputLen);
-      this.finished = true;
-      this.iHash.digestInto(out);
-      this.oHash.update(out);
-      this.oHash.digestInto(out);
-      this.destroy();
-    }
-    digest() {
-      const out = new Uint8Array(this.oHash.outputLen);
-      this.digestInto(out);
-      return out;
-    }
-    _cloneInto(to) {
-      to || (to = Object.create(Object.getPrototypeOf(this), {}));
-      const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
-      to = to;
-      to.finished = finished;
-      to.destroyed = destroyed;
-      to.blockLen = blockLen;
-      to.outputLen = outputLen;
-      to.oHash = oHash._cloneInto(to.oHash);
-      to.iHash = iHash._cloneInto(to.iHash);
-      return to;
-    }
-    destroy() {
-      this.destroyed = true;
-      this.oHash.destroy();
-      this.iHash.destroy();
-    }
-  };
-  var hmac = (hash3, key, message) => new HMAC(hash3, key).update(message).digest();
-  hmac.create = (hash3, key) => new HMAC(hash3, key);
-
-  // node_modules/@noble/curves/esm/_shortw_utils.js
-  function getHash(hash3) {
-    return {
-      hash: hash3,
-      hmac: (key, ...msgs) => hmac(hash3, key, concatBytes(...msgs)),
-      randomBytes
-    };
-  }
-  function createCurve(curveDef, defHash) {
-    const create = (hash3) => weierstrass({ ...curveDef, ...getHash(hash3) });
-    return Object.freeze({ ...create(defHash), create });
-  }
-
-  // node_modules/@noble/curves/esm/secp256k1.js
-  var secp256k1P = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f");
-  var secp256k1N = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141");
-  var _1n5 = BigInt(1);
-  var _2n4 = BigInt(2);
-  var divNearest = (a, b) => (a + b / _2n4) / b;
-  function sqrtMod(y) {
-    const P = secp256k1P;
-    const _3n3 = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);
-    const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);
-    const b2 = y * y * y % P;
-    const b3 = b2 * b2 * y % P;
-    const b6 = pow2(b3, _3n3, P) * b3 % P;
-    const b9 = pow2(b6, _3n3, P) * b3 % P;
-    const b11 = pow2(b9, _2n4, P) * b2 % P;
-    const b22 = pow2(b11, _11n, P) * b11 % P;
-    const b44 = pow2(b22, _22n, P) * b22 % P;
-    const b88 = pow2(b44, _44n, P) * b44 % P;
-    const b176 = pow2(b88, _88n, P) * b88 % P;
-    const b220 = pow2(b176, _44n, P) * b44 % P;
-    const b223 = pow2(b220, _3n3, P) * b3 % P;
-    const t1 = pow2(b223, _23n, P) * b22 % P;
-    const t2 = pow2(t1, _6n, P) * b2 % P;
-    const root = pow2(t2, _2n4, P);
-    if (!Fp.eql(Fp.sqr(root), y))
-      throw new Error("Cannot find square root");
-    return root;
-  }
-  var Fp = Field(secp256k1P, void 0, void 0, { sqrt: sqrtMod });
-  var secp256k1 = createCurve({
-    a: BigInt(0),
-    b: BigInt(7),
-    Fp,
-    n: secp256k1N,
-    // Base point (x, y) aka generator point
-    Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
-    Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),
-    h: BigInt(1),
-    lowS: true,
-    /**
-     * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.
-     * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.
-     * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.
-     * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066
-     */
-    endo: {
-      beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
-      splitScalar: (k) => {
-        const n = secp256k1N;
-        const a1 = BigInt("0x3086d221a7d46bcde86c90e49284eb15");
-        const b1 = -_1n5 * BigInt("0xe4437ed6010e88286f547fa90abfe4c3");
-        const a2 = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8");
-        const b2 = a1;
-        const POW_2_128 = BigInt("0x100000000000000000000000000000000");
-        const c1 = divNearest(b2 * k, n);
-        const c2 = divNearest(-b1 * k, n);
-        let k1 = mod(k - c1 * a1 - c2 * a2, n);
-        let k2 = mod(-c1 * b1 - c2 * b2, n);
-        const k1neg = k1 > POW_2_128;
-        const k2neg = k2 > POW_2_128;
-        if (k1neg)
-          k1 = n - k1;
-        if (k2neg)
-          k2 = n - k2;
-        if (k1 > POW_2_128 || k2 > POW_2_128) {
-          throw new Error("splitScalar: Endomorphism failed, k=" + k);
-        }
-        return { k1neg, k1, k2neg, k2 };
-      }
-    }
-  }, sha256);
-  var _0n5 = BigInt(0);
-  var fe = (x) => typeof x === "bigint" && _0n5 < x && x < secp256k1P;
-  var ge = (x) => typeof x === "bigint" && _0n5 < x && x < secp256k1N;
-  var TAGGED_HASH_PREFIXES = {};
-  function taggedHash(tag, ...messages) {
-    let tagP = TAGGED_HASH_PREFIXES[tag];
-    if (tagP === void 0) {
-      const tagH = sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));
-      tagP = concatBytes2(tagH, tagH);
-      TAGGED_HASH_PREFIXES[tag] = tagP;
-    }
-    return sha256(concatBytes2(tagP, ...messages));
-  }
-  var pointToBytes = (point) => point.toRawBytes(true).slice(1);
-  var numTo32b = (n) => numberToBytesBE(n, 32);
-  var modP = (x) => mod(x, secp256k1P);
-  var modN = (x) => mod(x, secp256k1N);
-  var Point = secp256k1.ProjectivePoint;
-  var GmulAdd = (Q, a, b) => Point.BASE.multiplyAndAddUnsafe(Q, a, b);
-  function schnorrGetExtPubKey(priv) {
-    let d_ = secp256k1.utils.normPrivateKeyToScalar(priv);
-    let p = Point.fromPrivateKey(d_);
-    const scalar = p.hasEvenY() ? d_ : modN(-d_);
-    return { scalar, bytes: pointToBytes(p) };
-  }
-  function lift_x(x) {
-    if (!fe(x))
-      throw new Error("bad x: need 0 < x < p");
-    const xx = modP(x * x);
-    const c = modP(xx * x + BigInt(7));
-    let y = sqrtMod(c);
-    if (y % _2n4 !== _0n5)
-      y = modP(-y);
-    const p = new Point(x, y, _1n5);
-    p.assertValidity();
-    return p;
-  }
-  function challenge(...args) {
-    return modN(bytesToNumberBE(taggedHash("BIP0340/challenge", ...args)));
-  }
-  function schnorrGetPublicKey(privateKey) {
-    return schnorrGetExtPubKey(privateKey).bytes;
-  }
-  function schnorrSign(message, privateKey, auxRand = randomBytes(32)) {
-    const m = ensureBytes("message", message);
-    const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey);
-    const a = ensureBytes("auxRand", auxRand, 32);
-    const t = numTo32b(d ^ bytesToNumberBE(taggedHash("BIP0340/aux", a)));
-    const rand = taggedHash("BIP0340/nonce", t, px, m);
-    const k_ = modN(bytesToNumberBE(rand));
-    if (k_ === _0n5)
-      throw new Error("sign failed: k is zero");
-    const { bytes: rx, scalar: k } = schnorrGetExtPubKey(k_);
-    const e = challenge(rx, px, m);
-    const sig = new Uint8Array(64);
-    sig.set(rx, 0);
-    sig.set(numTo32b(modN(k + e * d)), 32);
-    if (!schnorrVerify(sig, m, px))
-      throw new Error("sign: Invalid signature produced");
-    return sig;
-  }
-  function schnorrVerify(signature, message, publicKey) {
-    const sig = ensureBytes("signature", signature, 64);
-    const m = ensureBytes("message", message);
-    const pub = ensureBytes("publicKey", publicKey, 32);
-    try {
-      const P = lift_x(bytesToNumberBE(pub));
-      const r = bytesToNumberBE(sig.subarray(0, 32));
-      if (!fe(r))
-        return false;
-      const s = bytesToNumberBE(sig.subarray(32, 64));
-      if (!ge(s))
-        return false;
-      const e = challenge(numTo32b(r), pointToBytes(P), m);
-      const R = GmulAdd(P, s, modN(-e));
-      if (!R || !R.hasEvenY() || R.toAffine().x !== r)
-        return false;
-      return true;
-    } catch (error) {
-      return false;
-    }
-  }
-  var schnorr = /* @__PURE__ */ (() => ({
-    getPublicKey: schnorrGetPublicKey,
-    sign: schnorrSign,
-    verify: schnorrVerify,
-    utils: {
-      randomPrivateKey: secp256k1.utils.randomPrivateKey,
-      lift_x,
-      pointToBytes,
-      numberToBytesBE,
-      bytesToNumberBE,
-      taggedHash,
-      mod
-    }
-  }))();
-
-  // node_modules/@noble/hashes/esm/_assert.js
-  function number2(n) {
-    if (!Number.isSafeInteger(n) || n < 0)
-      throw new Error(`Wrong positive integer: ${n}`);
-  }
-  function bool(b) {
-    if (typeof b !== "boolean")
-      throw new Error(`Expected boolean, not ${b}`);
-  }
-  function bytes2(b, ...lengths) {
-    if (!(b instanceof Uint8Array))
-      throw new Error("Expected Uint8Array");
-    if (lengths.length > 0 && !lengths.includes(b.length))
-      throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);
-  }
-  function hash2(hash3) {
-    if (typeof hash3 !== "function" || typeof hash3.create !== "function")
-      throw new Error("Hash should be wrapped by utils.wrapConstructor");
-    number2(hash3.outputLen);
-    number2(hash3.blockLen);
-  }
-  function exists2(instance, checkFinished = true) {
-    if (instance.destroyed)
-      throw new Error("Hash instance has been destroyed");
-    if (checkFinished && instance.finished)
-      throw new Error("Hash#digest() has already been called");
-  }
-  function output2(out, instance) {
-    bytes2(out);
-    const min = instance.outputLen;
-    if (out.length < min) {
-      throw new Error(`digestInto() expects output buffer of length at least ${min}`);
-    }
-  }
-  var assert = {
-    number: number2,
-    bool,
-    bytes: bytes2,
-    hash: hash2,
-    exists: exists2,
-    output: output2
-  };
-  var assert_default = assert;
-
-  // node_modules/@noble/hashes/esm/_sha2.js
-  function setBigUint642(view, byteOffset, value, isLE4) {
-    if (typeof view.setBigUint64 === "function")
-      return view.setBigUint64(byteOffset, value, isLE4);
-    const _32n = BigInt(32);
-    const _u32_max = BigInt(4294967295);
-    const wh = Number(value >> _32n & _u32_max);
-    const wl = Number(value & _u32_max);
-    const h = isLE4 ? 4 : 0;
-    const l = isLE4 ? 0 : 4;
-    view.setUint32(byteOffset + h, wh, isLE4);
-    view.setUint32(byteOffset + l, wl, isLE4);
-  }
-  var SHA22 = class extends Hash {
-    constructor(blockLen, outputLen, padOffset, isLE4) {
-      super();
-      this.blockLen = blockLen;
-      this.outputLen = outputLen;
-      this.padOffset = padOffset;
-      this.isLE = isLE4;
-      this.finished = false;
-      this.length = 0;
-      this.pos = 0;
-      this.destroyed = false;
-      this.buffer = new Uint8Array(blockLen);
-      this.view = createView(this.buffer);
-    }
-    update(data) {
-      assert_default.exists(this);
-      const { view, buffer, blockLen } = this;
-      data = toBytes(data);
-      const len = data.length;
-      for (let pos = 0; pos < len; ) {
-        const take = Math.min(blockLen - this.pos, len - pos);
-        if (take === blockLen) {
-          const dataView = createView(data);
-          for (; blockLen <= len - pos; pos += blockLen)
-            this.process(dataView, pos);
-          continue;
-        }
-        buffer.set(data.subarray(pos, pos + take), this.pos);
-        this.pos += take;
-        pos += take;
-        if (this.pos === blockLen) {
-          this.process(view, 0);
-          this.pos = 0;
-        }
-      }
-      this.length += data.length;
-      this.roundClean();
-      return this;
-    }
-    digestInto(out) {
-      assert_default.exists(this);
-      assert_default.output(out, this);
-      this.finished = true;
-      const { buffer, view, blockLen, isLE: isLE4 } = this;
-      let { pos } = this;
-      buffer[pos++] = 128;
-      this.buffer.subarray(pos).fill(0);
-      if (this.padOffset > blockLen - pos) {
-        this.process(view, 0);
-        pos = 0;
-      }
-      for (let i2 = pos; i2 < blockLen; i2++)
-        buffer[i2] = 0;
-      setBigUint642(view, blockLen - 8, BigInt(this.length * 8), isLE4);
-      this.process(view, 0);
-      const oview = createView(out);
-      const len = this.outputLen;
-      if (len % 4)
-        throw new Error("_sha2: outputLen should be aligned to 32bit");
-      const outLen = len / 4;
-      const state = this.get();
-      if (outLen > state.length)
-        throw new Error("_sha2: outputLen bigger than state");
-      for (let i2 = 0; i2 < outLen; i2++)
-        oview.setUint32(4 * i2, state[i2], isLE4);
-    }
-    digest() {
-      const { buffer, outputLen } = this;
-      this.digestInto(buffer);
-      const res = buffer.slice(0, outputLen);
-      this.destroy();
-      return res;
-    }
-    _cloneInto(to) {
-      to || (to = new this.constructor());
-      to.set(...this.get());
-      const { blockLen, buffer, length, finished, destroyed, pos } = this;
-      to.length = length;
-      to.pos = pos;
-      to.finished = finished;
-      to.destroyed = destroyed;
-      if (length % blockLen)
-        to.buffer.set(buffer);
-      return to;
-    }
-  };
-
-  // node_modules/@noble/hashes/esm/sha256.js
-  var Chi2 = (a, b, c) => a & b ^ ~a & c;
-  var Maj2 = (a, b, c) => a & b ^ a & c ^ b & c;
-  var SHA256_K2 = new Uint32Array([
-    1116352408,
-    1899447441,
-    3049323471,
-    3921009573,
-    961987163,
-    1508970993,
-    2453635748,
-    2870763221,
-    3624381080,
-    310598401,
-    607225278,
-    1426881987,
-    1925078388,
-    2162078206,
-    2614888103,
-    3248222580,
-    3835390401,
-    4022224774,
-    264347078,
-    604807628,
-    770255983,
-    1249150122,
-    1555081692,
-    1996064986,
-    2554220882,
-    2821834349,
-    2952996808,
-    3210313671,
-    3336571891,
-    3584528711,
-    113926993,
-    338241895,
-    666307205,
-    773529912,
-    1294757372,
-    1396182291,
-    1695183700,
-    1986661051,
-    2177026350,
-    2456956037,
-    2730485921,
-    2820302411,
-    3259730800,
-    3345764771,
-    3516065817,
-    3600352804,
-    4094571909,
-    275423344,
-    430227734,
-    506948616,
-    659060556,
-    883997877,
-    958139571,
-    1322822218,
-    1537002063,
-    1747873779,
-    1955562222,
-    2024104815,
-    2227730452,
-    2361852424,
-    2428436474,
-    2756734187,
-    3204031479,
-    3329325298
-  ]);
-  var IV2 = new Uint32Array([
-    1779033703,
-    3144134277,
-    1013904242,
-    2773480762,
-    1359893119,
-    2600822924,
-    528734635,
-    1541459225
-  ]);
-  var SHA256_W2 = new Uint32Array(64);
-  var SHA2562 = class extends SHA22 {
-    constructor() {
-      super(64, 32, 8, false);
-      this.A = IV2[0] | 0;
-      this.B = IV2[1] | 0;
-      this.C = IV2[2] | 0;
-      this.D = IV2[3] | 0;
-      this.E = IV2[4] | 0;
-      this.F = IV2[5] | 0;
-      this.G = IV2[6] | 0;
-      this.H = IV2[7] | 0;
-    }
-    get() {
-      const { A, B, C, D, E, F, G, H } = this;
-      return [A, B, C, D, E, F, G, H];
-    }
-    // prettier-ignore
-    set(A, B, C, D, E, F, G, H) {
-      this.A = A | 0;
-      this.B = B | 0;
-      this.C = C | 0;
-      this.D = D | 0;
-      this.E = E | 0;
-      this.F = F | 0;
-      this.G = G | 0;
-      this.H = H | 0;
-    }
-    process(view, offset) {
-      for (let i2 = 0; i2 < 16; i2++, offset += 4)
-        SHA256_W2[i2] = view.getUint32(offset, false);
-      for (let i2 = 16; i2 < 64; i2++) {
-        const W15 = SHA256_W2[i2 - 15];
-        const W2 = SHA256_W2[i2 - 2];
-        const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ W15 >>> 3;
-        const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ W2 >>> 10;
-        SHA256_W2[i2] = s1 + SHA256_W2[i2 - 7] + s0 + SHA256_W2[i2 - 16] | 0;
-      }
-      let { A, B, C, D, E, F, G, H } = this;
-      for (let i2 = 0; i2 < 64; i2++) {
-        const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);
-        const T1 = H + sigma1 + Chi2(E, F, G) + SHA256_K2[i2] + SHA256_W2[i2] | 0;
-        const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);
-        const T2 = sigma0 + Maj2(A, B, C) | 0;
-        H = G;
-        G = F;
-        F = E;
-        E = D + T1 | 0;
-        D = C;
-        C = B;
-        B = A;
-        A = T1 + T2 | 0;
-      }
-      A = A + this.A | 0;
-      B = B + this.B | 0;
-      C = C + this.C | 0;
-      D = D + this.D | 0;
-      E = E + this.E | 0;
-      F = F + this.F | 0;
-      G = G + this.G | 0;
-      H = H + this.H | 0;
-      this.set(A, B, C, D, E, F, G, H);
-    }
-    roundClean() {
-      SHA256_W2.fill(0);
-    }
-    destroy() {
-      this.set(0, 0, 0, 0, 0, 0, 0, 0);
-      this.buffer.fill(0);
-    }
-  };
-  var SHA224 = class extends SHA2562 {
-    constructor() {
-      super();
-      this.A = 3238371032 | 0;
-      this.B = 914150663 | 0;
-      this.C = 812702999 | 0;
-      this.D = 4144912697 | 0;
-      this.E = 4290775857 | 0;
-      this.F = 1750603025 | 0;
-      this.G = 1694076839 | 0;
-      this.H = 3204075428 | 0;
-      this.outputLen = 28;
-    }
-  };
-  var sha2562 = wrapConstructor(() => new SHA2562());
-  var sha224 = wrapConstructor(() => new SHA224());
-
-  // node_modules/@noble/ciphers/esm/_assert.js
-  function number3(n) {
-    if (!Number.isSafeInteger(n) || n < 0)
-      throw new Error(`positive integer expected, not ${n}`);
-  }
-  function bool2(b) {
-    if (typeof b !== "boolean")
-      throw new Error(`boolean expected, not ${b}`);
-  }
-  function isBytes(a) {
-    return a instanceof Uint8Array || a != null && typeof a === "object" && a.constructor.name === "Uint8Array";
-  }
-  function bytes3(b, ...lengths) {
-    if (!isBytes(b))
-      throw new Error("Uint8Array expected");
-    if (lengths.length > 0 && !lengths.includes(b.length))
-      throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);
-  }
-  function exists3(instance, checkFinished = true) {
-    if (instance.destroyed)
-      throw new Error("Hash instance has been destroyed");
-    if (checkFinished && instance.finished)
-      throw new Error("Hash#digest() has already been called");
-  }
-  function output3(out, instance) {
-    bytes3(out);
-    const min = instance.outputLen;
-    if (out.length < min) {
-      throw new Error(`digestInto() expects output buffer of length at least ${min}`);
-    }
-  }
-
-  // node_modules/@noble/ciphers/esm/utils.js
-  var u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);
-  var u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
-  var createView3 = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
-  var isLE3 = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-  if (!isLE3)
-    throw new Error("Non little-endian hardware is not supported");
-  function utf8ToBytes4(str) {
-    if (typeof str !== "string")
-      throw new Error(`string expected, got ${typeof str}`);
-    return new Uint8Array(new TextEncoder().encode(str));
-  }
-  function toBytes3(data) {
-    if (typeof data === "string")
-      data = utf8ToBytes4(data);
-    else if (isBytes(data))
-      data = data.slice();
-    else
-      throw new Error(`Uint8Array expected, got ${typeof data}`);
-    return data;
-  }
-  function checkOpts(defaults, opts) {
-    if (opts == null || typeof opts !== "object")
-      throw new Error("options must be defined");
-    const merged = Object.assign(defaults, opts);
-    return merged;
-  }
-  function equalBytes2(a, b) {
-    if (a.length !== b.length)
-      return false;
-    let diff = 0;
-    for (let i2 = 0; i2 < a.length; i2++)
-      diff |= a[i2] ^ b[i2];
-    return diff === 0;
-  }
-  var wrapCipher = /* @__NO_SIDE_EFFECTS__ */ (params, c) => {
-    Object.assign(c, params);
-    return c;
-  };
-  function setBigUint643(view, byteOffset, value, isLE4) {
-    if (typeof view.setBigUint64 === "function")
-      return view.setBigUint64(byteOffset, value, isLE4);
-    const _32n = BigInt(32);
-    const _u32_max = BigInt(4294967295);
-    const wh = Number(value >> _32n & _u32_max);
-    const wl = Number(value & _u32_max);
-    const h = isLE4 ? 4 : 0;
-    const l = isLE4 ? 0 : 4;
-    view.setUint32(byteOffset + h, wh, isLE4);
-    view.setUint32(byteOffset + l, wl, isLE4);
-  }
-
-  // node_modules/@noble/ciphers/esm/_polyval.js
-  var BLOCK_SIZE = 16;
-  var ZEROS16 = /* @__PURE__ */ new Uint8Array(16);
-  var ZEROS32 = u32(ZEROS16);
-  var POLY = 225;
-  var mul2 = (s0, s1, s2, s3) => {
-    const hiBit = s3 & 1;
-    return {
-      s3: s2 << 31 | s3 >>> 1,
-      s2: s1 << 31 | s2 >>> 1,
-      s1: s0 << 31 | s1 >>> 1,
-      s0: s0 >>> 1 ^ POLY << 24 & -(hiBit & 1)
-      // reduce % poly
-    };
-  };
-  var swapLE = (n) => (n >>> 0 & 255) << 24 | (n >>> 8 & 255) << 16 | (n >>> 16 & 255) << 8 | n >>> 24 & 255 | 0;
-  function _toGHASHKey(k) {
-    k.reverse();
-    const hiBit = k[15] & 1;
-    let carry = 0;
-    for (let i2 = 0; i2 < k.length; i2++) {
-      const t = k[i2];
-      k[i2] = t >>> 1 | carry;
-      carry = (t & 1) << 7;
-    }
-    k[0] ^= -hiBit & 225;
-    return k;
-  }
-  var estimateWindow = (bytes4) => {
-    if (bytes4 > 64 * 1024)
-      return 8;
-    if (bytes4 > 1024)
-      return 4;
-    return 2;
-  };
-  var GHASH = class {
-    // We select bits per window adaptively based on expectedLength
-    constructor(key, expectedLength) {
-      this.blockLen = BLOCK_SIZE;
-      this.outputLen = BLOCK_SIZE;
-      this.s0 = 0;
-      this.s1 = 0;
-      this.s2 = 0;
-      this.s3 = 0;
-      this.finished = false;
-      key = toBytes3(key);
-      bytes3(key, 16);
-      const kView = createView3(key);
-      let k0 = kView.getUint32(0, false);
-      let k1 = kView.getUint32(4, false);
-      let k2 = kView.getUint32(8, false);
-      let k3 = kView.getUint32(12, false);
-      const doubles = [];
-      for (let i2 = 0; i2 < 128; i2++) {
-        doubles.push({ s0: swapLE(k0), s1: swapLE(k1), s2: swapLE(k2), s3: swapLE(k3) });
-        ({ s0: k0, s1: k1, s2: k2, s3: k3 } = mul2(k0, k1, k2, k3));
-      }
-      const W = estimateWindow(expectedLength || 1024);
-      if (![1, 2, 4, 8].includes(W))
-        throw new Error(`ghash: wrong window size=${W}, should be 2, 4 or 8`);
-      this.W = W;
-      const bits = 128;
-      const windows = bits / W;
-      const windowSize = this.windowSize = 2 ** W;
-      const items = [];
-      for (let w = 0; w < windows; w++) {
-        for (let byte = 0; byte < windowSize; byte++) {
-          let s0 = 0, s1 = 0, s2 = 0, s3 = 0;
-          for (let j = 0; j < W; j++) {
-            const bit = byte >>> W - j - 1 & 1;
-            if (!bit)
-              continue;
-            const { s0: d0, s1: d1, s2: d2, s3: d3 } = doubles[W * w + j];
-            s0 ^= d0, s1 ^= d1, s2 ^= d2, s3 ^= d3;
-          }
-          items.push({ s0, s1, s2, s3 });
-        }
-      }
-      this.t = items;
-    }
-    _updateBlock(s0, s1, s2, s3) {
-      s0 ^= this.s0, s1 ^= this.s1, s2 ^= this.s2, s3 ^= this.s3;
-      const { W, t, windowSize } = this;
-      let o0 = 0, o1 = 0, o2 = 0, o3 = 0;
-      const mask = (1 << W) - 1;
-      let w = 0;
-      for (const num of [s0, s1, s2, s3]) {
-        for (let bytePos = 0; bytePos < 4; bytePos++) {
-          const byte = num >>> 8 * bytePos & 255;
-          for (let bitPos = 8 / W - 1; bitPos >= 0; bitPos--) {
-            const bit = byte >>> W * bitPos & mask;
-            const { s0: e0, s1: e1, s2: e2, s3: e3 } = t[w * windowSize + bit];
-            o0 ^= e0, o1 ^= e1, o2 ^= e2, o3 ^= e3;
-            w += 1;
-          }
-        }
-      }
-      this.s0 = o0;
-      this.s1 = o1;
-      this.s2 = o2;
-      this.s3 = o3;
-    }
-    update(data) {
-      data = toBytes3(data);
-      exists3(this);
-      const b32 = u32(data);
-      const blocks = Math.floor(data.length / BLOCK_SIZE);
-      const left = data.length % BLOCK_SIZE;
-      for (let i2 = 0; i2 < blocks; i2++) {
-        this._updateBlock(b32[i2 * 4 + 0], b32[i2 * 4 + 1], b32[i2 * 4 + 2], b32[i2 * 4 + 3]);
-      }
-      if (left) {
-        ZEROS16.set(data.subarray(blocks * BLOCK_SIZE));
-        this._updateBlock(ZEROS32[0], ZEROS32[1], ZEROS32[2], ZEROS32[3]);
-        ZEROS32.fill(0);
-      }
-      return this;
-    }
-    destroy() {
-      const { t } = this;
-      for (const elm of t) {
-        elm.s0 = 0, elm.s1 = 0, elm.s2 = 0, elm.s3 = 0;
-      }
-    }
-    digestInto(out) {
-      exists3(this);
-      output3(out, this);
-      this.finished = true;
-      const { s0, s1, s2, s3 } = this;
-      const o32 = u32(out);
-      o32[0] = s0;
-      o32[1] = s1;
-      o32[2] = s2;
-      o32[3] = s3;
-      return out;
-    }
-    digest() {
-      const res = new Uint8Array(BLOCK_SIZE);
-      this.digestInto(res);
-      this.destroy();
-      return res;
-    }
-  };
-  var Polyval = class extends GHASH {
-    constructor(key, expectedLength) {
-      key = toBytes3(key);
-      const ghKey = _toGHASHKey(key.slice());
-      super(ghKey, expectedLength);
-      ghKey.fill(0);
-    }
-    update(data) {
-      data = toBytes3(data);
-      exists3(this);
-      const b32 = u32(data);
-      const left = data.length % BLOCK_SIZE;
-      const blocks = Math.floor(data.length / BLOCK_SIZE);
-      for (let i2 = 0; i2 < blocks; i2++) {
-        this._updateBlock(swapLE(b32[i2 * 4 + 3]), swapLE(b32[i2 * 4 + 2]), swapLE(b32[i2 * 4 + 1]), swapLE(b32[i2 * 4 + 0]));
-      }
-      if (left) {
-        ZEROS16.set(data.subarray(blocks * BLOCK_SIZE));
-        this._updateBlock(swapLE(ZEROS32[3]), swapLE(ZEROS32[2]), swapLE(ZEROS32[1]), swapLE(ZEROS32[0]));
-        ZEROS32.fill(0);
-      }
-      return this;
-    }
-    digestInto(out) {
-      exists3(this);
-      output3(out, this);
-      this.finished = true;
-      const { s0, s1, s2, s3 } = this;
-      const o32 = u32(out);
-      o32[0] = s0;
-      o32[1] = s1;
-      o32[2] = s2;
-      o32[3] = s3;
-      return out.reverse();
-    }
-  };
-  function wrapConstructorWithKey(hashCons) {
-    const hashC = (msg, key) => hashCons(key, msg.length).update(toBytes3(msg)).digest();
-    const tmp = hashCons(new Uint8Array(16), 0);
-    hashC.outputLen = tmp.outputLen;
-    hashC.blockLen = tmp.blockLen;
-    hashC.create = (key, expectedLength) => hashCons(key, expectedLength);
-    return hashC;
-  }
-  var ghash = wrapConstructorWithKey((key, expectedLength) => new GHASH(key, expectedLength));
-  var polyval = wrapConstructorWithKey((key, expectedLength) => new Polyval(key, expectedLength));
-
-  // node_modules/@noble/ciphers/esm/aes.js
-  var BLOCK_SIZE2 = 16;
-  var BLOCK_SIZE32 = 4;
-  var EMPTY_BLOCK = new Uint8Array(BLOCK_SIZE2);
-  var POLY2 = 283;
-  function mul22(n) {
-    return n << 1 ^ POLY2 & -(n >> 7);
-  }
-  function mul(a, b) {
-    let res = 0;
-    for (; b > 0; b >>= 1) {
-      res ^= a & -(b & 1);
-      a = mul22(a);
-    }
-    return res;
-  }
-  var sbox = /* @__PURE__ */ (() => {
-    let t = new Uint8Array(256);
-    for (let i2 = 0, x = 1; i2 < 256; i2++, x ^= mul22(x))
-      t[i2] = x;
-    const box = new Uint8Array(256);
-    box[0] = 99;
-    for (let i2 = 0; i2 < 255; i2++) {
-      let x = t[255 - i2];
-      x |= x << 8;
-      box[t[i2]] = (x ^ x >> 4 ^ x >> 5 ^ x >> 6 ^ x >> 7 ^ 99) & 255;
-    }
-    return box;
-  })();
-  var invSbox = /* @__PURE__ */ sbox.map((_, j) => sbox.indexOf(j));
-  var rotr32_8 = (n) => n << 24 | n >>> 8;
-  var rotl32_8 = (n) => n << 8 | n >>> 24;
-  function genTtable(sbox2, fn) {
-    if (sbox2.length !== 256)
-      throw new Error("Wrong sbox length");
-    const T0 = new Uint32Array(256).map((_, j) => fn(sbox2[j]));
-    const T1 = T0.map(rotl32_8);
-    const T2 = T1.map(rotl32_8);
-    const T3 = T2.map(rotl32_8);
-    const T01 = new Uint32Array(256 * 256);
-    const T23 = new Uint32Array(256 * 256);
-    const sbox22 = new Uint16Array(256 * 256);
-    for (let i2 = 0; i2 < 256; i2++) {
-      for (let j = 0; j < 256; j++) {
-        const idx = i2 * 256 + j;
-        T01[idx] = T0[i2] ^ T1[j];
-        T23[idx] = T2[i2] ^ T3[j];
-        sbox22[idx] = sbox2[i2] << 8 | sbox2[j];
-      }
-    }
-    return { sbox: sbox2, sbox2: sbox22, T0, T1, T2, T3, T01, T23 };
-  }
-  var tableEncoding = /* @__PURE__ */ genTtable(sbox, (s) => mul(s, 3) << 24 | s << 16 | s << 8 | mul(s, 2));
-  var tableDecoding = /* @__PURE__ */ genTtable(invSbox, (s) => mul(s, 11) << 24 | mul(s, 13) << 16 | mul(s, 9) << 8 | mul(s, 14));
-  var xPowers = /* @__PURE__ */ (() => {
-    const p = new Uint8Array(16);
-    for (let i2 = 0, x = 1; i2 < 16; i2++, x = mul22(x))
-      p[i2] = x;
-    return p;
-  })();
-  function expandKeyLE(key) {
-    bytes3(key);
-    const len = key.length;
-    if (![16, 24, 32].includes(len))
-      throw new Error(`aes: wrong key size: should be 16, 24 or 32, got: ${len}`);
-    const { sbox2 } = tableEncoding;
-    const k32 = u32(key);
-    const Nk = k32.length;
-    const subByte = (n) => applySbox(sbox2, n, n, n, n);
-    const xk = new Uint32Array(len + 28);
-    xk.set(k32);
-    for (let i2 = Nk; i2 < xk.length; i2++) {
-      let t = xk[i2 - 1];
-      if (i2 % Nk === 0)
-        t = subByte(rotr32_8(t)) ^ xPowers[i2 / Nk - 1];
-      else if (Nk > 6 && i2 % Nk === 4)
-        t = subByte(t);
-      xk[i2] = xk[i2 - Nk] ^ t;
-    }
-    return xk;
-  }
-  function expandKeyDecLE(key) {
-    const encKey = expandKeyLE(key);
-    const xk = encKey.slice();
-    const Nk = encKey.length;
-    const { sbox2 } = tableEncoding;
-    const { T0, T1, T2, T3 } = tableDecoding;
-    for (let i2 = 0; i2 < Nk; i2 += 4) {
-      for (let j = 0; j < 4; j++)
-        xk[i2 + j] = encKey[Nk - i2 - 4 + j];
-    }
-    encKey.fill(0);
-    for (let i2 = 4; i2 < Nk - 4; i2++) {
-      const x = xk[i2];
-      const w = applySbox(sbox2, x, x, x, x);
-      xk[i2] = T0[w & 255] ^ T1[w >>> 8 & 255] ^ T2[w >>> 16 & 255] ^ T3[w >>> 24];
-    }
-    return xk;
-  }
-  function apply0123(T01, T23, s0, s1, s2, s3) {
-    return T01[s0 << 8 & 65280 | s1 >>> 8 & 255] ^ T23[s2 >>> 8 & 65280 | s3 >>> 24 & 255];
-  }
-  function applySbox(sbox2, s0, s1, s2, s3) {
-    return sbox2[s0 & 255 | s1 & 65280] | sbox2[s2 >>> 16 & 255 | s3 >>> 16 & 65280] << 16;
-  }
-  function encrypt(xk, s0, s1, s2, s3) {
-    const { sbox2, T01, T23 } = tableEncoding;
-    let k = 0;
-    s0 ^= xk[k++], s1 ^= xk[k++], s2 ^= xk[k++], s3 ^= xk[k++];
-    const rounds = xk.length / 4 - 2;
-    for (let i2 = 0; i2 < rounds; i2++) {
-      const t02 = xk[k++] ^ apply0123(T01, T23, s0, s1, s2, s3);
-      const t12 = xk[k++] ^ apply0123(T01, T23, s1, s2, s3, s0);
-      const t22 = xk[k++] ^ apply0123(T01, T23, s2, s3, s0, s1);
-      const t32 = xk[k++] ^ apply0123(T01, T23, s3, s0, s1, s2);
-      s0 = t02, s1 = t12, s2 = t22, s3 = t32;
-    }
-    const t0 = xk[k++] ^ applySbox(sbox2, s0, s1, s2, s3);
-    const t1 = xk[k++] ^ applySbox(sbox2, s1, s2, s3, s0);
-    const t2 = xk[k++] ^ applySbox(sbox2, s2, s3, s0, s1);
-    const t3 = xk[k++] ^ applySbox(sbox2, s3, s0, s1, s2);
-    return { s0: t0, s1: t1, s2: t2, s3: t3 };
-  }
-  function decrypt(xk, s0, s1, s2, s3) {
-    const { sbox2, T01, T23 } = tableDecoding;
-    let k = 0;
-    s0 ^= xk[k++], s1 ^= xk[k++], s2 ^= xk[k++], s3 ^= xk[k++];
-    const rounds = xk.length / 4 - 2;
-    for (let i2 = 0; i2 < rounds; i2++) {
-      const t02 = xk[k++] ^ apply0123(T01, T23, s0, s3, s2, s1);
-      const t12 = xk[k++] ^ apply0123(T01, T23, s1, s0, s3, s2);
-      const t22 = xk[k++] ^ apply0123(T01, T23, s2, s1, s0, s3);
-      const t32 = xk[k++] ^ apply0123(T01, T23, s3, s2, s1, s0);
-      s0 = t02, s1 = t12, s2 = t22, s3 = t32;
-    }
-    const t0 = xk[k++] ^ applySbox(sbox2, s0, s3, s2, s1);
-    const t1 = xk[k++] ^ applySbox(sbox2, s1, s0, s3, s2);
-    const t2 = xk[k++] ^ applySbox(sbox2, s2, s1, s0, s3);
-    const t3 = xk[k++] ^ applySbox(sbox2, s3, s2, s1, s0);
-    return { s0: t0, s1: t1, s2: t2, s3: t3 };
-  }
-  function getDst(len, dst) {
-    if (!dst)
-      return new Uint8Array(len);
-    bytes3(dst);
-    if (dst.length < len)
-      throw new Error(`aes: wrong destination length, expected at least ${len}, got: ${dst.length}`);
-    return dst;
-  }
-  function ctrCounter(xk, nonce, src, dst) {
-    bytes3(nonce, BLOCK_SIZE2);
-    bytes3(src);
-    const srcLen = src.length;
-    dst = getDst(srcLen, dst);
-    const ctr3 = nonce;
-    const c32 = u32(ctr3);
-    let { s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]);
-    const src32 = u32(src);
-    const dst32 = u32(dst);
-    for (let i2 = 0; i2 + 4 <= src32.length; i2 += 4) {
-      dst32[i2 + 0] = src32[i2 + 0] ^ s0;
-      dst32[i2 + 1] = src32[i2 + 1] ^ s1;
-      dst32[i2 + 2] = src32[i2 + 2] ^ s2;
-      dst32[i2 + 3] = src32[i2 + 3] ^ s3;
-      let carry = 1;
-      for (let i3 = ctr3.length - 1; i3 >= 0; i3--) {
-        carry = carry + (ctr3[i3] & 255) | 0;
-        ctr3[i3] = carry & 255;
-        carry >>>= 8;
-      }
-      ({ s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]));
-    }
-    const start = BLOCK_SIZE2 * Math.floor(src32.length / BLOCK_SIZE32);
-    if (start < srcLen) {
-      const b32 = new Uint32Array([s0, s1, s2, s3]);
-      const buf = u8(b32);
-      for (let i2 = start, pos = 0; i2 < srcLen; i2++, pos++)
-        dst[i2] = src[i2] ^ buf[pos];
-    }
-    return dst;
-  }
-  function ctr32(xk, isLE4, nonce, src, dst) {
-    bytes3(nonce, BLOCK_SIZE2);
-    bytes3(src);
-    dst = getDst(src.length, dst);
-    const ctr3 = nonce;
-    const c32 = u32(ctr3);
-    const view = createView3(ctr3);
-    const src32 = u32(src);
-    const dst32 = u32(dst);
-    const ctrPos = isLE4 ? 0 : 12;
-    const srcLen = src.length;
-    let ctrNum = view.getUint32(ctrPos, isLE4);
-    let { s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]);
-    for (let i2 = 0; i2 + 4 <= src32.length; i2 += 4) {
-      dst32[i2 + 0] = src32[i2 + 0] ^ s0;
-      dst32[i2 + 1] = src32[i2 + 1] ^ s1;
-      dst32[i2 + 2] = src32[i2 + 2] ^ s2;
-      dst32[i2 + 3] = src32[i2 + 3] ^ s3;
-      ctrNum = ctrNum + 1 >>> 0;
-      view.setUint32(ctrPos, ctrNum, isLE4);
-      ({ s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]));
-    }
-    const start = BLOCK_SIZE2 * Math.floor(src32.length / BLOCK_SIZE32);
-    if (start < srcLen) {
-      const b32 = new Uint32Array([s0, s1, s2, s3]);
-      const buf = u8(b32);
-      for (let i2 = start, pos = 0; i2 < srcLen; i2++, pos++)
-        dst[i2] = src[i2] ^ buf[pos];
-    }
-    return dst;
-  }
-  var ctr = wrapCipher({ blockSize: 16, nonceLength: 16 }, function ctr2(key, nonce) {
-    bytes3(key);
-    bytes3(nonce, BLOCK_SIZE2);
-    function processCtr(buf, dst) {
-      const xk = expandKeyLE(key);
-      const n = nonce.slice();
-      const out = ctrCounter(xk, n, buf, dst);
-      xk.fill(0);
-      n.fill(0);
-      return out;
-    }
-    return {
-      encrypt: (plaintext, dst) => processCtr(plaintext, dst),
-      decrypt: (ciphertext, dst) => processCtr(ciphertext, dst)
-    };
-  });
-  function validateBlockDecrypt(data) {
-    bytes3(data);
-    if (data.length % BLOCK_SIZE2 !== 0) {
-      throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${BLOCK_SIZE2}`);
-    }
-  }
-  function validateBlockEncrypt(plaintext, pcks5, dst) {
-    let outLen = plaintext.length;
-    const remaining = outLen % BLOCK_SIZE2;
-    if (!pcks5 && remaining !== 0)
-      throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
-    const b = u32(plaintext);
-    if (pcks5) {
-      let left = BLOCK_SIZE2 - remaining;
-      if (!left)
-        left = BLOCK_SIZE2;
-      outLen = outLen + left;
-    }
-    const out = getDst(outLen, dst);
-    const o = u32(out);
-    return { b, o, out };
-  }
-  function validatePCKS(data, pcks5) {
-    if (!pcks5)
-      return data;
-    const len = data.length;
-    if (!len)
-      throw new Error(`aes/pcks5: empty ciphertext not allowed`);
-    const lastByte = data[len - 1];
-    if (lastByte <= 0 || lastByte > 16)
-      throw new Error(`aes/pcks5: wrong padding byte: ${lastByte}`);
-    const out = data.subarray(0, -lastByte);
-    for (let i2 = 0; i2 < lastByte; i2++)
-      if (data[len - i2 - 1] !== lastByte)
-        throw new Error(`aes/pcks5: wrong padding`);
-    return out;
-  }
-  function padPCKS(left) {
-    const tmp = new Uint8Array(16);
-    const tmp32 = u32(tmp);
-    tmp.set(left);
-    const paddingByte = BLOCK_SIZE2 - left.length;
-    for (let i2 = BLOCK_SIZE2 - paddingByte; i2 < BLOCK_SIZE2; i2++)
-      tmp[i2] = paddingByte;
-    return tmp32;
-  }
-  var ecb = wrapCipher({ blockSize: 16 }, function ecb2(key, opts = {}) {
-    bytes3(key);
-    const pcks5 = !opts.disablePadding;
-    return {
-      encrypt: (plaintext, dst) => {
-        bytes3(plaintext);
-        const { b, o, out: _out } = validateBlockEncrypt(plaintext, pcks5, dst);
-        const xk = expandKeyLE(key);
-        let i2 = 0;
-        for (; i2 + 4 <= b.length; ) {
-          const { s0, s1, s2, s3 } = encrypt(xk, b[i2 + 0], b[i2 + 1], b[i2 + 2], b[i2 + 3]);
-          o[i2++] = s0, o[i2++] = s1, o[i2++] = s2, o[i2++] = s3;
-        }
-        if (pcks5) {
-          const tmp32 = padPCKS(plaintext.subarray(i2 * 4));
-          const { s0, s1, s2, s3 } = encrypt(xk, tmp32[0], tmp32[1], tmp32[2], tmp32[3]);
-          o[i2++] = s0, o[i2++] = s1, o[i2++] = s2, o[i2++] = s3;
-        }
-        xk.fill(0);
-        return _out;
-      },
-      decrypt: (ciphertext, dst) => {
-        validateBlockDecrypt(ciphertext);
-        const xk = expandKeyDecLE(key);
-        const out = getDst(ciphertext.length, dst);
-        const b = u32(ciphertext);
-        const o = u32(out);
-        for (let i2 = 0; i2 + 4 <= b.length; ) {
-          const { s0, s1, s2, s3 } = decrypt(xk, b[i2 + 0], b[i2 + 1], b[i2 + 2], b[i2 + 3]);
-          o[i2++] = s0, o[i2++] = s1, o[i2++] = s2, o[i2++] = s3;
-        }
-        xk.fill(0);
-        return validatePCKS(out, pcks5);
-      }
-    };
-  });
-  var cbc = wrapCipher({ blockSize: 16, nonceLength: 16 }, function cbc2(key, iv, opts = {}) {
-    bytes3(key);
-    bytes3(iv, 16);
-    const pcks5 = !opts.disablePadding;
-    return {
-      encrypt: (plaintext, dst) => {
-        const xk = expandKeyLE(key);
-        const { b, o, out: _out } = validateBlockEncrypt(plaintext, pcks5, dst);
-        const n32 = u32(iv);
-        let s0 = n32[0], s1 = n32[1], s2 = n32[2], s3 = n32[3];
-        let i2 = 0;
-        for (; i2 + 4 <= b.length; ) {
-          s0 ^= b[i2 + 0], s1 ^= b[i2 + 1], s2 ^= b[i2 + 2], s3 ^= b[i2 + 3];
-          ({ s0, s1, s2, s3 } = encrypt(xk, s0, s1, s2, s3));
-          o[i2++] = s0, o[i2++] = s1, o[i2++] = s2, o[i2++] = s3;
-        }
-        if (pcks5) {
-          const tmp32 = padPCKS(plaintext.subarray(i2 * 4));
-          s0 ^= tmp32[0], s1 ^= tmp32[1], s2 ^= tmp32[2], s3 ^= tmp32[3];
-          ({ s0, s1, s2, s3 } = encrypt(xk, s0, s1, s2, s3));
-          o[i2++] = s0, o[i2++] = s1, o[i2++] = s2, o[i2++] = s3;
-        }
-        xk.fill(0);
-        return _out;
-      },
-      decrypt: (ciphertext, dst) => {
-        validateBlockDecrypt(ciphertext);
-        const xk = expandKeyDecLE(key);
-        const n32 = u32(iv);
-        const out = getDst(ciphertext.length, dst);
-        const b = u32(ciphertext);
-        const o = u32(out);
-        let s0 = n32[0], s1 = n32[1], s2 = n32[2], s3 = n32[3];
-        for (let i2 = 0; i2 + 4 <= b.length; ) {
-          const ps0 = s0, ps1 = s1, ps2 = s2, ps3 = s3;
-          s0 = b[i2 + 0], s1 = b[i2 + 1], s2 = b[i2 + 2], s3 = b[i2 + 3];
-          const { s0: o0, s1: o1, s2: o2, s3: o3 } = decrypt(xk, s0, s1, s2, s3);
-          o[i2++] = o0 ^ ps0, o[i2++] = o1 ^ ps1, o[i2++] = o2 ^ ps2, o[i2++] = o3 ^ ps3;
-        }
-        xk.fill(0);
-        return validatePCKS(out, pcks5);
-      }
-    };
-  });
-  function computeTag(fn, isLE4, key, data, AAD) {
-    const h = fn.create(key, data.length + (AAD?.length || 0));
-    if (AAD)
-      h.update(AAD);
-    h.update(data);
-    const num = new Uint8Array(16);
-    const view = createView3(num);
-    if (AAD)
-      setBigUint643(view, 0, BigInt(AAD.length * 8), isLE4);
-    setBigUint643(view, 8, BigInt(data.length * 8), isLE4);
-    h.update(num);
-    return h.digest();
-  }
-  var gcm = wrapCipher({ blockSize: 16, nonceLength: 12, tagLength: 16 }, function gcm2(key, nonce, AAD) {
-    bytes3(nonce);
-    if (nonce.length === 0)
-      throw new Error("aes/gcm: empty nonce");
-    const tagLength = 16;
-    function _computeTag(authKey, tagMask, data) {
-      const tag = computeTag(ghash, false, authKey, data, AAD);
-      for (let i2 = 0; i2 < tagMask.length; i2++)
-        tag[i2] ^= tagMask[i2];
-      return tag;
-    }
-    function deriveKeys() {
-      const xk = expandKeyLE(key);
-      const authKey = EMPTY_BLOCK.slice();
-      const counter = EMPTY_BLOCK.slice();
-      ctr32(xk, false, counter, counter, authKey);
-      if (nonce.length === 12) {
-        counter.set(nonce);
-      } else {
-        const nonceLen = EMPTY_BLOCK.slice();
-        const view = createView3(nonceLen);
-        setBigUint643(view, 8, BigInt(nonce.length * 8), false);
-        ghash.create(authKey).update(nonce).update(nonceLen).digestInto(counter);
-      }
-      const tagMask = ctr32(xk, false, counter, EMPTY_BLOCK);
-      return { xk, authKey, counter, tagMask };
-    }
-    return {
-      encrypt: (plaintext) => {
-        bytes3(plaintext);
-        const { xk, authKey, counter, tagMask } = deriveKeys();
-        const out = new Uint8Array(plaintext.length + tagLength);
-        ctr32(xk, false, counter, plaintext, out);
-        const tag = _computeTag(authKey, tagMask, out.subarray(0, out.length - tagLength));
-        out.set(tag, plaintext.length);
-        xk.fill(0);
-        return out;
-      },
-      decrypt: (ciphertext) => {
-        bytes3(ciphertext);
-        if (ciphertext.length < tagLength)
-          throw new Error(`aes/gcm: ciphertext less than tagLen (${tagLength})`);
-        const { xk, authKey, counter, tagMask } = deriveKeys();
-        const data = ciphertext.subarray(0, -tagLength);
-        const passedTag = ciphertext.subarray(-tagLength);
-        const tag = _computeTag(authKey, tagMask, data);
-        if (!equalBytes2(tag, passedTag))
-          throw new Error("aes/gcm: invalid ghash tag");
-        const out = ctr32(xk, false, counter, data);
-        authKey.fill(0);
-        tagMask.fill(0);
-        xk.fill(0);
-        return out;
-      }
-    };
-  });
-  var limit = (name, min, max) => (value) => {
-    if (!Number.isSafeInteger(value) || min > value || value > max)
-      throw new Error(`${name}: invalid value=${value}, must be [${min}..${max}]`);
-  };
-  var siv = wrapCipher({ blockSize: 16, nonceLength: 12, tagLength: 16 }, function siv2(key, nonce, AAD) {
-    const tagLength = 16;
-    const AAD_LIMIT = limit("AAD", 0, 2 ** 36);
-    const PLAIN_LIMIT = limit("plaintext", 0, 2 ** 36);
-    const NONCE_LIMIT = limit("nonce", 12, 12);
-    const CIPHER_LIMIT = limit("ciphertext", 16, 2 ** 36 + 16);
-    bytes3(nonce);
-    NONCE_LIMIT(nonce.length);
-    if (AAD) {
-      bytes3(AAD);
-      AAD_LIMIT(AAD.length);
-    }
-    function deriveKeys() {
-      const len = key.length;
-      if (len !== 16 && len !== 24 && len !== 32)
-        throw new Error(`key length must be 16, 24 or 32 bytes, got: ${len} bytes`);
-      const xk = expandKeyLE(key);
-      const encKey = new Uint8Array(len);
-      const authKey = new Uint8Array(16);
-      const n32 = u32(nonce);
-      let s0 = 0, s1 = n32[0], s2 = n32[1], s3 = n32[2];
-      let counter = 0;
-      for (const derivedKey of [authKey, encKey].map(u32)) {
-        const d32 = u32(derivedKey);
-        for (let i2 = 0; i2 < d32.length; i2 += 2) {
-          const { s0: o0, s1: o1 } = encrypt(xk, s0, s1, s2, s3);
-          d32[i2 + 0] = o0;
-          d32[i2 + 1] = o1;
-          s0 = ++counter;
-        }
-      }
-      xk.fill(0);
-      return { authKey, encKey: expandKeyLE(encKey) };
-    }
-    function _computeTag(encKey, authKey, data) {
-      const tag = computeTag(polyval, true, authKey, data, AAD);
-      for (let i2 = 0; i2 < 12; i2++)
-        tag[i2] ^= nonce[i2];
-      tag[15] &= 127;
-      const t32 = u32(tag);
-      let s0 = t32[0], s1 = t32[1], s2 = t32[2], s3 = t32[3];
-      ({ s0, s1, s2, s3 } = encrypt(encKey, s0, s1, s2, s3));
-      t32[0] = s0, t32[1] = s1, t32[2] = s2, t32[3] = s3;
-      return tag;
-    }
-    function processSiv(encKey, tag, input) {
-      let block = tag.slice();
-      block[15] |= 128;
-      return ctr32(encKey, true, block, input);
-    }
-    return {
-      encrypt: (plaintext) => {
-        bytes3(plaintext);
-        PLAIN_LIMIT(plaintext.length);
-        const { encKey, authKey } = deriveKeys();
-        const tag = _computeTag(encKey, authKey, plaintext);
-        const out = new Uint8Array(plaintext.length + tagLength);
-        out.set(tag, plaintext.length);
-        out.set(processSiv(encKey, tag, plaintext));
-        encKey.fill(0);
-        authKey.fill(0);
-        return out;
-      },
-      decrypt: (ciphertext) => {
-        bytes3(ciphertext);
-        CIPHER_LIMIT(ciphertext.length);
-        const tag = ciphertext.subarray(-tagLength);
-        const { encKey, authKey } = deriveKeys();
-        const plaintext = processSiv(encKey, tag, ciphertext.subarray(0, -tagLength));
-        const expectedTag = _computeTag(encKey, authKey, plaintext);
-        encKey.fill(0);
-        authKey.fill(0);
-        if (!equalBytes2(tag, expectedTag))
-          throw new Error("invalid polyval tag");
-        return plaintext;
-      }
-    };
-  });
-
-  // node_modules/@scure/base/lib/esm/index.js
-  function assertNumber(n) {
-    if (!Number.isSafeInteger(n))
-      throw new Error(`Wrong integer: ${n}`);
-  }
-  function chain(...args) {
-    const wrap = (a, b) => (c) => a(b(c));
-    const encode = Array.from(args).reverse().reduce((acc, i2) => acc ? wrap(acc, i2.encode) : i2.encode, void 0);
-    const decode = args.reduce((acc, i2) => acc ? wrap(acc, i2.decode) : i2.decode, void 0);
-    return { encode, decode };
-  }
-  function alphabet(alphabet2) {
-    return {
-      encode: (digits) => {
-        if (!Array.isArray(digits) || digits.length && typeof digits[0] !== "number")
-          throw new Error("alphabet.encode input should be an array of numbers");
-        return digits.map((i2) => {
-          assertNumber(i2);
-          if (i2 < 0 || i2 >= alphabet2.length)
-            throw new Error(`Digit index outside alphabet: ${i2} (alphabet: ${alphabet2.length})`);
-          return alphabet2[i2];
-        });
-      },
-      decode: (input) => {
-        if (!Array.isArray(input) || input.length && typeof input[0] !== "string")
-          throw new Error("alphabet.decode input should be array of strings");
-        return input.map((letter) => {
-          if (typeof letter !== "string")
-            throw new Error(`alphabet.decode: not string element=${letter}`);
-          const index = alphabet2.indexOf(letter);
-          if (index === -1)
-            throw new Error(`Unknown letter: "${letter}". Allowed: ${alphabet2}`);
-          return index;
-        });
-      }
-    };
-  }
-  function join(separator = "") {
-    if (typeof separator !== "string")
-      throw new Error("join separator should be string");
-    return {
-      encode: (from) => {
-        if (!Array.isArray(from) || from.length && typeof from[0] !== "string")
-          throw new Error("join.encode input should be array of strings");
-        for (let i2 of from)
-          if (typeof i2 !== "string")
-            throw new Error(`join.encode: non-string input=${i2}`);
-        return from.join(separator);
-      },
-      decode: (to) => {
-        if (typeof to !== "string")
-          throw new Error("join.decode input should be string");
-        return to.split(separator);
-      }
-    };
-  }
-  function padding(bits, chr = "=") {
-    assertNumber(bits);
-    if (typeof chr !== "string")
-      throw new Error("padding chr should be string");
-    return {
-      encode(data) {
-        if (!Array.isArray(data) || data.length && typeof data[0] !== "string")
-          throw new Error("padding.encode input should be array of strings");
-        for (let i2 of data)
-          if (typeof i2 !== "string")
-            throw new Error(`padding.encode: non-string input=${i2}`);
-        while (data.length * bits % 8)
-          data.push(chr);
-        return data;
-      },
-      decode(input) {
-        if (!Array.isArray(input) || input.length && typeof input[0] !== "string")
-          throw new Error("padding.encode input should be array of strings");
-        for (let i2 of input)
-          if (typeof i2 !== "string")
-            throw new Error(`padding.decode: non-string input=${i2}`);
-        let end = input.length;
-        if (end * bits % 8)
-          throw new Error("Invalid padding: string should have whole number of bytes");
-        for (; end > 0 && input[end - 1] === chr; end--) {
-          if (!((end - 1) * bits % 8))
-            throw new Error("Invalid padding: string has too much padding");
-        }
-        return input.slice(0, end);
-      }
-    };
-  }
-  function normalize(fn) {
-    if (typeof fn !== "function")
-      throw new Error("normalize fn should be function");
-    return { encode: (from) => from, decode: (to) => fn(to) };
-  }
-  function convertRadix(data, from, to) {
-    if (from < 2)
-      throw new Error(`convertRadix: wrong from=${from}, base cannot be less than 2`);
-    if (to < 2)
-      throw new Error(`convertRadix: wrong to=${to}, base cannot be less than 2`);
-    if (!Array.isArray(data))
-      throw new Error("convertRadix: data should be array");
-    if (!data.length)
-      return [];
-    let pos = 0;
-    const res = [];
-    const digits = Array.from(data);
-    digits.forEach((d) => {
-      assertNumber(d);
-      if (d < 0 || d >= from)
-        throw new Error(`Wrong integer: ${d}`);
-    });
-    while (true) {
-      let carry = 0;
-      let done = true;
-      for (let i2 = pos; i2 < digits.length; i2++) {
-        const digit = digits[i2];
-        const digitBase = from * carry + digit;
-        if (!Number.isSafeInteger(digitBase) || from * carry / from !== carry || digitBase - digit !== from * carry) {
-          throw new Error("convertRadix: carry overflow");
-        }
-        carry = digitBase % to;
-        digits[i2] = Math.floor(digitBase / to);
-        if (!Number.isSafeInteger(digits[i2]) || digits[i2] * to + carry !== digitBase)
-          throw new Error("convertRadix: carry overflow");
-        if (!done)
-          continue;
-        else if (!digits[i2])
-          pos = i2;
-        else
-          done = false;
-      }
-      res.push(carry);
-      if (done)
-        break;
-    }
-    for (let i2 = 0; i2 < data.length - 1 && data[i2] === 0; i2++)
-      res.push(0);
-    return res.reverse();
-  }
-  var gcd = (a, b) => !b ? a : gcd(b, a % b);
-  var radix2carry = (from, to) => from + (to - gcd(from, to));
-  function convertRadix2(data, from, to, padding2) {
-    if (!Array.isArray(data))
-      throw new Error("convertRadix2: data should be array");
-    if (from <= 0 || from > 32)
-      throw new Error(`convertRadix2: wrong from=${from}`);
-    if (to <= 0 || to > 32)
-      throw new Error(`convertRadix2: wrong to=${to}`);
-    if (radix2carry(from, to) > 32) {
-      throw new Error(`convertRadix2: carry overflow from=${from} to=${to} carryBits=${radix2carry(from, to)}`);
-    }
-    let carry = 0;
-    let pos = 0;
-    const mask = 2 ** to - 1;
-    const res = [];
-    for (const n of data) {
-      assertNumber(n);
-      if (n >= 2 ** from)
-        throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);
-      carry = carry << from | n;
-      if (pos + from > 32)
-        throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);
-      pos += from;
-      for (; pos >= to; pos -= to)
-        res.push((carry >> pos - to & mask) >>> 0);
-      carry &= 2 ** pos - 1;
-    }
-    carry = carry << to - pos & mask;
-    if (!padding2 && pos >= from)
-      throw new Error("Excess padding");
-    if (!padding2 && carry)
-      throw new Error(`Non-zero padding: ${carry}`);
-    if (padding2 && pos > 0)
-      res.push(carry >>> 0);
-    return res;
-  }
-  function radix(num) {
-    assertNumber(num);
-    return {
-      encode: (bytes4) => {
-        if (!(bytes4 instanceof Uint8Array))
-          throw new Error("radix.encode input should be Uint8Array");
-        return convertRadix(Array.from(bytes4), 2 ** 8, num);
-      },
-      decode: (digits) => {
-        if (!Array.isArray(digits) || digits.length && typeof digits[0] !== "number")
-          throw new Error("radix.decode input should be array of strings");
-        return Uint8Array.from(convertRadix(digits, num, 2 ** 8));
-      }
-    };
-  }
-  function radix2(bits, revPadding = false) {
-    assertNumber(bits);
-    if (bits <= 0 || bits > 32)
-      throw new Error("radix2: bits should be in (0..32]");
-    if (radix2carry(8, bits) > 32 || radix2carry(bits, 8) > 32)
-      throw new Error("radix2: carry overflow");
-    return {
-      encode: (bytes4) => {
-        if (!(bytes4 instanceof Uint8Array))
-          throw new Error("radix2.encode input should be Uint8Array");
-        return convertRadix2(Array.from(bytes4), 8, bits, !revPadding);
-      },
-      decode: (digits) => {
-        if (!Array.isArray(digits) || digits.length && typeof digits[0] !== "number")
-          throw new Error("radix2.decode input should be array of strings");
-        return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));
-      }
-    };
-  }
-  function unsafeWrapper(fn) {
-    if (typeof fn !== "function")
-      throw new Error("unsafeWrapper fn should be function");
-    return function(...args) {
-      try {
-        return fn.apply(null, args);
-      } catch (e) {
-      }
-    };
-  }
-  var base16 = chain(radix2(4), alphabet("0123456789ABCDEF"), join(""));
-  var base32 = chain(radix2(5), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), padding(5), join(""));
-  var base32hex = chain(radix2(5), alphabet("0123456789ABCDEFGHIJKLMNOPQRSTUV"), padding(5), join(""));
-  var base32crockford = chain(radix2(5), alphabet("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), join(""), normalize((s) => s.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-  var base64 = chain(radix2(6), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), padding(6), join(""));
-  var base64url = chain(radix2(6), alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), padding(6), join(""));
-  var genBase58 = (abc) => chain(radix(58), alphabet(abc), join(""));
-  var base58 = genBase58("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-  var base58flickr = genBase58("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
-  var base58xrp = genBase58("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
-  var XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];
-  var base58xmr = {
-    encode(data) {
-      let res = "";
-      for (let i2 = 0; i2 < data.length; i2 += 8) {
-        const block = data.subarray(i2, i2 + 8);
-        res += base58.encode(block).padStart(XMR_BLOCK_LEN[block.length], "1");
-      }
-      return res;
-    },
-    decode(str) {
-      let res = [];
-      for (let i2 = 0; i2 < str.length; i2 += 11) {
-        const slice = str.slice(i2, i2 + 11);
-        const blockLen = XMR_BLOCK_LEN.indexOf(slice.length);
-        const block = base58.decode(slice);
-        for (let j = 0; j < block.length - blockLen; j++) {
-          if (block[j] !== 0)
-            throw new Error("base58xmr: wrong padding");
-        }
-        res = res.concat(Array.from(block.slice(block.length - blockLen)));
-      }
-      return Uint8Array.from(res);
-    }
-  };
-  var BECH_ALPHABET = chain(alphabet("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), join(""));
-  var POLYMOD_GENERATORS = [996825010, 642813549, 513874426, 1027748829, 705979059];
-  function bech32Polymod(pre) {
-    const b = pre >> 25;
-    let chk = (pre & 33554431) << 5;
-    for (let i2 = 0; i2 < POLYMOD_GENERATORS.length; i2++) {
-      if ((b >> i2 & 1) === 1)
-        chk ^= POLYMOD_GENERATORS[i2];
-    }
-    return chk;
-  }
-  function bechChecksum(prefix, words, encodingConst = 1) {
-    const len = prefix.length;
-    let chk = 1;
-    for (let i2 = 0; i2 < len; i2++) {
-      const c = prefix.charCodeAt(i2);
-      if (c < 33 || c > 126)
-        throw new Error(`Invalid prefix (${prefix})`);
-      chk = bech32Polymod(chk) ^ c >> 5;
-    }
-    chk = bech32Polymod(chk);
-    for (let i2 = 0; i2 < len; i2++)
-      chk = bech32Polymod(chk) ^ prefix.charCodeAt(i2) & 31;
-    for (let v of words)
-      chk = bech32Polymod(chk) ^ v;
-    for (let i2 = 0; i2 < 6; i2++)
-      chk = bech32Polymod(chk);
-    chk ^= encodingConst;
-    return BECH_ALPHABET.encode(convertRadix2([chk % 2 ** 30], 30, 5, false));
-  }
-  function genBech32(encoding) {
-    const ENCODING_CONST = encoding === "bech32" ? 1 : 734539939;
-    const _words = radix2(5);
-    const fromWords = _words.decode;
-    const toWords = _words.encode;
-    const fromWordsUnsafe = unsafeWrapper(fromWords);
-    function encode(prefix, words, limit2 = 90) {
-      if (typeof prefix !== "string")
-        throw new Error(`bech32.encode prefix should be string, not ${typeof prefix}`);
-      if (!Array.isArray(words) || words.length && typeof words[0] !== "number")
-        throw new Error(`bech32.encode words should be array of numbers, not ${typeof words}`);
-      const actualLength = prefix.length + 7 + words.length;
-      if (limit2 !== false && actualLength > limit2)
-        throw new TypeError(`Length ${actualLength} exceeds limit ${limit2}`);
-      prefix = prefix.toLowerCase();
-      return `${prefix}1${BECH_ALPHABET.encode(words)}${bechChecksum(prefix, words, ENCODING_CONST)}`;
-    }
-    function decode(str, limit2 = 90) {
-      if (typeof str !== "string")
-        throw new Error(`bech32.decode input should be string, not ${typeof str}`);
-      if (str.length < 8 || limit2 !== false && str.length > limit2)
-        throw new TypeError(`Wrong string length: ${str.length} (${str}). Expected (8..${limit2})`);
-      const lowered = str.toLowerCase();
-      if (str !== lowered && str !== str.toUpperCase())
-        throw new Error(`String must be lowercase or uppercase`);
-      str = lowered;
-      const sepIndex = str.lastIndexOf("1");
-      if (sepIndex === 0 || sepIndex === -1)
-        throw new Error(`Letter "1" must be present between prefix and data only`);
-      const prefix = str.slice(0, sepIndex);
-      const _words2 = str.slice(sepIndex + 1);
-      if (_words2.length < 6)
-        throw new Error("Data must be at least 6 characters long");
-      const words = BECH_ALPHABET.decode(_words2).slice(0, -6);
-      const sum = bechChecksum(prefix, words, ENCODING_CONST);
-      if (!_words2.endsWith(sum))
-        throw new Error(`Invalid checksum in ${str}: expected "${sum}"`);
-      return { prefix, words };
-    }
-    const decodeUnsafe = unsafeWrapper(decode);
-    function decodeToBytes(str) {
-      const { prefix, words } = decode(str, false);
-      return { prefix, words, bytes: fromWords(words) };
-    }
-    return { encode, decode, decodeToBytes, decodeUnsafe, fromWords, fromWordsUnsafe, toWords };
-  }
-  var bech32 = genBech32("bech32");
-  var bech32m = genBech32("bech32m");
-  var utf8 = {
-    encode: (data) => new TextDecoder().decode(data),
-    decode: (str) => new TextEncoder().encode(str)
-  };
-  var hex = chain(radix2(4), alphabet("0123456789abcdef"), join(""), normalize((s) => {
-    if (typeof s !== "string" || s.length % 2)
-      throw new TypeError(`hex.decode: expected string, got ${typeof s} with length ${s.length}`);
-    return s.toLowerCase();
-  }));
-  var CODERS = {
-    utf8,
-    hex,
-    base16,
-    base32,
-    base64,
-    base64url,
-    base58,
-    base58xmr
-  };
-  var coderTypeError = `Invalid encoding type. Available types: ${Object.keys(CODERS).join(", ")}`;
-
-  // node_modules/@noble/ciphers/esm/_poly1305.js
-  var u8to16 = (a, i2) => a[i2++] & 255 | (a[i2++] & 255) << 8;
-  var Poly1305 = class {
-    constructor(key) {
-      this.blockLen = 16;
-      this.outputLen = 16;
-      this.buffer = new Uint8Array(16);
-      this.r = new Uint16Array(10);
-      this.h = new Uint16Array(10);
-      this.pad = new Uint16Array(8);
-      this.pos = 0;
-      this.finished = false;
-      key = toBytes3(key);
-      bytes3(key, 32);
-      const t0 = u8to16(key, 0);
-      const t1 = u8to16(key, 2);
-      const t2 = u8to16(key, 4);
-      const t3 = u8to16(key, 6);
-      const t4 = u8to16(key, 8);
-      const t5 = u8to16(key, 10);
-      const t6 = u8to16(key, 12);
-      const t7 = u8to16(key, 14);
-      this.r[0] = t0 & 8191;
-      this.r[1] = (t0 >>> 13 | t1 << 3) & 8191;
-      this.r[2] = (t1 >>> 10 | t2 << 6) & 7939;
-      this.r[3] = (t2 >>> 7 | t3 << 9) & 8191;
-      this.r[4] = (t3 >>> 4 | t4 << 12) & 255;
-      this.r[5] = t4 >>> 1 & 8190;
-      this.r[6] = (t4 >>> 14 | t5 << 2) & 8191;
-      this.r[7] = (t5 >>> 11 | t6 << 5) & 8065;
-      this.r[8] = (t6 >>> 8 | t7 << 8) & 8191;
-      this.r[9] = t7 >>> 5 & 127;
-      for (let i2 = 0; i2 < 8; i2++)
-        this.pad[i2] = u8to16(key, 16 + 2 * i2);
-    }
-    process(data, offset, isLast = false) {
-      const hibit = isLast ? 0 : 1 << 11;
-      const { h, r } = this;
-      const r0 = r[0];
-      const r1 = r[1];
-      const r2 = r[2];
-      const r3 = r[3];
-      const r4 = r[4];
-      const r5 = r[5];
-      const r6 = r[6];
-      const r7 = r[7];
-      const r8 = r[8];
-      const r9 = r[9];
-      const t0 = u8to16(data, offset + 0);
-      const t1 = u8to16(data, offset + 2);
-      const t2 = u8to16(data, offset + 4);
-      const t3 = u8to16(data, offset + 6);
-      const t4 = u8to16(data, offset + 8);
-      const t5 = u8to16(data, offset + 10);
-      const t6 = u8to16(data, offset + 12);
-      const t7 = u8to16(data, offset + 14);
-      let h0 = h[0] + (t0 & 8191);
-      let h1 = h[1] + ((t0 >>> 13 | t1 << 3) & 8191);
-      let h2 = h[2] + ((t1 >>> 10 | t2 << 6) & 8191);
-      let h3 = h[3] + ((t2 >>> 7 | t3 << 9) & 8191);
-      let h4 = h[4] + ((t3 >>> 4 | t4 << 12) & 8191);
-      let h5 = h[5] + (t4 >>> 1 & 8191);
-      let h6 = h[6] + ((t4 >>> 14 | t5 << 2) & 8191);
-      let h7 = h[7] + ((t5 >>> 11 | t6 << 5) & 8191);
-      let h8 = h[8] + ((t6 >>> 8 | t7 << 8) & 8191);
-      let h9 = h[9] + (t7 >>> 5 | hibit);
-      let c = 0;
-      let d0 = c + h0 * r0 + h1 * (5 * r9) + h2 * (5 * r8) + h3 * (5 * r7) + h4 * (5 * r6);
-      c = d0 >>> 13;
-      d0 &= 8191;
-      d0 += h5 * (5 * r5) + h6 * (5 * r4) + h7 * (5 * r3) + h8 * (5 * r2) + h9 * (5 * r1);
-      c += d0 >>> 13;
-      d0 &= 8191;
-      let d1 = c + h0 * r1 + h1 * r0 + h2 * (5 * r9) + h3 * (5 * r8) + h4 * (5 * r7);
-      c = d1 >>> 13;
-      d1 &= 8191;
-      d1 += h5 * (5 * r6) + h6 * (5 * r5) + h7 * (5 * r4) + h8 * (5 * r3) + h9 * (5 * r2);
-      c += d1 >>> 13;
-      d1 &= 8191;
-      let d2 = c + h0 * r2 + h1 * r1 + h2 * r0 + h3 * (5 * r9) + h4 * (5 * r8);
-      c = d2 >>> 13;
-      d2 &= 8191;
-      d2 += h5 * (5 * r7) + h6 * (5 * r6) + h7 * (5 * r5) + h8 * (5 * r4) + h9 * (5 * r3);
-      c += d2 >>> 13;
-      d2 &= 8191;
-      let d3 = c + h0 * r3 + h1 * r2 + h2 * r1 + h3 * r0 + h4 * (5 * r9);
-      c = d3 >>> 13;
-      d3 &= 8191;
-      d3 += h5 * (5 * r8) + h6 * (5 * r7) + h7 * (5 * r6) + h8 * (5 * r5) + h9 * (5 * r4);
-      c += d3 >>> 13;
-      d3 &= 8191;
-      let d4 = c + h0 * r4 + h1 * r3 + h2 * r2 + h3 * r1 + h4 * r0;
-      c = d4 >>> 13;
-      d4 &= 8191;
-      d4 += h5 * (5 * r9) + h6 * (5 * r8) + h7 * (5 * r7) + h8 * (5 * r6) + h9 * (5 * r5);
-      c += d4 >>> 13;
-      d4 &= 8191;
-      let d5 = c + h0 * r5 + h1 * r4 + h2 * r3 + h3 * r2 + h4 * r1;
-      c = d5 >>> 13;
-      d5 &= 8191;
-      d5 += h5 * r0 + h6 * (5 * r9) + h7 * (5 * r8) + h8 * (5 * r7) + h9 * (5 * r6);
-      c += d5 >>> 13;
-      d5 &= 8191;
-      let d6 = c + h0 * r6 + h1 * r5 + h2 * r4 + h3 * r3 + h4 * r2;
-      c = d6 >>> 13;
-      d6 &= 8191;
-      d6 += h5 * r1 + h6 * r0 + h7 * (5 * r9) + h8 * (5 * r8) + h9 * (5 * r7);
-      c += d6 >>> 13;
-      d6 &= 8191;
-      let d7 = c + h0 * r7 + h1 * r6 + h2 * r5 + h3 * r4 + h4 * r3;
-      c = d7 >>> 13;
-      d7 &= 8191;
-      d7 += h5 * r2 + h6 * r1 + h7 * r0 + h8 * (5 * r9) + h9 * (5 * r8);
-      c += d7 >>> 13;
-      d7 &= 8191;
-      let d8 = c + h0 * r8 + h1 * r7 + h2 * r6 + h3 * r5 + h4 * r4;
-      c = d8 >>> 13;
-      d8 &= 8191;
-      d8 += h5 * r3 + h6 * r2 + h7 * r1 + h8 * r0 + h9 * (5 * r9);
-      c += d8 >>> 13;
-      d8 &= 8191;
-      let d9 = c + h0 * r9 + h1 * r8 + h2 * r7 + h3 * r6 + h4 * r5;
-      c = d9 >>> 13;
-      d9 &= 8191;
-      d9 += h5 * r4 + h6 * r3 + h7 * r2 + h8 * r1 + h9 * r0;
-      c += d9 >>> 13;
-      d9 &= 8191;
-      c = (c << 2) + c | 0;
-      c = c + d0 | 0;
-      d0 = c & 8191;
-      c = c >>> 13;
-      d1 += c;
-      h[0] = d0;
-      h[1] = d1;
-      h[2] = d2;
-      h[3] = d3;
-      h[4] = d4;
-      h[5] = d5;
-      h[6] = d6;
-      h[7] = d7;
-      h[8] = d8;
-      h[9] = d9;
-    }
-    finalize() {
-      const { h, pad } = this;
-      const g = new Uint16Array(10);
-      let c = h[1] >>> 13;
-      h[1] &= 8191;
-      for (let i2 = 2; i2 < 10; i2++) {
-        h[i2] += c;
-        c = h[i2] >>> 13;
-        h[i2] &= 8191;
-      }
-      h[0] += c * 5;
-      c = h[0] >>> 13;
-      h[0] &= 8191;
-      h[1] += c;
-      c = h[1] >>> 13;
-      h[1] &= 8191;
-      h[2] += c;
-      g[0] = h[0] + 5;
-      c = g[0] >>> 13;
-      g[0] &= 8191;
-      for (let i2 = 1; i2 < 10; i2++) {
-        g[i2] = h[i2] + c;
-        c = g[i2] >>> 13;
-        g[i2] &= 8191;
-      }
-      g[9] -= 1 << 13;
-      let mask = (c ^ 1) - 1;
-      for (let i2 = 0; i2 < 10; i2++)
-        g[i2] &= mask;
-      mask = ~mask;
-      for (let i2 = 0; i2 < 10; i2++)
-        h[i2] = h[i2] & mask | g[i2];
-      h[0] = (h[0] | h[1] << 13) & 65535;
-      h[1] = (h[1] >>> 3 | h[2] << 10) & 65535;
-      h[2] = (h[2] >>> 6 | h[3] << 7) & 65535;
-      h[3] = (h[3] >>> 9 | h[4] << 4) & 65535;
-      h[4] = (h[4] >>> 12 | h[5] << 1 | h[6] << 14) & 65535;
-      h[5] = (h[6] >>> 2 | h[7] << 11) & 65535;
-      h[6] = (h[7] >>> 5 | h[8] << 8) & 65535;
-      h[7] = (h[8] >>> 8 | h[9] << 5) & 65535;
-      let f = h[0] + pad[0];
-      h[0] = f & 65535;
-      for (let i2 = 1; i2 < 8; i2++) {
-        f = (h[i2] + pad[i2] | 0) + (f >>> 16) | 0;
-        h[i2] = f & 65535;
-      }
-    }
-    update(data) {
-      exists3(this);
-      const { buffer, blockLen } = this;
-      data = toBytes3(data);
-      const len = data.length;
-      for (let pos = 0; pos < len; ) {
-        const take = Math.min(blockLen - this.pos, len - pos);
-        if (take === blockLen) {
-          for (; blockLen <= len - pos; pos += blockLen)
-            this.process(data, pos);
-          continue;
-        }
-        buffer.set(data.subarray(pos, pos + take), this.pos);
-        this.pos += take;
-        pos += take;
-        if (this.pos === blockLen) {
-          this.process(buffer, 0, false);
-          this.pos = 0;
-        }
-      }
-      return this;
-    }
-    destroy() {
-      this.h.fill(0);
-      this.r.fill(0);
-      this.buffer.fill(0);
-      this.pad.fill(0);
-    }
-    digestInto(out) {
-      exists3(this);
-      output3(out, this);
-      this.finished = true;
-      const { buffer, h } = this;
-      let { pos } = this;
-      if (pos) {
-        buffer[pos++] = 1;
-        for (; pos < 16; pos++)
-          buffer[pos] = 0;
-        this.process(buffer, 0, true);
-      }
-      this.finalize();
-      let opos = 0;
-      for (let i2 = 0; i2 < 8; i2++) {
-        out[opos++] = h[i2] >>> 0;
-        out[opos++] = h[i2] >>> 8;
-      }
-      return out;
-    }
-    digest() {
-      const { buffer, outputLen } = this;
-      this.digestInto(buffer);
-      const res = buffer.slice(0, outputLen);
-      this.destroy();
-      return res;
-    }
-  };
-  function wrapConstructorWithKey2(hashCons) {
-    const hashC = (msg, key) => hashCons(key).update(toBytes3(msg)).digest();
-    const tmp = hashCons(new Uint8Array(32));
-    hashC.outputLen = tmp.outputLen;
-    hashC.blockLen = tmp.blockLen;
-    hashC.create = (key) => hashCons(key);
-    return hashC;
-  }
-  var poly1305 = wrapConstructorWithKey2((key) => new Poly1305(key));
-
-  // node_modules/@noble/ciphers/esm/_arx.js
-  var sigma16 = utf8ToBytes4("expand 16-byte k");
-  var sigma32 = utf8ToBytes4("expand 32-byte k");
-  var sigma16_32 = u32(sigma16);
-  var sigma32_32 = u32(sigma32);
-  function rotl(a, b) {
-    return a << b | a >>> 32 - b;
-  }
-  function isAligned32(b) {
-    return b.byteOffset % 4 === 0;
-  }
-  var BLOCK_LEN = 64;
-  var BLOCK_LEN32 = 16;
-  var MAX_COUNTER = 2 ** 32 - 1;
-  var U32_EMPTY = new Uint32Array();
-  function runCipher(core, sigma, key, nonce, data, output4, counter, rounds) {
-    const len = data.length;
-    const block = new Uint8Array(BLOCK_LEN);
-    const b32 = u32(block);
-    const isAligned = isAligned32(data) && isAligned32(output4);
-    const d32 = isAligned ? u32(data) : U32_EMPTY;
-    const o32 = isAligned ? u32(output4) : U32_EMPTY;
-    for (let pos = 0; pos < len; counter++) {
-      core(sigma, key, nonce, b32, counter, rounds);
-      if (counter >= MAX_COUNTER)
-        throw new Error("arx: counter overflow");
-      const take = Math.min(BLOCK_LEN, len - pos);
-      if (isAligned && take === BLOCK_LEN) {
-        const pos32 = pos / 4;
-        if (pos % 4 !== 0)
-          throw new Error("arx: invalid block position");
-        for (let j = 0, posj; j < BLOCK_LEN32; j++) {
-          posj = pos32 + j;
-          o32[posj] = d32[posj] ^ b32[j];
-        }
-        pos += BLOCK_LEN;
-        continue;
-      }
-      for (let j = 0, posj; j < take; j++) {
-        posj = pos + j;
-        output4[posj] = data[posj] ^ block[j];
-      }
-      pos += take;
-    }
-  }
-  function createCipher(core, opts) {
-    const { allowShortKeys, extendNonceFn, counterLength, counterRight, rounds } = checkOpts({ allowShortKeys: false, counterLength: 8, counterRight: false, rounds: 20 }, opts);
-    if (typeof core !== "function")
-      throw new Error("core must be a function");
-    number3(counterLength);
-    number3(rounds);
-    bool2(counterRight);
-    bool2(allowShortKeys);
-    return (key, nonce, data, output4, counter = 0) => {
-      bytes3(key);
-      bytes3(nonce);
-      bytes3(data);
-      const len = data.length;
-      if (!output4)
-        output4 = new Uint8Array(len);
-      bytes3(output4);
-      number3(counter);
-      if (counter < 0 || counter >= MAX_COUNTER)
-        throw new Error("arx: counter overflow");
-      if (output4.length < len)
-        throw new Error(`arx: output (${output4.length}) is shorter than data (${len})`);
-      const toClean = [];
-      let l = key.length, k, sigma;
-      if (l === 32) {
-        k = key.slice();
-        toClean.push(k);
-        sigma = sigma32_32;
-      } else if (l === 16 && allowShortKeys) {
-        k = new Uint8Array(32);
-        k.set(key);
-        k.set(key, 16);
-        sigma = sigma16_32;
-        toClean.push(k);
-      } else {
-        throw new Error(`arx: invalid 32-byte key, got length=${l}`);
-      }
-      if (!isAligned32(nonce)) {
-        nonce = nonce.slice();
-        toClean.push(nonce);
-      }
-      const k32 = u32(k);
-      if (extendNonceFn) {
-        if (nonce.length !== 24)
-          throw new Error(`arx: extended nonce must be 24 bytes`);
-        extendNonceFn(sigma, k32, u32(nonce.subarray(0, 16)), k32);
-        nonce = nonce.subarray(16);
-      }
-      const nonceNcLen = 16 - counterLength;
-      if (nonceNcLen !== nonce.length)
-        throw new Error(`arx: nonce must be ${nonceNcLen} or 16 bytes`);
-      if (nonceNcLen !== 12) {
-        const nc = new Uint8Array(12);
-        nc.set(nonce, counterRight ? 0 : 12 - nonce.length);
-        nonce = nc;
-        toClean.push(nonce);
-      }
-      const n32 = u32(nonce);
-      runCipher(core, sigma, k32, n32, data, output4, counter, rounds);
-      while (toClean.length > 0)
-        toClean.pop().fill(0);
-      return output4;
-    };
-  }
-
-  // node_modules/@noble/ciphers/esm/chacha.js
-  function chachaCore(s, k, n, out, cnt, rounds = 20) {
-    let y00 = s[0], y01 = s[1], y02 = s[2], y03 = s[3], y04 = k[0], y05 = k[1], y06 = k[2], y07 = k[3], y08 = k[4], y09 = k[5], y10 = k[6], y11 = k[7], y12 = cnt, y13 = n[0], y14 = n[1], y15 = n[2];
-    let x00 = y00, x01 = y01, x02 = y02, x03 = y03, x04 = y04, x05 = y05, x06 = y06, x07 = y07, x08 = y08, x09 = y09, x10 = y10, x11 = y11, x12 = y12, x13 = y13, x14 = y14, x15 = y15;
-    for (let r = 0; r < rounds; r += 2) {
-      x00 = x00 + x04 | 0;
-      x12 = rotl(x12 ^ x00, 16);
-      x08 = x08 + x12 | 0;
-      x04 = rotl(x04 ^ x08, 12);
-      x00 = x00 + x04 | 0;
-      x12 = rotl(x12 ^ x00, 8);
-      x08 = x08 + x12 | 0;
-      x04 = rotl(x04 ^ x08, 7);
-      x01 = x01 + x05 | 0;
-      x13 = rotl(x13 ^ x01, 16);
-      x09 = x09 + x13 | 0;
-      x05 = rotl(x05 ^ x09, 12);
-      x01 = x01 + x05 | 0;
-      x13 = rotl(x13 ^ x01, 8);
-      x09 = x09 + x13 | 0;
-      x05 = rotl(x05 ^ x09, 7);
-      x02 = x02 + x06 | 0;
-      x14 = rotl(x14 ^ x02, 16);
-      x10 = x10 + x14 | 0;
-      x06 = rotl(x06 ^ x10, 12);
-      x02 = x02 + x06 | 0;
-      x14 = rotl(x14 ^ x02, 8);
-      x10 = x10 + x14 | 0;
-      x06 = rotl(x06 ^ x10, 7);
-      x03 = x03 + x07 | 0;
-      x15 = rotl(x15 ^ x03, 16);
-      x11 = x11 + x15 | 0;
-      x07 = rotl(x07 ^ x11, 12);
-      x03 = x03 + x07 | 0;
-      x15 = rotl(x15 ^ x03, 8);
-      x11 = x11 + x15 | 0;
-      x07 = rotl(x07 ^ x11, 7);
-      x00 = x00 + x05 | 0;
-      x15 = rotl(x15 ^ x00, 16);
-      x10 = x10 + x15 | 0;
-      x05 = rotl(x05 ^ x10, 12);
-      x00 = x00 + x05 | 0;
-      x15 = rotl(x15 ^ x00, 8);
-      x10 = x10 + x15 | 0;
-      x05 = rotl(x05 ^ x10, 7);
-      x01 = x01 + x06 | 0;
-      x12 = rotl(x12 ^ x01, 16);
-      x11 = x11 + x12 | 0;
-      x06 = rotl(x06 ^ x11, 12);
-      x01 = x01 + x06 | 0;
-      x12 = rotl(x12 ^ x01, 8);
-      x11 = x11 + x12 | 0;
-      x06 = rotl(x06 ^ x11, 7);
-      x02 = x02 + x07 | 0;
-      x13 = rotl(x13 ^ x02, 16);
-      x08 = x08 + x13 | 0;
-      x07 = rotl(x07 ^ x08, 12);
-      x02 = x02 + x07 | 0;
-      x13 = rotl(x13 ^ x02, 8);
-      x08 = x08 + x13 | 0;
-      x07 = rotl(x07 ^ x08, 7);
-      x03 = x03 + x04 | 0;
-      x14 = rotl(x14 ^ x03, 16);
-      x09 = x09 + x14 | 0;
-      x04 = rotl(x04 ^ x09, 12);
-      x03 = x03 + x04 | 0;
-      x14 = rotl(x14 ^ x03, 8);
-      x09 = x09 + x14 | 0;
-      x04 = rotl(x04 ^ x09, 7);
-    }
-    let oi = 0;
-    out[oi++] = y00 + x00 | 0;
-    out[oi++] = y01 + x01 | 0;
-    out[oi++] = y02 + x02 | 0;
-    out[oi++] = y03 + x03 | 0;
-    out[oi++] = y04 + x04 | 0;
-    out[oi++] = y05 + x05 | 0;
-    out[oi++] = y06 + x06 | 0;
-    out[oi++] = y07 + x07 | 0;
-    out[oi++] = y08 + x08 | 0;
-    out[oi++] = y09 + x09 | 0;
-    out[oi++] = y10 + x10 | 0;
-    out[oi++] = y11 + x11 | 0;
-    out[oi++] = y12 + x12 | 0;
-    out[oi++] = y13 + x13 | 0;
-    out[oi++] = y14 + x14 | 0;
-    out[oi++] = y15 + x15 | 0;
-  }
-  function hchacha(s, k, i2, o32) {
-    let x00 = s[0], x01 = s[1], x02 = s[2], x03 = s[3], x04 = k[0], x05 = k[1], x06 = k[2], x07 = k[3], x08 = k[4], x09 = k[5], x10 = k[6], x11 = k[7], x12 = i2[0], x13 = i2[1], x14 = i2[2], x15 = i2[3];
-    for (let r = 0; r < 20; r += 2) {
-      x00 = x00 + x04 | 0;
-      x12 = rotl(x12 ^ x00, 16);
-      x08 = x08 + x12 | 0;
-      x04 = rotl(x04 ^ x08, 12);
-      x00 = x00 + x04 | 0;
-      x12 = rotl(x12 ^ x00, 8);
-      x08 = x08 + x12 | 0;
-      x04 = rotl(x04 ^ x08, 7);
-      x01 = x01 + x05 | 0;
-      x13 = rotl(x13 ^ x01, 16);
-      x09 = x09 + x13 | 0;
-      x05 = rotl(x05 ^ x09, 12);
-      x01 = x01 + x05 | 0;
-      x13 = rotl(x13 ^ x01, 8);
-      x09 = x09 + x13 | 0;
-      x05 = rotl(x05 ^ x09, 7);
-      x02 = x02 + x06 | 0;
-      x14 = rotl(x14 ^ x02, 16);
-      x10 = x10 + x14 | 0;
-      x06 = rotl(x06 ^ x10, 12);
-      x02 = x02 + x06 | 0;
-      x14 = rotl(x14 ^ x02, 8);
-      x10 = x10 + x14 | 0;
-      x06 = rotl(x06 ^ x10, 7);
-      x03 = x03 + x07 | 0;
-      x15 = rotl(x15 ^ x03, 16);
-      x11 = x11 + x15 | 0;
-      x07 = rotl(x07 ^ x11, 12);
-      x03 = x03 + x07 | 0;
-      x15 = rotl(x15 ^ x03, 8);
-      x11 = x11 + x15 | 0;
-      x07 = rotl(x07 ^ x11, 7);
-      x00 = x00 + x05 | 0;
-      x15 = rotl(x15 ^ x00, 16);
-      x10 = x10 + x15 | 0;
-      x05 = rotl(x05 ^ x10, 12);
-      x00 = x00 + x05 | 0;
-      x15 = rotl(x15 ^ x00, 8);
-      x10 = x10 + x15 | 0;
-      x05 = rotl(x05 ^ x10, 7);
-      x01 = x01 + x06 | 0;
-      x12 = rotl(x12 ^ x01, 16);
-      x11 = x11 + x12 | 0;
-      x06 = rotl(x06 ^ x11, 12);
-      x01 = x01 + x06 | 0;
-      x12 = rotl(x12 ^ x01, 8);
-      x11 = x11 + x12 | 0;
-      x06 = rotl(x06 ^ x11, 7);
-      x02 = x02 + x07 | 0;
-      x13 = rotl(x13 ^ x02, 16);
-      x08 = x08 + x13 | 0;
-      x07 = rotl(x07 ^ x08, 12);
-      x02 = x02 + x07 | 0;
-      x13 = rotl(x13 ^ x02, 8);
-      x08 = x08 + x13 | 0;
-      x07 = rotl(x07 ^ x08, 7);
-      x03 = x03 + x04 | 0;
-      x14 = rotl(x14 ^ x03, 16);
-      x09 = x09 + x14 | 0;
-      x04 = rotl(x04 ^ x09, 12);
-      x03 = x03 + x04 | 0;
-      x14 = rotl(x14 ^ x03, 8);
-      x09 = x09 + x14 | 0;
-      x04 = rotl(x04 ^ x09, 7);
-    }
-    let oi = 0;
-    o32[oi++] = x00;
-    o32[oi++] = x01;
-    o32[oi++] = x02;
-    o32[oi++] = x03;
-    o32[oi++] = x12;
-    o32[oi++] = x13;
-    o32[oi++] = x14;
-    o32[oi++] = x15;
-  }
-  var chacha20 = /* @__PURE__ */ createCipher(chachaCore, {
-    counterRight: false,
-    counterLength: 4,
-    allowShortKeys: false
-  });
-  var xchacha20 = /* @__PURE__ */ createCipher(chachaCore, {
-    counterRight: false,
-    counterLength: 8,
-    extendNonceFn: hchacha,
-    allowShortKeys: false
-  });
-  var ZEROS162 = /* @__PURE__ */ new Uint8Array(16);
-  var updatePadded = (h, msg) => {
-    h.update(msg);
-    const left = msg.length % 16;
-    if (left)
-      h.update(ZEROS162.subarray(left));
-  };
-  var ZEROS322 = /* @__PURE__ */ new Uint8Array(32);
-  function computeTag2(fn, key, nonce, data, AAD) {
-    const authKey = fn(key, nonce, ZEROS322);
-    const h = poly1305.create(authKey);
-    if (AAD)
-      updatePadded(h, AAD);
-    updatePadded(h, data);
-    const num = new Uint8Array(16);
-    const view = createView3(num);
-    setBigUint643(view, 0, BigInt(AAD ? AAD.length : 0), true);
-    setBigUint643(view, 8, BigInt(data.length), true);
-    h.update(num);
-    const res = h.digest();
-    authKey.fill(0);
-    return res;
-  }
-  var _poly1305_aead = (xorStream) => (key, nonce, AAD) => {
-    const tagLength = 16;
-    bytes3(key, 32);
-    bytes3(nonce);
-    return {
-      encrypt: (plaintext, output4) => {
-        const plength = plaintext.length;
-        const clength = plength + tagLength;
-        if (output4) {
-          bytes3(output4, clength);
-        } else {
-          output4 = new Uint8Array(clength);
-        }
-        xorStream(key, nonce, plaintext, output4, 1);
-        const tag = computeTag2(xorStream, key, nonce, output4.subarray(0, -tagLength), AAD);
-        output4.set(tag, plength);
-        return output4;
-      },
-      decrypt: (ciphertext, output4) => {
-        const clength = ciphertext.length;
-        const plength = clength - tagLength;
-        if (clength < tagLength)
-          throw new Error(`encrypted data must be at least ${tagLength} bytes`);
-        if (output4) {
-          bytes3(output4, plength);
-        } else {
-          output4 = new Uint8Array(plength);
-        }
-        const data = ciphertext.subarray(0, -tagLength);
-        const passedTag = ciphertext.subarray(-tagLength);
-        const tag = computeTag2(xorStream, key, nonce, data, AAD);
-        if (!equalBytes2(passedTag, tag))
-          throw new Error("invalid tag");
-        xorStream(key, nonce, data, output4, 1);
-        return output4;
-      }
-    };
-  };
-  var chacha20poly1305 = /* @__PURE__ */ wrapCipher({ blockSize: 64, nonceLength: 12, tagLength: 16 }, _poly1305_aead(chacha20));
-  var xchacha20poly1305 = /* @__PURE__ */ wrapCipher({ blockSize: 64, nonceLength: 24, tagLength: 16 }, _poly1305_aead(xchacha20));
-
-  // node_modules/@noble/hashes/esm/hmac.js
-  var HMAC2 = class extends Hash {
-    constructor(hash3, _key) {
-      super();
-      this.finished = false;
-      this.destroyed = false;
-      assert_default.hash(hash3);
-      const key = toBytes(_key);
-      this.iHash = hash3.create();
-      if (typeof this.iHash.update !== "function")
-        throw new Error("Expected instance of class which extends utils.Hash");
-      this.blockLen = this.iHash.blockLen;
-      this.outputLen = this.iHash.outputLen;
-      const blockLen = this.blockLen;
-      const pad = new Uint8Array(blockLen);
-      pad.set(key.length > blockLen ? hash3.create().update(key).digest() : key);
-      for (let i2 = 0; i2 < pad.length; i2++)
-        pad[i2] ^= 54;
-      this.iHash.update(pad);
-      this.oHash = hash3.create();
-      for (let i2 = 0; i2 < pad.length; i2++)
-        pad[i2] ^= 54 ^ 92;
-      this.oHash.update(pad);
-      pad.fill(0);
-    }
-    update(buf) {
-      assert_default.exists(this);
-      this.iHash.update(buf);
-      return this;
-    }
-    digestInto(out) {
-      assert_default.exists(this);
-      assert_default.bytes(out, this.outputLen);
-      this.finished = true;
-      this.iHash.digestInto(out);
-      this.oHash.update(out);
-      this.oHash.digestInto(out);
-      this.destroy();
-    }
-    digest() {
-      const out = new Uint8Array(this.oHash.outputLen);
-      this.digestInto(out);
-      return out;
-    }
-    _cloneInto(to) {
-      to || (to = Object.create(Object.getPrototypeOf(this), {}));
-      const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;
-      to = to;
-      to.finished = finished;
-      to.destroyed = destroyed;
-      to.blockLen = blockLen;
-      to.outputLen = outputLen;
-      to.oHash = oHash._cloneInto(to.oHash);
-      to.iHash = iHash._cloneInto(to.iHash);
-      return to;
-    }
-    destroy() {
-      this.destroyed = true;
-      this.oHash.destroy();
-      this.iHash.destroy();
-    }
-  };
-  var hmac2 = (hash3, key, message) => new HMAC2(hash3, key).update(message).digest();
-  hmac2.create = (hash3, key) => new HMAC2(hash3, key);
-
-  // node_modules/@noble/hashes/esm/hkdf.js
-  var HKDF_COUNTER = new Uint8Array([0]);
-  var EMPTY_BUFFER = new Uint8Array();
-
-  // node_modules/nostr-tools/lib/esm/nip46.js
-  var verifiedSymbol = Symbol("verified");
-  var isRecord = (obj) => obj instanceof Object;
-  function validateEvent(event) {
-    if (!isRecord(event))
-      return false;
-    if (typeof event.kind !== "number")
-      return false;
-    if (typeof event.content !== "string")
-      return false;
-    if (typeof event.created_at !== "number")
-      return false;
-    if (typeof event.pubkey !== "string")
-      return false;
-    if (!event.pubkey.match(/^[a-f0-9]{64}$/))
-      return false;
-    if (!Array.isArray(event.tags))
-      return false;
-    for (let i2 = 0; i2 < event.tags.length; i2++) {
-      let tag = event.tags[i2];
-      if (!Array.isArray(tag))
-        return false;
-      for (let j = 0; j < tag.length; j++) {
-        if (typeof tag[j] === "object")
-          return false;
-      }
-    }
-    return true;
-  }
-  var utf8Decoder = new TextDecoder("utf-8");
-  var utf8Encoder = new TextEncoder();
-  var JS = class {
-    generateSecretKey() {
-      return schnorr.utils.randomPrivateKey();
-    }
-    getPublicKey(secretKey) {
-      return bytesToHex(schnorr.getPublicKey(secretKey));
-    }
-    finalizeEvent(t, secretKey) {
-      const event = t;
-      event.pubkey = bytesToHex(schnorr.getPublicKey(secretKey));
-      event.id = getEventHash(event);
-      event.sig = bytesToHex(schnorr.sign(getEventHash(event), secretKey));
-      event[verifiedSymbol] = true;
-      return event;
-    }
-    verifyEvent(event) {
-      if (typeof event[verifiedSymbol] === "boolean")
-        return event[verifiedSymbol];
-      const hash3 = getEventHash(event);
-      if (hash3 !== event.id) {
-        event[verifiedSymbol] = false;
-        return false;
-      }
-      try {
-        const valid = schnorr.verify(event.sig, hash3, event.pubkey);
-        event[verifiedSymbol] = valid;
-        return valid;
-      } catch (err) {
-        event[verifiedSymbol] = false;
-        return false;
-      }
-    }
-  };
-  function serializeEvent(evt) {
-    if (!validateEvent(evt))
-      throw new Error("can't serialize event with wrong or missing properties");
-    return JSON.stringify([0, evt.pubkey, evt.created_at, evt.kind, evt.tags, evt.content]);
-  }
-  function getEventHash(event) {
-    let eventHash = sha2562(utf8Encoder.encode(serializeEvent(event)));
-    return bytesToHex(eventHash);
-  }
-  var i = new JS();
-  var generateSecretKey = i.generateSecretKey;
-  var getPublicKey = i.getPublicKey;
-  var finalizeEvent = i.finalizeEvent;
-  var verifyEvent = i.verifyEvent;
-  var NIP05_REGEX = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/;
-  var _fetch;
-  try {
-    _fetch = fetch;
-  } catch {
-  }
-  var _WebSocket;
-  try {
-    _WebSocket = WebSocket;
-  } catch {
-  }
-  var _fetch2;
-  try {
-    _fetch2 = fetch;
-  } catch {
-  }
-  var BUNKER_REGEX = /^bunker:\/\/([0-9a-f]{64})\??([?\/\w:.=&%-]*)$/;
-  async function parseBunkerInput(input) {
-    let match = input.match(BUNKER_REGEX);
-    if (match) {
-      try {
-        const pubkey = match[1];
-        const qs = new URLSearchParams(match[2]);
-        return {
-          pubkey,
-          relays: qs.getAll("relay"),
-          secret: qs.get("secret")
-        };
-      } catch (_err) {
-      }
-    }
-    return queryBunkerProfile(input);
-  }
-  async function queryBunkerProfile(nip05) {
-    const match = nip05.match(NIP05_REGEX);
-    if (!match)
-      return null;
-    const [_, name = "_", domain] = match;
-    try {
-      const url = `https://${domain}/.well-known/nostr.json?name=${name}`;
-      const res = await (await _fetch2(url, { redirect: "error" })).json();
-      let pubkey = res.names[name];
-      let relays = res.nip46[pubkey] || [];
-      return { pubkey, relays, secret: null };
-    } catch (_err) {
-      return null;
-    }
-  }
-
-  // src/lib.ts
-  var localStorageKeys = {
-    ORIGIN: "wnj:origin",
-    CLIENT_SECRET: "wnj:clientSecret",
-    Y_POS: "wnj:ypos",
-    CALLBACK_TOKEN: "wnj:callbackToken",
-    BUNKER_POINTER: "wnj:bunkerPointer"
-  };
-
   // iframe/iframe.ts
+  var SHARED_BUNKER_KEY = "wnj:root:sharedBunker";
   window.onmessage = async (ev) => {
-    if (!ev.origin.startsWith("https://join.the-nostr.org") && !ev.origin.startsWith("http://localhost:6711")) {
-      return;
-    }
-    const { bunker } = ev.data;
+    const { bunker, getbunker } = ev.data;
     if (bunker) {
-      const bp = await parseBunkerInput(bunker);
-      if (bp) {
-        localStorage.setItem(localStorageKeys.BUNKER_POINTER, JSON.stringify(bp));
+      if (!ev.origin.startsWith("https://join.the-nostr.org") && !ev.origin.startsWith("http://localhost:6711")) {
+        return;
+      }
+      if (bunker) {
+        localStorage.setItem(SHARED_BUNKER_KEY, bunker);
       } else {
         console.error("wnj iframe got an invalid bunker url:", bunker);
       }
     }
+    if (getbunker) {
+      const bunker2 = localStorage.getItem(SHARED_BUNKER_KEY);
+      window.parent.postMessage({ bunker: bunker2 }, "*");
+    }
   };
 })();
-/*! Bundled license information:
-
-@noble/hashes/esm/utils.js:
-  (*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-
-@noble/hashes/esm/utils.js:
-  (*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-
-@noble/curves/esm/abstract/utils.js:
-  (*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-
-@noble/curves/esm/abstract/modular.js:
-  (*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-
-@noble/curves/esm/abstract/curve.js:
-  (*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-
-@noble/curves/esm/abstract/weierstrass.js:
-  (*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-
-@noble/curves/esm/_shortw_utils.js:
-  (*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-
-@noble/curves/esm/secp256k1.js:
-  (*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-
-@noble/ciphers/esm/utils.js:
-  (*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) *)
-
-@scure/base/lib/esm/index.js:
-  (*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
-*/