nostr-double-ratchet 0.0.24 → 0.0.25

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

@@ -214,13 +214,13 @@ let Ii = class extends Ci {
     for (let u = 0; u < 16; u++, n += 4)
       ve[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const p = ve[u - 15], b = ve[u - 2], y = re(p, 7) ^ re(p, 18) ^ p >>> 3, h = re(b, 17) ^ re(b, 19) ^ b >>> 10;
+      const g = ve[u - 15], w = ve[u - 2], y = re(g, 7) ^ re(g, 18) ^ g >>> 3, h = re(w, 17) ^ re(w, 19) ^ w >>> 10;
       ve[u] = h + ve[u - 7] + y + ve[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const p = re(c, 6) ^ re(c, 11) ^ re(c, 25), b = f + p + Bi(c, a, l) + _i[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ki(r, i, s) | 0;
-      f = l, l = a, a = c, c = o + b | 0, o = s, s = i, i = r, r = b + h | 0;
+      const g = re(c, 6) ^ re(c, 11) ^ re(c, 25), w = f + g + Bi(c, a, l) + _i[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ki(r, i, s) | 0;
+      f = l, l = a, a = c, c = o + w | 0, o = s, s = i, i = r, r = w + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
   }
@@ -348,20 +348,20 @@ function Jn(e, t, n) {
     if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
-    const p = [];
+    const g = [];
     for (; u < t; ) {
       r = c();
-      const b = r.slice();
-      p.push(b), u += r.length;
+      const w = r.slice();
+      g.push(w), u += r.length;
     }
-    return _e(...p);
+    return _e(...g);
   };
-  return (u, p) => {
+  return (u, g) => {
     o(), a(u);
-    let b;
-    for (; !(b = p(l())); )
+    let w;
+    for (; !(w = g(l())); )
       a();
-    return o(), b;
+    return o(), w;
   };
 }
 const Hi = {
@@ -468,15 +468,15 @@ function zi(e) {
   return function(c, a) {
     if (c.pow(a, t) === c.neg(c.ONE))
       throw new Error("Cannot find square root");
-    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, s), p = c.pow(a, n);
-    for (; !c.eql(p, c.ONE); ) {
-      if (c.eql(p, c.ZERO))
+    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, s), g = c.pow(a, n);
+    for (; !c.eql(g, c.ONE); ) {
+      if (c.eql(g, c.ZERO))
         return c.ZERO;
-      let b = 1;
-      for (let h = c.sqr(p); b < l && !c.eql(h, c.ONE); b++)
+      let w = 1;
+      for (let h = c.sqr(g); w < l && !c.eql(h, c.ONE); w++)
         h = c.sqr(h);
-      const y = c.pow(f, j << BigInt(l - b - 1));
-      f = c.sqr(y), u = c.mul(u, y), p = c.mul(p, f), l = b;
+      const y = c.pow(f, j << BigInt(l - w - 1));
+      f = c.sqr(y), u = c.mul(u, y), g = c.mul(g, f), l = w;
     }
     return u;
   };
@@ -650,7 +650,7 @@ function Qi(e, t) {
       let l = i, f = l;
       for (let u = 0; u < o; u++) {
         f = l, a.push(f);
-        for (let p = 1; p < c; p++)
+        for (let g = 1; g < c; g++)
           f = f.add(l), a.push(f);
         l = f.double();
       }
@@ -666,13 +666,13 @@ function Qi(e, t) {
     wNAF(i, s, o) {
       const { windows: c, windowSize: a } = r(i);
       let l = e.ZERO, f = e.BASE;
-      const u = BigInt(2 ** i - 1), p = 2 ** i, b = BigInt(i);
+      const u = BigInt(2 ** i - 1), g = 2 ** i, w = BigInt(i);
       for (let y = 0; y < c; y++) {
         const h = y * a;
         let d = Number(o & u);
-        o >>= b, d > a && (d -= p, o += St);
-        const g = h, E = h + Math.abs(d) - 1, S = y % 2 !== 0, I = d < 0;
-        d === 0 ? f = f.add(n(S, s[g])) : l = l.add(n(I, s[E]));
+        o >>= w, d > a && (d -= g, o += St);
+        const p = h, E = h + Math.abs(d) - 1, S = y % 2 !== 0, I = d < 0;
+        d === 0 ? f = f.add(n(S, s[p])) : l = l.add(n(I, s[E]));
       }
       return { p: l, f };
     },
@@ -769,14 +769,14 @@ const kn = BigInt(3);
 BigInt(4);
 function rs(e) {
   const t = es(e), { Fp: n } = t, r = t.toBytes || ((y, h, d) => {
-    const g = h.toAffine();
-    return _e(Uint8Array.from([4]), n.toBytes(g.x), n.toBytes(g.y));
+    const p = h.toAffine();
+    return _e(Uint8Array.from([4]), n.toBytes(p.x), n.toBytes(p.y));
   }), i = t.fromBytes || ((y) => {
-    const h = y.subarray(1), d = n.fromBytes(h.subarray(0, n.BYTES)), g = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
-    return { x: d, y: g };
+    const h = y.subarray(1), d = n.fromBytes(h.subarray(0, n.BYTES)), p = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
+    return { x: d, y: p };
   });
   function s(y) {
-    const { a: h, b: d } = t, g = n.sqr(y), E = n.mul(g, y);
+    const { a: h, b: d } = t, p = n.sqr(y), E = n.mul(p, y);
     return n.add(n.add(E, n.mul(y, h)), d);
   }
   if (!n.eql(n.sqr(t.Gy), s(t.Gx)))
@@ -789,7 +789,7 @@ function rs(e) {
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
   function a(y) {
-    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: g, n: E } = t;
+    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: p, n: E } = t;
     if (h && typeof y != "bigint") {
       if (y instanceof Uint8Array && (y = De(y)), typeof y != "string" || !h.includes(y.length))
         throw new Error("Invalid key");
@@ -801,7 +801,7 @@ function rs(e) {
     } catch {
       throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof y}`);
     }
-    return g && (S = W(S, E)), c(S), S;
+    return p && (S = W(S, E)), c(S), S;
   }
   const l = /* @__PURE__ */ new Map();
   function f(y) {
@@ -809,24 +809,24 @@ function rs(e) {
       throw new Error("ProjectivePoint expected");
   }
   class u {
-    constructor(h, d, g) {
-      if (this.px = h, this.py = d, this.pz = g, h == null || !n.isValid(h))
+    constructor(h, d, p) {
+      if (this.px = h, this.py = d, this.pz = p, h == null || !n.isValid(h))
         throw new Error("x required");
       if (d == null || !n.isValid(d))
         throw new Error("y required");
-      if (g == null || !n.isValid(g))
+      if (p == null || !n.isValid(p))
         throw new Error("z required");
     }
     // Does not validate if the point is on-curve.
     // Use fromHex instead, or call assertValidity() later.
     static fromAffine(h) {
-      const { x: d, y: g } = h || {};
-      if (!h || !n.isValid(d) || !n.isValid(g))
+      const { x: d, y: p } = h || {};
+      if (!h || !n.isValid(d) || !n.isValid(p))
         throw new Error("invalid affine point");
       if (h instanceof u)
         throw new Error("projective point not allowed");
       const E = (S) => n.eql(S, n.ZERO);
-      return E(d) && E(g) ? u.ZERO : new u(d, g, n.ONE);
+      return E(d) && E(p) ? u.ZERO : new u(d, p, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -841,8 +841,8 @@ function rs(e) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(h) {
-      const d = n.invertBatch(h.map((g) => g.pz));
-      return h.map((g, E) => g.toAffine(d[E])).map(u.fromAffine);
+      const d = n.invertBatch(h.map((p) => p.pz));
+      return h.map((p, E) => p.toAffine(d[E])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
@@ -870,8 +870,8 @@ function rs(e) {
       const { x: h, y: d } = this.toAffine();
       if (!n.isValid(h) || !n.isValid(d))
         throw new Error("bad point: x or y not FE");
-      const g = n.sqr(d), E = s(h);
-      if (!n.eql(g, E))
+      const p = n.sqr(d), E = s(h);
+      if (!n.eql(p, 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 rs(e) {
      */
     equals(h) {
       f(h);
-      const { px: d, py: g, pz: E } = this, { px: S, py: I, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(S, E)), x = n.eql(n.mul(g, B), n.mul(I, E));
+      const { px: d, py: p, pz: E } = this, { px: S, py: I, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(S, E)), x = n.eql(n.mul(p, B), n.mul(I, E));
       return m && x;
     }
     /**
@@ -901,9 +901,9 @@ function rs(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: h, b: d } = t, g = n.mul(d, kn), { px: E, py: S, pz: I } = this;
+      const { a: h, b: d } = t, p = n.mul(d, kn), { px: E, py: S, pz: I } = this;
       let B = n.ZERO, m = n.ZERO, x = n.ZERO, K = n.mul(E, E), M = n.mul(S, S), _ = n.mul(I, I), A = n.mul(E, S);
-      return A = n.add(A, A), x = n.mul(E, I), x = n.add(x, x), B = n.mul(h, x), m = n.mul(g, _), m = n.add(B, m), B = n.sub(M, m), m = n.add(M, m), m = n.mul(B, m), B = n.mul(A, B), x = n.mul(g, x), _ = n.mul(h, _), A = n.sub(K, _), A = n.mul(h, A), A = n.add(A, x), x = n.add(K, K), K = n.add(x, K), K = n.add(K, _), K = n.mul(K, A), m = n.add(m, K), _ = n.mul(S, I), _ = n.add(_, _), K = n.mul(_, A), B = n.sub(B, K), x = n.mul(_, M), x = n.add(x, x), x = n.add(x, x), new u(B, m, x);
+      return A = n.add(A, A), x = n.mul(E, I), x = n.add(x, x), B = n.mul(h, x), m = n.mul(p, _), m = n.add(B, m), B = n.sub(M, m), m = n.add(M, m), m = n.mul(B, m), B = n.mul(A, B), x = n.mul(p, x), _ = n.mul(h, _), A = n.sub(K, _), A = n.mul(h, A), A = n.add(A, x), x = n.add(K, K), K = n.add(x, K), K = n.add(K, _), K = n.mul(K, A), m = n.add(m, K), _ = n.mul(S, I), _ = n.add(_, _), K = n.mul(_, A), B = n.sub(B, K), x = n.mul(_, M), x = n.add(x, x), x = n.add(x, x), new u(B, m, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function rs(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: d, py: g, pz: E } = this, { px: S, py: I, pz: B } = h;
+      const { px: d, py: p, pz: E } = this, { px: S, py: I, pz: B } = h;
       let m = n.ZERO, x = n.ZERO, K = n.ZERO;
       const M = t.a, _ = n.mul(t.b, kn);
-      let A = n.mul(d, S), T = n.mul(g, I), R = n.mul(E, B), H = n.add(d, g), w = n.add(S, I);
-      H = n.mul(H, w), w = n.add(A, T), H = n.sub(H, w), w = n.add(d, E);
+      let A = n.mul(d, S), T = n.mul(p, I), R = n.mul(E, B), H = n.add(d, p), b = n.add(S, I);
+      H = n.mul(H, b), b = n.add(A, T), H = n.sub(H, b), b = n.add(d, E);
       let v = n.add(S, B);
-      return w = n.mul(w, v), v = n.add(A, R), w = n.sub(w, v), v = n.add(g, E), m = n.add(I, B), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), K = n.mul(M, w), m = n.mul(_, R), K = n.add(m, K), m = n.sub(T, K), K = n.add(T, K), x = n.mul(m, K), T = n.add(A, A), T = n.add(T, A), R = n.mul(M, R), w = n.mul(_, w), T = n.add(T, R), R = n.sub(A, R), R = n.mul(M, R), w = n.add(w, R), A = n.mul(T, w), x = n.add(x, A), A = n.mul(v, w), m = n.mul(H, m), m = n.sub(m, A), A = n.mul(H, T), K = n.mul(v, K), K = n.add(K, A), new u(m, x, K);
+      return b = n.mul(b, v), v = n.add(A, R), b = n.sub(b, v), v = n.add(p, E), m = n.add(I, B), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), K = n.mul(M, b), m = n.mul(_, R), K = n.add(m, K), m = n.sub(T, K), K = n.add(T, K), x = n.mul(m, K), T = n.add(A, A), T = n.add(T, A), R = n.mul(M, R), b = n.mul(_, b), T = n.add(T, R), R = n.sub(A, R), R = n.mul(M, R), b = n.add(b, R), A = n.mul(T, b), x = n.add(x, A), A = n.mul(v, b), m = n.mul(H, m), m = n.sub(m, A), A = n.mul(H, T), K = n.mul(v, K), K = n.add(K, A), new u(m, x, K);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -926,9 +926,9 @@ function rs(e) {
       return this.equals(u.ZERO);
     }
     wNAF(h) {
-      return b.wNAFCached(this, l, h, (d) => {
-        const g = n.invertBatch(d.map((E) => E.pz));
-        return d.map((E, S) => E.toAffine(g[S])).map(u.fromAffine);
+      return w.wNAFCached(this, l, h, (d) => {
+        const p = n.invertBatch(d.map((E) => E.pz));
+        return d.map((E, S) => E.toAffine(p[S])).map(u.fromAffine);
       });
     }
     /**
@@ -942,13 +942,13 @@ function rs(e) {
         return d;
       if (c(h), h === X)
         return this;
-      const { endo: g } = t;
-      if (!g)
-        return b.unsafeLadder(this, h);
-      let { k1neg: E, k1: S, k2neg: I, k2: B } = g.splitScalar(h), m = d, x = d, K = this;
+      const { endo: p } = t;
+      if (!p)
+        return w.unsafeLadder(this, h);
+      let { k1neg: E, k1: S, k2neg: I, k2: B } = p.splitScalar(h), m = d, x = d, K = this;
       for (; S > ae || B > ae; )
         S & X && (m = m.add(K)), B & X && (x = x.add(K)), K = K.double(), S >>= X, B >>= X;
-      return E && (m = m.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, g.beta), x.py, x.pz), m.add(x);
+      return E && (m = m.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, p.beta), x.py, x.pz), m.add(x);
     }
     /**
      * Constant time multiplication.
@@ -961,17 +961,17 @@ function rs(e) {
      */
     multiply(h) {
       c(h);
-      let d = h, g, E;
+      let d = h, p, E;
       const { endo: S } = t;
       if (S) {
         const { k1neg: I, k1: B, k2neg: m, k2: x } = S.splitScalar(d);
         let { p: K, f: M } = this.wNAF(B), { p: _, f: A } = this.wNAF(x);
-        K = b.constTimeNegate(I, K), _ = b.constTimeNegate(m, _), _ = new u(n.mul(_.px, S.beta), _.py, _.pz), g = K.add(_), E = M.add(A);
+        K = w.constTimeNegate(I, K), _ = w.constTimeNegate(m, _), _ = new u(n.mul(_.px, S.beta), _.py, _.pz), p = K.add(_), E = M.add(A);
       } else {
         const { p: I, f: B } = this.wNAF(d);
-        g = I, E = B;
+        p = I, E = B;
       }
-      return u.normalizeZ([g, E])[0];
+      return u.normalizeZ([p, E])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -979,17 +979,17 @@ function rs(e) {
      * The trick could be useful if both P and Q are not G (not in our case).
      * @returns non-zero affine point
      */
-    multiplyAndAddUnsafe(h, d, g) {
-      const E = u.BASE, S = (B, m) => m === ae || m === X || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), I = S(this, d).add(S(h, g));
+    multiplyAndAddUnsafe(h, d, p) {
+      const E = u.BASE, S = (B, m) => m === ae || m === X || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), I = S(this, d).add(S(h, p));
       return I.is0() ? void 0 : I;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
     // (x, y, z) ∋ (x=x/z, y=y/z)
     toAffine(h) {
-      const { px: d, py: g, pz: E } = this, S = this.is0();
+      const { px: d, py: p, pz: E } = this, S = this.is0();
       h == null && (h = S ? n.ONE : n.inv(E));
-      const I = n.mul(d, h), B = n.mul(g, h), m = n.mul(E, h);
+      const I = n.mul(d, h), B = n.mul(p, h), m = n.mul(E, h);
       if (S)
         return { x: n.ZERO, y: n.ZERO };
       if (!n.eql(m, n.ONE))
@@ -1016,7 +1016,7 @@ function rs(e) {
     }
   }
   u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
-  const p = t.nBitLength, b = Qi(u, t.endo ? Math.ceil(p / 2) : p);
+  const g = t.nBitLength, w = Qi(u, t.endo ? Math.ceil(g / 2) : g);
   return {
     CURVE: t,
     ProjectivePoint: u,
@@ -1039,23 +1039,23 @@ function is(e) {
 }
 function ss(e) {
   const t = is(e), { Fp: n, n: r } = t, i = n.BYTES + 1, s = 2 * n.BYTES + 1;
-  function o(w) {
-    return ae < w && w < n.ORDER;
+  function o(b) {
+    return ae < b && b < n.ORDER;
   }
-  function c(w) {
-    return W(w, r);
+  function c(b) {
+    return W(b, r);
   }
-  function a(w) {
-    return Tt(w, r);
+  function a(b) {
+    return Tt(b, r);
   }
-  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: p } = rs({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: g } = rs({
     ...t,
-    toBytes(w, v, N) {
+    toBytes(b, v, N) {
       const k = v.toAffine(), C = n.toBytes(k.x), U = _e;
       return N ? U(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : U(Uint8Array.from([4]), C, n.toBytes(k.y));
     },
-    fromBytes(w) {
-      const v = w.length, N = w[0], k = w.subarray(1);
+    fromBytes(b) {
+      const v = b.length, N = b[0], k = b.subarray(1);
       if (v === i && (N === 2 || N === 3)) {
         const C = F(k);
         if (!o(C))
@@ -1070,38 +1070,38 @@ function ss(e) {
       } else
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${s} uncompressed bytes`);
     }
-  }), b = (w) => De(Ne(w, t.nByteLength));
-  function y(w) {
+  }), w = (b) => De(Ne(b, t.nByteLength));
+  function y(b) {
     const v = r >> X;
-    return w > v;
+    return b > v;
   }
-  function h(w) {
-    return y(w) ? c(-w) : w;
+  function h(b) {
+    return y(b) ? c(-b) : b;
   }
-  const d = (w, v, N) => F(w.slice(v, N));
-  class g {
+  const d = (b, v, N) => F(b.slice(v, N));
+  class p {
     constructor(v, N, k) {
       this.r = v, this.s = N, this.recovery = k, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
       const N = t.nByteLength;
-      return v = Z("compactSignature", v, N * 2), new g(d(v, 0, N), d(v, N, 2 * N));
+      return v = Z("compactSignature", v, N * 2), new p(d(v, 0, N), d(v, N, 2 * N));
     }
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
     static fromDER(v) {
       const { r: N, s: k } = Be.toSig(Z("DER", v));
-      return new g(N, k);
+      return new p(N, k);
     }
     assertValidity() {
-      if (!p(this.r))
+      if (!g(this.r))
         throw new Error("r must be 0 < r < CURVE.n");
-      if (!p(this.s))
+      if (!g(this.s))
         throw new Error("s must be 0 < s < CURVE.n");
     }
     addRecoveryBit(v) {
-      return new g(this.r, this.s, v);
+      return new p(this.r, this.s, v);
     }
     recoverPublicKey(v) {
       const { r: N, s: k, recovery: C } = this, U = x(Z("msgHash", v));
@@ -1110,7 +1110,7 @@ function ss(e) {
       const O = C === 2 || C === 3 ? N + t.n : N;
       if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const $ = C & 1 ? "03" : "02", ee = l.fromHex($ + b(O)), ge = a(O), Ue = c(-U * ge), We = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(ee, Ue, We);
+      const $ = C & 1 ? "03" : "02", ee = l.fromHex($ + w(O)), ge = a(O), Ue = c(-U * ge), We = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(ee, Ue, We);
       if (!we)
         throw new Error("point at infinify");
       return we.assertValidity(), we;
@@ -1120,7 +1120,7 @@ function ss(e) {
       return y(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new g(this.r, c(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new p(this.r, c(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
@@ -1134,13 +1134,13 @@ function ss(e) {
       return je(this.toCompactHex());
     }
     toCompactHex() {
-      return b(this.r) + b(this.s);
+      return w(this.r) + w(this.s);
     }
   }
   const E = {
-    isValidPrivateKey(w) {
+    isValidPrivateKey(b) {
       try {
-        return f(w), !0;
+        return f(b), !0;
       } catch {
         return !1;
       }
@@ -1151,8 +1151,8 @@ function ss(e) {
      * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
      */
     randomPrivateKey: () => {
-      const w = Qn(t.n);
-      return Yi(t.randomBytes(w), t.n);
+      const b = Qn(t.n);
+      return Yi(t.randomBytes(b), t.n);
     },
     /**
      * Creates precompute table for an arbitrary EC point. Makes point "cached".
@@ -1162,44 +1162,44 @@ function ss(e) {
      * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
      * fast.multiply(privKey); // much faster ECDH now
      */
-    precompute(w = 8, v = l.BASE) {
-      return v._setWindowSize(w), v.multiply(BigInt(3)), v;
+    precompute(b = 8, v = l.BASE) {
+      return v._setWindowSize(b), v.multiply(BigInt(3)), v;
     }
   };
-  function S(w, v = !0) {
-    return l.fromPrivateKey(w).toRawBytes(v);
+  function S(b, v = !0) {
+    return l.fromPrivateKey(b).toRawBytes(v);
   }
-  function I(w) {
-    const v = w instanceof Uint8Array, N = typeof w == "string", k = (v || N) && w.length;
-    return v ? k === i || k === s : N ? k === 2 * i || k === 2 * s : w instanceof l;
+  function I(b) {
+    const v = b instanceof Uint8Array, N = typeof b == "string", k = (v || N) && b.length;
+    return v ? k === i || k === s : N ? k === 2 * i || k === 2 * s : b instanceof l;
   }
-  function B(w, v, N = !0) {
-    if (I(w))
+  function B(b, v, N = !0) {
+    if (I(b))
       throw new Error("first arg must be private key");
     if (!I(v))
       throw new Error("second arg must be public key");
-    return l.fromHex(v).multiply(f(w)).toRawBytes(N);
+    return l.fromHex(v).multiply(f(b)).toRawBytes(N);
   }
-  const m = t.bits2int || function(w) {
-    const v = F(w), N = w.length * 8 - t.nBitLength;
+  const m = t.bits2int || function(b) {
+    const v = F(b), N = b.length * 8 - t.nBitLength;
     return N > 0 ? v >> BigInt(N) : v;
-  }, x = t.bits2int_modN || function(w) {
-    return c(m(w));
+  }, x = t.bits2int_modN || function(b) {
+    return c(m(b));
   }, K = Jt(t.nBitLength);
-  function M(w) {
-    if (typeof w != "bigint")
+  function M(b) {
+    if (typeof b != "bigint")
       throw new Error("bigint expected");
-    if (!(ae <= w && w < K))
+    if (!(ae <= b && b < K))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
-    return Ne(w, t.nByteLength);
+    return Ne(b, t.nByteLength);
   }
-  function _(w, v, N = A) {
+  function _(b, v, N = A) {
     if (["recovered", "canonical"].some((Ae) => Ae in N))
       throw new Error("sign() legacy options not supported");
     const { hash: k, randomBytes: C } = t;
     let { lowS: U, prehash: O, extraEntropy: $ } = N;
-    U == null && (U = !0), w = Z("msgHash", w), O && (w = Z("prehashed msgHash", k(w)));
-    const ee = x(w), ge = f(v), Ue = [M(ge), M(ee)];
+    U == null && (U = !0), b = Z("msgHash", b), O && (b = Z("prehashed msgHash", k(b)));
+    const ee = x(b), ge = f(v), Ue = [M(ge), M(ee)];
     if ($ != null) {
       const Ae = $ === !0 ? C(n.BYTES) : $;
       Ue.push(Z("extraEntropy", Ae));
@@ -1207,7 +1207,7 @@ function ss(e) {
     const We = _e(...Ue), we = ee;
     function Et(Ae) {
       const Le = m(Ae);
-      if (!p(Le))
+      if (!g(Le))
         return;
       const xn = a(Le), $e = l.BASE.multiply(Le).toAffine(), te = c($e.x);
       if (te === ae)
@@ -1216,19 +1216,19 @@ function ss(e) {
       if (Te === ae)
         return;
       let Kn = ($e.x === te ? 0 : 2) | Number($e.y & X), Nn = Te;
-      return U && y(Te) && (Nn = h(Te), Kn ^= 1), new g(te, Nn, Kn);
+      return U && y(Te) && (Nn = h(Te), Kn ^= 1), new p(te, Nn, Kn);
     }
     return { seed: We, k2sig: Et };
   }
   const A = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
-  function R(w, v, N = A) {
-    const { seed: k, k2sig: C } = _(w, v, N), U = t;
+  function R(b, v, N = A) {
+    const { seed: k, k2sig: C } = _(b, v, N), U = t;
     return Jn(U.hash.outputLen, U.nByteLength, U.hmac)(k, C);
   }
   l.BASE._setWindowSize(8);
-  function H(w, v, N, k = T) {
+  function H(b, v, N, k = T) {
     var $e;
-    const C = w;
+    const C = b;
     if (v = Z("msgHash", v), N = Z("publicKey", N), "strict" in k)
       throw new Error("options.strict was renamed to lowS");
     const { lowS: U, prehash: O } = k;
@@ -1236,15 +1236,15 @@ function ss(e) {
     try {
       if (typeof C == "string" || C instanceof Uint8Array)
         try {
-          $ = g.fromDER(C);
+          $ = p.fromDER(C);
         } catch (te) {
           if (!(te instanceof Be.Err))
             throw te;
-          $ = g.fromCompact(C);
+          $ = p.fromCompact(C);
         }
       else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
         const { r: te, s: Te } = C;
-        $ = new g(te, Te);
+        $ = new p(te, Te);
       } else
         throw new Error("PARSE");
       ee = l.fromHex(N);
@@ -1266,7 +1266,7 @@ function ss(e) {
     sign: R,
     verify: H,
     ProjectivePoint: l,
-    Signature: g,
+    Signature: p,
     utils: E
   };
 }
@@ -1322,7 +1322,7 @@ function as(e, t) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const ct = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), rr = BigInt(1), nt = BigInt(2), _n = (e, t) => (e + t / nt) / t;
 function ir(e) {
-  const t = ct, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = Y(f, n, t) * f % t, p = Y(u, n, t) * f % t, b = Y(p, nt, t) * l % t, y = Y(b, i, t) * b % t, h = Y(y, s, t) * y % t, d = Y(h, c, t) * h % t, g = Y(d, a, t) * d % t, E = Y(g, c, t) * h % t, S = Y(E, n, t) * f % t, I = Y(S, o, t) * y % t, B = Y(I, r, t) * l % t, m = Y(B, nt, t);
+  const t = ct, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = Y(f, n, t) * f % t, g = Y(u, n, t) * f % t, w = Y(g, nt, t) * l % t, y = Y(w, i, t) * w % t, h = Y(y, s, t) * y % t, d = Y(h, c, t) * h % t, p = Y(d, a, t) * d % t, E = Y(p, c, t) * h % t, S = Y(E, n, t) * f % t, I = Y(S, o, t) * y % t, B = Y(I, r, t) * l % t, m = Y(B, nt, t);
   if (!Rt.eql(Rt.sqr(m), e))
     throw new Error("Cannot find square root");
   return m;
@@ -1348,10 +1348,10 @@ const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), Ie = as({
     splitScalar: (e) => {
       const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -rr * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = _n(s * e, t), a = _n(-r * e, t);
       let l = W(e - c * n - a * i, t), f = W(-c * r - a * s, t);
-      const u = l > o, p = f > o;
-      if (u && (l = t - l), p && (f = t - f), l > o || f > o)
+      const u = l > o, g = f > o;
+      if (u && (l = t - l), g && (f = t - f), l > o || f > o)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
-      return { k1neg: u, k1: l, k2neg: p, k2: f };
+      return { k1neg: u, k1: l, k2neg: g, k2: f };
     }
   }
 }, Lt), ut = BigInt(0), sr = (e) => typeof e == "bigint" && ut < e && e < ct, cs = (e) => typeof e == "bigint" && ut < e && e < tt, In = {};
@@ -1387,10 +1387,10 @@ function fs(e, t, n = Zn(32)) {
   const r = Z("message", e), { bytes: i, scalar: s } = Pt(t), o = Z("auxRand", n, 32), c = Ot(s ^ F(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Fe(F(a));
   if (l === ut)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Pt(l), p = ar(f, i, r), b = new Uint8Array(64);
-  if (b.set(f, 0), b.set(Ot(Fe(u + p * s)), 32), !cr(b, r, i))
+  const { bytes: f, scalar: u } = Pt(l), g = ar(f, i, r), w = new Uint8Array(64);
+  if (w.set(f, 0), w.set(Ot(Fe(u + g * s)), 32), !cr(w, r, i))
     throw new Error("sign: Invalid signature produced");
-  return b;
+  return w;
 }
 function cr(e, t, n) {
   const r = Z("signature", e, 64), i = Z("message", t), s = Z("publicKey", n, 32);
@@ -1669,13 +1669,13 @@ class dr extends ms {
     for (let u = 0; u < 16; u++, n += 4)
       Ee[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const p = Ee[u - 15], b = Ee[u - 2], y = ie(p, 7) ^ ie(p, 18) ^ p >>> 3, h = ie(b, 17) ^ ie(b, 19) ^ b >>> 10;
+      const g = Ee[u - 15], w = Ee[u - 2], y = ie(g, 7) ^ ie(g, 18) ^ g >>> 3, h = ie(w, 17) ^ ie(w, 19) ^ w >>> 10;
       Ee[u] = h + Ee[u - 7] + y + Ee[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const p = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), b = f + p + Es(c, a, l) + Ks[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + xs(r, i, s) | 0;
-      f = l, l = a, a = c, c = o + b | 0, o = s, s = i, i = r, r = b + h | 0;
+      const g = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), w = f + g + Es(c, a, l) + Ks[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + xs(r, i, s) | 0;
+      f = l, l = a, a = c, c = o + w | 0, o = s, s = i, i = r, r = w + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
   }
@@ -1937,14 +1937,14 @@ function Rn(e, t, n = 1) {
 }
 function gr(e) {
   const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, s = Ln(r);
-  function o(f, u, p = 90) {
+  function o(f, u, g = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
     if (!Array.isArray(u) || u.length && typeof u[0] != "number")
       throw new Error(`bech32.encode words should be array of numbers, not ${typeof u}`);
-    const b = f.length + 7 + u.length;
-    if (p !== !1 && b > p)
-      throw new TypeError(`Length ${b} exceeds limit ${p}`);
+    const w = f.length + 7 + u.length;
+    if (g !== !1 && w > g)
+      throw new TypeError(`Length ${w} exceeds limit ${g}`);
     return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${Rn(f, u, t)}`;
   }
   function c(f, u = 90) {
@@ -1952,25 +1952,25 @@ function gr(e) {
       throw new Error(`bech32.decode input should be string, not ${typeof f}`);
     if (f.length < 8 || u !== !1 && f.length > u)
       throw new TypeError(`Wrong string length: ${f.length} (${f}). Expected (8..${u})`);
-    const p = f.toLowerCase();
-    if (f !== p && f !== f.toUpperCase())
+    const g = f.toLowerCase();
+    if (f !== g && f !== f.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
-    f = p;
-    const b = f.lastIndexOf("1");
-    if (b === 0 || b === -1)
+    f = g;
+    const w = f.lastIndexOf("1");
+    if (w === 0 || w === -1)
       throw new Error('Letter "1" must be present between prefix and data only');
-    const y = f.slice(0, b), h = f.slice(b + 1);
+    const y = f.slice(0, w), h = f.slice(w + 1);
     if (h.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const d = Dt.decode(h).slice(0, -6), g = Rn(y, d, t);
-    if (!h.endsWith(g))
-      throw new Error(`Invalid checksum in ${f}: expected "${g}"`);
+    const d = Dt.decode(h).slice(0, -6), p = Rn(y, d, t);
+    if (!h.endsWith(p))
+      throw new Error(`Invalid checksum in ${f}: expected "${p}"`);
     return { prefix: y, words: d };
   }
   const a = Ln(c);
   function l(f) {
-    const { prefix: u, words: p } = c(f, !1);
-    return { prefix: u, words: p, bytes: r(p) };
+    const { prefix: u, words: g } = c(f, !1);
+    return { prefix: u, words: g, bytes: r(g) };
   }
   return { encode: o, decode: c, decodeToBytes: l, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
@@ -2104,11 +2104,11 @@ function Pn(e, t, n, r, i) {
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
   for (let y = 0; y < l; y++) {
-    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), g = e[a++] ^ xe(o, c, r, i, t, n), E = e[a++] ^ xe(o, c, i, t, n, r);
-    t = h, n = d, r = g, i = E;
+    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), p = e[a++] ^ xe(o, c, r, i, t, n), E = e[a++] ^ xe(o, c, i, t, n, r);
+    t = h, n = d, r = p, i = E;
   }
-  const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), p = e[a++] ^ oe(s, r, i, t, n), b = e[a++] ^ oe(s, i, t, n, r);
-  return { s0: f, s1: u, s2: p, s3: b };
+  const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), g = e[a++] ^ oe(s, r, i, t, n), w = e[a++] ^ oe(s, i, t, n, r);
+  return { s0: f, s1: u, s2: g, s3: w };
 }
 function js(e, t, n, r, i) {
   const { sbox2: s, T01: o, T23: c } = br;
@@ -2116,11 +2116,11 @@ function js(e, t, n, r, i) {
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
   for (let y = 0; y < l; y++) {
-    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), g = e[a++] ^ xe(o, c, r, n, t, i), E = e[a++] ^ xe(o, c, i, r, n, t);
-    t = h, n = d, r = g, i = E;
+    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), p = e[a++] ^ xe(o, c, r, n, t, i), E = e[a++] ^ xe(o, c, i, r, n, t);
+    t = h, n = d, r = p, i = E;
   }
-  const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), p = e[a++] ^ oe(s, r, n, t, i), b = e[a++] ^ oe(s, i, r, n, t);
-  return { s0: f, s1: u, s2: p, s3: b };
+  const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), g = e[a++] ^ oe(s, r, n, t, i), w = e[a++] ^ oe(s, i, r, n, t);
+  return { s0: f, s1: u, s2: g, s3: w };
 }
 function mr(e, t) {
   if (!t)
@@ -2175,24 +2175,24 @@ const Er = /* @__PURE__ */ Os({ blockSize: 16, nonceLength: 16 }, function(t, n,
   return {
     encrypt: (s, o) => {
       const c = vr(t), { b: a, o: l, out: f } = Vs(s, i, o), u = G(n);
-      let p = u[0], b = u[1], y = u[2], h = u[3], d = 0;
+      let g = u[0], w = u[1], y = u[2], h = u[3], d = 0;
       for (; d + 4 <= a.length; )
-        p ^= a[d + 0], b ^= a[d + 1], y ^= a[d + 2], h ^= a[d + 3], { s0: p, s1: b, s2: y, s3: h } = Pn(c, p, b, y, h), l[d++] = p, l[d++] = b, l[d++] = y, l[d++] = h;
+        g ^= a[d + 0], w ^= a[d + 1], y ^= a[d + 2], h ^= a[d + 3], { s0: g, s1: w, s2: y, s3: h } = Pn(c, g, w, y, h), l[d++] = g, l[d++] = w, l[d++] = y, l[d++] = h;
       if (i) {
-        const g = Zs(s.subarray(d * 4));
-        p ^= g[0], b ^= g[1], y ^= g[2], h ^= g[3], { s0: p, s1: b, s2: y, s3: h } = Pn(c, p, b, y, h), l[d++] = p, l[d++] = b, l[d++] = y, l[d++] = h;
+        const p = Zs(s.subarray(d * 4));
+        g ^= p[0], w ^= p[1], y ^= p[2], h ^= p[3], { s0: g, s1: w, s2: y, s3: h } = Pn(c, g, w, y, h), l[d++] = g, l[d++] = w, l[d++] = y, l[d++] = h;
       }
       return c.fill(0), f;
     },
     decrypt: (s, o) => {
       zs(s);
       const c = Ds(t), a = G(n), l = mr(s.length, o), f = G(s), u = G(l);
-      let p = a[0], b = a[1], y = a[2], h = a[3];
+      let g = a[0], w = a[1], y = a[2], h = a[3];
       for (let d = 0; d + 4 <= f.length; ) {
-        const g = p, E = b, S = y, I = h;
-        p = f[d + 0], b = f[d + 1], y = f[d + 2], h = f[d + 3];
-        const { s0: B, s1: m, s2: x, s3: K } = js(c, p, b, y, h);
-        u[d++] = B ^ g, u[d++] = m ^ E, u[d++] = x ^ S, u[d++] = K ^ I;
+        const p = g, E = w, S = y, I = h;
+        g = f[d + 0], w = f[d + 1], y = f[d + 2], h = f[d + 3];
+        const { s0: B, s1: m, s2: x, s3: K } = js(c, g, w, y, h);
+        u[d++] = B ^ p, u[d++] = m ^ E, u[d++] = x ^ S, u[d++] = K ^ I;
       }
       return c.fill(0), Ws(l, i);
     }
@@ -2207,7 +2207,7 @@ function zt(e) {
 }
 const Xe = 64, Ys = 16, Nr = 2 ** 32 - 1, Mn = new Uint32Array();
 function Xs(e, t, n, r, i, s, o, c) {
-  const a = i.length, l = new Uint8Array(Xe), f = G(l), u = zt(i) && zt(s), p = u ? G(i) : Mn, b = u ? G(s) : Mn;
+  const a = i.length, l = new Uint8Array(Xe), f = G(l), u = zt(i) && zt(s), g = u ? G(i) : Mn, w = u ? G(s) : Mn;
   for (let y = 0; y < a; o++) {
     if (e(t, n, r, f, o, c), o >= Nr)
       throw new Error("arx: counter overflow");
@@ -2216,13 +2216,13 @@ function Xs(e, t, n, r, i, s, o, c) {
       const d = y / 4;
       if (y % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let g = 0, E; g < Ys; g++)
-        E = d + g, b[E] = p[E] ^ f[g];
+      for (let p = 0, E; p < Ys; p++)
+        E = d + p, w[E] = g[E] ^ f[p];
       y += Xe;
       continue;
     }
-    for (let d = 0, g; d < h; d++)
-      g = y + d, s[g] = i[g] ^ l[d];
+    for (let d = 0, p; d < h; d++)
+      p = y + d, s[p] = i[p] ^ l[d];
     y += h;
   }
 }
@@ -2232,45 +2232,45 @@ function Qs(e, t) {
     throw new Error("core must be a function");
   return kt(i), kt(o), On(s), On(n), (c, a, l, f, u = 0) => {
     ce(c), ce(a), ce(l);
-    const p = l.length;
-    if (f || (f = new Uint8Array(p)), ce(f), kt(u), u < 0 || u >= Nr)
+    const g = l.length;
+    if (f || (f = new Uint8Array(g)), ce(f), kt(u), u < 0 || u >= Nr)
       throw new Error("arx: counter overflow");
-    if (f.length < p)
-      throw new Error(`arx: output (${f.length}) is shorter than data (${p})`);
-    const b = [];
+    if (f.length < g)
+      throw new Error(`arx: output (${f.length}) is shorter than data (${g})`);
+    const w = [];
     let y = c.length, h, d;
     if (y === 32)
-      h = c.slice(), b.push(h), d = Kr;
+      h = c.slice(), w.push(h), d = Kr;
     else if (y === 16 && n)
-      h = new Uint8Array(32), h.set(c), h.set(c, 16), d = Js, b.push(h);
+      h = new Uint8Array(32), h.set(c), h.set(c, 16), d = Js, w.push(h);
     else
       throw new Error(`arx: invalid 32-byte key, got length=${y}`);
-    zt(a) || (a = a.slice(), b.push(a));
-    const g = G(h);
+    zt(a) || (a = a.slice(), w.push(a));
+    const p = G(h);
     if (r) {
       if (a.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(d, g, G(a.subarray(0, 16)), g), a = a.subarray(16);
+      r(d, p, G(a.subarray(0, 16)), p), a = a.subarray(16);
     }
     const E = 16 - i;
     if (E !== a.length)
       throw new Error(`arx: nonce must be ${E} or 16 bytes`);
     if (E !== 12) {
       const I = new Uint8Array(12);
-      I.set(a, s ? 0 : 12 - a.length), a = I, b.push(a);
+      I.set(a, s ? 0 : 12 - a.length), a = I, w.push(a);
     }
     const S = G(a);
-    for (Xs(e, d, g, S, l, f, u, o); b.length > 0; )
-      b.pop().fill(0);
+    for (Xs(e, d, p, S, l, f, u, o); w.length > 0; )
+      w.pop().fill(0);
     return f;
   };
 }
 function eo(e, t, n, r, i, s = 20) {
-  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], p = t[2], b = t[3], y = t[4], h = t[5], d = t[6], g = t[7], E = i, S = n[0], I = n[1], B = n[2], m = o, x = c, K = a, M = l, _ = f, A = u, T = p, R = b, H = y, w = h, v = d, N = g, k = E, C = S, U = I, O = B;
+  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], g = t[2], w = t[3], y = t[4], h = t[5], d = t[6], p = t[7], E = i, S = n[0], I = n[1], B = n[2], m = o, x = c, K = a, M = l, _ = f, A = u, T = g, R = w, H = y, b = h, v = d, N = p, k = E, C = S, U = I, O = B;
   for (let ee = 0; ee < s; ee += 2)
-    m = m + _ | 0, k = L(k ^ m, 16), H = H + k | 0, _ = L(_ ^ H, 12), m = m + _ | 0, k = L(k ^ m, 8), H = H + k | 0, _ = L(_ ^ H, 7), x = x + A | 0, C = L(C ^ x, 16), w = w + C | 0, A = L(A ^ w, 12), x = x + A | 0, C = L(C ^ x, 8), w = w + C | 0, A = L(A ^ w, 7), K = K + T | 0, U = L(U ^ K, 16), v = v + U | 0, T = L(T ^ v, 12), K = K + T | 0, U = L(U ^ K, 8), v = v + U | 0, T = L(T ^ v, 7), M = M + R | 0, O = L(O ^ M, 16), N = N + O | 0, R = L(R ^ N, 12), M = M + R | 0, O = L(O ^ M, 8), N = N + O | 0, R = L(R ^ N, 7), m = m + A | 0, O = L(O ^ m, 16), v = v + O | 0, A = L(A ^ v, 12), m = m + A | 0, O = L(O ^ m, 8), v = v + O | 0, A = L(A ^ v, 7), x = x + T | 0, k = L(k ^ x, 16), N = N + k | 0, T = L(T ^ N, 12), x = x + T | 0, k = L(k ^ x, 8), N = N + k | 0, T = L(T ^ N, 7), K = K + R | 0, C = L(C ^ K, 16), H = H + C | 0, R = L(R ^ H, 12), K = K + R | 0, C = L(C ^ K, 8), H = H + C | 0, R = L(R ^ H, 7), M = M + _ | 0, U = L(U ^ M, 16), w = w + U | 0, _ = L(_ ^ w, 12), M = M + _ | 0, U = L(U ^ M, 8), w = w + U | 0, _ = L(_ ^ w, 7);
+    m = m + _ | 0, k = L(k ^ m, 16), H = H + k | 0, _ = L(_ ^ H, 12), m = m + _ | 0, k = L(k ^ m, 8), H = H + k | 0, _ = L(_ ^ H, 7), x = x + A | 0, C = L(C ^ x, 16), b = b + C | 0, A = L(A ^ b, 12), x = x + A | 0, C = L(C ^ x, 8), b = b + C | 0, A = L(A ^ b, 7), K = K + T | 0, U = L(U ^ K, 16), v = v + U | 0, T = L(T ^ v, 12), K = K + T | 0, U = L(U ^ K, 8), v = v + U | 0, T = L(T ^ v, 7), M = M + R | 0, O = L(O ^ M, 16), N = N + O | 0, R = L(R ^ N, 12), M = M + R | 0, O = L(O ^ M, 8), N = N + O | 0, R = L(R ^ N, 7), m = m + A | 0, O = L(O ^ m, 16), v = v + O | 0, A = L(A ^ v, 12), m = m + A | 0, O = L(O ^ m, 8), v = v + O | 0, A = L(A ^ v, 7), x = x + T | 0, k = L(k ^ x, 16), N = N + k | 0, T = L(T ^ N, 12), x = x + T | 0, k = L(k ^ x, 8), N = N + k | 0, T = L(T ^ N, 7), K = K + R | 0, C = L(C ^ K, 16), H = H + C | 0, R = L(R ^ H, 12), K = K + R | 0, C = L(C ^ K, 8), H = H + C | 0, R = L(R ^ H, 7), M = M + _ | 0, U = L(U ^ M, 16), b = b + U | 0, _ = L(_ ^ b, 12), M = M + _ | 0, U = L(U ^ M, 8), b = b + U | 0, _ = L(_ ^ b, 7);
   let $ = 0;
-  r[$++] = o + m | 0, r[$++] = c + x | 0, r[$++] = a + K | 0, r[$++] = l + M | 0, r[$++] = f + _ | 0, r[$++] = u + A | 0, r[$++] = p + T | 0, r[$++] = b + R | 0, r[$++] = y + H | 0, r[$++] = h + w | 0, r[$++] = d + v | 0, r[$++] = g + N | 0, r[$++] = E + k | 0, r[$++] = S + C | 0, r[$++] = I + U | 0, r[$++] = B + O | 0;
+  r[$++] = o + m | 0, r[$++] = c + x | 0, r[$++] = a + K | 0, r[$++] = l + M | 0, r[$++] = f + _ | 0, r[$++] = u + A | 0, r[$++] = g + T | 0, r[$++] = w + R | 0, r[$++] = y + H | 0, r[$++] = h + b | 0, r[$++] = d + v | 0, r[$++] = p + N | 0, r[$++] = E + k | 0, r[$++] = S + C | 0, r[$++] = I + U | 0, r[$++] = B + O | 0;
 }
 const Sr = /* @__PURE__ */ Qs(eo, {
   counterRight: !1,
@@ -2651,7 +2651,7 @@ function gt(e) {
         type: "nprofile",
         data: {
           pubkey: P(u[0][0]),
-          relays: u[1] ? u[1].map((p) => ue.decode(p)) : []
+          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
         }
       };
     }
@@ -2669,7 +2669,7 @@ function gt(e) {
         type: "nevent",
         data: {
           id: P(u[0][0]),
-          relays: u[1] ? u[1].map((p) => ue.decode(p)) : [],
+          relays: u[1] ? u[1].map((g) => ue.decode(g)) : [],
           author: (o = u[2]) != null && o[0] ? P(u[2][0]) : void 0,
           kind: (c = u[3]) != null && c[0] ? parseInt(P(u[3][0]), 16) : void 0
         }
@@ -2693,7 +2693,7 @@ function gt(e) {
           identifier: ue.decode(u[0][0]),
           pubkey: P(u[2][0]),
           kind: parseInt(P(u[3][0]), 16),
-          relays: u[1] ? u[1].map((p) => ue.decode(p)) : []
+          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
         }
       };
     }
@@ -3579,7 +3579,7 @@ async function wi(e, t, n, r) {
     throw new Error("Invalid nostr event, payload tag does not match request body hash");
   return !0;
 }
-const Oe = 30078, Dn = 30078, jn = 1059, Gc = 14, au = 100, Fc = 1;
+const Oe = 1060, Dn = 30078, jn = 1059, Gc = 14, au = 100, Fc = 1;
 function cu(e) {
   return JSON.stringify({
     version: Fc,
@@ -3733,7 +3733,7 @@ class st {
     const c = ke(), [a, l] = Pe(s, q.getConversationKey(c, n), 2);
     let f, u;
     i ? (f = { publicKey: le(r), privateKey: r }, u = { publicKey: le(c), privateKey: c }) : u = { publicKey: le(r), privateKey: r };
-    const p = {
+    const g = {
       rootKey: i ? a : s,
       theirNextNostrPublicKey: n,
       ourCurrentNostrKey: f,
@@ -3744,8 +3744,8 @@ class st {
       receivingChainMessageNumber: 0,
       previousSendingChainMessageCount: 0,
       skippedKeys: {}
-    }, b = new st(t, p);
-    return o && (b.name = o), b;
+    }, w = new st(t, g);
+    return o && (w.name = o), w;
   }
   /**
    * Sends a text message through the encrypted session.
@@ -4079,18 +4079,18 @@ class Me {
        * so the inviter can create the session on their side.
        */
   async accept(t, n, r) {
-    const i = ke(), s = le(i), o = this.inviter || this.inviterEphemeralPublicKey, c = z(this.sharedSecret), a = st.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), f = await (typeof r == "function" ? r : (h, d) => Promise.resolve(q.encrypt(h, Qe(r, d))))(s, o), u = {
+    const i = ke(), s = le(i), o = this.inviter || this.inviterEphemeralPublicKey, c = z(this.sharedSecret), a = st.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), f = await (typeof r == "function" ? r : (d, p) => Promise.resolve(q.encrypt(d, Qe(r, p))))(s, o), u = {
       pubkey: n,
       content: await q.encrypt(f, c),
       created_at: Math.floor(Date.now() / 1e3)
-    }, p = ke(), b = le(p), y = {
+    }, g = JSON.stringify(u), w = ke(), y = le(w), h = {
       kind: jn,
-      pubkey: b,
-      content: q.encrypt(JSON.stringify(u), Qe(p, this.inviterEphemeralPublicKey)),
+      pubkey: y,
+      content: q.encrypt(g, Qe(w, this.inviterEphemeralPublicKey)),
       created_at: eu(),
       tags: [["p", this.inviterEphemeralPublicKey]]
     };
-    return { session: a, event: Q(y, p) };
+    return { session: a, event: Q(h, w) };
   }
   listen(t, n, r) {
     if (!this.inviterEphemeralPrivateKey)
@@ -4107,7 +4107,7 @@ class Me {
         }
         const o = await q.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o), a = z(this.sharedSecret), l = c.pubkey;
         this.usedBy.push(l);
-        const f = await q.decrypt(c.content, a), p = await (typeof t == "function" ? t : (h, d) => Promise.resolve(q.decrypt(h, Qe(t, d))))(f, l), b = s.id, y = st.init(n, p, this.inviterEphemeralPrivateKey, !1, a, b);
+        const f = await q.decrypt(c.content, a), g = await (typeof t == "function" ? t : (h, d) => Promise.resolve(q.decrypt(h, Qe(t, d))))(f, l), w = s.id, y = st.init(n, g, this.inviterEphemeralPrivateKey, !1, a, w);
         r(y, l);
       } catch (o) {
         console.error("Error processing invite message:", o, "event", s);