nostr-double-ratchet 0.0.3 → 0.0.5

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

@@ -28,9 +28,9 @@ function ci(e, t) {
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const St = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const At = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const On = (e) => e instanceof Uint8Array, Kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ne = (e, t) => e << 32 - t | e >>> t, li = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const On = (e) => e instanceof Uint8Array, St = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ne = (e, t) => e << 32 - t | e >>> t, li = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!li)
   throw new Error("Non little-endian hardware is not supported");
 function ui(e) {
@@ -38,7 +38,7 @@ function ui(e) {
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function zt(e) {
+function Vt(e) {
   if (typeof e == "string" && (e = ui(e)), !On(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
@@ -59,12 +59,12 @@ let Mn = class {
   }
 };
 function hi(e) {
-  const t = (r) => e().update(zt(r)).digest(), n = e();
+  const t = (r) => e().update(Vt(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function Hn(e = 32) {
-  if (St && typeof St.getRandomValues == "function")
-    return St.getRandomValues(new Uint8Array(e));
+  if (At && typeof At.getRandomValues == "function")
+    return At.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 function di(e, t, n, r) {
@@ -75,17 +75,17 @@ function di(e, t, n, r) {
 }
 let yi = class extends Mn {
   constructor(t, n, r, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = 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 = St(this.buffer);
   }
   update(t) {
     rt(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = zt(t);
+    t = Vt(t);
     const o = t.length;
     for (let s = 0; s < o; ) {
       const c = Math.min(i - this.pos, o - s);
       if (c === i) {
-        const a = Kt(t);
+        const a = St(t);
         for (; i <= o - s; s += i)
           this.process(a, s);
         continue;
@@ -102,7 +102,7 @@ let yi = class extends Mn {
     for (let u = s; u < i; u++)
       n[u] = 0;
     di(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const c = Kt(t), a = this.outputLen;
+    const c = St(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = a / 4, f = this.get();
@@ -123,7 +123,7 @@ let yi = class extends Mn {
     return t.length = i, t.pos = c, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
   }
 };
-const gi = (e, t, n) => e & t ^ ~e & n, pi = (e, t, n) => e & t ^ e & n ^ t & n, wi = /* @__PURE__ */ new Uint32Array([
+const pi = (e, t, n) => e & t ^ ~e & n, gi = (e, t, n) => e & t ^ e & n ^ t & n, wi = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -188,7 +188,7 @@ const gi = (e, t, n) => e & t ^ ~e & n, pi = (e, t, n) => e & t ^ e & n ^ t & n,
   2756734187,
   3204031479,
   3329325298
-]), pe = /* @__PURE__ */ new Uint32Array([
+]), ge = /* @__PURE__ */ new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -200,7 +200,7 @@ const gi = (e, t, n) => e & t ^ ~e & n, pi = (e, t, n) => e & t ^ e & n ^ t & n,
 ]), we = /* @__PURE__ */ new Uint32Array(64);
 let bi = class extends yi {
   constructor() {
-    super(64, 32, 8, !1), this.A = pe[0] | 0, this.B = pe[1] | 0, this.C = pe[2] | 0, this.D = pe[3] | 0, this.E = pe[4] | 0, this.F = pe[5] | 0, this.G = pe[6] | 0, this.H = pe[7] | 0;
+    super(64, 32, 8, !1), this.A = ge[0] | 0, this.B = ge[1] | 0, this.C = ge[2] | 0, this.D = ge[3] | 0, this.E = ge[4] | 0, this.F = ge[5] | 0, this.G = ge[6] | 0, this.H = ge[7] | 0;
   }
   get() {
     const { A: t, B: n, C: r, D: i, E: o, F: s, G: c, H: a } = this;
@@ -214,13 +214,13 @@ let bi = class extends yi {
     for (let u = 0; u < 16; u++, n += 4)
       we[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const d = we[u - 15], g = we[u - 2], w = ne(d, 7) ^ ne(d, 18) ^ d >>> 3, h = ne(g, 17) ^ ne(g, 19) ^ g >>> 10;
-      we[u] = h + we[u - 7] + w + we[u - 16] | 0;
+      const d = we[u - 15], p = we[u - 2], g = ne(d, 7) ^ ne(d, 18) ^ d >>> 3, h = ne(p, 17) ^ ne(p, 19) ^ p >>> 10;
+      we[u] = h + we[u - 7] + g + we[u - 16] | 0;
     }
     let { A: r, B: i, C: o, D: s, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const d = ne(c, 6) ^ ne(c, 11) ^ ne(c, 25), g = f + d + gi(c, a, l) + wi[u] + we[u] | 0, h = (ne(r, 2) ^ ne(r, 13) ^ ne(r, 22)) + pi(r, i, o) | 0;
-      f = l, l = a, a = c, c = s + g | 0, s = o, o = i, i = r, r = g + h | 0;
+      const d = ne(c, 6) ^ ne(c, 11) ^ ne(c, 25), p = f + d + pi(c, a, l) + wi[u] + we[u] | 0, h = (ne(r, 2) ^ ne(r, 13) ^ ne(r, 22)) + gi(r, i, o) | 0;
+      f = l, l = a, a = c, c = s + p | 0, s = o, o = i, i = r, r = p + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, o = o + this.C | 0, s = s + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, c, a, l, f);
   }
@@ -231,11 +231,11 @@ let bi = class extends yi {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const $t = /* @__PURE__ */ hi(() => new bi());
+const Lt = /* @__PURE__ */ hi(() => new bi());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const qn = BigInt(0), ut = BigInt(1), vi = BigInt(2), ft = (e) => e instanceof Uint8Array, mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const qn = BigInt(0), lt = BigInt(1), vi = BigInt(2), ut = (e) => e instanceof Uint8Array, mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function He(e) {
-  if (!ft(e))
+  if (!ut(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
@@ -266,11 +266,11 @@ function qe(e) {
   }
   return n;
 }
-function W(e) {
+function G(e) {
   return Zt(He(e));
 }
 function Ft(e) {
-  if (!ft(e))
+  if (!ut(e))
     throw new Error("Uint8Array expected");
   return Zt(He(Uint8Array.from(e).reverse()));
 }
@@ -291,7 +291,7 @@ function Z(e, t, n) {
     } catch (o) {
       throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${o}`);
     }
-  else if (ft(t))
+  else if (ut(t))
     r = Uint8Array.from(t);
   else
     throw new Error(`${e} must be hex string or Uint8Array`);
@@ -304,7 +304,7 @@ function Ie(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!ft(r))
+    if (!ut(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
@@ -324,14 +324,14 @@ function Ai(e) {
 }
 function Si(e) {
   let t;
-  for (t = 0; e > qn; e >>= ut, t += 1)
+  for (t = 0; e > qn; e >>= lt, t += 1)
     ;
   return t;
 }
 function Ki(e, t) {
-  return e >> BigInt(t) & ut;
+  return e >> BigInt(t) & lt;
 }
-const Bi = (e, t, n) => e | (n ? ut : qn) << BigInt(t), Gt = (e) => (vi << BigInt(e - 1)) - ut, Bt = (e) => new Uint8Array(e), En = (e) => Uint8Array.from(e);
+const Bi = (e, t, n) => e | (n ? lt : qn) << BigInt(t), Gt = (e) => (vi << BigInt(e - 1)) - lt, Kt = (e) => new Uint8Array(e), En = (e) => Uint8Array.from(e);
 function jn(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -339,10 +339,10 @@ function jn(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 = Bt(e), i = Bt(e), o = 0;
+  let r = Kt(e), i = Kt(e), o = 0;
   const s = () => {
     r.fill(1), i.fill(0), o = 0;
-  }, c = (...u) => n(i, r, ...u), a = (u = Bt()) => {
+  }, c = (...u) => n(i, r, ...u), a = (u = Kt()) => {
     i = c(En([0]), u), r = c(), u.length !== 0 && (i = c(En([1]), u), r = c());
   }, l = () => {
     if (o++ >= 1e3)
@@ -351,17 +351,17 @@ function jn(e, t, n) {
     const d = [];
     for (; u < t; ) {
       r = c();
-      const g = r.slice();
-      d.push(g), u += r.length;
+      const p = r.slice();
+      d.push(p), u += r.length;
     }
     return Ie(...d);
   };
   return (u, d) => {
     s(), a(u);
-    let g;
-    for (; !(g = d(l())); )
+    let p;
+    for (; !(p = d(l())); )
       a();
-    return s(), g;
+    return s(), p;
   };
 }
 const Ni = {
@@ -397,7 +397,7 @@ const Ci = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   bitMask: Gt,
   bitSet: Bi,
   bytesToHex: He,
-  bytesToNumberBE: W,
+  bytesToNumberBE: G,
   bytesToNumberLE: Ft,
   concatBytes: Ie,
   createHmacDrbg: jn,
@@ -413,10 +413,10 @@ const Ci = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   validateObject: Je
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const j = BigInt(0), q = BigInt(1), Be = BigInt(2), Ii = BigInt(3), Tt = BigInt(4), xn = BigInt(5), An = BigInt(8);
+const j = BigInt(0), q = BigInt(1), Be = BigInt(2), Ii = BigInt(3), $t = BigInt(4), xn = BigInt(5), An = BigInt(8);
 BigInt(9);
 BigInt(16);
-function z(e, t) {
+function V(e, t) {
   const n = e % t;
   return n >= j ? n : t + n;
 }
@@ -430,25 +430,25 @@ function Ui(e, t, n) {
     t & q && (r = r * e % n), e = e * e % n, t >>= q;
   return r;
 }
-function G(e, t, n) {
+function J(e, t, n) {
   let r = e;
   for (; t-- > j; )
     r *= r, r %= n;
   return r;
 }
-function Rt(e, t) {
+function Tt(e, t) {
   if (e === j || t <= j)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
-  let n = z(e, t), r = t, i = j, o = q;
+  let n = V(e, t), r = t, i = j, o = q;
   for (; n !== j; ) {
     const c = r / n, a = r % n, l = i - o * c;
     r = n, n = a, i = o, o = l;
   }
   if (r !== q)
     throw new Error("invert: does not exist");
-  return z(i, t);
+  return V(i, t);
 }
-function _i(e) {
+function ki(e) {
   const t = (e - q) / Be;
   let n, r, i;
   for (n = e - q, r = 0; n % Be === j; n /= Be, r++)
@@ -456,7 +456,7 @@ function _i(e) {
   for (i = Be; i < e && Ui(i, t, e) !== e - q; i++)
     ;
   if (r === 1) {
-    const s = (e + q) / Tt;
+    const s = (e + q) / $t;
     return function(a, l) {
       const f = a.pow(l, s);
       if (!a.eql(a.sqr(f), l))
@@ -472,18 +472,18 @@ function _i(e) {
     for (; !c.eql(d, c.ONE); ) {
       if (c.eql(d, c.ZERO))
         return c.ZERO;
-      let g = 1;
-      for (let h = c.sqr(d); g < l && !c.eql(h, c.ONE); g++)
+      let p = 1;
+      for (let h = c.sqr(d); p < l && !c.eql(h, c.ONE); p++)
         h = c.sqr(h);
-      const w = c.pow(f, q << BigInt(l - g - 1));
-      f = c.sqr(w), u = c.mul(u, w), d = c.mul(d, f), l = g;
+      const g = c.pow(f, q << BigInt(l - p - 1));
+      f = c.sqr(g), u = c.mul(u, g), d = c.mul(d, f), l = p;
     }
     return u;
   };
 }
-function ki(e) {
-  if (e % Tt === Ii) {
-    const t = (e + q) / Tt;
+function _i(e) {
+  if (e % $t === Ii) {
+    const t = (e + q) / $t;
     return function(r, i) {
       const o = r.pow(i, t);
       if (!r.eql(r.sqr(o), i))
@@ -500,7 +500,7 @@ function ki(e) {
       return l;
     };
   }
-  return _i(e);
+  return ki(e);
 }
 const Li = [
   "create",
@@ -546,24 +546,24 @@ function Ri(e, t) {
   const n = new Array(t.length), r = t.reduce((o, s, c) => e.is0(s) ? o : (n[c] = o, e.mul(o, s)), e.ONE), i = e.inv(r);
   return t.reduceRight((o, s, c) => e.is0(s) ? o : (n[c] = e.mul(o, n[c]), e.mul(o, s)), i), n;
 }
-function Vn(e, t) {
+function zn(e, t) {
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
   return { nBitLength: n, nByteLength: r };
 }
 function Pi(e, t, n = !1, r = {}) {
   if (e <= j)
     throw new Error(`Expected Field ORDER > 0, got ${e}`);
-  const { nBitLength: i, nByteLength: o } = Vn(e, t);
+  const { nBitLength: i, nByteLength: o } = zn(e, t);
   if (o > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const s = ki(e), c = Object.freeze({
+  const s = _i(e), c = Object.freeze({
     ORDER: e,
     BITS: i,
     BYTES: o,
     MASK: Gt(i),
     ZERO: j,
     ONE: q,
-    create: (a) => z(a, e),
+    create: (a) => V(a, e),
     isValid: (a) => {
       if (typeof a != "bigint")
         throw new Error(`Invalid field element: expected bigint, got ${typeof a}`);
@@ -571,20 +571,20 @@ function Pi(e, t, n = !1, r = {}) {
     },
     is0: (a) => a === j,
     isOdd: (a) => (a & q) === q,
-    neg: (a) => z(-a, e),
+    neg: (a) => V(-a, e),
     eql: (a, l) => a === l,
-    sqr: (a) => z(a * a, e),
-    add: (a, l) => z(a + l, e),
-    sub: (a, l) => z(a - l, e),
-    mul: (a, l) => z(a * l, e),
+    sqr: (a) => V(a * a, e),
+    add: (a, l) => V(a + l, e),
+    sub: (a, l) => V(a - l, e),
+    mul: (a, l) => V(a * l, e),
     pow: (a, l) => Ti(c, a, l),
-    div: (a, l) => z(a * Rt(l, e), e),
+    div: (a, l) => V(a * Tt(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) => Rt(a, e),
+    inv: (a) => Tt(a, e),
     sqrt: r.sqrt || ((a) => s(c, a)),
     invertBatch: (a) => Ri(c, a),
     // TODO: do we really need constant cmov?
@@ -594,30 +594,30 @@ function Pi(e, t, n = !1, r = {}) {
     fromBytes: (a) => {
       if (a.length !== o)
         throw new Error(`Fp.fromBytes: expected ${o}, got ${a.length}`);
-      return n ? Ft(a) : W(a);
+      return n ? Ft(a) : G(a);
     }
   });
   return Object.freeze(c);
 }
-function zn(e) {
+function Vn(e) {
   if (typeof e != "bigint")
     throw new Error("field order must be bigint");
   const t = e.toString(2).length;
   return Math.ceil(t / 8);
 }
 function Zn(e) {
-  const t = zn(e);
+  const t = Vn(e);
   return t + Math.ceil(t / 2);
 }
 function Oi(e, t, n = !1) {
-  const r = e.length, i = zn(t), o = Zn(t);
+  const r = e.length, i = Vn(t), o = Zn(t);
   if (r < 16 || r < o || r > 1024)
     throw new Error(`expected ${o}-1024 bytes of input, got ${r}`);
-  const s = n ? W(e) : Ft(e), c = z(s, t - q) + q;
+  const s = n ? G(e) : Ft(e), c = V(s, t - q) + q;
   return n ? Wt(c, i) : xe(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Mi = BigInt(0), Nt = BigInt(1);
+const Mi = BigInt(0), Bt = BigInt(1);
 function Hi(e, t) {
   const n = (i, o) => {
     const s = o.negate();
@@ -632,7 +632,7 @@ function Hi(e, t) {
     unsafeLadder(i, o) {
       let s = e.ZERO, c = i;
       for (; o > Mi; )
-        o & Nt && (s = s.add(c)), c = c.double(), o >>= Nt;
+        o & Bt && (s = s.add(c)), c = c.double(), o >>= Bt;
       return s;
     },
     /**
@@ -666,13 +666,13 @@ function Hi(e, t) {
     wNAF(i, o, s) {
       const { windows: c, windowSize: a } = r(i);
       let l = e.ZERO, f = e.BASE;
-      const u = BigInt(2 ** i - 1), d = 2 ** i, g = BigInt(i);
-      for (let w = 0; w < c; w++) {
-        const h = w * a;
+      const u = BigInt(2 ** i - 1), d = 2 ** i, p = BigInt(i);
+      for (let g = 0; g < c; g++) {
+        const h = g * a;
         let y = Number(s & u);
-        s >>= g, y > a && (y -= d, s += Nt);
-        const p = h, E = h + Math.abs(y) - 1, K = w % 2 !== 0, _ = y < 0;
-        y === 0 ? f = f.add(n(K, o[p])) : l = l.add(n(_, o[E]));
+        s >>= p, y > a && (y -= d, s += Bt);
+        const w = h, E = h + Math.abs(y) - 1, K = g % 2 !== 0, k = y < 0;
+        y === 0 ? f = f.add(n(K, o[w])) : l = l.add(n(k, o[E]));
       }
       return { p: l, f };
     },
@@ -693,7 +693,7 @@ function Fn(e) {
     nBitLength: "isSafeInteger",
     nByteLength: "isSafeInteger"
   }), Object.freeze({
-    ...Vn(e.n, e.nBitLength),
+    ...zn(e.n, e.nBitLength),
     ...e,
     p: e.Fp.ORDER
   });
@@ -763,70 +763,70 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
     }, r = t(n(e.s)), i = t(n(e.r)), o = r.length / 2, s = i.length / 2, c = n(o), a = n(s);
     return `30${n(s + o + 4)}02${a}${i}02${c}${r}`;
   }
-}, ce = BigInt(0), J = BigInt(1);
+}, ce = BigInt(0), Y = BigInt(1);
 BigInt(2);
 const Sn = BigInt(3);
 BigInt(4);
-function Vi(e) {
-  const t = qi(e), { Fp: n } = t, r = t.toBytes || ((w, h, y) => {
-    const p = h.toAffine();
-    return Ie(Uint8Array.from([4]), n.toBytes(p.x), n.toBytes(p.y));
-  }), i = t.fromBytes || ((w) => {
-    const h = w.subarray(1), y = n.fromBytes(h.subarray(0, n.BYTES)), p = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
-    return { x: y, y: p };
+function zi(e) {
+  const t = qi(e), { Fp: n } = t, r = t.toBytes || ((g, h, y) => {
+    const w = h.toAffine();
+    return Ie(Uint8Array.from([4]), n.toBytes(w.x), n.toBytes(w.y));
+  }), i = t.fromBytes || ((g) => {
+    const h = g.subarray(1), y = n.fromBytes(h.subarray(0, n.BYTES)), w = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
+    return { x: y, y: w };
   });
-  function o(w) {
-    const { a: h, b: y } = t, p = n.sqr(w), E = n.mul(p, w);
-    return n.add(n.add(E, n.mul(w, h)), y);
+  function o(g) {
+    const { a: h, b: y } = t, w = n.sqr(g), E = n.mul(w, g);
+    return n.add(n.add(E, n.mul(g, h)), y);
   }
   if (!n.eql(n.sqr(t.Gy), o(t.Gx)))
     throw new Error("bad generator point: equation left != right");
-  function s(w) {
-    return typeof w == "bigint" && ce < w && w < t.n;
+  function s(g) {
+    return typeof g == "bigint" && ce < g && g < t.n;
   }
-  function c(w) {
-    if (!s(w))
+  function c(g) {
+    if (!s(g))
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
-  function a(w) {
-    const { allowedPrivateKeyLengths: h, nByteLength: y, wrapPrivateKey: p, n: E } = t;
-    if (h && typeof w != "bigint") {
-      if (w instanceof Uint8Array && (w = He(w)), typeof w != "string" || !h.includes(w.length))
+  function a(g) {
+    const { allowedPrivateKeyLengths: h, nByteLength: y, wrapPrivateKey: w, n: E } = t;
+    if (h && typeof g != "bigint") {
+      if (g instanceof Uint8Array && (g = He(g)), typeof g != "string" || !h.includes(g.length))
         throw new Error("Invalid key");
-      w = w.padStart(y * 2, "0");
+      g = g.padStart(y * 2, "0");
     }
     let K;
     try {
-      K = typeof w == "bigint" ? w : W(Z("private key", w, y));
+      K = typeof g == "bigint" ? g : G(Z("private key", g, y));
     } catch {
-      throw new Error(`private key must be ${y} bytes, hex or bigint, not ${typeof w}`);
+      throw new Error(`private key must be ${y} bytes, hex or bigint, not ${typeof g}`);
     }
-    return p && (K = z(K, E)), c(K), K;
+    return w && (K = V(K, E)), c(K), K;
   }
   const l = /* @__PURE__ */ new Map();
-  function f(w) {
-    if (!(w instanceof u))
+  function f(g) {
+    if (!(g instanceof u))
       throw new Error("ProjectivePoint expected");
   }
   class u {
-    constructor(h, y, p) {
-      if (this.px = h, this.py = y, this.pz = p, h == null || !n.isValid(h))
+    constructor(h, y, w) {
+      if (this.px = h, this.py = y, this.pz = w, h == null || !n.isValid(h))
         throw new Error("x required");
       if (y == null || !n.isValid(y))
         throw new Error("y required");
-      if (p == null || !n.isValid(p))
+      if (w == null || !n.isValid(w))
         throw new Error("z required");
     }
     // Does not validate if the point is on-curve.
     // Use fromHex instead, or call assertValidity() later.
     static fromAffine(h) {
-      const { x: y, y: p } = h || {};
-      if (!h || !n.isValid(y) || !n.isValid(p))
+      const { x: y, y: w } = h || {};
+      if (!h || !n.isValid(y) || !n.isValid(w))
         throw new Error("invalid affine point");
       if (h instanceof u)
         throw new Error("projective point not allowed");
       const E = (K) => n.eql(K, n.ZERO);
-      return E(y) && E(p) ? u.ZERO : new u(y, p, n.ONE);
+      return E(y) && E(w) ? u.ZERO : new u(y, w, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -841,8 +841,8 @@ function Vi(e) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(h) {
-      const y = n.invertBatch(h.map((p) => p.pz));
-      return h.map((p, E) => p.toAffine(y[E])).map(u.fromAffine);
+      const y = n.invertBatch(h.map((w) => w.pz));
+      return h.map((w, E) => w.toAffine(y[E])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
@@ -870,8 +870,8 @@ function Vi(e) {
       const { x: h, y } = this.toAffine();
       if (!n.isValid(h) || !n.isValid(y))
         throw new Error("bad point: x or y not FE");
-      const p = n.sqr(y), E = o(h);
-      if (!n.eql(p, E))
+      const w = n.sqr(y), E = o(h);
+      if (!n.eql(w, E))
         throw new Error("bad point: equation left != right");
       if (!this.isTorsionFree())
         throw new Error("bad point: not in prime-order subgroup");
@@ -887,7 +887,7 @@ function Vi(e) {
      */
     equals(h) {
       f(h);
-      const { px: y, py: p, pz: E } = this, { px: K, py: _, pz: C } = h, m = n.eql(n.mul(y, C), n.mul(K, E)), x = n.eql(n.mul(p, C), n.mul(_, E));
+      const { px: y, py: w, pz: E } = this, { px: K, py: k, pz: C } = h, m = n.eql(n.mul(y, C), n.mul(K, E)), x = n.eql(n.mul(w, C), n.mul(k, E));
       return m && x;
     }
     /**
@@ -901,9 +901,9 @@ function Vi(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: h, b: y } = t, p = n.mul(y, Sn), { px: E, py: K, pz: _ } = this;
-      let C = n.ZERO, m = n.ZERO, x = n.ZERO, A = n.mul(E, E), O = n.mul(K, K), U = n.mul(_, _), B = n.mul(E, K);
-      return B = n.add(B, B), x = n.mul(E, _), x = n.add(x, x), C = n.mul(h, x), m = n.mul(p, U), m = n.add(C, m), C = n.sub(O, m), m = n.add(O, m), m = n.mul(C, m), C = n.mul(B, C), x = n.mul(p, x), U = n.mul(h, U), B = n.sub(A, U), B = n.mul(h, B), B = n.add(B, x), x = n.add(A, A), A = n.add(x, A), A = n.add(A, U), A = n.mul(A, B), m = n.add(m, A), U = n.mul(K, _), U = n.add(U, U), A = n.mul(U, B), C = n.sub(C, A), x = n.mul(U, O), x = n.add(x, x), x = n.add(x, x), new u(C, m, x);
+      const { a: h, b: y } = t, w = n.mul(y, Sn), { px: E, py: K, pz: k } = this;
+      let C = n.ZERO, m = n.ZERO, x = n.ZERO, A = n.mul(E, E), O = n.mul(K, K), U = n.mul(k, k), B = n.mul(E, K);
+      return B = n.add(B, B), x = n.mul(E, k), x = n.add(x, x), C = n.mul(h, x), m = n.mul(w, U), m = n.add(C, m), C = n.sub(O, m), m = n.add(O, m), m = n.mul(C, m), C = n.mul(B, C), x = n.mul(w, x), U = n.mul(h, U), B = n.sub(A, U), B = n.mul(h, B), B = n.add(B, x), x = n.add(A, A), A = n.add(x, A), A = n.add(A, U), A = n.mul(A, B), m = n.add(m, A), U = n.mul(K, k), U = n.add(U, U), A = n.mul(U, B), C = n.sub(C, A), x = n.mul(U, O), x = n.add(x, x), x = n.add(x, x), new u(C, m, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function Vi(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: y, py: p, pz: E } = this, { px: K, py: _, pz: C } = h;
+      const { px: y, py: w, pz: E } = this, { px: K, py: k, pz: C } = h;
       let m = n.ZERO, x = n.ZERO, A = n.ZERO;
       const O = t.a, U = n.mul(t.b, Sn);
-      let B = n.mul(y, K), T = n.mul(p, _), R = n.mul(E, C), H = n.add(y, p), b = n.add(K, _);
+      let B = n.mul(y, K), T = n.mul(w, k), R = n.mul(E, C), H = n.add(y, w), b = n.add(K, k);
       H = n.mul(H, b), b = n.add(B, T), H = n.sub(H, b), b = n.add(y, E);
       let v = n.add(K, C);
-      return b = n.mul(b, v), v = n.add(B, R), b = n.sub(b, v), v = n.add(p, E), m = n.add(_, C), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), A = n.mul(O, b), m = n.mul(U, R), A = n.add(m, A), m = n.sub(T, A), A = n.add(T, A), x = n.mul(m, A), T = n.add(B, B), T = n.add(T, B), R = n.mul(O, R), b = n.mul(U, b), T = n.add(T, R), R = n.sub(B, R), R = n.mul(O, R), b = n.add(b, R), B = n.mul(T, b), x = n.add(x, B), B = n.mul(v, b), m = n.mul(H, m), m = n.sub(m, B), B = n.mul(H, T), A = n.mul(v, A), A = n.add(A, B), new u(m, x, A);
+      return b = n.mul(b, v), v = n.add(B, R), b = n.sub(b, v), v = n.add(w, E), m = n.add(k, C), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), A = n.mul(O, b), m = n.mul(U, R), A = n.add(m, A), m = n.sub(T, A), A = n.add(T, A), x = n.mul(m, A), T = n.add(B, B), T = n.add(T, B), R = n.mul(O, R), b = n.mul(U, b), T = n.add(T, R), R = n.sub(B, R), R = n.mul(O, R), b = n.add(b, R), B = n.mul(T, b), x = n.add(x, B), B = n.mul(v, b), m = n.mul(H, m), m = n.sub(m, B), B = n.mul(H, T), A = n.mul(v, A), A = n.add(A, B), new u(m, x, A);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -926,9 +926,9 @@ function Vi(e) {
       return this.equals(u.ZERO);
     }
     wNAF(h) {
-      return g.wNAFCached(this, l, h, (y) => {
-        const p = n.invertBatch(y.map((E) => E.pz));
-        return y.map((E, K) => E.toAffine(p[K])).map(u.fromAffine);
+      return p.wNAFCached(this, l, h, (y) => {
+        const w = n.invertBatch(y.map((E) => E.pz));
+        return y.map((E, K) => E.toAffine(w[K])).map(u.fromAffine);
       });
     }
     /**
@@ -940,15 +940,15 @@ function Vi(e) {
       const y = u.ZERO;
       if (h === ce)
         return y;
-      if (c(h), h === J)
+      if (c(h), h === Y)
         return this;
-      const { endo: p } = t;
-      if (!p)
-        return g.unsafeLadder(this, h);
-      let { k1neg: E, k1: K, k2neg: _, k2: C } = p.splitScalar(h), m = y, x = y, A = this;
+      const { endo: w } = t;
+      if (!w)
+        return p.unsafeLadder(this, h);
+      let { k1neg: E, k1: K, k2neg: k, k2: C } = w.splitScalar(h), m = y, x = y, A = this;
       for (; K > ce || C > ce; )
-        K & J && (m = m.add(A)), C & J && (x = x.add(A)), A = A.double(), K >>= J, C >>= J;
-      return E && (m = m.negate()), _ && (x = x.negate()), x = new u(n.mul(x.px, p.beta), x.py, x.pz), m.add(x);
+        K & Y && (m = m.add(A)), C & Y && (x = x.add(A)), A = A.double(), K >>= Y, C >>= Y;
+      return E && (m = m.negate()), k && (x = x.negate()), x = new u(n.mul(x.px, w.beta), x.py, x.pz), m.add(x);
     }
     /**
      * Constant time multiplication.
@@ -961,17 +961,17 @@ function Vi(e) {
      */
     multiply(h) {
       c(h);
-      let y = h, p, E;
+      let y = h, w, E;
       const { endo: K } = t;
       if (K) {
-        const { k1neg: _, k1: C, k2neg: m, k2: x } = K.splitScalar(y);
+        const { k1neg: k, k1: C, k2neg: m, k2: x } = K.splitScalar(y);
         let { p: A, f: O } = this.wNAF(C), { p: U, f: B } = this.wNAF(x);
-        A = g.constTimeNegate(_, A), U = g.constTimeNegate(m, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), p = A.add(U), E = O.add(B);
+        A = p.constTimeNegate(k, A), U = p.constTimeNegate(m, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), w = A.add(U), E = O.add(B);
       } else {
-        const { p: _, f: C } = this.wNAF(y);
-        p = _, E = C;
+        const { p: k, f: C } = this.wNAF(y);
+        w = k, E = C;
       }
-      return u.normalizeZ([p, E])[0];
+      return u.normalizeZ([w, E])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -979,26 +979,26 @@ function Vi(e) {
      * The trick could be useful if both P and Q are not G (not in our case).
      * @returns non-zero affine point
      */
-    multiplyAndAddUnsafe(h, y, p) {
-      const E = u.BASE, K = (C, m) => m === ce || m === J || !C.equals(E) ? C.multiplyUnsafe(m) : C.multiply(m), _ = K(this, y).add(K(h, p));
-      return _.is0() ? void 0 : _;
+    multiplyAndAddUnsafe(h, y, w) {
+      const E = u.BASE, K = (C, m) => m === ce || m === Y || !C.equals(E) ? C.multiplyUnsafe(m) : C.multiply(m), k = K(this, y).add(K(h, w));
+      return k.is0() ? void 0 : k;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
     // (x, y, z) ∋ (x=x/z, y=y/z)
     toAffine(h) {
-      const { px: y, py: p, pz: E } = this, K = this.is0();
+      const { px: y, py: w, pz: E } = this, K = this.is0();
       h == null && (h = K ? n.ONE : n.inv(E));
-      const _ = n.mul(y, h), C = n.mul(p, h), m = n.mul(E, h);
+      const k = n.mul(y, h), C = n.mul(w, h), m = n.mul(E, h);
       if (K)
         return { x: n.ZERO, y: n.ZERO };
       if (!n.eql(m, n.ONE))
         throw new Error("invZ was invalid");
-      return { x: _, y: C };
+      return { x: k, y: C };
     }
     isTorsionFree() {
       const { h, isTorsionFree: y } = t;
-      if (h === J)
+      if (h === Y)
         return !0;
       if (y)
         return y(u, this);
@@ -1006,7 +1006,7 @@ function Vi(e) {
     }
     clearCofactor() {
       const { h, clearCofactor: y } = t;
-      return h === J ? this : y ? y(u, this) : this.multiplyUnsafe(t.h);
+      return h === Y ? this : y ? y(u, this) : this.multiplyUnsafe(t.h);
     }
     toRawBytes(h = !0) {
       return this.assertValidity(), r(u, this, h);
@@ -1016,7 +1016,7 @@ function Vi(e) {
     }
   }
   u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
-  const d = t.nBitLength, g = Hi(u, t.endo ? Math.ceil(d / 2) : d);
+  const d = t.nBitLength, p = Hi(u, t.endo ? Math.ceil(d / 2) : d);
   return {
     CURVE: t,
     ProjectivePoint: u,
@@ -1025,7 +1025,7 @@ function Vi(e) {
     isWithinCurveOrder: s
   };
 }
-function zi(e) {
+function Vi(e) {
   const t = Fn(e);
   return Je(t, {
     hash: "hash",
@@ -1038,61 +1038,61 @@ function zi(e) {
   }), Object.freeze({ lowS: !0, ...t });
 }
 function Zi(e) {
-  const t = zi(e), { Fp: n, n: r } = t, i = n.BYTES + 1, o = 2 * n.BYTES + 1;
+  const t = Vi(e), { Fp: n, n: r } = t, i = n.BYTES + 1, o = 2 * n.BYTES + 1;
   function s(b) {
     return ce < b && b < n.ORDER;
   }
   function c(b) {
-    return z(b, r);
+    return V(b, r);
   }
   function a(b) {
-    return Rt(b, r);
+    return Tt(b, r);
   }
-  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: d } = Vi({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: d } = zi({
     ...t,
     toBytes(b, v, S) {
-      const I = v.toAffine(), N = n.toBytes(I.x), k = Ie;
-      return S ? k(Uint8Array.from([v.hasEvenY() ? 2 : 3]), N) : k(Uint8Array.from([4]), N, n.toBytes(I.y));
+      const I = v.toAffine(), N = n.toBytes(I.x), _ = Ie;
+      return S ? _(Uint8Array.from([v.hasEvenY() ? 2 : 3]), N) : _(Uint8Array.from([4]), N, n.toBytes(I.y));
     },
     fromBytes(b) {
       const v = b.length, S = b[0], I = b.subarray(1);
       if (v === i && (S === 2 || S === 3)) {
-        const N = W(I);
+        const N = G(I);
         if (!s(N))
           throw new Error("Point is not on curve");
-        const k = u(N);
-        let P = n.sqrt(k);
-        const $ = (P & J) === J;
+        const _ = u(N);
+        let P = n.sqrt(_);
+        const $ = (P & Y) === Y;
         return (S & 1) === 1 !== $ && (P = n.neg(P)), { x: N, y: P };
       } else if (v === o && S === 4) {
-        const N = n.fromBytes(I.subarray(0, n.BYTES)), k = n.fromBytes(I.subarray(n.BYTES, 2 * n.BYTES));
-        return { x: N, y: k };
+        const N = n.fromBytes(I.subarray(0, n.BYTES)), _ = n.fromBytes(I.subarray(n.BYTES, 2 * n.BYTES));
+        return { x: N, y: _ };
       } else
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${o} uncompressed bytes`);
     }
-  }), g = (b) => He(xe(b, t.nByteLength));
-  function w(b) {
-    const v = r >> J;
+  }), p = (b) => He(xe(b, t.nByteLength));
+  function g(b) {
+    const v = r >> Y;
     return b > v;
   }
   function h(b) {
-    return w(b) ? c(-b) : b;
+    return g(b) ? c(-b) : b;
   }
-  const y = (b, v, S) => W(b.slice(v, S));
-  class p {
+  const y = (b, v, S) => G(b.slice(v, S));
+  class w {
     constructor(v, S, I) {
       this.r = v, this.s = S, this.recovery = I, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
       const S = t.nByteLength;
-      return v = Z("compactSignature", v, S * 2), new p(y(v, 0, S), y(v, S, 2 * S));
+      return v = Z("compactSignature", v, S * 2), new w(y(v, 0, S), y(v, S, 2 * S));
     }
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
     static fromDER(v) {
       const { r: S, s: I } = Ne.toSig(Z("DER", v));
-      return new p(S, I);
+      return new w(S, I);
     }
     assertValidity() {
       if (!d(this.r))
@@ -1101,26 +1101,26 @@ function Zi(e) {
         throw new Error("s must be 0 < s < CURVE.n");
     }
     addRecoveryBit(v) {
-      return new p(this.r, this.s, v);
+      return new w(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: S, s: I, recovery: N } = this, k = x(Z("msgHash", v));
+      const { r: S, s: I, recovery: N } = this, _ = x(Z("msgHash", v));
       if (N == null || ![0, 1, 2, 3].includes(N))
         throw new Error("recovery id invalid");
       const P = N === 2 || N === 3 ? S + t.n : S;
       if (P >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const $ = N & 1 ? "03" : "02", X = l.fromHex($ + g(P)), ye = a(P), _e = c(-k * ye), Ve = c(I * ye), ge = l.BASE.multiplyAndAddUnsafe(X, _e, Ve);
-      if (!ge)
+      const $ = N & 1 ? "03" : "02", X = l.fromHex($ + p(P)), ye = a(P), ke = c(-_ * ye), ze = c(I * ye), pe = l.BASE.multiplyAndAddUnsafe(X, ke, ze);
+      if (!pe)
         throw new Error("point at infinify");
-      return ge.assertValidity(), ge;
+      return pe.assertValidity(), pe;
     }
     // Signatures should be low-s, to prevent malleability.
     hasHighS() {
-      return w(this.s);
+      return g(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new p(this.r, c(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new w(this.r, c(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
@@ -1134,7 +1134,7 @@ function Zi(e) {
       return qe(this.toCompactHex());
     }
     toCompactHex() {
-      return g(this.r) + g(this.s);
+      return p(this.r) + p(this.s);
     }
   }
   const E = {
@@ -1169,19 +1169,19 @@ function Zi(e) {
   function K(b, v = !0) {
     return l.fromPrivateKey(b).toRawBytes(v);
   }
-  function _(b) {
+  function k(b) {
     const v = b instanceof Uint8Array, S = typeof b == "string", I = (v || S) && b.length;
     return v ? I === i || I === o : S ? I === 2 * i || I === 2 * o : b instanceof l;
   }
   function C(b, v, S = !0) {
-    if (_(b))
+    if (k(b))
       throw new Error("first arg must be private key");
-    if (!_(v))
+    if (!k(v))
       throw new Error("second arg must be public key");
     return l.fromHex(v).multiply(f(b)).toRawBytes(S);
   }
   const m = t.bits2int || function(b) {
-    const v = W(b), S = b.length * 8 - t.nBitLength;
+    const v = G(b), S = b.length * 8 - t.nBitLength;
     return S > 0 ? v >> BigInt(S) : v;
   }, x = t.bits2int_modN || function(b) {
     return c(m(b));
@@ -1197,33 +1197,33 @@ function Zi(e) {
     if (["recovered", "canonical"].some((Ke) => Ke in S))
       throw new Error("sign() legacy options not supported");
     const { hash: I, randomBytes: N } = t;
-    let { lowS: k, prehash: P, extraEntropy: $ } = S;
-    k == null && (k = !0), b = Z("msgHash", b), P && (b = Z("prehashed msgHash", I(b)));
-    const X = x(b), ye = f(v), _e = [O(ye), O(X)];
+    let { lowS: _, prehash: P, extraEntropy: $ } = S;
+    _ == null && (_ = !0), b = Z("msgHash", b), P && (b = Z("prehashed msgHash", I(b)));
+    const X = x(b), ye = f(v), ke = [O(ye), O(X)];
     if ($ != null) {
       const Ke = $ === !0 ? N(n.BYTES) : $;
-      _e.push(Z("extraEntropy", Ke));
+      ke.push(Z("extraEntropy", Ke));
     }
-    const Ve = Ie(..._e), ge = X;
-    function At(Ke) {
-      const ke = m(Ke);
-      if (!d(ke))
+    const ze = Ie(...ke), pe = X;
+    function xt(Ke) {
+      const _e = m(Ke);
+      if (!d(_e))
         return;
-      const wn = a(ke), Le = l.BASE.multiply(ke).toAffine(), Q = c(Le.x);
+      const wn = a(_e), Le = l.BASE.multiply(_e).toAffine(), Q = c(Le.x);
       if (Q === ce)
         return;
-      const $e = c(wn * c(ge + Q * ye));
+      const $e = c(wn * c(pe + Q * ye));
       if ($e === ce)
         return;
-      let bn = (Le.x === Q ? 0 : 2) | Number(Le.y & J), vn = $e;
-      return k && w($e) && (vn = h($e), bn ^= 1), new p(Q, vn, bn);
+      let bn = (Le.x === Q ? 0 : 2) | Number(Le.y & Y), vn = $e;
+      return _ && g($e) && (vn = h($e), bn ^= 1), new w(Q, vn, bn);
     }
-    return { seed: Ve, k2sig: At };
+    return { seed: ze, k2sig: xt };
   }
   const B = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
   function R(b, v, S = B) {
-    const { seed: I, k2sig: N } = U(b, v, S), k = t;
-    return jn(k.hash.outputLen, k.nByteLength, k.hmac)(I, N);
+    const { seed: I, k2sig: N } = U(b, v, S), _ = t;
+    return jn(_.hash.outputLen, _.nByteLength, _.hmac)(I, N);
   }
   l.BASE._setWindowSize(8);
   function H(b, v, S, I = T) {
@@ -1231,20 +1231,20 @@ function Zi(e) {
     const N = b;
     if (v = Z("msgHash", v), S = Z("publicKey", S), "strict" in I)
       throw new Error("options.strict was renamed to lowS");
-    const { lowS: k, prehash: P } = I;
+    const { lowS: _, prehash: P } = I;
     let $, X;
     try {
       if (typeof N == "string" || N instanceof Uint8Array)
         try {
-          $ = p.fromDER(N);
+          $ = w.fromDER(N);
         } catch (Q) {
           if (!(Q instanceof Ne.Err))
             throw Q;
-          $ = p.fromCompact(N);
+          $ = w.fromCompact(N);
         }
       else if (typeof N == "object" && typeof N.r == "bigint" && typeof N.s == "bigint") {
         const { r: Q, s: $e } = N;
-        $ = new p(Q, $e);
+        $ = new w(Q, $e);
       } else
         throw new Error("PARSE");
       X = l.fromHex(S);
@@ -1253,11 +1253,11 @@ function Zi(e) {
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
       return !1;
     }
-    if (k && $.hasHighS())
+    if (_ && $.hasHighS())
       return !1;
     P && (v = t.hash(v));
-    const { r: ye, s: _e } = $, Ve = x(v), ge = a(_e), At = c(Ve * ge), Ke = c(ye * ge), ke = (Le = l.BASE.multiplyAndAddUnsafe(X, At, Ke)) == null ? void 0 : Le.toAffine();
-    return ke ? c(ke.x) === ye : !1;
+    const { r: ye, s: ke } = $, ze = x(v), pe = a(ke), xt = c(ze * pe), Ke = c(ye * pe), _e = (Le = l.BASE.multiplyAndAddUnsafe(X, xt, Ke)) == null ? void 0 : Le.toAffine();
+    return _e ? c(_e.x) === ye : !1;
   }
   return {
     CURVE: t,
@@ -1266,14 +1266,14 @@ function Zi(e) {
     sign: R,
     verify: H,
     ProjectivePoint: l,
-    Signature: p,
+    Signature: w,
     utils: E
   };
 }
 let Wn = class extends Mn {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, ai(t);
-    const r = zt(n);
+    const r = Vt(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;
@@ -1320,17 +1320,17 @@ function Wi(e, t) {
   return Object.freeze({ ...n(t), create: n });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const ht = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), it = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), ot = BigInt(2), Kn = (e, t) => (e + t / ot) / t;
+const ft = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), it = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), ot = BigInt(2), Kn = (e, t) => (e + t / ot) / t;
 function Yn(e) {
-  const t = ht, n = BigInt(3), r = BigInt(6), i = BigInt(11), o = BigInt(22), s = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = G(f, n, t) * f % t, d = G(u, n, t) * f % t, g = G(d, ot, t) * l % t, w = G(g, i, t) * g % t, h = G(w, o, t) * w % t, y = G(h, c, t) * h % t, p = G(y, a, t) * y % t, E = G(p, c, t) * h % t, K = G(E, n, t) * f % t, _ = G(K, s, t) * w % t, C = G(_, r, t) * l % t, m = G(C, ot, t);
-  if (!Pt.eql(Pt.sqr(m), e))
+  const t = ft, n = BigInt(3), r = BigInt(6), i = BigInt(11), o = BigInt(22), s = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, d = J(u, n, t) * f % t, p = J(d, ot, t) * l % t, g = J(p, i, t) * p % t, h = J(g, o, t) * g % t, y = J(h, c, t) * h % t, w = J(y, a, t) * y % t, E = J(w, c, t) * h % t, K = J(E, n, t) * f % t, k = J(K, s, t) * g % t, C = J(k, r, t) * l % t, m = J(C, ot, t);
+  if (!Rt.eql(Rt.sqr(m), e))
     throw new Error("Cannot find square root");
   return m;
 }
-const Pt = Pi(ht, void 0, void 0, { sqrt: Yn }), Ue = Wi({
+const Rt = Pi(ft, void 0, void 0, { sqrt: Yn }), Ue = Wi({
   a: BigInt(0),
   b: BigInt(7),
-  Fp: Pt,
+  Fp: Rt,
   n: it,
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
@@ -1347,67 +1347,67 @@ const Pt = Pi(ht, void 0, void 0, { sqrt: Yn }), Ue = Wi({
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
       const t = it, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Jn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), o = n, s = BigInt("0x100000000000000000000000000000000"), c = Kn(o * e, t), a = Kn(-r * e, t);
-      let l = z(e - c * n - a * i, t), f = z(-c * r - a * o, t);
+      let l = V(e - c * n - a * i, t), f = V(-c * r - a * o, t);
       const u = l > s, d = f > s;
       if (u && (l = t - l), d && (f = t - f), l > s || f > s)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
       return { k1neg: u, k1: l, k2neg: d, k2: f };
     }
   }
-}, $t), dt = BigInt(0), Xn = (e) => typeof e == "bigint" && dt < e && e < ht, Gi = (e) => typeof e == "bigint" && dt < e && e < it, Bn = {};
+}, Lt), ht = BigInt(0), Xn = (e) => typeof e == "bigint" && ht < e && e < ft, Gi = (e) => typeof e == "bigint" && ht < e && e < it, Bn = {};
 function st(e, ...t) {
   let n = Bn[e];
   if (n === void 0) {
-    const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    const r = Lt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
     n = Ie(r, r), Bn[e] = n;
   }
-  return $t(Ie(n, ...t));
+  return Lt(Ie(n, ...t));
 }
-const Jt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => xe(e, 32), Ct = (e) => z(e, ht), We = (e) => z(e, it), Yt = Ue.ProjectivePoint, Ji = (e, t, n) => Yt.BASE.multiplyAndAddUnsafe(e, t, n);
-function Mt(e) {
+const Jt = (e) => e.toRawBytes(!0).slice(1), Pt = (e) => xe(e, 32), Nt = (e) => V(e, ft), We = (e) => V(e, it), Yt = Ue.ProjectivePoint, Ji = (e, t, n) => Yt.BASE.multiplyAndAddUnsafe(e, t, n);
+function Ot(e) {
   let t = Ue.utils.normPrivateKeyToScalar(e), n = Yt.fromPrivateKey(t);
   return { scalar: n.hasEvenY() ? t : We(-t), bytes: Jt(n) };
 }
 function Qn(e) {
   if (!Xn(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = Ct(e * e), n = Ct(t * e + BigInt(7));
+  const t = Nt(e * e), n = Nt(t * e + BigInt(7));
   let r = Yn(n);
-  r % ot !== dt && (r = Ct(-r));
+  r % ot !== ht && (r = Nt(-r));
   const i = new Yt(e, r, Jn);
   return i.assertValidity(), i;
 }
 function er(...e) {
-  return We(W(st("BIP0340/challenge", ...e)));
+  return We(G(st("BIP0340/challenge", ...e)));
 }
 function Yi(e) {
-  return Mt(e).bytes;
+  return Ot(e).bytes;
 }
 function Xi(e, t, n = Hn(32)) {
-  const r = Z("message", e), { bytes: i, scalar: o } = Mt(t), s = Z("auxRand", n, 32), c = Ot(o ^ W(st("BIP0340/aux", s))), a = st("BIP0340/nonce", c, i, r), l = We(W(a));
-  if (l === dt)
+  const r = Z("message", e), { bytes: i, scalar: o } = Ot(t), s = Z("auxRand", n, 32), c = Pt(o ^ G(st("BIP0340/aux", s))), a = st("BIP0340/nonce", c, i, r), l = We(G(a));
+  if (l === ht)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Mt(l), d = er(f, i, r), g = new Uint8Array(64);
-  if (g.set(f, 0), g.set(Ot(We(u + d * o)), 32), !tr(g, r, i))
+  const { bytes: f, scalar: u } = Ot(l), d = er(f, i, r), p = new Uint8Array(64);
+  if (p.set(f, 0), p.set(Pt(We(u + d * o)), 32), !tr(p, r, i))
     throw new Error("sign: Invalid signature produced");
-  return g;
+  return p;
 }
 function tr(e, t, n) {
   const r = Z("signature", e, 64), i = Z("message", t), o = Z("publicKey", n, 32);
   try {
-    const s = Qn(W(o)), c = W(r.subarray(0, 32));
+    const s = Qn(G(o)), c = G(r.subarray(0, 32));
     if (!Xn(c))
       return !1;
-    const a = W(r.subarray(32, 64));
+    const a = G(r.subarray(32, 64));
     if (!Gi(a))
       return !1;
-    const l = er(Ot(c), Jt(s), i), f = Ji(s, a, We(-l));
+    const l = er(Pt(c), Jt(s), i), f = Ji(s, a, We(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
   } catch {
     return !1;
   }
 }
-const ze = {
+const Ve = {
   getPublicKey: Yi,
   sign: Xi,
   verify: tr,
@@ -1416,13 +1416,13 @@ const ze = {
     lift_x: Qn,
     pointToBytes: Jt,
     numberToBytesBE: xe,
-    bytesToNumberBE: W,
+    bytesToNumberBE: G,
     taggedHash: st,
-    mod: z
+    mod: V
   }
-}, It = 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 Xt = (e) => e instanceof Uint8Array, Ut = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Qi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Xt = (e) => e instanceof Uint8Array, It = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Qi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!Qi)
   throw new Error("Non little-endian hardware is not supported");
 const eo = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
@@ -1434,7 +1434,7 @@ function M(e) {
     t += eo[e[n]];
   return t;
 }
-function Y(e) {
+function W(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   const t = e.length;
@@ -1459,7 +1459,7 @@ function Ge(e) {
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function yt(...e) {
+function dt(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -1479,11 +1479,11 @@ function rr(e) {
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function ir(e = 32) {
-  if (It && typeof It.getRandomValues == "function")
-    return It.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 Mt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -1500,7 +1500,7 @@ function or(e, ...t) {
 function ro(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);
+  Mt(e.outputLen), Mt(e.blockLen);
 }
 function io(e, t = !0) {
   if (e.destroyed)
@@ -1515,7 +1515,7 @@ function oo(e, t) {
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const oe = {
-  number: Ht,
+  number: Mt,
   bool: no,
   bytes: or,
   hash: ro,
@@ -1530,7 +1530,7 @@ function so(e, t, n, r) {
 }
 class ao extends nr {
   constructor(t, n, r, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Ut(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 = It(this.buffer);
   }
   update(t) {
     oe.exists(this);
@@ -1540,7 +1540,7 @@ class ao extends nr {
     for (let s = 0; s < o; ) {
       const c = Math.min(i - this.pos, o - s);
       if (c === i) {
-        const a = Ut(t);
+        const a = It(t);
         for (; i <= o - s; s += i)
           this.process(a, s);
         continue;
@@ -1557,7 +1557,7 @@ class ao extends nr {
     for (let u = s; u < i; u++)
       n[u] = 0;
     so(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const c = Ut(t), a = this.outputLen;
+    const c = It(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,13 +1669,13 @@ class sr extends ao {
     for (let u = 0; u < 16; u++, n += 4)
       ve[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const d = ve[u - 15], g = ve[u - 2], w = re(d, 7) ^ re(d, 18) ^ d >>> 3, h = re(g, 17) ^ re(g, 19) ^ g >>> 10;
-      ve[u] = h + ve[u - 7] + w + ve[u - 16] | 0;
+      const d = ve[u - 15], p = ve[u - 2], g = re(d, 7) ^ re(d, 18) ^ d >>> 3, h = re(p, 17) ^ re(p, 19) ^ p >>> 10;
+      ve[u] = h + ve[u - 7] + g + ve[u - 16] | 0;
     }
     let { A: r, B: i, C: o, D: s, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const d = re(c, 6) ^ re(c, 11) ^ re(c, 25), g = f + d + co(c, a, l) + uo[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + lo(r, i, o) | 0;
-      f = l, l = a, a = c, c = s + g | 0, s = o, o = i, i = r, r = g + h | 0;
+      const d = re(c, 6) ^ re(c, 11) ^ re(c, 25), p = f + d + co(c, a, l) + uo[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + lo(r, i, o) | 0;
+      f = l, l = a, a = c, c = s + p | 0, s = o, o = i, i = r, r = p + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, o = o + this.C | 0, s = s + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, c, a, l, f);
   }
@@ -1746,7 +1746,7 @@ function de(e = "") {
     }
   };
 }
-function gt(e, t = "=") {
+function yt(e, t = "=") {
   if (je(e), typeof t != "string")
     throw new Error("padding chr should be string");
   return {
@@ -1815,7 +1815,7 @@ function Nn(e, t, n) {
   return i.reverse();
 }
 const cr = (e, t) => t ? cr(t, e % t) : e, at = (e, t) => e + (t - cr(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)
@@ -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,10 +1883,10 @@ function Cn(e) {
     }
   };
 }
-const yo = fe(Se(4), he("0123456789ABCDEF"), de("")), go = fe(Se(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), gt(5), de(""));
-fe(Se(5), he("0123456789ABCDEFGHIJKLMNOPQRSTUV"), gt(5), de(""));
+const yo = fe(Se(4), he("0123456789ABCDEF"), de("")), po = fe(Se(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), yt(5), de(""));
+fe(Se(5), he("0123456789ABCDEFGHIJKLMNOPQRSTUV"), yt(5), de(""));
 fe(Se(5), he("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), de(""), ar((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const ue = fe(Se(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), gt(6), de("")), po = fe(Se(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), gt(6), de("")), Qt = (e) => fe(ho(58), he(e), de("")), ct = Qt("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+const ue = fe(Se(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), yt(6), de("")), go = fe(Se(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), yt(6), de("")), Qt = (e) => fe(ho(58), he(e), de("")), qt = Qt("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
 Qt("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
 Qt("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
 const In = [0, 2, 3, 5, 6, 7, 9, 10, 11], wo = {
@@ -1894,14 +1894,14 @@ const In = [0, 2, 3, 5, 6, 7, 9, 10, 11], wo = {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
       const r = e.subarray(n, n + 8);
-      t += ct.encode(r).padStart(In[r.length], "1");
+      t += qt.encode(r).padStart(In[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 = In.indexOf(r.length), o = ct.decode(r);
+      const r = e.slice(n, n + 11), i = In.indexOf(r.length), o = qt.decode(r);
       for (let s = 0; s < o.length - i; s++)
         if (o[s] !== 0)
           throw new Error("base58xmr: wrong padding");
@@ -1917,7 +1917,7 @@ function Ze(e) {
     (t >> r & 1) === 1 && (n ^= Un[r]);
   return n;
 }
-function _n(e, t, n = 1) {
+function kn(e, t, n = 1) {
   const r = e.length;
   let i = 1;
   for (let o = 0; o < r; o++) {
@@ -1933,7 +1933,7 @@ function _n(e, t, n = 1) {
     i = Ze(i) ^ o;
   for (let o = 0; o < 6; o++)
     i = Ze(i);
-  return i ^= n, Dt.encode(qt([i % 2 ** 30], 30, 5, !1));
+  return i ^= n, Dt.encode(Ht([i % 2 ** 30], 30, 5, !1));
 }
 function lr(e) {
   const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, o = Cn(r);
@@ -1942,10 +1942,10 @@ function lr(e) {
       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 g = f.length + 7 + u.length;
-    if (d !== !1 && g > d)
-      throw new TypeError(`Length ${g} exceeds limit ${d}`);
-    return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${_n(f, u, t)}`;
+    const p = f.length + 7 + u.length;
+    if (d !== !1 && p > d)
+      throw new TypeError(`Length ${p} exceeds limit ${d}`);
+    return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${kn(f, u, t)}`;
   }
   function c(f, u = 90) {
     if (typeof f != "string")
@@ -1956,16 +1956,16 @@ function lr(e) {
     if (f !== d && f !== f.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
     f = d;
-    const g = f.lastIndexOf("1");
-    if (g === 0 || g === -1)
+    const p = f.lastIndexOf("1");
+    if (p === 0 || p === -1)
       throw new Error('Letter "1" must be present between prefix and data only');
-    const w = f.slice(0, g), h = f.slice(g + 1);
+    const g = f.slice(0, p), h = f.slice(p + 1);
     if (h.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const y = Dt.decode(h).slice(0, -6), p = _n(w, y, t);
-    if (!h.endsWith(p))
-      throw new Error(`Invalid checksum in ${f}: expected "${p}"`);
-    return { prefix: w, words: y };
+    const y = Dt.decode(h).slice(0, -6), w = kn(g, y, t);
+    if (!h.endsWith(w))
+      throw new Error(`Invalid checksum in ${f}: expected "${w}"`);
+    return { prefix: g, words: y };
   }
   const a = Cn(c);
   function l(f) {
@@ -1987,18 +1987,18 @@ const bo = {
   utf8: bo,
   hex: vo,
   base16: yo,
-  base32: go,
+  base32: po,
   base64: ue,
-  base64url: po,
-  base58: ct,
+  base64url: go,
+  base58: qt,
   base58xmr: wo
 };
 `${Object.keys(mo).join(", ")}`;
-function _t(e) {
+function Ut(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
-function kn(e) {
+function _n(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
@@ -2103,24 +2103,24 @@ function Ln(e, t, n, r, i) {
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
-  for (let w = 0; w < l; w++) {
-    const h = e[a++] ^ me(s, c, t, n, r, i), y = e[a++] ^ me(s, c, n, r, i, t), p = e[a++] ^ me(s, c, r, i, t, n), E = e[a++] ^ me(s, c, i, t, n, r);
-    t = h, n = y, r = p, i = E;
+  for (let g = 0; g < l; g++) {
+    const h = e[a++] ^ me(s, c, t, n, r, i), y = e[a++] ^ me(s, c, n, r, i, t), w = e[a++] ^ me(s, c, r, i, t, n), E = e[a++] ^ me(s, c, i, t, n, r);
+    t = h, n = y, r = w, i = E;
   }
-  const f = e[a++] ^ se(o, t, n, r, i), u = e[a++] ^ se(o, n, r, i, t), d = e[a++] ^ se(o, r, i, t, n), g = e[a++] ^ se(o, i, t, n, r);
-  return { s0: f, s1: u, s2: d, s3: g };
+  const f = e[a++] ^ se(o, t, n, r, i), u = e[a++] ^ se(o, n, r, i, t), d = e[a++] ^ se(o, r, i, t, n), p = e[a++] ^ se(o, i, t, n, r);
+  return { s0: f, s1: u, s2: d, s3: p };
 }
-function _o(e, t, n, r, i) {
+function ko(e, t, n, r, i) {
   const { sbox2: o, T01: s, T23: c } = fr;
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
-  for (let w = 0; w < l; w++) {
-    const h = e[a++] ^ me(s, c, t, i, r, n), y = e[a++] ^ me(s, c, n, t, i, r), p = e[a++] ^ me(s, c, r, n, t, i), E = e[a++] ^ me(s, c, i, r, n, t);
-    t = h, n = y, r = p, i = E;
+  for (let g = 0; g < l; g++) {
+    const h = e[a++] ^ me(s, c, t, i, r, n), y = e[a++] ^ me(s, c, n, t, i, r), w = e[a++] ^ me(s, c, r, n, t, i), E = e[a++] ^ me(s, c, i, r, n, t);
+    t = h, n = y, r = w, i = E;
   }
-  const f = e[a++] ^ se(o, t, i, r, n), u = e[a++] ^ se(o, n, t, i, r), d = e[a++] ^ se(o, r, n, t, i), g = e[a++] ^ se(o, i, r, n, t);
-  return { s0: f, s1: u, s2: d, s3: g };
+  const f = e[a++] ^ se(o, t, i, r, n), u = e[a++] ^ se(o, n, t, i, r), d = e[a++] ^ se(o, r, n, t, i), p = e[a++] ^ se(o, i, r, n, t);
+  return { s0: f, s1: u, s2: d, s3: p };
 }
 function dr(e, t) {
   if (!t)
@@ -2129,7 +2129,7 @@ function dr(e, t) {
     throw new Error(`aes: wrong destination length, expected at least ${e}, got: ${t.length}`);
   return t;
 }
-function ko(e) {
+function _o(e) {
   if (le(e), e.length % Ee !== 0)
     throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ee}`);
 }
@@ -2175,102 +2175,102 @@ const yr = /* @__PURE__ */ Ko({ blockSize: 16, nonceLength: 16 }, function(t, n,
   return {
     encrypt: (o, s) => {
       const c = hr(t), { b: a, o: l, out: f } = Lo(o, i, s), u = F(n);
-      let d = u[0], g = u[1], w = u[2], h = u[3], y = 0;
+      let d = u[0], p = u[1], g = u[2], h = u[3], y = 0;
       for (; y + 4 <= a.length; )
-        d ^= a[y + 0], g ^= a[y + 1], w ^= a[y + 2], h ^= a[y + 3], { s0: d, s1: g, s2: w, s3: h } = Ln(c, d, g, w, h), l[y++] = d, l[y++] = g, l[y++] = w, l[y++] = h;
+        d ^= a[y + 0], p ^= a[y + 1], g ^= a[y + 2], h ^= a[y + 3], { s0: d, s1: p, s2: g, s3: h } = Ln(c, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
       if (i) {
-        const p = To(o.subarray(y * 4));
-        d ^= p[0], g ^= p[1], w ^= p[2], h ^= p[3], { s0: d, s1: g, s2: w, s3: h } = Ln(c, d, g, w, h), l[y++] = d, l[y++] = g, l[y++] = w, l[y++] = h;
+        const w = To(o.subarray(y * 4));
+        d ^= w[0], p ^= w[1], g ^= w[2], h ^= w[3], { s0: d, s1: p, s2: g, s3: h } = Ln(c, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
       }
       return c.fill(0), f;
     },
     decrypt: (o, s) => {
-      ko(o);
+      _o(o);
       const c = Uo(t), a = F(n), l = dr(o.length, s), f = F(o), u = F(l);
-      let d = a[0], g = a[1], w = a[2], h = a[3];
+      let d = a[0], p = a[1], g = a[2], h = a[3];
       for (let y = 0; y + 4 <= f.length; ) {
-        const p = d, E = g, K = w, _ = h;
-        d = f[y + 0], g = f[y + 1], w = f[y + 2], h = f[y + 3];
-        const { s0: C, s1: m, s2: x, s3: A } = _o(c, d, g, w, h);
-        u[y++] = C ^ p, u[y++] = m ^ E, u[y++] = x ^ K, u[y++] = A ^ _;
+        const w = d, E = p, K = g, k = h;
+        d = f[y + 0], p = f[y + 1], g = f[y + 2], h = f[y + 3];
+        const { s0: C, s1: m, s2: x, s3: A } = ko(c, d, p, g, h);
+        u[y++] = C ^ w, u[y++] = m ^ E, u[y++] = x ^ K, u[y++] = A ^ k;
       }
       return c.fill(0), $o(l, i);
     }
   };
-}), gr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Ro = gr("expand 16-byte k"), Po = gr("expand 32-byte k"), Oo = F(Ro), pr = F(Po);
-pr.slice();
+}), pr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Ro = pr("expand 16-byte k"), Po = pr("expand 32-byte k"), Oo = F(Ro), gr = F(Po);
+gr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
 }
-function Vt(e) {
+function zt(e) {
   return e.byteOffset % 4 === 0;
 }
 const Xe = 64, Mo = 16, wr = 2 ** 32 - 1, $n = new Uint32Array();
 function Ho(e, t, n, r, i, o, s, c) {
-  const a = i.length, l = new Uint8Array(Xe), f = F(l), u = Vt(i) && Vt(o), d = u ? F(i) : $n, g = u ? F(o) : $n;
-  for (let w = 0; w < a; s++) {
+  const a = i.length, l = new Uint8Array(Xe), f = F(l), u = zt(i) && zt(o), d = u ? F(i) : $n, p = u ? F(o) : $n;
+  for (let g = 0; g < a; s++) {
     if (e(t, n, r, f, s, c), s >= wr)
       throw new Error("arx: counter overflow");
-    const h = Math.min(Xe, a - w);
+    const h = Math.min(Xe, a - g);
     if (u && h === Xe) {
-      const y = w / 4;
-      if (w % 4 !== 0)
+      const y = g / 4;
+      if (g % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let p = 0, E; p < Mo; p++)
-        E = y + p, g[E] = d[E] ^ f[p];
-      w += Xe;
+      for (let w = 0, E; w < Mo; w++)
+        E = y + w, p[E] = d[E] ^ f[w];
+      g += Xe;
       continue;
     }
-    for (let y = 0, p; y < h; y++)
-      p = w + y, o[p] = i[p] ^ l[y];
-    w += h;
+    for (let y = 0, w; y < h; y++)
+      w = g + y, o[w] = i[w] ^ l[y];
+    g += h;
   }
 }
 function qo(e, t) {
   const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: o, rounds: s } = Ao({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return _t(i), _t(s), kn(o), kn(n), (c, a, l, f, u = 0) => {
+  return Ut(i), Ut(s), _n(o), _n(n), (c, a, l, f, u = 0) => {
     le(c), le(a), le(l);
     const d = l.length;
-    if (f || (f = new Uint8Array(d)), le(f), _t(u), u < 0 || u >= wr)
+    if (f || (f = new Uint8Array(d)), le(f), Ut(u), u < 0 || u >= wr)
       throw new Error("arx: counter overflow");
     if (f.length < d)
       throw new Error(`arx: output (${f.length}) is shorter than data (${d})`);
-    const g = [];
-    let w = c.length, h, y;
-    if (w === 32)
-      h = c.slice(), g.push(h), y = pr;
-    else if (w === 16 && n)
-      h = new Uint8Array(32), h.set(c), h.set(c, 16), y = Oo, g.push(h);
+    const p = [];
+    let g = c.length, h, y;
+    if (g === 32)
+      h = c.slice(), p.push(h), y = gr;
+    else if (g === 16 && n)
+      h = new Uint8Array(32), h.set(c), h.set(c, 16), y = Oo, p.push(h);
     else
-      throw new Error(`arx: invalid 32-byte key, got length=${w}`);
-    Vt(a) || (a = a.slice(), g.push(a));
-    const p = F(h);
+      throw new Error(`arx: invalid 32-byte key, got length=${g}`);
+    zt(a) || (a = a.slice(), p.push(a));
+    const w = F(h);
     if (r) {
       if (a.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(y, p, F(a.subarray(0, 16)), p), a = a.subarray(16);
+      r(y, w, F(a.subarray(0, 16)), w), a = a.subarray(16);
     }
     const E = 16 - i;
     if (E !== a.length)
       throw new Error(`arx: nonce must be ${E} or 16 bytes`);
     if (E !== 12) {
-      const _ = new Uint8Array(12);
-      _.set(a, o ? 0 : 12 - a.length), a = _, g.push(a);
+      const k = new Uint8Array(12);
+      k.set(a, o ? 0 : 12 - a.length), a = k, p.push(a);
     }
     const K = F(a);
-    for (Ho(e, y, p, K, l, f, u, s); g.length > 0; )
-      g.pop().fill(0);
+    for (Ho(e, y, w, K, l, f, u, s); p.length > 0; )
+      p.pop().fill(0);
     return f;
   };
 }
 function Do(e, t, n, r, i, o = 20) {
-  let s = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], d = t[2], g = t[3], w = t[4], h = t[5], y = t[6], p = t[7], E = i, K = n[0], _ = n[1], C = n[2], m = s, x = c, A = a, O = l, U = f, B = u, T = d, R = g, H = w, b = h, v = y, S = p, I = E, N = K, k = _, P = C;
+  let s = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], d = t[2], p = t[3], g = t[4], h = t[5], y = t[6], w = t[7], E = i, K = n[0], k = n[1], C = n[2], m = s, x = c, A = a, O = l, U = f, B = u, T = d, R = p, H = g, b = h, v = y, S = w, I = E, N = K, _ = k, P = C;
   for (let X = 0; X < o; X += 2)
-    m = m + U | 0, I = L(I ^ m, 16), H = H + I | 0, U = L(U ^ H, 12), m = m + U | 0, I = L(I ^ m, 8), H = H + I | 0, U = L(U ^ H, 7), x = x + B | 0, N = L(N ^ x, 16), b = b + N | 0, B = L(B ^ b, 12), x = x + B | 0, N = L(N ^ x, 8), b = b + N | 0, B = L(B ^ b, 7), A = A + T | 0, k = L(k ^ A, 16), v = v + k | 0, T = L(T ^ v, 12), A = A + T | 0, k = L(k ^ A, 8), v = v + k | 0, T = L(T ^ v, 7), O = O + R | 0, P = L(P ^ O, 16), S = S + P | 0, R = L(R ^ S, 12), O = O + R | 0, P = L(P ^ O, 8), S = S + P | 0, R = L(R ^ S, 7), m = m + B | 0, P = L(P ^ m, 16), v = v + P | 0, B = L(B ^ v, 12), m = m + B | 0, P = L(P ^ m, 8), v = v + P | 0, B = L(B ^ v, 7), x = x + T | 0, I = L(I ^ x, 16), S = S + I | 0, T = L(T ^ S, 12), x = x + T | 0, I = L(I ^ x, 8), S = S + I | 0, T = L(T ^ S, 7), A = A + R | 0, N = L(N ^ A, 16), H = H + N | 0, R = L(R ^ H, 12), A = A + R | 0, N = L(N ^ A, 8), H = H + N | 0, R = L(R ^ H, 7), O = O + U | 0, k = L(k ^ O, 16), b = b + k | 0, U = L(U ^ b, 12), O = O + U | 0, k = L(k ^ O, 8), b = b + k | 0, U = L(U ^ b, 7);
+    m = m + U | 0, I = L(I ^ m, 16), H = H + I | 0, U = L(U ^ H, 12), m = m + U | 0, I = L(I ^ m, 8), H = H + I | 0, U = L(U ^ H, 7), x = x + B | 0, N = L(N ^ x, 16), b = b + N | 0, B = L(B ^ b, 12), x = x + B | 0, N = L(N ^ x, 8), b = b + N | 0, B = L(B ^ b, 7), A = A + T | 0, _ = L(_ ^ A, 16), v = v + _ | 0, T = L(T ^ v, 12), A = A + T | 0, _ = L(_ ^ A, 8), v = v + _ | 0, T = L(T ^ v, 7), O = O + R | 0, P = L(P ^ O, 16), S = S + P | 0, R = L(R ^ S, 12), O = O + R | 0, P = L(P ^ O, 8), S = S + P | 0, R = L(R ^ S, 7), m = m + B | 0, P = L(P ^ m, 16), v = v + P | 0, B = L(B ^ v, 12), m = m + B | 0, P = L(P ^ m, 8), v = v + P | 0, B = L(B ^ v, 7), x = x + T | 0, I = L(I ^ x, 16), S = S + I | 0, T = L(T ^ S, 12), x = x + T | 0, I = L(I ^ x, 8), S = S + I | 0, T = L(T ^ S, 7), A = A + R | 0, N = L(N ^ A, 16), H = H + N | 0, R = L(R ^ H, 12), A = A + R | 0, N = L(N ^ A, 8), H = H + N | 0, R = L(R ^ H, 7), O = O + U | 0, _ = L(_ ^ O, 16), b = b + _ | 0, U = L(U ^ b, 12), O = O + U | 0, _ = L(_ ^ O, 8), b = b + _ | 0, U = L(U ^ b, 7);
   let $ = 0;
-  r[$++] = s + m | 0, r[$++] = c + x | 0, r[$++] = a + A | 0, r[$++] = l + O | 0, r[$++] = f + U | 0, r[$++] = u + B | 0, r[$++] = d + T | 0, r[$++] = g + R | 0, r[$++] = w + H | 0, r[$++] = h + b | 0, r[$++] = y + v | 0, r[$++] = p + S | 0, r[$++] = E + I | 0, r[$++] = K + N | 0, r[$++] = _ + k | 0, r[$++] = C + P | 0;
+  r[$++] = s + m | 0, r[$++] = c + x | 0, r[$++] = a + A | 0, r[$++] = l + O | 0, r[$++] = f + U | 0, r[$++] = u + B | 0, r[$++] = d + T | 0, r[$++] = p + R | 0, r[$++] = g + H | 0, r[$++] = h + b | 0, r[$++] = y + v | 0, r[$++] = w + S | 0, r[$++] = E + I | 0, r[$++] = K + N | 0, r[$++] = k + _ | 0, r[$++] = C + P | 0;
 }
 const br = /* @__PURE__ */ qo(Do, {
   counterRight: !1,
@@ -2317,7 +2317,7 @@ pt.create = (e, t) => new vr(e, t);
 function nn(e, t, n) {
   return oe.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), pt(e, Ge(n), Ge(t));
 }
-const Lt = new Uint8Array([0]), Tn = new Uint8Array();
+const _t = new Uint8Array([0]), Tn = new Uint8Array();
 function mr(e, t, n, r = 32) {
   if (oe.hash(e), oe.number(r), r > 255 * e.outputLen)
     throw new Error("Length should be <= 255*HashLen");
@@ -2325,15 +2325,15 @@ function mr(e, t, n, r = 32) {
   n === void 0 && (n = Tn);
   const o = new Uint8Array(i * e.outputLen), s = pt.create(e, t), c = s._cloneInto(), a = new Uint8Array(s.outputLen);
   for (let l = 0; l < i; l++)
-    Lt[0] = l + 1, c.update(l === 0 ? Tn : a).update(n).update(Lt).digestInto(a), o.set(a, e.outputLen * l), s._cloneInto(c);
-  return s.destroy(), c.destroy(), a.fill(0), Lt.fill(0), o.slice(0, r);
+    _t[0] = l + 1, c.update(l === 0 ? Tn : a).update(n).update(_t).digestInto(a), o.set(a, e.outputLen * l), s._cloneInto(c);
+  return s.destroy(), c.destroy(), a.fill(0), _t.fill(0), o.slice(0, r);
 }
 var jo = Object.defineProperty, D = (e, t) => {
   for (var n in t)
     jo(e, n, { get: t[n], enumerable: !0 });
-}, Te = Symbol("verified"), Vo = (e) => e instanceof Object;
+}, Te = Symbol("verified"), zo = (e) => e instanceof Object;
 function Er(e) {
-  if (!Vo(e) || typeof e.kind != "number" || typeof e.content != "string" || typeof e.created_at != "number" || typeof e.pubkey != "string" || !e.pubkey.match(/^[a-f0-9]{64}$/) || !Array.isArray(e.tags))
+  if (!zo(e) || typeof e.kind != "number" || typeof e.content != "string" || typeof e.created_at != "number" || typeof e.pubkey != "string" || !e.pubkey.match(/^[a-f0-9]{64}$/) || !Array.isArray(e.tags))
     return !1;
   for (let t = 0; t < e.tags.length; t++) {
     let n = e.tags[t];
@@ -2345,8 +2345,8 @@ function Er(e) {
   }
   return !0;
 }
-var zo = {};
-D(zo, {
+var Vo = {};
+D(Vo, {
   Queue: () => Go,
   QueueNode: () => xr,
   binarySearch: () => rn,
@@ -2409,14 +2409,14 @@ var xr = class {
   }
 }, Jo = class {
   generateSecretKey() {
-    return ze.utils.randomPrivateKey();
+    return Ve.utils.randomPrivateKey();
   }
   getPublicKey(e) {
-    return M(ze.getPublicKey(e));
+    return M(Ve.getPublicKey(e));
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = M(ze.getPublicKey(t)), n.id = tt(n), n.sig = M(ze.sign(tt(n), t)), n[Te] = !0, n;
+    return n.pubkey = M(Ve.getPublicKey(t)), n.id = tt(n), n.sig = M(Ve.sign(tt(n), t)), n[Te] = !0, n;
   }
   verifyEvent(e) {
     if (typeof e[Te] == "boolean")
@@ -2425,7 +2425,7 @@ var xr = class {
     if (t !== e.id)
       return e[Te] = !1, !1;
     try {
-      const n = ze.verify(e.sig, t, e.pubkey);
+      const n = Ve.verify(e.sig, t, e.pubkey);
       return e[Te] = n, n;
     } catch {
       return e[Te] = !1, !1;
@@ -2441,11 +2441,11 @@ function tt(e) {
   let t = Ae(te.encode(Yo(e)));
   return M(t);
 }
-var wt = new Jo(), Oe = wt.generateSecretKey, Ce = wt.getPublicKey, ae = wt.finalizeEvent, on = wt.verifyEvent, Xo = {};
+var gt = new Jo(), Oe = gt.generateSecretKey, Ce = gt.getPublicKey, ae = gt.finalizeEvent, on = gt.verifyEvent, Xo = {};
 D(Xo, {
   Application: () => Xs,
   BadgeAward: () => as,
-  BadgeDefinition: () => zs,
+  BadgeDefinition: () => Vs,
   BlockedRelaysList: () => Us,
   BookmarkList: () => Ns,
   Bookmarksets: () => Ds,
@@ -2455,12 +2455,12 @@ D(Xo, {
   ChannelHideMessage: () => Ur,
   ChannelMessage: () => Ir,
   ChannelMetadata: () => Cr,
-  ChannelMuteUser: () => _r,
+  ChannelMuteUser: () => kr,
   ClassifiedListing: () => ta,
-  ClientAuth: () => kr,
+  ClientAuth: () => _r,
   CommunitiesList: () => Cs,
   CommunityDefinition: () => la,
-  CommunityPostApproval: () => ps,
+  CommunityPostApproval: () => gs,
   Contacts: () => rs,
   CreateOrUpdateProduct: () => Ws,
   CreateOrUpdateStall: () => Fs,
@@ -2481,12 +2481,12 @@ D(Xo, {
   Handlerinformation: () => ca,
   Handlerrecommendation: () => aa,
   Highlights: () => As,
-  InterestsList: () => ks,
+  InterestsList: () => _s,
   Interestsets: () => Zs,
   JobFeedback: () => vs,
   JobRequest: () => ws,
   JobResult: () => bs,
-  Label: () => gs,
+  Label: () => ps,
   LightningPubRPC: () => Rs,
   LiveChatMessage: () => fs,
   LiveEvent: () => Qs,
@@ -2500,7 +2500,7 @@ D(Xo, {
   OpenTimestamps: () => ls,
   Pinlist: () => Ks,
   ProblemTracker: () => hs,
-  ProfileBadges: () => Vs,
+  ProfileBadges: () => zs,
   PublicChatsList: () => Is,
   Reaction: () => an,
   RecommendRelay: () => ns,
@@ -2509,7 +2509,7 @@ D(Xo, {
   Report: () => ds,
   Reporting: () => ys,
   Repost: () => sn,
-  SearchRelaysList: () => _s,
+  SearchRelaysList: () => ks,
   ShortTextNote: () => ts,
   Time: () => ia,
   UserEmojiList: () => Ls,
@@ -2538,7 +2538,7 @@ function Br(e) {
 function Qo(e) {
   return Ar(e) ? "regular" : Sr(e) ? "replaceable" : Kr(e) ? "ephemeral" : Br(e) ? "parameterized" : "unknown";
 }
-var es = 0, ts = 1, ns = 2, rs = 3, is = 4, os = 4, ss = 5, sn = 6, an = 7, as = 8, cs = 16, Nr = 40, Cr = 41, Ir = 42, Ur = 43, _r = 44, ls = 1040, us = 1063, fs = 1311, hs = 1971, ds = 1984, ys = 1984, gs = 1985, ps = 4550, ws = 5999, bs = 6999, vs = 7e3, ms = 9041, Es = 9734, xs = 9735, As = 9802, Ss = 1e4, Ks = 10001, Bs = 10002, Ns = 10003, Cs = 10004, Is = 10005, Us = 10006, _s = 10007, ks = 10015, Ls = 10030, $s = 10096, Ts = 13194, Rs = 21e3, kr = 22242, Lr = 23194, Ps = 23195, Os = 24133, cn = 27235, Ms = 3e4, Hs = 30001, qs = 30002, Ds = 30003, js = 30004, Vs = 30008, zs = 30009, Zs = 30015, Fs = 30017, Ws = 30018, Gs = 30023, Js = 30024, Ys = 30030, Xs = 30078, Qs = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, oa = 31924, sa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
+var es = 0, ts = 1, ns = 2, rs = 3, is = 4, os = 4, ss = 5, sn = 6, an = 7, as = 8, cs = 16, Nr = 40, Cr = 41, Ir = 42, Ur = 43, kr = 44, ls = 1040, us = 1063, fs = 1311, hs = 1971, ds = 1984, ys = 1984, ps = 1985, gs = 4550, ws = 5999, bs = 6999, vs = 7e3, ms = 9041, Es = 9734, xs = 9735, As = 9802, Ss = 1e4, Ks = 10001, Bs = 10002, Ns = 10003, Cs = 10004, Is = 10005, Us = 10006, ks = 10007, _s = 10015, Ls = 10030, $s = 10096, Ts = 13194, Rs = 21e3, _r = 22242, Lr = 23194, Ps = 23195, Os = 24133, cn = 27235, Ms = 3e4, Hs = 30001, qs = 30002, Ds = 30003, js = 30004, zs = 30008, Vs = 30009, Zs = 30015, Fs = 30017, Ws = 30018, Gs = 30023, Js = 30024, Ys = 30030, Xs = 30078, Qs = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, oa = 31924, sa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
 D(ua, {
   getHex64: () => ln,
   getInt: () => $r,
@@ -2577,13 +2577,13 @@ function da(e, t) {
 function ya(e, t) {
   return t === $r(e, "kind");
 }
-var ga = {};
-D(ga, {
-  makeAuthEvent: () => pa
+var pa = {};
+D(pa, {
+  makeAuthEvent: () => ga
 });
-function pa(e, t) {
+function ga(e, t) {
   return {
-    kind: kr,
+    kind: _r,
     created_at: Math.floor(Date.now() / 1e3),
     tags: [
       ["relay", e],
@@ -2606,8 +2606,8 @@ var Fe = {};
 D(Fe, {
   BECH32_REGEX: () => Tr,
   Bech32MaxSize: () => un,
-  decode: () => bt,
-  encodeBytes: () => vt,
+  decode: () => wt,
+  encodeBytes: () => bt,
   naddrEncode: () => Ka,
   neventEncode: () => Sa,
   noteEncode: () => xa,
@@ -2621,7 +2621,7 @@ function va(e) {
   const t = new Uint8Array(4);
   return t[0] = e >> 24 & 255, t[1] = e >> 16 & 255, t[2] = e >> 8 & 255, t[3] = e & 255, t;
 }
-function bt(e) {
+function wt(e) {
   var i, o, s, c, a, l, f, u;
   let { prefix: t, words: n } = De.decode(e, un), r = new Uint8Array(De.fromWords(n));
   switch (t) {
@@ -2635,7 +2635,7 @@ function bt(e) {
         type: "nprofile",
         data: {
           pubkey: M(d[0][0]),
-          relays: d[1] ? d[1].map((g) => ie.decode(g)) : []
+          relays: d[1] ? d[1].map((p) => ie.decode(p)) : []
         }
       };
     }
@@ -2653,7 +2653,7 @@ function bt(e) {
         type: "nevent",
         data: {
           id: M(d[0][0]),
-          relays: d[1] ? d[1].map((g) => ie.decode(g)) : [],
+          relays: d[1] ? d[1].map((p) => ie.decode(p)) : [],
           author: (s = d[2]) != null && s[0] ? M(d[2][0]) : void 0,
           kind: (c = d[3]) != null && c[0] ? parseInt(M(d[3][0]), 16) : void 0
         }
@@ -2677,7 +2677,7 @@ function bt(e) {
           identifier: ie.decode(d[0][0]),
           pubkey: M(d[2][0]),
           kind: parseInt(M(d[3][0]), 16),
-          relays: d[1] ? d[1].map((g) => ie.decode(g)) : []
+          relays: d[1] ? d[1].map((p) => ie.decode(p)) : []
         }
       };
     }
@@ -2710,24 +2710,24 @@ function Qe(e) {
   return t;
 }
 function ma(e) {
-  return vt("nsec", e);
+  return bt("nsec", e);
 }
 function Ea(e) {
-  return vt("npub", Y(e));
+  return bt("npub", W(e));
 }
 function xa(e) {
-  return vt("note", Y(e));
+  return bt("note", W(e));
 }
 function Ye(e, t) {
   let n = De.toWords(t);
   return De.encode(e, n, un);
 }
-function vt(e, t) {
+function bt(e, t) {
   return Ye(e, t);
 }
 function Aa(e) {
-  let t = mt({
-    0: [Y(e.pubkey)],
+  let t = vt({
+    0: [W(e.pubkey)],
     1: (e.relays || []).map((n) => te.encode(n))
   });
   return Ye("nprofile", t);
@@ -2735,10 +2735,10 @@ function Aa(e) {
 function Sa(e) {
   let t;
   e.kind !== void 0 && (t = va(e.kind));
-  let n = mt({
-    0: [Y(e.id)],
+  let n = vt({
+    0: [W(e.id)],
     1: (e.relays || []).map((r) => te.encode(r)),
-    2: e.author ? [Y(e.author)] : [],
+    2: e.author ? [W(e.author)] : [],
     3: t ? [new Uint8Array(t)] : []
   });
   return Ye("nevent", n);
@@ -2746,28 +2746,28 @@ function Sa(e) {
 function Ka(e) {
   let t = new ArrayBuffer(4);
   new DataView(t).setUint32(0, e.kind, !1);
-  let n = mt({
+  let n = vt({
     0: [te.encode(e.identifier)],
     1: (e.relays || []).map((r) => te.encode(r)),
-    2: [Y(e.pubkey)],
+    2: [W(e.pubkey)],
     3: [new Uint8Array(t)]
   });
   return Ye("naddr", n);
 }
 function Ba(e) {
-  let t = mt({
+  let t = vt({
     0: [te.encode(e)]
   });
   return Ye("nrelay", t);
 }
-function mt(e) {
+function vt(e) {
   let t = [];
   return Object.entries(e).reverse().forEach(([n, r]) => {
     r.forEach((i) => {
       let o = new Uint8Array(i.length + 2);
       o.set([parseInt(n)], 0), o.set([i.length], 1), o.set(i, 2), t.push(o);
     });
-  }), yt(...t);
+  }), dt(...t);
 }
 var Na = {};
 D(Na, {
@@ -2790,23 +2790,23 @@ function Pr(e) {
 var Ia = {};
 D(Ia, {
   NIP05_REGEX: () => Or,
-  isValid: () => ka,
+  isValid: () => _a,
   queryProfile: () => Mr,
-  searchDomain: () => _a,
+  searchDomain: () => ka,
   useFetchImplementation: () => Ua
 });
-var Or = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Et;
+var Or = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, mt;
 try {
-  Et = fetch;
+  mt = fetch;
 } catch {
 }
 function Ua(e) {
-  Et = e;
+  mt = e;
 }
-async function _a(e, t = "") {
+async function ka(e, t = "") {
   try {
     const n = `https://${e}/.well-known/nostr.json?name=${t}`;
-    return (await (await Et(n, { redirect: "error" })).json()).names;
+    return (await (await mt(n, { redirect: "error" })).json()).names;
   } catch {
     return {};
   }
@@ -2818,14 +2818,14 @@ async function Mr(e) {
     return null;
   const [n, r = "_", i] = t;
   try {
-    const s = `https://${i}/.well-known/nostr.json?name=${r}`, c = await (await Et(s, { redirect: "error" })).json();
+    const s = `https://${i}/.well-known/nostr.json?name=${r}`, c = await (await mt(s, { redirect: "error" })).json();
     let a = c.names[r];
     return a ? { pubkey: a, relays: (o = c.relays) == null ? void 0 : o[a] } : null;
   } catch {
     return null;
   }
 }
-async function ka(e, t) {
+async function _a(e, t) {
   let n = await Mr(t);
   return n ? n.pubkey === e : !1;
 }
@@ -2967,22 +2967,22 @@ function Da(e, { skipVerification: t } = {}) {
 }
 var ja = {};
 D(ja, {
-  NOSTR_URI_REGEX: () => xt,
-  parse: () => za,
-  test: () => Va
+  NOSTR_URI_REGEX: () => Et,
+  parse: () => Va,
+  test: () => za
 });
-var xt = new RegExp(`nostr:(${Tr.source})`);
-function Va(e) {
-  return typeof e == "string" && new RegExp(`^${xt.source}$`).test(e);
-}
+var Et = new RegExp(`nostr:(${Tr.source})`);
 function za(e) {
-  const t = e.match(new RegExp(`^${xt.source}$`));
+  return typeof e == "string" && new RegExp(`^${Et.source}$`).test(e);
+}
+function Va(e) {
+  const t = e.match(new RegExp(`^${Et.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 Za = {};
@@ -3023,7 +3023,7 @@ D(Ga, {
   regex: () => fn,
   replaceAll: () => Ya
 });
-var fn = () => new RegExp(`\\b${xt.source}\\b`, "g");
+var fn = () => new RegExp(`\\b${Et.source}\\b`, "g");
 function* Ja(e) {
   const t = e.matchAll(fn());
   for (const n of t)
@@ -3032,7 +3032,7 @@ function* Ja(e) {
       yield {
         uri: r,
         value: i,
-        decoded: bt(i),
+        decoded: wt(i),
         start: n.index,
         end: n.index + r.length
       };
@@ -3043,7 +3043,7 @@ function Ya(e, t) {
   return e.replaceAll(fn(), (n, r) => t({
     uri: n,
     value: r,
-    decoded: bt(r)
+    decoded: wt(r)
   }));
 }
 var Xa = {};
@@ -3126,7 +3126,7 @@ var Qa = (e, t) => {
     return;
   return ae(
     {
-      kind: _r,
+      kind: kr,
       tags: [["p", e.pubkey_to_mute], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3181,14 +3181,14 @@ async function lc(e, t, n) {
     return !1;
   }
 }
-var V = {};
-D(V, {
+var z = {};
+D(z, {
   decrypt: () => Jr,
   encrypt: () => Gr,
   getConversationKey: () => Zr,
   v2: () => yc
 });
-var Vr = 1, zr = 65535;
+var zr = 1, Vr = 65535;
 function Zr(e, t) {
   const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
   return nn(Ae, n, "nip44-v2");
@@ -3210,25 +3210,25 @@ function yn(e) {
   return n * (Math.floor((e - 1) / n) + 1);
 }
 function uc(e) {
-  if (!Number.isSafeInteger(e) || e < Vr || e > zr)
+  if (!Number.isSafeInteger(e) || e < zr || e > Vr)
     throw new Error("invalid plaintext size: must be between 1 and 65535 bytes");
   const t = new Uint8Array(2);
   return new DataView(t.buffer).setUint16(0, e, !1), t;
 }
 function fc(e) {
   const t = te.encode(e), n = t.length, r = uc(n), i = new Uint8Array(yn(n) - n);
-  return yt(r, t, i);
+  return dt(r, t, i);
 }
 function hc(e) {
   const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
-  if (t < Vr || t > zr || n.length !== t || e.length !== 2 + yn(t))
+  if (t < zr || t > Vr || n.length !== t || e.length !== 2 + yn(t))
     throw new Error("invalid padding");
   return ie.decode(n);
 }
 function Wr(e, t, n) {
   if (n.length !== 32)
     throw new Error("AAD associated data must be 32 bytes");
-  const r = yt(n, t);
+  const r = dt(n, t);
   return pt(Ae, e, r);
 }
 function dc(e) {
@@ -3259,7 +3259,7 @@ function dc(e) {
 }
 function Gr(e, t, n = ir(32)) {
   const { chacha_key: r, chacha_nonce: i, hmac_key: o } = Fr(t, n), s = fc(e), c = br(r, i, s), a = Wr(o, c, n);
-  return ue.encode(yt(new Uint8Array([2]), n, c, a));
+  return ue.encode(dt(new Uint8Array([2]), n, c, a));
 }
 function Jr(e, t) {
   const { nonce: n, ciphertext: r, mac: i } = dc(e), { chacha_key: o, chacha_nonce: s, hmac_key: c } = Fr(t, n), a = Wr(c, r, n);
@@ -3275,12 +3275,12 @@ var yc = {
   },
   encrypt: Gr,
   decrypt: Jr
-}, gc = {};
-D(gc, {
+}, pc = {};
+D(pc, {
   makeNwcRequestEvent: () => wc,
-  parseConnectionString: () => pc
+  parseConnectionString: () => gc
 });
-function pc(e) {
+function gc(e) {
   const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), o = n.get("secret");
   if (!r || !i || !o)
     throw new Error("invalid connection string");
@@ -3308,13 +3308,13 @@ D(bc, {
   useFetchImplementation: () => vc,
   validateZapRequest: () => xc
 });
-var gn;
+var pn;
 try {
-  gn = fetch;
+  pn = fetch;
 } catch {
 }
 function vc(e) {
-  gn = e;
+  pn = e;
 }
 async function mc(e) {
   try {
@@ -3327,7 +3327,7 @@ async function mc(e) {
       t = new URL(`/.well-known/lnurlp/${s}`, `https://${c}`).toString();
     } else
       return null;
-    let o = await (await gn(t)).json();
+    let o = await (await pn(t)).json();
     if (o.allowsNostr && o.nostrPubkey)
       return o.callback;
   } catch {
@@ -3393,7 +3393,7 @@ function Ac({
 var Sc = {};
 D(Sc, {
   getToken: () => Kc,
-  hashPayload: () => pn,
+  hashPayload: () => gn,
   unpackEventFromToken: () => Xr,
   validateEvent: () => ii,
   validateEventKind: () => ei,
@@ -3414,7 +3414,7 @@ async function Kc(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && o.tags.push(["payload", pn(i)]);
+  i && o.tags.push(["payload", gn(i)]);
   const s = await n(o);
   return (r ? Yr : "") + ue.encode(te.encode(JSON.stringify(s)));
 }
@@ -3449,7 +3449,7 @@ function ni(e, t) {
   const n = e.tags.find((r) => r[0] === "method");
   return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
 }
-function pn(e) {
+function gn(e) {
   const t = Ae(te.encode(JSON.stringify(e)));
   return M(t);
 }
@@ -3457,7 +3457,7 @@ function ri(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
   if (!n)
     return !1;
-  const r = pn(t);
+  const r = gn(t);
   return n.length > 0 && n[1] === r;
 }
 async function ii(e, t, n, r) {
@@ -3505,25 +3505,25 @@ function Rc(e) {
 function Pc(e) {
   const t = JSON.parse(e);
   return {
-    rootKey: Y(t.rootKey),
+    rootKey: W(t.rootKey),
     theirNostrPublicKey: t.theirNostrPublicKey,
     ourCurrentNostrKey: t.ourCurrentNostrKey ? {
       publicKey: t.ourCurrentNostrKey.publicKey,
-      privateKey: Y(t.ourCurrentNostrKey.privateKey)
+      privateKey: W(t.ourCurrentNostrKey.privateKey)
     } : void 0,
     ourNextNostrKey: {
       publicKey: t.ourNextNostrKey.publicKey,
-      privateKey: Y(t.ourNextNostrKey.privateKey)
+      privateKey: W(t.ourNextNostrKey.privateKey)
     },
-    receivingChainKey: t.receivingChainKey ? Y(t.receivingChainKey) : void 0,
-    sendingChainKey: t.sendingChainKey ? Y(t.sendingChainKey) : void 0,
+    receivingChainKey: t.receivingChainKey ? W(t.receivingChainKey) : void 0,
+    sendingChainKey: t.sendingChainKey ? W(t.sendingChainKey) : void 0,
     sendingChainMessageNumber: t.sendingChainMessageNumber,
     receivingChainMessageNumber: t.receivingChainMessageNumber,
     previousSendingChainMessageCount: t.previousSendingChainMessageCount,
     skippedMessageKeys: Object.fromEntries(
       Object.entries(t.skippedMessageKeys).map(([n, r]) => [
         n,
-        Y(r)
+        W(r)
       ])
     )
   };
@@ -3553,7 +3553,8 @@ function Rn(e, t) {
   return `${e}:${t}`;
 }
 const Cc = 1e3;
-class lt {
+class ct {
+  // 1. CHANNEL PUBLIC INTERFACE
   constructor(t, n) {
     ee(this, "nostrUnsubscribe");
     ee(this, "nostrNextUnsubscribe");
@@ -3563,31 +3564,43 @@ class lt {
     this.nostrSubscribe = t, this.state = n, this.name = Math.random().toString(36).substring(2, 6);
   }
   /**
-   * @param sharedSecret optional, but useful to keep the first chain of messages secure. Unlike the Nostr keys, it can be forgotten after the 1st message in the chain.
-   * @param isInitiator determines which chain key is used for sending vs receiving
+   * Initializes a new secure communication channel
+   * @param nostrSubscribe Function to subscribe to Nostr events
+   * @param theirNostrPublicKey The public key of the other party
+   * @param ourCurrentPrivateKey Our current private key for Nostr
+   * @param isInitiator Whether we are initiating the conversation (true) or responding (false)
+   * @param sharedSecret Initial shared secret for securing the first message chain
+   * @param name Optional name for the channel (for debugging)
+   * @returns A new Channel instance
    */
-  static init(t, n, r, i = new Uint8Array(), o, s = !0) {
-    const c = Oe(), [a, l] = Re(i, V.getConversationKey(c, n), 2);
+  static init(t, n, r, i, o, s) {
+    const c = Oe(), [a, l] = Re(o, z.getConversationKey(c, n), 2);
     let f, u;
-    s ? (f = { publicKey: Ce(r), privateKey: r }, u = { publicKey: Ce(c), privateKey: c }) : u = { publicKey: Ce(r), privateKey: r };
+    i ? (f = { publicKey: Ce(r), privateKey: r }, u = { publicKey: Ce(c), privateKey: c }) : u = { publicKey: Ce(r), privateKey: r };
     const d = {
-      rootKey: s ? a : i,
+      rootKey: i ? a : o,
       theirNostrPublicKey: n,
       ourCurrentNostrKey: f,
       ourNextNostrKey: u,
       receivingChainKey: void 0,
-      sendingChainKey: s ? l : void 0,
+      sendingChainKey: i ? l : void 0,
       sendingChainMessageNumber: 0,
       receivingChainMessageNumber: 0,
       previousSendingChainMessageCount: 0,
       skippedMessageKeys: {}
-    }, g = new lt(t, d);
-    return o && (g.name = o), console.log(g.name, "initial root key", M(d.rootKey).slice(0, 4)), g;
+    }, p = new ct(t, d);
+    return s && (p.name = s), p;
   }
+  /**
+   * Sends an encrypted message through the channel
+   * @param data The plaintext message to send
+   * @returns A verified Nostr event containing the encrypted message
+   * @throws Error if we are not the initiator and trying to send the first message
+   */
   send(t) {
     if (!this.state.theirNostrPublicKey || !this.state.ourCurrentNostrKey)
       throw new Error("we are not the initiator, so we can't send the first message");
-    const [n, r] = this.ratchetEncrypt(t), i = V.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNostrPublicKey), o = V.encrypt(JSON.stringify(n), i);
+    const [n, r] = this.ratchetEncrypt(t), i = z.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNostrPublicKey), o = z.encrypt(JSON.stringify(n), i);
     return ae({
       content: r,
       kind: Me,
@@ -3595,10 +3608,16 @@ class lt {
       created_at: Math.floor(Date.now() / 1e3)
     }, this.state.ourCurrentNostrKey.privateKey);
   }
+  /**
+   * Subscribes to incoming messages on this channel
+   * @param callback Function to be called when a message is received
+   * @returns Unsubscribe function to stop receiving messages
+   */
   onMessage(t) {
     const n = this.currentInternalSubscriptionId++;
     return this.internalSubscriptions.set(n, t), this.subscribeToNostrEvents(), () => this.internalSubscriptions.delete(n);
   }
+  // 2. RATCHET FUNCTIONS
   ratchetEncrypt(t) {
     const [n, r] = Re(this.state.sendingChainKey, new Uint8Array([1]), 2);
     return this.state.sendingChainKey = n, [{
@@ -3606,7 +3625,7 @@ class lt {
       nextPublicKey: this.state.ourNextNostrKey.publicKey,
       time: Date.now(),
       previousChainLength: this.state.previousSendingChainMessageCount
-    }, V.encrypt(t, r)];
+    }, z.encrypt(t, r)];
   }
   ratchetDecrypt(t, n, r) {
     const i = this.trySkippedMessageKeys(t, n, r);
@@ -3615,7 +3634,7 @@ class lt {
     const [o, s] = Re(this.state.receivingChainKey, new Uint8Array([1]), 2);
     this.state.receivingChainKey = o, this.state.receivingChainMessageNumber++;
     try {
-      return V.decrypt(n, s);
+      return z.decrypt(n, s);
     } catch (c) {
       throw console.error(this.name, "Decryption failed:", c, {
         messageKey: M(s).slice(0, 4),
@@ -3627,16 +3646,17 @@ class lt {
   }
   ratchetStep(t) {
     this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.theirNostrPublicKey = t;
-    const n = V.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [r, i] = Re(this.state.rootKey, n, 3);
+    const n = z.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [r, i] = Re(this.state.rootKey, n, 2);
     this.state.receivingChainKey = i, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
     const o = Oe();
     this.state.ourNextNostrKey = {
       publicKey: Ce(o),
       privateKey: o
     };
-    const s = V.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [c, a] = Re(r, s, 3);
+    const s = z.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [c, a] = Re(r, s, 2);
     this.state.rootKey = c, this.state.sendingChainKey = a;
   }
+  // 3. MESSAGE KEY FUNCTIONS
   skipMessageKeys(t, n) {
     if (this.state.receivingChainMessageNumber + Cc < t)
       throw new Error("Too many skipped messages");
@@ -3651,22 +3671,23 @@ class lt {
     const i = Rn(r, t.number);
     if (i in this.state.skippedMessageKeys) {
       const o = this.state.skippedMessageKeys[i];
-      return delete this.state.skippedMessageKeys[i], V.decrypt(n, o);
+      return delete this.state.skippedMessageKeys[i], z.decrypt(n, o);
     }
     return null;
   }
+  // 4. NOSTR EVENT HANDLING
   decryptHeader(t) {
     const n = t.tags[0][1];
     if (this.state.ourCurrentNostrKey) {
-      const i = V.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
+      const i = z.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
       try {
-        return [JSON.parse(V.decrypt(n, i)), !1];
+        return [JSON.parse(z.decrypt(n, i)), !1];
       } catch {
       }
     }
-    const r = V.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
+    const r = z.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
     try {
-      return [JSON.parse(V.decrypt(n, r)), !0];
+      return [JSON.parse(z.decrypt(n, r)), !0];
     } catch {
     }
     throw new Error("Failed to decrypt header with both current and next secrets");
@@ -3682,12 +3703,19 @@ class lt {
     this.internalSubscriptions.forEach((s) => s({ id: t.id, data: i, pubkey: n.nextPublicKey, time: n.time }));
   }
   subscribeToNostrEvents() {
-    this.nostrNextUnsubscribe || (this.state.theirNostrPublicKey && (this.nostrUnsubscribe = this.nostrSubscribe(
-      { authors: [this.state.theirNostrPublicKey], kinds: [Me] },
-      (t) => this.handleNostrEvent(t)
-    )), this.nostrNextUnsubscribe = this.nostrSubscribe(
+    if (this.nostrNextUnsubscribe) return;
+    this.nostrNextUnsubscribe = this.nostrSubscribe(
       { authors: [this.state.theirNostrPublicKey], kinds: [Me] },
-      (t) => this.handleNostrEvent(t)
+      (n) => this.handleNostrEvent(n)
+    );
+    const t = /* @__PURE__ */ new Set();
+    for (const n of Object.keys(this.state.skippedMessageKeys)) {
+      const [r] = n.split(":");
+      r !== this.state.theirNostrPublicKey && t.add(r);
+    }
+    t.size > 0 && (this.nostrUnsubscribe = this.nostrSubscribe(
+      { authors: Array.from(t), kinds: [Me] },
+      (n) => this.handleNostrEvent(n)
     ));
   }
 }
@@ -3702,7 +3730,7 @@ class nt {
     this.inviterSessionPublicKey = t, this.linkSecret = n, this.inviter = r, this.inviterSessionPrivateKey = i, this.label = o, this.maxUses = s, this.usedBy = c;
   }
   static createNew(t, n, r) {
-    const i = Oe(), o = Ce(i), s = ct.encode(Oe()).slice(8, 40);
+    const i = Oe(), o = Ce(i), s = M(Oe());
     return new nt(
       o,
       s,
@@ -3769,19 +3797,19 @@ class nt {
        * so the inviter can create the channel on their side.
        */
   async acceptInvite(t, n, r) {
-    const i = Oe(), o = Ce(i), s = this.inviter || this.inviterSessionPublicKey, c = lt.init(t, this.inviterSessionPublicKey, i, new Uint8Array(), void 0, !0), a = Oe(), l = Ce(a), f = typeof r == "function" ? r : (g, w) => Promise.resolve(V.encrypt(g, et(r, w))), u = {
+    const i = Oe(), o = Ce(i), s = this.inviter || this.inviterSessionPublicKey, c = W(this.linkSecret), a = ct.init(t, this.inviterSessionPublicKey, i, !0, c, void 0), l = Oe(), f = Ce(l), u = typeof r == "function" ? r : (g, h) => Promise.resolve(z.encrypt(g, et(r, h))), d = {
       pubkey: n,
       tags: [["secret", this.linkSecret]],
-      content: await f(o, s),
+      content: await u(o, s),
       created_at: Math.floor(Date.now() / 1e3)
-    }, d = {
+    }, p = {
       kind: Me,
-      pubkey: l,
-      content: V.encrypt(JSON.stringify(u), et(a, this.inviterSessionPublicKey)),
+      pubkey: f,
+      content: z.encrypt(JSON.stringify(d), et(l, this.inviterSessionPublicKey)),
       created_at: Math.floor(Date.now() / 1e3),
       tags: [["p", this.inviterSessionPublicKey]]
     };
-    return { channel: c, event: ae(d, a) };
+    return { channel: a, event: ae(p, l) };
   }
   listen(t, n, r) {
     if (!this.inviterSessionPrivateKey)
@@ -3792,13 +3820,13 @@ class nt {
     };
     return n(i, async (o) => {
       try {
-        const s = await V.decrypt(o.content, et(this.inviterSessionPrivateKey, o.pubkey)), c = JSON.parse(s);
-        if (!c.tags || !c.tags.some(([d, g]) => d === "secret" && g === this.linkSecret)) {
+        const s = await z.decrypt(o.content, et(this.inviterSessionPrivateKey, o.pubkey)), c = JSON.parse(s);
+        if (!c.tags || !c.tags.some(([p, g]) => p === "secret" && g === this.linkSecret)) {
           console.error("Invalid secret from event", o);
           return;
         }
-        const l = await (typeof t == "function" ? t : (d, g) => Promise.resolve(V.decrypt(d, et(t, g))))(c.content, c.pubkey), f = o.id, u = lt.init(n, l, this.inviterSessionPrivateKey, new Uint8Array(), f, !1);
-        r(u, c.pubkey);
+        const l = await (typeof t == "function" ? t : (p, g) => Promise.resolve(z.decrypt(p, et(t, g))))(c.content, c.pubkey), f = W(this.linkSecret), u = o.id, d = ct.init(n, l, this.inviterSessionPrivateKey, !1, f, u);
+        r(d, c.pubkey);
       } catch (s) {
         console.error("Error processing invite message:", s);
       }
@@ -3806,7 +3834,7 @@ class nt {
   }
 }
 export {
-  lt as Channel,
+  ct as Channel,
   Me as EVENT_KIND,
   nt as InviteLink,
   Tc as MAX_SKIP,