nostr-double-ratchet 0.0.1

package/dist/nostr-double-ratchet.es.js

@@ -0,0 +1,3760 @@
+var oi = Object.defineProperty;
+var si = (e, t, n) => t in e ? oi(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var Q = (e, t, n) => si(e, typeof t != "symbol" ? t + "" : t, n);
+function mn(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error(`Wrong positive integer: ${e}`);
+}
+function Pn(e, ...t) {
+  if (!(e instanceof Uint8Array))
+    throw new Error("Expected Uint8Array");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
+}
+function ai(e) {
+  if (typeof e != "function" || typeof e.create != "function")
+    throw new Error("Hash should be wrapped by utils.wrapConstructor");
+  mn(e.outputLen), mn(e.blockLen);
+}
+function it(e, t = !0) {
+  if (e.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (t && e.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function ci(e, t) {
+  Pn(e);
+  const n = t.outputLen;
+  if (e.length < n)
+    throw new Error(`digestInto() expects output buffer of length at least ${n}`);
+}
+const Bt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const On = (e) => e instanceof Uint8Array, Nt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), te = (e, t) => e << 32 - t | e >>> t, ui = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!ui)
+  throw new Error("Non little-endian hardware is not supported");
+function li(e) {
+  if (typeof e != "string")
+    throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
+  return new Uint8Array(new TextEncoder().encode(e));
+}
+function Zt(e) {
+  if (typeof e == "string" && (e = li(e)), !On(e))
+    throw new Error(`expected Uint8Array, got ${typeof e}`);
+  return e;
+}
+function fi(...e) {
+  const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
+  let n = 0;
+  return e.forEach((r) => {
+    if (!On(r))
+      throw new Error("Uint8Array expected");
+    t.set(r, n), n += r.length;
+  }), t;
+}
+let Hn = class {
+  // Safe version that clones internal state
+  clone() {
+    return this._cloneInto();
+  }
+};
+function hi(e) {
+  const t = (r) => e().update(Zt(r)).digest(), n = e();
+  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
+}
+function Mn(e = 32) {
+  if (Bt && typeof Bt.getRandomValues == "function")
+    return Bt.getRandomValues(new Uint8Array(e));
+  throw new Error("crypto.getRandomValues must be defined");
+}
+function di(e, t, n, r) {
+  if (typeof e.setBigUint64 == "function")
+    return e.setBigUint64(t, n, r);
+  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), c = Number(n & o), a = r ? 4 : 0, u = r ? 0 : 4;
+  e.setUint32(t + a, s, r), e.setUint32(t + u, c, r);
+}
+let gi = class extends Hn {
+  constructor(t, n, r, i) {
+    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Nt(this.buffer);
+  }
+  update(t) {
+    it(this);
+    const { view: n, buffer: r, blockLen: i } = this;
+    t = Zt(t);
+    const o = t.length;
+    for (let s = 0; s < o; ) {
+      const c = Math.min(i - this.pos, o - s);
+      if (c === i) {
+        const a = Nt(t);
+        for (; i <= o - s; s += i)
+          this.process(a, s);
+        continue;
+      }
+      r.set(t.subarray(s, s + c), this.pos), this.pos += c, s += c, this.pos === i && (this.process(n, 0), this.pos = 0);
+    }
+    return this.length += t.length, this.roundClean(), this;
+  }
+  digestInto(t) {
+    it(this), ci(t, this), this.finished = !0;
+    const { buffer: n, view: r, blockLen: i, isLE: o } = this;
+    let { pos: s } = this;
+    n[s++] = 128, this.buffer.subarray(s).fill(0), this.padOffset > i - s && (this.process(r, 0), s = 0);
+    for (let l = s; l < i; l++)
+      n[l] = 0;
+    di(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
+    const c = Nt(t), a = this.outputLen;
+    if (a % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const u = a / 4, f = this.get();
+    if (u > f.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let l = 0; l < u; l++)
+      c.setUint32(4 * l, f[l], o);
+  }
+  digest() {
+    const { buffer: t, outputLen: n } = this;
+    this.digestInto(t);
+    const r = t.slice(0, n);
+    return this.destroy(), r;
+  }
+  _cloneInto(t) {
+    t || (t = new this.constructor()), t.set(...this.get());
+    const { blockLen: n, buffer: r, length: i, finished: o, destroyed: s, pos: c } = this;
+    return t.length = i, t.pos = c, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
+  }
+};
+const pi = (e, t, n) => e & t ^ ~e & n, yi = (e, t, n) => e & t ^ e & n ^ t & n, wi = /* @__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
+]), be = /* @__PURE__ */ new Uint32Array([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), ve = /* @__PURE__ */ new Uint32Array(64);
+let bi = class extends gi {
+  constructor() {
+    super(64, 32, 8, !1), this.A = be[0] | 0, this.B = be[1] | 0, this.C = be[2] | 0, this.D = be[3] | 0, this.E = be[4] | 0, this.F = be[5] | 0, this.G = be[6] | 0, this.H = be[7] | 0;
+  }
+  get() {
+    const { A: t, B: n, C: r, D: i, E: o, F: s, G: c, H: a } = this;
+    return [t, n, r, i, o, s, c, a];
+  }
+  // prettier-ignore
+  set(t, n, r, i, o, s, c, a) {
+    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = o | 0, this.F = s | 0, this.G = c | 0, this.H = a | 0;
+  }
+  process(t, n) {
+    for (let l = 0; l < 16; l++, n += 4)
+      ve[l] = t.getUint32(n, !1);
+    for (let l = 16; l < 64; l++) {
+      const d = ve[l - 15], w = ve[l - 2], y = te(d, 7) ^ te(d, 18) ^ d >>> 3, h = te(w, 17) ^ te(w, 19) ^ w >>> 10;
+      ve[l] = h + ve[l - 7] + y + ve[l - 16] | 0;
+    }
+    let { A: r, B: i, C: o, D: s, E: c, F: a, G: u, H: f } = this;
+    for (let l = 0; l < 64; l++) {
+      const d = te(c, 6) ^ te(c, 11) ^ te(c, 25), w = f + d + pi(c, a, u) + wi[l] + ve[l] | 0, h = (te(r, 2) ^ te(r, 13) ^ te(r, 22)) + yi(r, i, o) | 0;
+      f = u, u = a, a = c, c = s + w | 0, s = o, o = i, i = r, r = w + h | 0;
+    }
+    r = r + this.A | 0, i = i + this.B | 0, o = o + this.C | 0, s = s + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, u = u + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, c, a, u, f);
+  }
+  roundClean() {
+    ve.fill(0);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
+  }
+};
+const $t = /* @__PURE__ */ hi(() => new bi());
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const qn = BigInt(0), ft = BigInt(1), vi = BigInt(2), ht = (e) => e instanceof Uint8Array, xi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+function Me(e) {
+  if (!ht(e))
+    throw new Error("Uint8Array expected");
+  let t = "";
+  for (let n = 0; n < e.length; n++)
+    t += xi[e[n]];
+  return t;
+}
+function Dn(e) {
+  const t = e.toString(16);
+  return t.length & 1 ? `0${t}` : t;
+}
+function Ft(e) {
+  if (typeof e != "string")
+    throw new Error("hex string expected, got " + typeof e);
+  return BigInt(e === "" ? "0" : `0x${e}`);
+}
+function qe(e) {
+  if (typeof e != "string")
+    throw new Error("hex string expected, got " + typeof e);
+  const t = e.length;
+  if (t % 2)
+    throw new Error("padded hex string expected, got unpadded hex of length " + t);
+  const n = new Uint8Array(t / 2);
+  for (let r = 0; r < n.length; r++) {
+    const i = r * 2, o = e.slice(i, i + 2), s = Number.parseInt(o, 16);
+    if (Number.isNaN(s) || s < 0)
+      throw new Error("Invalid byte sequence");
+    n[r] = s;
+  }
+  return n;
+}
+function F(e) {
+  return Ft(Me(e));
+}
+function Wt(e) {
+  if (!ht(e))
+    throw new Error("Uint8Array expected");
+  return Ft(Me(Uint8Array.from(e).reverse()));
+}
+function Be(e, t) {
+  return qe(e.toString(16).padStart(t * 2, "0"));
+}
+function Gt(e, t) {
+  return Be(e, t).reverse();
+}
+function mi(e) {
+  return qe(Dn(e));
+}
+function z(e, t, n) {
+  let r;
+  if (typeof t == "string")
+    try {
+      r = qe(t);
+    } catch (o) {
+      throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${o}`);
+    }
+  else if (ht(t))
+    r = Uint8Array.from(t);
+  else
+    throw new Error(`${e} must be hex string or Uint8Array`);
+  const i = r.length;
+  if (typeof n == "number" && i !== n)
+    throw new Error(`${e} expected ${n} bytes, got ${i}`);
+  return r;
+}
+function _e(...e) {
+  const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
+  let n = 0;
+  return e.forEach((r) => {
+    if (!ht(r))
+      throw new Error("Uint8Array expected");
+    t.set(r, n), n += r.length;
+  }), t;
+}
+function Ei(e, t) {
+  if (e.length !== t.length)
+    return !1;
+  for (let n = 0; n < e.length; n++)
+    if (e[n] !== t[n])
+      return !1;
+  return !0;
+}
+function Ai(e) {
+  if (typeof e != "string")
+    throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
+  return new Uint8Array(new TextEncoder().encode(e));
+}
+function Si(e) {
+  let t;
+  for (t = 0; e > qn; e >>= ft, t += 1)
+    ;
+  return t;
+}
+function Bi(e, t) {
+  return e >> BigInt(t) & ft;
+}
+const Ni = (e, t, n) => e | (n ? ft : qn) << BigInt(t), Jt = (e) => (vi << BigInt(e - 1)) - ft, Ct = (e) => new Uint8Array(e), En = (e) => Uint8Array.from(e);
+function jn(e, t, n) {
+  if (typeof e != "number" || e < 2)
+    throw new Error("hashLen must be a number");
+  if (typeof t != "number" || t < 2)
+    throw new Error("qByteLen must be a number");
+  if (typeof n != "function")
+    throw new Error("hmacFn must be a function");
+  let r = Ct(e), i = Ct(e), o = 0;
+  const s = () => {
+    r.fill(1), i.fill(0), o = 0;
+  }, c = (...l) => n(i, r, ...l), a = (l = Ct()) => {
+    i = c(En([0]), l), r = c(), l.length !== 0 && (i = c(En([1]), l), r = c());
+  }, u = () => {
+    if (o++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let l = 0;
+    const d = [];
+    for (; l < t; ) {
+      r = c();
+      const w = r.slice();
+      d.push(w), l += r.length;
+    }
+    return _e(...d);
+  };
+  return (l, d) => {
+    s(), a(l);
+    let w;
+    for (; !(w = d(u())); )
+      a();
+    return s(), w;
+  };
+}
+const Ci = {
+  bigint: (e) => typeof e == "bigint",
+  function: (e) => typeof e == "function",
+  boolean: (e) => typeof e == "boolean",
+  string: (e) => typeof e == "string",
+  stringOrUint8Array: (e) => typeof e == "string" || e instanceof Uint8Array,
+  isSafeInteger: (e) => Number.isSafeInteger(e),
+  array: (e) => Array.isArray(e),
+  field: (e, t) => t.Fp.isValid(e),
+  hash: (e) => typeof e == "function" && Number.isSafeInteger(e.outputLen)
+};
+function Ye(e, t, n = {}) {
+  const r = (i, o, s) => {
+    const c = Ci[o];
+    if (typeof c != "function")
+      throw new Error(`Invalid validator "${o}", expected function`);
+    const a = e[i];
+    if (!(s && a === void 0) && !c(a, e))
+      throw new Error(`Invalid param ${String(i)}=${a} (${typeof a}), expected ${o}`);
+  };
+  for (const [i, o] of Object.entries(t))
+    r(i, o, !1);
+  for (const [i, o] of Object.entries(n))
+    r(i, o, !0);
+  return e;
+}
+const Ui = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  bitGet: Bi,
+  bitLen: Si,
+  bitMask: Jt,
+  bitSet: Ni,
+  bytesToHex: Me,
+  bytesToNumberBE: F,
+  bytesToNumberLE: Wt,
+  concatBytes: _e,
+  createHmacDrbg: jn,
+  ensureBytes: z,
+  equalBytes: Ei,
+  hexToBytes: qe,
+  hexToNumber: Ft,
+  numberToBytesBE: Be,
+  numberToBytesLE: Gt,
+  numberToHexUnpadded: Dn,
+  numberToVarBytesBE: mi,
+  utf8ToBytes: Ai,
+  validateObject: Ye
+}, Symbol.toStringTag, { value: "Module" }));
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const j = BigInt(0), M = BigInt(1), Ie = BigInt(2), Ii = BigInt(3), Rt = BigInt(4), An = BigInt(5), Sn = BigInt(8);
+BigInt(9);
+BigInt(16);
+function V(e, t) {
+  const n = e % t;
+  return n >= j ? n : t + n;
+}
+function Ki(e, t, n) {
+  if (n <= j || t < j)
+    throw new Error("Expected power/modulo > 0");
+  if (n === M)
+    return j;
+  let r = M;
+  for (; t > j; )
+    t & M && (r = r * e % n), e = e * e % n, t >>= M;
+  return r;
+}
+function G(e, t, n) {
+  let r = e;
+  for (; t-- > j; )
+    r *= r, r %= n;
+  return r;
+}
+function Pt(e, t) {
+  if (e === j || t <= j)
+    throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
+  let n = V(e, t), r = t, i = j, o = M;
+  for (; n !== j; ) {
+    const c = r / n, a = r % n, u = i - o * c;
+    r = n, n = a, i = o, o = u;
+  }
+  if (r !== M)
+    throw new Error("invert: does not exist");
+  return V(i, t);
+}
+function _i(e) {
+  const t = (e - M) / Ie;
+  let n, r, i;
+  for (n = e - M, r = 0; n % Ie === j; n /= Ie, r++)
+    ;
+  for (i = Ie; i < e && Ki(i, t, e) !== e - M; i++)
+    ;
+  if (r === 1) {
+    const s = (e + M) / Rt;
+    return function(a, u) {
+      const f = a.pow(u, s);
+      if (!a.eql(a.sqr(f), u))
+        throw new Error("Cannot find square root");
+      return f;
+    };
+  }
+  const o = (n + M) / Ie;
+  return function(c, a) {
+    if (c.pow(a, t) === c.neg(c.ONE))
+      throw new Error("Cannot find square root");
+    let u = r, f = c.pow(c.mul(c.ONE, i), n), l = c.pow(a, o), d = c.pow(a, n);
+    for (; !c.eql(d, c.ONE); ) {
+      if (c.eql(d, c.ZERO))
+        return c.ZERO;
+      let w = 1;
+      for (let h = c.sqr(d); w < u && !c.eql(h, c.ONE); w++)
+        h = c.sqr(h);
+      const y = c.pow(f, M << BigInt(u - w - 1));
+      f = c.sqr(y), l = c.mul(l, y), d = c.mul(d, f), u = w;
+    }
+    return l;
+  };
+}
+function Li(e) {
+  if (e % Rt === Ii) {
+    const t = (e + M) / Rt;
+    return function(r, i) {
+      const o = r.pow(i, t);
+      if (!r.eql(r.sqr(o), i))
+        throw new Error("Cannot find square root");
+      return o;
+    };
+  }
+  if (e % Sn === An) {
+    const t = (e - An) / Sn;
+    return function(r, i) {
+      const o = r.mul(i, Ie), s = r.pow(o, t), c = r.mul(i, s), a = r.mul(r.mul(c, Ie), s), u = r.mul(c, r.sub(a, r.ONE));
+      if (!r.eql(r.sqr(u), i))
+        throw new Error("Cannot find square root");
+      return u;
+    };
+  }
+  return _i(e);
+}
+const ki = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function Ti(e) {
+  const t = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, n = ki.reduce((r, i) => (r[i] = "function", r), t);
+  return Ye(e, n);
+}
+function $i(e, t, n) {
+  if (n < j)
+    throw new Error("Expected power > 0");
+  if (n === j)
+    return e.ONE;
+  if (n === M)
+    return t;
+  let r = e.ONE, i = t;
+  for (; n > j; )
+    n & M && (r = e.mul(r, i)), i = e.sqr(i), n >>= M;
+  return r;
+}
+function Ri(e, t) {
+  const n = new Array(t.length), r = t.reduce((o, s, c) => e.is0(s) ? o : (n[c] = o, e.mul(o, s)), e.ONE), i = e.inv(r);
+  return t.reduceRight((o, s, c) => e.is0(s) ? o : (n[c] = e.mul(o, n[c]), e.mul(o, s)), i), n;
+}
+function Vn(e, t) {
+  const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
+  return { nBitLength: n, nByteLength: r };
+}
+function Pi(e, t, n = !1, r = {}) {
+  if (e <= j)
+    throw new Error(`Expected Field ORDER > 0, got ${e}`);
+  const { nBitLength: i, nByteLength: o } = Vn(e, t);
+  if (o > 2048)
+    throw new Error("Field lengths over 2048 bytes are not supported");
+  const s = Li(e), c = Object.freeze({
+    ORDER: e,
+    BITS: i,
+    BYTES: o,
+    MASK: Jt(i),
+    ZERO: j,
+    ONE: M,
+    create: (a) => V(a, e),
+    isValid: (a) => {
+      if (typeof a != "bigint")
+        throw new Error(`Invalid field element: expected bigint, got ${typeof a}`);
+      return j <= a && a < e;
+    },
+    is0: (a) => a === j,
+    isOdd: (a) => (a & M) === M,
+    neg: (a) => V(-a, e),
+    eql: (a, u) => a === u,
+    sqr: (a) => V(a * a, e),
+    add: (a, u) => V(a + u, e),
+    sub: (a, u) => V(a - u, e),
+    mul: (a, u) => V(a * u, e),
+    pow: (a, u) => $i(c, a, u),
+    div: (a, u) => V(a * Pt(u, e), e),
+    // Same as above, but doesn't normalize
+    sqrN: (a) => a * a,
+    addN: (a, u) => a + u,
+    subN: (a, u) => a - u,
+    mulN: (a, u) => a * u,
+    inv: (a) => Pt(a, e),
+    sqrt: r.sqrt || ((a) => s(c, a)),
+    invertBatch: (a) => Ri(c, a),
+    // TODO: do we really need constant cmov?
+    // We don't have const-time bigints anyway, so probably will be not very useful
+    cmov: (a, u, f) => f ? u : a,
+    toBytes: (a) => n ? Gt(a, o) : Be(a, o),
+    fromBytes: (a) => {
+      if (a.length !== o)
+        throw new Error(`Fp.fromBytes: expected ${o}, got ${a.length}`);
+      return n ? Wt(a) : F(a);
+    }
+  });
+  return Object.freeze(c);
+}
+function zn(e) {
+  if (typeof e != "bigint")
+    throw new Error("field order must be bigint");
+  const t = e.toString(2).length;
+  return Math.ceil(t / 8);
+}
+function Zn(e) {
+  const t = zn(e);
+  return t + Math.ceil(t / 2);
+}
+function Oi(e, t, n = !1) {
+  const r = e.length, i = zn(t), o = Zn(t);
+  if (r < 16 || r < o || r > 1024)
+    throw new Error(`expected ${o}-1024 bytes of input, got ${r}`);
+  const s = n ? F(e) : Wt(e), c = V(s, t - M) + M;
+  return n ? Gt(c, i) : Be(c, i);
+}
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const Hi = BigInt(0), Ut = BigInt(1);
+function Mi(e, t) {
+  const n = (i, o) => {
+    const s = o.negate();
+    return i ? s : o;
+  }, r = (i) => {
+    const o = Math.ceil(t / i) + 1, s = 2 ** (i - 1);
+    return { windows: o, windowSize: s };
+  };
+  return {
+    constTimeNegate: n,
+    // non-const time multiplication ladder
+    unsafeLadder(i, o) {
+      let s = e.ZERO, c = i;
+      for (; o > Hi; )
+        o & Ut && (s = s.add(c)), c = c.double(), o >>= Ut;
+      return s;
+    },
+    /**
+     * 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(i, o) {
+      const { windows: s, windowSize: c } = r(o), a = [];
+      let u = i, f = u;
+      for (let l = 0; l < s; l++) {
+        f = u, a.push(f);
+        for (let d = 1; d < c; d++)
+          f = f.add(u), a.push(f);
+        u = f.double();
+      }
+      return a;
+    },
+    /**
+     * 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(i, o, s) {
+      const { windows: c, windowSize: a } = r(i);
+      let u = e.ZERO, f = e.BASE;
+      const l = BigInt(2 ** i - 1), d = 2 ** i, w = BigInt(i);
+      for (let y = 0; y < c; y++) {
+        const h = y * a;
+        let g = Number(s & l);
+        s >>= w, g > a && (g -= d, s += Ut);
+        const p = h, m = h + Math.abs(g) - 1, B = y % 2 !== 0, _ = g < 0;
+        g === 0 ? f = f.add(n(B, o[p])) : u = u.add(n(_, o[m]));
+      }
+      return { p: u, f };
+    },
+    wNAFCached(i, o, s, c) {
+      const a = i._WINDOW_SIZE || 1;
+      let u = o.get(i);
+      return u || (u = this.precomputeWindow(i, a), a !== 1 && o.set(i, c(u))), this.wNAF(a, u, s);
+    }
+  };
+}
+function Fn(e) {
+  return Ti(e.Fp), Ye(e, {
+    n: "bigint",
+    h: "bigint",
+    Gx: "field",
+    Gy: "field"
+  }, {
+    nBitLength: "isSafeInteger",
+    nByteLength: "isSafeInteger"
+  }), Object.freeze({
+    ...Vn(e.n, e.nBitLength),
+    ...e,
+    p: e.Fp.ORDER
+  });
+}
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function qi(e) {
+  const t = Fn(e);
+  Ye(t, {
+    a: "field",
+    b: "field"
+  }, {
+    allowedPrivateKeyLengths: "array",
+    wrapPrivateKey: "boolean",
+    isTorsionFree: "function",
+    clearCofactor: "function",
+    allowInfinityPoint: "boolean",
+    fromBytes: "function",
+    toBytes: "function"
+  });
+  const { endo: n, Fp: r, a: i } = t;
+  if (n) {
+    if (!r.eql(i, r.ZERO))
+      throw new Error("Endomorphism can only be defined for Koblitz curves that have a=0");
+    if (typeof n != "object" || typeof n.beta != "bigint" || typeof n.splitScalar != "function")
+      throw new Error("Expected endomorphism with beta: bigint and splitScalar: function");
+  }
+  return Object.freeze({ ...t });
+}
+const { bytesToNumberBE: Di, hexToBytes: ji } = Ui, Ke = {
+  // asn.1 DER encoding utils
+  Err: class extends Error {
+    constructor(t = "") {
+      super(t);
+    }
+  },
+  _parseInt(e) {
+    const { Err: t } = Ke;
+    if (e.length < 2 || e[0] !== 2)
+      throw new t("Invalid signature integer tag");
+    const n = e[1], r = e.subarray(2, n + 2);
+    if (!n || r.length !== n)
+      throw new t("Invalid signature integer: wrong length");
+    if (r[0] & 128)
+      throw new t("Invalid signature integer: negative");
+    if (r[0] === 0 && !(r[1] & 128))
+      throw new t("Invalid signature integer: unnecessary leading zero");
+    return { d: Di(r), l: e.subarray(n + 2) };
+  },
+  toSig(e) {
+    const { Err: t } = Ke, n = typeof e == "string" ? ji(e) : e;
+    if (!(n instanceof Uint8Array))
+      throw new Error("ui8a expected");
+    let r = n.length;
+    if (r < 2 || n[0] != 48)
+      throw new t("Invalid signature tag");
+    if (n[1] !== r - 2)
+      throw new t("Invalid signature: incorrect length");
+    const { d: i, l: o } = Ke._parseInt(n.subarray(2)), { d: s, l: c } = Ke._parseInt(o);
+    if (c.length)
+      throw new t("Invalid signature: left bytes after parsing");
+    return { r: i, s };
+  },
+  hexFromSig(e) {
+    const t = (u) => Number.parseInt(u[0], 16) & 8 ? "00" + u : u, n = (u) => {
+      const f = u.toString(16);
+      return f.length & 1 ? `0${f}` : f;
+    }, r = t(n(e.s)), i = t(n(e.r)), o = r.length / 2, s = i.length / 2, c = n(o), a = n(s);
+    return `30${n(s + o + 4)}02${a}${i}02${c}${r}`;
+  }
+}, ue = BigInt(0), J = BigInt(1);
+BigInt(2);
+const Bn = BigInt(3);
+BigInt(4);
+function Vi(e) {
+  const t = qi(e), { Fp: n } = t, r = t.toBytes || ((y, h, g) => {
+    const p = h.toAffine();
+    return _e(Uint8Array.from([4]), n.toBytes(p.x), n.toBytes(p.y));
+  }), i = t.fromBytes || ((y) => {
+    const h = y.subarray(1), g = n.fromBytes(h.subarray(0, n.BYTES)), p = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
+    return { x: g, y: p };
+  });
+  function o(y) {
+    const { a: h, b: g } = t, p = n.sqr(y), m = n.mul(p, y);
+    return n.add(n.add(m, n.mul(y, h)), g);
+  }
+  if (!n.eql(n.sqr(t.Gy), o(t.Gx)))
+    throw new Error("bad generator point: equation left != right");
+  function s(y) {
+    return typeof y == "bigint" && ue < y && y < t.n;
+  }
+  function c(y) {
+    if (!s(y))
+      throw new Error("Expected valid bigint: 0 < bigint < curve.n");
+  }
+  function a(y) {
+    const { allowedPrivateKeyLengths: h, nByteLength: g, wrapPrivateKey: p, n: m } = t;
+    if (h && typeof y != "bigint") {
+      if (y instanceof Uint8Array && (y = Me(y)), typeof y != "string" || !h.includes(y.length))
+        throw new Error("Invalid key");
+      y = y.padStart(g * 2, "0");
+    }
+    let B;
+    try {
+      B = typeof y == "bigint" ? y : F(z("private key", y, g));
+    } catch {
+      throw new Error(`private key must be ${g} bytes, hex or bigint, not ${typeof y}`);
+    }
+    return p && (B = V(B, m)), c(B), B;
+  }
+  const u = /* @__PURE__ */ new Map();
+  function f(y) {
+    if (!(y instanceof l))
+      throw new Error("ProjectivePoint expected");
+  }
+  class l {
+    constructor(h, g, p) {
+      if (this.px = h, this.py = g, this.pz = p, h == null || !n.isValid(h))
+        throw new Error("x required");
+      if (g == null || !n.isValid(g))
+        throw new Error("y required");
+      if (p == null || !n.isValid(p))
+        throw new Error("z required");
+    }
+    // Does not validate if the point is on-curve.
+    // Use fromHex instead, or call assertValidity() later.
+    static fromAffine(h) {
+      const { x: g, y: p } = h || {};
+      if (!h || !n.isValid(g) || !n.isValid(p))
+        throw new Error("invalid affine point");
+      if (h instanceof l)
+        throw new Error("projective point not allowed");
+      const m = (B) => n.eql(B, n.ZERO);
+      return m(g) && m(p) ? l.ZERO : new l(g, p, n.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(h) {
+      const g = n.invertBatch(h.map((p) => p.pz));
+      return h.map((p, m) => p.toAffine(g[m])).map(l.fromAffine);
+    }
+    /**
+     * Converts hash string or Uint8Array to Point.
+     * @param hex short/long ECDSA hex
+     */
+    static fromHex(h) {
+      const g = l.fromAffine(i(z("pointHex", h)));
+      return g.assertValidity(), g;
+    }
+    // Multiplies generator point by privateKey.
+    static fromPrivateKey(h) {
+      return l.BASE.multiply(a(h));
+    }
+    // "Private method", don't use it directly
+    _setWindowSize(h) {
+      this._WINDOW_SIZE = h, u.delete(this);
+    }
+    // A point on curve is valid if it conforms to equation.
+    assertValidity() {
+      if (this.is0()) {
+        if (t.allowInfinityPoint && !n.is0(this.py))
+          return;
+        throw new Error("bad point: ZERO");
+      }
+      const { x: h, y: g } = this.toAffine();
+      if (!n.isValid(h) || !n.isValid(g))
+        throw new Error("bad point: x or y not FE");
+      const p = n.sqr(g), m = o(h);
+      if (!n.eql(p, m))
+        throw new Error("bad point: equation left != right");
+      if (!this.isTorsionFree())
+        throw new Error("bad point: not in prime-order subgroup");
+    }
+    hasEvenY() {
+      const { y: h } = this.toAffine();
+      if (n.isOdd)
+        return !n.isOdd(h);
+      throw new Error("Field doesn't support isOdd");
+    }
+    /**
+     * Compare one point to another.
+     */
+    equals(h) {
+      f(h);
+      const { px: g, py: p, pz: m } = this, { px: B, py: _, pz: U } = h, x = n.eql(n.mul(g, U), n.mul(B, m)), E = n.eql(n.mul(p, U), n.mul(_, m));
+      return x && E;
+    }
+    /**
+     * Flips point to one corresponding to (x, -y) in Affine coordinates.
+     */
+    negate() {
+      return new l(this.px, n.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: h, b: g } = t, p = n.mul(g, Bn), { px: m, py: B, pz: _ } = this;
+      let U = n.ZERO, x = n.ZERO, E = n.ZERO, A = n.mul(m, m), O = n.mul(B, B), K = n.mul(_, _), N = n.mul(m, B);
+      return N = n.add(N, N), E = n.mul(m, _), E = n.add(E, E), U = n.mul(h, E), x = n.mul(p, K), x = n.add(U, x), U = n.sub(O, x), x = n.add(O, x), x = n.mul(U, x), U = n.mul(N, U), E = n.mul(p, E), K = n.mul(h, K), N = n.sub(A, K), N = n.mul(h, N), N = n.add(N, E), E = n.add(A, A), A = n.add(E, A), A = n.add(A, K), A = n.mul(A, N), x = n.add(x, A), K = n.mul(B, _), K = n.add(K, K), A = n.mul(K, N), U = n.sub(U, A), E = n.mul(K, O), E = n.add(E, E), E = n.add(E, E), new l(U, x, E);
+    }
+    // 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(h) {
+      f(h);
+      const { px: g, py: p, pz: m } = this, { px: B, py: _, pz: U } = h;
+      let x = n.ZERO, E = n.ZERO, A = n.ZERO;
+      const O = t.a, K = n.mul(t.b, Bn);
+      let N = n.mul(g, B), $ = n.mul(p, _), R = n.mul(m, U), H = n.add(g, p), b = n.add(B, _);
+      H = n.mul(H, b), b = n.add(N, $), H = n.sub(H, b), b = n.add(g, m);
+      let v = n.add(B, U);
+      return b = n.mul(b, v), v = n.add(N, R), b = n.sub(b, v), v = n.add(p, m), x = n.add(_, U), v = n.mul(v, x), x = n.add($, R), v = n.sub(v, x), A = n.mul(O, b), x = n.mul(K, R), A = n.add(x, A), x = n.sub($, A), A = n.add($, A), E = n.mul(x, A), $ = n.add(N, N), $ = n.add($, N), R = n.mul(O, R), b = n.mul(K, b), $ = n.add($, R), R = n.sub(N, R), R = n.mul(O, R), b = n.add(b, R), N = n.mul($, b), E = n.add(E, N), N = n.mul(v, b), x = n.mul(H, x), x = n.sub(x, N), N = n.mul(H, $), A = n.mul(v, A), A = n.add(A, N), new l(x, E, A);
+    }
+    subtract(h) {
+      return this.add(h.negate());
+    }
+    is0() {
+      return this.equals(l.ZERO);
+    }
+    wNAF(h) {
+      return w.wNAFCached(this, u, h, (g) => {
+        const p = n.invertBatch(g.map((m) => m.pz));
+        return g.map((m, B) => m.toAffine(p[B])).map(l.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(h) {
+      const g = l.ZERO;
+      if (h === ue)
+        return g;
+      if (c(h), h === J)
+        return this;
+      const { endo: p } = t;
+      if (!p)
+        return w.unsafeLadder(this, h);
+      let { k1neg: m, k1: B, k2neg: _, k2: U } = p.splitScalar(h), x = g, E = g, A = this;
+      for (; B > ue || U > ue; )
+        B & J && (x = x.add(A)), U & J && (E = E.add(A)), A = A.double(), B >>= J, U >>= J;
+      return m && (x = x.negate()), _ && (E = E.negate()), E = new l(n.mul(E.px, p.beta), E.py, E.pz), x.add(E);
+    }
+    /**
+     * 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(h) {
+      c(h);
+      let g = h, p, m;
+      const { endo: B } = t;
+      if (B) {
+        const { k1neg: _, k1: U, k2neg: x, k2: E } = B.splitScalar(g);
+        let { p: A, f: O } = this.wNAF(U), { p: K, f: N } = this.wNAF(E);
+        A = w.constTimeNegate(_, A), K = w.constTimeNegate(x, K), K = new l(n.mul(K.px, B.beta), K.py, K.pz), p = A.add(K), m = O.add(N);
+      } else {
+        const { p: _, f: U } = this.wNAF(g);
+        p = _, m = U;
+      }
+      return l.normalizeZ([p, m])[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(h, g, p) {
+      const m = l.BASE, B = (U, x) => x === ue || x === J || !U.equals(m) ? U.multiplyUnsafe(x) : U.multiply(x), _ = B(this, g).add(B(h, p));
+      return _.is0() ? void 0 : _;
+    }
+    // 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(h) {
+      const { px: g, py: p, pz: m } = this, B = this.is0();
+      h == null && (h = B ? n.ONE : n.inv(m));
+      const _ = n.mul(g, h), U = n.mul(p, h), x = n.mul(m, h);
+      if (B)
+        return { x: n.ZERO, y: n.ZERO };
+      if (!n.eql(x, n.ONE))
+        throw new Error("invZ was invalid");
+      return { x: _, y: U };
+    }
+    isTorsionFree() {
+      const { h, isTorsionFree: g } = t;
+      if (h === J)
+        return !0;
+      if (g)
+        return g(l, this);
+      throw new Error("isTorsionFree() has not been declared for the elliptic curve");
+    }
+    clearCofactor() {
+      const { h, clearCofactor: g } = t;
+      return h === J ? this : g ? g(l, this) : this.multiplyUnsafe(t.h);
+    }
+    toRawBytes(h = !0) {
+      return this.assertValidity(), r(l, this, h);
+    }
+    toHex(h = !0) {
+      return Me(this.toRawBytes(h));
+    }
+  }
+  l.BASE = new l(t.Gx, t.Gy, n.ONE), l.ZERO = new l(n.ZERO, n.ONE, n.ZERO);
+  const d = t.nBitLength, w = Mi(l, t.endo ? Math.ceil(d / 2) : d);
+  return {
+    CURVE: t,
+    ProjectivePoint: l,
+    normPrivateKeyToScalar: a,
+    weierstrassEquation: o,
+    isWithinCurveOrder: s
+  };
+}
+function zi(e) {
+  const t = Fn(e);
+  return Ye(t, {
+    hash: "hash",
+    hmac: "function",
+    randomBytes: "function"
+  }, {
+    bits2int: "function",
+    bits2int_modN: "function",
+    lowS: "boolean"
+  }), Object.freeze({ lowS: !0, ...t });
+}
+function Zi(e) {
+  const t = zi(e), { Fp: n, n: r } = t, i = n.BYTES + 1, o = 2 * n.BYTES + 1;
+  function s(b) {
+    return ue < b && b < n.ORDER;
+  }
+  function c(b) {
+    return V(b, r);
+  }
+  function a(b) {
+    return Pt(b, r);
+  }
+  const { ProjectivePoint: u, normPrivateKeyToScalar: f, weierstrassEquation: l, isWithinCurveOrder: d } = Vi({
+    ...t,
+    toBytes(b, v, S) {
+      const I = v.toAffine(), C = n.toBytes(I.x), L = _e;
+      return S ? L(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : L(Uint8Array.from([4]), C, n.toBytes(I.y));
+    },
+    fromBytes(b) {
+      const v = b.length, S = b[0], I = b.subarray(1);
+      if (v === i && (S === 2 || S === 3)) {
+        const C = F(I);
+        if (!s(C))
+          throw new Error("Point is not on curve");
+        const L = l(C);
+        let P = n.sqrt(L);
+        const T = (P & J) === J;
+        return (S & 1) === 1 !== T && (P = n.neg(P)), { x: C, y: P };
+      } else if (v === o && S === 4) {
+        const C = n.fromBytes(I.subarray(0, n.BYTES)), L = n.fromBytes(I.subarray(n.BYTES, 2 * n.BYTES));
+        return { x: C, y: L };
+      } else
+        throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${o} uncompressed bytes`);
+    }
+  }), w = (b) => Me(Be(b, t.nByteLength));
+  function y(b) {
+    const v = r >> J;
+    return b > v;
+  }
+  function h(b) {
+    return y(b) ? c(-b) : b;
+  }
+  const g = (b, v, S) => F(b.slice(v, S));
+  class p {
+    constructor(v, S, I) {
+      this.r = v, this.s = S, this.recovery = I, this.assertValidity();
+    }
+    // pair (bytes of r, bytes of s)
+    static fromCompact(v) {
+      const S = t.nByteLength;
+      return v = z("compactSignature", v, S * 2), new p(g(v, 0, S), g(v, S, 2 * S));
+    }
+    // DER encoded ECDSA signature
+    // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
+    static fromDER(v) {
+      const { r: S, s: I } = Ke.toSig(z("DER", v));
+      return new p(S, I);
+    }
+    assertValidity() {
+      if (!d(this.r))
+        throw new Error("r must be 0 < r < CURVE.n");
+      if (!d(this.s))
+        throw new Error("s must be 0 < s < CURVE.n");
+    }
+    addRecoveryBit(v) {
+      return new p(this.r, this.s, v);
+    }
+    recoverPublicKey(v) {
+      const { r: S, s: I, recovery: C } = this, L = E(z("msgHash", v));
+      if (C == null || ![0, 1, 2, 3].includes(C))
+        throw new Error("recovery id invalid");
+      const P = C === 2 || C === 3 ? S + t.n : S;
+      if (P >= n.ORDER)
+        throw new Error("recovery id 2 or 3 invalid");
+      const T = C & 1 ? "03" : "02", Y = u.fromHex(T + w(P)), ye = a(P), ke = c(-L * ye), Ve = c(I * ye), we = u.BASE.multiplyAndAddUnsafe(Y, ke, Ve);
+      if (!we)
+        throw new Error("point at infinify");
+      return we.assertValidity(), we;
+    }
+    // Signatures should be low-s, to prevent malleability.
+    hasHighS() {
+      return y(this.s);
+    }
+    normalizeS() {
+      return this.hasHighS() ? new p(this.r, c(-this.s), this.recovery) : this;
+    }
+    // DER-encoded
+    toDERRawBytes() {
+      return qe(this.toDERHex());
+    }
+    toDERHex() {
+      return Ke.hexFromSig({ r: this.r, s: this.s });
+    }
+    // padded bytes of r, then padded bytes of s
+    toCompactRawBytes() {
+      return qe(this.toCompactHex());
+    }
+    toCompactHex() {
+      return w(this.r) + w(this.s);
+    }
+  }
+  const m = {
+    isValidPrivateKey(b) {
+      try {
+        return f(b), !0;
+      } catch {
+        return !1;
+      }
+    },
+    normPrivateKeyToScalar: f,
+    /**
+     * Produces cryptographically secure private key from random of size
+     * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
+     */
+    randomPrivateKey: () => {
+      const b = Zn(t.n);
+      return Oi(t.randomBytes(b), t.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(b = 8, v = u.BASE) {
+      return v._setWindowSize(b), v.multiply(BigInt(3)), v;
+    }
+  };
+  function B(b, v = !0) {
+    return u.fromPrivateKey(b).toRawBytes(v);
+  }
+  function _(b) {
+    const v = b instanceof Uint8Array, S = typeof b == "string", I = (v || S) && b.length;
+    return v ? I === i || I === o : S ? I === 2 * i || I === 2 * o : b instanceof u;
+  }
+  function U(b, v, S = !0) {
+    if (_(b))
+      throw new Error("first arg must be private key");
+    if (!_(v))
+      throw new Error("second arg must be public key");
+    return u.fromHex(v).multiply(f(b)).toRawBytes(S);
+  }
+  const x = t.bits2int || function(b) {
+    const v = F(b), S = b.length * 8 - t.nBitLength;
+    return S > 0 ? v >> BigInt(S) : v;
+  }, E = t.bits2int_modN || function(b) {
+    return c(x(b));
+  }, A = Jt(t.nBitLength);
+  function O(b) {
+    if (typeof b != "bigint")
+      throw new Error("bigint expected");
+    if (!(ue <= b && b < A))
+      throw new Error(`bigint expected < 2^${t.nBitLength}`);
+    return Be(b, t.nByteLength);
+  }
+  function K(b, v, S = N) {
+    if (["recovered", "canonical"].some((Ue) => Ue in S))
+      throw new Error("sign() legacy options not supported");
+    const { hash: I, randomBytes: C } = t;
+    let { lowS: L, prehash: P, extraEntropy: T } = S;
+    L == null && (L = !0), b = z("msgHash", b), P && (b = z("prehashed msgHash", I(b)));
+    const Y = E(b), ye = f(v), ke = [O(ye), O(Y)];
+    if (T != null) {
+      const Ue = T === !0 ? C(n.BYTES) : T;
+      ke.push(z("extraEntropy", Ue));
+    }
+    const Ve = _e(...ke), we = Y;
+    function St(Ue) {
+      const Te = x(Ue);
+      if (!d(Te))
+        return;
+      const bn = a(Te), $e = u.BASE.multiply(Te).toAffine(), X = c($e.x);
+      if (X === ue)
+        return;
+      const Re = c(bn * c(we + X * ye));
+      if (Re === ue)
+        return;
+      let vn = ($e.x === X ? 0 : 2) | Number($e.y & J), xn = Re;
+      return L && y(Re) && (xn = h(Re), vn ^= 1), new p(X, xn, vn);
+    }
+    return { seed: Ve, k2sig: St };
+  }
+  const N = { lowS: t.lowS, prehash: !1 }, $ = { lowS: t.lowS, prehash: !1 };
+  function R(b, v, S = N) {
+    const { seed: I, k2sig: C } = K(b, v, S), L = t;
+    return jn(L.hash.outputLen, L.nByteLength, L.hmac)(I, C);
+  }
+  u.BASE._setWindowSize(8);
+  function H(b, v, S, I = $) {
+    var $e;
+    const C = b;
+    if (v = z("msgHash", v), S = z("publicKey", S), "strict" in I)
+      throw new Error("options.strict was renamed to lowS");
+    const { lowS: L, prehash: P } = I;
+    let T, Y;
+    try {
+      if (typeof C == "string" || C instanceof Uint8Array)
+        try {
+          T = p.fromDER(C);
+        } catch (X) {
+          if (!(X instanceof Ke.Err))
+            throw X;
+          T = p.fromCompact(C);
+        }
+      else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
+        const { r: X, s: Re } = C;
+        T = new p(X, Re);
+      } else
+        throw new Error("PARSE");
+      Y = u.fromHex(S);
+    } catch (X) {
+      if (X.message === "PARSE")
+        throw new Error("signature must be Signature instance, Uint8Array or hex string");
+      return !1;
+    }
+    if (L && T.hasHighS())
+      return !1;
+    P && (v = t.hash(v));
+    const { r: ye, s: ke } = T, Ve = E(v), we = a(ke), St = c(Ve * we), Ue = c(ye * we), Te = ($e = u.BASE.multiplyAndAddUnsafe(Y, St, Ue)) == null ? void 0 : $e.toAffine();
+    return Te ? c(Te.x) === ye : !1;
+  }
+  return {
+    CURVE: t,
+    getPublicKey: B,
+    getSharedSecret: U,
+    sign: R,
+    verify: H,
+    ProjectivePoint: u,
+    Signature: p,
+    utils: m
+  };
+}
+let Wn = class extends Hn {
+  constructor(t, n) {
+    super(), this.finished = !1, this.destroyed = !1, ai(t);
+    const r = Zt(n);
+    if (this.iHash = t.create(), 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 i = this.blockLen, o = new Uint8Array(i);
+    o.set(r.length > i ? t.create().update(r).digest() : r);
+    for (let s = 0; s < o.length; s++)
+      o[s] ^= 54;
+    this.iHash.update(o), this.oHash = t.create();
+    for (let s = 0; s < o.length; s++)
+      o[s] ^= 106;
+    this.oHash.update(o), o.fill(0);
+  }
+  update(t) {
+    return it(this), this.iHash.update(t), this;
+  }
+  digestInto(t) {
+    it(this), Pn(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+  }
+  digest() {
+    const t = new Uint8Array(this.oHash.outputLen);
+    return this.digestInto(t), t;
+  }
+  _cloneInto(t) {
+    t || (t = Object.create(Object.getPrototypeOf(this), {}));
+    const { oHash: n, iHash: r, finished: i, destroyed: o, blockLen: s, outputLen: c } = this;
+    return t = t, t.finished = i, t.destroyed = o, t.blockLen = s, t.outputLen = c, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
+  }
+  destroy() {
+    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+  }
+};
+const Gn = (e, t, n) => new Wn(e, t).update(n).digest();
+Gn.create = (e, t) => new Wn(e, t);
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function Fi(e) {
+  return {
+    hash: e,
+    hmac: (t, ...n) => Gn(e, t, fi(...n)),
+    randomBytes: Mn
+  };
+}
+function Wi(e, t) {
+  const n = (r) => Zi({ ...e, ...Fi(r) });
+  return Object.freeze({ ...n(t), create: n });
+}
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const dt = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), ot = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), st = BigInt(2), Nn = (e, t) => (e + t / st) / t;
+function Yn(e) {
+  const t = dt, n = BigInt(3), r = BigInt(6), i = BigInt(11), o = BigInt(22), s = BigInt(23), c = BigInt(44), a = BigInt(88), u = e * e * e % t, f = u * u * e % t, l = G(f, n, t) * f % t, d = G(l, n, t) * f % t, w = G(d, st, t) * u % t, y = G(w, i, t) * w % t, h = G(y, o, t) * y % t, g = G(h, c, t) * h % t, p = G(g, a, t) * g % t, m = G(p, c, t) * h % t, B = G(m, n, t) * f % t, _ = G(B, s, t) * y % t, U = G(_, r, t) * u % t, x = G(U, st, t);
+  if (!Ot.eql(Ot.sqr(x), e))
+    throw new Error("Cannot find square root");
+  return x;
+}
+const Ot = Pi(dt, void 0, void 0, { sqrt: Yn }), Le = Wi({
+  a: BigInt(0),
+  b: BigInt(7),
+  Fp: Ot,
+  n: ot,
+  // Base point (x, y) aka generator point
+  Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
+  Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),
+  h: BigInt(1),
+  lowS: !0,
+  /**
+   * 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: (e) => {
+      const t = ot, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Jn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), o = n, s = BigInt("0x100000000000000000000000000000000"), c = Nn(o * e, t), a = Nn(-r * e, t);
+      let u = V(e - c * n - a * i, t), f = V(-c * r - a * o, t);
+      const l = u > s, d = f > s;
+      if (l && (u = t - u), d && (f = t - f), u > s || f > s)
+        throw new Error("splitScalar: Endomorphism failed, k=" + e);
+      return { k1neg: l, k1: u, k2neg: d, k2: f };
+    }
+  }
+}, $t), gt = BigInt(0), Xn = (e) => typeof e == "bigint" && gt < e && e < dt, Gi = (e) => typeof e == "bigint" && gt < e && e < ot, Cn = {};
+function at(e, ...t) {
+  let n = Cn[e];
+  if (n === void 0) {
+    const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    n = _e(r, r), Cn[e] = n;
+  }
+  return $t(_e(n, ...t));
+}
+const Yt = (e) => e.toRawBytes(!0).slice(1), Ht = (e) => Be(e, 32), It = (e) => V(e, dt), Ge = (e) => V(e, ot), Xt = Le.ProjectivePoint, Ji = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
+function Mt(e) {
+  let t = Le.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
+  return { scalar: n.hasEvenY() ? t : Ge(-t), bytes: Yt(n) };
+}
+function Qn(e) {
+  if (!Xn(e))
+    throw new Error("bad x: need 0 < x < p");
+  const t = It(e * e), n = It(t * e + BigInt(7));
+  let r = Yn(n);
+  r % st !== gt && (r = It(-r));
+  const i = new Xt(e, r, Jn);
+  return i.assertValidity(), i;
+}
+function er(...e) {
+  return Ge(F(at("BIP0340/challenge", ...e)));
+}
+function Yi(e) {
+  return Mt(e).bytes;
+}
+function Xi(e, t, n = Mn(32)) {
+  const r = z("message", e), { bytes: i, scalar: o } = Mt(t), s = z("auxRand", n, 32), c = Ht(o ^ F(at("BIP0340/aux", s))), a = at("BIP0340/nonce", c, i, r), u = Ge(F(a));
+  if (u === gt)
+    throw new Error("sign failed: k is zero");
+  const { bytes: f, scalar: l } = Mt(u), d = er(f, i, r), w = new Uint8Array(64);
+  if (w.set(f, 0), w.set(Ht(Ge(l + d * o)), 32), !tr(w, r, i))
+    throw new Error("sign: Invalid signature produced");
+  return w;
+}
+function tr(e, t, n) {
+  const r = z("signature", e, 64), i = z("message", t), o = z("publicKey", n, 32);
+  try {
+    const s = Qn(F(o)), c = F(r.subarray(0, 32));
+    if (!Xn(c))
+      return !1;
+    const a = F(r.subarray(32, 64));
+    if (!Gi(a))
+      return !1;
+    const u = er(Ht(c), Yt(s), i), f = Ji(s, a, Ge(-u));
+    return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
+  } catch {
+    return !1;
+  }
+}
+const ze = {
+  getPublicKey: Yi,
+  sign: Xi,
+  verify: tr,
+  utils: {
+    randomPrivateKey: Le.utils.randomPrivateKey,
+    lift_x: Qn,
+    pointToBytes: Yt,
+    numberToBytesBE: Be,
+    bytesToNumberBE: F,
+    taggedHash: at,
+    mod: V
+  }
+}, Kt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const Qt = (e) => e instanceof Uint8Array, _t = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ne = (e, t) => e << 32 - t | e >>> t, Qi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!Qi)
+  throw new Error("Non little-endian hardware is not supported");
+const eo = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+function D(e) {
+  if (!Qt(e))
+    throw new Error("Uint8Array expected");
+  let t = "";
+  for (let n = 0; n < e.length; n++)
+    t += eo[e[n]];
+  return t;
+}
+function W(e) {
+  if (typeof e != "string")
+    throw new Error("hex string expected, got " + typeof e);
+  const t = e.length;
+  if (t % 2)
+    throw new Error("padded hex string expected, got unpadded hex of length " + t);
+  const n = new Uint8Array(t / 2);
+  for (let r = 0; r < n.length; r++) {
+    const i = r * 2, o = e.slice(i, i + 2), s = Number.parseInt(o, 16);
+    if (Number.isNaN(s) || s < 0)
+      throw new Error("Invalid byte sequence");
+    n[r] = s;
+  }
+  return n;
+}
+function to(e) {
+  if (typeof e != "string")
+    throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
+  return new Uint8Array(new TextEncoder().encode(e));
+}
+function Je(e) {
+  if (typeof e == "string" && (e = to(e)), !Qt(e))
+    throw new Error(`expected Uint8Array, got ${typeof e}`);
+  return e;
+}
+function pt(...e) {
+  const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
+  let n = 0;
+  return e.forEach((r) => {
+    if (!Qt(r))
+      throw new Error("Uint8Array expected");
+    t.set(r, n), n += r.length;
+  }), t;
+}
+class nr {
+  // Safe version that clones internal state
+  clone() {
+    return this._cloneInto();
+  }
+}
+function rr(e) {
+  const t = (r) => e().update(Je(r)).digest(), n = e();
+  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
+}
+function ir(e = 32) {
+  if (Kt && typeof Kt.getRandomValues == "function")
+    return Kt.getRandomValues(new Uint8Array(e));
+  throw new Error("crypto.getRandomValues must be defined");
+}
+function qt(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error(`Wrong positive integer: ${e}`);
+}
+function no(e) {
+  if (typeof e != "boolean")
+    throw new Error(`Expected boolean, not ${e}`);
+}
+function or(e, ...t) {
+  if (!(e instanceof Uint8Array))
+    throw new Error("Expected Uint8Array");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
+}
+function ro(e) {
+  if (typeof e != "function" || typeof e.create != "function")
+    throw new Error("Hash should be wrapped by utils.wrapConstructor");
+  qt(e.outputLen), qt(e.blockLen);
+}
+function io(e, t = !0) {
+  if (e.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (t && e.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function oo(e, t) {
+  or(e);
+  const n = t.outputLen;
+  if (e.length < n)
+    throw new Error(`digestInto() expects output buffer of length at least ${n}`);
+}
+const ie = {
+  number: qt,
+  bool: no,
+  bytes: or,
+  hash: ro,
+  exists: io,
+  output: oo
+};
+function so(e, t, n, r) {
+  if (typeof e.setBigUint64 == "function")
+    return e.setBigUint64(t, n, r);
+  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), c = Number(n & o), a = r ? 4 : 0, u = r ? 0 : 4;
+  e.setUint32(t + a, s, r), e.setUint32(t + u, c, r);
+}
+class ao extends nr {
+  constructor(t, n, r, i) {
+    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = _t(this.buffer);
+  }
+  update(t) {
+    ie.exists(this);
+    const { view: n, buffer: r, blockLen: i } = this;
+    t = Je(t);
+    const o = t.length;
+    for (let s = 0; s < o; ) {
+      const c = Math.min(i - this.pos, o - s);
+      if (c === i) {
+        const a = _t(t);
+        for (; i <= o - s; s += i)
+          this.process(a, s);
+        continue;
+      }
+      r.set(t.subarray(s, s + c), this.pos), this.pos += c, s += c, this.pos === i && (this.process(n, 0), this.pos = 0);
+    }
+    return this.length += t.length, this.roundClean(), this;
+  }
+  digestInto(t) {
+    ie.exists(this), ie.output(t, this), this.finished = !0;
+    const { buffer: n, view: r, blockLen: i, isLE: o } = this;
+    let { pos: s } = this;
+    n[s++] = 128, this.buffer.subarray(s).fill(0), this.padOffset > i - s && (this.process(r, 0), s = 0);
+    for (let l = s; l < i; l++)
+      n[l] = 0;
+    so(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
+    const c = _t(t), a = this.outputLen;
+    if (a % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const u = a / 4, f = this.get();
+    if (u > f.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let l = 0; l < u; l++)
+      c.setUint32(4 * l, f[l], o);
+  }
+  digest() {
+    const { buffer: t, outputLen: n } = this;
+    this.digestInto(t);
+    const r = t.slice(0, n);
+    return this.destroy(), r;
+  }
+  _cloneInto(t) {
+    t || (t = new this.constructor()), t.set(...this.get());
+    const { blockLen: n, buffer: r, length: i, finished: o, destroyed: s, pos: c } = this;
+    return t.length = i, t.pos = c, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
+  }
+}
+const co = (e, t, n) => e & t ^ ~e & n, uo = (e, t, n) => e & t ^ e & n ^ t & n, lo = 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
+]), xe = new Uint32Array([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]), me = new Uint32Array(64);
+class sr extends ao {
+  constructor() {
+    super(64, 32, 8, !1), this.A = xe[0] | 0, this.B = xe[1] | 0, this.C = xe[2] | 0, this.D = xe[3] | 0, this.E = xe[4] | 0, this.F = xe[5] | 0, this.G = xe[6] | 0, this.H = xe[7] | 0;
+  }
+  get() {
+    const { A: t, B: n, C: r, D: i, E: o, F: s, G: c, H: a } = this;
+    return [t, n, r, i, o, s, c, a];
+  }
+  // prettier-ignore
+  set(t, n, r, i, o, s, c, a) {
+    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = o | 0, this.F = s | 0, this.G = c | 0, this.H = a | 0;
+  }
+  process(t, n) {
+    for (let l = 0; l < 16; l++, n += 4)
+      me[l] = t.getUint32(n, !1);
+    for (let l = 16; l < 64; l++) {
+      const d = me[l - 15], w = me[l - 2], y = ne(d, 7) ^ ne(d, 18) ^ d >>> 3, h = ne(w, 17) ^ ne(w, 19) ^ w >>> 10;
+      me[l] = h + me[l - 7] + y + me[l - 16] | 0;
+    }
+    let { A: r, B: i, C: o, D: s, E: c, F: a, G: u, H: f } = this;
+    for (let l = 0; l < 64; l++) {
+      const d = ne(c, 6) ^ ne(c, 11) ^ ne(c, 25), w = f + d + co(c, a, u) + lo[l] + me[l] | 0, h = (ne(r, 2) ^ ne(r, 13) ^ ne(r, 22)) + uo(r, i, o) | 0;
+      f = u, u = a, a = c, c = s + w | 0, s = o, o = i, i = r, r = w + h | 0;
+    }
+    r = r + this.A | 0, i = i + this.B | 0, o = o + this.C | 0, s = s + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, u = u + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, c, a, u, f);
+  }
+  roundClean() {
+    me.fill(0);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
+  }
+}
+class fo extends sr {
+  constructor() {
+    super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28;
+  }
+}
+const Ne = rr(() => new sr());
+rr(() => new fo());
+/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function je(e) {
+  if (!Number.isSafeInteger(e))
+    throw new Error(`Wrong integer: ${e}`);
+}
+function de(...e) {
+  const t = (i, o) => (s) => i(o(s)), n = Array.from(e).reverse().reduce((i, o) => i ? t(i, o.encode) : o.encode, void 0), r = e.reduce((i, o) => i ? t(i, o.decode) : o.decode, void 0);
+  return { encode: n, decode: r };
+}
+function ge(e) {
+  return {
+    encode: (t) => {
+      if (!Array.isArray(t) || t.length && typeof t[0] != "number")
+        throw new Error("alphabet.encode input should be an array of numbers");
+      return t.map((n) => {
+        if (je(n), n < 0 || n >= e.length)
+          throw new Error(`Digit index outside alphabet: ${n} (alphabet: ${e.length})`);
+        return e[n];
+      });
+    },
+    decode: (t) => {
+      if (!Array.isArray(t) || t.length && typeof t[0] != "string")
+        throw new Error("alphabet.decode input should be array of strings");
+      return t.map((n) => {
+        if (typeof n != "string")
+          throw new Error(`alphabet.decode: not string element=${n}`);
+        const r = e.indexOf(n);
+        if (r === -1)
+          throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);
+        return r;
+      });
+    }
+  };
+}
+function pe(e = "") {
+  if (typeof e != "string")
+    throw new Error("join separator should be string");
+  return {
+    encode: (t) => {
+      if (!Array.isArray(t) || t.length && typeof t[0] != "string")
+        throw new Error("join.encode input should be array of strings");
+      for (let n of t)
+        if (typeof n != "string")
+          throw new Error(`join.encode: non-string input=${n}`);
+      return t.join(e);
+    },
+    decode: (t) => {
+      if (typeof t != "string")
+        throw new Error("join.decode input should be string");
+      return t.split(e);
+    }
+  };
+}
+function yt(e, t = "=") {
+  if (je(e), typeof t != "string")
+    throw new Error("padding chr should be string");
+  return {
+    encode(n) {
+      if (!Array.isArray(n) || n.length && typeof n[0] != "string")
+        throw new Error("padding.encode input should be array of strings");
+      for (let r of n)
+        if (typeof r != "string")
+          throw new Error(`padding.encode: non-string input=${r}`);
+      for (; n.length * e % 8; )
+        n.push(t);
+      return n;
+    },
+    decode(n) {
+      if (!Array.isArray(n) || n.length && typeof n[0] != "string")
+        throw new Error("padding.encode input should be array of strings");
+      for (let i of n)
+        if (typeof i != "string")
+          throw new Error(`padding.decode: non-string input=${i}`);
+      let r = n.length;
+      if (r * e % 8)
+        throw new Error("Invalid padding: string should have whole number of bytes");
+      for (; r > 0 && n[r - 1] === t; r--)
+        if (!((r - 1) * e % 8))
+          throw new Error("Invalid padding: string has too much padding");
+      return n.slice(0, r);
+    }
+  };
+}
+function ar(e) {
+  if (typeof e != "function")
+    throw new Error("normalize fn should be function");
+  return { encode: (t) => t, decode: (t) => e(t) };
+}
+function Un(e, t, n) {
+  if (t < 2)
+    throw new Error(`convertRadix: wrong from=${t}, base cannot be less than 2`);
+  if (n < 2)
+    throw new Error(`convertRadix: wrong to=${n}, base cannot be less than 2`);
+  if (!Array.isArray(e))
+    throw new Error("convertRadix: data should be array");
+  if (!e.length)
+    return [];
+  let r = 0;
+  const i = [], o = Array.from(e);
+  for (o.forEach((s) => {
+    if (je(s), s < 0 || s >= t)
+      throw new Error(`Wrong integer: ${s}`);
+  }); ; ) {
+    let s = 0, c = !0;
+    for (let a = r; a < o.length; a++) {
+      const u = o[a], f = t * s + u;
+      if (!Number.isSafeInteger(f) || t * s / t !== s || f - u !== t * s)
+        throw new Error("convertRadix: carry overflow");
+      if (s = f % n, o[a] = Math.floor(f / n), !Number.isSafeInteger(o[a]) || o[a] * n + s !== f)
+        throw new Error("convertRadix: carry overflow");
+      if (c)
+        o[a] ? c = !1 : r = a;
+      else continue;
+    }
+    if (i.push(s), c)
+      break;
+  }
+  for (let s = 0; s < e.length - 1 && e[s] === 0; s++)
+    i.push(0);
+  return i.reverse();
+}
+const cr = (e, t) => t ? cr(t, e % t) : e, ct = (e, t) => e + (t - cr(e, t));
+function Dt(e, t, n, r) {
+  if (!Array.isArray(e))
+    throw new Error("convertRadix2: data should be array");
+  if (t <= 0 || t > 32)
+    throw new Error(`convertRadix2: wrong from=${t}`);
+  if (n <= 0 || n > 32)
+    throw new Error(`convertRadix2: wrong to=${n}`);
+  if (ct(t, n) > 32)
+    throw new Error(`convertRadix2: carry overflow from=${t} to=${n} carryBits=${ct(t, n)}`);
+  let i = 0, o = 0;
+  const s = 2 ** n - 1, c = [];
+  for (const a of e) {
+    if (je(a), a >= 2 ** t)
+      throw new Error(`convertRadix2: invalid data word=${a} from=${t}`);
+    if (i = i << t | a, o + t > 32)
+      throw new Error(`convertRadix2: carry overflow pos=${o} from=${t}`);
+    for (o += t; o >= n; o -= n)
+      c.push((i >> o - n & s) >>> 0);
+    i &= 2 ** o - 1;
+  }
+  if (i = i << n - o & s, !r && o >= t)
+    throw new Error("Excess padding");
+  if (!r && i)
+    throw new Error(`Non-zero padding: ${i}`);
+  return r && o > 0 && c.push(i >>> 0), c;
+}
+function ho(e) {
+  return je(e), {
+    encode: (t) => {
+      if (!(t instanceof Uint8Array))
+        throw new Error("radix.encode input should be Uint8Array");
+      return Un(Array.from(t), 2 ** 8, e);
+    },
+    decode: (t) => {
+      if (!Array.isArray(t) || t.length && typeof t[0] != "number")
+        throw new Error("radix.decode input should be array of strings");
+      return Uint8Array.from(Un(t, e, 2 ** 8));
+    }
+  };
+}
+function Ce(e, t = !1) {
+  if (je(e), e <= 0 || e > 32)
+    throw new Error("radix2: bits should be in (0..32]");
+  if (ct(8, e) > 32 || ct(e, 8) > 32)
+    throw new Error("radix2: carry overflow");
+  return {
+    encode: (n) => {
+      if (!(n instanceof Uint8Array))
+        throw new Error("radix2.encode input should be Uint8Array");
+      return Dt(Array.from(n), 8, e, !t);
+    },
+    decode: (n) => {
+      if (!Array.isArray(n) || n.length && typeof n[0] != "number")
+        throw new Error("radix2.decode input should be array of strings");
+      return Uint8Array.from(Dt(n, e, 8, t));
+    }
+  };
+}
+function In(e) {
+  if (typeof e != "function")
+    throw new Error("unsafeWrapper fn should be function");
+  return function(...t) {
+    try {
+      return e.apply(null, t);
+    } catch {
+    }
+  };
+}
+const go = de(Ce(4), ge("0123456789ABCDEF"), pe("")), po = de(Ce(5), ge("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), yt(5), pe(""));
+de(Ce(5), ge("0123456789ABCDEFGHIJKLMNOPQRSTUV"), yt(5), pe(""));
+de(Ce(5), ge("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), pe(""), ar((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
+const he = de(Ce(6), ge("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), yt(6), pe("")), yo = de(Ce(6), ge("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), yt(6), pe("")), en = (e) => de(ho(58), ge(e), pe("")), ut = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
+en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
+const Kn = [0, 2, 3, 5, 6, 7, 9, 10, 11], wo = {
+  encode(e) {
+    let t = "";
+    for (let n = 0; n < e.length; n += 8) {
+      const r = e.subarray(n, n + 8);
+      t += ut.encode(r).padStart(Kn[r.length], "1");
+    }
+    return t;
+  },
+  decode(e) {
+    let t = [];
+    for (let n = 0; n < e.length; n += 11) {
+      const r = e.slice(n, n + 11), i = Kn.indexOf(r.length), o = ut.decode(r);
+      for (let s = 0; s < o.length - i; s++)
+        if (o[s] !== 0)
+          throw new Error("base58xmr: wrong padding");
+      t = t.concat(Array.from(o.slice(o.length - i)));
+    }
+    return Uint8Array.from(t);
+  }
+}, jt = de(ge("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), pe("")), _n = [996825010, 642813549, 513874426, 1027748829, 705979059];
+function Ze(e) {
+  const t = e >> 25;
+  let n = (e & 33554431) << 5;
+  for (let r = 0; r < _n.length; r++)
+    (t >> r & 1) === 1 && (n ^= _n[r]);
+  return n;
+}
+function Ln(e, t, n = 1) {
+  const r = e.length;
+  let i = 1;
+  for (let o = 0; o < r; o++) {
+    const s = e.charCodeAt(o);
+    if (s < 33 || s > 126)
+      throw new Error(`Invalid prefix (${e})`);
+    i = Ze(i) ^ s >> 5;
+  }
+  i = Ze(i);
+  for (let o = 0; o < r; o++)
+    i = Ze(i) ^ e.charCodeAt(o) & 31;
+  for (let o of t)
+    i = Ze(i) ^ o;
+  for (let o = 0; o < 6; o++)
+    i = Ze(i);
+  return i ^= n, jt.encode(Dt([i % 2 ** 30], 30, 5, !1));
+}
+function ur(e) {
+  const t = e === "bech32" ? 1 : 734539939, n = Ce(5), r = n.decode, i = n.encode, o = In(r);
+  function s(f, l, d = 90) {
+    if (typeof f != "string")
+      throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
+    if (!Array.isArray(l) || l.length && typeof l[0] != "number")
+      throw new Error(`bech32.encode words should be array of numbers, not ${typeof l}`);
+    const w = f.length + 7 + l.length;
+    if (d !== !1 && w > d)
+      throw new TypeError(`Length ${w} exceeds limit ${d}`);
+    return f = f.toLowerCase(), `${f}1${jt.encode(l)}${Ln(f, l, t)}`;
+  }
+  function c(f, l = 90) {
+    if (typeof f != "string")
+      throw new Error(`bech32.decode input should be string, not ${typeof f}`);
+    if (f.length < 8 || l !== !1 && f.length > l)
+      throw new TypeError(`Wrong string length: ${f.length} (${f}). Expected (8..${l})`);
+    const d = f.toLowerCase();
+    if (f !== d && f !== f.toUpperCase())
+      throw new Error("String must be lowercase or uppercase");
+    f = d;
+    const w = f.lastIndexOf("1");
+    if (w === 0 || w === -1)
+      throw new Error('Letter "1" must be present between prefix and data only');
+    const y = f.slice(0, w), h = f.slice(w + 1);
+    if (h.length < 6)
+      throw new Error("Data must be at least 6 characters long");
+    const g = jt.decode(h).slice(0, -6), p = Ln(y, g, t);
+    if (!h.endsWith(p))
+      throw new Error(`Invalid checksum in ${f}: expected "${p}"`);
+    return { prefix: y, words: g };
+  }
+  const a = In(c);
+  function u(f) {
+    const { prefix: l, words: d } = c(f, !1);
+    return { prefix: l, words: d, bytes: r(d) };
+  }
+  return { encode: s, decode: c, decodeToBytes: u, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: o, toWords: i };
+}
+const De = ur("bech32");
+ur("bech32m");
+const bo = {
+  encode: (e) => new TextDecoder().decode(e),
+  decode: (e) => new TextEncoder().encode(e)
+}, vo = de(Ce(4), ge("0123456789abcdef"), pe(""), ar((e) => {
+  if (typeof e != "string" || e.length % 2)
+    throw new TypeError(`hex.decode: expected string, got ${typeof e} with length ${e.length}`);
+  return e.toLowerCase();
+})), xo = {
+  utf8: bo,
+  hex: vo,
+  base16: go,
+  base32: po,
+  base64: he,
+  base64url: yo,
+  base58: ut,
+  base58xmr: wo
+};
+`${Object.keys(xo).join(", ")}`;
+function Lt(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error(`positive integer expected, not ${e}`);
+}
+function kn(e) {
+  if (typeof e != "boolean")
+    throw new Error(`boolean expected, not ${e}`);
+}
+function mo(e) {
+  return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
+}
+function le(e, ...t) {
+  if (!mo(e))
+    throw new Error("Uint8Array expected");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
+}
+/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */
+const Z = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), Eo = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!Eo)
+  throw new Error("Non little-endian hardware is not supported");
+function Ao(e, t) {
+  if (t == null || typeof t != "object")
+    throw new Error("options must be defined");
+  return Object.assign(e, t);
+}
+function So(e, t) {
+  if (e.length !== t.length)
+    return !1;
+  let n = 0;
+  for (let r = 0; r < e.length; r++)
+    n |= e[r] ^ t[r];
+  return n === 0;
+}
+const Bo = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Se = 16, No = 283;
+function tn(e) {
+  return e << 1 ^ No & -(e >> 7);
+}
+function Oe(e, t) {
+  let n = 0;
+  for (; t > 0; t >>= 1)
+    n ^= e & -(t & 1), e = tn(e);
+  return n;
+}
+const Vt = /* @__PURE__ */ (() => {
+  let e = new Uint8Array(256);
+  for (let n = 0, r = 1; n < 256; n++, r ^= tn(r))
+    e[n] = r;
+  const t = new Uint8Array(256);
+  t[0] = 99;
+  for (let n = 0; n < 255; n++) {
+    let r = e[255 - n];
+    r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
+  }
+  return t;
+})(), Co = /* @__PURE__ */ Vt.map((e, t) => Vt.indexOf(t)), Uo = (e) => e << 24 | e >>> 8, kt = (e) => e << 8 | e >>> 24;
+function lr(e, t) {
+  if (e.length !== 256)
+    throw new Error("Wrong sbox length");
+  const n = new Uint32Array(256).map((u, f) => t(e[f])), r = n.map(kt), i = r.map(kt), o = i.map(kt), s = new Uint32Array(256 * 256), c = new Uint32Array(256 * 256), a = new Uint16Array(256 * 256);
+  for (let u = 0; u < 256; u++)
+    for (let f = 0; f < 256; f++) {
+      const l = u * 256 + f;
+      s[l] = n[u] ^ r[f], c[l] = i[u] ^ o[f], a[l] = e[u] << 8 | e[f];
+    }
+  return { sbox: e, sbox2: a, T0: n, T1: r, T2: i, T3: o, T01: s, T23: c };
+}
+const nn = /* @__PURE__ */ lr(Vt, (e) => Oe(e, 3) << 24 | e << 16 | e << 8 | Oe(e, 2)), fr = /* @__PURE__ */ lr(Co, (e) => Oe(e, 11) << 24 | Oe(e, 13) << 16 | Oe(e, 9) << 8 | Oe(e, 14)), Io = /* @__PURE__ */ (() => {
+  const e = new Uint8Array(16);
+  for (let t = 0, n = 1; t < 16; t++, n = tn(n))
+    e[t] = n;
+  return e;
+})();
+function hr(e) {
+  le(e);
+  const t = e.length;
+  if (![16, 24, 32].includes(t))
+    throw new Error(`aes: wrong key size: should be 16, 24 or 32, got: ${t}`);
+  const { sbox2: n } = nn, r = Z(e), i = r.length, o = (c) => oe(n, c, c, c, c), s = new Uint32Array(t + 28);
+  s.set(r);
+  for (let c = i; c < s.length; c++) {
+    let a = s[c - 1];
+    c % i === 0 ? a = o(Uo(a)) ^ Io[c / i - 1] : i > 6 && c % i === 4 && (a = o(a)), s[c] = s[c - i] ^ a;
+  }
+  return s;
+}
+function Ko(e) {
+  const t = hr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: o, T1: s, T2: c, T3: a } = fr;
+  for (let u = 0; u < r; u += 4)
+    for (let f = 0; f < 4; f++)
+      n[u + f] = t[r - u - 4 + f];
+  t.fill(0);
+  for (let u = 4; u < r - 4; u++) {
+    const f = n[u], l = oe(i, f, f, f, f);
+    n[u] = o[l & 255] ^ s[l >>> 8 & 255] ^ c[l >>> 16 & 255] ^ a[l >>> 24];
+  }
+  return n;
+}
+function Ae(e, t, n, r, i, o) {
+  return e[n << 8 & 65280 | r >>> 8 & 255] ^ t[i >>> 8 & 65280 | o >>> 24 & 255];
+}
+function oe(e, t, n, r, i) {
+  return e[t & 255 | n & 65280] | e[r >>> 16 & 255 | i >>> 16 & 65280] << 16;
+}
+function Tn(e, t, n, r, i) {
+  const { sbox2: o, T01: s, T23: c } = nn;
+  let a = 0;
+  t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
+  const u = e.length / 4 - 2;
+  for (let y = 0; y < u; y++) {
+    const h = e[a++] ^ Ae(s, c, t, n, r, i), g = e[a++] ^ Ae(s, c, n, r, i, t), p = e[a++] ^ Ae(s, c, r, i, t, n), m = e[a++] ^ Ae(s, c, i, t, n, r);
+    t = h, n = g, r = p, i = m;
+  }
+  const f = e[a++] ^ oe(o, t, n, r, i), l = e[a++] ^ oe(o, n, r, i, t), d = e[a++] ^ oe(o, r, i, t, n), w = e[a++] ^ oe(o, i, t, n, r);
+  return { s0: f, s1: l, s2: d, s3: w };
+}
+function _o(e, t, n, r, i) {
+  const { sbox2: o, T01: s, T23: c } = fr;
+  let a = 0;
+  t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
+  const u = e.length / 4 - 2;
+  for (let y = 0; y < u; y++) {
+    const h = e[a++] ^ Ae(s, c, t, i, r, n), g = e[a++] ^ Ae(s, c, n, t, i, r), p = e[a++] ^ Ae(s, c, r, n, t, i), m = e[a++] ^ Ae(s, c, i, r, n, t);
+    t = h, n = g, r = p, i = m;
+  }
+  const f = e[a++] ^ oe(o, t, i, r, n), l = e[a++] ^ oe(o, n, t, i, r), d = e[a++] ^ oe(o, r, n, t, i), w = e[a++] ^ oe(o, i, r, n, t);
+  return { s0: f, s1: l, s2: d, s3: w };
+}
+function dr(e, t) {
+  if (!t)
+    return new Uint8Array(e);
+  if (le(t), t.length < e)
+    throw new Error(`aes: wrong destination length, expected at least ${e}, got: ${t.length}`);
+  return t;
+}
+function Lo(e) {
+  if (le(e), e.length % Se !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Se}`);
+}
+function ko(e, t, n) {
+  let r = e.length;
+  const i = r % Se;
+  if (!t && i !== 0)
+    throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
+  const o = Z(e);
+  if (t) {
+    let a = Se - i;
+    a || (a = Se), r = r + a;
+  }
+  const s = dr(r, n), c = Z(s);
+  return { b: o, o: c, out: s };
+}
+function To(e, t) {
+  if (!t)
+    return e;
+  const n = e.length;
+  if (!n)
+    throw new Error("aes/pcks5: empty ciphertext not allowed");
+  const r = e[n - 1];
+  if (r <= 0 || r > 16)
+    throw new Error(`aes/pcks5: wrong padding byte: ${r}`);
+  const i = e.subarray(0, -r);
+  for (let o = 0; o < r; o++)
+    if (e[n - o - 1] !== r)
+      throw new Error("aes/pcks5: wrong padding");
+  return i;
+}
+function $o(e) {
+  const t = new Uint8Array(16), n = Z(t);
+  t.set(e);
+  const r = Se - e.length;
+  for (let i = Se - r; i < Se; i++)
+    t[i] = r;
+  return n;
+}
+const gr = /* @__PURE__ */ Bo({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
+  le(t), le(n, 16);
+  const i = !r.disablePadding;
+  return {
+    encrypt: (o, s) => {
+      const c = hr(t), { b: a, o: u, out: f } = ko(o, i, s), l = Z(n);
+      let d = l[0], w = l[1], y = l[2], h = l[3], g = 0;
+      for (; g + 4 <= a.length; )
+        d ^= a[g + 0], w ^= a[g + 1], y ^= a[g + 2], h ^= a[g + 3], { s0: d, s1: w, s2: y, s3: h } = Tn(c, d, w, y, h), u[g++] = d, u[g++] = w, u[g++] = y, u[g++] = h;
+      if (i) {
+        const p = $o(o.subarray(g * 4));
+        d ^= p[0], w ^= p[1], y ^= p[2], h ^= p[3], { s0: d, s1: w, s2: y, s3: h } = Tn(c, d, w, y, h), u[g++] = d, u[g++] = w, u[g++] = y, u[g++] = h;
+      }
+      return c.fill(0), f;
+    },
+    decrypt: (o, s) => {
+      Lo(o);
+      const c = Ko(t), a = Z(n), u = dr(o.length, s), f = Z(o), l = Z(u);
+      let d = a[0], w = a[1], y = a[2], h = a[3];
+      for (let g = 0; g + 4 <= f.length; ) {
+        const p = d, m = w, B = y, _ = h;
+        d = f[g + 0], w = f[g + 1], y = f[g + 2], h = f[g + 3];
+        const { s0: U, s1: x, s2: E, s3: A } = _o(c, d, w, y, h);
+        l[g++] = U ^ p, l[g++] = x ^ m, l[g++] = E ^ B, l[g++] = A ^ _;
+      }
+      return c.fill(0), To(u, i);
+    }
+  };
+}), pr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Ro = pr("expand 16-byte k"), Po = pr("expand 32-byte k"), Oo = Z(Ro), yr = Z(Po);
+yr.slice();
+function k(e, t) {
+  return e << t | e >>> 32 - t;
+}
+function zt(e) {
+  return e.byteOffset % 4 === 0;
+}
+const Qe = 64, Ho = 16, wr = 2 ** 32 - 1, $n = new Uint32Array();
+function Mo(e, t, n, r, i, o, s, c) {
+  const a = i.length, u = new Uint8Array(Qe), f = Z(u), l = zt(i) && zt(o), d = l ? Z(i) : $n, w = l ? Z(o) : $n;
+  for (let y = 0; y < a; s++) {
+    if (e(t, n, r, f, s, c), s >= wr)
+      throw new Error("arx: counter overflow");
+    const h = Math.min(Qe, a - y);
+    if (l && h === Qe) {
+      const g = y / 4;
+      if (y % 4 !== 0)
+        throw new Error("arx: invalid block position");
+      for (let p = 0, m; p < Ho; p++)
+        m = g + p, w[m] = d[m] ^ f[p];
+      y += Qe;
+      continue;
+    }
+    for (let g = 0, p; g < h; g++)
+      p = y + g, o[p] = i[p] ^ u[g];
+    y += h;
+  }
+}
+function qo(e, t) {
+  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: o, rounds: s } = Ao({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
+  if (typeof e != "function")
+    throw new Error("core must be a function");
+  return Lt(i), Lt(s), kn(o), kn(n), (c, a, u, f, l = 0) => {
+    le(c), le(a), le(u);
+    const d = u.length;
+    if (f || (f = new Uint8Array(d)), le(f), Lt(l), l < 0 || l >= wr)
+      throw new Error("arx: counter overflow");
+    if (f.length < d)
+      throw new Error(`arx: output (${f.length}) is shorter than data (${d})`);
+    const w = [];
+    let y = c.length, h, g;
+    if (y === 32)
+      h = c.slice(), w.push(h), g = yr;
+    else if (y === 16 && n)
+      h = new Uint8Array(32), h.set(c), h.set(c, 16), g = Oo, w.push(h);
+    else
+      throw new Error(`arx: invalid 32-byte key, got length=${y}`);
+    zt(a) || (a = a.slice(), w.push(a));
+    const p = Z(h);
+    if (r) {
+      if (a.length !== 24)
+        throw new Error("arx: extended nonce must be 24 bytes");
+      r(g, p, Z(a.subarray(0, 16)), p), a = a.subarray(16);
+    }
+    const m = 16 - i;
+    if (m !== a.length)
+      throw new Error(`arx: nonce must be ${m} or 16 bytes`);
+    if (m !== 12) {
+      const _ = new Uint8Array(12);
+      _.set(a, o ? 0 : 12 - a.length), a = _, w.push(a);
+    }
+    const B = Z(a);
+    for (Mo(e, g, p, B, u, f, l, s); w.length > 0; )
+      w.pop().fill(0);
+    return f;
+  };
+}
+function Do(e, t, n, r, i, o = 20) {
+  let s = e[0], c = e[1], a = e[2], u = e[3], f = t[0], l = t[1], d = t[2], w = t[3], y = t[4], h = t[5], g = t[6], p = t[7], m = i, B = n[0], _ = n[1], U = n[2], x = s, E = c, A = a, O = u, K = f, N = l, $ = d, R = w, H = y, b = h, v = g, S = p, I = m, C = B, L = _, P = U;
+  for (let Y = 0; Y < o; Y += 2)
+    x = x + K | 0, I = k(I ^ x, 16), H = H + I | 0, K = k(K ^ H, 12), x = x + K | 0, I = k(I ^ x, 8), H = H + I | 0, K = k(K ^ H, 7), E = E + N | 0, C = k(C ^ E, 16), b = b + C | 0, N = k(N ^ b, 12), E = E + N | 0, C = k(C ^ E, 8), b = b + C | 0, N = k(N ^ b, 7), A = A + $ | 0, L = k(L ^ A, 16), v = v + L | 0, $ = k($ ^ v, 12), A = A + $ | 0, L = k(L ^ A, 8), v = v + L | 0, $ = k($ ^ v, 7), O = O + R | 0, P = k(P ^ O, 16), S = S + P | 0, R = k(R ^ S, 12), O = O + R | 0, P = k(P ^ O, 8), S = S + P | 0, R = k(R ^ S, 7), x = x + N | 0, P = k(P ^ x, 16), v = v + P | 0, N = k(N ^ v, 12), x = x + N | 0, P = k(P ^ x, 8), v = v + P | 0, N = k(N ^ v, 7), E = E + $ | 0, I = k(I ^ E, 16), S = S + I | 0, $ = k($ ^ S, 12), E = E + $ | 0, I = k(I ^ E, 8), S = S + I | 0, $ = k($ ^ S, 7), A = A + R | 0, C = k(C ^ A, 16), H = H + C | 0, R = k(R ^ H, 12), A = A + R | 0, C = k(C ^ A, 8), H = H + C | 0, R = k(R ^ H, 7), O = O + K | 0, L = k(L ^ O, 16), b = b + L | 0, K = k(K ^ b, 12), O = O + K | 0, L = k(L ^ O, 8), b = b + L | 0, K = k(K ^ b, 7);
+  let T = 0;
+  r[T++] = s + x | 0, r[T++] = c + E | 0, r[T++] = a + A | 0, r[T++] = u + O | 0, r[T++] = f + K | 0, r[T++] = l + N | 0, r[T++] = d + $ | 0, r[T++] = w + R | 0, r[T++] = y + H | 0, r[T++] = h + b | 0, r[T++] = g + v | 0, r[T++] = p + S | 0, r[T++] = m + I | 0, r[T++] = B + C | 0, r[T++] = _ + L | 0, r[T++] = U + P | 0;
+}
+const br = /* @__PURE__ */ qo(Do, {
+  counterRight: !1,
+  counterLength: 4,
+  allowShortKeys: !1
+});
+class vr extends nr {
+  constructor(t, n) {
+    super(), this.finished = !1, this.destroyed = !1, ie.hash(t);
+    const r = Je(n);
+    if (this.iHash = t.create(), 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 i = this.blockLen, o = new Uint8Array(i);
+    o.set(r.length > i ? t.create().update(r).digest() : r);
+    for (let s = 0; s < o.length; s++)
+      o[s] ^= 54;
+    this.iHash.update(o), this.oHash = t.create();
+    for (let s = 0; s < o.length; s++)
+      o[s] ^= 106;
+    this.oHash.update(o), o.fill(0);
+  }
+  update(t) {
+    return ie.exists(this), this.iHash.update(t), this;
+  }
+  digestInto(t) {
+    ie.exists(this), ie.bytes(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+  }
+  digest() {
+    const t = new Uint8Array(this.oHash.outputLen);
+    return this.digestInto(t), t;
+  }
+  _cloneInto(t) {
+    t || (t = Object.create(Object.getPrototypeOf(this), {}));
+    const { oHash: n, iHash: r, finished: i, destroyed: o, blockLen: s, outputLen: c } = this;
+    return t = t, t.finished = i, t.destroyed = o, t.blockLen = s, t.outputLen = c, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
+  }
+  destroy() {
+    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+  }
+}
+const wt = (e, t, n) => new vr(e, t).update(n).digest();
+wt.create = (e, t) => new vr(e, t);
+function rn(e, t, n) {
+  return ie.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), wt(e, Je(n), Je(t));
+}
+const Tt = new Uint8Array([0]), Rn = new Uint8Array();
+function xr(e, t, n, r = 32) {
+  if (ie.hash(e), ie.number(r), r > 255 * e.outputLen)
+    throw new Error("Length should be <= 255*HashLen");
+  const i = Math.ceil(r / e.outputLen);
+  n === void 0 && (n = Rn);
+  const o = new Uint8Array(i * e.outputLen), s = wt.create(e, t), c = s._cloneInto(), a = new Uint8Array(s.outputLen);
+  for (let u = 0; u < i; u++)
+    Tt[0] = u + 1, c.update(u === 0 ? Rn : a).update(n).update(Tt).digestInto(a), o.set(a, e.outputLen * u), s._cloneInto(c);
+  return s.destroy(), c.destroy(), a.fill(0), Tt.fill(0), o.slice(0, r);
+}
+var jo = Object.defineProperty, q = (e, t) => {
+  for (var n in t)
+    jo(e, n, { get: t[n], enumerable: !0 });
+}, Pe = Symbol("verified"), Vo = (e) => e instanceof Object;
+function mr(e) {
+  if (!Vo(e) || typeof e.kind != "number" || typeof e.content != "string" || typeof e.created_at != "number" || typeof e.pubkey != "string" || !e.pubkey.match(/^[a-f0-9]{64}$/) || !Array.isArray(e.tags))
+    return !1;
+  for (let t = 0; t < e.tags.length; t++) {
+    let n = e.tags[t];
+    if (!Array.isArray(n))
+      return !1;
+    for (let r = 0; r < n.length; r++)
+      if (typeof n[r] == "object")
+        return !1;
+  }
+  return !0;
+}
+var zo = {};
+q(zo, {
+  Queue: () => Go,
+  QueueNode: () => Er,
+  binarySearch: () => on,
+  insertEventIntoAscendingList: () => Wo,
+  insertEventIntoDescendingList: () => Fo,
+  normalizeURL: () => Zo,
+  utf8Decoder: () => re,
+  utf8Encoder: () => ee
+});
+var re = new TextDecoder("utf-8"), ee = new TextEncoder();
+function Zo(e) {
+  e.indexOf("://") === -1 && (e = "wss://" + e);
+  let t = new URL(e);
+  return t.pathname = t.pathname.replace(/\/+/g, "/"), t.pathname.endsWith("/") && (t.pathname = t.pathname.slice(0, -1)), (t.port === "80" && t.protocol === "ws:" || t.port === "443" && t.protocol === "wss:") && (t.port = ""), t.searchParams.sort(), t.hash = "", t.toString();
+}
+function Fo(e, t) {
+  const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
+  return r || e.splice(n, 0, t), e;
+}
+function Wo(e, t) {
+  const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
+  return r || e.splice(n, 0, t), e;
+}
+function on(e, t) {
+  let n = 0, r = e.length - 1;
+  for (; n <= r; ) {
+    const i = Math.floor((n + r) / 2), o = t(e[i]);
+    if (o === 0)
+      return [i, !0];
+    o < 0 ? r = i - 1 : n = i + 1;
+  }
+  return [n, !1];
+}
+var Er = class {
+  constructor(e) {
+    Q(this, "value");
+    Q(this, "next", null);
+    Q(this, "prev", null);
+    this.value = e;
+  }
+}, Go = class {
+  constructor() {
+    Q(this, "first");
+    Q(this, "last");
+    this.first = null, this.last = null;
+  }
+  enqueue(e) {
+    const t = new Er(e);
+    return this.last ? this.last === this.first ? (this.last = t, this.last.prev = this.first, this.first.next = t) : (t.prev = this.last, this.last.next = t, this.last = t) : (this.first = t, this.last = t), !0;
+  }
+  dequeue() {
+    if (!this.first)
+      return null;
+    if (this.first === this.last) {
+      const t = this.first;
+      return this.first = null, this.last = null, t.value;
+    }
+    const e = this.first;
+    return this.first = e.next, e.value;
+  }
+}, Jo = class {
+  generateSecretKey() {
+    return ze.utils.randomPrivateKey();
+  }
+  getPublicKey(e) {
+    return D(ze.getPublicKey(e));
+  }
+  finalizeEvent(e, t) {
+    const n = e;
+    return n.pubkey = D(ze.getPublicKey(t)), n.id = nt(n), n.sig = D(ze.sign(nt(n), t)), n[Pe] = !0, n;
+  }
+  verifyEvent(e) {
+    if (typeof e[Pe] == "boolean")
+      return e[Pe];
+    const t = nt(e);
+    if (t !== e.id)
+      return e[Pe] = !1, !1;
+    try {
+      const n = ze.verify(e.sig, t, e.pubkey);
+      return e[Pe] = n, n;
+    } catch {
+      return e[Pe] = !1, !1;
+    }
+  }
+};
+function Yo(e) {
+  if (!mr(e))
+    throw new Error("can't serialize event with wrong or missing properties");
+  return JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content]);
+}
+function nt(e) {
+  let t = Ne(ee.encode(Yo(e)));
+  return D(t);
+}
+var bt = new Jo(), He = bt.generateSecretKey, Ee = bt.getPublicKey, se = bt.finalizeEvent, sn = bt.verifyEvent, Xo = {};
+q(Xo, {
+  Application: () => Xs,
+  BadgeAward: () => as,
+  BadgeDefinition: () => zs,
+  BlockedRelaysList: () => Ks,
+  BookmarkList: () => Cs,
+  Bookmarksets: () => Ds,
+  Calendar: () => oa,
+  CalendarEventRSVP: () => sa,
+  ChannelCreation: () => Cr,
+  ChannelHideMessage: () => Kr,
+  ChannelMessage: () => Ir,
+  ChannelMetadata: () => Ur,
+  ChannelMuteUser: () => _r,
+  ClassifiedListing: () => ta,
+  ClientAuth: () => Lr,
+  CommunitiesList: () => Us,
+  CommunityDefinition: () => ua,
+  CommunityPostApproval: () => ys,
+  Contacts: () => rs,
+  CreateOrUpdateProduct: () => Ws,
+  CreateOrUpdateStall: () => Fs,
+  Curationsets: () => js,
+  Date: () => ra,
+  DraftClassifiedListing: () => na,
+  DraftLong: () => Js,
+  Emojisets: () => Ys,
+  EncryptedDirectMessage: () => is,
+  EncryptedDirectMessages: () => os,
+  EventDeletion: () => ss,
+  FileMetadata: () => ls,
+  FileServerPreference: () => Ts,
+  Followsets: () => Hs,
+  GenericRepost: () => cs,
+  Genericlists: () => Ms,
+  HTTPAuth: () => un,
+  Handlerinformation: () => ca,
+  Handlerrecommendation: () => aa,
+  Highlights: () => As,
+  InterestsList: () => Ls,
+  Interestsets: () => Zs,
+  JobFeedback: () => vs,
+  JobRequest: () => ws,
+  JobResult: () => bs,
+  Label: () => ps,
+  LightningPubRPC: () => Rs,
+  LiveChatMessage: () => fs,
+  LiveEvent: () => Qs,
+  LongFormArticle: () => Gs,
+  Metadata: () => es,
+  Mutelist: () => Ss,
+  NWCWalletInfo: () => $s,
+  NWCWalletRequest: () => kr,
+  NWCWalletResponse: () => Ps,
+  NostrConnect: () => Os,
+  OpenTimestamps: () => us,
+  Pinlist: () => Bs,
+  ProblemTracker: () => hs,
+  ProfileBadges: () => Vs,
+  PublicChatsList: () => Is,
+  Reaction: () => cn,
+  RecommendRelay: () => ns,
+  RelayList: () => Ns,
+  Relaysets: () => qs,
+  Report: () => ds,
+  Reporting: () => gs,
+  Repost: () => an,
+  SearchRelaysList: () => _s,
+  ShortTextNote: () => ts,
+  Time: () => ia,
+  UserEmojiList: () => ks,
+  UserStatuses: () => ea,
+  Zap: () => Es,
+  ZapGoal: () => xs,
+  ZapRequest: () => ms,
+  classifyKind: () => Qo,
+  isEphemeralKind: () => Br,
+  isParameterizedReplaceableKind: () => Nr,
+  isRegularKind: () => Ar,
+  isReplaceableKind: () => Sr
+});
+function Ar(e) {
+  return 1e3 <= e && e < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(e);
+}
+function Sr(e) {
+  return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
+}
+function Br(e) {
+  return 2e4 <= e && e < 3e4;
+}
+function Nr(e) {
+  return 3e4 <= e && e < 4e4;
+}
+function Qo(e) {
+  return Ar(e) ? "regular" : Sr(e) ? "replaceable" : Br(e) ? "ephemeral" : Nr(e) ? "parameterized" : "unknown";
+}
+var es = 0, ts = 1, ns = 2, rs = 3, is = 4, os = 4, ss = 5, an = 6, cn = 7, as = 8, cs = 16, Cr = 40, Ur = 41, Ir = 42, Kr = 43, _r = 44, us = 1040, ls = 1063, fs = 1311, hs = 1971, ds = 1984, gs = 1984, ps = 1985, ys = 4550, ws = 5999, bs = 6999, vs = 7e3, xs = 9041, ms = 9734, Es = 9735, As = 9802, Ss = 1e4, Bs = 10001, Ns = 10002, Cs = 10003, Us = 10004, Is = 10005, Ks = 10006, _s = 10007, Ls = 10015, ks = 10030, Ts = 10096, $s = 13194, Rs = 21e3, Lr = 22242, kr = 23194, Ps = 23195, Os = 24133, un = 27235, Hs = 3e4, Ms = 30001, qs = 30002, Ds = 30003, js = 30004, Vs = 30008, zs = 30009, Zs = 30015, Fs = 30017, Ws = 30018, Gs = 30023, Js = 30024, Ys = 30030, Xs = 30078, Qs = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, oa = 31924, sa = 31925, aa = 31989, ca = 31990, ua = 34550, la = {};
+q(la, {
+  getHex64: () => ln,
+  getInt: () => Tr,
+  getSubscriptionId: () => fa,
+  matchEventId: () => ha,
+  matchEventKind: () => ga,
+  matchEventPubkey: () => da
+});
+function ln(e, t) {
+  let n = t.length + 3, r = e.indexOf(`"${t}":`) + n, i = e.slice(r).indexOf('"') + r + 1;
+  return e.slice(i, i + 64);
+}
+function Tr(e, t) {
+  let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), o = Math.min(i.indexOf(","), i.indexOf("}"));
+  return parseInt(i.slice(0, o), 10);
+}
+function fa(e) {
+  let t = e.slice(0, 22).indexOf('"EVENT"');
+  if (t === -1)
+    return null;
+  let n = e.slice(t + 7 + 1).indexOf('"');
+  if (n === -1)
+    return null;
+  let r = t + 7 + 1 + n, i = e.slice(r + 1, 80).indexOf('"');
+  if (i === -1)
+    return null;
+  let o = r + 1 + i;
+  return e.slice(r + 1, o);
+}
+function ha(e, t) {
+  return t === ln(e, "id");
+}
+function da(e, t) {
+  return t === ln(e, "pubkey");
+}
+function ga(e, t) {
+  return t === Tr(e, "kind");
+}
+var pa = {};
+q(pa, {
+  makeAuthEvent: () => ya
+});
+function ya(e, t) {
+  return {
+    kind: Lr,
+    created_at: Math.floor(Date.now() / 1e3),
+    tags: [
+      ["relay", e],
+      ["challenge", t]
+    ],
+    content: ""
+  };
+}
+var wa;
+try {
+  wa = WebSocket;
+} catch {
+}
+var ba;
+try {
+  ba = WebSocket;
+} catch {
+}
+var Fe = {};
+q(Fe, {
+  BECH32_REGEX: () => $r,
+  Bech32MaxSize: () => fn,
+  decode: () => vt,
+  encodeBytes: () => xt,
+  naddrEncode: () => Ba,
+  neventEncode: () => Sa,
+  noteEncode: () => Ea,
+  nprofileEncode: () => Aa,
+  npubEncode: () => ma,
+  nrelayEncode: () => Na,
+  nsecEncode: () => xa
+});
+var fn = 5e3, $r = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
+function va(e) {
+  const t = new Uint8Array(4);
+  return t[0] = e >> 24 & 255, t[1] = e >> 16 & 255, t[2] = e >> 8 & 255, t[3] = e & 255, t;
+}
+function vt(e) {
+  var i, o, s, c, a, u, f, l;
+  let { prefix: t, words: n } = De.decode(e, fn), r = new Uint8Array(De.fromWords(n));
+  switch (t) {
+    case "nprofile": {
+      let d = et(r);
+      if (!((i = d[0]) != null && i[0]))
+        throw new Error("missing TLV 0 for nprofile");
+      if (d[0][0].length !== 32)
+        throw new Error("TLV 0 should be 32 bytes");
+      return {
+        type: "nprofile",
+        data: {
+          pubkey: D(d[0][0]),
+          relays: d[1] ? d[1].map((w) => re.decode(w)) : []
+        }
+      };
+    }
+    case "nevent": {
+      let d = et(r);
+      if (!((o = d[0]) != null && o[0]))
+        throw new Error("missing TLV 0 for nevent");
+      if (d[0][0].length !== 32)
+        throw new Error("TLV 0 should be 32 bytes");
+      if (d[2] && d[2][0].length !== 32)
+        throw new Error("TLV 2 should be 32 bytes");
+      if (d[3] && d[3][0].length !== 4)
+        throw new Error("TLV 3 should be 4 bytes");
+      return {
+        type: "nevent",
+        data: {
+          id: D(d[0][0]),
+          relays: d[1] ? d[1].map((w) => re.decode(w)) : [],
+          author: (s = d[2]) != null && s[0] ? D(d[2][0]) : void 0,
+          kind: (c = d[3]) != null && c[0] ? parseInt(D(d[3][0]), 16) : void 0
+        }
+      };
+    }
+    case "naddr": {
+      let d = et(r);
+      if (!((a = d[0]) != null && a[0]))
+        throw new Error("missing TLV 0 for naddr");
+      if (!((u = d[2]) != null && u[0]))
+        throw new Error("missing TLV 2 for naddr");
+      if (d[2][0].length !== 32)
+        throw new Error("TLV 2 should be 32 bytes");
+      if (!((f = d[3]) != null && f[0]))
+        throw new Error("missing TLV 3 for naddr");
+      if (d[3][0].length !== 4)
+        throw new Error("TLV 3 should be 4 bytes");
+      return {
+        type: "naddr",
+        data: {
+          identifier: re.decode(d[0][0]),
+          pubkey: D(d[2][0]),
+          kind: parseInt(D(d[3][0]), 16),
+          relays: d[1] ? d[1].map((w) => re.decode(w)) : []
+        }
+      };
+    }
+    case "nrelay": {
+      let d = et(r);
+      if (!((l = d[0]) != null && l[0]))
+        throw new Error("missing TLV 0 for nrelay");
+      return {
+        type: "nrelay",
+        data: re.decode(d[0][0])
+      };
+    }
+    case "nsec":
+      return { type: t, data: r };
+    case "npub":
+    case "note":
+      return { type: t, data: D(r) };
+    default:
+      throw new Error(`unknown prefix ${t}`);
+  }
+}
+function et(e) {
+  let t = {}, n = e;
+  for (; n.length > 0; ) {
+    let r = n[0], i = n[1], o = n.slice(2, 2 + i);
+    if (n = n.slice(2 + i), o.length < i)
+      throw new Error(`not enough data to read on TLV ${r}`);
+    t[r] = t[r] || [], t[r].push(o);
+  }
+  return t;
+}
+function xa(e) {
+  return xt("nsec", e);
+}
+function ma(e) {
+  return xt("npub", W(e));
+}
+function Ea(e) {
+  return xt("note", W(e));
+}
+function Xe(e, t) {
+  let n = De.toWords(t);
+  return De.encode(e, n, fn);
+}
+function xt(e, t) {
+  return Xe(e, t);
+}
+function Aa(e) {
+  let t = mt({
+    0: [W(e.pubkey)],
+    1: (e.relays || []).map((n) => ee.encode(n))
+  });
+  return Xe("nprofile", t);
+}
+function Sa(e) {
+  let t;
+  e.kind !== void 0 && (t = va(e.kind));
+  let n = mt({
+    0: [W(e.id)],
+    1: (e.relays || []).map((r) => ee.encode(r)),
+    2: e.author ? [W(e.author)] : [],
+    3: t ? [new Uint8Array(t)] : []
+  });
+  return Xe("nevent", n);
+}
+function Ba(e) {
+  let t = new ArrayBuffer(4);
+  new DataView(t).setUint32(0, e.kind, !1);
+  let n = mt({
+    0: [ee.encode(e.identifier)],
+    1: (e.relays || []).map((r) => ee.encode(r)),
+    2: [W(e.pubkey)],
+    3: [new Uint8Array(t)]
+  });
+  return Xe("naddr", n);
+}
+function Na(e) {
+  let t = mt({
+    0: [ee.encode(e)]
+  });
+  return Xe("nrelay", t);
+}
+function mt(e) {
+  let t = [];
+  return Object.entries(e).reverse().forEach(([n, r]) => {
+    r.forEach((i) => {
+      let o = new Uint8Array(i.length + 2);
+      o.set([parseInt(n)], 0), o.set([i.length], 1), o.set(i, 2), t.push(o);
+    });
+  }), pt(...t);
+}
+var Ca = {};
+q(Ca, {
+  decrypt: () => Ua,
+  encrypt: () => Rr
+});
+async function Rr(e, t, n) {
+  const r = e instanceof Uint8Array ? D(e) : e, i = Le.getSharedSecret(r, "02" + t), o = Pr(i);
+  let s = Uint8Array.from(ir(16)), c = ee.encode(n), a = gr(o, s).encrypt(c), u = he.encode(new Uint8Array(a)), f = he.encode(new Uint8Array(s.buffer));
+  return `${u}?iv=${f}`;
+}
+async function Ua(e, t, n) {
+  const r = e instanceof Uint8Array ? D(e) : e;
+  let [i, o] = n.split("?iv="), s = Le.getSharedSecret(r, "02" + t), c = Pr(s), a = he.decode(o), u = he.decode(i), f = gr(c, a).decrypt(u);
+  return re.decode(f);
+}
+function Pr(e) {
+  return e.slice(1, 33);
+}
+var Ia = {};
+q(Ia, {
+  NIP05_REGEX: () => Or,
+  isValid: () => La,
+  queryProfile: () => Hr,
+  searchDomain: () => _a,
+  useFetchImplementation: () => Ka
+});
+var Or = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Et;
+try {
+  Et = fetch;
+} catch {
+}
+function Ka(e) {
+  Et = e;
+}
+async function _a(e, t = "") {
+  try {
+    const n = `https://${e}/.well-known/nostr.json?name=${t}`;
+    return (await (await Et(n, { redirect: "error" })).json()).names;
+  } catch {
+    return {};
+  }
+}
+async function Hr(e) {
+  var o;
+  const t = e.match(Or);
+  if (!t)
+    return null;
+  const [n, r = "_", i] = t;
+  try {
+    const s = `https://${i}/.well-known/nostr.json?name=${r}`, c = await (await Et(s, { redirect: "error" })).json();
+    let a = c.names[r];
+    return a ? { pubkey: a, relays: (o = c.relays) == null ? void 0 : o[a] } : null;
+  } catch {
+    return null;
+  }
+}
+async function La(e, t) {
+  let n = await Hr(t);
+  return n ? n.pubkey === e : !1;
+}
+var ka = {};
+q(ka, {
+  parse: () => Ta
+});
+function Ta(e) {
+  const t = {
+    reply: void 0,
+    root: void 0,
+    mentions: [],
+    profiles: []
+  }, n = [];
+  for (const r of e.tags)
+    r[0] === "e" && r[1] && n.push(r), r[0] === "p" && r[1] && t.profiles.push({
+      pubkey: r[1],
+      relays: r[2] ? [r[2]] : []
+    });
+  for (let r = 0; r < n.length; r++) {
+    const i = n[r], [o, s, c, a] = i, u = {
+      id: s,
+      relays: c ? [c] : []
+    }, f = r === 0, l = r === n.length - 1;
+    if (a === "root") {
+      t.root = u;
+      continue;
+    }
+    if (a === "reply") {
+      t.reply = u;
+      continue;
+    }
+    if (a === "mention") {
+      t.mentions.push(u);
+      continue;
+    }
+    if (f) {
+      t.root = u;
+      continue;
+    }
+    if (l) {
+      t.reply = u;
+      continue;
+    }
+    t.mentions.push(u);
+  }
+  return t;
+}
+var $a = {};
+q($a, {
+  fetchRelayInformation: () => Pa,
+  useFetchImplementation: () => Ra
+});
+var Mr;
+try {
+  Mr = fetch;
+} catch {
+}
+function Ra(e) {
+  Mr = e;
+}
+async function Pa(e) {
+  return await (await fetch(e.replace("ws://", "http://").replace("wss://", "https://"), {
+    headers: { Accept: "application/nostr+json" }
+  })).json();
+}
+var Oa = {};
+q(Oa, {
+  getPow: () => qr,
+  minePow: () => Ha
+});
+function qr(e) {
+  let t = 0;
+  for (let n = 0; n < e.length; n++) {
+    const r = parseInt(e[n], 16);
+    if (r === 0)
+      t += 4;
+    else {
+      t += Math.clz32(r) - 28;
+      break;
+    }
+  }
+  return t;
+}
+function Ha(e, t) {
+  let n = 0;
+  const r = e, i = ["nonce", n.toString(), t.toString()];
+  for (r.tags.push(i); ; ) {
+    const o = Math.floor((/* @__PURE__ */ new Date()).getTime() / 1e3);
+    if (o !== r.created_at && (n = 0, r.created_at = o), i[1] = (++n).toString(), r.id = nt(r), qr(r.id) >= t)
+      break;
+  }
+  return r;
+}
+var Ma = {};
+q(Ma, {
+  finishRepostEvent: () => qa,
+  getRepostedEvent: () => Da,
+  getRepostedEventPointer: () => Dr
+});
+function qa(e, t, n, r) {
+  return se(
+    {
+      kind: an,
+      tags: [...e.tags ?? [], ["e", t.id, n], ["p", t.pubkey]],
+      content: e.content === "" ? "" : JSON.stringify(t),
+      created_at: e.created_at
+    },
+    r
+  );
+}
+function Dr(e) {
+  if (e.kind !== an)
+    return;
+  let t, n;
+  for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
+    const i = e.tags[r];
+    i.length >= 2 && (i[0] === "e" && t === void 0 ? t = i : i[0] === "p" && n === void 0 && (n = i));
+  }
+  if (t !== void 0)
+    return {
+      id: t[1],
+      relays: [t[2], n == null ? void 0 : n[2]].filter((r) => typeof r == "string"),
+      author: n == null ? void 0 : n[1]
+    };
+}
+function Da(e, { skipVerification: t } = {}) {
+  const n = Dr(e);
+  if (n === void 0 || e.content === "")
+    return;
+  let r;
+  try {
+    r = JSON.parse(e.content);
+  } catch {
+    return;
+  }
+  if (r.id === n.id && !(!t && !sn(r)))
+    return r;
+}
+var ja = {};
+q(ja, {
+  NOSTR_URI_REGEX: () => At,
+  parse: () => za,
+  test: () => Va
+});
+var At = new RegExp(`nostr:(${$r.source})`);
+function Va(e) {
+  return typeof e == "string" && new RegExp(`^${At.source}$`).test(e);
+}
+function za(e) {
+  const t = e.match(new RegExp(`^${At.source}$`));
+  if (!t)
+    throw new Error(`Invalid Nostr URI: ${e}`);
+  return {
+    uri: t[0],
+    value: t[1],
+    decoded: vt(t[1])
+  };
+}
+var Za = {};
+q(Za, {
+  finishReactionEvent: () => Fa,
+  getReactedEventPointer: () => Wa
+});
+function Fa(e, t, n) {
+  const r = t.tags.filter((i) => i.length >= 2 && (i[0] === "e" || i[0] === "p"));
+  return se(
+    {
+      ...e,
+      kind: cn,
+      tags: [...e.tags ?? [], ...r, ["e", t.id], ["p", t.pubkey]],
+      content: e.content ?? "+"
+    },
+    n
+  );
+}
+function Wa(e) {
+  if (e.kind !== cn)
+    return;
+  let t, n;
+  for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
+    const i = e.tags[r];
+    i.length >= 2 && (i[0] === "e" && t === void 0 ? t = i : i[0] === "p" && n === void 0 && (n = i));
+  }
+  if (!(t === void 0 || n === void 0))
+    return {
+      id: t[1],
+      relays: [t[2], n[2]].filter((r) => r !== void 0),
+      author: n[1]
+    };
+}
+var Ga = {};
+q(Ga, {
+  matchAll: () => Ja,
+  regex: () => hn,
+  replaceAll: () => Ya
+});
+var hn = () => new RegExp(`\\b${At.source}\\b`, "g");
+function* Ja(e) {
+  const t = e.matchAll(hn());
+  for (const n of t)
+    try {
+      const [r, i] = n;
+      yield {
+        uri: r,
+        value: i,
+        decoded: vt(i),
+        start: n.index,
+        end: n.index + r.length
+      };
+    } catch {
+    }
+}
+function Ya(e, t) {
+  return e.replaceAll(hn(), (n, r) => t({
+    uri: n,
+    value: r,
+    decoded: vt(r)
+  }));
+}
+var Xa = {};
+q(Xa, {
+  channelCreateEvent: () => Qa,
+  channelHideMessageEvent: () => nc,
+  channelMessageEvent: () => tc,
+  channelMetadataEvent: () => ec,
+  channelMuteUserEvent: () => rc
+});
+var Qa = (e, t) => {
+  let n;
+  if (typeof e.content == "object")
+    n = JSON.stringify(e.content);
+  else if (typeof e.content == "string")
+    n = e.content;
+  else
+    return;
+  return se(
+    {
+      kind: Cr,
+      tags: [...e.tags ?? []],
+      content: n,
+      created_at: e.created_at
+    },
+    t
+  );
+}, ec = (e, t) => {
+  let n;
+  if (typeof e.content == "object")
+    n = JSON.stringify(e.content);
+  else if (typeof e.content == "string")
+    n = e.content;
+  else
+    return;
+  return se(
+    {
+      kind: Ur,
+      tags: [["e", e.channel_create_event_id], ...e.tags ?? []],
+      content: n,
+      created_at: e.created_at
+    },
+    t
+  );
+}, tc = (e, t) => {
+  const n = [["e", e.channel_create_event_id, e.relay_url, "root"]];
+  return e.reply_to_channel_message_event_id && n.push(["e", e.reply_to_channel_message_event_id, e.relay_url, "reply"]), se(
+    {
+      kind: Ir,
+      tags: [...n, ...e.tags ?? []],
+      content: e.content,
+      created_at: e.created_at
+    },
+    t
+  );
+}, nc = (e, t) => {
+  let n;
+  if (typeof e.content == "object")
+    n = JSON.stringify(e.content);
+  else if (typeof e.content == "string")
+    n = e.content;
+  else
+    return;
+  return se(
+    {
+      kind: Kr,
+      tags: [["e", e.channel_message_event_id], ...e.tags ?? []],
+      content: n,
+      created_at: e.created_at
+    },
+    t
+  );
+}, rc = (e, t) => {
+  let n;
+  if (typeof e.content == "object")
+    n = JSON.stringify(e.content);
+  else if (typeof e.content == "string")
+    n = e.content;
+  else
+    return;
+  return se(
+    {
+      kind: _r,
+      tags: [["p", e.pubkey_to_mute], ...e.tags ?? []],
+      content: n,
+      created_at: e.created_at
+    },
+    t
+  );
+}, ic = {};
+q(ic, {
+  EMOJI_SHORTCODE_REGEX: () => jr,
+  matchAll: () => oc,
+  regex: () => dn,
+  replaceAll: () => sc
+});
+var jr = /:(\w+):/, dn = () => new RegExp(`\\B${jr.source}\\B`, "g");
+function* oc(e) {
+  const t = e.matchAll(dn());
+  for (const n of t)
+    try {
+      const [r, i] = n;
+      yield {
+        shortcode: r,
+        name: i,
+        start: n.index,
+        end: n.index + r.length
+      };
+    } catch {
+    }
+}
+function sc(e, t) {
+  return e.replaceAll(dn(), (n, r) => t({
+    shortcode: n,
+    name: r
+  }));
+}
+var ac = {};
+q(ac, {
+  useFetchImplementation: () => cc,
+  validateGithub: () => uc
+});
+var gn;
+try {
+  gn = fetch;
+} catch {
+}
+function cc(e) {
+  gn = e;
+}
+async function uc(e, t, n) {
+  try {
+    return await (await gn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
+  } catch {
+    return !1;
+  }
+}
+var fe = {};
+q(fe, {
+  decrypt: () => Jr,
+  encrypt: () => Gr,
+  getConversationKey: () => Zr,
+  v2: () => gc
+});
+var Vr = 1, zr = 65535;
+function Zr(e, t) {
+  const n = Le.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return rn(Ne, n, "nip44-v2");
+}
+function Fr(e, t) {
+  const n = xr(Ne, e, t, 76);
+  return {
+    chacha_key: n.subarray(0, 32),
+    chacha_nonce: n.subarray(32, 44),
+    hmac_key: n.subarray(44, 76)
+  };
+}
+function pn(e) {
+  if (!Number.isSafeInteger(e) || e < 1)
+    throw new Error("expected positive integer");
+  if (e <= 32)
+    return 32;
+  const t = 1 << Math.floor(Math.log2(e - 1)) + 1, n = t <= 256 ? 32 : t / 8;
+  return n * (Math.floor((e - 1) / n) + 1);
+}
+function lc(e) {
+  if (!Number.isSafeInteger(e) || e < Vr || e > zr)
+    throw new Error("invalid plaintext size: must be between 1 and 65535 bytes");
+  const t = new Uint8Array(2);
+  return new DataView(t.buffer).setUint16(0, e, !1), t;
+}
+function fc(e) {
+  const t = ee.encode(e), n = t.length, r = lc(n), i = new Uint8Array(pn(n) - n);
+  return pt(r, t, i);
+}
+function hc(e) {
+  const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
+  if (t < Vr || t > zr || n.length !== t || e.length !== 2 + pn(t))
+    throw new Error("invalid padding");
+  return re.decode(n);
+}
+function Wr(e, t, n) {
+  if (n.length !== 32)
+    throw new Error("AAD associated data must be 32 bytes");
+  const r = pt(n, t);
+  return wt(Ne, e, r);
+}
+function dc(e) {
+  if (typeof e != "string")
+    throw new Error("payload must be a valid string");
+  const t = e.length;
+  if (t < 132 || t > 87472)
+    throw new Error("invalid payload length: " + t);
+  if (e[0] === "#")
+    throw new Error("unknown encryption version");
+  let n;
+  try {
+    n = he.decode(e);
+  } catch (o) {
+    throw new Error("invalid base64: " + o.message);
+  }
+  const r = n.length;
+  if (r < 99 || r > 65603)
+    throw new Error("invalid data length: " + r);
+  const i = n[0];
+  if (i !== 2)
+    throw new Error("unknown encryption version " + i);
+  return {
+    nonce: n.subarray(1, 33),
+    ciphertext: n.subarray(33, -32),
+    mac: n.subarray(-32)
+  };
+}
+function Gr(e, t, n = ir(32)) {
+  const { chacha_key: r, chacha_nonce: i, hmac_key: o } = Fr(t, n), s = fc(e), c = br(r, i, s), a = Wr(o, c, n);
+  return he.encode(pt(new Uint8Array([2]), n, c, a));
+}
+function Jr(e, t) {
+  const { nonce: n, ciphertext: r, mac: i } = dc(e), { chacha_key: o, chacha_nonce: s, hmac_key: c } = Fr(t, n), a = Wr(c, r, n);
+  if (!So(a, i))
+    throw new Error("invalid MAC");
+  const u = br(o, s, r);
+  return hc(u);
+}
+var gc = {
+  utils: {
+    getConversationKey: Zr,
+    calcPaddedLen: pn
+  },
+  encrypt: Gr,
+  decrypt: Jr
+}, pc = {};
+q(pc, {
+  makeNwcRequestEvent: () => wc,
+  parseConnectionString: () => yc
+});
+function yc(e) {
+  const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), o = n.get("secret");
+  if (!r || !i || !o)
+    throw new Error("invalid connection string");
+  return { pubkey: r, relay: i, secret: o };
+}
+async function wc(e, t, n) {
+  const i = await Rr(t, e, JSON.stringify({
+    method: "pay_invoice",
+    params: {
+      invoice: n
+    }
+  })), o = {
+    kind: kr,
+    created_at: Math.round(Date.now() / 1e3),
+    content: i,
+    tags: [["p", e]]
+  };
+  return se(o, t);
+}
+var bc = {};
+q(bc, {
+  getZapEndpoint: () => xc,
+  makeZapReceipt: () => Ac,
+  makeZapRequest: () => mc,
+  useFetchImplementation: () => vc,
+  validateZapRequest: () => Ec
+});
+var yn;
+try {
+  yn = fetch;
+} catch {
+}
+function vc(e) {
+  yn = e;
+}
+async function xc(e) {
+  try {
+    let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
+    if (n) {
+      let { words: s } = De.decode(n, 1e3), c = De.fromWords(s);
+      t = re.decode(c);
+    } else if (r) {
+      let [s, c] = r.split("@");
+      t = new URL(`/.well-known/lnurlp/${s}`, `https://${c}`).toString();
+    } else
+      return null;
+    let o = await (await yn(t)).json();
+    if (o.allowsNostr && o.nostrPubkey)
+      return o.callback;
+  } catch {
+  }
+  return null;
+}
+function mc({
+  profile: e,
+  event: t,
+  amount: n,
+  relays: r,
+  comment: i = ""
+}) {
+  if (!n)
+    throw new Error("amount not given");
+  if (!e)
+    throw new Error("profile not given");
+  let o = {
+    kind: 9734,
+    created_at: Math.round(Date.now() / 1e3),
+    content: i,
+    tags: [
+      ["p", e],
+      ["amount", n.toString()],
+      ["relays", ...r]
+    ]
+  };
+  return t && o.tags.push(["e", t]), o;
+}
+function Ec(e) {
+  let t;
+  try {
+    t = JSON.parse(e);
+  } catch {
+    return "Invalid zap request JSON.";
+  }
+  if (!mr(t))
+    return "Zap request is not a valid Nostr event.";
+  if (!sn(t))
+    return "Invalid signature on zap request.";
+  let n = t.tags.find(([o, s]) => o === "p" && s);
+  if (!n)
+    return "Zap request doesn't have a 'p' tag.";
+  if (!n[1].match(/^[a-f0-9]{64}$/))
+    return "Zap request 'p' tag is not valid hex.";
+  let r = t.tags.find(([o, s]) => o === "e" && s);
+  return r && !r[1].match(/^[a-f0-9]{64}$/) ? "Zap request 'e' tag is not valid hex." : t.tags.find(([o, s]) => o === "relays" && s) ? null : "Zap request doesn't have a 'relays' tag.";
+}
+function Ac({
+  zapRequest: e,
+  preimage: t,
+  bolt11: n,
+  paidAt: r
+}) {
+  let i = JSON.parse(e), o = i.tags.filter(([c]) => c === "e" || c === "p" || c === "a"), s = {
+    kind: 9735,
+    created_at: Math.round(r.getTime() / 1e3),
+    content: "",
+    tags: [...o, ["P", i.pubkey], ["bolt11", n], ["description", e]]
+  };
+  return t && s.tags.push(["preimage", t]), s;
+}
+var Sc = {};
+q(Sc, {
+  getToken: () => Bc,
+  hashPayload: () => wn,
+  unpackEventFromToken: () => Xr,
+  validateEvent: () => ii,
+  validateEventKind: () => ei,
+  validateEventMethodTag: () => ni,
+  validateEventPayloadTag: () => ri,
+  validateEventTimestamp: () => Qr,
+  validateEventUrlTag: () => ti,
+  validateToken: () => Nc
+});
+var Yr = "Nostr ";
+async function Bc(e, t, n, r = !1, i) {
+  const o = {
+    kind: un,
+    tags: [
+      ["u", e],
+      ["method", t]
+    ],
+    created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
+    content: ""
+  };
+  i && o.tags.push(["payload", wn(i)]);
+  const s = await n(o);
+  return (r ? Yr : "") + he.encode(ee.encode(JSON.stringify(s)));
+}
+async function Nc(e, t, n) {
+  const r = await Xr(e).catch((o) => {
+    throw o;
+  });
+  return await ii(r, t, n).catch((o) => {
+    throw o;
+  });
+}
+async function Xr(e) {
+  if (!e)
+    throw new Error("Missing token");
+  e = e.replace(Yr, "");
+  const t = re.decode(he.decode(e));
+  if (!t || t.length === 0 || !t.startsWith("{"))
+    throw new Error("Invalid token");
+  return JSON.parse(t);
+}
+function Qr(e) {
+  return e.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - e.created_at < 60 : !1;
+}
+function ei(e) {
+  return e.kind === un;
+}
+function ti(e, t) {
+  const n = e.tags.find((r) => r[0] === "u");
+  return n ? n.length > 0 && n[1] === t : !1;
+}
+function ni(e, t) {
+  const n = e.tags.find((r) => r[0] === "method");
+  return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
+}
+function wn(e) {
+  const t = Ne(ee.encode(JSON.stringify(e)));
+  return D(t);
+}
+function ri(e, t) {
+  const n = e.tags.find((i) => i[0] === "payload");
+  if (!n)
+    return !1;
+  const r = wn(t);
+  return n.length > 0 && n[1] === r;
+}
+async function ii(e, t, n, r) {
+  if (!sn(e))
+    throw new Error("Invalid nostr event, signature invalid");
+  if (!ei(e))
+    throw new Error("Invalid nostr event, kind invalid");
+  if (!Qr(e))
+    throw new Error("Invalid nostr event, created_at timestamp invalid");
+  if (!ti(e, t))
+    throw new Error("Invalid nostr event, url tag invalid");
+  if (!ni(e, n))
+    throw new Error("Invalid nostr event, method tag invalid");
+  if (r && typeof r == "object" && Object.keys(r).length > 0 && !ri(e, r))
+    throw new Error("Invalid nostr event, payload tag does not match request body hash");
+  return !0;
+}
+const We = 4, Tc = 100;
+var ae = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(ae || {}), ce = /* @__PURE__ */ ((e) => (e[e.Current = 0] = "Current", e[e.Next = 1] = "Next", e))(ce || {});
+function $c(e) {
+  return JSON.stringify({
+    theirCurrentNostrPublicKey: e.theirCurrentNostrPublicKey,
+    ourCurrentNostrKey: {
+      publicKey: e.ourCurrentNostrKey.publicKey,
+      privateKey: D(e.ourCurrentNostrKey.privateKey)
+    },
+    ourNextNostrKey: {
+      publicKey: e.ourNextNostrKey.publicKey,
+      privateKey: D(e.ourNextNostrKey.privateKey)
+    },
+    receivingChainKey: D(e.receivingChainKey),
+    nextReceivingChainKey: D(e.nextReceivingChainKey),
+    sendingChainKey: D(e.sendingChainKey),
+    sendingChainMessageNumber: e.sendingChainMessageNumber,
+    receivingChainMessageNumber: e.receivingChainMessageNumber,
+    previousSendingChainMessageCount: e.previousSendingChainMessageCount,
+    skippedMessageKeys: Object.fromEntries(
+      Object.entries(e.skippedMessageKeys).map(([t, n]) => [
+        t,
+        D(n)
+      ])
+    )
+  });
+}
+function Rc(e) {
+  const t = JSON.parse(e);
+  return {
+    theirCurrentNostrPublicKey: t.theirCurrentNostrPublicKey,
+    ourCurrentNostrKey: {
+      publicKey: t.ourCurrentNostrKey.publicKey,
+      privateKey: W(t.ourCurrentNostrKey.privateKey)
+    },
+    ourNextNostrKey: {
+      publicKey: t.ourNextNostrKey.publicKey,
+      privateKey: W(t.ourNextNostrKey.privateKey)
+    },
+    receivingChainKey: W(t.receivingChainKey),
+    nextReceivingChainKey: W(t.nextReceivingChainKey),
+    sendingChainKey: W(t.sendingChainKey),
+    sendingChainMessageNumber: t.sendingChainMessageNumber,
+    receivingChainMessageNumber: t.receivingChainMessageNumber,
+    previousSendingChainMessageCount: t.previousSendingChainMessageCount,
+    skippedMessageKeys: Object.fromEntries(
+      Object.entries(t.skippedMessageKeys).map(([n, r]) => [
+        n,
+        W(r)
+      ])
+    )
+  };
+}
+async function* Pc(e) {
+  const t = [];
+  let n = null;
+  const r = e.onMessage((i) => {
+    n ? (n(i), n = null) : t.push(i);
+  });
+  try {
+    for (; ; )
+      t.length > 0 ? yield t.shift() : yield new Promise((i) => {
+        n = i;
+      });
+  } finally {
+    r();
+  }
+}
+function Cc(e, t = new Uint8Array(32)) {
+  const n = rn(Ne, e, t);
+  return xr(Ne, n, new Uint8Array([1]), 32);
+}
+class lt {
+  constructor(t, n) {
+    Q(this, "nostrUnsubscribe");
+    Q(this, "nostrNextUnsubscribe");
+    Q(this, "currentInternalSubscriptionId", 0);
+    Q(this, "internalSubscriptions", /* @__PURE__ */ new Map());
+    Q(this, "name", Math.random().toString(36).substring(2, 6));
+    this.nostrSubscribe = t, this.state = n, this.name = Math.random().toString(36).substring(2, 6);
+  }
+  /**
+   * To preserve forward secrecy, do not use long-term keys for channel initialization. Use e.g. InviteLink to exchange session keys.
+   */
+  static init(t, n, r, i) {
+    const o = He(), s = {
+      theirCurrentNostrPublicKey: n,
+      ourCurrentNostrKey: { publicKey: Ee(r), privateKey: r },
+      ourNextNostrKey: { publicKey: Ee(o), privateKey: o },
+      receivingChainKey: new Uint8Array(),
+      nextReceivingChainKey: new Uint8Array(),
+      sendingChainKey: new Uint8Array(),
+      sendingChainMessageNumber: 0,
+      receivingChainMessageNumber: 0,
+      previousSendingChainMessageCount: 0,
+      skippedMessageKeys: {}
+    }, c = new lt(t, s);
+    return c.updateTheirCurrentNostrPublicKey(n), i && (c.name = i), c;
+  }
+  updateTheirCurrentNostrPublicKey(t) {
+    this.state.theirCurrentNostrPublicKey = t, this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.receivingChainKey = this.getNostrSenderKeypair(ae.Them, ce.Current).privateKey, this.state.nextReceivingChainKey = this.getNostrSenderKeypair(ae.Them, ce.Next).privateKey, this.state.sendingChainKey = this.getNostrSenderKeypair(ae.Us, ce.Current).privateKey;
+  }
+  rotateOurCurrentNostrKey() {
+    this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
+    const t = He();
+    this.state.ourNextNostrKey = {
+      publicKey: Ee(t),
+      privateKey: t
+    };
+  }
+  getNostrSenderKeypair(t, n) {
+    if (t === ae.Us && n === ce.Next)
+      throw new Error("We don't have their next key");
+    const r = n === ce.Current ? this.state.ourCurrentNostrKey.privateKey : this.state.ourNextNostrKey.privateKey, i = this.state.theirCurrentNostrPublicKey, o = t === ae.Us ? Ee(r) : i, s = Cc(fe.getConversationKey(r, i), W(o));
+    return {
+      publicKey: Ee(s),
+      privateKey: s
+    };
+  }
+  nostrSubscribeNext() {
+    const t = this.getNostrSenderKeypair(ae.Them, ce.Next).publicKey, n = this.state.nextReceivingChainKey;
+    this.nostrNextUnsubscribe = this.nostrSubscribe({ authors: [t], kinds: [We] }, (r) => {
+      var o;
+      const i = JSON.parse(fe.decrypt(r.content, n));
+      i.nextPublicKey !== this.state.theirCurrentNostrPublicKey && (this.rotateOurCurrentNostrKey(), this.updateTheirCurrentNostrPublicKey(i.nextPublicKey), (o = this.nostrUnsubscribe) == null || o.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrSubscribeNext()), this.internalSubscriptions.forEach((s) => s({ id: r.id, data: i.data, pubkey: i.nextPublicKey, time: i.time }));
+    });
+  }
+  subscribeToNostrEvents() {
+    if (this.nostrUnsubscribe)
+      return;
+    const t = this.getNostrSenderKeypair(ae.Them, ce.Current).publicKey, n = this.state.receivingChainKey;
+    this.nostrUnsubscribe = this.nostrSubscribe({ authors: [t], kinds: [We] }, (r) => {
+      const i = JSON.parse(fe.decrypt(r.content, n));
+      i.nextPublicKey !== this.state.theirCurrentNostrPublicKey && this.updateTheirCurrentNostrPublicKey(i.nextPublicKey), this.internalSubscriptions.forEach((o) => o({ id: r.id, data: i.data, pubkey: i.nextPublicKey, time: i.time }));
+    }), this.nostrSubscribeNext();
+  }
+  onMessage(t) {
+    const n = this.currentInternalSubscriptionId++;
+    return this.internalSubscriptions.set(n, t), this.subscribeToNostrEvents(), () => this.internalSubscriptions.delete(n);
+  }
+  send(t) {
+    const n = {
+      number: this.state.sendingChainMessageNumber,
+      data: t,
+      nextPublicKey: this.state.ourNextNostrKey.publicKey,
+      time: Date.now()
+    };
+    this.state.sendingChainMessageNumber++;
+    const r = this.getNostrSenderKeypair(ae.Us, ce.Current).privateKey, i = fe.encrypt(JSON.stringify(n), this.state.sendingChainKey);
+    return se({
+      content: i,
+      kind: We,
+      tags: [],
+      created_at: Math.floor(Date.now() / 1e3)
+    }, r);
+  }
+}
+new TextDecoder("utf-8");
+new TextEncoder();
+function tt(e, t) {
+  const n = Le.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return rn(Ne, n, "nip44-v2");
+}
+class rt {
+  constructor(t, n, r, i, o, s, c = []) {
+    this.inviterSessionPublicKey = t, this.linkSecret = n, this.inviter = r, this.inviterSessionPrivateKey = i, this.label = o, this.maxUses = s, this.usedBy = c;
+  }
+  static createNew(t, n, r) {
+    const i = He(), o = Ee(i), s = ut.encode(He()).slice(8, 40);
+    return new rt(
+      o,
+      s,
+      t,
+      i,
+      n,
+      r
+    );
+  }
+  static fromUrl(t) {
+    const n = new URL(t), r = n.pathname.slice(1), i = n.searchParams.get("s"), o = n.hash.slice(1);
+    if (!r)
+      throw new Error("Inviter not found in the URL");
+    if (!i)
+      throw new Error("Session key not found in the URL");
+    const s = Fe.decode(r), c = Fe.decode(i);
+    if (typeof s.data != "string")
+      throw new Error("Decoded inviter is not a string");
+    if (typeof c.data != "string")
+      throw new Error("Decoded session key is not a string");
+    const a = s.data, u = c.data;
+    return new rt(u, o, a);
+  }
+  static deserialize(t) {
+    const n = JSON.parse(t);
+    return new rt(
+      n.inviterSessionPublicKey,
+      n.linkSecret,
+      n.inviter,
+      n.inviterSessionPrivateKey ? new Uint8Array(n.inviterSessionPrivateKey) : void 0,
+      n.label,
+      n.maxUses,
+      n.usedBy
+    );
+  }
+  serialize() {
+    return JSON.stringify({
+      inviterSessionPublicKey: this.inviterSessionPublicKey,
+      linkSecret: this.linkSecret,
+      inviter: this.inviter,
+      inviterSessionPrivateKey: this.inviterSessionPrivateKey ? Array.from(this.inviterSessionPrivateKey) : void 0,
+      label: this.label,
+      maxUses: this.maxUses,
+      usedBy: this.usedBy
+    });
+  }
+  getUrl(t = "https://iris.to") {
+    const n = new URL(`${t}/${Fe.npubEncode(this.inviter)}`);
+    return n.searchParams.set("s", Fe.npubEncode(this.inviterSessionPublicKey)), n.hash = this.linkSecret, n.toString();
+  }
+  /**
+       * Accepts the invite and creates a new channel with the inviter.
+       * 
+       * @param inviteeSecretKey - The invitee's secret key or a signing function
+       * @param nostrSubscribe - A function to subscribe to Nostr events
+       * @returns An object containing the new channel and an event to be published
+       * 
+       * 1. Inner event: No signature, content encrypted with DH(inviter, invitee).
+       *    Purpose: Authenticate invitee. Contains invitee session key.
+       * 2. Envelope: No signature, content encrypted with DH(inviter, random key).
+       *    Purpose: Contains inner event. Hides invitee from others who might have the shared Nostr key.
+  
+       * Note: You need to publish the returned event on Nostr using NDK or another Nostr system of your choice,
+       * so the inviter can create the channel on their side.
+       */
+  async acceptInvite(t, n, r) {
+    const i = He(), o = Ee(i), s = this.inviter || this.inviterSessionPublicKey, c = lt.init(t, this.inviterSessionPublicKey, i), a = He(), u = Ee(a), f = typeof r == "function" ? r : (w, y) => Promise.resolve(fe.encrypt(w, tt(r, y))), l = {
+      pubkey: n,
+      tags: [["secret", this.linkSecret]],
+      content: await f(o, s),
+      created_at: Math.floor(Date.now() / 1e3)
+    }, d = {
+      kind: We,
+      pubkey: u,
+      content: fe.encrypt(JSON.stringify(l), tt(a, this.inviterSessionPublicKey)),
+      created_at: Math.floor(Date.now() / 1e3),
+      tags: [["p", this.inviterSessionPublicKey]]
+    };
+    return { channel: c, event: se(d, a) };
+  }
+  listen(t, n, r) {
+    if (!this.inviterSessionPrivateKey)
+      throw new Error("Inviter session key is not available");
+    const i = {
+      kinds: [We],
+      "#p": [this.inviterSessionPublicKey]
+    };
+    return n(i, async (o) => {
+      try {
+        const s = await fe.decrypt(o.content, tt(this.inviterSessionPrivateKey, o.pubkey)), c = JSON.parse(s);
+        if (!c.tags || !c.tags.some(([l, d]) => l === "secret" && d === this.linkSecret)) {
+          console.error("Invalid secret from event", o);
+          return;
+        }
+        const u = await (typeof t == "function" ? t : (l, d) => Promise.resolve(fe.decrypt(l, tt(t, d))))(c.content, c.pubkey), f = lt.init(n, u, this.inviterSessionPrivateKey);
+        r(f, c.pubkey);
+      } catch (s) {
+        console.error("Error processing invite message:", s);
+      }
+    });
+  }
+}
+export {
+  lt as Channel,
+  We as EVENT_KIND,
+  rt as InviteLink,
+  ce as KeyType,
+  Tc as MAX_SKIP,
+  ae as Sender,
+  Pc as createMessageStream,
+  Rc as deserializeChannelState,
+  Cc as kdf,
+  $c as serializeChannelState
+};