nostr-double-ratchet 0.0.10 → 0.0.12

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

@@ -1,91 +1,91 @@
-var si = Object.defineProperty;
-var oi = (e, t, n) => t in e ? si(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var ee = (e, t, n) => oi(e, typeof t != "symbol" ? t + "" : t, n);
-function mn(e) {
+var bi = Object.defineProperty;
+var vi = (e, t, n) => t in e ? bi(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var te = (e, t, n) => vi(e, typeof t != "symbol" ? t + "" : t, n);
+function Kn(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function On(e, ...t) {
+function zn(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) {
+function mi(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);
+  Kn(e.outputLen), Kn(e.blockLen);
 }
-function nt(e, t = !0) {
+function et(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) {
-  On(e);
+function Ei(e, t) {
+  zn(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const St = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const Et = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Pn = (e) => e instanceof Uint8Array, At = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ne = (e, t) => e << 32 - t | e >>> t, li = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!li)
+const Vn = (e) => e instanceof Uint8Array, xt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, xi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!xi)
   throw new Error("Non little-endian hardware is not supported");
-function ui(e) {
+function Si(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 = ui(e)), !Pn(e))
+function Wt(e) {
+  if (typeof e == "string" && (e = Si(e)), !Vn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function fi(...e) {
+function Ai(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!Pn(r))
+    if (!Vn(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
 }
-let Mn = class {
+let Wn = class {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 };
-function hi(e) {
-  const t = (r) => e().update(Zt(r)).digest(), n = e();
+function Ni(e) {
+  const t = (r) => e().update(Wt(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-function Hn(e = 32) {
-  if (St && typeof St.getRandomValues == "function")
-    return St.getRandomValues(new Uint8Array(e));
+function Zn(e = 32) {
+  if (Et && typeof Et.getRandomValues == "function")
+    return Et.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function di(e, t, n, r) {
+function Ki(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
   const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), a = Number(n & s), c = r ? 4 : 0, l = r ? 0 : 4;
   e.setUint32(t + c, o, r), e.setUint32(t + l, a, r);
 }
-let yi = class extends Mn {
+let ki = class extends Wn {
   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 = At(this.buffer);
+    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 = xt(this.buffer);
   }
   update(t) {
-    nt(this);
+    et(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Zt(t);
+    t = Wt(t);
     const s = t.length;
     for (let o = 0; o < s; ) {
       const a = Math.min(i - this.pos, s - o);
       if (a === i) {
-        const c = At(t);
+        const c = xt(t);
         for (; i <= s - o; o += i)
           this.process(c, o);
         continue;
@@ -95,14 +95,14 @@ let yi = class extends Mn {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    nt(this), ci(t, this), this.finished = !0;
+    et(this), Ei(t, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: i, isLE: s } = this;
     let { pos: o } = this;
     n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(r, 0), o = 0);
     for (let u = o; u < i; u++)
       n[u] = 0;
-    di(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const a = At(t), c = this.outputLen;
+    Ki(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const a = xt(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = c / 4, f = this.get();
@@ -123,7 +123,7 @@ let yi = class extends Mn {
     return t.length = i, t.pos = a, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 };
-const pi = (e, t, n) => e & t ^ ~e & n, gi = (e, t, n) => e & t ^ e & n ^ t & n, wi = /* @__PURE__ */ new Uint32Array([
+const Bi = (e, t, n) => e & t ^ ~e & n, Ci = (e, t, n) => e & t ^ e & n ^ t & n, Ui = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -188,7 +188,7 @@ const pi = (e, t, n) => e & t ^ ~e & n, gi = (e, t, n) => e & t ^ e & n ^ t & n,
   2756734187,
   3204031479,
   3329325298
-]), ge = /* @__PURE__ */ new Uint32Array([
+]), be = /* @__PURE__ */ new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -197,10 +197,10 @@ const pi = (e, t, n) => e & t ^ ~e & n, gi = (e, t, n) => e & t ^ e & n ^ t & n,
   2600822924,
   528734635,
   1541459225
-]), we = /* @__PURE__ */ new Uint32Array(64);
-let bi = class extends yi {
+]), ve = /* @__PURE__ */ new Uint32Array(64);
+let _i = class extends ki {
   constructor() {
-    super(64, 32, 8, !1), this.A = ge[0] | 0, this.B = ge[1] | 0, this.C = ge[2] | 0, this.D = ge[3] | 0, this.E = ge[4] | 0, this.F = ge[5] | 0, this.G = ge[6] | 0, this.H = ge[7] | 0;
+    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: s, F: o, G: a, H: c } = this;
@@ -212,41 +212,41 @@ let bi = class extends yi {
   }
   process(t, n) {
     for (let u = 0; u < 16; u++, n += 4)
-      we[u] = t.getUint32(n, !1);
+      ve[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const d = we[u - 15], p = we[u - 2], g = ne(d, 7) ^ ne(d, 18) ^ d >>> 3, h = ne(p, 17) ^ ne(p, 19) ^ p >>> 10;
-      we[u] = h + we[u - 7] + g + we[u - 16] | 0;
+      const g = ve[u - 15], b = ve[u - 2], p = re(g, 7) ^ re(g, 18) ^ g >>> 3, h = re(b, 17) ^ re(b, 19) ^ b >>> 10;
+      ve[u] = h + ve[u - 7] + p + ve[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: a, F: c, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const d = ne(a, 6) ^ ne(a, 11) ^ ne(a, 25), p = f + d + pi(a, c, l) + wi[u] + we[u] | 0, h = (ne(r, 2) ^ ne(r, 13) ^ ne(r, 22)) + gi(r, i, s) | 0;
-      f = l, l = c, c = a, a = o + p | 0, o = s, s = i, i = r, r = p + h | 0;
+      const g = re(a, 6) ^ re(a, 11) ^ re(a, 25), b = f + g + Bi(a, c, l) + Ui[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + Ci(r, i, s) | 0;
+      f = l, l = c, c = a, a = o + b | 0, o = s, s = i, i = r, r = b + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, a, c, l, f);
   }
   roundClean() {
-    we.fill(0);
+    ve.fill(0);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const Tt = /* @__PURE__ */ hi(() => new bi());
+const Lt = /* @__PURE__ */ Ni(() => new _i());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const qn = BigInt(0), ct = BigInt(1), vi = BigInt(2), lt = (e) => e instanceof Uint8Array, mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const Gn = BigInt(0), ot = BigInt(1), Ii = BigInt(2), at = (e) => e instanceof Uint8Array, Li = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function qe(e) {
-  if (!lt(e))
+  if (!at(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += mi[e[n]];
+    t += Li[e[n]];
   return t;
 }
-function Dn(e) {
+function Fn(e) {
   const t = e.toString(16);
   return t.length & 1 ? `0${t}` : t;
 }
-function Ft(e) {
+function Zt(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   return BigInt(e === "" ? "0" : `0x${e}`);
@@ -266,24 +266,24 @@ function De(e) {
   }
   return n;
 }
-function G(e) {
-  return Ft(qe(e));
+function F(e) {
+  return Zt(qe(e));
 }
-function Wt(e) {
-  if (!lt(e))
+function Gt(e) {
+  if (!at(e))
     throw new Error("Uint8Array expected");
-  return Ft(qe(Uint8Array.from(e).reverse()));
+  return Zt(qe(Uint8Array.from(e).reverse()));
 }
-function xe(e, t) {
+function Ae(e, t) {
   return De(e.toString(16).padStart(t * 2, "0"));
 }
-function Gt(e, t) {
-  return xe(e, t).reverse();
+function Ft(e, t) {
+  return Ae(e, t).reverse();
 }
-function Ei(e) {
-  return De(Dn(e));
+function $i(e) {
+  return De(Fn(e));
 }
-function Z(e, t, n) {
+function W(e, t, n) {
   let r;
   if (typeof t == "string")
     try {
@@ -291,7 +291,7 @@ function Z(e, t, n) {
     } catch (s) {
       throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${s}`);
     }
-  else if (lt(t))
+  else if (at(t))
     r = Uint8Array.from(t);
   else
     throw new Error(`${e} must be hex string or Uint8Array`);
@@ -300,16 +300,16 @@ function Z(e, t, n) {
     throw new Error(`${e} expected ${n} bytes, got ${i}`);
   return r;
 }
-function ke(...e) {
+function Ue(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!lt(r))
+    if (!at(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
 }
-function xi(e, t) {
+function Ti(e, t) {
   if (e.length !== t.length)
     return !1;
   for (let n = 0; n < e.length; n++)
@@ -317,54 +317,54 @@ function xi(e, t) {
       return !1;
   return !0;
 }
-function Si(e) {
+function Ri(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Ai(e) {
+function Oi(e) {
   let t;
-  for (t = 0; e > qn; e >>= ct, t += 1)
+  for (t = 0; e > Gn; e >>= ot, t += 1)
     ;
   return t;
 }
-function Ki(e, t) {
-  return e >> BigInt(t) & ct;
+function Mi(e, t) {
+  return e >> BigInt(t) & ot;
 }
-const Ni = (e, t, n) => e | (n ? ct : qn) << BigInt(t), Jt = (e) => (vi << BigInt(e - 1)) - ct, Kt = (e) => new Uint8Array(e), En = (e) => Uint8Array.from(e);
-function jn(e, t, n) {
+const Hi = (e, t, n) => e | (n ? ot : Gn) << BigInt(t), Jt = (e) => (Ii << BigInt(e - 1)) - ot, St = (e) => new Uint8Array(e), kn = (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 = Kt(e), i = Kt(e), s = 0;
+  let r = St(e), i = St(e), s = 0;
   const o = () => {
     r.fill(1), i.fill(0), s = 0;
-  }, a = (...u) => n(i, r, ...u), c = (u = Kt()) => {
-    i = a(En([0]), u), r = a(), u.length !== 0 && (i = a(En([1]), u), r = a());
+  }, a = (...u) => n(i, r, ...u), c = (u = St()) => {
+    i = a(kn([0]), u), r = a(), u.length !== 0 && (i = a(kn([1]), u), r = a());
   }, l = () => {
     if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
-    const d = [];
+    const g = [];
     for (; u < t; ) {
       r = a();
-      const p = r.slice();
-      d.push(p), u += r.length;
+      const b = r.slice();
+      g.push(b), u += r.length;
     }
-    return ke(...d);
+    return Ue(...g);
   };
-  return (u, d) => {
+  return (u, g) => {
     o(), c(u);
-    let p;
-    for (; !(p = d(l())); )
+    let b;
+    for (; !(b = g(l())); )
       c();
-    return o(), p;
+    return o(), b;
   };
 }
-const Bi = {
+const Pi = {
   bigint: (e) => typeof e == "bigint",
   function: (e) => typeof e == "function",
   boolean: (e) => typeof e == "boolean",
@@ -377,7 +377,7 @@ const Bi = {
 };
 function Je(e, t, n = {}) {
   const r = (i, s, o) => {
-    const a = Bi[s];
+    const a = Pi[s];
     if (typeof a != "function")
       throw new Error(`Invalid validator "${s}", expected function`);
     const c = e[i];
@@ -390,73 +390,73 @@ function Je(e, t, n = {}) {
     r(i, s, !0);
   return e;
 }
-const Ci = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const qi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  bitGet: Ki,
-  bitLen: Ai,
+  bitGet: Mi,
+  bitLen: Oi,
   bitMask: Jt,
-  bitSet: Ni,
+  bitSet: Hi,
   bytesToHex: qe,
-  bytesToNumberBE: G,
-  bytesToNumberLE: Wt,
-  concatBytes: ke,
-  createHmacDrbg: jn,
-  ensureBytes: Z,
-  equalBytes: xi,
+  bytesToNumberBE: F,
+  bytesToNumberLE: Gt,
+  concatBytes: Ue,
+  createHmacDrbg: Jn,
+  ensureBytes: W,
+  equalBytes: Ti,
   hexToBytes: De,
-  hexToNumber: Ft,
-  numberToBytesBE: xe,
-  numberToBytesLE: Gt,
-  numberToHexUnpadded: Dn,
-  numberToVarBytesBE: Ei,
-  utf8ToBytes: Si,
+  hexToNumber: Zt,
+  numberToBytesBE: Ae,
+  numberToBytesLE: Ft,
+  numberToHexUnpadded: Fn,
+  numberToVarBytesBE: $i,
+  utf8ToBytes: Ri,
   validateObject: Je
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const V = BigInt(0), q = BigInt(1), Ne = BigInt(2), ki = BigInt(3), $t = BigInt(4), xn = BigInt(5), Sn = BigInt(8);
+const z = BigInt(0), D = BigInt(1), ke = BigInt(2), Di = BigInt(3), $t = BigInt(4), Bn = BigInt(5), Cn = BigInt(8);
 BigInt(9);
 BigInt(16);
-function z(e, t) {
+function V(e, t) {
   const n = e % t;
-  return n >= V ? n : t + n;
+  return n >= z ? n : t + n;
 }
-function Ui(e, t, n) {
-  if (n <= V || t < V)
+function ji(e, t, n) {
+  if (n <= z || t < z)
     throw new Error("Expected power/modulo > 0");
-  if (n === q)
-    return V;
-  let r = q;
-  for (; t > V; )
-    t & q && (r = r * e % n), e = e * e % n, t >>= q;
+  if (n === D)
+    return z;
+  let r = D;
+  for (; t > z; )
+    t & D && (r = r * e % n), e = e * e % n, t >>= D;
   return r;
 }
 function J(e, t, n) {
   let r = e;
-  for (; t-- > V; )
+  for (; t-- > z; )
     r *= r, r %= n;
   return r;
 }
-function Rt(e, t) {
-  if (e === V || t <= V)
+function Tt(e, t) {
+  if (e === z || t <= z)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
-  let n = z(e, t), r = t, i = V, s = q;
-  for (; n !== V; ) {
+  let n = V(e, t), r = t, i = z, s = D;
+  for (; n !== z; ) {
     const a = r / n, c = r % n, l = i - s * a;
     r = n, n = c, i = s, s = l;
   }
-  if (r !== q)
+  if (r !== D)
     throw new Error("invert: does not exist");
-  return z(i, t);
+  return V(i, t);
 }
-function Ii(e) {
-  const t = (e - q) / Ne;
+function zi(e) {
+  const t = (e - D) / ke;
   let n, r, i;
-  for (n = e - q, r = 0; n % Ne === V; n /= Ne, r++)
+  for (n = e - D, r = 0; n % ke === z; n /= ke, r++)
     ;
-  for (i = Ne; i < e && Ui(i, t, e) !== e - q; i++)
+  for (i = ke; i < e && ji(i, t, e) !== e - D; i++)
     ;
   if (r === 1) {
-    const o = (e + q) / $t;
+    const o = (e + D) / $t;
     return function(c, l) {
       const f = c.pow(l, o);
       if (!c.eql(c.sqr(f), l))
@@ -464,26 +464,26 @@ function Ii(e) {
       return f;
     };
   }
-  const s = (n + q) / Ne;
+  const s = (n + D) / ke;
   return function(a, c) {
     if (a.pow(c, t) === a.neg(a.ONE))
       throw new Error("Cannot find square root");
-    let l = r, f = a.pow(a.mul(a.ONE, i), n), u = a.pow(c, s), d = a.pow(c, n);
-    for (; !a.eql(d, a.ONE); ) {
-      if (a.eql(d, a.ZERO))
+    let l = r, f = a.pow(a.mul(a.ONE, i), n), u = a.pow(c, s), g = a.pow(c, n);
+    for (; !a.eql(g, a.ONE); ) {
+      if (a.eql(g, a.ZERO))
         return a.ZERO;
-      let p = 1;
-      for (let h = a.sqr(d); p < l && !a.eql(h, a.ONE); p++)
+      let b = 1;
+      for (let h = a.sqr(g); b < l && !a.eql(h, a.ONE); b++)
         h = a.sqr(h);
-      const g = a.pow(f, q << BigInt(l - p - 1));
-      f = a.sqr(g), u = a.mul(u, g), d = a.mul(d, f), l = p;
+      const p = a.pow(f, D << BigInt(l - b - 1));
+      f = a.sqr(p), u = a.mul(u, p), g = a.mul(g, f), l = b;
     }
     return u;
   };
 }
-function _i(e) {
-  if (e % $t === ki) {
-    const t = (e + q) / $t;
+function Vi(e) {
+  if (e % $t === Di) {
+    const t = (e + D) / $t;
     return function(r, i) {
       const s = r.pow(i, t);
       if (!r.eql(r.sqr(s), i))
@@ -491,18 +491,18 @@ function _i(e) {
       return s;
     };
   }
-  if (e % Sn === xn) {
-    const t = (e - xn) / Sn;
+  if (e % Cn === Bn) {
+    const t = (e - Bn) / Cn;
     return function(r, i) {
-      const s = r.mul(i, Ne), o = r.pow(s, t), a = r.mul(i, o), c = r.mul(r.mul(a, Ne), o), l = r.mul(a, r.sub(c, r.ONE));
+      const s = r.mul(i, ke), o = r.pow(s, t), a = r.mul(i, o), c = r.mul(r.mul(a, ke), o), l = r.mul(a, r.sub(c, r.ONE));
       if (!r.eql(r.sqr(l), i))
         throw new Error("Cannot find square root");
       return l;
     };
   }
-  return Ii(e);
+  return zi(e);
 }
-const Li = [
+const Wi = [
   "create",
   "isValid",
   "is0",
@@ -521,104 +521,104 @@ const Li = [
   "mulN",
   "sqrN"
 ];
-function Ti(e) {
+function Zi(e) {
   const t = {
     ORDER: "bigint",
     MASK: "bigint",
     BYTES: "isSafeInteger",
     BITS: "isSafeInteger"
-  }, n = Li.reduce((r, i) => (r[i] = "function", r), t);
+  }, n = Wi.reduce((r, i) => (r[i] = "function", r), t);
   return Je(e, n);
 }
-function $i(e, t, n) {
-  if (n < V)
+function Gi(e, t, n) {
+  if (n < z)
     throw new Error("Expected power > 0");
-  if (n === V)
+  if (n === z)
     return e.ONE;
-  if (n === q)
+  if (n === D)
     return t;
   let r = e.ONE, i = t;
-  for (; n > V; )
-    n & q && (r = e.mul(r, i)), i = e.sqr(i), n >>= q;
+  for (; n > z; )
+    n & D && (r = e.mul(r, i)), i = e.sqr(i), n >>= D;
   return r;
 }
-function Ri(e, t) {
+function Fi(e, t) {
   const n = new Array(t.length), r = t.reduce((s, o, a) => e.is0(o) ? s : (n[a] = s, e.mul(s, o)), e.ONE), i = e.inv(r);
   return t.reduceRight((s, o, a) => e.is0(o) ? s : (n[a] = e.mul(s, n[a]), e.mul(s, o)), i), n;
 }
-function Vn(e, t) {
+function Yn(e, t) {
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
   return { nBitLength: n, nByteLength: r };
 }
-function Oi(e, t, n = !1, r = {}) {
-  if (e <= V)
+function Ji(e, t, n = !1, r = {}) {
+  if (e <= z)
     throw new Error(`Expected Field ORDER > 0, got ${e}`);
-  const { nBitLength: i, nByteLength: s } = Vn(e, t);
+  const { nBitLength: i, nByteLength: s } = Yn(e, t);
   if (s > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const o = _i(e), a = Object.freeze({
+  const o = Vi(e), a = Object.freeze({
     ORDER: e,
     BITS: i,
     BYTES: s,
     MASK: Jt(i),
-    ZERO: V,
-    ONE: q,
-    create: (c) => z(c, e),
+    ZERO: z,
+    ONE: D,
+    create: (c) => V(c, e),
     isValid: (c) => {
       if (typeof c != "bigint")
         throw new Error(`Invalid field element: expected bigint, got ${typeof c}`);
-      return V <= c && c < e;
+      return z <= c && c < e;
     },
-    is0: (c) => c === V,
-    isOdd: (c) => (c & q) === q,
-    neg: (c) => z(-c, e),
+    is0: (c) => c === z,
+    isOdd: (c) => (c & D) === D,
+    neg: (c) => V(-c, e),
     eql: (c, l) => c === l,
-    sqr: (c) => z(c * c, e),
-    add: (c, l) => z(c + l, e),
-    sub: (c, l) => z(c - l, e),
-    mul: (c, l) => z(c * l, e),
-    pow: (c, l) => $i(a, c, l),
-    div: (c, l) => z(c * Rt(l, e), e),
+    sqr: (c) => V(c * c, e),
+    add: (c, l) => V(c + l, e),
+    sub: (c, l) => V(c - l, e),
+    mul: (c, l) => V(c * l, e),
+    pow: (c, l) => Gi(a, c, l),
+    div: (c, l) => V(c * Tt(l, e), e),
     // Same as above, but doesn't normalize
     sqrN: (c) => c * c,
     addN: (c, l) => c + l,
     subN: (c, l) => c - l,
     mulN: (c, l) => c * l,
-    inv: (c) => Rt(c, e),
+    inv: (c) => Tt(c, e),
     sqrt: r.sqrt || ((c) => o(a, c)),
-    invertBatch: (c) => Ri(a, c),
+    invertBatch: (c) => Fi(a, c),
     // TODO: do we really need constant cmov?
     // We don't have const-time bigints anyway, so probably will be not very useful
     cmov: (c, l, f) => f ? l : c,
-    toBytes: (c) => n ? Gt(c, s) : xe(c, s),
+    toBytes: (c) => n ? Ft(c, s) : Ae(c, s),
     fromBytes: (c) => {
       if (c.length !== s)
         throw new Error(`Fp.fromBytes: expected ${s}, got ${c.length}`);
-      return n ? Wt(c) : G(c);
+      return n ? Gt(c) : F(c);
     }
   });
   return Object.freeze(a);
 }
-function zn(e) {
+function Xn(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);
+function Qn(e) {
+  const t = Xn(e);
   return t + Math.ceil(t / 2);
 }
-function Pi(e, t, n = !1) {
-  const r = e.length, i = zn(t), s = Zn(t);
+function Yi(e, t, n = !1) {
+  const r = e.length, i = Xn(t), s = Qn(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error(`expected ${s}-1024 bytes of input, got ${r}`);
-  const o = n ? G(e) : Wt(e), a = z(o, t - q) + q;
-  return n ? Gt(a, i) : xe(a, i);
+  const o = n ? F(e) : Gt(e), a = V(o, t - D) + D;
+  return n ? Ft(a, i) : Ae(a, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Mi = BigInt(0), Nt = BigInt(1);
-function Hi(e, t) {
+const Xi = BigInt(0), At = BigInt(1);
+function Qi(e, t) {
   const n = (i, s) => {
     const o = s.negate();
     return i ? o : s;
@@ -631,8 +631,8 @@ function Hi(e, t) {
     // non-const time multiplication ladder
     unsafeLadder(i, s) {
       let o = e.ZERO, a = i;
-      for (; s > Mi; )
-        s & Nt && (o = o.add(a)), a = a.double(), s >>= Nt;
+      for (; s > Xi; )
+        s & At && (o = o.add(a)), a = a.double(), s >>= At;
       return o;
     },
     /**
@@ -650,7 +650,7 @@ function Hi(e, t) {
       let l = i, f = l;
       for (let u = 0; u < o; u++) {
         f = l, c.push(f);
-        for (let d = 1; d < a; d++)
+        for (let g = 1; g < a; g++)
           f = f.add(l), c.push(f);
         l = f.double();
       }
@@ -666,13 +666,13 @@ function Hi(e, t) {
     wNAF(i, s, o) {
       const { windows: a, windowSize: c } = r(i);
       let l = e.ZERO, f = e.BASE;
-      const u = BigInt(2 ** i - 1), d = 2 ** i, p = BigInt(i);
-      for (let g = 0; g < a; g++) {
-        const h = g * c;
-        let y = Number(o & u);
-        o >>= p, y > c && (y -= d, o += Nt);
-        const w = h, E = h + Math.abs(y) - 1, K = g % 2 !== 0, I = y < 0;
-        y === 0 ? f = f.add(n(K, s[w])) : l = l.add(n(I, s[E]));
+      const u = BigInt(2 ** i - 1), g = 2 ** i, b = BigInt(i);
+      for (let p = 0; p < a; p++) {
+        const h = p * c;
+        let d = Number(o & u);
+        o >>= b, d > c && (d -= g, o += At);
+        const y = h, E = h + Math.abs(d) - 1, N = p % 2 !== 0, _ = d < 0;
+        d === 0 ? f = f.add(n(N, s[y])) : l = l.add(n(_, s[E]));
       }
       return { p: l, f };
     },
@@ -683,8 +683,8 @@ function Hi(e, t) {
     }
   };
 }
-function Fn(e) {
-  return Ti(e.Fp), Je(e, {
+function er(e) {
+  return Zi(e.Fp), Je(e, {
     n: "bigint",
     h: "bigint",
     Gx: "field",
@@ -693,14 +693,14 @@ function Fn(e) {
     nBitLength: "isSafeInteger",
     nByteLength: "isSafeInteger"
   }), Object.freeze({
-    ...Vn(e.n, e.nBitLength),
+    ...Yn(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);
+function es(e) {
+  const t = er(e);
   Je(t, {
     a: "field",
     b: "field"
@@ -722,7 +722,7 @@ function qi(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Be = {
+const { bytesToNumberBE: ts, hexToBytes: ns } = qi, Be = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -740,10 +740,10 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Be = {
       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) };
+    return { d: ts(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = Be, n = typeof e == "string" ? ji(e) : e;
+    const { Err: t } = Be, n = typeof e == "string" ? ns(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -763,70 +763,70 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Be = {
     }, r = t(n(e.s)), i = t(n(e.r)), s = r.length / 2, o = i.length / 2, a = n(s), c = n(o);
     return `30${n(o + s + 4)}02${c}${i}02${a}${r}`;
   }
-}, ce = BigInt(0), Y = BigInt(1);
+}, ae = BigInt(0), Y = BigInt(1);
 BigInt(2);
-const An = BigInt(3);
+const Un = BigInt(3);
 BigInt(4);
-function Vi(e) {
-  const t = qi(e), { Fp: n } = t, r = t.toBytes || ((g, h, y) => {
-    const w = h.toAffine();
-    return ke(Uint8Array.from([4]), n.toBytes(w.x), n.toBytes(w.y));
-  }), i = t.fromBytes || ((g) => {
-    const h = g.subarray(1), y = n.fromBytes(h.subarray(0, n.BYTES)), w = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
-    return { x: y, y: w };
+function rs(e) {
+  const t = es(e), { Fp: n } = t, r = t.toBytes || ((p, h, d) => {
+    const y = h.toAffine();
+    return Ue(Uint8Array.from([4]), n.toBytes(y.x), n.toBytes(y.y));
+  }), i = t.fromBytes || ((p) => {
+    const h = p.subarray(1), d = n.fromBytes(h.subarray(0, n.BYTES)), y = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
+    return { x: d, y };
   });
-  function s(g) {
-    const { a: h, b: y } = t, w = n.sqr(g), E = n.mul(w, g);
-    return n.add(n.add(E, n.mul(g, h)), y);
+  function s(p) {
+    const { a: h, b: d } = t, y = n.sqr(p), E = n.mul(y, p);
+    return n.add(n.add(E, n.mul(p, h)), d);
   }
   if (!n.eql(n.sqr(t.Gy), s(t.Gx)))
     throw new Error("bad generator point: equation left != right");
-  function o(g) {
-    return typeof g == "bigint" && ce < g && g < t.n;
+  function o(p) {
+    return typeof p == "bigint" && ae < p && p < t.n;
   }
-  function a(g) {
-    if (!o(g))
+  function a(p) {
+    if (!o(p))
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
-  function c(g) {
-    const { allowedPrivateKeyLengths: h, nByteLength: y, wrapPrivateKey: w, n: E } = t;
-    if (h && typeof g != "bigint") {
-      if (g instanceof Uint8Array && (g = qe(g)), typeof g != "string" || !h.includes(g.length))
+  function c(p) {
+    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: y, n: E } = t;
+    if (h && typeof p != "bigint") {
+      if (p instanceof Uint8Array && (p = qe(p)), typeof p != "string" || !h.includes(p.length))
         throw new Error("Invalid key");
-      g = g.padStart(y * 2, "0");
+      p = p.padStart(d * 2, "0");
     }
-    let K;
+    let N;
     try {
-      K = typeof g == "bigint" ? g : G(Z("private key", g, y));
+      N = typeof p == "bigint" ? p : F(W("private key", p, d));
     } catch {
-      throw new Error(`private key must be ${y} bytes, hex or bigint, not ${typeof g}`);
+      throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof p}`);
     }
-    return w && (K = z(K, E)), a(K), K;
+    return y && (N = V(N, E)), a(N), N;
   }
   const l = /* @__PURE__ */ new Map();
-  function f(g) {
-    if (!(g instanceof u))
+  function f(p) {
+    if (!(p instanceof u))
       throw new Error("ProjectivePoint expected");
   }
   class u {
-    constructor(h, y, w) {
-      if (this.px = h, this.py = y, this.pz = w, h == null || !n.isValid(h))
+    constructor(h, d, y) {
+      if (this.px = h, this.py = d, this.pz = y, h == null || !n.isValid(h))
         throw new Error("x required");
-      if (y == null || !n.isValid(y))
+      if (d == null || !n.isValid(d))
         throw new Error("y required");
-      if (w == null || !n.isValid(w))
+      if (y == null || !n.isValid(y))
         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: y, y: w } = h || {};
-      if (!h || !n.isValid(y) || !n.isValid(w))
+      const { x: d, y } = h || {};
+      if (!h || !n.isValid(d) || !n.isValid(y))
         throw new Error("invalid affine point");
       if (h instanceof u)
         throw new Error("projective point not allowed");
-      const E = (K) => n.eql(K, n.ZERO);
-      return E(y) && E(w) ? u.ZERO : new u(y, w, n.ONE);
+      const E = (N) => n.eql(N, n.ZERO);
+      return E(d) && E(y) ? u.ZERO : new u(d, y, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -841,16 +841,16 @@ function Vi(e) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(h) {
-      const y = n.invertBatch(h.map((w) => w.pz));
-      return h.map((w, E) => w.toAffine(y[E])).map(u.fromAffine);
+      const d = n.invertBatch(h.map((y) => y.pz));
+      return h.map((y, E) => y.toAffine(d[E])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
      * @param hex short/long ECDSA hex
      */
     static fromHex(h) {
-      const y = u.fromAffine(i(Z("pointHex", h)));
-      return y.assertValidity(), y;
+      const d = u.fromAffine(i(W("pointHex", h)));
+      return d.assertValidity(), d;
     }
     // Multiplies generator point by privateKey.
     static fromPrivateKey(h) {
@@ -867,11 +867,11 @@ function Vi(e) {
           return;
         throw new Error("bad point: ZERO");
       }
-      const { x: h, y } = this.toAffine();
-      if (!n.isValid(h) || !n.isValid(y))
+      const { x: h, y: d } = this.toAffine();
+      if (!n.isValid(h) || !n.isValid(d))
         throw new Error("bad point: x or y not FE");
-      const w = n.sqr(y), E = s(h);
-      if (!n.eql(w, E))
+      const y = n.sqr(d), E = s(h);
+      if (!n.eql(y, E))
         throw new Error("bad point: equation left != right");
       if (!this.isTorsionFree())
         throw new Error("bad point: not in prime-order subgroup");
@@ -887,7 +887,7 @@ function Vi(e) {
      */
     equals(h) {
       f(h);
-      const { px: y, py: w, pz: E } = this, { px: K, py: I, pz: C } = h, m = n.eql(n.mul(y, C), n.mul(K, E)), x = n.eql(n.mul(w, C), n.mul(I, E));
+      const { px: d, py: y, pz: E } = this, { px: N, py: _, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(N, E)), x = n.eql(n.mul(y, B), n.mul(_, E));
       return m && x;
     }
     /**
@@ -901,9 +901,9 @@ function Vi(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: h, b: y } = t, w = n.mul(y, An), { px: E, py: K, pz: I } = this;
-      let C = n.ZERO, m = n.ZERO, x = n.ZERO, S = n.mul(E, E), P = n.mul(K, K), U = n.mul(I, I), N = n.mul(E, K);
-      return N = n.add(N, N), x = n.mul(E, I), x = n.add(x, x), C = n.mul(h, x), m = n.mul(w, U), m = n.add(C, m), C = n.sub(P, m), m = n.add(P, m), m = n.mul(C, m), C = n.mul(N, C), x = n.mul(w, x), U = n.mul(h, U), N = n.sub(S, U), N = n.mul(h, N), N = n.add(N, x), x = n.add(S, S), S = n.add(x, S), S = n.add(S, U), S = n.mul(S, N), m = n.add(m, S), U = n.mul(K, I), U = n.add(U, U), S = n.mul(U, N), C = n.sub(C, S), x = n.mul(U, P), x = n.add(x, x), x = n.add(x, x), new u(C, m, x);
+      const { a: h, b: d } = t, y = n.mul(d, Un), { px: E, py: N, pz: _ } = this;
+      let B = n.ZERO, m = n.ZERO, x = n.ZERO, S = n.mul(E, E), H = n.mul(N, N), U = n.mul(_, _), K = n.mul(E, N);
+      return K = n.add(K, K), x = n.mul(E, _), x = n.add(x, x), B = n.mul(h, x), m = n.mul(y, U), m = n.add(B, m), B = n.sub(H, m), m = n.add(H, m), m = n.mul(B, m), B = n.mul(K, B), x = n.mul(y, x), U = n.mul(h, U), K = n.sub(S, U), K = n.mul(h, K), K = n.add(K, x), x = n.add(S, S), S = n.add(x, S), S = n.add(S, U), S = n.mul(S, K), m = n.add(m, S), U = n.mul(N, _), U = n.add(U, U), S = n.mul(U, K), B = n.sub(B, S), x = n.mul(U, H), x = n.add(x, x), x = n.add(x, x), new u(B, m, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function Vi(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: y, py: w, pz: E } = this, { px: K, py: I, pz: C } = h;
+      const { px: d, py: y, pz: E } = this, { px: N, py: _, pz: B } = h;
       let m = n.ZERO, x = n.ZERO, S = n.ZERO;
-      const P = t.a, U = n.mul(t.b, An);
-      let N = n.mul(y, K), $ = n.mul(w, I), R = n.mul(E, C), H = n.add(y, w), b = n.add(K, I);
-      H = n.mul(H, b), b = n.add(N, $), H = n.sub(H, b), b = n.add(y, E);
-      let v = n.add(K, C);
-      return b = n.mul(b, v), v = n.add(N, R), b = n.sub(b, v), v = n.add(w, E), m = n.add(I, C), v = n.mul(v, m), m = n.add($, R), v = n.sub(v, m), S = n.mul(P, b), m = n.mul(U, R), S = n.add(m, S), m = n.sub($, S), S = n.add($, S), x = n.mul(m, S), $ = n.add(N, N), $ = n.add($, N), R = n.mul(P, R), b = n.mul(U, b), $ = n.add($, R), R = n.sub(N, R), R = n.mul(P, R), b = n.add(b, R), N = n.mul($, b), x = n.add(x, N), N = n.mul(v, b), m = n.mul(H, m), m = n.sub(m, N), N = n.mul(H, $), S = n.mul(v, S), S = n.add(S, N), new u(m, x, S);
+      const H = t.a, U = n.mul(t.b, Un);
+      let K = n.mul(d, N), T = n.mul(y, _), R = n.mul(E, B), P = n.add(d, y), w = n.add(N, _);
+      P = n.mul(P, w), w = n.add(K, T), P = n.sub(P, w), w = n.add(d, E);
+      let v = n.add(N, B);
+      return w = n.mul(w, v), v = n.add(K, R), w = n.sub(w, v), v = n.add(y, E), m = n.add(_, B), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), S = n.mul(H, w), m = n.mul(U, R), S = n.add(m, S), m = n.sub(T, S), S = n.add(T, S), x = n.mul(m, S), T = n.add(K, K), T = n.add(T, K), R = n.mul(H, R), w = n.mul(U, w), T = n.add(T, R), R = n.sub(K, R), R = n.mul(H, R), w = n.add(w, R), K = n.mul(T, w), x = n.add(x, K), K = n.mul(v, w), m = n.mul(P, m), m = n.sub(m, K), K = n.mul(P, T), S = n.mul(v, S), S = n.add(S, K), new u(m, x, S);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -926,9 +926,9 @@ function Vi(e) {
       return this.equals(u.ZERO);
     }
     wNAF(h) {
-      return p.wNAFCached(this, l, h, (y) => {
-        const w = n.invertBatch(y.map((E) => E.pz));
-        return y.map((E, K) => E.toAffine(w[K])).map(u.fromAffine);
+      return b.wNAFCached(this, l, h, (d) => {
+        const y = n.invertBatch(d.map((E) => E.pz));
+        return d.map((E, N) => E.toAffine(y[N])).map(u.fromAffine);
       });
     }
     /**
@@ -937,18 +937,18 @@ function Vi(e) {
      * an exposed private key e.g. sig verification, which works over *public* keys.
      */
     multiplyUnsafe(h) {
-      const y = u.ZERO;
-      if (h === ce)
-        return y;
+      const d = u.ZERO;
+      if (h === ae)
+        return d;
       if (a(h), h === Y)
         return this;
-      const { endo: w } = t;
-      if (!w)
-        return p.unsafeLadder(this, h);
-      let { k1neg: E, k1: K, k2neg: I, k2: C } = w.splitScalar(h), m = y, x = y, S = this;
-      for (; K > ce || C > ce; )
-        K & Y && (m = m.add(S)), C & Y && (x = x.add(S)), S = S.double(), K >>= Y, C >>= Y;
-      return E && (m = m.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, w.beta), x.py, x.pz), m.add(x);
+      const { endo: y } = t;
+      if (!y)
+        return b.unsafeLadder(this, h);
+      let { k1neg: E, k1: N, k2neg: _, k2: B } = y.splitScalar(h), m = d, x = d, S = this;
+      for (; N > ae || B > ae; )
+        N & Y && (m = m.add(S)), B & Y && (x = x.add(S)), S = S.double(), N >>= Y, B >>= Y;
+      return E && (m = m.negate()), _ && (x = x.negate()), x = new u(n.mul(x.px, y.beta), x.py, x.pz), m.add(x);
     }
     /**
      * Constant time multiplication.
@@ -961,17 +961,17 @@ function Vi(e) {
      */
     multiply(h) {
       a(h);
-      let y = h, w, E;
-      const { endo: K } = t;
-      if (K) {
-        const { k1neg: I, k1: C, k2neg: m, k2: x } = K.splitScalar(y);
-        let { p: S, f: P } = this.wNAF(C), { p: U, f: N } = this.wNAF(x);
-        S = p.constTimeNegate(I, S), U = p.constTimeNegate(m, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), w = S.add(U), E = P.add(N);
+      let d = h, y, E;
+      const { endo: N } = t;
+      if (N) {
+        const { k1neg: _, k1: B, k2neg: m, k2: x } = N.splitScalar(d);
+        let { p: S, f: H } = this.wNAF(B), { p: U, f: K } = this.wNAF(x);
+        S = b.constTimeNegate(_, S), U = b.constTimeNegate(m, U), U = new u(n.mul(U.px, N.beta), U.py, U.pz), y = S.add(U), E = H.add(K);
       } else {
-        const { p: I, f: C } = this.wNAF(y);
-        w = I, E = C;
+        const { p: _, f: B } = this.wNAF(d);
+        y = _, E = B;
       }
-      return u.normalizeZ([w, E])[0];
+      return u.normalizeZ([y, E])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -979,34 +979,34 @@ function Vi(e) {
      * The trick could be useful if both P and Q are not G (not in our case).
      * @returns non-zero affine point
      */
-    multiplyAndAddUnsafe(h, y, w) {
-      const E = u.BASE, K = (C, m) => m === ce || m === Y || !C.equals(E) ? C.multiplyUnsafe(m) : C.multiply(m), I = K(this, y).add(K(h, w));
-      return I.is0() ? void 0 : I;
+    multiplyAndAddUnsafe(h, d, y) {
+      const E = u.BASE, N = (B, m) => m === ae || m === Y || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), _ = N(this, d).add(N(h, y));
+      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: y, py: w, pz: E } = this, K = this.is0();
-      h == null && (h = K ? n.ONE : n.inv(E));
-      const I = n.mul(y, h), C = n.mul(w, h), m = n.mul(E, h);
-      if (K)
+      const { px: d, py: y, pz: E } = this, N = this.is0();
+      h == null && (h = N ? n.ONE : n.inv(E));
+      const _ = n.mul(d, h), B = n.mul(y, h), m = n.mul(E, h);
+      if (N)
         return { x: n.ZERO, y: n.ZERO };
       if (!n.eql(m, n.ONE))
         throw new Error("invZ was invalid");
-      return { x: I, y: C };
+      return { x: _, y: B };
     }
     isTorsionFree() {
-      const { h, isTorsionFree: y } = t;
+      const { h, isTorsionFree: d } = t;
       if (h === Y)
         return !0;
-      if (y)
-        return y(u, this);
+      if (d)
+        return d(u, this);
       throw new Error("isTorsionFree() has not been declared for the elliptic curve");
     }
     clearCofactor() {
-      const { h, clearCofactor: y } = t;
-      return h === Y ? this : y ? y(u, this) : this.multiplyUnsafe(t.h);
+      const { h, clearCofactor: d } = t;
+      return h === Y ? this : d ? d(u, this) : this.multiplyUnsafe(t.h);
     }
     toRawBytes(h = !0) {
       return this.assertValidity(), r(u, this, h);
@@ -1016,7 +1016,7 @@ function Vi(e) {
     }
   }
   u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
-  const d = t.nBitLength, p = Hi(u, t.endo ? Math.ceil(d / 2) : d);
+  const g = t.nBitLength, b = Qi(u, t.endo ? Math.ceil(g / 2) : g);
   return {
     CURVE: t,
     ProjectivePoint: u,
@@ -1025,8 +1025,8 @@ function Vi(e) {
     isWithinCurveOrder: o
   };
 }
-function zi(e) {
-  const t = Fn(e);
+function is(e) {
+  const t = er(e);
   return Je(t, {
     hash: "hash",
     hmac: "function",
@@ -1037,90 +1037,90 @@ function zi(e) {
     lowS: "boolean"
   }), Object.freeze({ lowS: !0, ...t });
 }
-function Zi(e) {
-  const t = zi(e), { Fp: n, n: r } = t, i = n.BYTES + 1, s = 2 * n.BYTES + 1;
-  function o(b) {
-    return ce < b && b < n.ORDER;
+function ss(e) {
+  const t = is(e), { Fp: n, n: r } = t, i = n.BYTES + 1, s = 2 * n.BYTES + 1;
+  function o(w) {
+    return ae < w && w < n.ORDER;
   }
-  function a(b) {
-    return z(b, r);
+  function a(w) {
+    return V(w, r);
   }
-  function c(b) {
-    return Rt(b, r);
+  function c(w) {
+    return Tt(w, r);
   }
-  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: d } = Vi({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: g } = rs({
     ...t,
-    toBytes(b, v, A) {
-      const k = v.toAffine(), B = n.toBytes(k.x), _ = ke;
-      return A ? _(Uint8Array.from([v.hasEvenY() ? 2 : 3]), B) : _(Uint8Array.from([4]), B, n.toBytes(k.y));
+    toBytes(w, v, A) {
+      const C = v.toAffine(), k = n.toBytes(C.x), I = Ue;
+      return A ? I(Uint8Array.from([v.hasEvenY() ? 2 : 3]), k) : I(Uint8Array.from([4]), k, n.toBytes(C.y));
     },
-    fromBytes(b) {
-      const v = b.length, A = b[0], k = b.subarray(1);
+    fromBytes(w) {
+      const v = w.length, A = w[0], C = w.subarray(1);
       if (v === i && (A === 2 || A === 3)) {
-        const B = G(k);
-        if (!o(B))
+        const k = F(C);
+        if (!o(k))
           throw new Error("Point is not on curve");
-        const _ = u(B);
-        let O = n.sqrt(_);
-        const T = (O & Y) === Y;
-        return (A & 1) === 1 !== T && (O = n.neg(O)), { x: B, y: O };
+        const I = u(k);
+        let O = n.sqrt(I);
+        const $ = (O & Y) === Y;
+        return (A & 1) === 1 !== $ && (O = n.neg(O)), { x: k, y: O };
       } else if (v === s && A === 4) {
-        const B = n.fromBytes(k.subarray(0, n.BYTES)), _ = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
-        return { x: B, y: _ };
+        const k = n.fromBytes(C.subarray(0, n.BYTES)), I = n.fromBytes(C.subarray(n.BYTES, 2 * n.BYTES));
+        return { x: k, y: I };
       } else
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${s} uncompressed bytes`);
     }
-  }), p = (b) => qe(xe(b, t.nByteLength));
-  function g(b) {
+  }), b = (w) => qe(Ae(w, t.nByteLength));
+  function p(w) {
     const v = r >> Y;
-    return b > v;
+    return w > v;
   }
-  function h(b) {
-    return g(b) ? a(-b) : b;
+  function h(w) {
+    return p(w) ? a(-w) : w;
   }
-  const y = (b, v, A) => G(b.slice(v, A));
-  class w {
-    constructor(v, A, k) {
-      this.r = v, this.s = A, this.recovery = k, this.assertValidity();
+  const d = (w, v, A) => F(w.slice(v, A));
+  class y {
+    constructor(v, A, C) {
+      this.r = v, this.s = A, this.recovery = C, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
       const A = t.nByteLength;
-      return v = Z("compactSignature", v, A * 2), new w(y(v, 0, A), y(v, A, 2 * A));
+      return v = W("compactSignature", v, A * 2), new y(d(v, 0, A), d(v, A, 2 * A));
     }
     // 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: A, s: k } = Be.toSig(Z("DER", v));
-      return new w(A, k);
+      const { r: A, s: C } = Be.toSig(W("DER", v));
+      return new y(A, C);
     }
     assertValidity() {
-      if (!d(this.r))
+      if (!g(this.r))
         throw new Error("r must be 0 < r < CURVE.n");
-      if (!d(this.s))
+      if (!g(this.s))
         throw new Error("s must be 0 < s < CURVE.n");
     }
     addRecoveryBit(v) {
-      return new w(this.r, this.s, v);
+      return new y(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: A, s: k, recovery: B } = this, _ = x(Z("msgHash", v));
-      if (B == null || ![0, 1, 2, 3].includes(B))
+      const { r: A, s: C, recovery: k } = this, I = x(W("msgHash", v));
+      if (k == null || ![0, 1, 2, 3].includes(k))
         throw new Error("recovery id invalid");
-      const O = B === 2 || B === 3 ? A + t.n : A;
+      const O = k === 2 || k === 3 ? A + t.n : A;
       if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const T = B & 1 ? "03" : "02", X = l.fromHex(T + p(O)), ye = c(O), Ie = a(-_ * ye), ze = a(k * ye), pe = l.BASE.multiplyAndAddUnsafe(X, Ie, ze);
-      if (!pe)
+      const $ = k & 1 ? "03" : "02", Q = l.fromHex($ + b(O)), ge = c(O), Ie = a(-I * ge), Ve = a(C * ge), we = l.BASE.multiplyAndAddUnsafe(Q, Ie, Ve);
+      if (!we)
         throw new Error("point at infinify");
-      return pe.assertValidity(), pe;
+      return we.assertValidity(), we;
     }
     // Signatures should be low-s, to prevent malleability.
     hasHighS() {
-      return g(this.s);
+      return p(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new w(this.r, a(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new y(this.r, a(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
@@ -1134,13 +1134,13 @@ function Zi(e) {
       return De(this.toCompactHex());
     }
     toCompactHex() {
-      return p(this.r) + p(this.s);
+      return b(this.r) + b(this.s);
     }
   }
   const E = {
-    isValidPrivateKey(b) {
+    isValidPrivateKey(w) {
       try {
-        return f(b), !0;
+        return f(w), !0;
       } catch {
         return !1;
       }
@@ -1151,8 +1151,8 @@ function Zi(e) {
      * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
      */
     randomPrivateKey: () => {
-      const b = Zn(t.n);
-      return Pi(t.randomBytes(b), t.n);
+      const w = Qn(t.n);
+      return Yi(t.randomBytes(w), t.n);
     },
     /**
      * Creates precompute table for an arbitrary EC point. Makes point "cached".
@@ -1162,118 +1162,118 @@ function Zi(e) {
      * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
      * fast.multiply(privKey); // much faster ECDH now
      */
-    precompute(b = 8, v = l.BASE) {
-      return v._setWindowSize(b), v.multiply(BigInt(3)), v;
+    precompute(w = 8, v = l.BASE) {
+      return v._setWindowSize(w), v.multiply(BigInt(3)), v;
     }
   };
-  function K(b, v = !0) {
-    return l.fromPrivateKey(b).toRawBytes(v);
+  function N(w, v = !0) {
+    return l.fromPrivateKey(w).toRawBytes(v);
   }
-  function I(b) {
-    const v = b instanceof Uint8Array, A = typeof b == "string", k = (v || A) && b.length;
-    return v ? k === i || k === s : A ? k === 2 * i || k === 2 * s : b instanceof l;
+  function _(w) {
+    const v = w instanceof Uint8Array, A = typeof w == "string", C = (v || A) && w.length;
+    return v ? C === i || C === s : A ? C === 2 * i || C === 2 * s : w instanceof l;
   }
-  function C(b, v, A = !0) {
-    if (I(b))
+  function B(w, v, A = !0) {
+    if (_(w))
       throw new Error("first arg must be private key");
-    if (!I(v))
+    if (!_(v))
       throw new Error("second arg must be public key");
-    return l.fromHex(v).multiply(f(b)).toRawBytes(A);
+    return l.fromHex(v).multiply(f(w)).toRawBytes(A);
   }
-  const m = t.bits2int || function(b) {
-    const v = G(b), A = b.length * 8 - t.nBitLength;
+  const m = t.bits2int || function(w) {
+    const v = F(w), A = w.length * 8 - t.nBitLength;
     return A > 0 ? v >> BigInt(A) : v;
-  }, x = t.bits2int_modN || function(b) {
-    return a(m(b));
+  }, x = t.bits2int_modN || function(w) {
+    return a(m(w));
   }, S = Jt(t.nBitLength);
-  function P(b) {
-    if (typeof b != "bigint")
+  function H(w) {
+    if (typeof w != "bigint")
       throw new Error("bigint expected");
-    if (!(ce <= b && b < S))
+    if (!(ae <= w && w < S))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
-    return xe(b, t.nByteLength);
+    return Ae(w, t.nByteLength);
   }
-  function U(b, v, A = N) {
+  function U(w, v, A = K) {
     if (["recovered", "canonical"].some((Ke) => Ke in A))
       throw new Error("sign() legacy options not supported");
-    const { hash: k, randomBytes: B } = t;
-    let { lowS: _, prehash: O, extraEntropy: T } = A;
-    _ == null && (_ = !0), b = Z("msgHash", b), O && (b = Z("prehashed msgHash", k(b)));
-    const X = x(b), ye = f(v), Ie = [P(ye), P(X)];
-    if (T != null) {
-      const Ke = T === !0 ? B(n.BYTES) : T;
-      Ie.push(Z("extraEntropy", Ke));
-    }
-    const ze = ke(...Ie), pe = X;
-    function xt(Ke) {
-      const _e = m(Ke);
-      if (!d(_e))
+    const { hash: C, randomBytes: k } = t;
+    let { lowS: I, prehash: O, extraEntropy: $ } = A;
+    I == null && (I = !0), w = W("msgHash", w), O && (w = W("prehashed msgHash", C(w)));
+    const Q = x(w), ge = f(v), Ie = [H(ge), H(Q)];
+    if ($ != null) {
+      const Ke = $ === !0 ? k(n.BYTES) : $;
+      Ie.push(W("extraEntropy", Ke));
+    }
+    const Ve = Ue(...Ie), we = Q;
+    function mt(Ke) {
+      const Le = m(Ke);
+      if (!g(Le))
         return;
-      const wn = c(_e), Le = l.BASE.multiply(_e).toAffine(), Q = a(Le.x);
-      if (Q === ce)
+      const Sn = c(Le), $e = l.BASE.multiply(Le).toAffine(), ee = a($e.x);
+      if (ee === ae)
         return;
-      const Te = a(wn * a(pe + Q * ye));
-      if (Te === ce)
+      const Te = a(Sn * a(we + ee * ge));
+      if (Te === ae)
         return;
-      let bn = (Le.x === Q ? 0 : 2) | Number(Le.y & Y), vn = Te;
-      return _ && g(Te) && (vn = h(Te), bn ^= 1), new w(Q, vn, bn);
+      let An = ($e.x === ee ? 0 : 2) | Number($e.y & Y), Nn = Te;
+      return I && p(Te) && (Nn = h(Te), An ^= 1), new y(ee, Nn, An);
     }
-    return { seed: ze, k2sig: xt };
+    return { seed: Ve, k2sig: mt };
   }
-  const N = { lowS: t.lowS, prehash: !1 }, $ = { lowS: t.lowS, prehash: !1 };
-  function R(b, v, A = N) {
-    const { seed: k, k2sig: B } = U(b, v, A), _ = t;
-    return jn(_.hash.outputLen, _.nByteLength, _.hmac)(k, B);
+  const K = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
+  function R(w, v, A = K) {
+    const { seed: C, k2sig: k } = U(w, v, A), I = t;
+    return Jn(I.hash.outputLen, I.nByteLength, I.hmac)(C, k);
   }
   l.BASE._setWindowSize(8);
-  function H(b, v, A, k = $) {
-    var Le;
-    const B = b;
-    if (v = Z("msgHash", v), A = Z("publicKey", A), "strict" in k)
+  function P(w, v, A, C = T) {
+    var $e;
+    const k = w;
+    if (v = W("msgHash", v), A = W("publicKey", A), "strict" in C)
       throw new Error("options.strict was renamed to lowS");
-    const { lowS: _, prehash: O } = k;
-    let T, X;
+    const { lowS: I, prehash: O } = C;
+    let $, Q;
     try {
-      if (typeof B == "string" || B instanceof Uint8Array)
+      if (typeof k == "string" || k instanceof Uint8Array)
         try {
-          T = w.fromDER(B);
-        } catch (Q) {
-          if (!(Q instanceof Be.Err))
-            throw Q;
-          T = w.fromCompact(B);
+          $ = y.fromDER(k);
+        } catch (ee) {
+          if (!(ee instanceof Be.Err))
+            throw ee;
+          $ = y.fromCompact(k);
         }
-      else if (typeof B == "object" && typeof B.r == "bigint" && typeof B.s == "bigint") {
-        const { r: Q, s: Te } = B;
-        T = new w(Q, Te);
+      else if (typeof k == "object" && typeof k.r == "bigint" && typeof k.s == "bigint") {
+        const { r: ee, s: Te } = k;
+        $ = new y(ee, Te);
       } else
         throw new Error("PARSE");
-      X = l.fromHex(A);
-    } catch (Q) {
-      if (Q.message === "PARSE")
+      Q = l.fromHex(A);
+    } catch (ee) {
+      if (ee.message === "PARSE")
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
       return !1;
     }
-    if (_ && T.hasHighS())
+    if (I && $.hasHighS())
       return !1;
     O && (v = t.hash(v));
-    const { r: ye, s: Ie } = T, ze = x(v), pe = c(Ie), xt = a(ze * pe), Ke = a(ye * pe), _e = (Le = l.BASE.multiplyAndAddUnsafe(X, xt, Ke)) == null ? void 0 : Le.toAffine();
-    return _e ? a(_e.x) === ye : !1;
+    const { r: ge, s: Ie } = $, Ve = x(v), we = c(Ie), mt = a(Ve * we), Ke = a(ge * we), Le = ($e = l.BASE.multiplyAndAddUnsafe(Q, mt, Ke)) == null ? void 0 : $e.toAffine();
+    return Le ? a(Le.x) === ge : !1;
   }
   return {
     CURVE: t,
-    getPublicKey: K,
-    getSharedSecret: C,
+    getPublicKey: N,
+    getSharedSecret: B,
     sign: R,
-    verify: H,
+    verify: P,
     ProjectivePoint: l,
-    Signature: w,
+    Signature: y,
     utils: E
   };
 }
-let Wn = class extends Mn {
+let tr = class extends Wn {
   constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, ai(t);
-    const r = Zt(n);
+    super(), this.finished = !1, this.destroyed = !1, mi(t);
+    const r = Wt(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;
@@ -1287,10 +1287,10 @@ let Wn = class extends Mn {
     this.oHash.update(s), s.fill(0);
   }
   update(t) {
-    return nt(this), this.iHash.update(t), this;
+    return et(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    nt(this), On(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    et(this), zn(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);
@@ -1305,33 +1305,33 @@ let Wn = class extends Mn {
     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);
+const nr = (e, t, n) => new tr(e, t).update(n).digest();
+nr.create = (e, t) => new tr(e, t);
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function Fi(e) {
+function os(e) {
   return {
     hash: e,
-    hmac: (t, ...n) => Gn(e, t, fi(...n)),
-    randomBytes: Hn
+    hmac: (t, ...n) => nr(e, t, Ai(...n)),
+    randomBytes: Zn
   };
 }
-function Wi(e, t) {
-  const n = (r) => Zi({ ...e, ...Fi(r) });
+function as(e, t) {
+  const n = (r) => ss({ ...e, ...os(r) });
   return Object.freeze({ ...n(t), create: n });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const ut = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), rt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), it = BigInt(2), Kn = (e, t) => (e + t / it) / t;
-function Yn(e) {
-  const t = ut, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, d = J(u, n, t) * f % t, p = J(d, it, t) * l % t, g = J(p, i, t) * p % t, h = J(g, s, t) * g % t, y = J(h, a, t) * h % t, w = J(y, c, t) * y % t, E = J(w, a, t) * h % t, K = J(E, n, t) * f % t, I = J(K, o, t) * g % t, C = J(I, r, t) * l % t, m = J(C, it, t);
-  if (!Ot.eql(Ot.sqr(m), e))
+const ct = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), rr = BigInt(1), nt = BigInt(2), _n = (e, t) => (e + t / nt) / t;
+function ir(e) {
+  const t = ct, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, g = J(u, n, t) * f % t, b = J(g, nt, t) * l % t, p = J(b, i, t) * b % t, h = J(p, s, t) * p % t, d = J(h, a, t) * h % t, y = J(d, c, t) * d % t, E = J(y, a, t) * h % t, N = J(E, n, t) * f % t, _ = J(N, o, t) * p % t, B = J(_, r, t) * l % t, m = J(B, nt, t);
+  if (!Rt.eql(Rt.sqr(m), e))
     throw new Error("Cannot find square root");
   return m;
 }
-const Ot = Oi(ut, void 0, void 0, { sqrt: Yn }), Ue = Wi({
+const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), _e = as({
   a: BigInt(0),
   b: BigInt(7),
-  Fp: Ot,
-  n: rt,
+  Fp: Rt,
+  n: tt,
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
   Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),
@@ -1346,95 +1346,95 @@ const Ot = Oi(ut, void 0, void 0, { sqrt: Yn }), Ue = Wi({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
-      const t = rt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Jn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), a = Kn(s * e, t), c = Kn(-r * e, t);
-      let l = z(e - a * n - c * i, t), f = z(-a * r - c * s, t);
-      const u = l > o, d = f > o;
-      if (u && (l = t - l), d && (f = t - f), l > o || f > o)
+      const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -rr * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), a = _n(s * e, t), c = _n(-r * e, t);
+      let l = V(e - a * n - c * i, t), f = V(-a * r - c * s, t);
+      const u = l > o, g = f > o;
+      if (u && (l = t - l), g && (f = t - f), l > o || f > o)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
-      return { k1neg: u, k1: l, k2neg: d, k2: f };
+      return { k1neg: u, k1: l, k2neg: g, k2: f };
     }
   }
-}, Tt), ft = BigInt(0), Xn = (e) => typeof e == "bigint" && ft < e && e < ut, Gi = (e) => typeof e == "bigint" && ft < e && e < rt, Nn = {};
-function st(e, ...t) {
-  let n = Nn[e];
+}, Lt), ut = BigInt(0), sr = (e) => typeof e == "bigint" && ut < e && e < ct, cs = (e) => typeof e == "bigint" && ut < e && e < tt, In = {};
+function rt(e, ...t) {
+  let n = In[e];
   if (n === void 0) {
-    const r = Tt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = ke(r, r), Nn[e] = n;
+    const r = Lt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    n = Ue(r, r), In[e] = n;
   }
-  return Tt(ke(n, ...t));
+  return Lt(Ue(n, ...t));
 }
-const Yt = (e) => e.toRawBytes(!0).slice(1), Pt = (e) => xe(e, 32), Bt = (e) => z(e, ut), We = (e) => z(e, rt), Xt = Ue.ProjectivePoint, Ji = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
+const Yt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => Ae(e, 32), Nt = (e) => V(e, ct), Ge = (e) => V(e, tt), Xt = _e.ProjectivePoint, us = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
 function Mt(e) {
-  let t = Ue.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
-  return { scalar: n.hasEvenY() ? t : We(-t), bytes: Yt(n) };
+  let t = _e.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
+  return { scalar: n.hasEvenY() ? t : Ge(-t), bytes: Yt(n) };
 }
-function Qn(e) {
-  if (!Xn(e))
+function or(e) {
+  if (!sr(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = Bt(e * e), n = Bt(t * e + BigInt(7));
-  let r = Yn(n);
-  r % it !== ft && (r = Bt(-r));
-  const i = new Xt(e, r, Jn);
+  const t = Nt(e * e), n = Nt(t * e + BigInt(7));
+  let r = ir(n);
+  r % nt !== ut && (r = Nt(-r));
+  const i = new Xt(e, r, rr);
   return i.assertValidity(), i;
 }
-function er(...e) {
-  return We(G(st("BIP0340/challenge", ...e)));
+function ar(...e) {
+  return Ge(F(rt("BIP0340/challenge", ...e)));
 }
-function Yi(e) {
+function ls(e) {
   return Mt(e).bytes;
 }
-function Xi(e, t, n = Hn(32)) {
-  const r = Z("message", e), { bytes: i, scalar: s } = Mt(t), o = Z("auxRand", n, 32), a = Pt(s ^ G(st("BIP0340/aux", o))), c = st("BIP0340/nonce", a, i, r), l = We(G(c));
-  if (l === ft)
+function fs(e, t, n = Zn(32)) {
+  const r = W("message", e), { bytes: i, scalar: s } = Mt(t), o = W("auxRand", n, 32), a = Ot(s ^ F(rt("BIP0340/aux", o))), c = rt("BIP0340/nonce", a, i, r), l = Ge(F(c));
+  if (l === ut)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Mt(l), d = er(f, i, r), p = new Uint8Array(64);
-  if (p.set(f, 0), p.set(Pt(We(u + d * s)), 32), !tr(p, r, i))
+  const { bytes: f, scalar: u } = Mt(l), g = ar(f, i, r), b = new Uint8Array(64);
+  if (b.set(f, 0), b.set(Ot(Ge(u + g * s)), 32), !cr(b, r, i))
     throw new Error("sign: Invalid signature produced");
-  return p;
+  return b;
 }
-function tr(e, t, n) {
-  const r = Z("signature", e, 64), i = Z("message", t), s = Z("publicKey", n, 32);
+function cr(e, t, n) {
+  const r = W("signature", e, 64), i = W("message", t), s = W("publicKey", n, 32);
   try {
-    const o = Qn(G(s)), a = G(r.subarray(0, 32));
-    if (!Xn(a))
+    const o = or(F(s)), a = F(r.subarray(0, 32));
+    if (!sr(a))
       return !1;
-    const c = G(r.subarray(32, 64));
-    if (!Gi(c))
+    const c = F(r.subarray(32, 64));
+    if (!cs(c))
       return !1;
-    const l = er(Pt(a), Yt(o), i), f = Ji(o, c, We(-l));
+    const l = ar(Ot(a), Yt(o), i), f = us(o, c, Ge(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== a);
   } catch {
     return !1;
   }
 }
-const Ze = {
-  getPublicKey: Yi,
-  sign: Xi,
-  verify: tr,
+const We = {
+  getPublicKey: ls,
+  sign: fs,
+  verify: cr,
   utils: {
-    randomPrivateKey: Ue.utils.randomPrivateKey,
-    lift_x: Qn,
+    randomPrivateKey: _e.utils.randomPrivateKey,
+    lift_x: or,
     pointToBytes: Yt,
-    numberToBytesBE: xe,
-    bytesToNumberBE: G,
-    taggedHash: st,
-    mod: z
+    numberToBytesBE: Ae,
+    bytesToNumberBE: F,
+    taggedHash: rt,
+    mod: V
   }
-}, Ct = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+}, 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, kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Qi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!Qi)
+const Qt = (e) => e instanceof Uint8Array, kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, hs = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!hs)
   throw new Error("Non little-endian hardware is not supported");
-const es = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const ds = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function M(e) {
   if (!Qt(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += es[e[n]];
+    t += ds[e[n]];
   return t;
 }
-function W(e) {
+function G(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   const t = e.length;
@@ -1449,17 +1449,17 @@ function W(e) {
   }
   return n;
 }
-function ts(e) {
+function ps(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Ge(e) {
-  if (typeof e == "string" && (e = ts(e)), !Qt(e))
+function Fe(e) {
+  if (typeof e == "string" && (e = ps(e)), !Qt(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function ht(...e) {
+function lt(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -1468,74 +1468,74 @@ function ht(...e) {
     t.set(r, n), n += r.length;
   }), t;
 }
-class nr {
+class ur {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 }
-function rr(e) {
-  const t = (r) => e().update(Ge(r)).digest(), n = e();
+function lr(e) {
+  const t = (r) => e().update(Fe(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-function ir(e = 32) {
-  if (Ct && typeof Ct.getRandomValues == "function")
-    return Ct.getRandomValues(new Uint8Array(e));
+function fr(e = 32) {
+  if (Kt && typeof Kt.getRandomValues == "function")
+    return Kt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 function Ht(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function ns(e) {
+function ys(e) {
   if (typeof e != "boolean")
     throw new Error(`Expected boolean, not ${e}`);
 }
-function sr(e, ...t) {
+function hr(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 rs(e) {
+function gs(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
   Ht(e.outputLen), Ht(e.blockLen);
 }
-function is(e, t = !0) {
+function ws(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 ss(e, t) {
-  sr(e);
+function bs(e, t) {
+  hr(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const se = {
   number: Ht,
-  bool: ns,
-  bytes: sr,
-  hash: rs,
-  exists: is,
-  output: ss
+  bool: ys,
+  bytes: hr,
+  hash: gs,
+  exists: ws,
+  output: bs
 };
-function os(e, t, n, r) {
+function vs(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
   const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), a = Number(n & s), c = r ? 4 : 0, l = r ? 0 : 4;
   e.setUint32(t + c, o, r), e.setUint32(t + l, a, r);
 }
-class as extends nr {
+class ms extends ur {
   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 = kt(this.buffer);
   }
   update(t) {
     se.exists(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Ge(t);
+    t = Fe(t);
     const s = t.length;
     for (let o = 0; o < s; ) {
       const a = Math.min(i - this.pos, s - o);
@@ -1556,7 +1556,7 @@ class as extends nr {
     n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(r, 0), o = 0);
     for (let u = o; u < i; u++)
       n[u] = 0;
-    os(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    vs(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
     const a = kt(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
@@ -1578,7 +1578,7 @@ class as extends nr {
     return t.length = i, t.pos = a, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 }
-const cs = (e, t, n) => e & t ^ ~e & n, ls = (e, t, n) => e & t ^ e & n ^ t & n, us = new Uint32Array([
+const Es = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n, Ss = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1643,7 +1643,7 @@ const cs = (e, t, n) => e & t ^ ~e & n, ls = (e, t, n) => e & t ^ e & n ^ t & n,
   2756734187,
   3204031479,
   3329325298
-]), be = new Uint32Array([
+]), me = new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -1652,10 +1652,10 @@ const cs = (e, t, n) => e & t ^ ~e & n, ls = (e, t, n) => e & t ^ e & n ^ t & n,
   2600822924,
   528734635,
   1541459225
-]), ve = new Uint32Array(64);
-class or extends as {
+]), Ee = new Uint32Array(64);
+class dr extends ms {
   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;
+    super(64, 32, 8, !1), this.A = me[0] | 0, this.B = me[1] | 0, this.C = me[2] | 0, this.D = me[3] | 0, this.E = me[4] | 0, this.F = me[5] | 0, this.G = me[6] | 0, this.H = me[7] | 0;
   }
   get() {
     const { A: t, B: n, C: r, D: i, E: s, F: o, G: a, H: c } = this;
@@ -1667,48 +1667,48 @@ class or extends as {
   }
   process(t, n) {
     for (let u = 0; u < 16; u++, n += 4)
-      ve[u] = t.getUint32(n, !1);
+      Ee[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const d = ve[u - 15], p = ve[u - 2], g = re(d, 7) ^ re(d, 18) ^ d >>> 3, h = re(p, 17) ^ re(p, 19) ^ p >>> 10;
-      ve[u] = h + ve[u - 7] + g + ve[u - 16] | 0;
+      const g = Ee[u - 15], b = Ee[u - 2], p = ie(g, 7) ^ ie(g, 18) ^ g >>> 3, h = ie(b, 17) ^ ie(b, 19) ^ b >>> 10;
+      Ee[u] = h + Ee[u - 7] + p + Ee[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: a, F: c, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const d = re(a, 6) ^ re(a, 11) ^ re(a, 25), p = f + d + cs(a, c, l) + us[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ls(r, i, s) | 0;
-      f = l, l = c, c = a, a = o + p | 0, o = s, s = i, i = r, r = p + h | 0;
+      const g = ie(a, 6) ^ ie(a, 11) ^ ie(a, 25), b = f + g + Es(a, c, l) + Ss[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + xs(r, i, s) | 0;
+      f = l, l = c, c = a, a = o + b | 0, o = s, s = i, i = r, r = b + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, a, c, l, f);
   }
   roundClean() {
-    ve.fill(0);
+    Ee.fill(0);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 }
-class fs extends or {
+class As extends dr {
   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 Se = rr(() => new or());
-rr(() => new fs());
+const fe = lr(() => new dr());
+lr(() => new As());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function Ve(e) {
+function ze(e) {
   if (!Number.isSafeInteger(e))
     throw new Error(`Wrong integer: ${e}`);
 }
-function fe(...e) {
+function de(...e) {
   const t = (i, s) => (o) => i(s(o)), n = Array.from(e).reverse().reduce((i, s) => i ? t(i, s.encode) : s.encode, void 0), r = e.reduce((i, s) => i ? t(i, s.decode) : s.decode, void 0);
   return { encode: n, decode: r };
 }
-function he(e) {
+function pe(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 (Ve(n), n < 0 || n >= e.length)
+        if (ze(n), n < 0 || n >= e.length)
           throw new Error(`Digit index outside alphabet: ${n} (alphabet: ${e.length})`);
         return e[n];
       });
@@ -1727,7 +1727,7 @@ function he(e) {
     }
   };
 }
-function de(e = "") {
+function ye(e = "") {
   if (typeof e != "string")
     throw new Error("join separator should be string");
   return {
@@ -1746,8 +1746,8 @@ function de(e = "") {
     }
   };
 }
-function dt(e, t = "=") {
-  if (Ve(e), typeof t != "string")
+function ft(e, t = "=") {
+  if (ze(e), typeof t != "string")
     throw new Error("padding chr should be string");
   return {
     encode(n) {
@@ -1776,12 +1776,12 @@ function dt(e, t = "=") {
     }
   };
 }
-function ar(e) {
+function pr(e) {
   if (typeof e != "function")
     throw new Error("normalize fn should be function");
   return { encode: (t) => t, decode: (t) => e(t) };
 }
-function Bn(e, t, n) {
+function Ln(e, t, n) {
   if (t < 2)
     throw new Error(`convertRadix: wrong from=${t}, base cannot be less than 2`);
   if (n < 2)
@@ -1793,7 +1793,7 @@ function Bn(e, t, n) {
   let r = 0;
   const i = [], s = Array.from(e);
   for (s.forEach((o) => {
-    if (Ve(o), o < 0 || o >= t)
+    if (ze(o), o < 0 || o >= t)
       throw new Error(`Wrong integer: ${o}`);
   }); ; ) {
     let o = 0, a = !0;
@@ -1814,20 +1814,20 @@ function Bn(e, t, n) {
     i.push(0);
   return i.reverse();
 }
-const cr = (e, t) => t ? cr(t, e % t) : e, ot = (e, t) => e + (t - cr(e, t));
-function qt(e, t, n, r) {
+const yr = (e, t) => t ? yr(t, e % t) : e, it = (e, t) => e + (t - yr(e, t));
+function Pt(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 (ot(t, n) > 32)
-    throw new Error(`convertRadix2: carry overflow from=${t} to=${n} carryBits=${ot(t, n)}`);
+  if (it(t, n) > 32)
+    throw new Error(`convertRadix2: carry overflow from=${t} to=${n} carryBits=${it(t, n)}`);
   let i = 0, s = 0;
   const o = 2 ** n - 1, a = [];
   for (const c of e) {
-    if (Ve(c), c >= 2 ** t)
+    if (ze(c), c >= 2 ** t)
       throw new Error(`convertRadix2: invalid data word=${c} from=${t}`);
     if (i = i << t | c, s + t > 32)
       throw new Error(`convertRadix2: carry overflow pos=${s} from=${t}`);
@@ -1841,39 +1841,39 @@ function qt(e, t, n, r) {
     throw new Error(`Non-zero padding: ${i}`);
   return r && s > 0 && a.push(i >>> 0), a;
 }
-function hs(e) {
-  return Ve(e), {
+function Ns(e) {
+  return ze(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
-      return Bn(Array.from(t), 2 ** 8, e);
+      return Ln(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(Bn(t, e, 2 ** 8));
+      return Uint8Array.from(Ln(t, e, 2 ** 8));
     }
   };
 }
-function Ae(e, t = !1) {
-  if (Ve(e), e <= 0 || e > 32)
+function Ne(e, t = !1) {
+  if (ze(e), e <= 0 || e > 32)
     throw new Error("radix2: bits should be in (0..32]");
-  if (ot(8, e) > 32 || ot(e, 8) > 32)
+  if (it(8, e) > 32 || it(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 qt(Array.from(n), 8, e, !t);
+      return Pt(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(qt(n, e, 8, t));
+      return Uint8Array.from(Pt(n, e, 8, t));
     }
   };
 }
-function Cn(e) {
+function $n(e) {
   if (typeof e != "function")
     throw new Error("unsafeWrapper fn should be function");
   return function(...t) {
@@ -1883,25 +1883,25 @@ function Cn(e) {
     }
   };
 }
-const ds = fe(Ae(4), he("0123456789ABCDEF"), de("")), ys = fe(Ae(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), dt(5), de(""));
-fe(Ae(5), he("0123456789ABCDEFGHIJKLMNOPQRSTUV"), dt(5), de(""));
-fe(Ae(5), he("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), de(""), ar((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const ue = fe(Ae(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), dt(6), de("")), ps = fe(Ae(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), dt(6), de("")), en = (e) => fe(hs(58), he(e), de("")), Dt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+const Ks = de(Ne(4), pe("0123456789ABCDEF"), ye("")), ks = de(Ne(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ft(5), ye(""));
+de(Ne(5), pe("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ft(5), ye(""));
+de(Ne(5), pe("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), ye(""), pr((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
+const he = de(Ne(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ft(6), ye("")), Bs = de(Ne(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ft(6), ye("")), en = (e) => de(Ns(58), pe(e), ye("")), qt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
 en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
 en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
-const kn = [0, 2, 3, 5, 6, 7, 9, 10, 11], gs = {
+const Tn = [0, 2, 3, 5, 6, 7, 9, 10, 11], Cs = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
       const r = e.subarray(n, n + 8);
-      t += Dt.encode(r).padStart(kn[r.length], "1");
+      t += qt.encode(r).padStart(Tn[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), s = Dt.decode(r);
+      const r = e.slice(n, n + 11), i = Tn.indexOf(r.length), s = qt.decode(r);
       for (let o = 0; o < s.length - i; o++)
         if (s[o] !== 0)
           throw new Error("base58xmr: wrong padding");
@@ -1909,118 +1909,118 @@ const kn = [0, 2, 3, 5, 6, 7, 9, 10, 11], gs = {
     }
     return Uint8Array.from(t);
   }
-}, jt = fe(he("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), de("")), Un = [996825010, 642813549, 513874426, 1027748829, 705979059];
-function Fe(e) {
+}, Dt = de(pe("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), ye("")), Rn = [996825010, 642813549, 513874426, 1027748829, 705979059];
+function Ze(e) {
   const t = e >> 25;
   let n = (e & 33554431) << 5;
-  for (let r = 0; r < Un.length; r++)
-    (t >> r & 1) === 1 && (n ^= Un[r]);
+  for (let r = 0; r < Rn.length; r++)
+    (t >> r & 1) === 1 && (n ^= Rn[r]);
   return n;
 }
-function In(e, t, n = 1) {
+function On(e, t, n = 1) {
   const r = e.length;
   let i = 1;
   for (let s = 0; s < r; s++) {
     const o = e.charCodeAt(s);
     if (o < 33 || o > 126)
       throw new Error(`Invalid prefix (${e})`);
-    i = Fe(i) ^ o >> 5;
+    i = Ze(i) ^ o >> 5;
   }
-  i = Fe(i);
+  i = Ze(i);
   for (let s = 0; s < r; s++)
-    i = Fe(i) ^ e.charCodeAt(s) & 31;
+    i = Ze(i) ^ e.charCodeAt(s) & 31;
   for (let s of t)
-    i = Fe(i) ^ s;
+    i = Ze(i) ^ s;
   for (let s = 0; s < 6; s++)
-    i = Fe(i);
-  return i ^= n, jt.encode(qt([i % 2 ** 30], 30, 5, !1));
+    i = Ze(i);
+  return i ^= n, Dt.encode(Pt([i % 2 ** 30], 30, 5, !1));
 }
-function lr(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Ae(5), r = n.decode, i = n.encode, s = Cn(r);
-  function o(f, u, d = 90) {
+function gr(e) {
+  const t = e === "bech32" ? 1 : 734539939, n = Ne(5), r = n.decode, i = n.encode, s = $n(r);
+  function o(f, u, g = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
     if (!Array.isArray(u) || u.length && typeof u[0] != "number")
       throw new Error(`bech32.encode words should be array of numbers, not ${typeof u}`);
-    const p = f.length + 7 + u.length;
-    if (d !== !1 && p > d)
-      throw new TypeError(`Length ${p} exceeds limit ${d}`);
-    return f = f.toLowerCase(), `${f}1${jt.encode(u)}${In(f, u, t)}`;
+    const b = f.length + 7 + u.length;
+    if (g !== !1 && b > g)
+      throw new TypeError(`Length ${b} exceeds limit ${g}`);
+    return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${On(f, u, t)}`;
   }
   function a(f, u = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.decode input should be string, not ${typeof f}`);
     if (f.length < 8 || u !== !1 && f.length > u)
       throw new TypeError(`Wrong string length: ${f.length} (${f}). Expected (8..${u})`);
-    const d = f.toLowerCase();
-    if (f !== d && f !== f.toUpperCase())
+    const g = f.toLowerCase();
+    if (f !== g && f !== f.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
-    f = d;
-    const p = f.lastIndexOf("1");
-    if (p === 0 || p === -1)
+    f = g;
+    const b = f.lastIndexOf("1");
+    if (b === 0 || b === -1)
       throw new Error('Letter "1" must be present between prefix and data only');
-    const g = f.slice(0, p), h = f.slice(p + 1);
+    const p = f.slice(0, b), h = f.slice(b + 1);
     if (h.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const y = jt.decode(h).slice(0, -6), w = In(g, y, t);
-    if (!h.endsWith(w))
-      throw new Error(`Invalid checksum in ${f}: expected "${w}"`);
-    return { prefix: g, words: y };
+    const d = Dt.decode(h).slice(0, -6), y = On(p, d, t);
+    if (!h.endsWith(y))
+      throw new Error(`Invalid checksum in ${f}: expected "${y}"`);
+    return { prefix: p, words: d };
   }
-  const c = Cn(a);
+  const c = $n(a);
   function l(f) {
-    const { prefix: u, words: d } = a(f, !1);
-    return { prefix: u, words: d, bytes: r(d) };
+    const { prefix: u, words: g } = a(f, !1);
+    return { prefix: u, words: g, bytes: r(g) };
   }
   return { encode: o, decode: a, decodeToBytes: l, decodeUnsafe: c, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
-const je = lr("bech32");
-lr("bech32m");
-const ws = {
+const je = gr("bech32");
+gr("bech32m");
+const Us = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, bs = fe(Ae(4), he("0123456789abcdef"), de(""), ar((e) => {
+}, _s = de(Ne(4), pe("0123456789abcdef"), ye(""), pr((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();
-})), vs = {
-  utf8: ws,
-  hex: bs,
-  base16: ds,
-  base32: ys,
-  base64: ue,
-  base64url: ps,
-  base58: Dt,
-  base58xmr: gs
+})), Is = {
+  utf8: Us,
+  hex: _s,
+  base16: Ks,
+  base32: ks,
+  base64: he,
+  base64url: Bs,
+  base58: qt,
+  base58xmr: Cs
 };
-`${Object.keys(vs).join(", ")}`;
-function Ut(e) {
+`${Object.keys(Is).join(", ")}`;
+function Bt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
-function _n(e) {
+function Mn(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
-function ms(e) {
+function Ls(e) {
   return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
 }
-function le(e, ...t) {
-  if (!ms(e))
+function ce(e, ...t) {
+  if (!Ls(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 F = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), Es = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!Es)
+const Z = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), $s = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!$s)
   throw new Error("Non little-endian hardware is not supported");
-function xs(e, t) {
+function Ts(e, t) {
   if (t == null || typeof t != "object")
     throw new Error("options must be defined");
   return Object.assign(e, t);
 }
-function Ss(e, t) {
+function Rs(e, t) {
   if (e.length !== t.length)
     return !1;
   let n = 0;
@@ -2028,17 +2028,17 @@ function Ss(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const As = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ee = 16, Ks = 283;
+const Os = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Se = 16, Ms = 283;
 function tn(e) {
-  return e << 1 ^ Ks & -(e >> 7);
+  return e << 1 ^ Ms & -(e >> 7);
 }
-function Pe(e, t) {
+function He(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
     n ^= e & -(t & 1), e = tn(e);
   return n;
 }
-const Vt = /* @__PURE__ */ (() => {
+const jt = /* @__PURE__ */ (() => {
   let e = new Uint8Array(256);
   for (let n = 0, r = 1; n < 256; n++, r ^= tn(r))
     e[n] = r;
@@ -2049,11 +2049,11 @@ const Vt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), Ns = /* @__PURE__ */ Vt.map((e, t) => Vt.indexOf(t)), Bs = (e) => e << 24 | e >>> 8, It = (e) => e << 8 | e >>> 24;
-function ur(e, t) {
+})(), Hs = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Ps = (e) => e << 24 | e >>> 8, Ct = (e) => e << 8 | e >>> 24;
+function wr(e, t) {
   if (e.length !== 256)
     throw new Error("Wrong sbox length");
-  const n = new Uint32Array(256).map((l, f) => t(e[f])), r = n.map(It), i = r.map(It), s = i.map(It), o = new Uint32Array(256 * 256), a = new Uint32Array(256 * 256), c = new Uint16Array(256 * 256);
+  const n = new Uint32Array(256).map((l, f) => t(e[f])), r = n.map(Ct), i = r.map(Ct), s = i.map(Ct), o = new Uint32Array(256 * 256), a = new Uint32Array(256 * 256), c = new Uint16Array(256 * 256);
   for (let l = 0; l < 256; l++)
     for (let f = 0; f < 256; f++) {
       const u = l * 256 + f;
@@ -2061,27 +2061,27 @@ function ur(e, t) {
     }
   return { sbox: e, sbox2: c, T0: n, T1: r, T2: i, T3: s, T01: o, T23: a };
 }
-const nn = /* @__PURE__ */ ur(Vt, (e) => Pe(e, 3) << 24 | e << 16 | e << 8 | Pe(e, 2)), fr = /* @__PURE__ */ ur(Ns, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), Cs = /* @__PURE__ */ (() => {
+const nn = /* @__PURE__ */ wr(jt, (e) => He(e, 3) << 24 | e << 16 | e << 8 | He(e, 2)), br = /* @__PURE__ */ wr(Hs, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), qs = /* @__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);
+function vr(e) {
+  ce(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 = F(e), i = r.length, s = (a) => oe(n, a, a, a, a), o = new Uint32Array(t + 28);
+  const { sbox2: n } = nn, r = Z(e), i = r.length, s = (a) => oe(n, a, a, a, a), o = new Uint32Array(t + 28);
   o.set(r);
   for (let a = i; a < o.length; a++) {
     let c = o[a - 1];
-    a % i === 0 ? c = s(Bs(c)) ^ Cs[a / i - 1] : i > 6 && a % i === 4 && (c = s(c)), o[a] = o[a - i] ^ c;
+    a % i === 0 ? c = s(Ps(c)) ^ qs[a / i - 1] : i > 6 && a % i === 4 && (c = s(c)), o[a] = o[a - i] ^ c;
   }
   return o;
 }
-function ks(e) {
-  const t = hr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: a, T3: c } = fr;
+function Ds(e) {
+  const t = vr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: a, T3: c } = br;
   for (let l = 0; l < r; l += 4)
     for (let f = 0; f < 4; f++)
       n[l + f] = t[r - l - 4 + f];
@@ -2092,61 +2092,61 @@ function ks(e) {
   }
   return n;
 }
-function me(e, t, n, r, i, s) {
+function xe(e, t, n, r, i, s) {
   return e[n << 8 & 65280 | r >>> 8 & 255] ^ t[i >>> 8 & 65280 | s >>> 24 & 255];
 }
 function oe(e, t, n, r, i) {
   return e[t & 255 | n & 65280] | e[r >>> 16 & 255 | i >>> 16 & 65280] << 16;
 }
-function Ln(e, t, n, r, i) {
+function Hn(e, t, n, r, i) {
   const { sbox2: s, T01: o, T23: a } = nn;
   let c = 0;
   t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
   const l = e.length / 4 - 2;
-  for (let g = 0; g < l; g++) {
-    const h = e[c++] ^ me(o, a, t, n, r, i), y = e[c++] ^ me(o, a, n, r, i, t), w = e[c++] ^ me(o, a, r, i, t, n), E = e[c++] ^ me(o, a, i, t, n, r);
-    t = h, n = y, r = w, i = E;
+  for (let p = 0; p < l; p++) {
+    const h = e[c++] ^ xe(o, a, t, n, r, i), d = e[c++] ^ xe(o, a, n, r, i, t), y = e[c++] ^ xe(o, a, r, i, t, n), E = e[c++] ^ xe(o, a, i, t, n, r);
+    t = h, n = d, r = y, i = E;
   }
-  const f = e[c++] ^ oe(s, t, n, r, i), u = e[c++] ^ oe(s, n, r, i, t), d = e[c++] ^ oe(s, r, i, t, n), p = e[c++] ^ oe(s, i, t, n, r);
-  return { s0: f, s1: u, s2: d, s3: p };
+  const f = e[c++] ^ oe(s, t, n, r, i), u = e[c++] ^ oe(s, n, r, i, t), g = e[c++] ^ oe(s, r, i, t, n), b = e[c++] ^ oe(s, i, t, n, r);
+  return { s0: f, s1: u, s2: g, s3: b };
 }
-function Us(e, t, n, r, i) {
-  const { sbox2: s, T01: o, T23: a } = fr;
+function js(e, t, n, r, i) {
+  const { sbox2: s, T01: o, T23: a } = br;
   let c = 0;
   t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
   const l = e.length / 4 - 2;
-  for (let g = 0; g < l; g++) {
-    const h = e[c++] ^ me(o, a, t, i, r, n), y = e[c++] ^ me(o, a, n, t, i, r), w = e[c++] ^ me(o, a, r, n, t, i), E = e[c++] ^ me(o, a, i, r, n, t);
-    t = h, n = y, r = w, i = E;
+  for (let p = 0; p < l; p++) {
+    const h = e[c++] ^ xe(o, a, t, i, r, n), d = e[c++] ^ xe(o, a, n, t, i, r), y = e[c++] ^ xe(o, a, r, n, t, i), E = e[c++] ^ xe(o, a, i, r, n, t);
+    t = h, n = d, r = y, i = E;
   }
-  const f = e[c++] ^ oe(s, t, i, r, n), u = e[c++] ^ oe(s, n, t, i, r), d = e[c++] ^ oe(s, r, n, t, i), p = e[c++] ^ oe(s, i, r, n, t);
-  return { s0: f, s1: u, s2: d, s3: p };
+  const f = e[c++] ^ oe(s, t, i, r, n), u = e[c++] ^ oe(s, n, t, i, r), g = e[c++] ^ oe(s, r, n, t, i), b = e[c++] ^ oe(s, i, r, n, t);
+  return { s0: f, s1: u, s2: g, s3: b };
 }
-function dr(e, t) {
+function mr(e, t) {
   if (!t)
     return new Uint8Array(e);
-  if (le(t), t.length < e)
+  if (ce(t), t.length < e)
     throw new Error(`aes: wrong destination length, expected at least ${e}, got: ${t.length}`);
   return t;
 }
-function Is(e) {
-  if (le(e), e.length % Ee !== 0)
-    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ee}`);
+function zs(e) {
+  if (ce(e), e.length % Se !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Se}`);
 }
-function _s(e, t, n) {
+function Vs(e, t, n) {
   let r = e.length;
-  const i = r % Ee;
+  const i = r % Se;
   if (!t && i !== 0)
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
-  const s = F(e);
+  const s = Z(e);
   if (t) {
-    let c = Ee - i;
-    c || (c = Ee), r = r + c;
+    let c = Se - i;
+    c || (c = Se), r = r + c;
   }
-  const o = dr(r, n), a = F(o);
+  const o = mr(r, n), a = Z(o);
   return { b: s, o: a, out: o };
 }
-function Ls(e, t) {
+function Ws(e, t) {
   if (!t)
     return e;
   const n = e.length;
@@ -2161,126 +2161,126 @@ function Ls(e, t) {
       throw new Error("aes/pcks5: wrong padding");
   return i;
 }
-function Ts(e) {
-  const t = new Uint8Array(16), n = F(t);
+function Zs(e) {
+  const t = new Uint8Array(16), n = Z(t);
   t.set(e);
-  const r = Ee - e.length;
-  for (let i = Ee - r; i < Ee; i++)
+  const r = Se - e.length;
+  for (let i = Se - r; i < Se; i++)
     t[i] = r;
   return n;
 }
-const yr = /* @__PURE__ */ As({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
-  le(t), le(n, 16);
+const Er = /* @__PURE__ */ Os({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
+  ce(t), ce(n, 16);
   const i = !r.disablePadding;
   return {
     encrypt: (s, o) => {
-      const a = hr(t), { b: c, o: l, out: f } = _s(s, i, o), u = F(n);
-      let d = u[0], p = u[1], g = u[2], h = u[3], y = 0;
-      for (; y + 4 <= c.length; )
-        d ^= c[y + 0], p ^= c[y + 1], g ^= c[y + 2], h ^= c[y + 3], { s0: d, s1: p, s2: g, s3: h } = Ln(a, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
+      const a = vr(t), { b: c, o: l, out: f } = Vs(s, i, o), u = Z(n);
+      let g = u[0], b = u[1], p = u[2], h = u[3], d = 0;
+      for (; d + 4 <= c.length; )
+        g ^= c[d + 0], b ^= c[d + 1], p ^= c[d + 2], h ^= c[d + 3], { s0: g, s1: b, s2: p, s3: h } = Hn(a, g, b, p, h), l[d++] = g, l[d++] = b, l[d++] = p, l[d++] = h;
       if (i) {
-        const w = Ts(s.subarray(y * 4));
-        d ^= w[0], p ^= w[1], g ^= w[2], h ^= w[3], { s0: d, s1: p, s2: g, s3: h } = Ln(a, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
+        const y = Zs(s.subarray(d * 4));
+        g ^= y[0], b ^= y[1], p ^= y[2], h ^= y[3], { s0: g, s1: b, s2: p, s3: h } = Hn(a, g, b, p, h), l[d++] = g, l[d++] = b, l[d++] = p, l[d++] = h;
       }
       return a.fill(0), f;
     },
     decrypt: (s, o) => {
-      Is(s);
-      const a = ks(t), c = F(n), l = dr(s.length, o), f = F(s), u = F(l);
-      let d = c[0], p = c[1], g = c[2], h = c[3];
-      for (let y = 0; y + 4 <= f.length; ) {
-        const w = d, E = p, K = g, I = h;
-        d = f[y + 0], p = f[y + 1], g = f[y + 2], h = f[y + 3];
-        const { s0: C, s1: m, s2: x, s3: S } = Us(a, d, p, g, h);
-        u[y++] = C ^ w, u[y++] = m ^ E, u[y++] = x ^ K, u[y++] = S ^ I;
+      zs(s);
+      const a = Ds(t), c = Z(n), l = mr(s.length, o), f = Z(s), u = Z(l);
+      let g = c[0], b = c[1], p = c[2], h = c[3];
+      for (let d = 0; d + 4 <= f.length; ) {
+        const y = g, E = b, N = p, _ = h;
+        g = f[d + 0], b = f[d + 1], p = f[d + 2], h = f[d + 3];
+        const { s0: B, s1: m, s2: x, s3: S } = js(a, g, b, p, h);
+        u[d++] = B ^ y, u[d++] = m ^ E, u[d++] = x ^ N, u[d++] = S ^ _;
       }
-      return a.fill(0), Ls(l, i);
+      return a.fill(0), Ws(l, i);
     }
   };
-}), pr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), $s = pr("expand 16-byte k"), Rs = pr("expand 32-byte k"), Os = F($s), gr = F(Rs);
-gr.slice();
+}), xr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Gs = xr("expand 16-byte k"), Fs = xr("expand 32-byte k"), Js = Z(Gs), Sr = Z(Fs);
+Sr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
 }
 function zt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Xe = 64, Ps = 16, wr = 2 ** 32 - 1, Tn = new Uint32Array();
-function Ms(e, t, n, r, i, s, o, a) {
-  const c = i.length, l = new Uint8Array(Xe), f = F(l), u = zt(i) && zt(s), d = u ? F(i) : Tn, p = u ? F(s) : Tn;
-  for (let g = 0; g < c; o++) {
-    if (e(t, n, r, f, o, a), o >= wr)
+const Ye = 64, Ys = 16, Ar = 2 ** 32 - 1, Pn = new Uint32Array();
+function Xs(e, t, n, r, i, s, o, a) {
+  const c = i.length, l = new Uint8Array(Ye), f = Z(l), u = zt(i) && zt(s), g = u ? Z(i) : Pn, b = u ? Z(s) : Pn;
+  for (let p = 0; p < c; o++) {
+    if (e(t, n, r, f, o, a), o >= Ar)
       throw new Error("arx: counter overflow");
-    const h = Math.min(Xe, c - g);
-    if (u && h === Xe) {
-      const y = g / 4;
-      if (g % 4 !== 0)
+    const h = Math.min(Ye, c - p);
+    if (u && h === Ye) {
+      const d = p / 4;
+      if (p % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let w = 0, E; w < Ps; w++)
-        E = y + w, p[E] = d[E] ^ f[w];
-      g += Xe;
+      for (let y = 0, E; y < Ys; y++)
+        E = d + y, b[E] = g[E] ^ f[y];
+      p += Ye;
       continue;
     }
-    for (let y = 0, w; y < h; y++)
-      w = g + y, s[w] = i[w] ^ l[y];
-    g += h;
+    for (let d = 0, y; d < h; d++)
+      y = p + d, s[y] = i[y] ^ l[d];
+    p += h;
   }
 }
-function Hs(e, t) {
-  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = xs({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
+function Qs(e, t) {
+  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = Ts({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return Ut(i), Ut(o), _n(s), _n(n), (a, c, l, f, u = 0) => {
-    le(a), le(c), le(l);
-    const d = l.length;
-    if (f || (f = new Uint8Array(d)), le(f), Ut(u), u < 0 || u >= wr)
+  return Bt(i), Bt(o), Mn(s), Mn(n), (a, c, l, f, u = 0) => {
+    ce(a), ce(c), ce(l);
+    const g = l.length;
+    if (f || (f = new Uint8Array(g)), ce(f), Bt(u), u < 0 || u >= Ar)
       throw new Error("arx: counter overflow");
-    if (f.length < d)
-      throw new Error(`arx: output (${f.length}) is shorter than data (${d})`);
-    const p = [];
-    let g = a.length, h, y;
-    if (g === 32)
-      h = a.slice(), p.push(h), y = gr;
-    else if (g === 16 && n)
-      h = new Uint8Array(32), h.set(a), h.set(a, 16), y = Os, p.push(h);
+    if (f.length < g)
+      throw new Error(`arx: output (${f.length}) is shorter than data (${g})`);
+    const b = [];
+    let p = a.length, h, d;
+    if (p === 32)
+      h = a.slice(), b.push(h), d = Sr;
+    else if (p === 16 && n)
+      h = new Uint8Array(32), h.set(a), h.set(a, 16), d = Js, b.push(h);
     else
-      throw new Error(`arx: invalid 32-byte key, got length=${g}`);
-    zt(c) || (c = c.slice(), p.push(c));
-    const w = F(h);
+      throw new Error(`arx: invalid 32-byte key, got length=${p}`);
+    zt(c) || (c = c.slice(), b.push(c));
+    const y = Z(h);
     if (r) {
       if (c.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(y, w, F(c.subarray(0, 16)), w), c = c.subarray(16);
+      r(d, y, Z(c.subarray(0, 16)), y), c = c.subarray(16);
     }
     const E = 16 - i;
     if (E !== c.length)
       throw new Error(`arx: nonce must be ${E} or 16 bytes`);
     if (E !== 12) {
-      const I = new Uint8Array(12);
-      I.set(c, s ? 0 : 12 - c.length), c = I, p.push(c);
+      const _ = new Uint8Array(12);
+      _.set(c, s ? 0 : 12 - c.length), c = _, b.push(c);
     }
-    const K = F(c);
-    for (Ms(e, y, w, K, l, f, u, o); p.length > 0; )
-      p.pop().fill(0);
+    const N = Z(c);
+    for (Xs(e, d, y, N, l, f, u, o); b.length > 0; )
+      b.pop().fill(0);
     return f;
   };
 }
-function qs(e, t, n, r, i, s = 20) {
-  let o = e[0], a = e[1], c = e[2], l = e[3], f = t[0], u = t[1], d = t[2], p = t[3], g = t[4], h = t[5], y = t[6], w = t[7], E = i, K = n[0], I = n[1], C = n[2], m = o, x = a, S = c, P = l, U = f, N = u, $ = d, R = p, H = g, b = h, v = y, A = w, k = E, B = K, _ = I, O = C;
-  for (let X = 0; X < s; X += 2)
-    m = m + U | 0, k = L(k ^ m, 16), H = H + k | 0, U = L(U ^ H, 12), m = m + U | 0, k = L(k ^ m, 8), H = H + k | 0, U = L(U ^ H, 7), x = x + N | 0, B = L(B ^ x, 16), b = b + B | 0, N = L(N ^ b, 12), x = x + N | 0, B = L(B ^ x, 8), b = b + B | 0, N = L(N ^ b, 7), S = S + $ | 0, _ = L(_ ^ S, 16), v = v + _ | 0, $ = L($ ^ v, 12), S = S + $ | 0, _ = L(_ ^ S, 8), v = v + _ | 0, $ = L($ ^ v, 7), P = P + R | 0, O = L(O ^ P, 16), A = A + O | 0, R = L(R ^ A, 12), P = P + R | 0, O = L(O ^ P, 8), A = A + O | 0, R = L(R ^ A, 7), m = m + N | 0, O = L(O ^ m, 16), v = v + O | 0, N = L(N ^ v, 12), m = m + N | 0, O = L(O ^ m, 8), v = v + O | 0, N = L(N ^ v, 7), x = x + $ | 0, k = L(k ^ x, 16), A = A + k | 0, $ = L($ ^ A, 12), x = x + $ | 0, k = L(k ^ x, 8), A = A + k | 0, $ = L($ ^ A, 7), S = S + R | 0, B = L(B ^ S, 16), H = H + B | 0, R = L(R ^ H, 12), S = S + R | 0, B = L(B ^ S, 8), H = H + B | 0, R = L(R ^ H, 7), P = P + U | 0, _ = L(_ ^ P, 16), b = b + _ | 0, U = L(U ^ b, 12), P = P + U | 0, _ = L(_ ^ P, 8), b = b + _ | 0, U = L(U ^ b, 7);
-  let T = 0;
-  r[T++] = o + m | 0, r[T++] = a + x | 0, r[T++] = c + S | 0, r[T++] = l + P | 0, r[T++] = f + U | 0, r[T++] = u + N | 0, r[T++] = d + $ | 0, r[T++] = p + R | 0, r[T++] = g + H | 0, r[T++] = h + b | 0, r[T++] = y + v | 0, r[T++] = w + A | 0, r[T++] = E + k | 0, r[T++] = K + B | 0, r[T++] = I + _ | 0, r[T++] = C + O | 0;
+function eo(e, t, n, r, i, s = 20) {
+  let o = e[0], a = e[1], c = e[2], l = e[3], f = t[0], u = t[1], g = t[2], b = t[3], p = t[4], h = t[5], d = t[6], y = t[7], E = i, N = n[0], _ = n[1], B = n[2], m = o, x = a, S = c, H = l, U = f, K = u, T = g, R = b, P = p, w = h, v = d, A = y, C = E, k = N, I = _, O = B;
+  for (let Q = 0; Q < s; Q += 2)
+    m = m + U | 0, C = L(C ^ m, 16), P = P + C | 0, U = L(U ^ P, 12), m = m + U | 0, C = L(C ^ m, 8), P = P + C | 0, U = L(U ^ P, 7), x = x + K | 0, k = L(k ^ x, 16), w = w + k | 0, K = L(K ^ w, 12), x = x + K | 0, k = L(k ^ x, 8), w = w + k | 0, K = L(K ^ w, 7), S = S + T | 0, I = L(I ^ S, 16), v = v + I | 0, T = L(T ^ v, 12), S = S + T | 0, I = L(I ^ S, 8), v = v + I | 0, T = L(T ^ v, 7), H = H + R | 0, O = L(O ^ H, 16), A = A + O | 0, R = L(R ^ A, 12), H = H + R | 0, O = L(O ^ H, 8), A = A + O | 0, R = L(R ^ A, 7), m = m + K | 0, O = L(O ^ m, 16), v = v + O | 0, K = L(K ^ v, 12), m = m + K | 0, O = L(O ^ m, 8), v = v + O | 0, K = L(K ^ v, 7), x = x + T | 0, C = L(C ^ x, 16), A = A + C | 0, T = L(T ^ A, 12), x = x + T | 0, C = L(C ^ x, 8), A = A + C | 0, T = L(T ^ A, 7), S = S + R | 0, k = L(k ^ S, 16), P = P + k | 0, R = L(R ^ P, 12), S = S + R | 0, k = L(k ^ S, 8), P = P + k | 0, R = L(R ^ P, 7), H = H + U | 0, I = L(I ^ H, 16), w = w + I | 0, U = L(U ^ w, 12), H = H + U | 0, I = L(I ^ H, 8), w = w + I | 0, U = L(U ^ w, 7);
+  let $ = 0;
+  r[$++] = o + m | 0, r[$++] = a + x | 0, r[$++] = c + S | 0, r[$++] = l + H | 0, r[$++] = f + U | 0, r[$++] = u + K | 0, r[$++] = g + T | 0, r[$++] = b + R | 0, r[$++] = p + P | 0, r[$++] = h + w | 0, r[$++] = d + v | 0, r[$++] = y + A | 0, r[$++] = E + C | 0, r[$++] = N + k | 0, r[$++] = _ + I | 0, r[$++] = B + O | 0;
 }
-const br = /* @__PURE__ */ Hs(qs, {
+const Nr = /* @__PURE__ */ Qs(eo, {
   counterRight: !1,
   counterLength: 4,
   allowShortKeys: !1
 });
-class vr extends nr {
+class Kr extends ur {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, se.hash(t);
-    const r = Ge(n);
+    const r = Fe(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;
@@ -2312,28 +2312,28 @@ class vr extends nr {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const yt = (e, t, n) => new vr(e, t).update(n).digest();
-yt.create = (e, t) => new vr(e, t);
+const ht = (e, t, n) => new Kr(e, t).update(n).digest();
+ht.create = (e, t) => new Kr(e, t);
 function rn(e, t, n) {
-  return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), yt(e, Ge(n), Ge(t));
+  return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), ht(e, Fe(n), Fe(t));
 }
-const _t = new Uint8Array([0]), $n = new Uint8Array();
-function mr(e, t, n, r = 32) {
+const Ut = new Uint8Array([0]), qn = new Uint8Array();
+function kr(e, t, n, r = 32) {
   if (se.hash(e), se.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 = $n);
-  const s = new Uint8Array(i * e.outputLen), o = yt.create(e, t), a = o._cloneInto(), c = new Uint8Array(o.outputLen);
+  n === void 0 && (n = qn);
+  const s = new Uint8Array(i * e.outputLen), o = ht.create(e, t), a = o._cloneInto(), c = new Uint8Array(o.outputLen);
   for (let l = 0; l < i; l++)
-    _t[0] = l + 1, a.update(l === 0 ? $n : c).update(n).update(_t).digestInto(c), s.set(c, e.outputLen * l), o._cloneInto(a);
-  return o.destroy(), a.destroy(), c.fill(0), _t.fill(0), s.slice(0, r);
+    Ut[0] = l + 1, a.update(l === 0 ? qn : c).update(n).update(Ut).digestInto(c), s.set(c, e.outputLen * l), o._cloneInto(a);
+  return o.destroy(), a.destroy(), c.fill(0), Ut.fill(0), s.slice(0, r);
 }
-var Ds = Object.defineProperty, D = (e, t) => {
+var to = Object.defineProperty, q = (e, t) => {
   for (var n in t)
-    Ds(e, n, { get: t[n], enumerable: !0 });
-}, $e = Symbol("verified"), js = (e) => e instanceof Object;
-function Er(e) {
-  if (!js(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))
+    to(e, n, { get: t[n], enumerable: !0 });
+}, Re = Symbol("verified"), no = (e) => e instanceof Object;
+function sn(e) {
+  if (!no(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];
@@ -2345,32 +2345,32 @@ function Er(e) {
   }
   return !0;
 }
-var Vs = {};
-D(Vs, {
-  Queue: () => Ws,
-  QueueNode: () => xr,
-  binarySearch: () => sn,
-  insertEventIntoAscendingList: () => Fs,
-  insertEventIntoDescendingList: () => Zs,
-  normalizeURL: () => zs,
-  utf8Decoder: () => ie,
-  utf8Encoder: () => te
+var ro = {};
+q(ro, {
+  Queue: () => ao,
+  QueueNode: () => Br,
+  binarySearch: () => on,
+  insertEventIntoAscendingList: () => oo,
+  insertEventIntoDescendingList: () => so,
+  normalizeURL: () => io,
+  utf8Decoder: () => ue,
+  utf8Encoder: () => ne
 });
-var ie = new TextDecoder("utf-8"), te = new TextEncoder();
-function zs(e) {
+var ue = new TextDecoder("utf-8"), ne = new TextEncoder();
+function io(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 Zs(e, t) {
-  const [n, r] = sn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
+function so(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 Fs(e, t) {
-  const [n, r] = sn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
+function oo(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 sn(e, t) {
+function on(e, t) {
   let n = 0, r = e.length - 1;
   for (; n <= r; ) {
     const i = Math.floor((n + r) / 2), s = t(e[i]);
@@ -2380,21 +2380,21 @@ function sn(e, t) {
   }
   return [n, !1];
 }
-var xr = class {
+var Br = class {
   constructor(e) {
-    ee(this, "value");
-    ee(this, "next", null);
-    ee(this, "prev", null);
+    te(this, "value");
+    te(this, "next", null);
+    te(this, "prev", null);
     this.value = e;
   }
-}, Ws = class {
+}, ao = class {
   constructor() {
-    ee(this, "first");
-    ee(this, "last");
+    te(this, "first");
+    te(this, "last");
     this.first = null, this.last = null;
   }
   enqueue(e) {
-    const t = new xr(e);
+    const t = new Br(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() {
@@ -2407,155 +2407,163 @@ var xr = class {
     const e = this.first;
     return this.first = e.next, e.value;
   }
-}, Gs = class {
+}, co = class {
   generateSecretKey() {
-    return Ze.utils.randomPrivateKey();
+    return We.utils.randomPrivateKey();
   }
   getPublicKey(e) {
-    return M(Ze.getPublicKey(e));
+    return M(We.getPublicKey(e));
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = M(Ze.getPublicKey(t)), n.id = tt(n), n.sig = M(Ze.sign(tt(n), t)), n[$e] = !0, n;
+    return n.pubkey = M(We.getPublicKey(t)), n.id = Qe(n), n.sig = M(We.sign(Qe(n), t)), n[Re] = !0, n;
   }
   verifyEvent(e) {
-    if (typeof e[$e] == "boolean")
-      return e[$e];
-    const t = tt(e);
+    if (typeof e[Re] == "boolean")
+      return e[Re];
+    const t = Qe(e);
     if (t !== e.id)
-      return e[$e] = !1, !1;
+      return e[Re] = !1, !1;
     try {
-      const n = Ze.verify(e.sig, t, e.pubkey);
-      return e[$e] = n, n;
+      const n = We.verify(e.sig, t, e.pubkey);
+      return e[Re] = n, n;
     } catch {
-      return e[$e] = !1, !1;
+      return e[Re] = !1, !1;
     }
   }
 };
-function Js(e) {
-  if (!Er(e))
+function uo(e) {
+  if (!sn(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 tt(e) {
-  let t = Se(te.encode(Js(e)));
+function Qe(e) {
+  let t = fe(ne.encode(uo(e)));
   return M(t);
 }
-var pt = new Gs(), Me = pt.generateSecretKey, Ce = pt.getPublicKey, ae = pt.finalizeEvent, gt = pt.verifyEvent, Ys = {};
-D(Ys, {
-  Application: () => Xo,
-  BadgeAward: () => oo,
-  BadgeDefinition: () => zo,
-  BlockedRelaysList: () => Uo,
-  BookmarkList: () => Bo,
-  Bookmarksets: () => Do,
-  Calendar: () => sa,
-  CalendarEventRSVP: () => oa,
-  ChannelCreation: () => Br,
-  ChannelHideMessage: () => Ur,
-  ChannelMessage: () => kr,
-  ChannelMetadata: () => Cr,
-  ChannelMuteUser: () => Ir,
-  ClassifiedListing: () => ta,
-  ClientAuth: () => _r,
-  CommunitiesList: () => Co,
-  CommunityDefinition: () => la,
-  CommunityPostApproval: () => go,
-  Contacts: () => no,
-  CreateOrUpdateProduct: () => Wo,
-  CreateOrUpdateStall: () => Fo,
-  Curationsets: () => jo,
-  Date: () => ra,
-  DraftClassifiedListing: () => na,
-  DraftLong: () => Jo,
-  Emojisets: () => Yo,
-  EncryptedDirectMessage: () => ro,
-  EncryptedDirectMessages: () => io,
-  EventDeletion: () => so,
-  FileMetadata: () => lo,
-  FileServerPreference: () => To,
-  Followsets: () => Mo,
-  GenericRepost: () => ao,
-  Genericlists: () => Ho,
-  HTTPAuth: () => cn,
-  Handlerinformation: () => ca,
-  Handlerrecommendation: () => aa,
-  Highlights: () => So,
-  InterestsList: () => _o,
-  Interestsets: () => Zo,
-  JobFeedback: () => vo,
-  JobRequest: () => wo,
-  JobResult: () => bo,
-  Label: () => po,
-  LightningPubRPC: () => Ro,
-  LiveChatMessage: () => uo,
-  LiveEvent: () => Qo,
-  LongFormArticle: () => Go,
-  Metadata: () => Qs,
-  Mutelist: () => Ao,
-  NWCWalletInfo: () => $o,
-  NWCWalletRequest: () => Lr,
-  NWCWalletResponse: () => Oo,
-  NostrConnect: () => Po,
-  OpenTimestamps: () => co,
-  Pinlist: () => Ko,
-  ProblemTracker: () => fo,
-  ProfileBadges: () => Vo,
-  PublicChatsList: () => ko,
-  Reaction: () => an,
-  RecommendRelay: () => to,
-  RelayList: () => No,
-  Relaysets: () => qo,
-  Report: () => ho,
-  Reporting: () => yo,
-  Repost: () => on,
-  SearchRelaysList: () => Io,
-  ShortTextNote: () => eo,
-  Time: () => ia,
-  UserEmojiList: () => Lo,
-  UserStatuses: () => ea,
-  Zap: () => xo,
-  ZapGoal: () => mo,
-  ZapRequest: () => Eo,
-  classifyKind: () => Xs,
-  isEphemeralKind: () => Kr,
-  isParameterizedReplaceableKind: () => Nr,
-  isRegularKind: () => Sr,
-  isReplaceableKind: () => Ar
+var dt = new co(), Ce = dt.generateSecretKey, le = dt.getPublicKey, X = dt.finalizeEvent, pt = dt.verifyEvent, lo = {};
+q(lo, {
+  Application: () => da,
+  BadgeAward: () => mo,
+  BadgeDefinition: () => oa,
+  BlockedRelaysList: () => zo,
+  BookmarkList: () => qo,
+  Bookmarksets: () => ra,
+  Calendar: () => ma,
+  CalendarEventRSVP: () => Ea,
+  ChannelCreation: () => $r,
+  ChannelHideMessage: () => Or,
+  ChannelMessage: () => Rr,
+  ChannelMetadata: () => Tr,
+  ChannelMuteUser: () => Mr,
+  ClassifiedListing: () => ga,
+  ClientAuth: () => Pr,
+  CommunitiesList: () => Do,
+  CommunityDefinition: () => Aa,
+  CommunityPostApproval: () => Uo,
+  Contacts: () => wo,
+  CreateOrUpdateProduct: () => ua,
+  CreateOrUpdateStall: () => ca,
+  Curationsets: () => ia,
+  Date: () => ba,
+  DirectMessageRelaysList: () => Go,
+  DraftClassifiedListing: () => wa,
+  DraftLong: () => fa,
+  Emojisets: () => ha,
+  EncryptedDirectMessage: () => bo,
+  EventDeletion: () => vo,
+  FileMetadata: () => Ao,
+  FileServerPreference: () => Fo,
+  Followsets: () => ea,
+  GenericRepost: () => xo,
+  Genericlists: () => ta,
+  GiftWrap: () => Hr,
+  HTTPAuth: () => un,
+  Handlerinformation: () => Sa,
+  Handlerrecommendation: () => xa,
+  Highlights: () => Oo,
+  InterestsList: () => Wo,
+  Interestsets: () => aa,
+  JobFeedback: () => Lo,
+  JobRequest: () => _o,
+  JobResult: () => Io,
+  Label: () => Co,
+  LightningPubRPC: () => Yo,
+  LiveChatMessage: () => No,
+  LiveEvent: () => pa,
+  LongFormArticle: () => la,
+  Metadata: () => po,
+  Mutelist: () => Mo,
+  NWCWalletInfo: () => Jo,
+  NWCWalletRequest: () => qr,
+  NWCWalletResponse: () => Xo,
+  NostrConnect: () => Qo,
+  OpenTimestamps: () => So,
+  Pinlist: () => Ho,
+  PrivateDirectMessage: () => Eo,
+  ProblemTracker: () => Ko,
+  ProfileBadges: () => sa,
+  PublicChatsList: () => jo,
+  Reaction: () => cn,
+  RecommendRelay: () => go,
+  RelayList: () => Po,
+  Relaysets: () => na,
+  Report: () => ko,
+  Reporting: () => Bo,
+  Repost: () => an,
+  Seal: () => Lr,
+  SearchRelaysList: () => Vo,
+  ShortTextNote: () => yo,
+  Time: () => va,
+  UserEmojiList: () => Zo,
+  UserStatuses: () => ya,
+  Zap: () => Ro,
+  ZapGoal: () => $o,
+  ZapRequest: () => To,
+  classifyKind: () => fo,
+  isEphemeralKind: () => _r,
+  isKind: () => ho,
+  isParameterizedReplaceableKind: () => Ir,
+  isRegularKind: () => Cr,
+  isReplaceableKind: () => Ur
 });
-function Sr(e) {
+function Cr(e) {
   return 1e3 <= e && e < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(e);
 }
-function Ar(e) {
+function Ur(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
-function Kr(e) {
+function _r(e) {
   return 2e4 <= e && e < 3e4;
 }
-function Nr(e) {
+function Ir(e) {
   return 3e4 <= e && e < 4e4;
 }
-function Xs(e) {
-  return Sr(e) ? "regular" : Ar(e) ? "replaceable" : Kr(e) ? "ephemeral" : Nr(e) ? "parameterized" : "unknown";
+function fo(e) {
+  return Cr(e) ? "regular" : Ur(e) ? "replaceable" : _r(e) ? "ephemeral" : Ir(e) ? "parameterized" : "unknown";
 }
-var Qs = 0, eo = 1, to = 2, no = 3, ro = 4, io = 4, so = 5, on = 6, an = 7, oo = 8, ao = 16, Br = 40, Cr = 41, kr = 42, Ur = 43, Ir = 44, co = 1040, lo = 1063, uo = 1311, fo = 1971, ho = 1984, yo = 1984, po = 1985, go = 4550, wo = 5999, bo = 6999, vo = 7e3, mo = 9041, Eo = 9734, xo = 9735, So = 9802, Ao = 1e4, Ko = 10001, No = 10002, Bo = 10003, Co = 10004, ko = 10005, Uo = 10006, Io = 10007, _o = 10015, Lo = 10030, To = 10096, $o = 13194, Ro = 21e3, _r = 22242, Lr = 23194, Oo = 23195, Po = 24133, cn = 27235, Mo = 3e4, Ho = 30001, qo = 30002, Do = 30003, jo = 30004, Vo = 30008, zo = 30009, Zo = 30015, Fo = 30017, Wo = 30018, Go = 30023, Jo = 30024, Yo = 30030, Xo = 30078, Qo = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, sa = 31924, oa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
-D(ua, {
+function ho(e, t) {
+  const n = t instanceof Array ? t : [t];
+  return sn(e) && n.includes(e.kind) || !1;
+}
+var po = 0, yo = 1, go = 2, wo = 3, bo = 4, vo = 5, an = 6, cn = 7, mo = 8, Lr = 13, Eo = 14, xo = 16, $r = 40, Tr = 41, Rr = 42, Or = 43, Mr = 44, So = 1040, Hr = 1059, Ao = 1063, No = 1311, Ko = 1971, ko = 1984, Bo = 1984, Co = 1985, Uo = 4550, _o = 5999, Io = 6999, Lo = 7e3, $o = 9041, To = 9734, Ro = 9735, Oo = 9802, Mo = 1e4, Ho = 10001, Po = 10002, qo = 10003, Do = 10004, jo = 10005, zo = 10006, Vo = 10007, Wo = 10015, Zo = 10030, Go = 10050, Fo = 10096, Jo = 13194, Yo = 21e3, Pr = 22242, qr = 23194, Xo = 23195, Qo = 24133, un = 27235, ea = 3e4, ta = 30001, na = 30002, ra = 30003, ia = 30004, sa = 30008, oa = 30009, aa = 30015, ca = 30017, ua = 30018, la = 30023, fa = 30024, ha = 30030, da = 30078, pa = 30311, ya = 30315, ga = 30402, wa = 30403, ba = 31922, va = 31923, ma = 31924, Ea = 31925, xa = 31989, Sa = 31990, Aa = 34550, Na = {};
+q(Na, {
   getHex64: () => ln,
-  getInt: () => Tr,
-  getSubscriptionId: () => fa,
-  matchEventId: () => ha,
-  matchEventKind: () => ya,
-  matchEventPubkey: () => da
+  getInt: () => Dr,
+  getSubscriptionId: () => Ka,
+  matchEventId: () => ka,
+  matchEventKind: () => Ca,
+  matchEventPubkey: () => Ba
 });
 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) {
+function Dr(e, t) {
   let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), s = Math.min(i.indexOf(","), i.indexOf("}"));
   return parseInt(i.slice(0, s), 10);
 }
-function fa(e) {
+function Ka(e) {
   let t = e.slice(0, 22).indexOf('"EVENT"');
   if (t === -1)
     return null;
@@ -2568,22 +2576,22 @@ function fa(e) {
   let s = r + 1 + i;
   return e.slice(r + 1, s);
 }
-function ha(e, t) {
+function ka(e, t) {
   return t === ln(e, "id");
 }
-function da(e, t) {
+function Ba(e, t) {
   return t === ln(e, "pubkey");
 }
-function ya(e, t) {
-  return t === Tr(e, "kind");
+function Ca(e, t) {
+  return t === Dr(e, "kind");
 }
-var pa = {};
-D(pa, {
-  makeAuthEvent: () => ga
+var Ua = {};
+q(Ua, {
+  makeAuthEvent: () => _a
 });
-function ga(e, t) {
+function _a(e, t) {
   return {
-    kind: _r,
+    kind: Pr,
     created_at: Math.floor(Date.now() / 1e3),
     tags: [
       ["relay", e],
@@ -2592,104 +2600,103 @@ function ga(e, t) {
     content: ""
   };
 }
-var wa;
+var Ia;
 try {
-  wa = WebSocket;
+  Ia = WebSocket;
 } catch {
 }
-var ba;
+var La;
 try {
-  ba = WebSocket;
+  La = WebSocket;
 } catch {
 }
-var va = {};
-D(va, {
-  BECH32_REGEX: () => $r,
-  Bech32MaxSize: () => un,
-  decode: () => wt,
-  encodeBytes: () => bt,
-  naddrEncode: () => Na,
-  neventEncode: () => Ka,
-  noteEncode: () => Sa,
-  nprofileEncode: () => Aa,
-  npubEncode: () => xa,
-  nrelayEncode: () => Ba,
-  nsecEncode: () => Ea
+var $a = {};
+q($a, {
+  BECH32_REGEX: () => jr,
+  Bech32MaxSize: () => fn,
+  NostrTypeGuard: () => Ta,
+  decode: () => yt,
+  encodeBytes: () => wt,
+  naddrEncode: () => Da,
+  neventEncode: () => qa,
+  noteEncode: () => Ha,
+  nprofileEncode: () => Pa,
+  npubEncode: () => Ma,
+  nsecEncode: () => Oa
 });
-var un = 5e3, $r = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
-function ma(e) {
+var Ta = {
+  isNProfile: (e) => /^nprofile1[a-z\d]+$/.test(e || ""),
+  isNEvent: (e) => /^nevent1[a-z\d]+$/.test(e || ""),
+  isNAddr: (e) => /^naddr1[a-z\d]+$/.test(e || ""),
+  isNSec: (e) => /^nsec1[a-z\d]{58}$/.test(e || ""),
+  isNPub: (e) => /^npub1[a-z\d]{58}$/.test(e || ""),
+  isNote: (e) => /^note1[a-z\d]+$/.test(e || ""),
+  isNcryptsec: (e) => /^ncryptsec1[a-z\d]+$/.test(e || "")
+}, fn = 5e3, jr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
+function Ra(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 wt(e) {
-  var i, s, o, a, c, l, f, u;
-  let { prefix: t, words: n } = je.decode(e, un), r = new Uint8Array(je.fromWords(n));
+function yt(e) {
+  var i, s, o, a, c, l, f;
+  let { prefix: t, words: n } = je.decode(e, fn), r = new Uint8Array(je.fromWords(n));
   switch (t) {
     case "nprofile": {
-      let d = Qe(r);
-      if (!((i = d[0]) != null && i[0]))
+      let u = _t(r);
+      if (!((i = u[0]) != null && i[0]))
         throw new Error("missing TLV 0 for nprofile");
-      if (d[0][0].length !== 32)
+      if (u[0][0].length !== 32)
         throw new Error("TLV 0 should be 32 bytes");
       return {
         type: "nprofile",
         data: {
-          pubkey: M(d[0][0]),
-          relays: d[1] ? d[1].map((p) => ie.decode(p)) : []
+          pubkey: M(u[0][0]),
+          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
         }
       };
     }
     case "nevent": {
-      let d = Qe(r);
-      if (!((s = d[0]) != null && s[0]))
+      let u = _t(r);
+      if (!((s = u[0]) != null && s[0]))
         throw new Error("missing TLV 0 for nevent");
-      if (d[0][0].length !== 32)
+      if (u[0][0].length !== 32)
         throw new Error("TLV 0 should be 32 bytes");
-      if (d[2] && d[2][0].length !== 32)
+      if (u[2] && u[2][0].length !== 32)
         throw new Error("TLV 2 should be 32 bytes");
-      if (d[3] && d[3][0].length !== 4)
+      if (u[3] && u[3][0].length !== 4)
         throw new Error("TLV 3 should be 4 bytes");
       return {
         type: "nevent",
         data: {
-          id: M(d[0][0]),
-          relays: d[1] ? d[1].map((p) => ie.decode(p)) : [],
-          author: (o = d[2]) != null && o[0] ? M(d[2][0]) : void 0,
-          kind: (a = d[3]) != null && a[0] ? parseInt(M(d[3][0]), 16) : void 0
+          id: M(u[0][0]),
+          relays: u[1] ? u[1].map((g) => ue.decode(g)) : [],
+          author: (o = u[2]) != null && o[0] ? M(u[2][0]) : void 0,
+          kind: (a = u[3]) != null && a[0] ? parseInt(M(u[3][0]), 16) : void 0
         }
       };
     }
     case "naddr": {
-      let d = Qe(r);
-      if (!((c = d[0]) != null && c[0]))
+      let u = _t(r);
+      if (!((c = u[0]) != null && c[0]))
         throw new Error("missing TLV 0 for naddr");
-      if (!((l = d[2]) != null && l[0]))
+      if (!((l = u[2]) != null && l[0]))
         throw new Error("missing TLV 2 for naddr");
-      if (d[2][0].length !== 32)
+      if (u[2][0].length !== 32)
         throw new Error("TLV 2 should be 32 bytes");
-      if (!((f = d[3]) != null && f[0]))
+      if (!((f = u[3]) != null && f[0]))
         throw new Error("missing TLV 3 for naddr");
-      if (d[3][0].length !== 4)
+      if (u[3][0].length !== 4)
         throw new Error("TLV 3 should be 4 bytes");
       return {
         type: "naddr",
         data: {
-          identifier: ie.decode(d[0][0]),
-          pubkey: M(d[2][0]),
-          kind: parseInt(M(d[3][0]), 16),
-          relays: d[1] ? d[1].map((p) => ie.decode(p)) : []
+          identifier: ue.decode(u[0][0]),
+          pubkey: M(u[2][0]),
+          kind: parseInt(M(u[3][0]), 16),
+          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
         }
       };
     }
-    case "nrelay": {
-      let d = Qe(r);
-      if (!((u = d[0]) != null && u[0]))
-        throw new Error("missing TLV 0 for nrelay");
-      return {
-        type: "nrelay",
-        data: ie.decode(d[0][0])
-      };
-    }
     case "nsec":
       return { type: t, data: r };
     case "npub":
@@ -2699,7 +2706,7 @@ function wt(e) {
       throw new Error(`unknown prefix ${t}`);
   }
 }
-function Qe(e) {
+function _t(e) {
   let t = {}, n = e;
   for (; n.length > 0; ) {
     let r = n[0], i = n[1], s = n.slice(2, 2 + i);
@@ -2709,227 +2716,258 @@ function Qe(e) {
   }
   return t;
 }
-function Ea(e) {
-  return bt("nsec", e);
+function Oa(e) {
+  return wt("nsec", e);
 }
-function xa(e) {
-  return bt("npub", W(e));
+function Ma(e) {
+  return wt("npub", G(e));
 }
-function Sa(e) {
-  return bt("note", W(e));
+function Ha(e) {
+  return wt("note", G(e));
 }
-function Ye(e, t) {
+function gt(e, t) {
   let n = je.toWords(t);
-  return je.encode(e, n, un);
+  return je.encode(e, n, fn);
 }
-function bt(e, t) {
-  return Ye(e, t);
+function wt(e, t) {
+  return gt(e, t);
 }
-function Aa(e) {
-  let t = vt({
-    0: [W(e.pubkey)],
-    1: (e.relays || []).map((n) => te.encode(n))
+function Pa(e) {
+  let t = hn({
+    0: [G(e.pubkey)],
+    1: (e.relays || []).map((n) => ne.encode(n))
   });
-  return Ye("nprofile", t);
+  return gt("nprofile", t);
 }
-function Ka(e) {
+function qa(e) {
   let t;
-  e.kind !== void 0 && (t = ma(e.kind));
-  let n = vt({
-    0: [W(e.id)],
-    1: (e.relays || []).map((r) => te.encode(r)),
-    2: e.author ? [W(e.author)] : [],
+  e.kind !== void 0 && (t = Ra(e.kind));
+  let n = hn({
+    0: [G(e.id)],
+    1: (e.relays || []).map((r) => ne.encode(r)),
+    2: e.author ? [G(e.author)] : [],
     3: t ? [new Uint8Array(t)] : []
   });
-  return Ye("nevent", n);
+  return gt("nevent", n);
 }
-function Na(e) {
+function Da(e) {
   let t = new ArrayBuffer(4);
   new DataView(t).setUint32(0, e.kind, !1);
-  let n = vt({
-    0: [te.encode(e.identifier)],
-    1: (e.relays || []).map((r) => te.encode(r)),
-    2: [W(e.pubkey)],
+  let n = hn({
+    0: [ne.encode(e.identifier)],
+    1: (e.relays || []).map((r) => ne.encode(r)),
+    2: [G(e.pubkey)],
     3: [new Uint8Array(t)]
   });
-  return Ye("naddr", n);
+  return gt("naddr", n);
 }
-function Ba(e) {
-  let t = vt({
-    0: [te.encode(e)]
-  });
-  return Ye("nrelay", t);
-}
-function vt(e) {
+function hn(e) {
   let t = [];
   return Object.entries(e).reverse().forEach(([n, r]) => {
     r.forEach((i) => {
       let s = new Uint8Array(i.length + 2);
       s.set([parseInt(n)], 0), s.set([i.length], 1), s.set(i, 2), t.push(s);
     });
-  }), ht(...t);
+  }), lt(...t);
 }
-var Ca = {};
-D(Ca, {
-  decrypt: () => ka,
-  encrypt: () => Rr
+var ja = {};
+q(ja, {
+  decrypt: () => za,
+  encrypt: () => zr
 });
-async function Rr(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e, i = Ue.getSharedSecret(r, "02" + t), s = Or(i);
-  let o = Uint8Array.from(ir(16)), a = te.encode(n), c = yr(s, o).encrypt(a), l = ue.encode(new Uint8Array(c)), f = ue.encode(new Uint8Array(o.buffer));
+async function zr(e, t, n) {
+  const r = e instanceof Uint8Array ? M(e) : e, i = _e.getSharedSecret(r, "02" + t), s = Vr(i);
+  let o = Uint8Array.from(fr(16)), a = ne.encode(n), c = Er(s, o).encrypt(a), l = he.encode(new Uint8Array(c)), f = he.encode(new Uint8Array(o.buffer));
   return `${l}?iv=${f}`;
 }
-async function ka(e, t, n) {
+async function za(e, t, n) {
   const r = e instanceof Uint8Array ? M(e) : e;
-  let [i, s] = n.split("?iv="), o = Ue.getSharedSecret(r, "02" + t), a = Or(o), c = ue.decode(s), l = ue.decode(i), f = yr(a, c).decrypt(l);
-  return ie.decode(f);
+  let [i, s] = n.split("?iv="), o = _e.getSharedSecret(r, "02" + t), a = Vr(o), c = he.decode(s), l = he.decode(i), f = Er(a, c).decrypt(l);
+  return ue.decode(f);
 }
-function Or(e) {
+function Vr(e) {
   return e.slice(1, 33);
 }
-var Ua = {};
-D(Ua, {
-  NIP05_REGEX: () => Pr,
-  isValid: () => La,
-  queryProfile: () => Mr,
-  searchDomain: () => _a,
-  useFetchImplementation: () => Ia
+var Va = {};
+q(Va, {
+  NIP05_REGEX: () => dn,
+  isNip05: () => Wa,
+  isValid: () => Fa,
+  queryProfile: () => Wr,
+  searchDomain: () => Ga,
+  useFetchImplementation: () => Za
 });
-var Pr = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, mt;
+var dn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Wa = (e) => dn.test(e || ""), bt;
 try {
-  mt = fetch;
+  bt = fetch;
 } catch {
 }
-function Ia(e) {
-  mt = e;
+function Za(e) {
+  bt = e;
 }
-async function _a(e, t = "") {
+async function Ga(e, t = "") {
   try {
-    const n = `https://${e}/.well-known/nostr.json?name=${t}`;
-    return (await (await mt(n, { redirect: "error" })).json()).names;
+    const n = `https://${e}/.well-known/nostr.json?name=${t}`, r = await bt(n, { redirect: "manual" });
+    if (r.status !== 200)
+      throw Error("Wrong response code");
+    return (await r.json()).names;
   } catch {
     return {};
   }
 }
-async function Mr(e) {
-  var s;
-  const t = e.match(Pr);
+async function Wr(e) {
+  var i;
+  const t = e.match(dn);
   if (!t)
     return null;
-  const [n, r = "_", i] = t;
+  const [, n = "_", r] = t;
   try {
-    const o = `https://${i}/.well-known/nostr.json?name=${r}`, a = await (await mt(o, { redirect: "error" })).json();
-    let c = a.names[r];
-    return c ? { pubkey: c, relays: (s = a.relays) == null ? void 0 : s[c] } : null;
+    const s = `https://${r}/.well-known/nostr.json?name=${n}`, o = await bt(s, { redirect: "manual" });
+    if (o.status !== 200)
+      throw Error("Wrong response code");
+    const a = await o.json(), c = a.names[n];
+    return c ? { pubkey: c, relays: (i = a.relays) == null ? void 0 : i[c] } : null;
   } catch {
     return null;
   }
 }
-async function La(e, t) {
-  let n = await Mr(t);
+async function Fa(e, t) {
+  const n = await Wr(t);
   return n ? n.pubkey === e : !1;
 }
-var Ta = {};
-D(Ta, {
-  parse: () => $a
+var Ja = {};
+q(Ja, {
+  parse: () => Ya
 });
-function $a(e) {
+function Ya(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], [s, o, a, c] = i, l = {
-      id: o,
-      relays: a ? [a] : []
-    }, f = r === 0, u = r === n.length - 1;
-    if (c === "root") {
-      t.root = l;
-      continue;
-    }
-    if (c === "reply") {
-      t.reply = l;
-      continue;
-    }
-    if (c === "mention") {
-      t.mentions.push(l);
+    profiles: [],
+    quotes: []
+  };
+  let n, r;
+  for (let i = e.tags.length - 1; i >= 0; i--) {
+    const s = e.tags[i];
+    if (s[0] === "e" && s[1]) {
+      const [o, a, c, l, f] = s, u = {
+        id: a,
+        relays: c ? [c] : [],
+        author: f
+      };
+      if (l === "root") {
+        t.root = u;
+        continue;
+      }
+      if (l === "reply") {
+        t.reply = u;
+        continue;
+      }
+      if (l === "mention") {
+        t.mentions.push(u);
+        continue;
+      }
+      n ? r = u : n = u, t.mentions.push(u);
       continue;
     }
-    if (f) {
-      t.root = l;
-      continue;
+    if (s[0] === "q" && s[1]) {
+      const [o, a, c] = s;
+      t.quotes.push({
+        id: a,
+        relays: c ? [c] : []
+      });
     }
-    if (u) {
-      t.reply = l;
+    if (s[0] === "p" && s[1]) {
+      t.profiles.push({
+        pubkey: s[1],
+        relays: s[2] ? [s[2]] : []
+      });
       continue;
     }
-    t.mentions.push(l);
   }
-  return t;
+  return t.root || (t.root = r || n || t.reply), t.reply || (t.reply = n || t.root), [t.reply, t.root].forEach((i) => {
+    if (!i)
+      return;
+    let s = t.mentions.indexOf(i);
+    if (s !== -1 && t.mentions.splice(s, 1), i.author) {
+      let o = t.profiles.find((a) => a.pubkey === i.author);
+      o && o.relays && (i.relays || (i.relays = []), o.relays.forEach((a) => {
+        var c;
+        ((c = i.relays) == null ? void 0 : c.indexOf(a)) === -1 && i.relays.push(a);
+      }), o.relays = i.relays);
+    }
+  }), t.mentions.forEach((i) => {
+    if (i.author) {
+      let s = t.profiles.find((o) => o.pubkey === i.author);
+      s && s.relays && (i.relays || (i.relays = []), s.relays.forEach((o) => {
+        i.relays.indexOf(o) === -1 && i.relays.push(o);
+      }), s.relays = i.relays);
+    }
+  }), t;
 }
-var Ra = {};
-D(Ra, {
-  fetchRelayInformation: () => Pa,
-  useFetchImplementation: () => Oa
+var Xa = {};
+q(Xa, {
+  fetchRelayInformation: () => ec,
+  useFetchImplementation: () => Qa
 });
-var Hr;
+var Zr;
 try {
-  Hr = fetch;
+  Zr = fetch;
 } catch {
 }
-function Oa(e) {
-  Hr = e;
+function Qa(e) {
+  Zr = e;
 }
-async function Pa(e) {
+async function ec(e) {
   return await (await fetch(e.replace("ws://", "http://").replace("wss://", "https://"), {
     headers: { Accept: "application/nostr+json" }
   })).json();
 }
-var Ma = {};
-D(Ma, {
-  getPow: () => qr,
-  minePow: () => Ha
+var tc = {};
+q(tc, {
+  fastEventHash: () => Fr,
+  getPow: () => Gr,
+  minePow: () => nc
 });
-function qr(e) {
+function Gr(e) {
   let t = 0;
-  for (let n = 0; n < e.length; n++) {
-    const r = parseInt(e[n], 16);
+  for (let n = 0; n < 64; n += 8) {
+    const r = parseInt(e.substring(n, n + 8), 16);
     if (r === 0)
-      t += 4;
+      t += 32;
     else {
-      t += Math.clz32(r) - 28;
+      t += Math.clz32(r);
       break;
     }
   }
   return t;
 }
-function Ha(e, t) {
+function nc(e, t) {
   let n = 0;
   const r = e, i = ["nonce", n.toString(), t.toString()];
   for (r.tags.push(i); ; ) {
     const s = Math.floor((/* @__PURE__ */ new Date()).getTime() / 1e3);
-    if (s !== r.created_at && (n = 0, r.created_at = s), i[1] = (++n).toString(), r.id = tt(r), qr(r.id) >= t)
+    if (s !== r.created_at && (n = 0, r.created_at = s), i[1] = (++n).toString(), r.id = Fr(r), Gr(r.id) >= t)
       break;
   }
   return r;
 }
-var qa = {};
-D(qa, {
-  finishRepostEvent: () => Da,
-  getRepostedEvent: () => ja,
-  getRepostedEventPointer: () => Dr
+function Fr(e) {
+  return M(
+    fe(ne.encode(JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content])))
+  );
+}
+var rc = {};
+q(rc, {
+  finishRepostEvent: () => ic,
+  getRepostedEvent: () => sc,
+  getRepostedEventPointer: () => Jr
 });
-function Da(e, t, n, r) {
-  return ae(
+function ic(e, t, n, r) {
+  return X(
     {
-      kind: on,
+      kind: an,
       tags: [...e.tags ?? [], ["e", t.id, n], ["p", t.pubkey]],
       content: e.content === "" ? "" : JSON.stringify(t),
       created_at: e.created_at
@@ -2937,8 +2975,8 @@ function Da(e, t, n, r) {
     r
   );
 }
-function Dr(e) {
-  if (e.kind !== on)
+function Jr(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--) {
@@ -2952,8 +2990,8 @@ function Dr(e) {
       author: n == null ? void 0 : n[1]
     };
 }
-function ja(e, { skipVerification: t } = {}) {
-  const n = Dr(e);
+function sc(e, { skipVerification: t } = {}) {
+  const n = Jr(e);
   if (n === void 0 || e.content === "")
     return;
   let r;
@@ -2962,48 +3000,48 @@ function ja(e, { skipVerification: t } = {}) {
   } catch {
     return;
   }
-  if (r.id === n.id && !(!t && !gt(r)))
+  if (r.id === n.id && !(!t && !pt(r)))
     return r;
 }
-var Va = {};
-D(Va, {
-  NOSTR_URI_REGEX: () => Et,
-  parse: () => Za,
-  test: () => za
+var oc = {};
+q(oc, {
+  NOSTR_URI_REGEX: () => vt,
+  parse: () => cc,
+  test: () => ac
 });
-var Et = new RegExp(`nostr:(${$r.source})`);
-function za(e) {
-  return typeof e == "string" && new RegExp(`^${Et.source}$`).test(e);
+var vt = new RegExp(`nostr:(${jr.source})`);
+function ac(e) {
+  return typeof e == "string" && new RegExp(`^${vt.source}$`).test(e);
 }
-function Za(e) {
-  const t = e.match(new RegExp(`^${Et.source}$`));
+function cc(e) {
+  const t = e.match(new RegExp(`^${vt.source}$`));
   if (!t)
     throw new Error(`Invalid Nostr URI: ${e}`);
   return {
     uri: t[0],
     value: t[1],
-    decoded: wt(t[1])
+    decoded: yt(t[1])
   };
 }
-var Fa = {};
-D(Fa, {
-  finishReactionEvent: () => Wa,
-  getReactedEventPointer: () => Ga
+var uc = {};
+q(uc, {
+  finishReactionEvent: () => lc,
+  getReactedEventPointer: () => fc
 });
-function Wa(e, t, n) {
+function lc(e, t, n) {
   const r = t.tags.filter((i) => i.length >= 2 && (i[0] === "e" || i[0] === "p"));
-  return ae(
+  return X(
     {
       ...e,
-      kind: an,
+      kind: cn,
       tags: [...e.tags ?? [], ...r, ["e", t.id], ["p", t.pubkey]],
       content: e.content ?? "+"
     },
     n
   );
 }
-function Ga(e) {
-  if (e.kind !== an)
+function fc(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--) {
@@ -3017,44 +3055,44 @@ function Ga(e) {
       author: n[1]
     };
 }
-var Ja = {};
-D(Ja, {
-  matchAll: () => Ya,
-  regex: () => fn,
-  replaceAll: () => Xa
+var hc = {};
+q(hc, {
+  matchAll: () => dc,
+  regex: () => pn,
+  replaceAll: () => pc
 });
-var fn = () => new RegExp(`\\b${Et.source}\\b`, "g");
-function* Ya(e) {
-  const t = e.matchAll(fn());
+var pn = () => new RegExp(`\\b${vt.source}\\b`, "g");
+function* dc(e) {
+  const t = e.matchAll(pn());
   for (const n of t)
     try {
       const [r, i] = n;
       yield {
         uri: r,
         value: i,
-        decoded: wt(i),
+        decoded: yt(i),
         start: n.index,
         end: n.index + r.length
       };
     } catch {
     }
 }
-function Xa(e, t) {
-  return e.replaceAll(fn(), (n, r) => t({
+function pc(e, t) {
+  return e.replaceAll(pn(), (n, r) => t({
     uri: n,
     value: r,
-    decoded: wt(r)
+    decoded: yt(r)
   }));
 }
-var Qa = {};
-D(Qa, {
-  channelCreateEvent: () => ec,
-  channelHideMessageEvent: () => rc,
-  channelMessageEvent: () => nc,
-  channelMetadataEvent: () => tc,
-  channelMuteUserEvent: () => ic
+var yc = {};
+q(yc, {
+  channelCreateEvent: () => gc,
+  channelHideMessageEvent: () => vc,
+  channelMessageEvent: () => bc,
+  channelMetadataEvent: () => wc,
+  channelMuteUserEvent: () => mc
 });
-var ec = (e, t) => {
+var gc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3062,16 +3100,16 @@ var ec = (e, t) => {
     n = e.content;
   else
     return;
-  return ae(
+  return X(
     {
-      kind: Br,
+      kind: $r,
       tags: [...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, tc = (e, t) => {
+}, wc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3079,27 +3117,27 @@ var ec = (e, t) => {
     n = e.content;
   else
     return;
-  return ae(
+  return X(
     {
-      kind: Cr,
+      kind: Tr,
       tags: [["e", e.channel_create_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, nc = (e, t) => {
+}, bc = (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"]), ae(
+  return e.reply_to_channel_message_event_id && n.push(["e", e.reply_to_channel_message_event_id, e.relay_url, "reply"]), X(
     {
-      kind: kr,
+      kind: Rr,
       tags: [...n, ...e.tags ?? []],
       content: e.content,
       created_at: e.created_at
     },
     t
   );
-}, rc = (e, t) => {
+}, vc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3107,16 +3145,16 @@ var ec = (e, t) => {
     n = e.content;
   else
     return;
-  return ae(
+  return X(
     {
-      kind: Ur,
+      kind: Or,
       tags: [["e", e.channel_message_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, ic = (e, t) => {
+}, mc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3124,25 +3162,25 @@ var ec = (e, t) => {
     n = e.content;
   else
     return;
-  return ae(
+  return X(
     {
-      kind: Ir,
+      kind: Mr,
       tags: [["p", e.pubkey_to_mute], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, sc = {};
-D(sc, {
-  EMOJI_SHORTCODE_REGEX: () => jr,
-  matchAll: () => oc,
-  regex: () => hn,
-  replaceAll: () => ac
+}, Ec = {};
+q(Ec, {
+  EMOJI_SHORTCODE_REGEX: () => Yr,
+  matchAll: () => xc,
+  regex: () => yn,
+  replaceAll: () => Sc
 });
-var jr = /:(\w+):/, hn = () => new RegExp(`\\B${jr.source}\\B`, "g");
-function* oc(e) {
-  const t = e.matchAll(hn());
+var Yr = /:(\w+):/, yn = () => new RegExp(`\\B${Yr.source}\\B`, "g");
+function* xc(e) {
+  const t = e.matchAll(yn());
   for (const n of t)
     try {
       const [r, i] = n;
@@ -3155,53 +3193,53 @@ function* oc(e) {
     } catch {
     }
 }
-function ac(e, t) {
-  return e.replaceAll(hn(), (n, r) => t({
+function Sc(e, t) {
+  return e.replaceAll(yn(), (n, r) => t({
     shortcode: n,
     name: r
   }));
 }
-var cc = {};
-D(cc, {
-  useFetchImplementation: () => lc,
-  validateGithub: () => uc
+var Ac = {};
+q(Ac, {
+  useFetchImplementation: () => Nc,
+  validateGithub: () => Kc
 });
-var dn;
+var gn;
 try {
-  dn = fetch;
+  gn = fetch;
 } catch {
 }
-function lc(e) {
-  dn = e;
+function Nc(e) {
+  gn = e;
 }
-async function uc(e, t, n) {
+async function Kc(e, t, n) {
   try {
-    return await (await dn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
+    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 j = {};
-D(j, {
-  decrypt: () => Jr,
-  encrypt: () => Gr,
-  getConversationKey: () => Zr,
-  v2: () => pc
+q(j, {
+  decrypt: () => mn,
+  encrypt: () => vn,
+  getConversationKey: () => wn,
+  v2: () => _c
 });
-var Vr = 1, zr = 65535;
-function Zr(e, t) {
-  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return rn(Se, n, "nip44-v2");
+var Xr = 1, Qr = 65535;
+function wn(e, t) {
+  const n = _e.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return rn(fe, n, "nip44-v2");
 }
-function Fr(e, t) {
-  const n = mr(Se, e, t, 76);
+function ei(e, t) {
+  const n = kr(fe, e, t, 76);
   return {
     chacha_key: n.subarray(0, 32),
     chacha_nonce: n.subarray(32, 44),
     hmac_key: n.subarray(44, 76)
   };
 }
-function yn(e) {
+function bn(e) {
   if (!Number.isSafeInteger(e) || e < 1)
     throw new Error("expected positive integer");
   if (e <= 32)
@@ -3209,29 +3247,29 @@ function yn(e) {
   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 fc(e) {
-  if (!Number.isSafeInteger(e) || e < Vr || e > zr)
+function kc(e) {
+  if (!Number.isSafeInteger(e) || e < Xr || e > Qr)
     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 hc(e) {
-  const t = te.encode(e), n = t.length, r = fc(n), i = new Uint8Array(yn(n) - n);
-  return ht(r, t, i);
+function Bc(e) {
+  const t = ne.encode(e), n = t.length, r = kc(n), i = new Uint8Array(bn(n) - n);
+  return lt(r, t, i);
 }
-function dc(e) {
+function Cc(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 + yn(t))
+  if (t < Xr || t > Qr || n.length !== t || e.length !== 2 + bn(t))
     throw new Error("invalid padding");
-  return ie.decode(n);
+  return ue.decode(n);
 }
-function Wr(e, t, n) {
+function ti(e, t, n) {
   if (n.length !== 32)
     throw new Error("AAD associated data must be 32 bytes");
-  const r = ht(n, t);
-  return yt(Se, e, r);
+  const r = lt(n, t);
+  return ht(fe, e, r);
 }
-function yc(e) {
+function Uc(e) {
   if (typeof e != "string")
     throw new Error("payload must be a valid string");
   const t = e.length;
@@ -3241,7 +3279,7 @@ function yc(e) {
     throw new Error("unknown encryption version");
   let n;
   try {
-    n = ue.decode(e);
+    n = he.decode(e);
   } catch (s) {
     throw new Error("invalid base64: " + s.message);
   }
@@ -3257,84 +3295,84 @@ function yc(e) {
     mac: n.subarray(-32)
   };
 }
-function Gr(e, t, n = ir(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = Fr(t, n), o = hc(e), a = br(r, i, o), c = Wr(s, a, n);
-  return ue.encode(ht(new Uint8Array([2]), n, a, c));
+function vn(e, t, n = fr(32)) {
+  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ei(t, n), o = Bc(e), a = Nr(r, i, o), c = ti(s, a, n);
+  return he.encode(lt(new Uint8Array([2]), n, a, c));
 }
-function Jr(e, t) {
-  const { nonce: n, ciphertext: r, mac: i } = yc(e), { chacha_key: s, chacha_nonce: o, hmac_key: a } = Fr(t, n), c = Wr(a, r, n);
-  if (!Ss(c, i))
+function mn(e, t) {
+  const { nonce: n, ciphertext: r, mac: i } = Uc(e), { chacha_key: s, chacha_nonce: o, hmac_key: a } = ei(t, n), c = ti(a, r, n);
+  if (!Rs(c, i))
     throw new Error("invalid MAC");
-  const l = br(s, o, r);
-  return dc(l);
+  const l = Nr(s, o, r);
+  return Cc(l);
 }
-var pc = {
+var _c = {
   utils: {
-    getConversationKey: Zr,
-    calcPaddedLen: yn
+    getConversationKey: wn,
+    calcPaddedLen: bn
   },
-  encrypt: Gr,
-  decrypt: Jr
-}, gc = {};
-D(gc, {
-  makeNwcRequestEvent: () => bc,
-  parseConnectionString: () => wc
+  encrypt: vn,
+  decrypt: mn
+}, Ic = {};
+q(Ic, {
+  makeNwcRequestEvent: () => $c,
+  parseConnectionString: () => Lc
 });
-function wc(e) {
+function Lc(e) {
   const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), s = n.get("secret");
   if (!r || !i || !s)
     throw new Error("invalid connection string");
   return { pubkey: r, relay: i, secret: s };
 }
-async function bc(e, t, n) {
-  const i = await Rr(t, e, JSON.stringify({
+async function $c(e, t, n) {
+  const i = await zr(t, e, JSON.stringify({
     method: "pay_invoice",
     params: {
       invoice: n
     }
   })), s = {
-    kind: Lr,
+    kind: qr,
     created_at: Math.round(Date.now() / 1e3),
     content: i,
     tags: [["p", e]]
   };
-  return ae(s, t);
-}
-var vc = {};
-D(vc, {
-  getZapEndpoint: () => Ec,
-  makeZapReceipt: () => Ac,
-  makeZapRequest: () => xc,
-  useFetchImplementation: () => mc,
-  validateZapRequest: () => Sc
+  return X(s, t);
+}
+var Tc = {};
+q(Tc, {
+  getZapEndpoint: () => Oc,
+  makeZapReceipt: () => Pc,
+  makeZapRequest: () => Mc,
+  useFetchImplementation: () => Rc,
+  validateZapRequest: () => Hc
 });
-var pn;
+var En;
 try {
-  pn = fetch;
+  En = fetch;
 } catch {
 }
-function mc(e) {
-  pn = e;
+function Rc(e) {
+  En = e;
 }
-async function Ec(e) {
+async function Oc(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
       let { words: o } = je.decode(n, 1e3), a = je.fromWords(o);
-      t = ie.decode(a);
+      t = ue.decode(a);
     } else if (r) {
       let [o, a] = r.split("@");
       t = new URL(`/.well-known/lnurlp/${o}`, `https://${a}`).toString();
     } else
       return null;
-    let s = await (await pn(t)).json();
+    let s = await (await En(t)).json();
     if (s.allowsNostr && s.nostrPubkey)
       return s.callback;
   } catch {
   }
   return null;
 }
-function xc({
+function Mc({
   profile: e,
   event: t,
   amount: n,
@@ -3357,16 +3395,16 @@ function xc({
   };
   return t && s.tags.push(["e", t]), s;
 }
-function Sc(e) {
+function Hc(e) {
   let t;
   try {
     t = JSON.parse(e);
   } catch {
     return "Invalid zap request JSON.";
   }
-  if (!Er(t))
+  if (!sn(t))
     return "Zap request is not a valid Nostr event.";
-  if (!gt(t))
+  if (!pt(t))
     return "Invalid signature on zap request.";
   let n = t.tags.find(([s, o]) => s === "p" && o);
   if (!n)
@@ -3376,7 +3414,7 @@ function Sc(e) {
   let r = t.tags.find(([s, o]) => s === "e" && o);
   return r && !r[1].match(/^[a-f0-9]{64}$/) ? "Zap request 'e' tag is not valid hex." : t.tags.find(([s, o]) => s === "relays" && o) ? null : "Zap request doesn't have a 'relays' tag.";
 }
-function Ac({
+function Pc({
   zapRequest: e,
   preimage: t,
   bolt11: n,
@@ -3390,23 +3428,89 @@ function Ac({
   };
   return t && o.tags.push(["preimage", t]), o;
 }
-var Kc = {};
-D(Kc, {
-  getToken: () => Nc,
-  hashPayload: () => gn,
-  unpackEventFromToken: () => Xr,
-  validateEvent: () => ii,
-  validateEventKind: () => ei,
-  validateEventMethodTag: () => ni,
-  validateEventPayloadTag: () => ri,
-  validateEventTimestamp: () => Qr,
-  validateEventUrlTag: () => ti,
-  validateToken: () => Bc
+var qc = {};
+q(qc, {
+  createRumor: () => oi,
+  createSeal: () => ai,
+  createWrap: () => ci,
+  unwrapEvent: () => ui,
+  unwrapManyEvents: () => zc,
+  wrapEvent: () => Vt,
+  wrapManyEvents: () => jc
 });
-var Yr = "Nostr ";
-async function Nc(e, t, n, r = !1, i) {
+var Dc = 2 * 24 * 60 * 60, ni = () => Math.round(Date.now() / 1e3), ri = () => Math.round(ni() - Math.random() * Dc), ii = (e, t) => wn(e, t), si = (e, t, n) => vn(JSON.stringify(e), ii(t, n)), Dn = (e, t) => JSON.parse(mn(e.content, ii(t, e.pubkey)));
+function oi(e, t) {
+  const n = {
+    created_at: ni(),
+    content: "",
+    tags: [],
+    ...e,
+    pubkey: le(t)
+  };
+  return n.id = Qe(n), n;
+}
+function ai(e, t, n) {
+  return X(
+    {
+      kind: Lr,
+      content: si(e, t, n),
+      created_at: ri(),
+      tags: []
+    },
+    t
+  );
+}
+function ci(e, t) {
+  const n = Ce();
+  return X(
+    {
+      kind: Hr,
+      content: si(e, n, t),
+      created_at: ri(),
+      tags: [["p", t]]
+    },
+    n
+  );
+}
+function Vt(e, t, n) {
+  const r = oi(e, t), i = ai(r, t, n);
+  return ci(i, n);
+}
+function jc(e, t, n) {
+  if (!n || n.length === 0)
+    throw new Error("At least one recipient is required.");
+  const r = le(t), i = [Vt(e, t, r)];
+  return n.forEach((s) => {
+    i.push(Vt(e, t, s));
+  }), i;
+}
+function ui(e, t) {
+  const n = Dn(e, t);
+  return Dn(n, t);
+}
+function zc(e, t) {
+  let n = [];
+  return e.forEach((r) => {
+    n.push(ui(r, t));
+  }), n.sort((r, i) => r.created_at - i.created_at), n;
+}
+var Vc = {};
+q(Vc, {
+  getToken: () => Wc,
+  hashPayload: () => xn,
+  unpackEventFromToken: () => fi,
+  validateEvent: () => wi,
+  validateEventKind: () => di,
+  validateEventMethodTag: () => yi,
+  validateEventPayloadTag: () => gi,
+  validateEventTimestamp: () => hi,
+  validateEventUrlTag: () => pi,
+  validateToken: () => Zc
+});
+var li = "Nostr ";
+async function Wc(e, t, n, r = !1, i) {
   const s = {
-    kind: cn,
+    kind: un,
     tags: [
       ["u", e],
       ["method", t]
@@ -3414,70 +3518,70 @@ async function Nc(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && s.tags.push(["payload", gn(i)]);
+  i && s.tags.push(["payload", xn(i)]);
   const o = await n(s);
-  return (r ? Yr : "") + ue.encode(te.encode(JSON.stringify(o)));
+  return (r ? li : "") + he.encode(ne.encode(JSON.stringify(o)));
 }
-async function Bc(e, t, n) {
-  const r = await Xr(e).catch((s) => {
+async function Zc(e, t, n) {
+  const r = await fi(e).catch((s) => {
     throw s;
   });
-  return await ii(r, t, n).catch((s) => {
+  return await wi(r, t, n).catch((s) => {
     throw s;
   });
 }
-async function Xr(e) {
+async function fi(e) {
   if (!e)
     throw new Error("Missing token");
-  e = e.replace(Yr, "");
-  const t = ie.decode(ue.decode(e));
+  e = e.replace(li, "");
+  const t = ue.decode(he.decode(e));
   if (!t || t.length === 0 || !t.startsWith("{"))
     throw new Error("Invalid token");
   return JSON.parse(t);
 }
-function Qr(e) {
+function hi(e) {
   return e.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - e.created_at < 60 : !1;
 }
-function ei(e) {
-  return e.kind === cn;
+function di(e) {
+  return e.kind === un;
 }
-function ti(e, t) {
+function pi(e, t) {
   const n = e.tags.find((r) => r[0] === "u");
   return n ? n.length > 0 && n[1] === t : !1;
 }
-function ni(e, t) {
+function yi(e, t) {
   const n = e.tags.find((r) => r[0] === "method");
   return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
 }
-function gn(e) {
-  const t = Se(te.encode(JSON.stringify(e)));
+function xn(e) {
+  const t = fe(ne.encode(JSON.stringify(e)));
   return M(t);
 }
-function ri(e, t) {
+function gi(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
   if (!n)
     return !1;
-  const r = gn(t);
+  const r = xn(t);
   return n.length > 0 && n[1] === r;
 }
-async function ii(e, t, n, r) {
-  if (!gt(e))
+async function wi(e, t, n, r) {
+  if (!pt(e))
     throw new Error("Invalid nostr event, signature invalid");
-  if (!ei(e))
+  if (!di(e))
     throw new Error("Invalid nostr event, kind invalid");
-  if (!Qr(e))
+  if (!hi(e))
     throw new Error("Invalid nostr event, created_at timestamp invalid");
-  if (!ti(e, t))
+  if (!pi(e, t))
     throw new Error("Invalid nostr event, url tag invalid");
-  if (!ni(e, n))
+  if (!yi(e, n))
     throw new Error("Invalid nostr event, method tag invalid");
-  if (r && typeof r == "object" && Object.keys(r).length > 0 && !ri(e, r))
+  if (r && typeof r == "object" && Object.keys(r).length > 0 && !gi(e, r))
     throw new Error("Invalid nostr event, payload tag does not match request body hash");
   return !0;
 }
-const He = 4, Rn = 30078, Rc = 100;
-var Cc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Cc || {});
-function Oc(e) {
+const Pe = 4, jn = 30078, nu = 100;
+var Gc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Gc || {});
+function ru(e) {
   return JSON.stringify({
     rootKey: M(e.rootKey),
     theirNostrPublicKey: e.theirNostrPublicKey,
@@ -3508,39 +3612,39 @@ function Oc(e) {
     )
   });
 }
-function Pc(e) {
+function iu(e) {
   const t = JSON.parse(e);
   return {
-    rootKey: W(t.rootKey),
+    rootKey: G(t.rootKey),
     theirNostrPublicKey: t.theirNostrPublicKey,
     ourCurrentNostrKey: t.ourCurrentNostrKey ? {
       publicKey: t.ourCurrentNostrKey.publicKey,
-      privateKey: W(t.ourCurrentNostrKey.privateKey)
+      privateKey: G(t.ourCurrentNostrKey.privateKey)
     } : void 0,
     ourNextNostrKey: {
       publicKey: t.ourNextNostrKey.publicKey,
-      privateKey: W(t.ourNextNostrKey.privateKey)
+      privateKey: G(t.ourNextNostrKey.privateKey)
     },
-    receivingChainKey: t.receivingChainKey ? W(t.receivingChainKey) : void 0,
-    sendingChainKey: t.sendingChainKey ? W(t.sendingChainKey) : void 0,
+    receivingChainKey: t.receivingChainKey ? G(t.receivingChainKey) : void 0,
+    sendingChainKey: t.sendingChainKey ? G(t.sendingChainKey) : void 0,
     sendingChainMessageNumber: t.sendingChainMessageNumber,
     receivingChainMessageNumber: t.receivingChainMessageNumber,
     previousSendingChainMessageCount: t.previousSendingChainMessageCount,
     skippedMessageKeys: Object.fromEntries(
       Object.entries(t.skippedMessageKeys).map(([n, r]) => [
         n,
-        W(r)
+        G(r)
       ])
     ),
     skippedHeaderKeys: Object.fromEntries(
       Object.entries(t.skippedHeaderKeys || {}).map(([n, r]) => [
         n,
-        r.map((i) => W(i))
+        r.map((i) => G(i))
       ])
     )
   };
 }
-async function* Mc(e) {
+async function* su(e) {
   const t = [];
   let n = null;
   const r = e.onMessage((i) => {
@@ -3555,41 +3659,41 @@ async function* Mc(e) {
     r();
   }
 }
-function Re(e, t = new Uint8Array(32), n = 1) {
-  const r = rn(Se, e, t), i = [];
+function Oe(e, t = new Uint8Array(32), n = 1) {
+  const r = rn(fe, e, t), i = [];
   for (let s = 1; s <= n; s++)
-    i.push(mr(Se, r, new Uint8Array([s]), 32));
+    i.push(kr(fe, r, new Uint8Array([s]), 32));
   return i;
 }
-function Lt(e, t) {
+function It(e, t) {
   return `${e}:${t}`;
 }
-const kc = 1e3;
-class at {
+const Fc = 1e3;
+class st {
   // 1. CHANNEL PUBLIC INTERFACE
   constructor(t, n) {
-    ee(this, "nostrUnsubscribe");
-    ee(this, "nostrNextUnsubscribe");
-    ee(this, "internalSubscriptions", /* @__PURE__ */ new Map());
-    ee(this, "currentInternalSubscriptionId", 0);
-    ee(this, "name");
+    te(this, "nostrUnsubscribe");
+    te(this, "nostrNextUnsubscribe");
+    te(this, "internalSubscriptions", /* @__PURE__ */ new Map());
+    te(this, "currentInternalSubscriptionId", 0);
+    te(this, "name");
     this.nostrSubscribe = t, this.state = n, this.name = Math.random().toString(36).substring(2, 6);
   }
   /**
-   * Initializes a new secure communication channel
+   * Initializes a new secure communication session
    * @param nostrSubscribe Function to subscribe to Nostr events
    * @param theirNostrPublicKey The public key of the other party
    * @param ourCurrentPrivateKey Our current private key for Nostr
    * @param isInitiator Whether we are initiating the conversation (true) or responding (false)
    * @param sharedSecret Initial shared secret for securing the first message chain
-   * @param name Optional name for the channel (for debugging)
-   * @returns A new Channel instance
+   * @param name Optional name for the session (for debugging)
+   * @returns A new Session instance
    */
   static init(t, n, r, i, s, o) {
-    const a = Me(), [c, l] = Re(s, j.getConversationKey(a, n), 2);
+    const a = Ce(), [c, l] = Oe(s, j.getConversationKey(a, n), 2);
     let f, u;
-    i ? (f = { publicKey: Ce(r), privateKey: r }, u = { publicKey: Ce(a), privateKey: a }) : u = { publicKey: Ce(r), privateKey: r };
-    const d = {
+    i ? (f = { publicKey: le(r), privateKey: r }, u = { publicKey: le(a), privateKey: a }) : u = { publicKey: le(r), privateKey: r };
+    const g = {
       rootKey: i ? c : s,
       theirNostrPublicKey: n,
       ourCurrentNostrKey: f,
@@ -3601,11 +3705,11 @@ class at {
       previousSendingChainMessageCount: 0,
       skippedMessageKeys: {},
       skippedHeaderKeys: {}
-    }, p = new at(t, d);
-    return o && (p.name = o), p;
+    }, b = new st(t, g);
+    return o && (b.name = o), b;
   }
   /**
-   * Sends an encrypted message through the channel
+   * Sends an encrypted message through the session
    * @param data The plaintext message to send
    * @returns A verified Nostr event containing the encrypted message
    * @throws Error if we are not the initiator and trying to send the first message
@@ -3614,15 +3718,15 @@ class at {
     if (!this.state.theirNostrPublicKey || !this.state.ourCurrentNostrKey)
       throw new Error("we are not the initiator, so we can't send the first message");
     const [n, r] = this.ratchetEncrypt(t), i = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNostrPublicKey), s = j.encrypt(JSON.stringify(n), i);
-    return ae({
+    return X({
       content: r,
-      kind: He,
+      kind: Pe,
       tags: [["header", s]],
       created_at: Math.floor(Date.now() / 1e3)
     }, this.state.ourCurrentNostrKey.privateKey);
   }
   /**
-   * Subscribes to incoming messages on this channel
+   * Subscribes to incoming messages on this session
    * @param callback Function to be called when a message is received
    * @returns Unsubscribe function to stop receiving messages
    */
@@ -3639,7 +3743,7 @@ class at {
   }
   // 2. RATCHET FUNCTIONS
   ratchetEncrypt(t) {
-    const [n, r] = Re(this.state.sendingChainKey, new Uint8Array([1]), 2);
+    const [n, r] = Oe(this.state.sendingChainKey, new Uint8Array([1]), 2);
     return this.state.sendingChainKey = n, [{
       number: this.state.sendingChainMessageNumber++,
       nextPublicKey: this.state.ourNextNostrKey.publicKey,
@@ -3651,7 +3755,7 @@ class at {
     const i = this.trySkippedMessageKeys(t, n, r);
     if (i) return i;
     this.skipMessageKeys(t.number, r);
-    const [s, o] = Re(this.state.receivingChainKey, new Uint8Array([1]), 2);
+    const [s, o] = Oe(this.state.receivingChainKey, new Uint8Array([1]), 2);
     this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++;
     try {
       return j.decrypt(n, o);
@@ -3666,24 +3770,24 @@ class at {
   }
   ratchetStep(t) {
     this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.theirNostrPublicKey = t;
-    const n = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [r, i] = Re(this.state.rootKey, n, 2);
+    const n = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [r, i] = Oe(this.state.rootKey, n, 2);
     this.state.receivingChainKey = i, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
-    const s = Me();
+    const s = Ce();
     this.state.ourNextNostrKey = {
-      publicKey: Ce(s),
+      publicKey: le(s),
       privateKey: s
     };
-    const o = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [a, c] = Re(r, o, 2);
+    const o = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [a, c] = Oe(r, o, 2);
     this.state.rootKey = a, this.state.sendingChainKey = c;
   }
   // 3. MESSAGE KEY FUNCTIONS
   skipMessageKeys(t, n) {
-    if (this.state.receivingChainMessageNumber + kc < t)
+    if (this.state.receivingChainMessageNumber + Fc < t)
       throw new Error("Too many skipped messages");
     for (; this.state.receivingChainMessageNumber < t; ) {
-      const [r, i] = Re(this.state.receivingChainKey, new Uint8Array([1]), 2);
+      const [r, i] = Oe(this.state.receivingChainKey, new Uint8Array([1]), 2);
       this.state.receivingChainKey = r;
-      const s = Lt(n, this.state.receivingChainMessageNumber);
+      const s = It(n, this.state.receivingChainMessageNumber);
       if (this.state.skippedMessageKeys[s] = i, !this.state.skippedHeaderKeys[n]) {
         const o = [];
         if (this.state.ourCurrentNostrKey) {
@@ -3698,7 +3802,7 @@ class at {
   }
   trySkippedMessageKeys(t, n, r) {
     var s;
-    const i = Lt(r, t.number);
+    const i = It(r, t.number);
     if (i in this.state.skippedMessageKeys) {
       const o = this.state.skippedMessageKeys[i];
       return delete this.state.skippedMessageKeys[i], Object.keys(this.state.skippedMessageKeys).some((c) => c.startsWith(`${r}:`)) || (delete this.state.skippedHeaderKeys[r], (s = this.nostrUnsubscribe) == null || s.call(this), this.nostrUnsubscribe = void 0), j.decrypt(n, o);
@@ -3734,10 +3838,10 @@ class at {
     const [n, r, i] = this.decryptHeader(t);
     if (!i)
       this.state.theirNostrPublicKey !== n.nextPublicKey && (this.state.theirNostrPublicKey = n.nextPublicKey, (o = this.nostrUnsubscribe) == null || o.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
-        { authors: [this.state.theirNostrPublicKey], kinds: [He] },
+        { authors: [this.state.theirNostrPublicKey], kinds: [Pe] },
         (a) => this.handleNostrEvent(a)
       )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey));
-    else if (!(Lt(t.pubkey, n.number) in this.state.skippedMessageKeys))
+    else if (!(It(t.pubkey, n.number) in this.state.skippedMessageKeys))
       return;
     const s = this.ratchetDecrypt(n, t.content, t.pubkey);
     this.internalSubscriptions.forEach((a) => a({ id: t.id, data: s, pubkey: n.nextPublicKey, time: n.time }));
@@ -3745,29 +3849,31 @@ class at {
   subscribeToNostrEvents() {
     if (this.nostrNextUnsubscribe) return;
     this.nostrNextUnsubscribe = this.nostrSubscribe(
-      { authors: [this.state.theirNostrPublicKey], kinds: [He] },
+      { authors: [this.state.theirNostrPublicKey], kinds: [Pe] },
       (n) => this.handleNostrEvent(n)
     );
     const t = Object.keys(this.state.skippedHeaderKeys);
     t.length > 0 && (this.nostrUnsubscribe = this.nostrSubscribe(
-      { authors: t, kinds: [He] },
+      { authors: t, kinds: [Pe] },
       (n) => this.handleNostrEvent(n)
     ));
   }
 }
 new TextDecoder("utf-8");
 new TextEncoder();
-function et(e, t) {
-  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return rn(Se, n, "nip44-v2");
+function Xe(e, t) {
+  const n = _e.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return rn(fe, n, "nip44-v2");
 }
-class Oe {
+class Me {
   constructor(t, n, r, i, s, o, a = []) {
     this.inviterSessionPublicKey = t, this.linkSecret = n, this.inviter = r, this.inviterSessionPrivateKey = i, this.label = s, this.maxUses = o, this.usedBy = a;
   }
   static createNew(t, n, r) {
-    const i = Me(), s = Ce(i), o = M(Me());
-    return new Oe(
+    if (!t)
+      throw new Error("Inviter public key is required");
+    const i = Ce(), s = le(i), o = M(Ce());
+    return new Me(
       s,
       o,
       t,
@@ -3790,7 +3896,7 @@ class Oe {
     const { inviter: o, sessionKey: a, linkSecret: c } = s;
     if (!o || !a || !c)
       throw new Error("Missing required fields (inviter, sessionKey, linkSecret) in invite data.");
-    return new Oe(
+    return new Me(
       a,
       c,
       o
@@ -3798,7 +3904,7 @@ class Oe {
   }
   static deserialize(t) {
     const n = JSON.parse(t);
-    return new Oe(
+    return new Me(
       n.inviterSessionPublicKey,
       n.linkSecret,
       n.inviter,
@@ -3812,36 +3918,35 @@ class Oe {
     var o, a;
     if (!t.sig)
       throw new Error("Event is not signed");
-    if (!gt(t))
+    if (!pt(t))
       throw new Error("Event signature is invalid");
     const { tags: n } = t, r = (o = n.find(([c]) => c === "sessionKey")) == null ? void 0 : o[1], i = (a = n.find(([c]) => c === "linkSecret")) == null ? void 0 : a[1], s = t.pubkey;
     if (!r || !i)
       throw new Error("Invalid invite event: missing session key or link secret");
-    return new Oe(
+    return new Me(
       r,
       i,
       s
     );
   }
-  static fromUser(t, n) {
-    const r = {
-      kinds: [Rn],
+  static fromUser(t, n, r) {
+    const i = {
+      kinds: [jn],
       authors: [t],
       limit: 1,
       "#d": ["nostr-double-ratchet/invite"]
     };
-    return new Promise((i) => {
-      const s = n(r, (o) => {
+    let s = 0;
+    return n(i, (a) => {
+      if (!(!a.created_at || a.created_at <= s)) {
+        s = a.created_at;
         try {
-          const a = Oe.fromEvent(o);
-          s(), i(a);
-        } catch {
-          s(), i(void 0);
+          const c = Me.fromEvent(a);
+          r(c);
+        } catch (c) {
+          console.error("Error processing invite:", c, "event:", a);
         }
-      });
-      setTimeout(() => {
-        s(), i(void 0);
-      }, 1e4);
+      }
     });
   }
   /**
@@ -3871,7 +3976,7 @@ class Oe {
   }
   getEvent() {
     return {
-      kind: Rn,
+      kind: jn,
       pubkey: this.inviter,
       content: "",
       created_at: Math.floor(Date.now() / 1e3),
@@ -3879,11 +3984,11 @@ class Oe {
     };
   }
   /**
-       * Called by the invitee. Accepts the invite and creates a new channel with the inviter.
+       * Called by the invitee. Accepts the invite and creates a new session 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
+       * @returns An object containing the new session and an event to be published
        * 
        * 1. Inner event: No signature, content encrypted with DH(inviter, invitee).
        *    Purpose: Authenticate invitee. Contains invitee session key.
@@ -3891,28 +3996,28 @@ class Oe {
        *    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.
+       * so the inviter can create the session on their side.
        */
   async accept(t, n, r) {
-    const i = Me(), s = Ce(i), o = this.inviter || this.inviterSessionPublicKey, a = W(this.linkSecret), c = at.init(t, this.inviterSessionPublicKey, i, !0, a, void 0), l = Me(), f = Ce(l), u = typeof r == "function" ? r : (g, h) => Promise.resolve(j.encrypt(g, et(r, h))), d = {
+    const i = Ce(), s = le(i), o = this.inviter || this.inviterSessionPublicKey, a = G(this.linkSecret), c = st.init(t, this.inviterSessionPublicKey, i, !0, a, void 0), l = Ce(), f = le(l), u = typeof r == "function" ? r : (p, h) => Promise.resolve(j.encrypt(p, Xe(r, h))), g = {
       pubkey: n,
       tags: [["secret", this.linkSecret]],
       content: await u(s, o),
       created_at: Math.floor(Date.now() / 1e3)
-    }, p = {
-      kind: He,
+    }, b = {
+      kind: Pe,
       pubkey: f,
-      content: j.encrypt(JSON.stringify(d), et(l, this.inviterSessionPublicKey)),
+      content: j.encrypt(JSON.stringify(g), Xe(l, this.inviterSessionPublicKey)),
       created_at: Math.floor(Date.now() / 1e3),
       tags: [["p", this.inviterSessionPublicKey]]
     };
-    return { channel: c, event: ae(p, l) };
+    return { session: c, event: X(b, l) };
   }
   listen(t, n, r) {
     if (!this.inviterSessionPrivateKey)
       throw new Error("Inviter session key is not available");
     const i = {
-      kinds: [He],
+      kinds: [Pe],
       "#p": [this.inviterSessionPublicKey]
     };
     return n(i, async (s) => {
@@ -3921,31 +4026,31 @@ class Oe {
           console.error("Invite has reached maximum number of uses");
           return;
         }
-        const o = await j.decrypt(s.content, et(this.inviterSessionPrivateKey, s.pubkey)), a = JSON.parse(o);
-        if (!a.tags || !a.tags.some(([g, h]) => g === "secret" && h === this.linkSecret)) {
+        const o = await j.decrypt(s.content, Xe(this.inviterSessionPrivateKey, s.pubkey)), a = JSON.parse(o);
+        if (!a.tags || !a.tags.some(([p, h]) => p === "secret" && h === this.linkSecret)) {
           console.error("Invalid secret from event", s);
           return;
         }
-        const c = typeof t == "function" ? t : (g, h) => Promise.resolve(j.decrypt(g, et(t, h))), l = a.pubkey;
+        const c = typeof t == "function" ? t : (p, h) => Promise.resolve(j.decrypt(p, Xe(t, h))), l = a.pubkey;
         this.usedBy.push(l);
-        const f = await c(a.content, l), u = W(this.linkSecret), d = s.id, p = at.init(n, f, this.inviterSessionPrivateKey, !1, u, d);
-        r(p, l);
+        const f = await c(a.content, l), u = G(this.linkSecret), g = s.id, b = st.init(n, f, this.inviterSessionPrivateKey, !1, u, g);
+        r(b, l);
       } catch (o) {
-        console.error("Error processing invite message:", o);
+        console.error("Error processing invite message:", o, "event", s);
       }
     });
   }
 }
 export {
-  at as Channel,
-  Rn as INVITE_EVENT_KIND,
-  Oe as Invite,
-  Rc as MAX_SKIP,
-  He as MESSAGE_EVENT_KIND,
-  Cc as Sender,
-  Mc as createMessageStream,
-  Pc as deserializeChannelState,
-  Re as kdf,
-  Oc as serializeChannelState,
-  Lt as skippedMessageIndexKey
+  jn as INVITE_EVENT_KIND,
+  Me as Invite,
+  nu as MAX_SKIP,
+  Pe as MESSAGE_EVENT_KIND,
+  Gc as Sender,
+  st as Session,
+  su as createMessageStream,
+  iu as deserializeSessionState,
+  Oe as kdf,
+  ru as serializeSessionState,
+  It as skippedMessageIndexKey
 };