nostr-double-ratchet 0.0.5 → 0.0.6

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

@@ -1,7 +1,7 @@
 var oi = Object.defineProperty;
 var si = (e, t, n) => t in e ? oi(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
 var ee = (e, t, n) => si(e, typeof t != "symbol" ? t + "" : t, n);
-function mn(e) {
+function En(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -14,7 +14,7 @@ function Pn(e, ...t) {
 function ai(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  mn(e.outputLen), mn(e.blockLen);
+  En(e.outputLen), En(e.blockLen);
 }
 function rt(e, t = !0) {
   if (e.destroyed)
@@ -28,9 +28,9 @@ function ci(e, t) {
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const At = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const St = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const On = (e) => e instanceof Uint8Array, St = (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;
+const On = (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)
   throw new Error("Non little-endian hardware is not supported");
 function ui(e) {
@@ -63,8 +63,8 @@ function hi(e) {
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function Hn(e = 32) {
-  if (At && typeof At.getRandomValues == "function")
-    return At.getRandomValues(new Uint8Array(e));
+  if (St && typeof St.getRandomValues == "function")
+    return St.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 function di(e, t, n, r) {
@@ -75,7 +75,7 @@ function di(e, t, n, r) {
 }
 let yi = class extends Mn {
   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 = St(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 = At(this.buffer);
   }
   update(t) {
     rt(this);
@@ -85,7 +85,7 @@ let yi = class extends Mn {
     for (let s = 0; s < o; ) {
       const c = Math.min(i - this.pos, o - s);
       if (c === i) {
-        const a = St(t);
+        const a = At(t);
         for (; i <= o - s; s += i)
           this.process(a, s);
         continue;
@@ -102,7 +102,7 @@ let yi = class extends Mn {
     for (let u = s; u < i; u++)
       n[u] = 0;
     di(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const c = St(t), a = this.outputLen;
+    const c = At(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = a / 4, f = this.get();
@@ -233,13 +233,13 @@ let bi = class extends yi {
 };
 const Lt = /* @__PURE__ */ hi(() => new bi());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const qn = BigInt(0), lt = BigInt(1), vi = BigInt(2), ut = (e) => e instanceof Uint8Array, mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const qn = BigInt(0), lt = BigInt(1), vi = BigInt(2), ut = (e) => e instanceof Uint8Array, Ei = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function He(e) {
   if (!ut(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += mi[e[n]];
+    t += Ei[e[n]];
   return t;
 }
 function Dn(e) {
@@ -280,7 +280,7 @@ function xe(e, t) {
 function Wt(e, t) {
   return xe(e, t).reverse();
 }
-function Ei(e) {
+function mi(e) {
   return qe(Dn(e));
 }
 function Z(e, t, n) {
@@ -317,12 +317,12 @@ function xi(e, t) {
       return !1;
   return !0;
 }
-function Ai(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 Si(e) {
+function Ai(e) {
   let t;
   for (t = 0; e > qn; e >>= lt, t += 1)
     ;
@@ -331,7 +331,7 @@ function Si(e) {
 function Ki(e, t) {
   return e >> BigInt(t) & lt;
 }
-const Bi = (e, t, n) => e | (n ? lt : qn) << BigInt(t), Gt = (e) => (vi << BigInt(e - 1)) - lt, Kt = (e) => new Uint8Array(e), En = (e) => Uint8Array.from(e);
+const Ni = (e, t, n) => e | (n ? lt : qn) << BigInt(t), Gt = (e) => (vi << BigInt(e - 1)) - lt, Kt = (e) => new Uint8Array(e), mn = (e) => Uint8Array.from(e);
 function jn(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -343,7 +343,7 @@ function jn(e, t, n) {
   const s = () => {
     r.fill(1), i.fill(0), o = 0;
   }, c = (...u) => n(i, r, ...u), a = (u = Kt()) => {
-    i = c(En([0]), u), r = c(), u.length !== 0 && (i = c(En([1]), u), r = c());
+    i = c(mn([0]), u), r = c(), u.length !== 0 && (i = c(mn([1]), u), r = c());
   }, l = () => {
     if (o++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
@@ -364,7 +364,7 @@ function jn(e, t, n) {
     return s(), p;
   };
 }
-const Ni = {
+const Bi = {
   bigint: (e) => typeof e == "bigint",
   function: (e) => typeof e == "function",
   boolean: (e) => typeof e == "boolean",
@@ -377,7 +377,7 @@ const Ni = {
 };
 function Je(e, t, n = {}) {
   const r = (i, o, s) => {
-    const c = Ni[o];
+    const c = Bi[o];
     if (typeof c != "function")
       throw new Error(`Invalid validator "${o}", expected function`);
     const a = e[i];
@@ -393,9 +393,9 @@ function Je(e, t, n = {}) {
 const Ci = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   bitGet: Ki,
-  bitLen: Si,
+  bitLen: Ai,
   bitMask: Gt,
-  bitSet: Bi,
+  bitSet: Ni,
   bytesToHex: He,
   bytesToNumberBE: G,
   bytesToNumberLE: Ft,
@@ -408,12 +408,12 @@ const Ci = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   numberToBytesBE: xe,
   numberToBytesLE: Wt,
   numberToHexUnpadded: Dn,
-  numberToVarBytesBE: Ei,
-  utf8ToBytes: Ai,
+  numberToVarBytesBE: mi,
+  utf8ToBytes: Si,
   validateObject: Je
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const j = BigInt(0), q = BigInt(1), Be = BigInt(2), Ii = BigInt(3), $t = BigInt(4), xn = BigInt(5), An = BigInt(8);
+const j = BigInt(0), q = BigInt(1), Ne = BigInt(2), Ii = BigInt(3), $t = BigInt(4), xn = BigInt(5), Sn = BigInt(8);
 BigInt(9);
 BigInt(16);
 function V(e, t) {
@@ -449,11 +449,11 @@ function Tt(e, t) {
   return V(i, t);
 }
 function ki(e) {
-  const t = (e - q) / Be;
+  const t = (e - q) / Ne;
   let n, r, i;
-  for (n = e - q, r = 0; n % Be === j; n /= Be, r++)
+  for (n = e - q, r = 0; n % Ne === j; n /= Ne, r++)
     ;
-  for (i = Be; i < e && Ui(i, t, e) !== e - q; i++)
+  for (i = Ne; i < e && Ui(i, t, e) !== e - q; i++)
     ;
   if (r === 1) {
     const s = (e + q) / $t;
@@ -464,7 +464,7 @@ function ki(e) {
       return f;
     };
   }
-  const o = (n + q) / Be;
+  const o = (n + q) / Ne;
   return function(c, a) {
     if (c.pow(a, t) === c.neg(c.ONE))
       throw new Error("Cannot find square root");
@@ -491,10 +491,10 @@ function _i(e) {
       return o;
     };
   }
-  if (e % An === xn) {
-    const t = (e - xn) / An;
+  if (e % Sn === xn) {
+    const t = (e - xn) / Sn;
     return function(r, i) {
-      const o = r.mul(i, Be), s = r.pow(o, t), c = r.mul(i, s), a = r.mul(r.mul(c, Be), s), l = r.mul(c, r.sub(a, r.ONE));
+      const o = r.mul(i, Ne), s = r.pow(o, t), c = r.mul(i, s), a = r.mul(r.mul(c, Ne), s), l = r.mul(c, r.sub(a, r.ONE));
       if (!r.eql(r.sqr(l), i))
         throw new Error("Cannot find square root");
       return l;
@@ -617,7 +617,7 @@ function Oi(e, t, n = !1) {
   return n ? Wt(c, i) : xe(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Mi = BigInt(0), Bt = BigInt(1);
+const Mi = BigInt(0), Nt = BigInt(1);
 function Hi(e, t) {
   const n = (i, o) => {
     const s = o.negate();
@@ -632,7 +632,7 @@ function Hi(e, t) {
     unsafeLadder(i, o) {
       let s = e.ZERO, c = i;
       for (; o > Mi; )
-        o & Bt && (s = s.add(c)), c = c.double(), o >>= Bt;
+        o & Nt && (s = s.add(c)), c = c.double(), o >>= Nt;
       return s;
     },
     /**
@@ -670,9 +670,9 @@ function Hi(e, t) {
       for (let g = 0; g < c; g++) {
         const h = g * a;
         let y = Number(s & u);
-        s >>= p, y > a && (y -= d, s += Bt);
-        const w = h, E = h + Math.abs(y) - 1, K = g % 2 !== 0, k = y < 0;
-        y === 0 ? f = f.add(n(K, o[w])) : l = l.add(n(k, o[E]));
+        s >>= p, y > a && (y -= d, s += Nt);
+        const w = h, m = h + Math.abs(y) - 1, K = g % 2 !== 0, k = y < 0;
+        y === 0 ? f = f.add(n(K, o[w])) : l = l.add(n(k, o[m]));
       }
       return { p: l, f };
     },
@@ -722,7 +722,7 @@ function qi(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
+const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Be = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -730,7 +730,7 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
     }
   },
   _parseInt(e) {
-    const { Err: t } = Ne;
+    const { Err: t } = Be;
     if (e.length < 2 || e[0] !== 2)
       throw new t("Invalid signature integer tag");
     const n = e[1], r = e.subarray(2, n + 2);
@@ -743,7 +743,7 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
     return { d: Di(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = Ne, n = typeof e == "string" ? ji(e) : e;
+    const { Err: t } = Be, n = typeof e == "string" ? ji(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -751,7 +751,7 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
       throw new t("Invalid signature tag");
     if (n[1] !== r - 2)
       throw new t("Invalid signature: incorrect length");
-    const { d: i, l: o } = Ne._parseInt(n.subarray(2)), { d: s, l: c } = Ne._parseInt(o);
+    const { d: i, l: o } = Be._parseInt(n.subarray(2)), { d: s, l: c } = Be._parseInt(o);
     if (c.length)
       throw new t("Invalid signature: left bytes after parsing");
     return { r: i, s };
@@ -765,7 +765,7 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
   }
 }, ce = BigInt(0), Y = BigInt(1);
 BigInt(2);
-const Sn = BigInt(3);
+const An = BigInt(3);
 BigInt(4);
 function zi(e) {
   const t = qi(e), { Fp: n } = t, r = t.toBytes || ((g, h, y) => {
@@ -776,8 +776,8 @@ function zi(e) {
     return { x: y, y: w };
   });
   function o(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);
+    const { a: h, b: y } = t, w = n.sqr(g), m = n.mul(w, g);
+    return n.add(n.add(m, n.mul(g, h)), y);
   }
   if (!n.eql(n.sqr(t.Gy), o(t.Gx)))
     throw new Error("bad generator point: equation left != right");
@@ -789,7 +789,7 @@ function zi(e) {
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
   function a(g) {
-    const { allowedPrivateKeyLengths: h, nByteLength: y, wrapPrivateKey: w, n: E } = t;
+    const { allowedPrivateKeyLengths: h, nByteLength: y, wrapPrivateKey: w, n: m } = t;
     if (h && typeof g != "bigint") {
       if (g instanceof Uint8Array && (g = He(g)), typeof g != "string" || !h.includes(g.length))
         throw new Error("Invalid key");
@@ -801,7 +801,7 @@ function zi(e) {
     } catch {
       throw new Error(`private key must be ${y} bytes, hex or bigint, not ${typeof g}`);
     }
-    return w && (K = V(K, E)), c(K), K;
+    return w && (K = V(K, m)), c(K), K;
   }
   const l = /* @__PURE__ */ new Map();
   function f(g) {
@@ -825,8 +825,8 @@ function zi(e) {
         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 m = (K) => n.eql(K, n.ZERO);
+      return m(y) && m(w) ? u.ZERO : new u(y, w, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -842,7 +842,7 @@ function zi(e) {
      */
     static normalizeZ(h) {
       const y = n.invertBatch(h.map((w) => w.pz));
-      return h.map((w, E) => w.toAffine(y[E])).map(u.fromAffine);
+      return h.map((w, m) => w.toAffine(y[m])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
@@ -870,8 +870,8 @@ function zi(e) {
       const { x: h, y } = this.toAffine();
       if (!n.isValid(h) || !n.isValid(y))
         throw new Error("bad point: x or y not FE");
-      const w = n.sqr(y), E = o(h);
-      if (!n.eql(w, E))
+      const w = n.sqr(y), m = o(h);
+      if (!n.eql(w, m))
         throw new Error("bad point: equation left != right");
       if (!this.isTorsionFree())
         throw new Error("bad point: not in prime-order subgroup");
@@ -887,8 +887,8 @@ function zi(e) {
      */
     equals(h) {
       f(h);
-      const { px: y, py: w, pz: E } = this, { px: K, py: k, pz: C } = h, m = n.eql(n.mul(y, C), n.mul(K, E)), x = n.eql(n.mul(w, C), n.mul(k, E));
-      return m && x;
+      const { px: y, py: w, pz: m } = this, { px: K, py: k, pz: C } = h, E = n.eql(n.mul(y, C), n.mul(K, m)), x = n.eql(n.mul(w, C), n.mul(k, m));
+      return E && x;
     }
     /**
      * Flips point to one corresponding to (x, -y) in Affine coordinates.
@@ -901,9 +901,9 @@ function zi(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, Sn), { px: E, py: K, pz: k } = this;
-      let C = n.ZERO, m = n.ZERO, x = n.ZERO, A = n.mul(E, E), O = n.mul(K, K), U = n.mul(k, k), B = n.mul(E, K);
-      return B = n.add(B, B), x = n.mul(E, k), x = n.add(x, x), C = n.mul(h, x), m = n.mul(w, U), m = n.add(C, m), C = n.sub(O, m), m = n.add(O, m), m = n.mul(C, m), C = n.mul(B, C), x = n.mul(w, x), U = n.mul(h, U), B = n.sub(A, U), B = n.mul(h, B), B = n.add(B, x), x = n.add(A, A), A = n.add(x, A), A = n.add(A, U), A = n.mul(A, B), m = n.add(m, A), U = n.mul(K, k), U = n.add(U, U), A = n.mul(U, B), C = n.sub(C, A), x = n.mul(U, O), x = n.add(x, x), x = n.add(x, x), new u(C, m, x);
+      const { a: h, b: y } = t, w = n.mul(y, An), { px: m, py: K, pz: k } = this;
+      let C = n.ZERO, E = n.ZERO, x = n.ZERO, S = n.mul(m, m), O = n.mul(K, K), U = n.mul(k, k), N = n.mul(m, K);
+      return N = n.add(N, N), x = n.mul(m, k), x = n.add(x, x), C = n.mul(h, x), E = n.mul(w, U), E = n.add(C, E), C = n.sub(O, E), E = n.add(O, E), E = n.mul(C, E), 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), E = n.add(E, S), U = n.mul(K, k), U = n.add(U, U), S = n.mul(U, N), C = n.sub(C, S), x = n.mul(U, O), x = n.add(x, x), x = n.add(x, x), new u(C, E, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function zi(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: y, py: w, pz: E } = this, { px: K, py: k, pz: C } = h;
-      let m = n.ZERO, x = n.ZERO, A = n.ZERO;
-      const O = t.a, U = n.mul(t.b, Sn);
-      let B = n.mul(y, K), T = n.mul(w, k), R = n.mul(E, C), H = n.add(y, w), b = n.add(K, k);
-      H = n.mul(H, b), b = n.add(B, T), H = n.sub(H, b), b = n.add(y, E);
+      const { px: y, py: w, pz: m } = this, { px: K, py: k, pz: C } = h;
+      let E = n.ZERO, x = n.ZERO, S = n.ZERO;
+      const O = t.a, U = n.mul(t.b, An);
+      let N = n.mul(y, K), T = n.mul(w, k), R = n.mul(m, C), H = n.add(y, w), b = n.add(K, k);
+      H = n.mul(H, b), b = n.add(N, T), H = n.sub(H, b), b = n.add(y, m);
       let v = n.add(K, C);
-      return b = n.mul(b, v), v = n.add(B, R), b = n.sub(b, v), v = n.add(w, E), m = n.add(k, C), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), A = n.mul(O, b), m = n.mul(U, R), A = n.add(m, A), m = n.sub(T, A), A = n.add(T, A), x = n.mul(m, A), T = n.add(B, B), T = n.add(T, B), R = n.mul(O, R), b = n.mul(U, b), T = n.add(T, R), R = n.sub(B, R), R = n.mul(O, R), b = n.add(b, R), B = n.mul(T, b), x = n.add(x, B), B = n.mul(v, b), m = n.mul(H, m), m = n.sub(m, B), B = n.mul(H, T), A = n.mul(v, A), A = n.add(A, B), new u(m, x, A);
+      return b = n.mul(b, v), v = n.add(N, R), b = n.sub(b, v), v = n.add(w, m), E = n.add(k, C), v = n.mul(v, E), E = n.add(T, R), v = n.sub(v, E), S = n.mul(O, b), E = n.mul(U, R), S = n.add(E, S), E = n.sub(T, S), S = n.add(T, S), x = n.mul(E, S), T = n.add(N, N), T = n.add(T, N), R = n.mul(O, R), b = n.mul(U, b), T = n.add(T, R), R = n.sub(N, R), R = n.mul(O, R), b = n.add(b, R), N = n.mul(T, b), x = n.add(x, N), N = n.mul(v, b), E = n.mul(H, E), E = n.sub(E, N), N = n.mul(H, T), S = n.mul(v, S), S = n.add(S, N), new u(E, x, S);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -927,8 +927,8 @@ function zi(e) {
     }
     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);
+        const w = n.invertBatch(y.map((m) => m.pz));
+        return y.map((m, K) => m.toAffine(w[K])).map(u.fromAffine);
       });
     }
     /**
@@ -945,10 +945,10 @@ function zi(e) {
       const { endo: w } = t;
       if (!w)
         return p.unsafeLadder(this, h);
-      let { k1neg: E, k1: K, k2neg: k, k2: C } = w.splitScalar(h), m = y, x = y, A = this;
+      let { k1neg: m, k1: K, k2neg: k, k2: C } = w.splitScalar(h), E = y, x = y, S = this;
       for (; K > ce || C > ce; )
-        K & Y && (m = m.add(A)), C & Y && (x = x.add(A)), A = A.double(), K >>= Y, C >>= Y;
-      return E && (m = m.negate()), k && (x = x.negate()), x = new u(n.mul(x.px, w.beta), x.py, x.pz), m.add(x);
+        K & Y && (E = E.add(S)), C & Y && (x = x.add(S)), S = S.double(), K >>= Y, C >>= Y;
+      return m && (E = E.negate()), k && (x = x.negate()), x = new u(n.mul(x.px, w.beta), x.py, x.pz), E.add(x);
     }
     /**
      * Constant time multiplication.
@@ -961,17 +961,17 @@ function zi(e) {
      */
     multiply(h) {
       c(h);
-      let y = h, w, E;
+      let y = h, w, m;
       const { endo: K } = t;
       if (K) {
-        const { k1neg: k, k1: C, k2neg: m, k2: x } = K.splitScalar(y);
-        let { p: A, f: O } = this.wNAF(C), { p: U, f: B } = this.wNAF(x);
-        A = p.constTimeNegate(k, A), U = p.constTimeNegate(m, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), w = A.add(U), E = O.add(B);
+        const { k1neg: k, k1: C, k2neg: E, k2: x } = K.splitScalar(y);
+        let { p: S, f: O } = this.wNAF(C), { p: U, f: N } = this.wNAF(x);
+        S = p.constTimeNegate(k, S), U = p.constTimeNegate(E, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), w = S.add(U), m = O.add(N);
       } else {
         const { p: k, f: C } = this.wNAF(y);
-        w = k, E = C;
+        w = k, m = C;
       }
-      return u.normalizeZ([w, E])[0];
+      return u.normalizeZ([w, m])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -980,19 +980,19 @@ function zi(e) {
      * @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), k = K(this, y).add(K(h, w));
+      const m = u.BASE, K = (C, E) => E === ce || E === Y || !C.equals(m) ? C.multiplyUnsafe(E) : C.multiply(E), k = K(this, y).add(K(h, w));
       return k.is0() ? void 0 : k;
     }
     // 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 k = n.mul(y, h), C = n.mul(w, h), m = n.mul(E, h);
+      const { px: y, py: w, pz: m } = this, K = this.is0();
+      h == null && (h = K ? n.ONE : n.inv(m));
+      const k = n.mul(y, h), C = n.mul(w, h), E = n.mul(m, h);
       if (K)
         return { x: n.ZERO, y: n.ZERO };
-      if (!n.eql(m, n.ONE))
+      if (!n.eql(E, n.ONE))
         throw new Error("invZ was invalid");
       return { x: k, y: C };
     }
@@ -1050,23 +1050,23 @@ function Zi(e) {
   }
   const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: d } = zi({
     ...t,
-    toBytes(b, v, S) {
-      const I = v.toAffine(), N = n.toBytes(I.x), _ = Ie;
-      return S ? _(Uint8Array.from([v.hasEvenY() ? 2 : 3]), N) : _(Uint8Array.from([4]), N, n.toBytes(I.y));
+    toBytes(b, v, A) {
+      const I = v.toAffine(), B = n.toBytes(I.x), _ = Ie;
+      return A ? _(Uint8Array.from([v.hasEvenY() ? 2 : 3]), B) : _(Uint8Array.from([4]), B, n.toBytes(I.y));
     },
     fromBytes(b) {
-      const v = b.length, S = b[0], I = b.subarray(1);
-      if (v === i && (S === 2 || S === 3)) {
-        const N = G(I);
-        if (!s(N))
+      const v = b.length, A = b[0], I = b.subarray(1);
+      if (v === i && (A === 2 || A === 3)) {
+        const B = G(I);
+        if (!s(B))
           throw new Error("Point is not on curve");
-        const _ = u(N);
+        const _ = u(B);
         let P = n.sqrt(_);
         const $ = (P & Y) === Y;
-        return (S & 1) === 1 !== $ && (P = n.neg(P)), { x: N, y: P };
-      } else if (v === o && S === 4) {
-        const N = n.fromBytes(I.subarray(0, n.BYTES)), _ = n.fromBytes(I.subarray(n.BYTES, 2 * n.BYTES));
-        return { x: N, y: _ };
+        return (A & 1) === 1 !== $ && (P = n.neg(P)), { x: B, y: P };
+      } else if (v === o && A === 4) {
+        const B = n.fromBytes(I.subarray(0, n.BYTES)), _ = n.fromBytes(I.subarray(n.BYTES, 2 * n.BYTES));
+        return { x: B, y: _ };
       } else
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${o} uncompressed bytes`);
     }
@@ -1078,21 +1078,21 @@ function Zi(e) {
   function h(b) {
     return g(b) ? c(-b) : b;
   }
-  const y = (b, v, S) => G(b.slice(v, S));
+  const y = (b, v, A) => G(b.slice(v, A));
   class w {
-    constructor(v, S, I) {
-      this.r = v, this.s = S, this.recovery = I, this.assertValidity();
+    constructor(v, A, I) {
+      this.r = v, this.s = A, this.recovery = I, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
-      const S = t.nByteLength;
-      return v = Z("compactSignature", v, S * 2), new w(y(v, 0, S), y(v, S, 2 * S));
+      const A = t.nByteLength;
+      return v = Z("compactSignature", v, A * 2), new w(y(v, 0, A), y(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: S, s: I } = Ne.toSig(Z("DER", v));
-      return new w(S, I);
+      const { r: A, s: I } = Be.toSig(Z("DER", v));
+      return new w(A, I);
     }
     assertValidity() {
       if (!d(this.r))
@@ -1104,13 +1104,13 @@ function Zi(e) {
       return new w(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: S, s: I, recovery: N } = this, _ = x(Z("msgHash", v));
-      if (N == null || ![0, 1, 2, 3].includes(N))
+      const { r: A, s: I, recovery: B } = this, _ = x(Z("msgHash", v));
+      if (B == null || ![0, 1, 2, 3].includes(B))
         throw new Error("recovery id invalid");
-      const P = N === 2 || N === 3 ? S + t.n : S;
+      const P = B === 2 || B === 3 ? A + t.n : A;
       if (P >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const $ = N & 1 ? "03" : "02", X = l.fromHex($ + p(P)), ye = a(P), ke = c(-_ * ye), ze = c(I * ye), pe = l.BASE.multiplyAndAddUnsafe(X, ke, ze);
+      const $ = B & 1 ? "03" : "02", X = l.fromHex($ + p(P)), ye = a(P), ke = c(-_ * ye), ze = c(I * ye), pe = l.BASE.multiplyAndAddUnsafe(X, ke, ze);
       if (!pe)
         throw new Error("point at infinify");
       return pe.assertValidity(), pe;
@@ -1127,7 +1127,7 @@ function Zi(e) {
       return qe(this.toDERHex());
     }
     toDERHex() {
-      return Ne.hexFromSig({ r: this.r, s: this.s });
+      return Be.hexFromSig({ r: this.r, s: this.s });
     }
     // padded bytes of r, then padded bytes of s
     toCompactRawBytes() {
@@ -1137,7 +1137,7 @@ function Zi(e) {
       return p(this.r) + p(this.s);
     }
   }
-  const E = {
+  const m = {
     isValidPrivateKey(b) {
       try {
         return f(b), !0;
@@ -1170,43 +1170,43 @@ function Zi(e) {
     return l.fromPrivateKey(b).toRawBytes(v);
   }
   function k(b) {
-    const v = b instanceof Uint8Array, S = typeof b == "string", I = (v || S) && b.length;
-    return v ? I === i || I === o : S ? I === 2 * i || I === 2 * o : b instanceof l;
+    const v = b instanceof Uint8Array, A = typeof b == "string", I = (v || A) && b.length;
+    return v ? I === i || I === o : A ? I === 2 * i || I === 2 * o : b instanceof l;
   }
-  function C(b, v, S = !0) {
+  function C(b, v, A = !0) {
     if (k(b))
       throw new Error("first arg must be private key");
     if (!k(v))
       throw new Error("second arg must be public key");
-    return l.fromHex(v).multiply(f(b)).toRawBytes(S);
+    return l.fromHex(v).multiply(f(b)).toRawBytes(A);
   }
-  const m = t.bits2int || function(b) {
-    const v = G(b), S = b.length * 8 - t.nBitLength;
-    return S > 0 ? v >> BigInt(S) : v;
+  const E = t.bits2int || function(b) {
+    const v = G(b), A = b.length * 8 - t.nBitLength;
+    return A > 0 ? v >> BigInt(A) : v;
   }, x = t.bits2int_modN || function(b) {
-    return c(m(b));
-  }, A = Gt(t.nBitLength);
+    return c(E(b));
+  }, S = Gt(t.nBitLength);
   function O(b) {
     if (typeof b != "bigint")
       throw new Error("bigint expected");
-    if (!(ce <= b && b < A))
+    if (!(ce <= b && b < S))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
     return xe(b, t.nByteLength);
   }
-  function U(b, v, S = B) {
-    if (["recovered", "canonical"].some((Ke) => Ke in S))
+  function U(b, v, A = N) {
+    if (["recovered", "canonical"].some((Ke) => Ke in A))
       throw new Error("sign() legacy options not supported");
-    const { hash: I, randomBytes: N } = t;
-    let { lowS: _, prehash: P, extraEntropy: $ } = S;
+    const { hash: I, randomBytes: B } = t;
+    let { lowS: _, prehash: P, extraEntropy: $ } = A;
     _ == null && (_ = !0), b = Z("msgHash", b), P && (b = Z("prehashed msgHash", I(b)));
     const X = x(b), ye = f(v), ke = [O(ye), O(X)];
     if ($ != null) {
-      const Ke = $ === !0 ? N(n.BYTES) : $;
+      const Ke = $ === !0 ? B(n.BYTES) : $;
       ke.push(Z("extraEntropy", Ke));
     }
     const ze = Ie(...ke), pe = X;
     function xt(Ke) {
-      const _e = m(Ke);
+      const _e = E(Ke);
       if (!d(_e))
         return;
       const wn = a(_e), Le = l.BASE.multiply(_e).toAffine(), Q = c(Le.x);
@@ -1220,34 +1220,34 @@ function Zi(e) {
     }
     return { seed: ze, k2sig: xt };
   }
-  const B = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
-  function R(b, v, S = B) {
-    const { seed: I, k2sig: N } = U(b, v, S), _ = t;
-    return jn(_.hash.outputLen, _.nByteLength, _.hmac)(I, N);
+  const N = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
+  function R(b, v, A = N) {
+    const { seed: I, k2sig: B } = U(b, v, A), _ = t;
+    return jn(_.hash.outputLen, _.nByteLength, _.hmac)(I, B);
   }
   l.BASE._setWindowSize(8);
-  function H(b, v, S, I = T) {
+  function H(b, v, A, I = T) {
     var Le;
-    const N = b;
-    if (v = Z("msgHash", v), S = Z("publicKey", S), "strict" in I)
+    const B = b;
+    if (v = Z("msgHash", v), A = Z("publicKey", A), "strict" in I)
       throw new Error("options.strict was renamed to lowS");
     const { lowS: _, prehash: P } = I;
     let $, X;
     try {
-      if (typeof N == "string" || N instanceof Uint8Array)
+      if (typeof B == "string" || B instanceof Uint8Array)
         try {
-          $ = w.fromDER(N);
+          $ = w.fromDER(B);
         } catch (Q) {
-          if (!(Q instanceof Ne.Err))
+          if (!(Q instanceof Be.Err))
             throw Q;
-          $ = w.fromCompact(N);
+          $ = w.fromCompact(B);
         }
-      else if (typeof N == "object" && typeof N.r == "bigint" && typeof N.s == "bigint") {
-        const { r: Q, s: $e } = N;
+      else if (typeof B == "object" && typeof B.r == "bigint" && typeof B.s == "bigint") {
+        const { r: Q, s: $e } = B;
         $ = new w(Q, $e);
       } else
         throw new Error("PARSE");
-      X = l.fromHex(S);
+      X = l.fromHex(A);
     } catch (Q) {
       if (Q.message === "PARSE")
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
@@ -1267,7 +1267,7 @@ function Zi(e) {
     verify: H,
     ProjectivePoint: l,
     Signature: w,
-    utils: E
+    utils: m
   };
 }
 let Wn = class extends Mn {
@@ -1322,10 +1322,10 @@ function Wi(e, t) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const ft = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), it = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), ot = BigInt(2), Kn = (e, t) => (e + t / ot) / t;
 function Yn(e) {
-  const t = ft, n = BigInt(3), r = BigInt(6), i = BigInt(11), o = BigInt(22), s = BigInt(23), c = BigInt(44), a = 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, ot, t) * l % t, g = J(p, i, t) * p % t, h = J(g, o, t) * g % t, y = J(h, c, t) * h % t, w = J(y, a, t) * y % t, E = J(w, c, t) * h % t, K = J(E, n, t) * f % t, k = J(K, s, t) * g % t, C = J(k, r, t) * l % t, m = J(C, ot, t);
-  if (!Rt.eql(Rt.sqr(m), e))
+  const t = ft, n = BigInt(3), r = BigInt(6), i = BigInt(11), o = BigInt(22), s = BigInt(23), c = BigInt(44), a = 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, ot, t) * l % t, g = J(p, i, t) * p % t, h = J(g, o, t) * g % t, y = J(h, c, t) * h % t, w = J(y, a, t) * y % t, m = J(w, c, t) * h % t, K = J(m, n, t) * f % t, k = J(K, s, t) * g % t, C = J(k, r, t) * l % t, E = J(C, ot, t);
+  if (!Rt.eql(Rt.sqr(E), e))
     throw new Error("Cannot find square root");
-  return m;
+  return E;
 }
 const Rt = Pi(ft, void 0, void 0, { sqrt: Yn }), Ue = Wi({
   a: BigInt(0),
@@ -1354,16 +1354,16 @@ const Rt = Pi(ft, void 0, void 0, { sqrt: Yn }), Ue = Wi({
       return { k1neg: u, k1: l, k2neg: d, k2: f };
     }
   }
-}, Lt), ht = BigInt(0), Xn = (e) => typeof e == "bigint" && ht < e && e < ft, Gi = (e) => typeof e == "bigint" && ht < e && e < it, Bn = {};
+}, Lt), ht = BigInt(0), Xn = (e) => typeof e == "bigint" && ht < e && e < ft, Gi = (e) => typeof e == "bigint" && ht < e && e < it, Nn = {};
 function st(e, ...t) {
-  let n = Bn[e];
+  let n = Nn[e];
   if (n === void 0) {
     const r = Lt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = Ie(r, r), Bn[e] = n;
+    n = Ie(r, r), Nn[e] = n;
   }
   return Lt(Ie(n, ...t));
 }
-const Jt = (e) => e.toRawBytes(!0).slice(1), Pt = (e) => xe(e, 32), Nt = (e) => V(e, ft), We = (e) => V(e, it), Yt = Ue.ProjectivePoint, Ji = (e, t, n) => Yt.BASE.multiplyAndAddUnsafe(e, t, n);
+const Jt = (e) => e.toRawBytes(!0).slice(1), Pt = (e) => xe(e, 32), Bt = (e) => V(e, ft), We = (e) => V(e, it), Yt = Ue.ProjectivePoint, Ji = (e, t, n) => Yt.BASE.multiplyAndAddUnsafe(e, t, n);
 function Ot(e) {
   let t = Ue.utils.normPrivateKeyToScalar(e), n = Yt.fromPrivateKey(t);
   return { scalar: n.hasEvenY() ? t : We(-t), bytes: Jt(n) };
@@ -1371,9 +1371,9 @@ function Ot(e) {
 function Qn(e) {
   if (!Xn(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = Nt(e * e), n = Nt(t * e + BigInt(7));
+  const t = Bt(e * e), n = Bt(t * e + BigInt(7));
   let r = Yn(n);
-  r % ot !== ht && (r = Nt(-r));
+  r % ot !== ht && (r = Bt(-r));
   const i = new Yt(e, r, Jn);
   return i.assertValidity(), i;
 }
@@ -1691,7 +1691,7 @@ class fo extends sr {
     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 Ae = rr(() => new sr());
+const Se = rr(() => new sr());
 rr(() => new fo());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function je(e) {
@@ -1781,7 +1781,7 @@ function ar(e) {
     throw new Error("normalize fn should be function");
   return { encode: (t) => t, decode: (t) => e(t) };
 }
-function Nn(e, t, n) {
+function Bn(e, t, n) {
   if (t < 2)
     throw new Error(`convertRadix: wrong from=${t}, base cannot be less than 2`);
   if (n < 2)
@@ -1846,16 +1846,16 @@ function ho(e) {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
-      return Nn(Array.from(t), 2 ** 8, e);
+      return Bn(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(Nn(t, e, 2 ** 8));
+      return Uint8Array.from(Bn(t, e, 2 ** 8));
     }
   };
 }
-function Se(e, t = !1) {
+function Ae(e, t = !1) {
   if (je(e), e <= 0 || e > 32)
     throw new Error("radix2: bits should be in (0..32]");
   if (at(8, e) > 32 || at(e, 8) > 32)
@@ -1883,10 +1883,10 @@ function Cn(e) {
     }
   };
 }
-const yo = fe(Se(4), he("0123456789ABCDEF"), de("")), po = fe(Se(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), yt(5), de(""));
-fe(Se(5), he("0123456789ABCDEFGHIJKLMNOPQRSTUV"), yt(5), de(""));
-fe(Se(5), he("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), de(""), ar((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const ue = fe(Se(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), yt(6), de("")), go = fe(Se(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), yt(6), de("")), Qt = (e) => fe(ho(58), he(e), de("")), qt = Qt("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+const yo = fe(Ae(4), he("0123456789ABCDEF"), de("")), po = fe(Ae(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), yt(5), de(""));
+fe(Ae(5), he("0123456789ABCDEFGHIJKLMNOPQRSTUV"), yt(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+/"), yt(6), de("")), go = fe(Ae(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), yt(6), de("")), Qt = (e) => fe(ho(58), he(e), de("")), qt = Qt("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
 Qt("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
 Qt("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
 const In = [0, 2, 3, 5, 6, 7, 9, 10, 11], wo = {
@@ -1936,7 +1936,7 @@ function kn(e, t, n = 1) {
   return i ^= n, Dt.encode(Ht([i % 2 ** 30], 30, 5, !1));
 }
 function lr(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, o = Cn(r);
+  const t = e === "bech32" ? 1 : 734539939, n = Ae(5), r = n.decode, i = n.encode, o = Cn(r);
   function s(f, u, d = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
@@ -1979,11 +1979,11 @@ lr("bech32m");
 const bo = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, vo = fe(Se(4), he("0123456789abcdef"), de(""), ar((e) => {
+}, vo = fe(Ae(4), he("0123456789abcdef"), de(""), ar((e) => {
   if (typeof e != "string" || e.length % 2)
     throw new TypeError(`hex.decode: expected string, got ${typeof e} with length ${e.length}`);
   return e.toLowerCase();
-})), mo = {
+})), Eo = {
   utf8: bo,
   hex: vo,
   base16: yo,
@@ -1993,7 +1993,7 @@ const bo = {
   base58: qt,
   base58xmr: wo
 };
-`${Object.keys(mo).join(", ")}`;
+`${Object.keys(Eo).join(", ")}`;
 function Ut(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
@@ -2002,11 +2002,11 @@ function _n(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
-function Eo(e) {
+function mo(e) {
   return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
 }
 function le(e, ...t) {
-  if (!Eo(e))
+  if (!mo(e))
     throw new Error("Uint8Array expected");
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
@@ -2015,12 +2015,12 @@ function le(e, ...t) {
 const F = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), xo = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!xo)
   throw new Error("Non little-endian hardware is not supported");
-function Ao(e, t) {
+function So(e, t) {
   if (t == null || typeof t != "object")
     throw new Error("options must be defined");
   return Object.assign(e, t);
 }
-function So(e, t) {
+function Ao(e, t) {
   if (e.length !== t.length)
     return !1;
   let n = 0;
@@ -2028,9 +2028,9 @@ function So(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Ko = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ee = 16, Bo = 283;
+const Ko = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), me = 16, No = 283;
 function en(e) {
-  return e << 1 ^ Bo & -(e >> 7);
+  return e << 1 ^ No & -(e >> 7);
 }
 function Pe(e, t) {
   let n = 0;
@@ -2049,7 +2049,7 @@ const jt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), No = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Co = (e) => e << 24 | e >>> 8, kt = (e) => e << 8 | e >>> 24;
+})(), Bo = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Co = (e) => e << 24 | e >>> 8, kt = (e) => e << 8 | e >>> 24;
 function ur(e, t) {
   if (e.length !== 256)
     throw new Error("Wrong sbox length");
@@ -2061,7 +2061,7 @@ function ur(e, t) {
     }
   return { sbox: e, sbox2: a, T0: n, T1: r, T2: i, T3: o, T01: s, T23: c };
 }
-const tn = /* @__PURE__ */ ur(jt, (e) => Pe(e, 3) << 24 | e << 16 | e << 8 | Pe(e, 2)), fr = /* @__PURE__ */ ur(No, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), Io = /* @__PURE__ */ (() => {
+const tn = /* @__PURE__ */ ur(jt, (e) => Pe(e, 3) << 24 | e << 16 | e << 8 | Pe(e, 2)), fr = /* @__PURE__ */ ur(Bo, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), Io = /* @__PURE__ */ (() => {
   const e = new Uint8Array(16);
   for (let t = 0, n = 1; t < 16; t++, n = en(n))
     e[t] = n;
@@ -2092,7 +2092,7 @@ function Uo(e) {
   }
   return n;
 }
-function me(e, t, n, r, i, o) {
+function Ee(e, t, n, r, i, o) {
   return e[n << 8 & 65280 | r >>> 8 & 255] ^ t[i >>> 8 & 65280 | o >>> 24 & 255];
 }
 function se(e, t, n, r, i) {
@@ -2104,8 +2104,8 @@ function Ln(e, t, n, r, i) {
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
   for (let g = 0; g < l; g++) {
-    const h = e[a++] ^ me(s, c, t, n, r, i), y = e[a++] ^ me(s, c, n, r, i, t), w = e[a++] ^ me(s, c, r, i, t, n), E = e[a++] ^ me(s, c, i, t, n, r);
-    t = h, n = y, r = w, i = E;
+    const h = e[a++] ^ Ee(s, c, t, n, r, i), y = e[a++] ^ Ee(s, c, n, r, i, t), w = e[a++] ^ Ee(s, c, r, i, t, n), m = e[a++] ^ Ee(s, c, i, t, n, r);
+    t = h, n = y, r = w, i = m;
   }
   const f = e[a++] ^ se(o, t, n, r, i), u = e[a++] ^ se(o, n, r, i, t), d = e[a++] ^ se(o, r, i, t, n), p = e[a++] ^ se(o, i, t, n, r);
   return { s0: f, s1: u, s2: d, s3: p };
@@ -2116,8 +2116,8 @@ function ko(e, t, n, r, i) {
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
   for (let g = 0; g < l; g++) {
-    const h = e[a++] ^ me(s, c, t, i, r, n), y = e[a++] ^ me(s, c, n, t, i, r), w = e[a++] ^ me(s, c, r, n, t, i), E = e[a++] ^ me(s, c, i, r, n, t);
-    t = h, n = y, r = w, i = E;
+    const h = e[a++] ^ Ee(s, c, t, i, r, n), y = e[a++] ^ Ee(s, c, n, t, i, r), w = e[a++] ^ Ee(s, c, r, n, t, i), m = e[a++] ^ Ee(s, c, i, r, n, t);
+    t = h, n = y, r = w, i = m;
   }
   const f = e[a++] ^ se(o, t, i, r, n), u = e[a++] ^ se(o, n, t, i, r), d = e[a++] ^ se(o, r, n, t, i), p = e[a++] ^ se(o, i, r, n, t);
   return { s0: f, s1: u, s2: d, s3: p };
@@ -2130,18 +2130,18 @@ function dr(e, t) {
   return t;
 }
 function _o(e) {
-  if (le(e), e.length % Ee !== 0)
-    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ee}`);
+  if (le(e), e.length % me !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${me}`);
 }
 function Lo(e, t, n) {
   let r = e.length;
-  const i = r % Ee;
+  const i = r % me;
   if (!t && i !== 0)
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
   const o = F(e);
   if (t) {
-    let a = Ee - i;
-    a || (a = Ee), r = r + a;
+    let a = me - i;
+    a || (a = me), r = r + a;
   }
   const s = dr(r, n), c = F(s);
   return { b: o, o: c, out: s };
@@ -2164,8 +2164,8 @@ function $o(e, t) {
 function To(e) {
   const t = new Uint8Array(16), n = F(t);
   t.set(e);
-  const r = Ee - e.length;
-  for (let i = Ee - r; i < Ee; i++)
+  const r = me - e.length;
+  for (let i = me - r; i < me; i++)
     t[i] = r;
   return n;
 }
@@ -2189,10 +2189,10 @@ const yr = /* @__PURE__ */ Ko({ blockSize: 16, nonceLength: 16 }, function(t, n,
       const c = Uo(t), a = F(n), l = dr(o.length, s), f = F(o), u = F(l);
       let d = a[0], p = a[1], g = a[2], h = a[3];
       for (let y = 0; y + 4 <= f.length; ) {
-        const w = d, E = p, K = g, k = h;
+        const w = d, m = p, K = g, k = 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: A } = ko(c, d, p, g, h);
-        u[y++] = C ^ w, u[y++] = m ^ E, u[y++] = x ^ K, u[y++] = A ^ k;
+        const { s0: C, s1: E, s2: x, s3: S } = ko(c, d, p, g, h);
+        u[y++] = C ^ w, u[y++] = E ^ m, u[y++] = x ^ K, u[y++] = S ^ k;
       }
       return c.fill(0), $o(l, i);
     }
@@ -2216,8 +2216,8 @@ function Ho(e, t, n, r, i, o, s, c) {
       const y = g / 4;
       if (g % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let w = 0, E; w < Mo; w++)
-        E = y + w, p[E] = d[E] ^ f[w];
+      for (let w = 0, m; w < Mo; w++)
+        m = y + w, p[m] = d[m] ^ f[w];
       g += Xe;
       continue;
     }
@@ -2227,7 +2227,7 @@ function Ho(e, t, n, r, i, o, s, c) {
   }
 }
 function qo(e, t) {
-  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: o, rounds: s } = Ao({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
+  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: o, rounds: s } = So({ 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(s), _n(o), _n(n), (c, a, l, f, u = 0) => {
@@ -2252,10 +2252,10 @@ function qo(e, t) {
         throw new Error("arx: extended nonce must be 24 bytes");
       r(y, w, F(a.subarray(0, 16)), w), a = a.subarray(16);
     }
-    const E = 16 - i;
-    if (E !== a.length)
-      throw new Error(`arx: nonce must be ${E} or 16 bytes`);
-    if (E !== 12) {
+    const m = 16 - i;
+    if (m !== a.length)
+      throw new Error(`arx: nonce must be ${m} or 16 bytes`);
+    if (m !== 12) {
       const k = new Uint8Array(12);
       k.set(a, o ? 0 : 12 - a.length), a = k, p.push(a);
     }
@@ -2266,11 +2266,11 @@ function qo(e, t) {
   };
 }
 function Do(e, t, n, r, i, o = 20) {
-  let s = e[0], c = e[1], a = 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], k = n[1], C = n[2], m = s, x = c, A = a, O = l, U = f, B = u, T = d, R = p, H = g, b = h, v = y, S = w, I = E, N = K, _ = k, P = C;
+  let s = e[0], c = e[1], a = 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], m = i, K = n[0], k = n[1], C = n[2], E = s, x = c, S = a, O = l, U = f, N = u, T = d, R = p, H = g, b = h, v = y, A = w, I = m, B = K, _ = k, P = C;
   for (let X = 0; X < o; X += 2)
-    m = m + U | 0, I = L(I ^ m, 16), H = H + I | 0, U = L(U ^ H, 12), m = m + U | 0, I = L(I ^ m, 8), H = H + I | 0, U = L(U ^ H, 7), x = x + B | 0, N = L(N ^ x, 16), b = b + N | 0, B = L(B ^ b, 12), x = x + B | 0, N = L(N ^ x, 8), b = b + N | 0, B = L(B ^ b, 7), A = A + T | 0, _ = L(_ ^ A, 16), v = v + _ | 0, T = L(T ^ v, 12), A = A + T | 0, _ = L(_ ^ A, 8), v = v + _ | 0, T = L(T ^ v, 7), O = O + R | 0, P = L(P ^ O, 16), S = S + P | 0, R = L(R ^ S, 12), O = O + R | 0, P = L(P ^ O, 8), S = S + P | 0, R = L(R ^ S, 7), m = m + B | 0, P = L(P ^ m, 16), v = v + P | 0, B = L(B ^ v, 12), m = m + B | 0, P = L(P ^ m, 8), v = v + P | 0, B = L(B ^ v, 7), x = x + T | 0, I = L(I ^ x, 16), S = S + I | 0, T = L(T ^ S, 12), x = x + T | 0, I = L(I ^ x, 8), S = S + I | 0, T = L(T ^ S, 7), A = A + R | 0, N = L(N ^ A, 16), H = H + N | 0, R = L(R ^ H, 12), A = A + R | 0, N = L(N ^ A, 8), H = H + N | 0, R = L(R ^ H, 7), O = O + U | 0, _ = L(_ ^ O, 16), b = b + _ | 0, U = L(U ^ b, 12), O = O + U | 0, _ = L(_ ^ O, 8), b = b + _ | 0, U = L(U ^ b, 7);
+    E = E + U | 0, I = L(I ^ E, 16), H = H + I | 0, U = L(U ^ H, 12), E = E + U | 0, I = L(I ^ E, 8), H = H + I | 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 + T | 0, _ = L(_ ^ S, 16), v = v + _ | 0, T = L(T ^ v, 12), S = S + T | 0, _ = L(_ ^ S, 8), v = v + _ | 0, T = L(T ^ v, 7), O = O + R | 0, P = L(P ^ O, 16), A = A + P | 0, R = L(R ^ A, 12), O = O + R | 0, P = L(P ^ O, 8), A = A + P | 0, R = L(R ^ A, 7), E = E + N | 0, P = L(P ^ E, 16), v = v + P | 0, N = L(N ^ v, 12), E = E + N | 0, P = L(P ^ E, 8), v = v + P | 0, N = L(N ^ v, 7), x = x + T | 0, I = L(I ^ x, 16), A = A + I | 0, T = L(T ^ A, 12), x = x + T | 0, I = L(I ^ x, 8), A = A + I | 0, T = L(T ^ 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), O = O + U | 0, _ = L(_ ^ O, 16), b = b + _ | 0, U = L(U ^ b, 12), O = O + U | 0, _ = L(_ ^ O, 8), b = b + _ | 0, U = L(U ^ b, 7);
   let $ = 0;
-  r[$++] = s + m | 0, r[$++] = c + x | 0, r[$++] = a + A | 0, r[$++] = l + O | 0, r[$++] = f + U | 0, r[$++] = u + B | 0, r[$++] = d + T | 0, r[$++] = p + R | 0, r[$++] = g + H | 0, r[$++] = h + b | 0, r[$++] = y + v | 0, r[$++] = w + S | 0, r[$++] = E + I | 0, r[$++] = K + N | 0, r[$++] = k + _ | 0, r[$++] = C + P | 0;
+  r[$++] = s + E | 0, r[$++] = c + x | 0, r[$++] = a + S | 0, r[$++] = l + O | 0, r[$++] = f + U | 0, r[$++] = u + N | 0, r[$++] = d + T | 0, r[$++] = p + R | 0, r[$++] = g + H | 0, r[$++] = h + b | 0, r[$++] = y + v | 0, r[$++] = w + A | 0, r[$++] = m + I | 0, r[$++] = K + B | 0, r[$++] = k + _ | 0, r[$++] = C + P | 0;
 }
 const br = /* @__PURE__ */ qo(Do, {
   counterRight: !1,
@@ -2318,7 +2318,7 @@ function nn(e, t, n) {
   return oe.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), pt(e, Ge(n), Ge(t));
 }
 const _t = new Uint8Array([0]), Tn = new Uint8Array();
-function mr(e, t, n, r = 32) {
+function Er(e, t, n, r = 32) {
   if (oe.hash(e), oe.number(r), r > 255 * e.outputLen)
     throw new Error("Length should be <= 255*HashLen");
   const i = Math.ceil(r / e.outputLen);
@@ -2332,7 +2332,7 @@ var jo = Object.defineProperty, D = (e, t) => {
   for (var n in t)
     jo(e, n, { get: t[n], enumerable: !0 });
 }, Te = Symbol("verified"), zo = (e) => e instanceof Object;
-function Er(e) {
+function mr(e) {
   if (!zo(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++) {
@@ -2433,12 +2433,12 @@ var xr = class {
   }
 };
 function Yo(e) {
-  if (!Er(e))
+  if (!mr(e))
     throw new Error("can't serialize event with wrong or missing properties");
   return JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content]);
 }
 function tt(e) {
-  let t = Ae(te.encode(Yo(e)));
+  let t = Se(te.encode(Yo(e)));
   return M(t);
 }
 var gt = new Jo(), Oe = gt.generateSecretKey, Ce = gt.getPublicKey, ae = gt.finalizeEvent, on = gt.verifyEvent, Xo = {};
@@ -2447,11 +2447,11 @@ D(Xo, {
   BadgeAward: () => as,
   BadgeDefinition: () => Vs,
   BlockedRelaysList: () => Us,
-  BookmarkList: () => Ns,
+  BookmarkList: () => Bs,
   Bookmarksets: () => Ds,
   Calendar: () => oa,
   CalendarEventRSVP: () => sa,
-  ChannelCreation: () => Nr,
+  ChannelCreation: () => Br,
   ChannelHideMessage: () => Ur,
   ChannelMessage: () => Ir,
   ChannelMetadata: () => Cr,
@@ -2480,7 +2480,7 @@ D(Xo, {
   HTTPAuth: () => cn,
   Handlerinformation: () => ca,
   Handlerrecommendation: () => aa,
-  Highlights: () => As,
+  Highlights: () => Ss,
   InterestsList: () => _s,
   Interestsets: () => Zs,
   JobFeedback: () => vs,
@@ -2492,7 +2492,7 @@ D(Xo, {
   LiveEvent: () => Qs,
   LongFormArticle: () => Gs,
   Metadata: () => es,
-  Mutelist: () => Ss,
+  Mutelist: () => As,
   NWCWalletInfo: () => Ts,
   NWCWalletRequest: () => Lr,
   NWCWalletResponse: () => Ps,
@@ -2504,7 +2504,7 @@ D(Xo, {
   PublicChatsList: () => Is,
   Reaction: () => an,
   RecommendRelay: () => ns,
-  RelayList: () => Bs,
+  RelayList: () => Ns,
   Relaysets: () => qs,
   Report: () => ds,
   Reporting: () => ys,
@@ -2515,30 +2515,30 @@ D(Xo, {
   UserEmojiList: () => Ls,
   UserStatuses: () => ea,
   Zap: () => xs,
-  ZapGoal: () => ms,
-  ZapRequest: () => Es,
+  ZapGoal: () => Es,
+  ZapRequest: () => ms,
   classifyKind: () => Qo,
   isEphemeralKind: () => Kr,
-  isParameterizedReplaceableKind: () => Br,
-  isRegularKind: () => Ar,
-  isReplaceableKind: () => Sr
+  isParameterizedReplaceableKind: () => Nr,
+  isRegularKind: () => Sr,
+  isReplaceableKind: () => Ar
 });
-function Ar(e) {
+function Sr(e) {
   return 1e3 <= e && e < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(e);
 }
-function Sr(e) {
+function Ar(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
 function Kr(e) {
   return 2e4 <= e && e < 3e4;
 }
-function Br(e) {
+function Nr(e) {
   return 3e4 <= e && e < 4e4;
 }
 function Qo(e) {
-  return Ar(e) ? "regular" : Sr(e) ? "replaceable" : Kr(e) ? "ephemeral" : Br(e) ? "parameterized" : "unknown";
+  return Sr(e) ? "regular" : Ar(e) ? "replaceable" : Kr(e) ? "ephemeral" : Nr(e) ? "parameterized" : "unknown";
 }
-var es = 0, ts = 1, ns = 2, rs = 3, is = 4, os = 4, ss = 5, sn = 6, an = 7, as = 8, cs = 16, Nr = 40, Cr = 41, Ir = 42, Ur = 43, kr = 44, ls = 1040, us = 1063, fs = 1311, hs = 1971, ds = 1984, ys = 1984, ps = 1985, gs = 4550, ws = 5999, bs = 6999, vs = 7e3, ms = 9041, Es = 9734, xs = 9735, As = 9802, Ss = 1e4, Ks = 10001, Bs = 10002, Ns = 10003, Cs = 10004, Is = 10005, Us = 10006, ks = 10007, _s = 10015, Ls = 10030, $s = 10096, Ts = 13194, Rs = 21e3, _r = 22242, Lr = 23194, Ps = 23195, Os = 24133, cn = 27235, Ms = 3e4, Hs = 30001, qs = 30002, Ds = 30003, js = 30004, zs = 30008, Vs = 30009, Zs = 30015, Fs = 30017, Ws = 30018, Gs = 30023, Js = 30024, Ys = 30030, Xs = 30078, Qs = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, oa = 31924, sa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
+var es = 0, ts = 1, ns = 2, rs = 3, is = 4, os = 4, ss = 5, sn = 6, an = 7, as = 8, cs = 16, Br = 40, Cr = 41, Ir = 42, Ur = 43, kr = 44, ls = 1040, us = 1063, fs = 1311, hs = 1971, ds = 1984, ys = 1984, ps = 1985, gs = 4550, ws = 5999, bs = 6999, vs = 7e3, Es = 9041, ms = 9734, xs = 9735, Ss = 9802, As = 1e4, Ks = 10001, Ns = 10002, Bs = 10003, Cs = 10004, Is = 10005, Us = 10006, ks = 10007, _s = 10015, Ls = 10030, $s = 10096, Ts = 13194, Rs = 21e3, _r = 22242, Lr = 23194, Ps = 23195, Os = 24133, cn = 27235, Ms = 3e4, Hs = 30001, qs = 30002, Ds = 30003, js = 30004, zs = 30008, Vs = 30009, Zs = 30015, Fs = 30017, Ws = 30018, Gs = 30023, Js = 30024, Ys = 30030, Xs = 30078, Qs = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, oa = 31924, sa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
 D(ua, {
   getHex64: () => ln,
   getInt: () => $r,
@@ -2609,12 +2609,12 @@ D(Fe, {
   decode: () => wt,
   encodeBytes: () => bt,
   naddrEncode: () => Ka,
-  neventEncode: () => Sa,
+  neventEncode: () => Aa,
   noteEncode: () => xa,
-  nprofileEncode: () => Aa,
-  npubEncode: () => Ea,
-  nrelayEncode: () => Ba,
-  nsecEncode: () => ma
+  nprofileEncode: () => Sa,
+  npubEncode: () => ma,
+  nrelayEncode: () => Na,
+  nsecEncode: () => Ea
 });
 var un = 5e3, Tr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
 function va(e) {
@@ -2709,10 +2709,10 @@ function Qe(e) {
   }
   return t;
 }
-function ma(e) {
+function Ea(e) {
   return bt("nsec", e);
 }
-function Ea(e) {
+function ma(e) {
   return bt("npub", W(e));
 }
 function xa(e) {
@@ -2725,14 +2725,14 @@ function Ye(e, t) {
 function bt(e, t) {
   return Ye(e, t);
 }
-function Aa(e) {
+function Sa(e) {
   let t = vt({
     0: [W(e.pubkey)],
     1: (e.relays || []).map((n) => te.encode(n))
   });
   return Ye("nprofile", t);
 }
-function Sa(e) {
+function Aa(e) {
   let t;
   e.kind !== void 0 && (t = va(e.kind));
   let n = vt({
@@ -2754,7 +2754,7 @@ function Ka(e) {
   });
   return Ye("naddr", n);
 }
-function Ba(e) {
+function Na(e) {
   let t = vt({
     0: [te.encode(e)]
   });
@@ -2769,8 +2769,8 @@ function vt(e) {
     });
   }), dt(...t);
 }
-var Na = {};
-D(Na, {
+var Ba = {};
+D(Ba, {
   decrypt: () => Ca,
   encrypt: () => Rr
 });
@@ -2795,18 +2795,18 @@ D(Ia, {
   searchDomain: () => ka,
   useFetchImplementation: () => Ua
 });
-var Or = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, mt;
+var Or = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Et;
 try {
-  mt = fetch;
+  Et = fetch;
 } catch {
 }
 function Ua(e) {
-  mt = e;
+  Et = e;
 }
 async function ka(e, t = "") {
   try {
     const n = `https://${e}/.well-known/nostr.json?name=${t}`;
-    return (await (await mt(n, { redirect: "error" })).json()).names;
+    return (await (await Et(n, { redirect: "error" })).json()).names;
   } catch {
     return {};
   }
@@ -2818,7 +2818,7 @@ async function Mr(e) {
     return null;
   const [n, r = "_", i] = t;
   try {
-    const s = `https://${i}/.well-known/nostr.json?name=${r}`, c = await (await mt(s, { redirect: "error" })).json();
+    const s = `https://${i}/.well-known/nostr.json?name=${r}`, c = await (await Et(s, { redirect: "error" })).json();
     let a = c.names[r];
     return a ? { pubkey: a, relays: (o = c.relays) == null ? void 0 : o[a] } : null;
   } catch {
@@ -2967,16 +2967,16 @@ function Da(e, { skipVerification: t } = {}) {
 }
 var ja = {};
 D(ja, {
-  NOSTR_URI_REGEX: () => Et,
+  NOSTR_URI_REGEX: () => mt,
   parse: () => Va,
   test: () => za
 });
-var Et = new RegExp(`nostr:(${Tr.source})`);
+var mt = new RegExp(`nostr:(${Tr.source})`);
 function za(e) {
-  return typeof e == "string" && new RegExp(`^${Et.source}$`).test(e);
+  return typeof e == "string" && new RegExp(`^${mt.source}$`).test(e);
 }
 function Va(e) {
-  const t = e.match(new RegExp(`^${Et.source}$`));
+  const t = e.match(new RegExp(`^${mt.source}$`));
   if (!t)
     throw new Error(`Invalid Nostr URI: ${e}`);
   return {
@@ -3023,7 +3023,7 @@ D(Ga, {
   regex: () => fn,
   replaceAll: () => Ya
 });
-var fn = () => new RegExp(`\\b${Et.source}\\b`, "g");
+var fn = () => new RegExp(`\\b${mt.source}\\b`, "g");
 function* Ja(e) {
   const t = e.matchAll(fn());
   for (const n of t)
@@ -3064,7 +3064,7 @@ var Qa = (e, t) => {
     return;
   return ae(
     {
-      kind: Nr,
+      kind: Br,
       tags: [...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3191,10 +3191,10 @@ D(z, {
 var zr = 1, Vr = 65535;
 function Zr(e, t) {
   const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return nn(Ae, n, "nip44-v2");
+  return nn(Se, n, "nip44-v2");
 }
 function Fr(e, t) {
-  const n = mr(Ae, e, t, 76);
+  const n = Er(Se, e, t, 76);
   return {
     chacha_key: n.subarray(0, 32),
     chacha_nonce: n.subarray(32, 44),
@@ -3229,7 +3229,7 @@ function Wr(e, t, n) {
   if (n.length !== 32)
     throw new Error("AAD associated data must be 32 bytes");
   const r = dt(n, t);
-  return pt(Ae, e, r);
+  return pt(Se, e, r);
 }
 function dc(e) {
   if (typeof e != "string")
@@ -3263,7 +3263,7 @@ function Gr(e, t, n = ir(32)) {
 }
 function Jr(e, t) {
   const { nonce: n, ciphertext: r, mac: i } = dc(e), { chacha_key: o, chacha_nonce: s, hmac_key: c } = Fr(t, n), a = Wr(c, r, n);
-  if (!So(a, i))
+  if (!Ao(a, i))
     throw new Error("invalid MAC");
   const l = br(o, s, r);
   return hc(l);
@@ -3302,9 +3302,9 @@ async function wc(e, t, n) {
 }
 var bc = {};
 D(bc, {
-  getZapEndpoint: () => mc,
-  makeZapReceipt: () => Ac,
-  makeZapRequest: () => Ec,
+  getZapEndpoint: () => Ec,
+  makeZapReceipt: () => Sc,
+  makeZapRequest: () => mc,
   useFetchImplementation: () => vc,
   validateZapRequest: () => xc
 });
@@ -3316,7 +3316,7 @@ try {
 function vc(e) {
   pn = e;
 }
-async function mc(e) {
+async function Ec(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
@@ -3334,7 +3334,7 @@ async function mc(e) {
   }
   return null;
 }
-function Ec({
+function mc({
   profile: e,
   event: t,
   amount: n,
@@ -3364,7 +3364,7 @@ function xc(e) {
   } catch {
     return "Invalid zap request JSON.";
   }
-  if (!Er(t))
+  if (!mr(t))
     return "Zap request is not a valid Nostr event.";
   if (!on(t))
     return "Invalid signature on zap request.";
@@ -3376,7 +3376,7 @@ function xc(e) {
   let r = t.tags.find(([o, s]) => o === "e" && s);
   return r && !r[1].match(/^[a-f0-9]{64}$/) ? "Zap request 'e' tag is not valid hex." : t.tags.find(([o, s]) => o === "relays" && s) ? null : "Zap request doesn't have a 'relays' tag.";
 }
-function Ac({
+function Sc({
   zapRequest: e,
   preimage: t,
   bolt11: n,
@@ -3390,8 +3390,8 @@ function Ac({
   };
   return t && s.tags.push(["preimage", t]), s;
 }
-var Sc = {};
-D(Sc, {
+var Ac = {};
+D(Ac, {
   getToken: () => Kc,
   hashPayload: () => gn,
   unpackEventFromToken: () => Xr,
@@ -3401,7 +3401,7 @@ D(Sc, {
   validateEventPayloadTag: () => ri,
   validateEventTimestamp: () => Qr,
   validateEventUrlTag: () => ti,
-  validateToken: () => Bc
+  validateToken: () => Nc
 });
 var Yr = "Nostr ";
 async function Kc(e, t, n, r = !1, i) {
@@ -3418,7 +3418,7 @@ async function Kc(e, t, n, r = !1, i) {
   const s = await n(o);
   return (r ? Yr : "") + ue.encode(te.encode(JSON.stringify(s)));
 }
-async function Bc(e, t, n) {
+async function Nc(e, t, n) {
   const r = await Xr(e).catch((o) => {
     throw o;
   });
@@ -3450,7 +3450,7 @@ function ni(e, t) {
   return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
 }
 function gn(e) {
-  const t = Ae(te.encode(JSON.stringify(e)));
+  const t = Se(te.encode(JSON.stringify(e)));
   return M(t);
 }
 function ri(e, t) {
@@ -3476,7 +3476,7 @@ async function ii(e, t, n, r) {
   return !0;
 }
 const Me = 4, Tc = 100;
-var Nc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Nc || {});
+var Bc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Bc || {});
 function Rc(e) {
   return JSON.stringify({
     rootKey: M(e.rootKey),
@@ -3544,9 +3544,9 @@ async function* Oc(e) {
   }
 }
 function Re(e, t = new Uint8Array(32), n = 1) {
-  const r = nn(Ae, e, t), i = [];
+  const r = nn(Se, e, t), i = [];
   for (let o = 1; o <= n; o++)
-    i.push(mr(Ae, r, new Uint8Array([o]), 32));
+    i.push(Er(Se, r, new Uint8Array([o]), 32));
   return i;
 }
 function Rn(e, t) {
@@ -3723,7 +3723,7 @@ new TextDecoder("utf-8");
 new TextEncoder();
 function et(e, t) {
   const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return nn(Ae, n, "nip44-v2");
+  return nn(Se, n, "nip44-v2");
 }
 class nt {
   constructor(t, n, r, i, o, s, c = []) {
@@ -3741,18 +3741,29 @@ class nt {
     );
   }
   static fromUrl(t) {
-    const n = new URL(t), r = n.pathname.slice(1), i = n.searchParams.get("s"), o = n.hash.slice(1);
+    const r = new URL(t).hash.slice(1);
     if (!r)
-      throw new Error("Inviter not found in the URL");
-    if (!i)
-      throw new Error("Session key not found in the URL");
-    const s = Fe.decode(r), c = Fe.decode(i);
-    if (typeof s.data != "string")
+      throw new Error("No invite data found in the URL hash.");
+    const i = decodeURIComponent(r);
+    let o;
+    try {
+      o = JSON.parse(i);
+    } catch (u) {
+      throw new Error("Invite data in URL hash is not valid JSON: " + u);
+    }
+    const { inviter: s, sessionKey: c, linkSecret: a } = o;
+    if (!s || !c || !a)
+      throw new Error("Missing required fields (inviter, sessionKey, linkSecret) in invite data.");
+    const l = Fe.decode(s), f = Fe.decode(c);
+    if (typeof l.data != "string")
       throw new Error("Decoded inviter is not a string");
-    if (typeof c.data != "string")
+    if (typeof f.data != "string")
       throw new Error("Decoded session key is not a string");
-    const a = s.data, l = c.data;
-    return new nt(l, o, a);
+    return new nt(
+      f.data,
+      a,
+      l.data
+    );
   }
   static deserialize(t) {
     const n = JSON.parse(t);
@@ -3778,8 +3789,12 @@ class nt {
     });
   }
   getUrl(t = "https://iris.to") {
-    const n = new URL(`${t}/${Fe.npubEncode(this.inviter)}`);
-    return n.searchParams.set("s", Fe.npubEncode(this.inviterSessionPublicKey)), n.hash = this.linkSecret, n.toString();
+    const n = {
+      inviter: Fe.npubEncode(this.inviter),
+      sessionKey: Fe.npubEncode(this.inviterSessionPublicKey),
+      linkSecret: this.linkSecret
+    }, r = new URL(t);
+    return r.hash = encodeURIComponent(JSON.stringify(n)), console.log("url", r.toString()), r.toString();
   }
   /**
        * Accepts the invite and creates a new channel with the inviter.
@@ -3838,7 +3853,7 @@ export {
   Me as EVENT_KIND,
   nt as InviteLink,
   Tc as MAX_SKIP,
-  Nc as Sender,
+  Bc as Sender,
   Oc as createMessageStream,
   Pc as deserializeChannelState,
   Re as kdf,