nostr-double-ratchet 0.0.28 → 0.0.30

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

@@ -1,11 +1,11 @@
-var Ki = Object.defineProperty;
-var Ni = (e, t, n) => t in e ? Ki(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var J = (e, t, n) => Ni(e, typeof t != "symbol" ? t + "" : t, n);
+var Ni = Object.defineProperty;
+var Ki = (e, t, n) => t in e ? Ni(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var J = (e, t, n) => Ki(e, typeof t != "symbol" ? t + "" : t, n);
 function Bn(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function Gn(e, ...t) {
+function Fn(e, ...t) {
   if (!(e instanceof Uint8Array))
     throw new Error("Expected Uint8Array");
   if (t.length > 0 && !t.includes(e.length))
@@ -23,14 +23,14 @@ function et(e, t = !0) {
     throw new Error("Hash#digest() has already been called");
 }
 function Ai(e, t) {
-  Gn(e);
+  Fn(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const Kt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const xt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Fn = (e) => e instanceof Uint8Array, Nt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Ci = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Gn = (e) => e instanceof Uint8Array, Nt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Ci = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!Ci)
   throw new Error("Non little-endian hardware is not supported");
 function Bi(e) {
@@ -38,8 +38,8 @@ function Bi(e) {
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Vt(e) {
-  if (typeof e == "string" && (e = Bi(e)), !Fn(e))
+function Wt(e) {
+  if (typeof e == "string" && (e = Bi(e)), !Gn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -47,7 +47,7 @@ function ki(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!Fn(r))
+    if (!Gn(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
@@ -58,16 +58,16 @@ let Jn = class {
     return this._cloneInto();
   }
 };
-function _i(e) {
-  const t = (r) => e().update(Vt(r)).digest(), n = e();
+function Ii(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 Yn(e = 32) {
-  if (Kt && typeof Kt.getRandomValues == "function")
-    return Kt.getRandomValues(new Uint8Array(e));
+  if (xt && typeof xt.getRandomValues == "function")
+    return xt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Ii(e, t, n, r) {
+function _i(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), c = Number(n & s), a = r ? 4 : 0, l = r ? 0 : 4;
@@ -80,7 +80,7 @@ let Ui = class extends Jn {
   update(t) {
     et(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Vt(t);
+    t = Wt(t);
     const s = t.length;
     for (let o = 0; o < s; ) {
       const c = Math.min(i - this.pos, s - o);
@@ -101,7 +101,7 @@ let Ui = class extends Jn {
     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;
-    Ii(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    _i(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
     const c = Nt(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
@@ -214,12 +214,12 @@ let Ti = class extends Ui {
     for (let u = 0; u < 16; u++, n += 4)
       ve[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const g = ve[u - 15], w = ve[u - 2], y = re(g, 7) ^ re(g, 18) ^ g >>> 3, h = re(w, 17) ^ re(w, 19) ^ w >>> 10;
-      ve[u] = h + ve[u - 7] + y + ve[u - 16] | 0;
+      const p = ve[u - 15], w = ve[u - 2], g = re(p, 7) ^ re(p, 18) ^ p >>> 3, h = re(w, 17) ^ re(w, 19) ^ w >>> 10;
+      ve[u] = h + ve[u - 7] + g + ve[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const g = re(c, 6) ^ re(c, 11) ^ re(c, 25), w = f + g + Li(c, a, l) + Ri[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + $i(r, i, s) | 0;
+      const p = re(c, 6) ^ re(c, 11) ^ re(c, 25), w = f + p + Li(c, a, l) + Ri[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + $i(r, i, s) | 0;
       f = l, l = a, a = c, c = o + w | 0, o = s, s = i, i = r, r = w + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
@@ -231,7 +231,7 @@ let Ti = class extends Ui {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const $t = /* @__PURE__ */ _i(() => new Ti());
+const Lt = /* @__PURE__ */ Ii(() => new Ti());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Xn = BigInt(0), at = BigInt(1), Oi = BigInt(2), ct = (e) => e instanceof Uint8Array, Mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function De(e) {
@@ -246,7 +246,7 @@ function Qn(e) {
   const t = e.toString(16);
   return t.length & 1 ? `0${t}` : t;
 }
-function Zt(e) {
+function Vt(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   return BigInt(e === "" ? "0" : `0x${e}`);
@@ -266,19 +266,19 @@ function je(e) {
   }
   return n;
 }
-function F(e) {
-  return Zt(De(e));
+function G(e) {
+  return Vt(De(e));
 }
-function Gt(e) {
+function Zt(e) {
   if (!ct(e))
     throw new Error("Uint8Array expected");
-  return Zt(De(Uint8Array.from(e).reverse()));
+  return Vt(De(Uint8Array.from(e).reverse()));
 }
-function Ne(e, t) {
+function Ke(e, t) {
   return je(e.toString(16).padStart(t * 2, "0"));
 }
 function Ft(e, t) {
-  return Ne(e, t).reverse();
+  return Ke(e, t).reverse();
 }
 function Pi(e) {
   return je(Qn(e));
@@ -300,7 +300,7 @@ function Z(e, t, n) {
     throw new Error(`${e} expected ${n} bytes, got ${i}`);
   return r;
 }
-function _e(...e) {
+function Ie(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -331,7 +331,7 @@ function Di(e) {
 function ji(e, t) {
   return e >> BigInt(t) & at;
 }
-const zi = (e, t, n) => e | (n ? at : Xn) << BigInt(t), Jt = (e) => (Oi << BigInt(e - 1)) - at, St = (e) => new Uint8Array(e), kn = (e) => Uint8Array.from(e);
+const zi = (e, t, n) => e | (n ? at : Xn) << BigInt(t), Gt = (e) => (Oi << BigInt(e - 1)) - at, Kt = (e) => new Uint8Array(e), kn = (e) => Uint8Array.from(e);
 function er(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -339,27 +339,27 @@ function er(e, t, n) {
     throw new Error("qByteLen must be a number");
   if (typeof n != "function")
     throw new Error("hmacFn must be a function");
-  let r = St(e), i = St(e), s = 0;
+  let r = Kt(e), i = Kt(e), s = 0;
   const o = () => {
     r.fill(1), i.fill(0), s = 0;
-  }, c = (...u) => n(i, r, ...u), a = (u = St()) => {
+  }, c = (...u) => n(i, r, ...u), a = (u = Kt()) => {
     i = c(kn([0]), u), r = c(), u.length !== 0 && (i = c(kn([1]), u), r = c());
   }, l = () => {
     if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
-    const g = [];
+    const p = [];
     for (; u < t; ) {
       r = c();
       const w = r.slice();
-      g.push(w), u += r.length;
+      p.push(w), u += r.length;
     }
-    return _e(...g);
+    return Ie(...p);
   };
-  return (u, g) => {
+  return (u, p) => {
     o(), a(u);
     let w;
-    for (; !(w = g(l())); )
+    for (; !(w = p(l())); )
       a();
     return o(), w;
   };
@@ -394,18 +394,18 @@ const Vi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   bitGet: ji,
   bitLen: Di,
-  bitMask: Jt,
+  bitMask: Gt,
   bitSet: zi,
   bytesToHex: De,
-  bytesToNumberBE: F,
-  bytesToNumberLE: Gt,
-  concatBytes: _e,
+  bytesToNumberBE: G,
+  bytesToNumberLE: Zt,
+  concatBytes: Ie,
   createHmacDrbg: er,
   ensureBytes: Z,
   equalBytes: Hi,
   hexToBytes: je,
-  hexToNumber: Zt,
-  numberToBytesBE: Ne,
+  hexToNumber: Vt,
+  numberToBytesBE: Ke,
   numberToBytesLE: Ft,
   numberToHexUnpadded: Qn,
   numberToVarBytesBE: Pi,
@@ -413,21 +413,21 @@ const Vi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   validateObject: Ye
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const W = BigInt(0), j = BigInt(1), Ce = BigInt(2), Zi = BigInt(3), Rt = BigInt(4), _n = BigInt(5), In = BigInt(8);
+const W = BigInt(0), z = BigInt(1), Ce = BigInt(2), Zi = BigInt(3), $t = BigInt(4), In = BigInt(5), _n = BigInt(8);
 BigInt(9);
 BigInt(16);
 function V(e, t) {
   const n = e % t;
   return n >= W ? n : t + n;
 }
-function Gi(e, t, n) {
+function Fi(e, t, n) {
   if (n <= W || t < W)
     throw new Error("Expected power/modulo > 0");
-  if (n === j)
+  if (n === z)
     return W;
-  let r = j;
+  let r = z;
   for (; t > W; )
-    t & j && (r = r * e % n), e = e * e % n, t >>= j;
+    t & z && (r = r * e % n), e = e * e % n, t >>= z;
   return r;
 }
 function Y(e, t, n) {
@@ -436,27 +436,27 @@ function Y(e, t, n) {
     r *= r, r %= n;
   return r;
 }
-function Tt(e, t) {
+function Rt(e, t) {
   if (e === W || t <= W)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
-  let n = V(e, t), r = t, i = W, s = j;
+  let n = V(e, t), r = t, i = W, s = z;
   for (; n !== W; ) {
     const c = r / n, a = r % n, l = i - s * c;
     r = n, n = a, i = s, s = l;
   }
-  if (r !== j)
+  if (r !== z)
     throw new Error("invert: does not exist");
   return V(i, t);
 }
-function Fi(e) {
-  const t = (e - j) / Ce;
+function Gi(e) {
+  const t = (e - z) / Ce;
   let n, r, i;
-  for (n = e - j, r = 0; n % Ce === W; n /= Ce, r++)
+  for (n = e - z, r = 0; n % Ce === W; n /= Ce, r++)
     ;
-  for (i = Ce; i < e && Gi(i, t, e) !== e - j; i++)
+  for (i = Ce; i < e && Fi(i, t, e) !== e - z; i++)
     ;
   if (r === 1) {
-    const o = (e + j) / Rt;
+    const o = (e + z) / $t;
     return function(a, l) {
       const f = a.pow(l, o);
       if (!a.eql(a.sqr(f), l))
@@ -464,26 +464,26 @@ function Fi(e) {
       return f;
     };
   }
-  const s = (n + j) / Ce;
+  const s = (n + z) / Ce;
   return function(c, a) {
     if (c.pow(a, t) === c.neg(c.ONE))
       throw new Error("Cannot find square root");
-    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, s), g = c.pow(a, n);
-    for (; !c.eql(g, c.ONE); ) {
-      if (c.eql(g, c.ZERO))
+    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, s), p = c.pow(a, n);
+    for (; !c.eql(p, c.ONE); ) {
+      if (c.eql(p, c.ZERO))
         return c.ZERO;
       let w = 1;
-      for (let h = c.sqr(g); w < l && !c.eql(h, c.ONE); w++)
+      for (let h = c.sqr(p); w < l && !c.eql(h, c.ONE); w++)
         h = c.sqr(h);
-      const y = c.pow(f, j << BigInt(l - w - 1));
-      f = c.sqr(y), u = c.mul(u, y), g = c.mul(g, f), l = w;
+      const g = c.pow(f, z << BigInt(l - w - 1));
+      f = c.sqr(g), u = c.mul(u, g), p = c.mul(p, f), l = w;
     }
     return u;
   };
 }
 function Ji(e) {
-  if (e % Rt === Zi) {
-    const t = (e + j) / Rt;
+  if (e % $t === Zi) {
+    const t = (e + z) / $t;
     return function(r, i) {
       const s = r.pow(i, t);
       if (!r.eql(r.sqr(s), i))
@@ -491,8 +491,8 @@ function Ji(e) {
       return s;
     };
   }
-  if (e % In === _n) {
-    const t = (e - _n) / In;
+  if (e % _n === In) {
+    const t = (e - In) / _n;
     return function(r, i) {
       const s = r.mul(i, Ce), o = r.pow(s, t), c = r.mul(i, o), a = r.mul(r.mul(c, Ce), o), l = r.mul(c, r.sub(a, r.ONE));
       if (!r.eql(r.sqr(l), i))
@@ -500,7 +500,7 @@ function Ji(e) {
       return l;
     };
   }
-  return Fi(e);
+  return Gi(e);
 }
 const Yi = [
   "create",
@@ -535,11 +535,11 @@ function Qi(e, t, n) {
     throw new Error("Expected power > 0");
   if (n === W)
     return e.ONE;
-  if (n === j)
+  if (n === z)
     return t;
   let r = e.ONE, i = t;
   for (; n > W; )
-    n & j && (r = e.mul(r, i)), i = e.sqr(i), n >>= j;
+    n & z && (r = e.mul(r, i)), i = e.sqr(i), n >>= z;
   return r;
 }
 function es(e, t) {
@@ -560,9 +560,9 @@ function ts(e, t, n = !1, r = {}) {
     ORDER: e,
     BITS: i,
     BYTES: s,
-    MASK: Jt(i),
+    MASK: Gt(i),
     ZERO: W,
-    ONE: j,
+    ONE: z,
     create: (a) => V(a, e),
     isValid: (a) => {
       if (typeof a != "bigint")
@@ -570,7 +570,7 @@ function ts(e, t, n = !1, r = {}) {
       return W <= a && a < e;
     },
     is0: (a) => a === W,
-    isOdd: (a) => (a & j) === j,
+    isOdd: (a) => (a & z) === z,
     neg: (a) => V(-a, e),
     eql: (a, l) => a === l,
     sqr: (a) => V(a * a, e),
@@ -578,23 +578,23 @@ function ts(e, t, n = !1, r = {}) {
     sub: (a, l) => V(a - l, e),
     mul: (a, l) => V(a * l, e),
     pow: (a, l) => Qi(c, a, l),
-    div: (a, l) => V(a * Tt(l, e), e),
+    div: (a, l) => V(a * Rt(l, e), e),
     // Same as above, but doesn't normalize
     sqrN: (a) => a * a,
     addN: (a, l) => a + l,
     subN: (a, l) => a - l,
     mulN: (a, l) => a * l,
-    inv: (a) => Tt(a, e),
+    inv: (a) => Rt(a, e),
     sqrt: r.sqrt || ((a) => o(c, a)),
     invertBatch: (a) => es(c, a),
     // TODO: do we really need constant cmov?
     // We don't have const-time bigints anyway, so probably will be not very useful
     cmov: (a, l, f) => f ? l : a,
-    toBytes: (a) => n ? Ft(a, s) : Ne(a, s),
+    toBytes: (a) => n ? Ft(a, s) : Ke(a, s),
     fromBytes: (a) => {
       if (a.length !== s)
         throw new Error(`Fp.fromBytes: expected ${s}, got ${a.length}`);
-      return n ? Gt(a) : F(a);
+      return n ? Zt(a) : G(a);
     }
   });
   return Object.freeze(c);
@@ -613,11 +613,11 @@ function ns(e, t, n = !1) {
   const r = e.length, i = nr(t), s = rr(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error(`expected ${s}-1024 bytes of input, got ${r}`);
-  const o = n ? F(e) : Gt(e), c = V(o, t - j) + j;
-  return n ? Ft(c, i) : Ne(c, i);
+  const o = n ? G(e) : Zt(e), c = V(o, t - z) + z;
+  return n ? Ft(c, i) : Ke(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const rs = BigInt(0), At = BigInt(1);
+const rs = BigInt(0), St = BigInt(1);
 function is(e, t) {
   const n = (i, s) => {
     const o = s.negate();
@@ -632,7 +632,7 @@ function is(e, t) {
     unsafeLadder(i, s) {
       let o = e.ZERO, c = i;
       for (; s > rs; )
-        s & At && (o = o.add(c)), c = c.double(), s >>= At;
+        s & St && (o = o.add(c)), c = c.double(), s >>= St;
       return o;
     },
     /**
@@ -650,7 +650,7 @@ function is(e, t) {
       let l = i, f = l;
       for (let u = 0; u < o; u++) {
         f = l, a.push(f);
-        for (let g = 1; g < c; g++)
+        for (let p = 1; p < c; p++)
           f = f.add(l), a.push(f);
         l = f.double();
       }
@@ -666,13 +666,13 @@ function is(e, t) {
     wNAF(i, s, o) {
       const { windows: c, windowSize: a } = r(i);
       let l = e.ZERO, f = e.BASE;
-      const u = BigInt(2 ** i - 1), g = 2 ** i, w = BigInt(i);
-      for (let y = 0; y < c; y++) {
-        const h = y * a;
+      const u = BigInt(2 ** i - 1), p = 2 ** i, w = BigInt(i);
+      for (let g = 0; g < c; g++) {
+        const h = g * a;
         let d = Number(o & u);
-        o >>= w, d > a && (d -= g, o += At);
-        const p = h, E = h + Math.abs(d) - 1, S = y % 2 !== 0, I = d < 0;
-        d === 0 ? f = f.add(n(S, s[p])) : l = l.add(n(I, s[E]));
+        o >>= w, d > a && (d -= p, o += St);
+        const y = h, E = h + Math.abs(d) - 1, S = g % 2 !== 0, _ = d < 0;
+        d === 0 ? f = f.add(n(S, s[y])) : l = l.add(n(_, s[E]));
       }
       return { p: l, f };
     },
@@ -768,65 +768,65 @@ BigInt(2);
 const Un = BigInt(3);
 BigInt(4);
 function cs(e) {
-  const t = ss(e), { Fp: n } = t, r = t.toBytes || ((y, h, d) => {
-    const p = h.toAffine();
-    return _e(Uint8Array.from([4]), n.toBytes(p.x), n.toBytes(p.y));
-  }), i = t.fromBytes || ((y) => {
-    const h = y.subarray(1), d = n.fromBytes(h.subarray(0, n.BYTES)), p = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
-    return { x: d, y: p };
+  const t = ss(e), { Fp: n } = t, r = t.toBytes || ((g, h, d) => {
+    const y = h.toAffine();
+    return Ie(Uint8Array.from([4]), n.toBytes(y.x), n.toBytes(y.y));
+  }), i = t.fromBytes || ((g) => {
+    const h = g.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(y) {
-    const { a: h, b: d } = t, p = n.sqr(y), E = n.mul(p, y);
-    return n.add(n.add(E, n.mul(y, h)), d);
+  function s(g) {
+    const { a: h, b: d } = t, y = n.sqr(g), E = n.mul(y, g);
+    return n.add(n.add(E, n.mul(g, h)), d);
   }
   if (!n.eql(n.sqr(t.Gy), s(t.Gx)))
     throw new Error("bad generator point: equation left != right");
-  function o(y) {
-    return typeof y == "bigint" && ce < y && y < t.n;
+  function o(g) {
+    return typeof g == "bigint" && ce < g && g < t.n;
   }
-  function c(y) {
-    if (!o(y))
+  function c(g) {
+    if (!o(g))
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
-  function a(y) {
-    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: p, n: E } = t;
-    if (h && typeof y != "bigint") {
-      if (y instanceof Uint8Array && (y = De(y)), typeof y != "string" || !h.includes(y.length))
+  function a(g) {
+    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: y, n: E } = t;
+    if (h && typeof g != "bigint") {
+      if (g instanceof Uint8Array && (g = De(g)), typeof g != "string" || !h.includes(g.length))
         throw new Error("Invalid key");
-      y = y.padStart(d * 2, "0");
+      g = g.padStart(d * 2, "0");
     }
     let S;
     try {
-      S = typeof y == "bigint" ? y : F(Z("private key", y, d));
+      S = typeof g == "bigint" ? g : G(Z("private key", g, d));
     } catch {
-      throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof y}`);
+      throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof g}`);
     }
-    return p && (S = V(S, E)), c(S), S;
+    return y && (S = V(S, E)), c(S), S;
   }
   const l = /* @__PURE__ */ new Map();
-  function f(y) {
-    if (!(y instanceof u))
+  function f(g) {
+    if (!(g instanceof u))
       throw new Error("ProjectivePoint expected");
   }
   class u {
-    constructor(h, d, p) {
-      if (this.px = h, this.py = d, this.pz = p, 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 (d == null || !n.isValid(d))
         throw new Error("y required");
-      if (p == null || !n.isValid(p))
+      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: d, y: p } = h || {};
-      if (!h || !n.isValid(d) || !n.isValid(p))
+      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 = (S) => n.eql(S, n.ZERO);
-      return E(d) && E(p) ? u.ZERO : new u(d, p, n.ONE);
+      return E(d) && E(y) ? u.ZERO : new u(d, y, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -841,8 +841,8 @@ function cs(e) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(h) {
-      const d = n.invertBatch(h.map((p) => p.pz));
-      return h.map((p, E) => p.toAffine(d[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.
@@ -870,8 +870,8 @@ function cs(e) {
       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 p = n.sqr(d), E = s(h);
-      if (!n.eql(p, 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 cs(e) {
      */
     equals(h) {
       f(h);
-      const { px: d, py: p, pz: E } = this, { px: S, py: I, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(S, E)), x = n.eql(n.mul(p, B), n.mul(I, E));
+      const { px: d, py: y, pz: E } = this, { px: S, py: _, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(S, E)), x = n.eql(n.mul(y, B), n.mul(_, E));
       return m && x;
     }
     /**
@@ -901,9 +901,9 @@ function cs(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: h, b: d } = t, p = n.mul(d, Un), { px: E, py: S, pz: I } = this;
-      let B = n.ZERO, m = n.ZERO, x = n.ZERO, K = n.mul(E, E), M = n.mul(S, S), _ = n.mul(I, I), A = n.mul(E, S);
-      return A = n.add(A, A), x = n.mul(E, I), x = n.add(x, x), B = n.mul(h, x), m = n.mul(p, _), m = n.add(B, m), B = n.sub(M, m), m = n.add(M, m), m = n.mul(B, m), B = n.mul(A, B), x = n.mul(p, x), _ = n.mul(h, _), A = n.sub(K, _), A = n.mul(h, A), A = n.add(A, x), x = n.add(K, K), K = n.add(x, K), K = n.add(K, _), K = n.mul(K, A), m = n.add(m, K), _ = n.mul(S, I), _ = n.add(_, _), K = n.mul(_, A), B = n.sub(B, K), x = n.mul(_, M), x = n.add(x, x), x = n.add(x, x), new u(B, m, x);
+      const { a: h, b: d } = t, y = n.mul(d, Un), { px: E, py: S, pz: _ } = this;
+      let B = n.ZERO, m = n.ZERO, x = n.ZERO, N = n.mul(E, E), M = n.mul(S, S), I = n.mul(_, _), A = n.mul(E, S);
+      return A = n.add(A, A), x = n.mul(E, _), x = n.add(x, x), B = n.mul(h, x), m = n.mul(y, I), m = n.add(B, m), B = n.sub(M, m), m = n.add(M, m), m = n.mul(B, m), B = n.mul(A, B), x = n.mul(y, x), I = n.mul(h, I), A = n.sub(N, I), A = n.mul(h, A), A = n.add(A, x), x = n.add(N, N), N = n.add(x, N), N = n.add(N, I), N = n.mul(N, A), m = n.add(m, N), I = n.mul(S, _), I = n.add(I, I), N = n.mul(I, A), B = n.sub(B, N), x = n.mul(I, M), 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 cs(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: d, py: p, pz: E } = this, { px: S, py: I, pz: B } = h;
-      let m = n.ZERO, x = n.ZERO, K = n.ZERO;
-      const M = t.a, _ = n.mul(t.b, Un);
-      let A = n.mul(d, S), R = n.mul(p, I), T = n.mul(E, B), q = n.add(d, p), b = n.add(S, I);
+      const { px: d, py: y, pz: E } = this, { px: S, py: _, pz: B } = h;
+      let m = n.ZERO, x = n.ZERO, N = n.ZERO;
+      const M = t.a, I = n.mul(t.b, Un);
+      let A = n.mul(d, S), R = n.mul(y, _), T = n.mul(E, B), q = n.add(d, y), b = n.add(S, _);
       q = n.mul(q, b), b = n.add(A, R), q = n.sub(q, b), b = n.add(d, E);
       let v = n.add(S, B);
-      return b = n.mul(b, v), v = n.add(A, T), b = n.sub(b, v), v = n.add(p, E), m = n.add(I, B), v = n.mul(v, m), m = n.add(R, T), v = n.sub(v, m), K = n.mul(M, b), m = n.mul(_, T), K = n.add(m, K), m = n.sub(R, K), K = n.add(R, K), x = n.mul(m, K), R = n.add(A, A), R = n.add(R, A), T = n.mul(M, T), b = n.mul(_, b), R = n.add(R, T), T = n.sub(A, T), T = n.mul(M, T), b = n.add(b, T), A = n.mul(R, b), x = n.add(x, A), A = n.mul(v, b), m = n.mul(q, m), m = n.sub(m, A), A = n.mul(q, R), K = n.mul(v, K), K = n.add(K, A), new u(m, x, K);
+      return b = n.mul(b, v), v = n.add(A, T), b = n.sub(b, v), v = n.add(y, E), m = n.add(_, B), v = n.mul(v, m), m = n.add(R, T), v = n.sub(v, m), N = n.mul(M, b), m = n.mul(I, T), N = n.add(m, N), m = n.sub(R, N), N = n.add(R, N), x = n.mul(m, N), R = n.add(A, A), R = n.add(R, A), T = n.mul(M, T), b = n.mul(I, b), R = n.add(R, T), T = n.sub(A, T), T = n.mul(M, T), b = n.add(b, T), A = n.mul(R, b), x = n.add(x, A), A = n.mul(v, b), m = n.mul(q, m), m = n.sub(m, A), A = n.mul(q, R), N = n.mul(v, N), N = n.add(N, A), new u(m, x, N);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -927,8 +927,8 @@ function cs(e) {
     }
     wNAF(h) {
       return w.wNAFCached(this, l, h, (d) => {
-        const p = n.invertBatch(d.map((E) => E.pz));
-        return d.map((E, S) => E.toAffine(p[S])).map(u.fromAffine);
+        const y = n.invertBatch(d.map((E) => E.pz));
+        return d.map((E, S) => E.toAffine(y[S])).map(u.fromAffine);
       });
     }
     /**
@@ -942,13 +942,13 @@ function cs(e) {
         return d;
       if (c(h), h === X)
         return this;
-      const { endo: p } = t;
-      if (!p)
+      const { endo: y } = t;
+      if (!y)
         return w.unsafeLadder(this, h);
-      let { k1neg: E, k1: S, k2neg: I, k2: B } = p.splitScalar(h), m = d, x = d, K = this;
+      let { k1neg: E, k1: S, k2neg: _, k2: B } = y.splitScalar(h), m = d, x = d, N = this;
       for (; S > ce || B > ce; )
-        S & X && (m = m.add(K)), B & X && (x = x.add(K)), K = K.double(), S >>= X, B >>= X;
-      return E && (m = m.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, p.beta), x.py, x.pz), m.add(x);
+        S & X && (m = m.add(N)), B & X && (x = x.add(N)), N = N.double(), S >>= X, B >>= X;
+      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 cs(e) {
      */
     multiply(h) {
       c(h);
-      let d = h, p, E;
+      let d = h, y, E;
       const { endo: S } = t;
       if (S) {
-        const { k1neg: I, k1: B, k2neg: m, k2: x } = S.splitScalar(d);
-        let { p: K, f: M } = this.wNAF(B), { p: _, f: A } = this.wNAF(x);
-        K = w.constTimeNegate(I, K), _ = w.constTimeNegate(m, _), _ = new u(n.mul(_.px, S.beta), _.py, _.pz), p = K.add(_), E = M.add(A);
+        const { k1neg: _, k1: B, k2neg: m, k2: x } = S.splitScalar(d);
+        let { p: N, f: M } = this.wNAF(B), { p: I, f: A } = this.wNAF(x);
+        N = w.constTimeNegate(_, N), I = w.constTimeNegate(m, I), I = new u(n.mul(I.px, S.beta), I.py, I.pz), y = N.add(I), E = M.add(A);
       } else {
-        const { p: I, f: B } = this.wNAF(d);
-        p = I, E = B;
+        const { p: _, f: B } = this.wNAF(d);
+        y = _, E = B;
       }
-      return u.normalizeZ([p, E])[0];
+      return u.normalizeZ([y, E])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -979,22 +979,22 @@ function cs(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, d, p) {
-      const E = u.BASE, S = (B, m) => m === ce || m === X || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), I = S(this, d).add(S(h, p));
-      return I.is0() ? void 0 : I;
+    multiplyAndAddUnsafe(h, d, y) {
+      const E = u.BASE, S = (B, m) => m === ce || m === X || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), _ = S(this, d).add(S(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: d, py: p, pz: E } = this, S = this.is0();
+      const { px: d, py: y, pz: E } = this, S = this.is0();
       h == null && (h = S ? n.ONE : n.inv(E));
-      const I = n.mul(d, h), B = n.mul(p, h), m = n.mul(E, h);
+      const _ = n.mul(d, h), B = n.mul(y, h), m = n.mul(E, h);
       if (S)
         return { x: n.ZERO, y: n.ZERO };
       if (!n.eql(m, n.ONE))
         throw new Error("invZ was invalid");
-      return { x: I, y: B };
+      return { x: _, y: B };
     }
     isTorsionFree() {
       const { h, isTorsionFree: d } = t;
@@ -1016,7 +1016,7 @@ function cs(e) {
     }
   }
   u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
-  const g = t.nBitLength, w = is(u, t.endo ? Math.ceil(g / 2) : g);
+  const p = t.nBitLength, w = is(u, t.endo ? Math.ceil(p / 2) : p);
   return {
     CURVE: t,
     ProjectivePoint: u,
@@ -1046,68 +1046,68 @@ function ls(e) {
     return V(b, r);
   }
   function a(b) {
-    return Tt(b, r);
+    return Rt(b, r);
   }
-  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: g } = cs({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: p } = cs({
     ...t,
-    toBytes(b, v, N) {
-      const k = v.toAffine(), C = n.toBytes(k.x), U = _e;
-      return N ? U(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : U(Uint8Array.from([4]), C, n.toBytes(k.y));
+    toBytes(b, v, K) {
+      const k = v.toAffine(), C = n.toBytes(k.x), U = Ie;
+      return K ? U(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : U(Uint8Array.from([4]), C, n.toBytes(k.y));
     },
     fromBytes(b) {
-      const v = b.length, N = b[0], k = b.subarray(1);
-      if (v === i && (N === 2 || N === 3)) {
-        const C = F(k);
+      const v = b.length, K = b[0], k = b.subarray(1);
+      if (v === i && (K === 2 || K === 3)) {
+        const C = G(k);
         if (!o(C))
           throw new Error("Point is not on curve");
         const U = u(C);
         let O = n.sqrt(U);
         const $ = (O & X) === X;
-        return (N & 1) === 1 !== $ && (O = n.neg(O)), { x: C, y: O };
-      } else if (v === s && N === 4) {
+        return (K & 1) === 1 !== $ && (O = n.neg(O)), { x: C, y: O };
+      } else if (v === s && K === 4) {
         const C = n.fromBytes(k.subarray(0, n.BYTES)), U = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
         return { x: C, y: U };
       } else
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${s} uncompressed bytes`);
     }
-  }), w = (b) => De(Ne(b, t.nByteLength));
-  function y(b) {
+  }), w = (b) => De(Ke(b, t.nByteLength));
+  function g(b) {
     const v = r >> X;
     return b > v;
   }
   function h(b) {
-    return y(b) ? c(-b) : b;
+    return g(b) ? c(-b) : b;
   }
-  const d = (b, v, N) => F(b.slice(v, N));
-  class p {
-    constructor(v, N, k) {
-      this.r = v, this.s = N, this.recovery = k, this.assertValidity();
+  const d = (b, v, K) => G(b.slice(v, K));
+  class y {
+    constructor(v, K, k) {
+      this.r = v, this.s = K, this.recovery = k, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
-      const N = t.nByteLength;
-      return v = Z("compactSignature", v, N * 2), new p(d(v, 0, N), d(v, N, 2 * N));
+      const K = t.nByteLength;
+      return v = Z("compactSignature", v, K * 2), new y(d(v, 0, K), d(v, K, 2 * K));
     }
     // 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: N, s: k } = Be.toSig(Z("DER", v));
-      return new p(N, k);
+      const { r: K, s: k } = Be.toSig(Z("DER", v));
+      return new y(K, k);
     }
     assertValidity() {
-      if (!g(this.r))
+      if (!p(this.r))
         throw new Error("r must be 0 < r < CURVE.n");
-      if (!g(this.s))
+      if (!p(this.s))
         throw new Error("s must be 0 < s < CURVE.n");
     }
     addRecoveryBit(v) {
-      return new p(this.r, this.s, v);
+      return new y(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: N, s: k, recovery: C } = this, U = x(Z("msgHash", v));
+      const { r: K, s: k, recovery: C } = this, U = x(Z("msgHash", v));
       if (C == null || ![0, 1, 2, 3].includes(C))
         throw new Error("recovery id invalid");
-      const O = C === 2 || C === 3 ? N + t.n : N;
+      const O = C === 2 || C === 3 ? K + t.n : K;
       if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
       const $ = (C & 1) === 0 ? "02" : "03", ee = l.fromHex($ + w(O)), ge = a(O), Ue = c(-U * ge), Ve = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(ee, Ue, Ve);
@@ -1117,10 +1117,10 @@ function ls(e) {
     }
     // Signatures should be low-s, to prevent malleability.
     hasHighS() {
-      return y(this.s);
+      return g(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new p(this.r, c(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new y(this.r, c(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
@@ -1169,45 +1169,45 @@ function ls(e) {
   function S(b, v = !0) {
     return l.fromPrivateKey(b).toRawBytes(v);
   }
-  function I(b) {
-    const v = b instanceof Uint8Array, N = typeof b == "string", k = (v || N) && b.length;
-    return v ? k === i || k === s : N ? k === 2 * i || k === 2 * s : b instanceof l;
+  function _(b) {
+    const v = b instanceof Uint8Array, K = typeof b == "string", k = (v || K) && b.length;
+    return v ? k === i || k === s : K ? k === 2 * i || k === 2 * s : b instanceof l;
   }
-  function B(b, v, N = !0) {
-    if (I(b))
+  function B(b, v, K = !0) {
+    if (_(b))
       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(N);
+    return l.fromHex(v).multiply(f(b)).toRawBytes(K);
   }
   const m = t.bits2int || function(b) {
-    const v = F(b), N = b.length * 8 - t.nBitLength;
-    return N > 0 ? v >> BigInt(N) : v;
+    const v = G(b), K = b.length * 8 - t.nBitLength;
+    return K > 0 ? v >> BigInt(K) : v;
   }, x = t.bits2int_modN || function(b) {
     return c(m(b));
-  }, K = Jt(t.nBitLength);
+  }, N = Gt(t.nBitLength);
   function M(b) {
     if (typeof b != "bigint")
       throw new Error("bigint expected");
-    if (!(ce <= b && b < K))
+    if (!(ce <= b && b < N))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
-    return Ne(b, t.nByteLength);
+    return Ke(b, t.nByteLength);
   }
-  function _(b, v, N = A) {
-    if (["recovered", "canonical"].some((Ae) => Ae in N))
+  function I(b, v, K = A) {
+    if (["recovered", "canonical"].some((Ae) => Ae in K))
       throw new Error("sign() legacy options not supported");
     const { hash: k, randomBytes: C } = t;
-    let { lowS: U, prehash: O, extraEntropy: $ } = N;
+    let { lowS: U, prehash: O, extraEntropy: $ } = K;
     U == null && (U = !0), b = Z("msgHash", b), O && (b = Z("prehashed msgHash", k(b)));
     const ee = x(b), ge = f(v), Ue = [M(ge), M(ee)];
     if ($ != null) {
       const Ae = $ === !0 ? C(n.BYTES) : $;
       Ue.push(Z("extraEntropy", Ae));
     }
-    const Ve = _e(...Ue), we = ee;
-    function xt(Ae) {
+    const Ve = Ie(...Ue), we = ee;
+    function Et(Ae) {
       const Le = m(Ae);
-      if (!g(Le))
+      if (!p(Le))
         return;
       const Sn = a(Le), $e = l.BASE.multiply(Le).toAffine(), te = c($e.x);
       if (te === ce)
@@ -1216,38 +1216,38 @@ function ls(e) {
       if (Re === ce)
         return;
       let An = ($e.x === te ? 0 : 2) | Number($e.y & X), Cn = Re;
-      return U && y(Re) && (Cn = h(Re), An ^= 1), new p(te, Cn, An);
+      return U && g(Re) && (Cn = h(Re), An ^= 1), new y(te, Cn, An);
     }
-    return { seed: Ve, k2sig: xt };
+    return { seed: Ve, k2sig: Et };
   }
   const A = { lowS: t.lowS, prehash: !1 }, R = { lowS: t.lowS, prehash: !1 };
-  function T(b, v, N = A) {
-    const { seed: k, k2sig: C } = _(b, v, N), U = t;
+  function T(b, v, K = A) {
+    const { seed: k, k2sig: C } = I(b, v, K), U = t;
     return er(U.hash.outputLen, U.nByteLength, U.hmac)(k, C);
   }
   l.BASE._setWindowSize(8);
-  function q(b, v, N, k = R) {
+  function q(b, v, K, k = R) {
     var $e;
     const C = b;
-    if (v = Z("msgHash", v), N = Z("publicKey", N), "strict" in k)
+    if (v = Z("msgHash", v), K = Z("publicKey", K), "strict" in k)
       throw new Error("options.strict was renamed to lowS");
     const { lowS: U, prehash: O } = k;
     let $, ee;
     try {
       if (typeof C == "string" || C instanceof Uint8Array)
         try {
-          $ = p.fromDER(C);
+          $ = y.fromDER(C);
         } catch (te) {
           if (!(te instanceof Be.Err))
             throw te;
-          $ = p.fromCompact(C);
+          $ = y.fromCompact(C);
         }
       else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
         const { r: te, s: Re } = C;
-        $ = new p(te, Re);
+        $ = new y(te, Re);
       } else
         throw new Error("PARSE");
-      ee = l.fromHex(N);
+      ee = l.fromHex(K);
     } catch (te) {
       if (te.message === "PARSE")
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
@@ -1256,7 +1256,7 @@ function ls(e) {
     if (U && $.hasHighS())
       return !1;
     O && (v = t.hash(v));
-    const { r: ge, s: Ue } = $, Ve = x(v), we = a(Ue), xt = c(Ve * we), Ae = c(ge * we), Le = ($e = l.BASE.multiplyAndAddUnsafe(ee, xt, Ae)) == null ? void 0 : $e.toAffine();
+    const { r: ge, s: Ue } = $, Ve = x(v), we = a(Ue), Et = c(Ve * we), Ae = c(ge * we), Le = ($e = l.BASE.multiplyAndAddUnsafe(ee, Et, Ae)) == null ? void 0 : $e.toAffine();
     return Le ? c(Le.x) === ge : !1;
   }
   return {
@@ -1266,14 +1266,14 @@ function ls(e) {
     sign: T,
     verify: q,
     ProjectivePoint: l,
-    Signature: p,
+    Signature: y,
     utils: E
   };
 }
 let sr = class extends Jn {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, Si(t);
-    const r = Vt(n);
+    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;
@@ -1290,7 +1290,7 @@ let sr = class extends Jn {
     return et(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    et(this), Gn(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    et(this), Fn(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);
@@ -1322,15 +1322,15 @@ function hs(e, t) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const ut = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), ar = BigInt(1), nt = BigInt(2), Ln = (e, t) => (e + t / nt) / t;
 function cr(e) {
-  const t = ut, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = Y(f, n, t) * f % t, g = Y(u, n, t) * f % t, w = Y(g, nt, t) * l % t, y = Y(w, i, t) * w % t, h = Y(y, s, t) * y % t, d = Y(h, c, t) * h % t, p = Y(d, a, t) * d % t, E = Y(p, c, t) * h % t, S = Y(E, n, t) * f % t, I = Y(S, o, t) * y % t, B = Y(I, r, t) * l % t, m = Y(B, nt, t);
-  if (!Ot.eql(Ot.sqr(m), e))
+  const t = ut, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = Y(f, n, t) * f % t, p = Y(u, n, t) * f % t, w = Y(p, nt, t) * l % t, g = Y(w, i, t) * w % t, h = Y(g, s, t) * g % t, d = Y(h, c, t) * h % t, y = Y(d, a, t) * d % t, E = Y(y, c, t) * h % t, S = Y(E, n, t) * f % t, _ = Y(S, o, t) * g % t, B = Y(_, r, t) * l % t, m = Y(B, nt, t);
+  if (!Tt.eql(Tt.sqr(m), e))
     throw new Error("Cannot find square root");
   return m;
 }
-const Ot = ts(ut, void 0, void 0, { sqrt: cr }), Ie = hs({
+const Tt = ts(ut, void 0, void 0, { sqrt: cr }), _e = hs({
   a: BigInt(0),
   b: BigInt(7),
-  Fp: Ot,
+  Fp: Tt,
   n: tt,
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
@@ -1348,60 +1348,60 @@ const Ot = ts(ut, void 0, void 0, { sqrt: cr }), Ie = hs({
     splitScalar: (e) => {
       const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -ar * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = Ln(s * e, t), a = Ln(-r * e, t);
       let l = V(e - c * n - a * i, t), f = V(-c * r - a * s, t);
-      const u = l > o, g = f > o;
-      if (u && (l = t - l), g && (f = t - f), l > o || f > o)
+      const u = l > o, p = f > o;
+      if (u && (l = t - l), p && (f = t - f), l > o || f > o)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
-      return { k1neg: u, k1: l, k2neg: g, k2: f };
+      return { k1neg: u, k1: l, k2neg: p, k2: f };
     }
   }
-}, $t), lt = BigInt(0), ur = (e) => typeof e == "bigint" && lt < e && e < ut, ds = (e) => typeof e == "bigint" && lt < e && e < tt, $n = {};
+}, Lt), lt = BigInt(0), ur = (e) => typeof e == "bigint" && lt < e && e < ut, ds = (e) => typeof e == "bigint" && lt < e && e < tt, $n = {};
 function rt(e, ...t) {
   let n = $n[e];
   if (n === void 0) {
-    const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = _e(r, r), $n[e] = n;
+    const r = Lt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    n = Ie(r, r), $n[e] = n;
   }
-  return $t(_e(n, ...t));
+  return Lt(Ie(n, ...t));
 }
-const Yt = (e) => e.toRawBytes(!0).slice(1), Mt = (e) => Ne(e, 32), Ct = (e) => V(e, ut), Fe = (e) => V(e, tt), Xt = Ie.ProjectivePoint, ps = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
-function Pt(e) {
-  let t = Ie.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
-  return { scalar: n.hasEvenY() ? t : Fe(-t), bytes: Yt(n) };
+const Jt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => Ke(e, 32), At = (e) => V(e, ut), Ge = (e) => V(e, tt), Yt = _e.ProjectivePoint, ps = (e, t, n) => Yt.BASE.multiplyAndAddUnsafe(e, t, n);
+function Mt(e) {
+  let t = _e.utils.normPrivateKeyToScalar(e), n = Yt.fromPrivateKey(t);
+  return { scalar: n.hasEvenY() ? t : Ge(-t), bytes: Jt(n) };
 }
 function lr(e) {
   if (!ur(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = Ct(e * e), n = Ct(t * e + BigInt(7));
+  const t = At(e * e), n = At(t * e + BigInt(7));
   let r = cr(n);
-  r % nt !== lt && (r = Ct(-r));
-  const i = new Xt(e, r, ar);
+  r % nt !== lt && (r = At(-r));
+  const i = new Yt(e, r, ar);
   return i.assertValidity(), i;
 }
 function fr(...e) {
-  return Fe(F(rt("BIP0340/challenge", ...e)));
+  return Ge(G(rt("BIP0340/challenge", ...e)));
 }
 function ys(e) {
-  return Pt(e).bytes;
+  return Mt(e).bytes;
 }
 function gs(e, t, n = Yn(32)) {
-  const r = Z("message", e), { bytes: i, scalar: s } = Pt(t), o = Z("auxRand", n, 32), c = Mt(s ^ F(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Fe(F(a));
+  const r = Z("message", e), { bytes: i, scalar: s } = Mt(t), o = Z("auxRand", n, 32), c = Ot(s ^ G(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Ge(G(a));
   if (l === lt)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Pt(l), g = fr(f, i, r), w = new Uint8Array(64);
-  if (w.set(f, 0), w.set(Mt(Fe(u + g * s)), 32), !hr(w, r, i))
+  const { bytes: f, scalar: u } = Mt(l), p = fr(f, i, r), w = new Uint8Array(64);
+  if (w.set(f, 0), w.set(Ot(Ge(u + p * s)), 32), !hr(w, r, i))
     throw new Error("sign: Invalid signature produced");
   return w;
 }
 function hr(e, t, n) {
   const r = Z("signature", e, 64), i = Z("message", t), s = Z("publicKey", n, 32);
   try {
-    const o = lr(F(s)), c = F(r.subarray(0, 32));
+    const o = lr(G(s)), c = G(r.subarray(0, 32));
     if (!ur(c))
       return !1;
-    const a = F(r.subarray(32, 64));
+    const a = G(r.subarray(32, 64));
     if (!ds(a))
       return !1;
-    const l = fr(Mt(c), Yt(o), i), f = ps(o, a, Fe(-l));
+    const l = fr(Ot(c), Jt(o), i), f = ps(o, a, Ge(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
   } catch {
     return !1;
@@ -1412,29 +1412,29 @@ const Ze = {
   sign: gs,
   verify: hr,
   utils: {
-    randomPrivateKey: Ie.utils.randomPrivateKey,
+    randomPrivateKey: _e.utils.randomPrivateKey,
     lift_x: lr,
-    pointToBytes: Yt,
-    numberToBytesBE: Ne,
-    bytesToNumberBE: F,
+    pointToBytes: Jt,
+    numberToBytesBE: Ke,
+    bytesToNumberBE: G,
     taggedHash: rt,
     mod: V
   }
-}, Bt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+}, Ct = 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), ie = (e, t) => e << 32 - t | e >>> t, ws = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Xt = (e) => e instanceof Uint8Array, Bt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, ws = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!ws)
   throw new Error("Non little-endian hardware is not supported");
 const bs = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function H(e) {
-  if (!Qt(e))
+function P(e) {
+  if (!Xt(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
     t += bs[e[n]];
   return t;
 }
-function z(e) {
+function j(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   const t = e.length;
@@ -1455,7 +1455,7 @@ function vs(e) {
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Je(e) {
-  if (typeof e == "string" && (e = vs(e)), !Qt(e))
+  if (typeof e == "string" && (e = vs(e)), !Xt(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -1463,7 +1463,7 @@ function ft(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!Qt(r))
+    if (!Xt(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
@@ -1479,11 +1479,11 @@ function pr(e) {
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function yr(e = 32) {
-  if (Bt && typeof Bt.getRandomValues == "function")
-    return Bt.getRandomValues(new Uint8Array(e));
+  if (Ct && typeof Ct.getRandomValues == "function")
+    return Ct.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Ht(e) {
+function Pt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -1500,7 +1500,7 @@ function gr(e, ...t) {
 function Es(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);
+  Pt(e.outputLen), Pt(e.blockLen);
 }
 function xs(e, t = !0) {
   if (e.destroyed)
@@ -1508,21 +1508,21 @@ function xs(e, t = !0) {
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function Ks(e, t) {
+function Ns(e, t) {
   gr(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,
+  number: Pt,
   bool: ms,
   bytes: gr,
   hash: Es,
   exists: xs,
-  output: Ks
+  output: Ns
 };
-function Ns(e, t, n, r) {
+function Ks(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), c = Number(n & s), a = r ? 4 : 0, l = r ? 0 : 4;
@@ -1530,7 +1530,7 @@ function Ns(e, t, n, r) {
 }
 class Ss extends dr {
   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);
+    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 = Bt(this.buffer);
   }
   update(t) {
     se.exists(this);
@@ -1540,7 +1540,7 @@ class Ss extends dr {
     for (let o = 0; o < s; ) {
       const c = Math.min(i - this.pos, s - o);
       if (c === i) {
-        const a = kt(t);
+        const a = Bt(t);
         for (; i <= s - o; o += i)
           this.process(a, o);
         continue;
@@ -1556,8 +1556,8 @@ class Ss extends dr {
     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;
-    Ns(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const c = kt(t), a = this.outputLen;
+    Ks(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const c = Bt(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = a / 4, f = this.get();
@@ -1669,12 +1669,12 @@ class wr extends Ss {
     for (let u = 0; u < 16; u++, n += 4)
       Ee[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const g = Ee[u - 15], w = Ee[u - 2], y = ie(g, 7) ^ ie(g, 18) ^ g >>> 3, h = ie(w, 17) ^ ie(w, 19) ^ w >>> 10;
-      Ee[u] = h + Ee[u - 7] + y + Ee[u - 16] | 0;
+      const p = Ee[u - 15], w = Ee[u - 2], g = ie(p, 7) ^ ie(p, 18) ^ p >>> 3, h = ie(w, 17) ^ ie(w, 19) ^ w >>> 10;
+      Ee[u] = h + Ee[u - 7] + g + Ee[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const g = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), w = f + g + As(c, a, l) + Bs[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + Cs(r, i, s) | 0;
+      const p = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), w = f + p + As(c, a, l) + Bs[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + Cs(r, i, s) | 0;
       f = l, l = a, a = c, c = o + w | 0, o = s, s = i, i = r, r = w + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
@@ -1815,7 +1815,7 @@ function Rn(e, t, n) {
   return i.reverse();
 }
 const vr = (e, t) => t ? vr(t, e % t) : e, it = (e, t) => e + (t - vr(e, t));
-function qt(e, t, n, r) {
+function Ht(e, t, n, r) {
   if (!Array.isArray(e))
     throw new Error("convertRadix2: data should be array");
   if (t <= 0 || t > 32)
@@ -1841,7 +1841,7 @@ function qt(e, t, n, r) {
     throw new Error(`Non-zero padding: ${i}`);
   return r && s > 0 && c.push(i >>> 0), c;
 }
-function _s(e) {
+function Is(e) {
   return We(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
@@ -1864,12 +1864,12 @@ function Se(e, t = !1) {
     encode: (n) => {
       if (!(n instanceof Uint8Array))
         throw new Error("radix2.encode input should be Uint8Array");
-      return qt(Array.from(n), 8, e, !t);
+      return Ht(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(Ht(n, e, 8, t));
     }
   };
 }
@@ -1883,25 +1883,25 @@ function Tn(e) {
     }
   };
 }
-const Is = de(Se(4), pe("0123456789ABCDEF"), ye("")), Us = de(Se(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ht(5), ye(""));
+const _s = de(Se(4), pe("0123456789ABCDEF"), ye("")), Us = de(Se(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ht(5), ye(""));
 de(Se(5), pe("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ht(5), ye(""));
 de(Se(5), pe("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), ye(""), br((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const he = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ht(6), ye("")), Ls = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ht(6), ye("")), en = (e) => de(_s(58), pe(e), ye("")), Dt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
-en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
+const he = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ht(6), ye("")), Ls = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ht(6), ye("")), Qt = (e) => de(Is(58), pe(e), ye("")), qt = Qt("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+Qt("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
+Qt("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
 const On = [0, 2, 3, 5, 6, 7, 9, 10, 11], $s = {
   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(On[r.length], "1");
+      t += qt.encode(r).padStart(On[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 = On.indexOf(r.length), s = Dt.decode(r);
+      const r = e.slice(n, n + 11), i = On.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,8 +1909,8 @@ const On = [0, 2, 3, 5, 6, 7, 9, 10, 11], $s = {
     }
     return Uint8Array.from(t);
   }
-}, jt = de(pe("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), ye("")), Mn = [996825010, 642813549, 513874426, 1027748829, 705979059];
-function Ge(e) {
+}, Dt = de(pe("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), ye("")), Mn = [996825010, 642813549, 513874426, 1027748829, 705979059];
+function Fe(e) {
   const t = e >> 25;
   let n = (e & 33554431) << 5;
   for (let r = 0; r < Mn.length; r++)
@@ -1924,53 +1924,53 @@ function Pn(e, t, n = 1) {
     const o = e.charCodeAt(s);
     if (o < 33 || o > 126)
       throw new Error(`Invalid prefix (${e})`);
-    i = Ge(i) ^ o >> 5;
+    i = Fe(i) ^ o >> 5;
   }
-  i = Ge(i);
+  i = Fe(i);
   for (let s = 0; s < r; s++)
-    i = Ge(i) ^ e.charCodeAt(s) & 31;
+    i = Fe(i) ^ e.charCodeAt(s) & 31;
   for (let s of t)
-    i = Ge(i) ^ s;
+    i = Fe(i) ^ s;
   for (let s = 0; s < 6; s++)
-    i = Ge(i);
-  return i ^= n, jt.encode(qt([i % 2 ** 30], 30, 5, !1));
+    i = Fe(i);
+  return i ^= n, Dt.encode(Ht([i % 2 ** 30], 30, 5, !1));
 }
 function mr(e) {
   const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, s = Tn(r);
-  function o(f, u, g = 90) {
+  function o(f, u, p = 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 w = f.length + 7 + u.length;
-    if (g !== !1 && w > g)
-      throw new TypeError(`Length ${w} exceeds limit ${g}`);
-    return f = f.toLowerCase(), `${f}1${jt.encode(u)}${Pn(f, u, t)}`;
+    if (p !== !1 && w > p)
+      throw new TypeError(`Length ${w} exceeds limit ${p}`);
+    return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${Pn(f, u, t)}`;
   }
   function c(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 g = f.toLowerCase();
-    if (f !== g && f !== f.toUpperCase())
+    const p = f.toLowerCase();
+    if (f !== p && f !== f.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
-    f = g;
+    f = p;
     const w = f.lastIndexOf("1");
     if (w === 0 || w === -1)
       throw new Error('Letter "1" must be present between prefix and data only');
-    const y = f.slice(0, w), h = f.slice(w + 1);
+    const g = f.slice(0, w), h = f.slice(w + 1);
     if (h.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const d = jt.decode(h).slice(0, -6), p = Pn(y, d, t);
-    if (!h.endsWith(p))
-      throw new Error(`Invalid checksum in ${f}: expected "${p}"`);
-    return { prefix: y, words: d };
+    const d = Dt.decode(h).slice(0, -6), y = Pn(g, d, t);
+    if (!h.endsWith(y))
+      throw new Error(`Invalid checksum in ${f}: expected "${y}"`);
+    return { prefix: g, words: d };
   }
   const a = Tn(c);
   function l(f) {
-    const { prefix: u, words: g } = c(f, !1);
-    return { prefix: u, words: g, bytes: r(g) };
+    const { prefix: u, words: p } = c(f, !1);
+    return { prefix: u, words: p, bytes: r(p) };
   }
   return { encode: o, decode: c, decodeToBytes: l, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
@@ -1986,15 +1986,15 @@ const Rs = {
 })), Os = {
   utf8: Rs,
   hex: Ts,
-  base16: Is,
+  base16: _s,
   base32: Us,
   base64: he,
   base64url: Ls,
-  base58: Dt,
+  base58: qt,
   base58xmr: $s
 };
 `${Object.keys(Os).join(", ")}`;
-function _t(e) {
+function kt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
@@ -2012,7 +2012,7 @@ function ue(e, ...t) {
     throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
 }
 /*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */
-const G = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), Ps = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const F = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), Ps = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!Ps)
   throw new Error("Non little-endian hardware is not supported");
 function Hs(e, t) {
@@ -2028,19 +2028,19 @@ function qs(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Ds = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ke = 16, js = 283;
-function tn(e) {
+const Ds = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ne = 16, js = 283;
+function en(e) {
   return e << 1 ^ js & -(e >> 7);
 }
 function He(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
-    n ^= e & -(t & 1), e = tn(e);
+    n ^= e & -(t & 1), e = en(e);
   return n;
 }
-const zt = /* @__PURE__ */ (() => {
+const jt = /* @__PURE__ */ (() => {
   let e = new Uint8Array(256);
-  for (let n = 0, r = 1; n < 256; n++, r ^= tn(r))
+  for (let n = 0, r = 1; n < 256; n++, r ^= en(r))
     e[n] = r;
   const t = new Uint8Array(256);
   t[0] = 99;
@@ -2049,7 +2049,7 @@ const zt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), zs = /* @__PURE__ */ zt.map((e, t) => zt.indexOf(t)), Ws = (e) => e << 24 | e >>> 8, It = (e) => e << 8 | e >>> 24;
+})(), zs = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Ws = (e) => e << 24 | e >>> 8, It = (e) => e << 8 | e >>> 24;
 function Er(e, t) {
   if (e.length !== 256)
     throw new Error("Wrong sbox length");
@@ -2061,18 +2061,18 @@ function Er(e, t) {
     }
   return { sbox: e, sbox2: a, T0: n, T1: r, T2: i, T3: s, T01: o, T23: c };
 }
-const nn = /* @__PURE__ */ Er(zt, (e) => He(e, 3) << 24 | e << 16 | e << 8 | He(e, 2)), xr = /* @__PURE__ */ Er(zs, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), Vs = /* @__PURE__ */ (() => {
+const tn = /* @__PURE__ */ Er(jt, (e) => He(e, 3) << 24 | e << 16 | e << 8 | He(e, 2)), xr = /* @__PURE__ */ Er(zs, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), Vs = /* @__PURE__ */ (() => {
   const e = new Uint8Array(16);
-  for (let t = 0, n = 1; t < 16; t++, n = tn(n))
+  for (let t = 0, n = 1; t < 16; t++, n = en(n))
     e[t] = n;
   return e;
 })();
-function Kr(e) {
+function Nr(e) {
   ue(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 = G(e), i = r.length, s = (c) => oe(n, c, c, c, c), o = new Uint32Array(t + 28);
+  const { sbox2: n } = tn, r = F(e), i = r.length, s = (c) => oe(n, c, c, c, c), o = new Uint32Array(t + 28);
   o.set(r);
   for (let c = i; c < o.length; c++) {
     let a = o[c - 1];
@@ -2081,7 +2081,7 @@ function Kr(e) {
   return o;
 }
 function Zs(e) {
-  const t = Kr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: c, T3: a } = xr;
+  const t = Nr(e), n = t.slice(), r = t.length, { sbox2: i } = tn, { T0: s, T1: o, T2: c, T3: a } = xr;
   for (let l = 0; l < r; l += 4)
     for (let f = 0; f < 4; f++)
       n[l + f] = t[r - l - 4 + f];
@@ -2099,51 +2099,51 @@ function oe(e, t, n, r, i) {
   return e[t & 255 | n & 65280] | e[r >>> 16 & 255 | i >>> 16 & 65280] << 16;
 }
 function qn(e, t, n, r, i) {
-  const { sbox2: s, T01: o, T23: c } = nn;
+  const { sbox2: s, T01: o, T23: c } = tn;
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
-  for (let y = 0; y < l; y++) {
-    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), p = e[a++] ^ xe(o, c, r, i, t, n), E = e[a++] ^ xe(o, c, i, t, n, r);
-    t = h, n = d, r = p, i = E;
+  for (let g = 0; g < l; g++) {
+    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), y = e[a++] ^ xe(o, c, r, i, t, n), E = e[a++] ^ xe(o, c, i, t, n, r);
+    t = h, n = d, r = y, i = E;
   }
-  const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), g = e[a++] ^ oe(s, r, i, t, n), w = e[a++] ^ oe(s, i, t, n, r);
-  return { s0: f, s1: u, s2: g, s3: w };
+  const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), p = e[a++] ^ oe(s, r, i, t, n), w = e[a++] ^ oe(s, i, t, n, r);
+  return { s0: f, s1: u, s2: p, s3: w };
 }
-function Gs(e, t, n, r, i) {
+function Fs(e, t, n, r, i) {
   const { sbox2: s, T01: o, T23: c } = xr;
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
-  for (let y = 0; y < l; y++) {
-    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), p = e[a++] ^ xe(o, c, r, n, t, i), E = e[a++] ^ xe(o, c, i, r, n, t);
-    t = h, n = d, r = p, i = E;
+  for (let g = 0; g < l; g++) {
+    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), y = e[a++] ^ xe(o, c, r, n, t, i), E = e[a++] ^ xe(o, c, i, r, n, t);
+    t = h, n = d, r = y, i = E;
   }
-  const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), g = e[a++] ^ oe(s, r, n, t, i), w = e[a++] ^ oe(s, i, r, n, t);
-  return { s0: f, s1: u, s2: g, s3: w };
+  const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), p = e[a++] ^ oe(s, r, n, t, i), w = e[a++] ^ oe(s, i, r, n, t);
+  return { s0: f, s1: u, s2: p, s3: w };
 }
-function Nr(e, t) {
+function Kr(e, t) {
   if (!t)
     return new Uint8Array(e);
   if (ue(t), t.length < e)
     throw new Error(`aes: wrong destination length, expected at least ${e}, got: ${t.length}`);
   return t;
 }
-function Fs(e) {
-  if (ue(e), e.length % Ke !== 0)
-    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ke}`);
+function Gs(e) {
+  if (ue(e), e.length % Ne !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ne}`);
 }
 function Js(e, t, n) {
   let r = e.length;
-  const i = r % Ke;
+  const i = r % Ne;
   if (!t && i !== 0)
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
-  const s = G(e);
+  const s = F(e);
   if (t) {
-    let a = Ke - i;
-    a || (a = Ke), r = r + a;
+    let a = Ne - i;
+    a || (a = Ne), r = r + a;
   }
-  const o = Nr(r, n), c = G(o);
+  const o = Kr(r, n), c = F(o);
   return { b: s, o: c, out: o };
 }
 function Ys(e, t) {
@@ -2162,10 +2162,10 @@ function Ys(e, t) {
   return i;
 }
 function Xs(e) {
-  const t = new Uint8Array(16), n = G(t);
+  const t = new Uint8Array(16), n = F(t);
   t.set(e);
-  const r = Ke - e.length;
-  for (let i = Ke - r; i < Ke; i++)
+  const r = Ne - e.length;
+  for (let i = Ne - r; i < Ne; i++)
     t[i] = r;
   return n;
 }
@@ -2174,110 +2174,110 @@ const Sr = /* @__PURE__ */ Ds({ blockSize: 16, nonceLength: 16 }, function(t, n,
   const i = !r.disablePadding;
   return {
     encrypt: (s, o) => {
-      const c = Kr(t), { b: a, o: l, out: f } = Js(s, i, o), u = G(n);
-      let g = u[0], w = u[1], y = u[2], h = u[3], d = 0;
+      const c = Nr(t), { b: a, o: l, out: f } = Js(s, i, o), u = F(n);
+      let p = u[0], w = u[1], g = u[2], h = u[3], d = 0;
       for (; d + 4 <= a.length; )
-        g ^= a[d + 0], w ^= a[d + 1], y ^= a[d + 2], h ^= a[d + 3], { s0: g, s1: w, s2: y, s3: h } = qn(c, g, w, y, h), l[d++] = g, l[d++] = w, l[d++] = y, l[d++] = h;
+        p ^= a[d + 0], w ^= a[d + 1], g ^= a[d + 2], h ^= a[d + 3], { s0: p, s1: w, s2: g, s3: h } = qn(c, p, w, g, h), l[d++] = p, l[d++] = w, l[d++] = g, l[d++] = h;
       if (i) {
-        const p = Xs(s.subarray(d * 4));
-        g ^= p[0], w ^= p[1], y ^= p[2], h ^= p[3], { s0: g, s1: w, s2: y, s3: h } = qn(c, g, w, y, h), l[d++] = g, l[d++] = w, l[d++] = y, l[d++] = h;
+        const y = Xs(s.subarray(d * 4));
+        p ^= y[0], w ^= y[1], g ^= y[2], h ^= y[3], { s0: p, s1: w, s2: g, s3: h } = qn(c, p, w, g, h), l[d++] = p, l[d++] = w, l[d++] = g, l[d++] = h;
       }
       return c.fill(0), f;
     },
     decrypt: (s, o) => {
-      Fs(s);
-      const c = Zs(t), a = G(n), l = Nr(s.length, o), f = G(s), u = G(l);
-      let g = a[0], w = a[1], y = a[2], h = a[3];
+      Gs(s);
+      const c = Zs(t), a = F(n), l = Kr(s.length, o), f = F(s), u = F(l);
+      let p = a[0], w = a[1], g = a[2], h = a[3];
       for (let d = 0; d + 4 <= f.length; ) {
-        const p = g, E = w, S = y, I = h;
-        g = f[d + 0], w = f[d + 1], y = f[d + 2], h = f[d + 3];
-        const { s0: B, s1: m, s2: x, s3: K } = Gs(c, g, w, y, h);
-        u[d++] = B ^ p, u[d++] = m ^ E, u[d++] = x ^ S, u[d++] = K ^ I;
+        const y = p, E = w, S = g, _ = h;
+        p = f[d + 0], w = f[d + 1], g = f[d + 2], h = f[d + 3];
+        const { s0: B, s1: m, s2: x, s3: N } = Fs(c, p, w, g, h);
+        u[d++] = B ^ y, u[d++] = m ^ E, u[d++] = x ^ S, u[d++] = N ^ _;
       }
       return c.fill(0), Ys(l, i);
     }
   };
-}), Ar = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Qs = Ar("expand 16-byte k"), eo = Ar("expand 32-byte k"), to = G(Qs), Cr = G(eo);
+}), Ar = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Qs = Ar("expand 16-byte k"), eo = Ar("expand 32-byte k"), to = F(Qs), Cr = F(eo);
 Cr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
 }
-function Wt(e) {
+function zt(e) {
   return e.byteOffset % 4 === 0;
 }
 const Xe = 64, no = 16, Br = 2 ** 32 - 1, Dn = new Uint32Array();
 function ro(e, t, n, r, i, s, o, c) {
-  const a = i.length, l = new Uint8Array(Xe), f = G(l), u = Wt(i) && Wt(s), g = u ? G(i) : Dn, w = u ? G(s) : Dn;
-  for (let y = 0; y < a; o++) {
+  const a = i.length, l = new Uint8Array(Xe), f = F(l), u = zt(i) && zt(s), p = u ? F(i) : Dn, w = u ? F(s) : Dn;
+  for (let g = 0; g < a; o++) {
     if (e(t, n, r, f, o, c), o >= Br)
       throw new Error("arx: counter overflow");
-    const h = Math.min(Xe, a - y);
+    const h = Math.min(Xe, a - g);
     if (u && h === Xe) {
-      const d = y / 4;
-      if (y % 4 !== 0)
+      const d = g / 4;
+      if (g % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let p = 0, E; p < no; p++)
-        E = d + p, w[E] = g[E] ^ f[p];
-      y += Xe;
+      for (let y = 0, E; y < no; y++)
+        E = d + y, w[E] = p[E] ^ f[y];
+      g += Xe;
       continue;
     }
-    for (let d = 0, p; d < h; d++)
-      p = y + d, s[p] = i[p] ^ l[d];
-    y += h;
+    for (let d = 0, y; d < h; d++)
+      y = g + d, s[y] = i[y] ^ l[d];
+    g += h;
   }
 }
 function io(e, t) {
   const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = Hs({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return _t(i), _t(o), Hn(s), Hn(n), (c, a, l, f, u = 0) => {
+  return kt(i), kt(o), Hn(s), Hn(n), (c, a, l, f, u = 0) => {
     ue(c), ue(a), ue(l);
-    const g = l.length;
-    if (f || (f = new Uint8Array(g)), ue(f), _t(u), u < 0 || u >= Br)
+    const p = l.length;
+    if (f || (f = new Uint8Array(p)), ue(f), kt(u), u < 0 || u >= Br)
       throw new Error("arx: counter overflow");
-    if (f.length < g)
-      throw new Error(`arx: output (${f.length}) is shorter than data (${g})`);
+    if (f.length < p)
+      throw new Error(`arx: output (${f.length}) is shorter than data (${p})`);
     const w = [];
-    let y = c.length, h, d;
-    if (y === 32)
+    let g = c.length, h, d;
+    if (g === 32)
       h = c.slice(), w.push(h), d = Cr;
-    else if (y === 16 && n)
+    else if (g === 16 && n)
       h = new Uint8Array(32), h.set(c), h.set(c, 16), d = to, w.push(h);
     else
-      throw new Error(`arx: invalid 32-byte key, got length=${y}`);
-    Wt(a) || (a = a.slice(), w.push(a));
-    const p = G(h);
+      throw new Error(`arx: invalid 32-byte key, got length=${g}`);
+    zt(a) || (a = a.slice(), w.push(a));
+    const y = F(h);
     if (r) {
       if (a.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(d, p, G(a.subarray(0, 16)), p), a = a.subarray(16);
+      r(d, y, F(a.subarray(0, 16)), y), 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 I = new Uint8Array(12);
-      I.set(a, s ? 0 : 12 - a.length), a = I, w.push(a);
+      const _ = new Uint8Array(12);
+      _.set(a, s ? 0 : 12 - a.length), a = _, w.push(a);
     }
-    const S = G(a);
-    for (ro(e, d, p, S, l, f, u, o); w.length > 0; )
+    const S = F(a);
+    for (ro(e, d, y, S, l, f, u, o); w.length > 0; )
       w.pop().fill(0);
     return f;
   };
 }
 function so(e, t, n, r, i, s = 20) {
-  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], g = t[2], w = t[3], y = t[4], h = t[5], d = t[6], p = t[7], E = i, S = n[0], I = n[1], B = n[2], m = o, x = c, K = a, M = l, _ = f, A = u, R = g, T = w, q = y, b = h, v = d, N = p, k = E, C = S, U = I, O = B;
+  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], p = t[2], w = t[3], g = t[4], h = t[5], d = t[6], y = t[7], E = i, S = n[0], _ = n[1], B = n[2], m = o, x = c, N = a, M = l, I = f, A = u, R = p, T = w, q = g, b = h, v = d, K = y, k = E, C = S, U = _, O = B;
   for (let ee = 0; ee < s; ee += 2)
-    m = m + _ | 0, k = L(k ^ m, 16), q = q + k | 0, _ = L(_ ^ q, 12), m = m + _ | 0, k = L(k ^ m, 8), q = q + k | 0, _ = L(_ ^ q, 7), x = x + A | 0, C = L(C ^ x, 16), b = b + C | 0, A = L(A ^ b, 12), x = x + A | 0, C = L(C ^ x, 8), b = b + C | 0, A = L(A ^ b, 7), K = K + R | 0, U = L(U ^ K, 16), v = v + U | 0, R = L(R ^ v, 12), K = K + R | 0, U = L(U ^ K, 8), v = v + U | 0, R = L(R ^ v, 7), M = M + T | 0, O = L(O ^ M, 16), N = N + O | 0, T = L(T ^ N, 12), M = M + T | 0, O = L(O ^ M, 8), N = N + O | 0, T = L(T ^ N, 7), m = m + A | 0, O = L(O ^ m, 16), v = v + O | 0, A = L(A ^ v, 12), m = m + A | 0, O = L(O ^ m, 8), v = v + O | 0, A = L(A ^ v, 7), x = x + R | 0, k = L(k ^ x, 16), N = N + k | 0, R = L(R ^ N, 12), x = x + R | 0, k = L(k ^ x, 8), N = N + k | 0, R = L(R ^ N, 7), K = K + T | 0, C = L(C ^ K, 16), q = q + C | 0, T = L(T ^ q, 12), K = K + T | 0, C = L(C ^ K, 8), q = q + C | 0, T = L(T ^ q, 7), M = M + _ | 0, U = L(U ^ M, 16), b = b + U | 0, _ = L(_ ^ b, 12), M = M + _ | 0, U = L(U ^ M, 8), b = b + U | 0, _ = L(_ ^ b, 7);
+    m = m + I | 0, k = L(k ^ m, 16), q = q + k | 0, I = L(I ^ q, 12), m = m + I | 0, k = L(k ^ m, 8), q = q + k | 0, I = L(I ^ q, 7), x = x + A | 0, C = L(C ^ x, 16), b = b + C | 0, A = L(A ^ b, 12), x = x + A | 0, C = L(C ^ x, 8), b = b + C | 0, A = L(A ^ b, 7), N = N + R | 0, U = L(U ^ N, 16), v = v + U | 0, R = L(R ^ v, 12), N = N + R | 0, U = L(U ^ N, 8), v = v + U | 0, R = L(R ^ v, 7), M = M + T | 0, O = L(O ^ M, 16), K = K + O | 0, T = L(T ^ K, 12), M = M + T | 0, O = L(O ^ M, 8), K = K + O | 0, T = L(T ^ K, 7), m = m + A | 0, O = L(O ^ m, 16), v = v + O | 0, A = L(A ^ v, 12), m = m + A | 0, O = L(O ^ m, 8), v = v + O | 0, A = L(A ^ v, 7), x = x + R | 0, k = L(k ^ x, 16), K = K + k | 0, R = L(R ^ K, 12), x = x + R | 0, k = L(k ^ x, 8), K = K + k | 0, R = L(R ^ K, 7), N = N + T | 0, C = L(C ^ N, 16), q = q + C | 0, T = L(T ^ q, 12), N = N + T | 0, C = L(C ^ N, 8), q = q + C | 0, T = L(T ^ q, 7), M = M + I | 0, U = L(U ^ M, 16), b = b + U | 0, I = L(I ^ b, 12), M = M + I | 0, U = L(U ^ M, 8), b = b + U | 0, I = L(I ^ b, 7);
   let $ = 0;
-  r[$++] = o + m | 0, r[$++] = c + x | 0, r[$++] = a + K | 0, r[$++] = l + M | 0, r[$++] = f + _ | 0, r[$++] = u + A | 0, r[$++] = g + R | 0, r[$++] = w + T | 0, r[$++] = y + q | 0, r[$++] = h + b | 0, r[$++] = d + v | 0, r[$++] = p + N | 0, r[$++] = E + k | 0, r[$++] = S + C | 0, r[$++] = I + U | 0, r[$++] = B + O | 0;
+  r[$++] = o + m | 0, r[$++] = c + x | 0, r[$++] = a + N | 0, r[$++] = l + M | 0, r[$++] = f + I | 0, r[$++] = u + A | 0, r[$++] = p + R | 0, r[$++] = w + T | 0, r[$++] = g + q | 0, r[$++] = h + b | 0, r[$++] = d + v | 0, r[$++] = y + K | 0, r[$++] = E + k | 0, r[$++] = S + C | 0, r[$++] = _ + U | 0, r[$++] = B + O | 0;
 }
 const kr = /* @__PURE__ */ io(so, {
   counterRight: !1,
   counterLength: 4,
   allowShortKeys: !1
 });
-class _r extends dr {
+class Ir extends dr {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, se.hash(t);
     const r = Je(n);
@@ -2312,23 +2312,23 @@ class _r extends dr {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const dt = (e, t, n) => new _r(e, t).update(n).digest();
-dt.create = (e, t) => new _r(e, t);
-function rn(e, t, n) {
+const dt = (e, t, n) => new Ir(e, t).update(n).digest();
+dt.create = (e, t) => new Ir(e, t);
+function nn(e, t, n) {
   return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), dt(e, Je(n), Je(t));
 }
-const Ut = new Uint8Array([0]), jn = new Uint8Array();
-function Ir(e, t, n, r = 32) {
+const _t = new Uint8Array([0]), jn = new Uint8Array();
+function _r(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 = jn);
   const s = new Uint8Array(i * e.outputLen), o = dt.create(e, t), c = o._cloneInto(), a = new Uint8Array(o.outputLen);
   for (let l = 0; l < i; l++)
-    Ut[0] = l + 1, c.update(l === 0 ? jn : a).update(n).update(Ut).digestInto(a), s.set(a, e.outputLen * l), o._cloneInto(c);
-  return o.destroy(), c.destroy(), a.fill(0), Ut.fill(0), s.slice(0, r);
+    _t[0] = l + 1, c.update(l === 0 ? jn : a).update(n).update(_t).digestInto(a), s.set(a, e.outputLen * l), o._cloneInto(c);
+  return o.destroy(), c.destroy(), a.fill(0), _t.fill(0), s.slice(0, r);
 }
-var oo = Object.defineProperty, P = (e, t) => {
+var oo = Object.defineProperty, H = (e, t) => {
   for (var n in t)
     oo(e, n, { get: t[n], enumerable: !0 });
 }, Te = Symbol("verified"), ao = (e) => e instanceof Object;
@@ -2346,10 +2346,12 @@ function pt(e) {
   return !0;
 }
 var co = {};
-P(co, {
+H(co, {
   Queue: () => ho,
   QueueNode: () => Ur,
-  binarySearch: () => sn,
+  binarySearch: () => rn,
+  bytesToHex: () => P,
+  hexToBytes: () => j,
   insertEventIntoAscendingList: () => fo,
   insertEventIntoDescendingList: () => lo,
   normalizeURL: () => uo,
@@ -2367,14 +2369,14 @@ function uo(e) {
   }
 }
 function lo(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);
+  const [n, r] = rn(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 fo(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);
+  const [n, r] = rn(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 rn(e, t) {
   let n = 0, r = e.length - 1;
   for (; n <= r; ) {
     const i = Math.floor((n + r) / 2), s = t(e[i]);
@@ -2416,11 +2418,11 @@ var Ur = class {
     return Ze.utils.randomPrivateKey();
   }
   getPublicKey(e) {
-    return H(Ze.getPublicKey(e));
+    return P(Ze.getPublicKey(e));
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = H(Ze.getPublicKey(t)), n.id = qe(n), n.sig = H(Ze.sign(qe(n), t)), n[Te] = !0, n;
+    return n.pubkey = P(Ze.getPublicKey(t)), n.id = qe(n), n.sig = P(Ze.sign(qe(n), t)), n[Te] = !0, n;
   }
   verifyEvent(e) {
     if (typeof e[Te] == "boolean")
@@ -2443,122 +2445,120 @@ function yo(e) {
 }
 function qe(e) {
   let t = fe(ne.encode(yo(e)));
-  return H(t);
+  return P(t);
 }
 var yt = new po(), ke = yt.generateSecretKey, ae = yt.getPublicKey, Q = yt.finalizeEvent, gt = yt.verifyEvent, go = {};
-P(go, {
-  Application: () => ga,
-  BadgeAward: () => So,
-  BadgeDefinition: () => ua,
-  BlockedRelaysList: () => Zo,
-  BookmarkList: () => zo,
-  Bookmarksets: () => oa,
-  Calendar: () => Ka,
+H(go, {
+  Application: () => ya,
+  BadgeAward: () => Ko,
+  BadgeDefinition: () => ca,
+  BlockedRelaysList: () => Vo,
+  BookmarkList: () => jo,
+  Bookmarksets: () => sa,
+  Calendar: () => xa,
   CalendarEventRSVP: () => Na,
   ChannelCreation: () => Mr,
   ChannelHideMessage: () => qr,
   ChannelMessage: () => Hr,
   ChannelMetadata: () => Pr,
   ChannelMuteUser: () => Dr,
-  ClassifiedListing: () => va,
+  ClassifiedListing: () => ba,
   ClientAuth: () => zr,
-  CommunitiesList: () => Wo,
-  CommunityDefinition: () => Ca,
-  CommunityPostApproval: () => Lo,
-  Contacts: () => xo,
-  CreateOrUpdateProduct: () => ha,
-  CreateOrUpdateStall: () => fa,
-  Curationsets: () => aa,
-  Date: () => Ea,
-  DirectMessageRelaysList: () => Yo,
-  DraftClassifiedListing: () => ma,
-  DraftLong: () => pa,
-  Emojisets: () => ya,
-  EncryptedDirectMessage: () => Ko,
+  CommunitiesList: () => zo,
+  CommunityDefinition: () => Aa,
+  CommunityPostApproval: () => Uo,
+  Contacts: () => Eo,
+  CreateOrUpdateProduct: () => fa,
+  CreateOrUpdateStall: () => la,
+  Curationsets: () => oa,
+  Date: () => ma,
+  DirectMessageRelaysList: () => Jo,
+  DraftClassifiedListing: () => va,
+  DraftLong: () => da,
+  Emojisets: () => pa,
+  EncryptedDirectMessage: () => xo,
   EventDeletion: () => No,
-  FileMetadata: () => Co,
-  FileServerPreference: () => Xo,
-  Followsets: () => ra,
+  FileMetadata: () => Ao,
+  FileServerPreference: () => Yo,
+  Followsets: () => na,
   GenericRepost: () => un,
-  Genericlists: () => ia,
+  Genericlists: () => ra,
   GiftWrap: () => jr,
   HTTPAuth: () => ln,
-  Handlerinformation: () => Aa,
-  Handlerrecommendation: () => Sa,
-  Highlights: () => Ho,
+  Handlerinformation: () => Sa,
+  Handlerrecommendation: () => Ka,
+  Highlights: () => Po,
   InterestsList: () => Fo,
-  Interestsets: () => la,
-  JobFeedback: () => To,
-  JobRequest: () => $o,
-  JobResult: () => Ro,
-  Label: () => Uo,
-  LightningPubRPC: () => ea,
-  LiveChatMessage: () => Bo,
-  LiveEvent: () => wa,
-  LongFormArticle: () => da,
-  Metadata: () => mo,
-  Mutelist: () => qo,
-  NWCWalletInfo: () => Qo,
+  Interestsets: () => ua,
+  JobFeedback: () => Ro,
+  JobRequest: () => Lo,
+  JobResult: () => $o,
+  Label: () => _o,
+  LightningPubRPC: () => Qo,
+  LiveChatMessage: () => Co,
+  LiveEvent: () => ga,
+  LongFormArticle: () => ha,
+  Metadata: () => vo,
+  Mutelist: () => Ho,
+  NWCWalletInfo: () => Xo,
   NWCWalletRequest: () => Wr,
-  NWCWalletResponse: () => ta,
-  NostrConnect: () => na,
-  OpenTimestamps: () => Ao,
-  Pinlist: () => Do,
+  NWCWalletResponse: () => ea,
+  NostrConnect: () => ta,
+  OpenTimestamps: () => So,
+  Pinlist: () => qo,
   PrivateDirectMessage: () => Or,
-  ProblemTracker: () => ko,
-  ProfileBadges: () => ca,
-  PublicChatsList: () => Vo,
+  ProblemTracker: () => Bo,
+  ProfileBadges: () => aa,
+  PublicChatsList: () => Wo,
   Reaction: () => cn,
-  RecommendRelay: () => Eo,
-  RelayList: () => jo,
-  Relaysets: () => sa,
-  Report: () => _o,
+  RecommendRelay: () => mo,
+  RelayList: () => Do,
+  Relaysets: () => ia,
+  Report: () => ko,
   Reporting: () => Io,
   Repost: () => an,
   Seal: () => Tr,
-  SearchRelaysList: () => Go,
+  SearchRelaysList: () => Zo,
   ShortTextNote: () => Rr,
-  Time: () => xa,
-  UserEmojiList: () => Jo,
-  UserStatuses: () => ba,
-  Zap: () => Po,
-  ZapGoal: () => Oo,
-  ZapRequest: () => Mo,
-  classifyKind: () => bo,
-  isAddressableKind: () => wt,
+  Time: () => Ea,
+  UserEmojiList: () => Go,
+  UserStatuses: () => wa,
+  Zap: () => Mo,
+  ZapGoal: () => To,
+  ZapRequest: () => Oo,
+  classifyKind: () => wo,
+  isAddressableKind: () => on,
   isEphemeralKind: () => $r,
-  isKind: () => vo,
-  isParameterizedReplaceableKind: () => wo,
+  isKind: () => bo,
   isRegularKind: () => Lr,
-  isReplaceableKind: () => on
+  isReplaceableKind: () => sn
 });
 function Lr(e) {
   return 1e3 <= e && e < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(e);
 }
-function on(e) {
+function sn(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
 function $r(e) {
   return 2e4 <= e && e < 3e4;
 }
-function wt(e) {
+function on(e) {
   return 3e4 <= e && e < 4e4;
 }
-var wo = wt;
-function bo(e) {
-  return Lr(e) ? "regular" : on(e) ? "replaceable" : $r(e) ? "ephemeral" : wt(e) ? "parameterized" : "unknown";
+function wo(e) {
+  return Lr(e) ? "regular" : sn(e) ? "replaceable" : $r(e) ? "ephemeral" : on(e) ? "parameterized" : "unknown";
 }
-function vo(e, t) {
+function bo(e, t) {
   const n = t instanceof Array ? t : [t];
   return pt(e) && n.includes(e.kind) || !1;
 }
-var mo = 0, Rr = 1, Eo = 2, xo = 3, Ko = 4, No = 5, an = 6, cn = 7, So = 8, Tr = 13, Or = 14, un = 16, Mr = 40, Pr = 41, Hr = 42, qr = 43, Dr = 44, Ao = 1040, jr = 1059, Co = 1063, Bo = 1311, ko = 1971, _o = 1984, Io = 1984, Uo = 1985, Lo = 4550, $o = 5999, Ro = 6999, To = 7e3, Oo = 9041, Mo = 9734, Po = 9735, Ho = 9802, qo = 1e4, Do = 10001, jo = 10002, zo = 10003, Wo = 10004, Vo = 10005, Zo = 10006, Go = 10007, Fo = 10015, Jo = 10030, Yo = 10050, Xo = 10096, Qo = 13194, ea = 21e3, zr = 22242, Wr = 23194, ta = 23195, na = 24133, ln = 27235, ra = 3e4, ia = 30001, sa = 30002, oa = 30003, aa = 30004, ca = 30008, ua = 30009, la = 30015, fa = 30017, ha = 30018, da = 30023, pa = 30024, ya = 30030, ga = 30078, wa = 30311, ba = 30315, va = 30402, ma = 30403, Ea = 31922, xa = 31923, Ka = 31924, Na = 31925, Sa = 31989, Aa = 31990, Ca = 34550, Ba = {};
-P(Ba, {
+var vo = 0, Rr = 1, mo = 2, Eo = 3, xo = 4, No = 5, an = 6, cn = 7, Ko = 8, Tr = 13, Or = 14, un = 16, Mr = 40, Pr = 41, Hr = 42, qr = 43, Dr = 44, So = 1040, jr = 1059, Ao = 1063, Co = 1311, Bo = 1971, ko = 1984, Io = 1984, _o = 1985, Uo = 4550, Lo = 5999, $o = 6999, Ro = 7e3, To = 9041, Oo = 9734, Mo = 9735, Po = 9802, Ho = 1e4, qo = 10001, Do = 10002, jo = 10003, zo = 10004, Wo = 10005, Vo = 10006, Zo = 10007, Fo = 10015, Go = 10030, Jo = 10050, Yo = 10096, Xo = 13194, Qo = 21e3, zr = 22242, Wr = 23194, ea = 23195, ta = 24133, ln = 27235, na = 3e4, ra = 30001, ia = 30002, sa = 30003, oa = 30004, aa = 30008, ca = 30009, ua = 30015, la = 30017, fa = 30018, ha = 30023, da = 30024, pa = 30030, ya = 30078, ga = 30311, wa = 30315, ba = 30402, va = 30403, ma = 31922, Ea = 31923, xa = 31924, Na = 31925, Ka = 31989, Sa = 31990, Aa = 34550, Ca = {};
+H(Ca, {
   getHex64: () => fn,
   getInt: () => Vr,
-  getSubscriptionId: () => ka,
-  matchEventId: () => _a,
-  matchEventKind: () => Ua,
+  getSubscriptionId: () => Ba,
+  matchEventId: () => ka,
+  matchEventKind: () => _a,
   matchEventPubkey: () => Ia
 });
 function fn(e, t) {
@@ -2569,7 +2569,7 @@ function Vr(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 ka(e) {
+function Ba(e) {
   let t = e.slice(0, 22).indexOf('"EVENT"');
   if (t === -1)
     return null;
@@ -2582,20 +2582,20 @@ function ka(e) {
   let s = r + 1 + i;
   return e.slice(r + 1, s);
 }
-function _a(e, t) {
+function ka(e, t) {
   return t === fn(e, "id");
 }
 function Ia(e, t) {
   return t === fn(e, "pubkey");
 }
-function Ua(e, t) {
+function _a(e, t) {
   return t === Vr(e, "kind");
 }
-var La = {};
-P(La, {
-  makeAuthEvent: () => $a
+var Ua = {};
+H(Ua, {
+  makeAuthEvent: () => La
 });
-function $a(e, t) {
+function La(e, t) {
   return {
     kind: zr,
     created_at: Math.floor(Date.now() / 1e3),
@@ -2606,32 +2606,32 @@ function $a(e, t) {
     content: ""
   };
 }
-var Ra;
+var $a;
 try {
-  Ra = WebSocket;
+  $a = WebSocket;
 } catch {
 }
-var Ta;
+var Ra;
 try {
-  Ta = WebSocket;
+  Ra = WebSocket;
 } catch {
 }
-var Oa = {};
-P(Oa, {
+var Ta = {};
+H(Ta, {
   BECH32_REGEX: () => Zr,
   Bech32MaxSize: () => hn,
-  NostrTypeGuard: () => Ma,
-  decode: () => bt,
-  decodeNostrURI: () => Ha,
-  encodeBytes: () => mt,
-  naddrEncode: () => Va,
-  neventEncode: () => Wa,
-  noteEncode: () => ja,
-  nprofileEncode: () => za,
-  npubEncode: () => Da,
-  nsecEncode: () => qa
+  NostrTypeGuard: () => Oa,
+  decode: () => wt,
+  decodeNostrURI: () => Pa,
+  encodeBytes: () => vt,
+  naddrEncode: () => Wa,
+  neventEncode: () => za,
+  noteEncode: () => Da,
+  nprofileEncode: () => ja,
+  npubEncode: () => qa,
+  nsecEncode: () => Ha
 });
-var Ma = {
+var Oa = {
   isNProfile: (e) => /^nprofile1[a-z\d]+$/.test(e || ""),
   isNEvent: (e) => /^nevent1[a-z\d]+$/.test(e || ""),
   isNAddr: (e) => /^naddr1[a-z\d]+$/.test(e || ""),
@@ -2640,23 +2640,23 @@ var Ma = {
   isNote: (e) => /^note1[a-z\d]+$/.test(e || ""),
   isNcryptsec: (e) => /^ncryptsec1[a-z\d]+$/.test(e || "")
 }, hn = 5e3, Zr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
-function Pa(e) {
+function Ma(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 Ha(e) {
+function Pa(e) {
   try {
-    return e.startsWith("nostr:") && (e = e.substring(6)), bt(e);
+    return e.startsWith("nostr:") && (e = e.substring(6)), wt(e);
   } catch {
     return { type: "invalid", data: null };
   }
 }
-function bt(e) {
+function wt(e) {
   var i, s, o, c, a, l, f;
   let { prefix: t, words: n } = ze.decode(e, hn), r = new Uint8Array(ze.fromWords(n));
   switch (t) {
     case "nprofile": {
-      let u = Lt(r);
+      let u = Ut(r);
       if (!((i = u[0]) != null && i[0]))
         throw new Error("missing TLV 0 for nprofile");
       if (u[0][0].length !== 32)
@@ -2664,13 +2664,13 @@ function bt(e) {
       return {
         type: "nprofile",
         data: {
-          pubkey: H(u[0][0]),
-          relays: u[1] ? u[1].map((g) => le.decode(g)) : []
+          pubkey: P(u[0][0]),
+          relays: u[1] ? u[1].map((p) => le.decode(p)) : []
         }
       };
     }
     case "nevent": {
-      let u = Lt(r);
+      let u = Ut(r);
       if (!((s = u[0]) != null && s[0]))
         throw new Error("missing TLV 0 for nevent");
       if (u[0][0].length !== 32)
@@ -2682,15 +2682,15 @@ function bt(e) {
       return {
         type: "nevent",
         data: {
-          id: H(u[0][0]),
-          relays: u[1] ? u[1].map((g) => le.decode(g)) : [],
-          author: (o = u[2]) != null && o[0] ? H(u[2][0]) : void 0,
-          kind: (c = u[3]) != null && c[0] ? parseInt(H(u[3][0]), 16) : void 0
+          id: P(u[0][0]),
+          relays: u[1] ? u[1].map((p) => le.decode(p)) : [],
+          author: (o = u[2]) != null && o[0] ? P(u[2][0]) : void 0,
+          kind: (c = u[3]) != null && c[0] ? parseInt(P(u[3][0]), 16) : void 0
         }
       };
     }
     case "naddr": {
-      let u = Lt(r);
+      let u = Ut(r);
       if (!((a = u[0]) != null && a[0]))
         throw new Error("missing TLV 0 for naddr");
       if (!((l = u[2]) != null && l[0]))
@@ -2705,9 +2705,9 @@ function bt(e) {
         type: "naddr",
         data: {
           identifier: le.decode(u[0][0]),
-          pubkey: H(u[2][0]),
-          kind: parseInt(H(u[3][0]), 16),
-          relays: u[1] ? u[1].map((g) => le.decode(g)) : []
+          pubkey: P(u[2][0]),
+          kind: parseInt(P(u[3][0]), 16),
+          relays: u[1] ? u[1].map((p) => le.decode(p)) : []
         }
       };
     }
@@ -2715,12 +2715,12 @@ function bt(e) {
       return { type: t, data: r };
     case "npub":
     case "note":
-      return { type: t, data: H(r) };
+      return { type: t, data: P(r) };
     default:
       throw new Error(`unknown prefix ${t}`);
   }
 }
-function Lt(e) {
+function Ut(e) {
   let t = {}, n = e;
   for (; n.length > 0; ) {
     let r = n[0], i = n[1], s = n.slice(2, 2 + i);
@@ -2730,50 +2730,50 @@ function Lt(e) {
   }
   return t;
 }
+function Ha(e) {
+  return vt("nsec", e);
+}
 function qa(e) {
-  return mt("nsec", e);
+  return vt("npub", j(e));
 }
 function Da(e) {
-  return mt("npub", z(e));
-}
-function ja(e) {
-  return mt("note", z(e));
+  return vt("note", j(e));
 }
-function vt(e, t) {
+function bt(e, t) {
   let n = ze.toWords(t);
   return ze.encode(e, n, hn);
 }
-function mt(e, t) {
-  return vt(e, t);
+function vt(e, t) {
+  return bt(e, t);
 }
-function za(e) {
+function ja(e) {
   let t = dn({
-    0: [z(e.pubkey)],
+    0: [j(e.pubkey)],
     1: (e.relays || []).map((n) => ne.encode(n))
   });
-  return vt("nprofile", t);
+  return bt("nprofile", t);
 }
-function Wa(e) {
+function za(e) {
   let t;
-  e.kind !== void 0 && (t = Pa(e.kind));
+  e.kind !== void 0 && (t = Ma(e.kind));
   let n = dn({
-    0: [z(e.id)],
+    0: [j(e.id)],
     1: (e.relays || []).map((r) => ne.encode(r)),
-    2: e.author ? [z(e.author)] : [],
+    2: e.author ? [j(e.author)] : [],
     3: t ? [new Uint8Array(t)] : []
   });
-  return vt("nevent", n);
+  return bt("nevent", n);
 }
-function Va(e) {
+function Wa(e) {
   let t = new ArrayBuffer(4);
   new DataView(t).setUint32(0, e.kind, !1);
   let n = dn({
     0: [ne.encode(e.identifier)],
     1: (e.relays || []).map((r) => ne.encode(r)),
-    2: [z(e.pubkey)],
+    2: [j(e.pubkey)],
     3: [new Uint8Array(t)]
   });
-  return vt("naddr", n);
+  return bt("naddr", n);
 }
 function dn(e) {
   let t = [];
@@ -2784,44 +2784,44 @@ function dn(e) {
     });
   }), ft(...t);
 }
-var Za = {};
-P(Za, {
-  decrypt: () => Ga,
-  encrypt: () => Gr
+var Va = {};
+H(Va, {
+  decrypt: () => Za,
+  encrypt: () => Fr
 });
-function Gr(e, t, n) {
-  const r = e instanceof Uint8Array ? H(e) : e, i = Ie.getSharedSecret(r, "02" + t), s = Fr(i);
+function Fr(e, t, n) {
+  const r = e instanceof Uint8Array ? P(e) : e, i = _e.getSharedSecret(r, "02" + t), s = Gr(i);
   let o = Uint8Array.from(yr(16)), c = ne.encode(n), a = Sr(s, o).encrypt(c), l = he.encode(new Uint8Array(a)), f = he.encode(new Uint8Array(o.buffer));
   return `${l}?iv=${f}`;
 }
-function Ga(e, t, n) {
-  const r = e instanceof Uint8Array ? H(e) : e;
-  let [i, s] = n.split("?iv="), o = Ie.getSharedSecret(r, "02" + t), c = Fr(o), a = he.decode(s), l = he.decode(i), f = Sr(c, a).decrypt(l);
+function Za(e, t, n) {
+  const r = e instanceof Uint8Array ? P(e) : e;
+  let [i, s] = n.split("?iv="), o = _e.getSharedSecret(r, "02" + t), c = Gr(o), a = he.decode(s), l = he.decode(i), f = Sr(c, a).decrypt(l);
   return le.decode(f);
 }
-function Fr(e) {
+function Gr(e) {
   return e.slice(1, 33);
 }
 var Fa = {};
-P(Fa, {
+H(Fa, {
   NIP05_REGEX: () => pn,
-  isNip05: () => Ja,
-  isValid: () => Qa,
+  isNip05: () => Ga,
+  isValid: () => Xa,
   queryProfile: () => Jr,
-  searchDomain: () => Xa,
-  useFetchImplementation: () => Ya
+  searchDomain: () => Ya,
+  useFetchImplementation: () => Ja
 });
-var pn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Ja = (e) => pn.test(e || ""), Et;
+var pn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Ga = (e) => pn.test(e || ""), mt;
 try {
-  Et = fetch;
+  mt = fetch;
 } catch {
 }
-function Ya(e) {
-  Et = e;
+function Ja(e) {
+  mt = e;
 }
-async function Xa(e, t = "") {
+async function Ya(e, t = "") {
   try {
-    const n = `https://${e}/.well-known/nostr.json?name=${t}`, r = await Et(n, { redirect: "manual" });
+    const n = `https://${e}/.well-known/nostr.json?name=${t}`, r = await mt(n, { redirect: "manual" });
     if (r.status !== 200)
       throw Error("Wrong response code");
     return (await r.json()).names;
@@ -2836,7 +2836,7 @@ async function Jr(e) {
     return null;
   const [, n = "_", r] = t;
   try {
-    const s = `https://${r}/.well-known/nostr.json?name=${n}`, o = await Et(s, { redirect: "manual" });
+    const s = `https://${r}/.well-known/nostr.json?name=${n}`, o = await mt(s, { redirect: "manual" });
     if (o.status !== 200)
       throw Error("Wrong response code");
     const c = await o.json(), a = c.names[n];
@@ -2845,15 +2845,15 @@ async function Jr(e) {
     return null;
   }
 }
-async function Qa(e, t) {
+async function Xa(e, t) {
   const n = await Jr(t);
   return n ? n.pubkey === e : !1;
 }
-var ec = {};
-P(ec, {
-  parse: () => tc
+var Qa = {};
+H(Qa, {
+  parse: () => ec
 });
-function tc(e) {
+function ec(e) {
   const t = {
     reply: void 0,
     root: void 0,
@@ -2920,29 +2920,29 @@ function tc(e) {
     }
   }), t;
 }
-var nc = {};
-P(nc, {
-  fetchRelayInformation: () => ic,
-  useFetchImplementation: () => rc
+var tc = {};
+H(tc, {
+  fetchRelayInformation: () => rc,
+  useFetchImplementation: () => nc
 });
 var Yr;
 try {
   Yr = fetch;
 } catch {
 }
-function rc(e) {
+function nc(e) {
   Yr = e;
 }
-async function ic(e) {
+async function rc(e) {
   return await (await fetch(e.replace("ws://", "http://").replace("wss://", "https://"), {
     headers: { Accept: "application/nostr+json" }
   })).json();
 }
-var sc = {};
-P(sc, {
+var ic = {};
+H(ic, {
   fastEventHash: () => Qr,
   getPow: () => Xr,
-  minePow: () => oc
+  minePow: () => sc
 });
 function Xr(e) {
   let t = 0;
@@ -2957,7 +2957,7 @@ function Xr(e) {
   }
   return t;
 }
-function oc(e, t) {
+function sc(e, t) {
   let n = 0;
   const r = e, i = ["nonce", n.toString(), t.toString()];
   for (r.tags.push(i); ; ) {
@@ -2968,41 +2968,41 @@ function oc(e, t) {
   return r;
 }
 function Qr(e) {
-  return H(
+  return P(
     fe(ne.encode(JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content])))
   );
 }
-var ac = {};
-P(ac, {
-  unwrapEvent: () => bc,
-  unwrapManyEvents: () => vc,
+var oc = {};
+H(oc, {
+  unwrapEvent: () => wc,
+  unwrapManyEvents: () => bc,
   wrapEvent: () => hi,
-  wrapManyEvents: () => wc
+  wrapManyEvents: () => gc
 });
-var cc = {};
-P(cc, {
+var ac = {};
+H(ac, {
   createRumor: () => ci,
   createSeal: () => ui,
   createWrap: () => li,
   unwrapEvent: () => vn,
   unwrapManyEvents: () => fi,
   wrapEvent: () => st,
-  wrapManyEvents: () => yc
+  wrapManyEvents: () => pc
 });
 var D = {};
-P(D, {
+H(D, {
   decrypt: () => bn,
   encrypt: () => wn,
   getConversationKey: () => yn,
-  v2: () => dc
+  v2: () => hc
 });
 var ei = 1, ti = 65535;
 function yn(e, t) {
-  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return rn(fe, n, "nip44-v2");
+  const n = _e.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return nn(fe, n, "nip44-v2");
 }
 function ni(e, t) {
-  const n = Ir(fe, e, t, 76);
+  const n = _r(fe, e, t, 76);
   return {
     chacha_key: n.subarray(0, 32),
     chacha_nonce: n.subarray(32, 44),
@@ -3017,17 +3017,17 @@ function gn(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 uc(e) {
+function cc(e) {
   if (!Number.isSafeInteger(e) || e < ei || e > ti)
     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 lc(e) {
-  const t = ne.encode(e), n = t.length, r = uc(n), i = new Uint8Array(gn(n) - n);
+function uc(e) {
+  const t = ne.encode(e), n = t.length, r = cc(n), i = new Uint8Array(gn(n) - n);
   return ft(r, t, i);
 }
-function fc(e) {
+function lc(e) {
   const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
   if (t < ei || t > ti || n.length !== t || e.length !== 2 + gn(t))
     throw new Error("invalid padding");
@@ -3039,7 +3039,7 @@ function ri(e, t, n) {
   const r = ft(n, t);
   return dt(fe, e, r);
 }
-function hc(e) {
+function fc(e) {
   if (typeof e != "string")
     throw new Error("payload must be a valid string");
   const t = e.length;
@@ -3066,24 +3066,24 @@ function hc(e) {
   };
 }
 function wn(e, t, n = yr(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ni(t, n), o = lc(e), c = kr(r, i, o), a = ri(s, c, n);
+  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ni(t, n), o = uc(e), c = kr(r, i, o), a = ri(s, c, n);
   return he.encode(ft(new Uint8Array([2]), n, c, a));
 }
 function bn(e, t) {
-  const { nonce: n, ciphertext: r, mac: i } = hc(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = ni(t, n), a = ri(c, r, n);
+  const { nonce: n, ciphertext: r, mac: i } = fc(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = ni(t, n), a = ri(c, r, n);
   if (!qs(a, i))
     throw new Error("invalid MAC");
   const l = kr(s, o, r);
-  return fc(l);
+  return lc(l);
 }
-var dc = {
+var hc = {
   utils: {
     getConversationKey: yn,
     calcPaddedLen: gn
   },
   encrypt: wn,
   decrypt: bn
-}, pc = 2 * 24 * 60 * 60, ii = () => Math.round(Date.now() / 1e3), si = () => Math.round(ii() - Math.random() * pc), oi = (e, t) => yn(e, t), ai = (e, t, n) => wn(JSON.stringify(e), oi(t, n)), zn = (e, t) => JSON.parse(bn(e.content, oi(t, e.pubkey)));
+}, dc = 2 * 24 * 60 * 60, ii = () => Math.round(Date.now() / 1e3), si = () => Math.round(ii() - Math.random() * dc), oi = (e, t) => yn(e, t), ai = (e, t, n) => wn(JSON.stringify(e), oi(t, n)), zn = (e, t) => JSON.parse(bn(e.content, oi(t, e.pubkey)));
 function ci(e, t) {
   const n = {
     created_at: ii(),
@@ -3121,7 +3121,7 @@ function st(e, t, n) {
   const r = ci(e, t), i = ui(r, t, n);
   return li(i, n);
 }
-function yc(e, t, n) {
+function pc(e, t, n) {
   if (!n || n.length === 0)
     throw new Error("At least one recipient is required.");
   const r = ae(t), i = [st(e, t, r)];
@@ -3139,7 +3139,7 @@ function fi(e, t) {
     n.push(vn(r, t));
   }), n.sort((r, i) => r.created_at - i.created_at), n;
 }
-function gc(e, t, n, r) {
+function yc(e, t, n, r) {
   const i = {
     created_at: Math.ceil(Date.now() / 1e3),
     kind: Or,
@@ -3151,23 +3151,23 @@ function gc(e, t, n, r) {
   }), r && i.tags.push(["e", r.eventId, r.relayUrl || "", "reply"]), n && i.tags.push(["subject", n]), i;
 }
 function hi(e, t, n, r, i) {
-  const s = gc(t, n, r, i);
+  const s = yc(t, n, r, i);
   return st(s, e, t.publicKey);
 }
-function wc(e, t, n, r, i) {
+function gc(e, t, n, r, i) {
   if (!t || t.length === 0)
     throw new Error("At least one recipient is required.");
   return [{ publicKey: ae(e) }, ...t].map(
     (o) => hi(e, o, n, r, i)
   );
 }
-var bc = vn, vc = fi, mc = {};
-P(mc, {
-  finishRepostEvent: () => Ec,
-  getRepostedEvent: () => xc,
+var wc = vn, bc = fi, vc = {};
+H(vc, {
+  finishRepostEvent: () => mc,
+  getRepostedEvent: () => Ec,
   getRepostedEventPointer: () => di
 });
-function Ec(e, t, n, r) {
+function mc(e, t, n, r) {
   var o;
   let i;
   const s = [...e.tags ?? [], ["e", t.id, n], ["p", t.pubkey]];
@@ -3196,7 +3196,7 @@ function di(e) {
       author: n == null ? void 0 : n[1]
     };
 }
-function xc(e, { skipVerification: t } = {}) {
+function Ec(e, { skipVerification: t } = {}) {
   const n = di(e);
   if (n === void 0 || e.content === "")
     return;
@@ -3209,32 +3209,32 @@ function xc(e, { skipVerification: t } = {}) {
   if (r.id === n.id && !(!t && !gt(r)))
     return r;
 }
-var Kc = {};
-P(Kc, {
+var xc = {};
+H(xc, {
   NOSTR_URI_REGEX: () => mn,
-  parse: () => Sc,
+  parse: () => Kc,
   test: () => Nc
 });
 var mn = new RegExp(`nostr:(${Zr.source})`);
 function Nc(e) {
   return typeof e == "string" && new RegExp(`^${mn.source}$`).test(e);
 }
-function Sc(e) {
+function Kc(e) {
   const t = e.match(new RegExp(`^${mn.source}$`));
   if (!t)
     throw new Error(`Invalid Nostr URI: ${e}`);
   return {
     uri: t[0],
     value: t[1],
-    decoded: bt(t[1])
+    decoded: wt(t[1])
   };
 }
-var Ac = {};
-P(Ac, {
-  finishReactionEvent: () => Cc,
-  getReactedEventPointer: () => Bc
+var Sc = {};
+H(Sc, {
+  finishReactionEvent: () => Ac,
+  getReactedEventPointer: () => Cc
 });
-function Cc(e, t, n) {
+function Ac(e, t, n) {
   const r = t.tags.filter((i) => i.length >= 2 && (i[0] === "e" || i[0] === "p"));
   return Q(
     {
@@ -3246,7 +3246,7 @@ function Cc(e, t, n) {
     n
   );
 }
-function Bc(e) {
+function Cc(e) {
   if (e.kind !== cn)
     return;
   let t, n;
@@ -3261,11 +3261,11 @@ function Bc(e) {
       author: n[1]
     };
 }
-var kc = {};
-P(kc, {
+var Bc = {};
+H(Bc, {
   parse: () => Ic
 });
-var _c = /\W/m, Wn = /\W |\W$|$|,| /m;
+var kc = /\W/m, Wn = /\W |\W$|$|,| /m;
 function* Ic(e) {
   const t = e.length;
   let n = 0, r = 0;
@@ -3274,9 +3274,9 @@ function* Ic(e) {
     if (i === -1)
       break;
     if (e.substring(i - 5, i) === "nostr") {
-      const s = e.substring(i + 60).match(_c), o = s ? i + 60 + s.index : t;
+      const s = e.substring(i + 60).match(kc), o = s ? i + 60 + s.index : t;
       try {
-        let c, { data: a, type: l } = bt(e.substring(i + 1, o));
+        let c, { data: a, type: l } = wt(e.substring(i + 1, o));
         switch (l) {
           case "npub":
             c = { pubkey: a };
@@ -3337,15 +3337,15 @@ function* Ic(e) {
   }
   n !== t && (yield { type: "text", text: e.substring(n) });
 }
-var Uc = {};
-P(Uc, {
-  channelCreateEvent: () => Lc,
-  channelHideMessageEvent: () => Tc,
-  channelMessageEvent: () => Rc,
-  channelMetadataEvent: () => $c,
-  channelMuteUserEvent: () => Oc
+var _c = {};
+H(_c, {
+  channelCreateEvent: () => Uc,
+  channelHideMessageEvent: () => Rc,
+  channelMessageEvent: () => $c,
+  channelMetadataEvent: () => Lc,
+  channelMuteUserEvent: () => Tc
 });
-var Lc = (e, t) => {
+var Uc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3362,7 +3362,7 @@ var Lc = (e, t) => {
     },
     t
   );
-}, $c = (e, t) => {
+}, Lc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3379,7 +3379,7 @@ var Lc = (e, t) => {
     },
     t
   );
-}, Rc = (e, t) => {
+}, $c = (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"]), Q(
     {
@@ -3390,7 +3390,7 @@ var Lc = (e, t) => {
     },
     t
   );
-}, Tc = (e, t) => {
+}, Rc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3407,7 +3407,7 @@ var Lc = (e, t) => {
     },
     t
   );
-}, Oc = (e, t) => {
+}, Tc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3424,15 +3424,15 @@ var Lc = (e, t) => {
     },
     t
   );
-}, Mc = {};
-P(Mc, {
+}, Oc = {};
+H(Oc, {
   EMOJI_SHORTCODE_REGEX: () => pi,
-  matchAll: () => Pc,
+  matchAll: () => Mc,
   regex: () => En,
-  replaceAll: () => Hc
+  replaceAll: () => Pc
 });
 var pi = /:(\w+):/, En = () => new RegExp(`\\B${pi.source}\\B`, "g");
-function* Pc(e) {
+function* Mc(e) {
   const t = e.matchAll(En());
   for (const n of t)
     try {
@@ -3446,45 +3446,45 @@ function* Pc(e) {
     } catch {
     }
 }
-function Hc(e, t) {
+function Pc(e, t) {
   return e.replaceAll(En(), (n, r) => t({
     shortcode: n,
     name: r
   }));
 }
-var qc = {};
-P(qc, {
-  useFetchImplementation: () => Dc,
-  validateGithub: () => jc
+var Hc = {};
+H(Hc, {
+  useFetchImplementation: () => qc,
+  validateGithub: () => Dc
 });
 var xn;
 try {
   xn = fetch;
 } catch {
 }
-function Dc(e) {
+function qc(e) {
   xn = e;
 }
-async function jc(e, t, n) {
+async function Dc(e, t, n) {
   try {
     return await (await xn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
   } catch {
     return !1;
   }
 }
-var zc = {};
-P(zc, {
-  makeNwcRequestEvent: () => Vc,
-  parseConnectionString: () => Wc
+var jc = {};
+H(jc, {
+  makeNwcRequestEvent: () => Wc,
+  parseConnectionString: () => zc
 });
-function Wc(e) {
+function zc(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 Vc(e, t, n) {
-  const i = await Gr(t, e, JSON.stringify({
+async function Wc(e, t, n) {
+  const i = Fr(t, e, JSON.stringify({
     method: "pay_invoice",
     params: {
       invoice: n
@@ -3497,30 +3497,31 @@ async function Vc(e, t, n) {
   };
   return Q(s, t);
 }
-var Zc = {};
-P(Zc, {
-  normalizeIdentifier: () => Gc
+var Vc = {};
+H(Vc, {
+  normalizeIdentifier: () => Zc
 });
-function Gc(e) {
+function Zc(e) {
   return e = e.trim().toLowerCase(), e = e.normalize("NFKC"), Array.from(e).map((t) => new RegExp("\\p{Letter}", "u").test(t) || new RegExp("\\p{Number}", "u").test(t) ? t : "-").join("");
 }
 var Fc = {};
-P(Fc, {
-  getZapEndpoint: () => Yc,
-  makeZapReceipt: () => eu,
-  makeZapRequest: () => Xc,
-  useFetchImplementation: () => Jc,
-  validateZapRequest: () => Qc
+H(Fc, {
+  getSatoshisAmountFromBolt11: () => eu,
+  getZapEndpoint: () => Jc,
+  makeZapReceipt: () => Qc,
+  makeZapRequest: () => Yc,
+  useFetchImplementation: () => Gc,
+  validateZapRequest: () => Xc
 });
-var Kn;
+var Nn;
 try {
-  Kn = fetch;
+  Nn = fetch;
 } catch {
 }
-function Jc(e) {
-  Kn = e;
+function Gc(e) {
+  Nn = e;
 }
-async function Yc(e) {
+async function Jc(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
@@ -3531,14 +3532,14 @@ async function Yc(e) {
       t = new URL(`/.well-known/lnurlp/${o}`, `https://${c}`).toString();
     } else
       return null;
-    let s = await (await Kn(t)).json();
+    let s = await (await Nn(t)).json();
     if (s.allowsNostr && s.nostrPubkey)
       return s.callback;
   } catch {
   }
   return null;
 }
-function Xc({
+function Yc({
   profile: e,
   event: t,
   amount: n,
@@ -3560,10 +3561,10 @@ function Xc({
     ]
   };
   if (t && typeof t == "string" && s.tags.push(["e", t]), t && typeof t == "object") {
-    if (on(t.kind)) {
+    if (sn(t.kind)) {
       const o = ["a", `${t.kind}:${t.pubkey}:`];
       s.tags.push(o);
-    } else if (wt(t.kind)) {
+    } else if (on(t.kind)) {
       let o = t.tags.find(([a, l]) => a === "d" && l);
       if (!o)
         throw new Error("d tag not found or is empty");
@@ -3573,7 +3574,7 @@ function Xc({
   }
   return s;
 }
-function Qc(e) {
+function Xc(e) {
   let t;
   try {
     t = JSON.parse(e);
@@ -3592,7 +3593,7 @@ function Qc(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 eu({
+function Qc({
   zapRequest: e,
   preimage: t,
   bolt11: n,
@@ -3606,10 +3607,41 @@ function eu({
   };
   return t && o.tags.push(["preimage", t]), o;
 }
+function eu(e) {
+  if (e.length < 50)
+    return 0;
+  e = e.substring(0, 50);
+  const t = e.lastIndexOf("1");
+  if (t === -1)
+    return 0;
+  const n = e.substring(0, t);
+  if (!n.startsWith("lnbc"))
+    return 0;
+  const r = n.substring(4);
+  if (r.length < 1)
+    return 0;
+  const i = r[r.length - 1], s = i.charCodeAt(0) - 48, o = s >= 0 && s <= 9;
+  let c = r.length - 1;
+  if (o && c++, c < 1)
+    return 0;
+  const a = parseInt(r.substring(0, c));
+  switch (i) {
+    case "m":
+      return a * 1e5;
+    case "u":
+      return a * 100;
+    case "n":
+      return a / 10;
+    case "p":
+      return a / 1e4;
+    default:
+      return a * 1e8;
+  }
+}
 var tu = {};
-P(tu, {
+H(tu, {
   getToken: () => nu,
-  hashPayload: () => Nn,
+  hashPayload: () => Kn,
   unpackEventFromToken: () => gi,
   validateEvent: () => xi,
   validateEventKind: () => bi,
@@ -3630,7 +3662,7 @@ async function nu(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && s.tags.push(["payload", Nn(i)]);
+  i && s.tags.push(["payload", Kn(i)]);
   const o = await n(s);
   return (r ? yi : "") + he.encode(ne.encode(JSON.stringify(o)));
 }
@@ -3665,15 +3697,15 @@ function mi(e, t) {
   const n = e.tags.find((r) => r[0] === "method");
   return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
 }
-function Nn(e) {
+function Kn(e) {
   const t = fe(ne.encode(JSON.stringify(e)));
-  return H(t);
+  return P(t);
 }
 function Ei(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
   if (!n)
     return !1;
-  const r = Nn(t);
+  const r = Kn(t);
   return n.length > 0 && n[1] === r;
 }
 async function xi(e, t, n, r) {
@@ -3695,19 +3727,19 @@ const Oe = 1060, Vn = 30078, Zn = 1059, iu = 14, wu = 100, su = 1;
 function bu(e) {
   return JSON.stringify({
     version: su,
-    rootKey: H(e.rootKey),
+    rootKey: P(e.rootKey),
     theirCurrentNostrPublicKey: e.theirCurrentNostrPublicKey,
     theirNextNostrPublicKey: e.theirNextNostrPublicKey,
     ourCurrentNostrKey: e.ourCurrentNostrKey ? {
       publicKey: e.ourCurrentNostrKey.publicKey,
-      privateKey: H(e.ourCurrentNostrKey.privateKey)
+      privateKey: P(e.ourCurrentNostrKey.privateKey)
     } : void 0,
     ourNextNostrKey: {
       publicKey: e.ourNextNostrKey.publicKey,
-      privateKey: H(e.ourNextNostrKey.privateKey)
+      privateKey: P(e.ourNextNostrKey.privateKey)
     },
-    receivingChainKey: e.receivingChainKey ? H(e.receivingChainKey) : void 0,
-    sendingChainKey: e.sendingChainKey ? H(e.sendingChainKey) : void 0,
+    receivingChainKey: e.receivingChainKey ? P(e.receivingChainKey) : void 0,
+    sendingChainKey: e.sendingChainKey ? P(e.sendingChainKey) : void 0,
     sendingChainMessageNumber: e.sendingChainMessageNumber,
     receivingChainMessageNumber: e.receivingChainMessageNumber,
     previousSendingChainMessageCount: e.previousSendingChainMessageCount,
@@ -3715,11 +3747,11 @@ function bu(e) {
       Object.entries(e.skippedKeys).map(([t, n]) => [
         t,
         {
-          headerKeys: n.headerKeys.map((r) => H(r)),
+          headerKeys: n.headerKeys.map((r) => P(r)),
           messageKeys: Object.fromEntries(
             Object.entries(n.messageKeys).map(([r, i]) => [
               r,
-              H(i)
+              P(i)
             ])
           )
         }
@@ -3738,19 +3770,19 @@ function vu(e) {
         messageKeys: i
       };
     }), {
-      rootKey: z(t.rootKey),
+      rootKey: j(t.rootKey),
       theirCurrentNostrPublicKey: t.theirCurrentNostrPublicKey,
       theirNextNostrPublicKey: t.theirNextNostrPublicKey,
       ourCurrentNostrKey: t.ourCurrentNostrKey ? {
         publicKey: t.ourCurrentNostrKey.publicKey,
-        privateKey: z(t.ourCurrentNostrKey.privateKey)
+        privateKey: j(t.ourCurrentNostrKey.privateKey)
       } : void 0,
       ourNextNostrKey: {
         publicKey: t.ourNextNostrKey.publicKey,
-        privateKey: z(t.ourNextNostrKey.privateKey)
+        privateKey: j(t.ourNextNostrKey.privateKey)
       },
-      receivingChainKey: t.receivingChainKey ? z(t.receivingChainKey) : void 0,
-      sendingChainKey: t.sendingChainKey ? z(t.sendingChainKey) : void 0,
+      receivingChainKey: t.receivingChainKey ? j(t.receivingChainKey) : void 0,
+      sendingChainKey: t.sendingChainKey ? j(t.sendingChainKey) : void 0,
       sendingChainMessageNumber: t.sendingChainMessageNumber,
       receivingChainMessageNumber: t.receivingChainMessageNumber,
       previousSendingChainMessageCount: t.previousSendingChainMessageCount,
@@ -3758,19 +3790,19 @@ function vu(e) {
     };
   }
   return {
-    rootKey: z(t.rootKey),
+    rootKey: j(t.rootKey),
     theirCurrentNostrPublicKey: t.theirCurrentNostrPublicKey,
     theirNextNostrPublicKey: t.theirNextNostrPublicKey,
     ourCurrentNostrKey: t.ourCurrentNostrKey ? {
       publicKey: t.ourCurrentNostrKey.publicKey,
-      privateKey: z(t.ourCurrentNostrKey.privateKey)
+      privateKey: j(t.ourCurrentNostrKey.privateKey)
     } : void 0,
     ourNextNostrKey: {
       publicKey: t.ourNextNostrKey.publicKey,
-      privateKey: z(t.ourNextNostrKey.privateKey)
+      privateKey: j(t.ourNextNostrKey.privateKey)
     },
-    receivingChainKey: t.receivingChainKey ? z(t.receivingChainKey) : void 0,
-    sendingChainKey: t.sendingChainKey ? z(t.sendingChainKey) : void 0,
+    receivingChainKey: t.receivingChainKey ? j(t.receivingChainKey) : void 0,
+    sendingChainKey: t.sendingChainKey ? j(t.sendingChainKey) : void 0,
     sendingChainMessageNumber: t.sendingChainMessageNumber,
     receivingChainMessageNumber: t.receivingChainMessageNumber,
     previousSendingChainMessageCount: t.previousSendingChainMessageCount,
@@ -3778,11 +3810,11 @@ function vu(e) {
       Object.entries(t.skippedKeys || {}).map(([n, r]) => [
         n,
         {
-          headerKeys: r.headerKeys.map((i) => z(i)),
+          headerKeys: r.headerKeys.map((i) => j(i)),
           messageKeys: Object.fromEntries(
             Object.entries(r.messageKeys).map(([i, s]) => [
               i,
-              z(s)
+              j(s)
             ])
           )
         }
@@ -3806,9 +3838,9 @@ async function* mu(e) {
   }
 }
 function Me(e, t = new Uint8Array(32), n = 1) {
-  const r = rn(fe, e, t), i = [];
+  const r = nn(fe, e, t), i = [];
   for (let s = 1; s <= n; s++)
-    i.push(Ir(fe, r, new Uint8Array([s]), 32));
+    i.push(_r(fe, r, new Uint8Array([s]), 32));
   return i;
 }
 function Eu(e, t) {
@@ -3833,9 +3865,9 @@ class ot {
   }
   /**
    * Initializes a new secure communication session
-   * @param nostrSubscribe Function to subscribe to Nostr events. Make sure it deduplicates events (doesnt return the same event twice), otherwise you'll see decryption errors!
-   * @param theirNextNostrPublicKey The public key of the other party
-   * @param ourCurrentPrivateKey Our current private key for Nostr
+   * @param nostrSubscribe Function to subscribe to Nostr events. Make sure it deduplicates events (doesn't return the same event twice), otherwise you'll see decryption errors!
+   * @param theirEphemeralNostrPublicKey The ephemeral public key of the other party for the initial handshake
+   * @param ourEphemeralNostrPrivateKey Our ephemeral private key for the initial handshake
    * @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 session (for debugging)
@@ -3854,7 +3886,7 @@ class ot {
       publicKey: ae(r),
       privateKey: r
     });
-    const g = {
+    const p = {
       rootKey: a,
       theirNextNostrPublicKey: n,
       ourCurrentNostrKey: f,
@@ -3865,7 +3897,7 @@ class ot {
       receivingChainMessageNumber: 0,
       previousSendingChainMessageCount: 0,
       skippedKeys: {}
-    }, w = new ot(t, g);
+    }, w = new ot(t, p);
     return o && (w.name = o), w;
   }
   /**
@@ -4007,17 +4039,25 @@ class ot {
     throw new Error("Failed to decrypt header with current and skipped header keys");
   }
   handleNostrEvent(t) {
-    var c, a;
-    const [n, r, i] = this.decryptHeader(t);
-    if (!i)
-      this.state.theirNextNostrPublicKey !== n.nextPublicKey && (this.state.theirCurrentNostrPublicKey = this.state.theirNextNostrPublicKey, this.state.theirNextNostrPublicKey = n.nextPublicKey, (c = this.nostrUnsubscribe) == null || c.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
-        { authors: [this.state.theirNextNostrPublicKey], kinds: [Oe] },
-        (l) => this.handleNostrEvent(l)
-      )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep());
-    else if (!((a = this.state.skippedKeys[t.pubkey]) != null && a.messageKeys[n.number]))
-      return;
-    const s = this.ratchetDecrypt(n, t.content, t.pubkey), o = JSON.parse(s);
-    pt(o) && o.id === qe(o) && this.internalSubscriptions.forEach((l) => l(o, t));
+    var n, r;
+    try {
+      const [i, s, o] = this.decryptHeader(t);
+      if (!o)
+        this.state.theirNextNostrPublicKey !== i.nextPublicKey && (this.state.theirCurrentNostrPublicKey = this.state.theirNextNostrPublicKey, this.state.theirNextNostrPublicKey = i.nextPublicKey, (n = this.nostrUnsubscribe) == null || n.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
+          { authors: [this.state.theirNextNostrPublicKey], kinds: [Oe] },
+          (l) => this.handleNostrEvent(l)
+        )), s && (this.skipMessageKeys(i.previousChainLength, t.pubkey), this.ratchetStep());
+      else if (!((r = this.state.skippedKeys[t.pubkey]) != null && r.messageKeys[i.number]))
+        return;
+      const c = this.ratchetDecrypt(i, t.content, t.pubkey), a = JSON.parse(c);
+      if (!pt(a) || a.id !== qe(a))
+        return;
+      this.internalSubscriptions.forEach((l) => l(a, t));
+    } catch (i) {
+      if (i instanceof Error && i.message.includes("Failed to decrypt header"))
+        return;
+      throw i;
+    }
   }
   subscribeToNostrEvents() {
     if (this.nostrNextUnsubscribe) return;
@@ -4038,18 +4078,18 @@ class ot {
 new TextDecoder("utf-8");
 new TextEncoder();
 function Qe(e, t) {
-  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return rn(fe, n, "nip44-v2");
+  const n = _e.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return nn(fe, n, "nip44-v2");
 }
 const cu = 2 * 24 * 60 * 60, uu = () => Math.round(Date.now() / 1e3), lu = () => Math.round(uu() - Math.random() * cu);
 class Pe {
   constructor(t, n, r, i, s, o, c = []) {
-    this.inviterEphemeralPublicKey = t, this.sharedSecret = n, this.inviter = r, this.inviterEphemeralPrivateKey = i, this.label = s, this.maxUses = o, this.usedBy = c;
+    this.inviterEphemeralPublicKey = t, this.sharedSecret = n, this.inviter = r, this.inviterEphemeralPrivateKey = i, this.deviceId = s, this.maxUses = o, this.usedBy = c;
   }
   static createNew(t, n, r) {
     if (!t)
       throw new Error("Inviter public key is required");
-    const i = ke(), s = ae(i), o = H(ke());
+    const i = ke(), s = ae(i), o = P(ke());
     return new Pe(
       s,
       o,
@@ -4086,13 +4126,13 @@ class Pe {
       n.sharedSecret,
       n.inviter,
       n.inviterEphemeralPrivateKey ? new Uint8Array(n.inviterEphemeralPrivateKey) : void 0,
-      n.label,
+      n.deviceId,
       n.maxUses,
       n.usedBy
     );
   }
   static fromEvent(t) {
-    var o, c;
+    var a, l, f, u;
     if (!t.sig)
       throw new Error("Event is not signed");
     if (!gt(t))
@@ -4100,13 +4140,16 @@ class Pe {
     const { tags: n } = t;
     if (!n)
       throw new Error("Invalid invite event: missing tags");
-    const r = (o = n.find(([a]) => a === "ephemeralKey")) == null ? void 0 : o[1], i = (c = n.find(([a]) => a === "sharedSecret")) == null ? void 0 : c[1], s = t.pubkey;
+    const r = (a = n.find(([p]) => p === "ephemeralKey")) == null ? void 0 : a[1], i = (l = n.find(([p]) => p === "sharedSecret")) == null ? void 0 : l[1], s = t.pubkey, o = (f = n.find(([p]) => p === "d")) == null ? void 0 : f[1], c = (u = o == null ? void 0 : o.split("/")) == null ? void 0 : u[2];
     if (!r || !i)
       throw new Error("Invalid invite event: missing session key or sharedSecret");
     return new Pe(
       r,
       i,
-      s
+      s,
+      void 0,
+      // inviterEphemeralPrivateKey not available when parsing from event
+      c
     );
   }
   static fromUser(t, n, r) {
@@ -4114,11 +4157,10 @@ class Pe {
       kinds: [Vn],
       authors: [t],
       "#l": ["double-ratchet/invites"]
-    };
-    let s = 0;
+    }, s = /* @__PURE__ */ new Set();
     return n(i, (c) => {
-      if (!(!c.created_at || c.created_at <= s)) {
-        s = c.created_at;
+      if (!s.has(c.id)) {
+        s.add(c.id);
         try {
           const a = Pe.fromEvent(c);
           r(a);
@@ -4136,7 +4178,7 @@ class Pe {
       sharedSecret: this.sharedSecret,
       inviter: this.inviter,
       inviterEphemeralPrivateKey: this.inviterEphemeralPrivateKey ? Array.from(this.inviterEphemeralPrivateKey) : void 0,
-      label: this.label,
+      deviceId: this.deviceId,
       maxUses: this.maxUses,
       usedBy: this.usedBy
     });
@@ -4152,9 +4194,9 @@ class Pe {
     }, r = new URL(t);
     return r.hash = encodeURIComponent(JSON.stringify(n)), r.toString();
   }
-  getEvent(t) {
-    if (!t)
-      throw new Error("Device name is required");
+  getEvent() {
+    if (!this.deviceId)
+      throw new Error("Device ID is required");
     return {
       kind: Vn,
       pubkey: this.inviter,
@@ -4163,18 +4205,19 @@ class Pe {
       tags: [
         ["ephemeralKey", this.inviterEphemeralPublicKey],
         ["sharedSecret", this.sharedSecret],
-        ["d", "double-ratchet/invites/" + t],
+        ["d", "double-ratchet/invites/" + this.deviceId],
         ["l", "double-ratchet/invites"]
       ]
     };
   }
   /**
        * 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
+       * @param inviteePublicKey - The invitee's public key
+       * @param encryptor - The invitee's secret key or a signing/encrypt function
        * @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.
        * 2. Envelope: No signature, content encrypted with DH(inviter, random key).
@@ -4184,14 +4227,14 @@ class Pe {
        * so the inviter can create the session on their side.
        */
   async accept(t, n, r) {
-    const i = ke(), s = ae(i), o = this.inviter || this.inviterEphemeralPublicKey, c = z(this.sharedSecret), a = ot.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), f = await (typeof r == "function" ? r : (d, p) => Promise.resolve(D.encrypt(d, Qe(r, p))))(s, o), u = {
+    const i = ke(), s = ae(i), o = this.inviter || this.inviterEphemeralPublicKey, c = j(this.sharedSecret), a = ot.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), f = await (typeof r == "function" ? r : (d, y) => Promise.resolve(D.encrypt(d, Qe(r, y))))(s, o), u = {
       pubkey: n,
       content: await D.encrypt(f, c),
       created_at: Math.floor(Date.now() / 1e3)
-    }, g = JSON.stringify(u), w = ke(), y = ae(w), h = {
+    }, p = JSON.stringify(u), w = ke(), g = ae(w), h = {
       kind: Zn,
-      pubkey: y,
-      content: D.encrypt(g, Qe(w, this.inviterEphemeralPublicKey)),
+      pubkey: g,
+      content: D.encrypt(p, Qe(w, this.inviterEphemeralPublicKey)),
       created_at: lu(),
       tags: [["p", this.inviterEphemeralPublicKey]]
     };
@@ -4208,10 +4251,10 @@ class Pe {
       try {
         if (this.maxUses && this.usedBy.length >= this.maxUses)
           return;
-        const o = await D.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o), a = z(this.sharedSecret), l = c.pubkey;
+        const o = await D.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o), a = j(this.sharedSecret), l = c.pubkey;
         this.usedBy.push(l);
-        const f = await D.decrypt(c.content, a), g = await (typeof t == "function" ? t : (h, d) => Promise.resolve(D.decrypt(h, Qe(t, d))))(f, l), w = s.id, y = ot.init(n, g, this.inviterEphemeralPrivateKey, !1, a, w);
-        r(y, l);
+        const f = await D.decrypt(c.content, a), p = await (typeof t == "function" ? t : (h, d) => Promise.resolve(D.decrypt(h, Qe(t, d))))(f, l), w = s.id, g = ot.init(n, p, this.inviterEphemeralPrivateKey, !1, a, w);
+        r(g, l);
       } catch {
       }
     });