nostr-double-ratchet 0.0.32 → 0.0.34

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

@@ -1,6 +1,6 @@
-var Ni = Object.defineProperty;
-var Ki = (e, t, n) => t in e ? Ni(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var J = (e, t, n) => Ki(e, typeof t != "symbol" ? t + "" : t, n);
+var Ki = Object.defineProperty;
+var Ni = (e, t, n) => t in e ? Ki(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var J = (e, t, n) => Ni(e, typeof t != "symbol" ? t + "" : t, n);
 function Bn(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
@@ -30,20 +30,20 @@ function Ai(e, t) {
 }
 const xt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Gn = (e) => e instanceof Uint8Array, Nt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Ci = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Gn = (e) => e instanceof Uint8Array, Kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Ci = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!Ci)
   throw new Error("Non little-endian hardware is not supported");
-function Bi(e) {
+function ki(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Wt(e) {
-  if (typeof e == "string" && (e = Bi(e)), !Gn(e))
+function Vt(e) {
+  if (typeof e == "string" && (e = ki(e)), !Gn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function ki(...e) {
+function Bi(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -59,7 +59,7 @@ let Jn = class {
   }
 };
 function Ii(e) {
-  const t = (r) => e().update(Wt(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 Yn(e = 32) {
@@ -75,17 +75,17 @@ function _i(e, t, n, r) {
 }
 let Ui = class extends Jn {
   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 = Nt(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 = Kt(this.buffer);
   }
   update(t) {
     et(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Wt(t);
+    t = Vt(t);
     const s = t.length;
     for (let o = 0; o < s; ) {
       const c = Math.min(i - this.pos, s - o);
       if (c === i) {
-        const a = Nt(t);
+        const a = Kt(t);
         for (; i <= s - o; o += i)
           this.process(a, o);
         continue;
@@ -102,7 +102,7 @@ let Ui = class extends Jn {
     for (let u = o; u < i; u++)
       n[u] = 0;
     _i(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const c = Nt(t), a = this.outputLen;
+    const c = Kt(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = a / 4, f = this.get();
@@ -214,12 +214,12 @@ let Ti = class extends Ui {
     for (let u = 0; u < 16; u++, n += 4)
       ve[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const p = ve[u - 15], w = ve[u - 2], g = re(p, 7) ^ re(p, 18) ^ p >>> 3, h = re(w, 17) ^ re(w, 19) ^ w >>> 10;
+      const y = ve[u - 15], w = ve[u - 2], g = re(y, 7) ^ re(y, 18) ^ y >>> 3, h = re(w, 17) ^ re(w, 19) ^ w >>> 10;
       ve[u] = h + ve[u - 7] + g + ve[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const p = re(c, 6) ^ re(c, 11) ^ re(c, 25), w = f + p + Li(c, a, l) + Ri[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + $i(r, i, s) | 0;
+      const y = re(c, 6) ^ re(c, 11) ^ re(c, 25), w = f + y + Li(c, a, l) + Ri[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + $i(r, i, s) | 0;
       f = l, l = a, a = c, c = o + w | 0, o = s, s = i, i = r, r = w + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
@@ -231,10 +231,10 @@ let Ti = class extends Ui {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const Lt = /* @__PURE__ */ Ii(() => new Ti());
+const $t = /* @__PURE__ */ Ii(() => new Ti());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Xn = BigInt(0), at = BigInt(1), Oi = BigInt(2), ct = (e) => e instanceof Uint8Array, Mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function De(e) {
+function qe(e) {
   if (!ct(e))
     throw new Error("Uint8Array expected");
   let t = "";
@@ -246,7 +246,7 @@ function Qn(e) {
   const t = e.toString(16);
   return t.length & 1 ? `0${t}` : t;
 }
-function Vt(e) {
+function Zt(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   return BigInt(e === "" ? "0" : `0x${e}`);
@@ -267,18 +267,18 @@ function je(e) {
   return n;
 }
 function G(e) {
-  return Vt(De(e));
+  return Zt(qe(e));
 }
-function Zt(e) {
+function Ft(e) {
   if (!ct(e))
     throw new Error("Uint8Array expected");
-  return Vt(De(Uint8Array.from(e).reverse()));
+  return Zt(qe(Uint8Array.from(e).reverse()));
 }
-function Ke(e, t) {
+function Ne(e, t) {
   return je(e.toString(16).padStart(t * 2, "0"));
 }
-function Ft(e, t) {
-  return Ke(e, t).reverse();
+function Gt(e, t) {
+  return Ne(e, t).reverse();
 }
 function Pi(e) {
   return je(Qn(e));
@@ -317,12 +317,12 @@ function Hi(e, t) {
       return !1;
   return !0;
 }
-function qi(e) {
+function Di(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Di(e) {
+function qi(e) {
   let t;
   for (t = 0; e > Xn; e >>= at, t += 1)
     ;
@@ -331,7 +331,7 @@ function Di(e) {
 function ji(e, t) {
   return e >> BigInt(t) & at;
 }
-const zi = (e, t, n) => e | (n ? at : Xn) << BigInt(t), Gt = (e) => (Oi << BigInt(e - 1)) - at, Kt = (e) => new Uint8Array(e), kn = (e) => Uint8Array.from(e);
+const zi = (e, t, n) => e | (n ? at : Xn) << BigInt(t), Jt = (e) => (Oi << BigInt(e - 1)) - at, Nt = (e) => new Uint8Array(e), In = (e) => Uint8Array.from(e);
 function er(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -339,27 +339,27 @@ function er(e, t, n) {
     throw new Error("qByteLen must be a number");
   if (typeof n != "function")
     throw new Error("hmacFn must be a function");
-  let r = Kt(e), i = Kt(e), s = 0;
+  let r = Nt(e), i = Nt(e), s = 0;
   const o = () => {
     r.fill(1), i.fill(0), s = 0;
-  }, c = (...u) => n(i, r, ...u), a = (u = Kt()) => {
-    i = c(kn([0]), u), r = c(), u.length !== 0 && (i = c(kn([1]), u), r = c());
+  }, c = (...u) => n(i, r, ...u), a = (u = Nt()) => {
+    i = c(In([0]), u), r = c(), u.length !== 0 && (i = c(In([1]), u), r = c());
   }, l = () => {
     if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
-    const p = [];
+    const y = [];
     for (; u < t; ) {
       r = c();
       const w = r.slice();
-      p.push(w), u += r.length;
+      y.push(w), u += r.length;
     }
-    return Ie(...p);
+    return Ie(...y);
   };
-  return (u, p) => {
+  return (u, y) => {
     o(), a(u);
     let w;
-    for (; !(w = p(l())); )
+    for (; !(w = y(l())); )
       a();
     return o(), w;
   };
@@ -393,27 +393,27 @@ function Ye(e, t, n = {}) {
 const Vi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   bitGet: ji,
-  bitLen: Di,
-  bitMask: Gt,
+  bitLen: qi,
+  bitMask: Jt,
   bitSet: zi,
-  bytesToHex: De,
+  bytesToHex: qe,
   bytesToNumberBE: G,
-  bytesToNumberLE: Zt,
+  bytesToNumberLE: Ft,
   concatBytes: Ie,
   createHmacDrbg: er,
   ensureBytes: Z,
   equalBytes: Hi,
   hexToBytes: je,
-  hexToNumber: Vt,
-  numberToBytesBE: Ke,
-  numberToBytesLE: Ft,
+  hexToNumber: Zt,
+  numberToBytesBE: Ne,
+  numberToBytesLE: Gt,
   numberToHexUnpadded: Qn,
   numberToVarBytesBE: Pi,
-  utf8ToBytes: qi,
+  utf8ToBytes: Di,
   validateObject: Ye
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const W = BigInt(0), z = BigInt(1), Ce = BigInt(2), Zi = BigInt(3), $t = BigInt(4), In = BigInt(5), _n = BigInt(8);
+const W = BigInt(0), z = BigInt(1), Ce = BigInt(2), Zi = BigInt(3), Rt = BigInt(4), _n = BigInt(5), Un = BigInt(8);
 BigInt(9);
 BigInt(16);
 function V(e, t) {
@@ -436,7 +436,7 @@ function Y(e, t, n) {
     r *= r, r %= n;
   return r;
 }
-function Rt(e, t) {
+function Tt(e, t) {
   if (e === W || t <= W)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
   let n = V(e, t), r = t, i = W, s = z;
@@ -456,7 +456,7 @@ function Gi(e) {
   for (i = Ce; i < e && Fi(i, t, e) !== e - z; i++)
     ;
   if (r === 1) {
-    const o = (e + z) / $t;
+    const o = (e + z) / Rt;
     return function(a, l) {
       const f = a.pow(l, o);
       if (!a.eql(a.sqr(f), l))
@@ -468,22 +468,22 @@ function Gi(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), y = c.pow(a, n);
+    for (; !c.eql(y, c.ONE); ) {
+      if (c.eql(y, c.ZERO))
         return c.ZERO;
       let w = 1;
-      for (let h = c.sqr(p); w < l && !c.eql(h, c.ONE); w++)
+      for (let h = c.sqr(y); w < l && !c.eql(h, c.ONE); w++)
         h = c.sqr(h);
       const g = c.pow(f, z << BigInt(l - w - 1));
-      f = c.sqr(g), u = c.mul(u, g), p = c.mul(p, f), l = w;
+      f = c.sqr(g), u = c.mul(u, g), y = c.mul(y, f), l = w;
     }
     return u;
   };
 }
 function Ji(e) {
-  if (e % $t === Zi) {
-    const t = (e + z) / $t;
+  if (e % Rt === Zi) {
+    const t = (e + z) / Rt;
     return function(r, i) {
       const s = r.pow(i, t);
       if (!r.eql(r.sqr(s), i))
@@ -491,8 +491,8 @@ function Ji(e) {
       return s;
     };
   }
-  if (e % _n === In) {
-    const t = (e - In) / _n;
+  if (e % Un === _n) {
+    const t = (e - _n) / Un;
     return function(r, i) {
       const s = r.mul(i, Ce), o = r.pow(s, t), c = r.mul(i, o), a = r.mul(r.mul(c, Ce), o), l = r.mul(c, r.sub(a, r.ONE));
       if (!r.eql(r.sqr(l), i))
@@ -560,7 +560,7 @@ function ts(e, t, n = !1, r = {}) {
     ORDER: e,
     BITS: i,
     BYTES: s,
-    MASK: Gt(i),
+    MASK: Jt(i),
     ZERO: W,
     ONE: z,
     create: (a) => V(a, e),
@@ -578,23 +578,23 @@ function ts(e, t, n = !1, r = {}) {
     sub: (a, l) => V(a - l, e),
     mul: (a, l) => V(a * l, e),
     pow: (a, l) => Qi(c, a, l),
-    div: (a, l) => V(a * 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) => o(c, a)),
     invertBatch: (a) => es(c, a),
     // TODO: do we really need constant cmov?
     // We don't have const-time bigints anyway, so probably will be not very useful
     cmov: (a, l, f) => f ? l : a,
-    toBytes: (a) => n ? Ft(a, s) : Ke(a, s),
+    toBytes: (a) => n ? Gt(a, s) : Ne(a, s),
     fromBytes: (a) => {
       if (a.length !== s)
         throw new Error(`Fp.fromBytes: expected ${s}, got ${a.length}`);
-      return n ? Zt(a) : G(a);
+      return n ? Ft(a) : G(a);
     }
   });
   return Object.freeze(c);
@@ -613,8 +613,8 @@ function ns(e, t, n = !1) {
   const r = e.length, i = nr(t), s = rr(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error(`expected ${s}-1024 bytes of input, got ${r}`);
-  const o = n ? G(e) : Zt(e), c = V(o, t - z) + z;
-  return n ? Ft(c, i) : Ke(c, i);
+  const o = n ? G(e) : Ft(e), c = V(o, t - z) + z;
+  return n ? Gt(c, i) : Ne(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const rs = BigInt(0), St = BigInt(1);
@@ -650,7 +650,7 @@ function is(e, t) {
       let l = i, f = l;
       for (let u = 0; u < o; u++) {
         f = l, a.push(f);
-        for (let p = 1; p < c; p++)
+        for (let y = 1; y < c; y++)
           f = f.add(l), a.push(f);
         l = f.double();
       }
@@ -666,13 +666,13 @@ function is(e, t) {
     wNAF(i, s, o) {
       const { windows: c, windowSize: a } = r(i);
       let l = e.ZERO, f = e.BASE;
-      const u = BigInt(2 ** i - 1), p = 2 ** i, w = BigInt(i);
+      const u = BigInt(2 ** i - 1), y = 2 ** i, w = BigInt(i);
       for (let g = 0; g < c; g++) {
         const h = g * a;
         let d = Number(o & u);
-        o >>= w, d > a && (d -= p, o += St);
-        const y = h, E = h + Math.abs(d) - 1, S = g % 2 !== 0, _ = d < 0;
-        d === 0 ? f = f.add(n(S, s[y])) : l = l.add(n(_, s[E]));
+        o >>= w, d > a && (d -= y, o += St);
+        const p = h, m = h + Math.abs(d) - 1, S = g % 2 !== 0, _ = d < 0;
+        d === 0 ? f = f.add(n(S, s[p])) : l = l.add(n(_, s[m]));
       }
       return { p: l, f };
     },
@@ -722,7 +722,7 @@ function ss(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: os, hexToBytes: as } = Vi, Be = {
+const { bytesToNumberBE: os, hexToBytes: as } = Vi, ke = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -730,7 +730,7 @@ const { bytesToNumberBE: os, hexToBytes: as } = Vi, Be = {
     }
   },
   _parseInt(e) {
-    const { Err: t } = Be;
+    const { Err: t } = ke;
     if (e.length < 2 || e[0] !== 2)
       throw new t("Invalid signature integer tag");
     const n = e[1], r = e.subarray(2, n + 2);
@@ -743,7 +743,7 @@ const { bytesToNumberBE: os, hexToBytes: as } = Vi, Be = {
     return { d: os(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = Be, n = typeof e == "string" ? as(e) : e;
+    const { Err: t } = ke, n = typeof e == "string" ? as(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -751,7 +751,7 @@ const { bytesToNumberBE: os, hexToBytes: as } = Vi, Be = {
       throw new t("Invalid signature tag");
     if (n[1] !== r - 2)
       throw new t("Invalid signature: incorrect length");
-    const { d: i, l: s } = Be._parseInt(n.subarray(2)), { d: o, l: c } = Be._parseInt(s);
+    const { d: i, l: s } = ke._parseInt(n.subarray(2)), { d: o, l: c } = ke._parseInt(s);
     if (c.length)
       throw new t("Invalid signature: left bytes after parsing");
     return { r: i, s: o };
@@ -765,19 +765,19 @@ const { bytesToNumberBE: os, hexToBytes: as } = Vi, Be = {
   }
 }, ce = BigInt(0), X = BigInt(1);
 BigInt(2);
-const Un = BigInt(3);
+const Ln = BigInt(3);
 BigInt(4);
 function cs(e) {
   const t = ss(e), { Fp: n } = t, r = t.toBytes || ((g, h, d) => {
-    const y = h.toAffine();
-    return Ie(Uint8Array.from([4]), n.toBytes(y.x), n.toBytes(y.y));
+    const p = h.toAffine();
+    return Ie(Uint8Array.from([4]), n.toBytes(p.x), n.toBytes(p.y));
   }), i = t.fromBytes || ((g) => {
-    const h = g.subarray(1), d = n.fromBytes(h.subarray(0, n.BYTES)), y = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
-    return { x: d, y };
+    const h = g.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(g) {
-    const { a: h, b: d } = t, y = n.sqr(g), E = n.mul(y, g);
-    return n.add(n.add(E, n.mul(g, h)), d);
+    const { a: h, b: d } = t, p = n.sqr(g), m = n.mul(p, g);
+    return n.add(n.add(m, n.mul(g, h)), d);
   }
   if (!n.eql(n.sqr(t.Gy), s(t.Gx)))
     throw new Error("bad generator point: equation left != right");
@@ -789,9 +789,9 @@ function cs(e) {
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
   function a(g) {
-    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: y, n: E } = t;
+    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: p, n: m } = t;
     if (h && typeof g != "bigint") {
-      if (g instanceof Uint8Array && (g = De(g)), typeof g != "string" || !h.includes(g.length))
+      if (g instanceof Uint8Array && (g = qe(g)), typeof g != "string" || !h.includes(g.length))
         throw new Error("Invalid key");
       g = g.padStart(d * 2, "0");
     }
@@ -801,7 +801,7 @@ function cs(e) {
     } catch {
       throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof g}`);
     }
-    return y && (S = V(S, E)), c(S), S;
+    return p && (S = V(S, m)), c(S), S;
   }
   const l = /* @__PURE__ */ new Map();
   function f(g) {
@@ -809,24 +809,24 @@ function cs(e) {
       throw new Error("ProjectivePoint expected");
   }
   class u {
-    constructor(h, d, y) {
-      if (this.px = h, this.py = d, this.pz = y, 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 (y == null || !n.isValid(y))
+      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 } = h || {};
-      if (!h || !n.isValid(d) || !n.isValid(y))
+      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(y) ? u.ZERO : new u(d, y, n.ONE);
+      const m = (S) => n.eql(S, n.ZERO);
+      return m(d) && m(p) ? u.ZERO : new u(d, p, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -841,8 +841,8 @@ function cs(e) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(h) {
-      const d = n.invertBatch(h.map((y) => y.pz));
-      return h.map((y, E) => y.toAffine(d[E])).map(u.fromAffine);
+      const d = n.invertBatch(h.map((p) => p.pz));
+      return h.map((p, m) => p.toAffine(d[m])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
@@ -870,8 +870,8 @@ function cs(e) {
       const { x: h, y: d } = this.toAffine();
       if (!n.isValid(h) || !n.isValid(d))
         throw new Error("bad point: x or y not FE");
-      const y = n.sqr(d), E = s(h);
-      if (!n.eql(y, E))
+      const p = n.sqr(d), m = s(h);
+      if (!n.eql(p, m))
         throw new Error("bad point: equation left != right");
       if (!this.isTorsionFree())
         throw new Error("bad point: not in prime-order subgroup");
@@ -887,8 +887,8 @@ function cs(e) {
      */
     equals(h) {
       f(h);
-      const { px: d, py: y, pz: E } = this, { px: S, py: _, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(S, E)), x = n.eql(n.mul(y, B), n.mul(_, E));
-      return m && x;
+      const { px: d, py: p, pz: m } = this, { px: S, py: _, pz: k } = h, E = n.eql(n.mul(d, k), n.mul(S, m)), x = n.eql(n.mul(p, k), n.mul(_, m));
+      return E && x;
     }
     /**
      * Flips point to one corresponding to (x, -y) in Affine coordinates.
@@ -901,9 +901,9 @@ function cs(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: h, b: d } = t, y = n.mul(d, Un), { px: E, py: S, pz: _ } = this;
-      let B = n.ZERO, m = n.ZERO, x = n.ZERO, N = n.mul(E, E), M = n.mul(S, S), I = n.mul(_, _), A = n.mul(E, S);
-      return A = n.add(A, A), x = n.mul(E, _), x = n.add(x, x), B = n.mul(h, x), m = n.mul(y, I), m = n.add(B, m), B = n.sub(M, m), m = n.add(M, m), m = n.mul(B, m), B = n.mul(A, B), x = n.mul(y, x), I = n.mul(h, I), A = n.sub(N, I), A = n.mul(h, A), A = n.add(A, x), x = n.add(N, N), N = n.add(x, N), N = n.add(N, I), N = n.mul(N, A), m = n.add(m, N), I = n.mul(S, _), I = n.add(I, I), N = n.mul(I, A), B = n.sub(B, N), x = n.mul(I, M), x = n.add(x, x), x = n.add(x, x), new u(B, m, x);
+      const { a: h, b: d } = t, p = n.mul(d, Ln), { px: m, py: S, pz: _ } = this;
+      let k = n.ZERO, E = n.ZERO, x = n.ZERO, K = n.mul(m, m), M = n.mul(S, S), I = n.mul(_, _), A = n.mul(m, S);
+      return A = n.add(A, A), x = n.mul(m, _), x = n.add(x, x), k = n.mul(h, x), E = n.mul(p, I), E = n.add(k, E), k = n.sub(M, E), E = n.add(M, E), E = n.mul(k, E), k = n.mul(A, k), x = n.mul(p, x), I = n.mul(h, I), A = n.sub(K, I), A = n.mul(h, A), A = n.add(A, x), x = n.add(K, K), K = n.add(x, K), K = n.add(K, I), K = n.mul(K, A), E = n.add(E, K), I = n.mul(S, _), I = n.add(I, I), K = n.mul(I, A), k = n.sub(k, K), x = n.mul(I, M), x = n.add(x, x), x = n.add(x, x), new u(k, E, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function cs(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: d, py: y, pz: E } = this, { px: S, py: _, pz: B } = h;
-      let m = n.ZERO, x = n.ZERO, N = n.ZERO;
-      const M = t.a, I = n.mul(t.b, Un);
-      let A = n.mul(d, S), R = n.mul(y, _), T = n.mul(E, B), q = n.add(d, y), b = n.add(S, _);
-      q = n.mul(q, b), b = n.add(A, R), q = n.sub(q, b), b = n.add(d, E);
-      let v = n.add(S, B);
-      return b = n.mul(b, v), v = n.add(A, T), b = n.sub(b, v), v = n.add(y, E), m = n.add(_, B), v = n.mul(v, m), m = n.add(R, T), v = n.sub(v, m), N = n.mul(M, b), m = n.mul(I, T), N = n.add(m, N), m = n.sub(R, N), N = n.add(R, N), x = n.mul(m, N), R = n.add(A, A), R = n.add(R, A), T = n.mul(M, T), b = n.mul(I, b), R = n.add(R, T), T = n.sub(A, T), T = n.mul(M, T), b = n.add(b, T), A = n.mul(R, b), x = n.add(x, A), A = n.mul(v, b), m = n.mul(q, m), m = n.sub(m, A), A = n.mul(q, R), N = n.mul(v, N), N = n.add(N, A), new u(m, x, N);
+      const { px: d, py: p, pz: m } = this, { px: S, py: _, pz: k } = h;
+      let E = n.ZERO, x = n.ZERO, K = n.ZERO;
+      const M = t.a, I = n.mul(t.b, Ln);
+      let A = n.mul(d, S), R = n.mul(p, _), T = n.mul(m, k), D = n.add(d, p), b = n.add(S, _);
+      D = n.mul(D, b), b = n.add(A, R), D = n.sub(D, b), b = n.add(d, m);
+      let v = n.add(S, k);
+      return b = n.mul(b, v), v = n.add(A, T), b = n.sub(b, v), v = n.add(p, m), E = n.add(_, k), v = n.mul(v, E), E = n.add(R, T), v = n.sub(v, E), K = n.mul(M, b), E = n.mul(I, T), K = n.add(E, K), E = n.sub(R, K), K = n.add(R, K), x = n.mul(E, K), R = n.add(A, A), R = n.add(R, A), T = n.mul(M, T), b = n.mul(I, b), R = n.add(R, T), T = n.sub(A, T), T = n.mul(M, T), b = n.add(b, T), A = n.mul(R, b), x = n.add(x, A), A = n.mul(v, b), E = n.mul(D, E), E = n.sub(E, A), A = n.mul(D, R), K = n.mul(v, K), K = n.add(K, A), new u(E, x, K);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -927,8 +927,8 @@ function cs(e) {
     }
     wNAF(h) {
       return w.wNAFCached(this, l, h, (d) => {
-        const y = n.invertBatch(d.map((E) => E.pz));
-        return d.map((E, S) => E.toAffine(y[S])).map(u.fromAffine);
+        const p = n.invertBatch(d.map((m) => m.pz));
+        return d.map((m, S) => m.toAffine(p[S])).map(u.fromAffine);
       });
     }
     /**
@@ -942,13 +942,13 @@ function cs(e) {
         return d;
       if (c(h), h === X)
         return this;
-      const { endo: y } = t;
-      if (!y)
+      const { endo: p } = t;
+      if (!p)
         return w.unsafeLadder(this, h);
-      let { k1neg: E, k1: S, k2neg: _, k2: B } = y.splitScalar(h), m = d, x = d, N = this;
-      for (; S > ce || B > ce; )
-        S & X && (m = m.add(N)), B & X && (x = x.add(N)), N = N.double(), S >>= X, B >>= X;
-      return E && (m = m.negate()), _ && (x = x.negate()), x = new u(n.mul(x.px, y.beta), x.py, x.pz), m.add(x);
+      let { k1neg: m, k1: S, k2neg: _, k2: k } = p.splitScalar(h), E = d, x = d, K = this;
+      for (; S > ce || k > ce; )
+        S & X && (E = E.add(K)), k & X && (x = x.add(K)), K = K.double(), S >>= X, k >>= X;
+      return m && (E = E.negate()), _ && (x = x.negate()), x = new u(n.mul(x.px, p.beta), x.py, x.pz), E.add(x);
     }
     /**
      * Constant time multiplication.
@@ -961,17 +961,17 @@ function cs(e) {
      */
     multiply(h) {
       c(h);
-      let d = h, y, E;
+      let d = h, p, m;
       const { endo: S } = t;
       if (S) {
-        const { k1neg: _, k1: B, k2neg: m, k2: x } = S.splitScalar(d);
-        let { p: N, f: M } = this.wNAF(B), { p: I, f: A } = this.wNAF(x);
-        N = w.constTimeNegate(_, N), I = w.constTimeNegate(m, I), I = new u(n.mul(I.px, S.beta), I.py, I.pz), y = N.add(I), E = M.add(A);
+        const { k1neg: _, k1: k, k2neg: E, k2: x } = S.splitScalar(d);
+        let { p: K, f: M } = this.wNAF(k), { p: I, f: A } = this.wNAF(x);
+        K = w.constTimeNegate(_, K), I = w.constTimeNegate(E, I), I = new u(n.mul(I.px, S.beta), I.py, I.pz), p = K.add(I), m = M.add(A);
       } else {
-        const { p: _, f: B } = this.wNAF(d);
-        y = _, E = B;
+        const { p: _, f: k } = this.wNAF(d);
+        p = _, m = k;
       }
-      return u.normalizeZ([y, E])[0];
+      return u.normalizeZ([p, m])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -979,22 +979,22 @@ function cs(e) {
      * The trick could be useful if both P and Q are not G (not in our case).
      * @returns non-zero affine point
      */
-    multiplyAndAddUnsafe(h, d, y) {
-      const E = u.BASE, S = (B, m) => m === ce || m === X || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), _ = S(this, d).add(S(h, y));
+    multiplyAndAddUnsafe(h, d, p) {
+      const m = u.BASE, S = (k, E) => E === ce || E === X || !k.equals(m) ? k.multiplyUnsafe(E) : k.multiply(E), _ = S(this, d).add(S(h, p));
       return _.is0() ? void 0 : _;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
     // (x, y, z) ∋ (x=x/z, y=y/z)
     toAffine(h) {
-      const { px: d, py: y, pz: E } = this, S = this.is0();
-      h == null && (h = S ? n.ONE : n.inv(E));
-      const _ = n.mul(d, h), B = n.mul(y, h), m = n.mul(E, h);
+      const { px: d, py: p, pz: m } = this, S = this.is0();
+      h == null && (h = S ? n.ONE : n.inv(m));
+      const _ = n.mul(d, h), k = n.mul(p, h), E = n.mul(m, h);
       if (S)
         return { x: n.ZERO, y: n.ZERO };
-      if (!n.eql(m, n.ONE))
+      if (!n.eql(E, n.ONE))
         throw new Error("invZ was invalid");
-      return { x: _, y: B };
+      return { x: _, y: k };
     }
     isTorsionFree() {
       const { h, isTorsionFree: d } = t;
@@ -1012,11 +1012,11 @@ function cs(e) {
       return this.assertValidity(), r(u, this, h);
     }
     toHex(h = !0) {
-      return De(this.toRawBytes(h));
+      return qe(this.toRawBytes(h));
     }
   }
   u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
-  const p = t.nBitLength, w = is(u, t.endo ? Math.ceil(p / 2) : p);
+  const y = t.nBitLength, w = is(u, t.endo ? Math.ceil(y / 2) : y);
   return {
     CURVE: t,
     ProjectivePoint: u,
@@ -1046,31 +1046,31 @@ function ls(e) {
     return V(b, r);
   }
   function a(b) {
-    return Rt(b, r);
+    return Tt(b, r);
   }
-  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: p } = cs({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: y } = cs({
     ...t,
-    toBytes(b, v, K) {
-      const k = v.toAffine(), C = n.toBytes(k.x), U = Ie;
-      return K ? U(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : U(Uint8Array.from([4]), C, n.toBytes(k.y));
+    toBytes(b, v, N) {
+      const B = v.toAffine(), C = n.toBytes(B.x), U = Ie;
+      return N ? U(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : U(Uint8Array.from([4]), C, n.toBytes(B.y));
     },
     fromBytes(b) {
-      const v = b.length, K = b[0], k = b.subarray(1);
-      if (v === i && (K === 2 || K === 3)) {
-        const C = G(k);
+      const v = b.length, N = b[0], B = b.subarray(1);
+      if (v === i && (N === 2 || N === 3)) {
+        const C = G(B);
         if (!o(C))
           throw new Error("Point is not on curve");
         const U = u(C);
         let O = n.sqrt(U);
         const $ = (O & X) === X;
-        return (K & 1) === 1 !== $ && (O = n.neg(O)), { x: C, y: O };
-      } else if (v === s && K === 4) {
-        const C = n.fromBytes(k.subarray(0, n.BYTES)), U = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
+        return (N & 1) === 1 !== $ && (O = n.neg(O)), { x: C, y: O };
+      } else if (v === s && N === 4) {
+        const C = n.fromBytes(B.subarray(0, n.BYTES)), U = n.fromBytes(B.subarray(n.BYTES, 2 * n.BYTES));
         return { x: C, y: U };
       } else
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${s} uncompressed bytes`);
     }
-  }), w = (b) => De(Ke(b, t.nByteLength));
+  }), w = (b) => qe(Ne(b, t.nByteLength));
   function g(b) {
     const v = r >> X;
     return b > v;
@@ -1078,39 +1078,39 @@ function ls(e) {
   function h(b) {
     return g(b) ? c(-b) : b;
   }
-  const d = (b, v, K) => G(b.slice(v, K));
-  class y {
-    constructor(v, K, k) {
-      this.r = v, this.s = K, this.recovery = k, this.assertValidity();
+  const d = (b, v, N) => G(b.slice(v, N));
+  class p {
+    constructor(v, N, B) {
+      this.r = v, this.s = N, this.recovery = B, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
-      const K = t.nByteLength;
-      return v = Z("compactSignature", v, K * 2), new y(d(v, 0, K), d(v, K, 2 * K));
+      const N = t.nByteLength;
+      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: K, s: k } = Be.toSig(Z("DER", v));
-      return new y(K, k);
+      const { r: N, s: B } = ke.toSig(Z("DER", v));
+      return new p(N, B);
     }
     assertValidity() {
-      if (!p(this.r))
+      if (!y(this.r))
         throw new Error("r must be 0 < r < CURVE.n");
-      if (!p(this.s))
+      if (!y(this.s))
         throw new Error("s must be 0 < s < CURVE.n");
     }
     addRecoveryBit(v) {
-      return new y(this.r, this.s, v);
+      return new p(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: K, s: k, recovery: C } = this, U = x(Z("msgHash", v));
+      const { r: N, s: B, recovery: C } = this, U = x(Z("msgHash", v));
       if (C == null || ![0, 1, 2, 3].includes(C))
         throw new Error("recovery id invalid");
-      const O = C === 2 || C === 3 ? K + t.n : K;
+      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) === 0 ? "02" : "03", ee = l.fromHex($ + w(O)), ge = a(O), Ue = c(-U * ge), Ve = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(ee, Ue, Ve);
+      const $ = (C & 1) === 0 ? "02" : "03", ee = l.fromHex($ + w(O)), ge = a(O), Ue = c(-U * ge), Ve = c(B * ge), we = l.BASE.multiplyAndAddUnsafe(ee, Ue, Ve);
       if (!we)
         throw new Error("point at infinify");
       return we.assertValidity(), we;
@@ -1120,14 +1120,14 @@ function ls(e) {
       return g(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new y(this.r, c(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new p(this.r, c(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
       return je(this.toDERHex());
     }
     toDERHex() {
-      return Be.hexFromSig({ r: this.r, s: this.s });
+      return ke.hexFromSig({ r: this.r, s: this.s });
     }
     // padded bytes of r, then padded bytes of s
     toCompactRawBytes() {
@@ -1137,7 +1137,7 @@ function ls(e) {
       return w(this.r) + w(this.s);
     }
   }
-  const E = {
+  const m = {
     isValidPrivateKey(b) {
       try {
         return f(b), !0;
@@ -1170,35 +1170,35 @@ function ls(e) {
     return l.fromPrivateKey(b).toRawBytes(v);
   }
   function _(b) {
-    const v = b instanceof Uint8Array, K = typeof b == "string", k = (v || K) && b.length;
-    return v ? k === i || k === s : K ? k === 2 * i || k === 2 * s : b instanceof l;
+    const v = b instanceof Uint8Array, N = typeof b == "string", B = (v || N) && b.length;
+    return v ? B === i || B === s : N ? B === 2 * i || B === 2 * s : b instanceof l;
   }
-  function B(b, v, K = !0) {
+  function k(b, v, N = !0) {
     if (_(b))
       throw new Error("first arg must be private key");
     if (!_(v))
       throw new Error("second arg must be public key");
-    return l.fromHex(v).multiply(f(b)).toRawBytes(K);
+    return l.fromHex(v).multiply(f(b)).toRawBytes(N);
   }
-  const m = t.bits2int || function(b) {
-    const v = G(b), K = b.length * 8 - t.nBitLength;
-    return K > 0 ? v >> BigInt(K) : v;
+  const E = t.bits2int || function(b) {
+    const v = G(b), N = b.length * 8 - t.nBitLength;
+    return N > 0 ? v >> BigInt(N) : v;
   }, x = t.bits2int_modN || function(b) {
-    return c(m(b));
-  }, N = Gt(t.nBitLength);
+    return c(E(b));
+  }, K = Jt(t.nBitLength);
   function M(b) {
     if (typeof b != "bigint")
       throw new Error("bigint expected");
-    if (!(ce <= b && b < N))
+    if (!(ce <= b && b < K))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
-    return Ke(b, t.nByteLength);
+    return Ne(b, t.nByteLength);
   }
-  function I(b, v, K = A) {
-    if (["recovered", "canonical"].some((Ae) => Ae in K))
+  function I(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: $ } = K;
-    U == null && (U = !0), b = Z("msgHash", b), O && (b = Z("prehashed msgHash", k(b)));
+    const { hash: B, randomBytes: C } = t;
+    let { lowS: U, prehash: O, extraEntropy: $ } = N;
+    U == null && (U = !0), b = Z("msgHash", b), O && (b = Z("prehashed msgHash", B(b)));
     const ee = x(b), ge = f(v), Ue = [M(ge), M(ee)];
     if ($ != null) {
       const Ae = $ === !0 ? C(n.BYTES) : $;
@@ -1206,48 +1206,48 @@ function ls(e) {
     }
     const Ve = Ie(...Ue), we = ee;
     function Et(Ae) {
-      const Le = m(Ae);
-      if (!p(Le))
+      const Le = E(Ae);
+      if (!y(Le))
         return;
-      const Sn = a(Le), $e = l.BASE.multiply(Le).toAffine(), te = c($e.x);
+      const An = a(Le), $e = l.BASE.multiply(Le).toAffine(), te = c($e.x);
       if (te === ce)
         return;
-      const Re = c(Sn * c(we + te * ge));
+      const Re = c(An * c(we + te * ge));
       if (Re === ce)
         return;
-      let An = ($e.x === te ? 0 : 2) | Number($e.y & X), Cn = Re;
-      return U && g(Re) && (Cn = h(Re), An ^= 1), new y(te, Cn, An);
+      let Cn = ($e.x === te ? 0 : 2) | Number($e.y & X), kn = Re;
+      return U && g(Re) && (kn = h(Re), Cn ^= 1), new p(te, kn, Cn);
     }
     return { seed: Ve, k2sig: Et };
   }
   const A = { lowS: t.lowS, prehash: !1 }, R = { lowS: t.lowS, prehash: !1 };
-  function T(b, v, K = A) {
-    const { seed: k, k2sig: C } = I(b, v, K), U = t;
-    return er(U.hash.outputLen, U.nByteLength, U.hmac)(k, C);
+  function T(b, v, N = A) {
+    const { seed: B, k2sig: C } = I(b, v, N), U = t;
+    return er(U.hash.outputLen, U.nByteLength, U.hmac)(B, C);
   }
   l.BASE._setWindowSize(8);
-  function q(b, v, K, k = R) {
+  function D(b, v, N, B = R) {
     var $e;
     const C = b;
-    if (v = Z("msgHash", v), K = Z("publicKey", K), "strict" in k)
+    if (v = Z("msgHash", v), N = Z("publicKey", N), "strict" in B)
       throw new Error("options.strict was renamed to lowS");
-    const { lowS: U, prehash: O } = k;
+    const { lowS: U, prehash: O } = B;
     let $, ee;
     try {
       if (typeof C == "string" || C instanceof Uint8Array)
         try {
-          $ = y.fromDER(C);
+          $ = p.fromDER(C);
         } catch (te) {
-          if (!(te instanceof Be.Err))
+          if (!(te instanceof ke.Err))
             throw te;
-          $ = y.fromCompact(C);
+          $ = p.fromCompact(C);
         }
       else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
         const { r: te, s: Re } = C;
-        $ = new y(te, Re);
+        $ = new p(te, Re);
       } else
         throw new Error("PARSE");
-      ee = l.fromHex(K);
+      ee = l.fromHex(N);
     } catch (te) {
       if (te.message === "PARSE")
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
@@ -1262,18 +1262,18 @@ function ls(e) {
   return {
     CURVE: t,
     getPublicKey: S,
-    getSharedSecret: B,
+    getSharedSecret: k,
     sign: T,
-    verify: q,
+    verify: D,
     ProjectivePoint: l,
-    Signature: y,
-    utils: E
+    Signature: p,
+    utils: m
   };
 }
 let sr = class extends Jn {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, Si(t);
-    const r = Wt(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;
@@ -1311,7 +1311,7 @@ or.create = (e, t) => new sr(e, t);
 function fs(e) {
   return {
     hash: e,
-    hmac: (t, ...n) => or(e, t, ki(...n)),
+    hmac: (t, ...n) => or(e, t, Bi(...n)),
     randomBytes: Yn
   };
 }
@@ -1320,17 +1320,17 @@ function hs(e, t) {
   return Object.freeze({ ...n(t), create: n });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const ut = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), ar = BigInt(1), nt = BigInt(2), Ln = (e, t) => (e + t / nt) / t;
+const ut = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), ar = BigInt(1), nt = BigInt(2), $n = (e, t) => (e + t / nt) / t;
 function cr(e) {
-  const t = ut, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = Y(f, n, t) * f % t, p = Y(u, n, t) * f % t, w = Y(p, nt, t) * l % t, g = Y(w, i, t) * w % t, h = Y(g, s, t) * g % t, d = Y(h, c, t) * h % t, y = Y(d, a, t) * d % t, E = Y(y, c, t) * h % t, S = Y(E, n, t) * f % t, _ = Y(S, o, t) * g % t, B = Y(_, r, t) * l % t, m = Y(B, nt, t);
-  if (!Tt.eql(Tt.sqr(m), e))
+  const t = ut, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = Y(f, n, t) * f % t, y = Y(u, n, t) * f % t, w = Y(y, nt, t) * l % t, g = Y(w, i, t) * w % t, h = Y(g, s, t) * g % t, d = Y(h, c, t) * h % t, p = Y(d, a, t) * d % t, m = Y(p, c, t) * h % t, S = Y(m, n, t) * f % t, _ = Y(S, o, t) * g % t, k = Y(_, r, t) * l % t, E = Y(k, nt, t);
+  if (!Ot.eql(Ot.sqr(E), e))
     throw new Error("Cannot find square root");
-  return m;
+  return E;
 }
-const Tt = ts(ut, void 0, void 0, { sqrt: cr }), _e = hs({
+const Ot = ts(ut, void 0, void 0, { sqrt: cr }), _e = hs({
   a: BigInt(0),
   b: BigInt(7),
-  Fp: Tt,
+  Fp: Ot,
   n: tt,
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
@@ -1346,27 +1346,27 @@ const Tt = ts(ut, void 0, void 0, { sqrt: cr }), _e = hs({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
-      const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -ar * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = Ln(s * e, t), a = Ln(-r * e, t);
+      const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -ar * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = $n(s * e, t), a = $n(-r * e, t);
       let l = V(e - c * n - a * i, t), f = V(-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, y = f > o;
+      if (u && (l = t - l), y && (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: y, k2: f };
     }
   }
-}, Lt), lt = BigInt(0), ur = (e) => typeof e == "bigint" && lt < e && e < ut, ds = (e) => typeof e == "bigint" && lt < e && e < tt, $n = {};
+}, $t), lt = BigInt(0), ur = (e) => typeof e == "bigint" && lt < e && e < ut, ds = (e) => typeof e == "bigint" && lt < e && e < tt, Rn = {};
 function rt(e, ...t) {
-  let n = $n[e];
+  let n = Rn[e];
   if (n === void 0) {
-    const r = Lt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = Ie(r, r), $n[e] = n;
+    const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    n = Ie(r, r), Rn[e] = n;
   }
-  return Lt(Ie(n, ...t));
+  return $t(Ie(n, ...t));
 }
-const Jt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => Ke(e, 32), At = (e) => V(e, ut), Ge = (e) => V(e, tt), Yt = _e.ProjectivePoint, ps = (e, t, n) => Yt.BASE.multiplyAndAddUnsafe(e, t, n);
-function Mt(e) {
-  let t = _e.utils.normPrivateKeyToScalar(e), n = Yt.fromPrivateKey(t);
-  return { scalar: n.hasEvenY() ? t : Ge(-t), bytes: Jt(n) };
+const Yt = (e) => e.toRawBytes(!0).slice(1), Mt = (e) => Ne(e, 32), At = (e) => V(e, ut), Ge = (e) => V(e, tt), Xt = _e.ProjectivePoint, ps = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
+function Pt(e) {
+  let t = _e.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
+  return { scalar: n.hasEvenY() ? t : Ge(-t), bytes: Yt(n) };
 }
 function lr(e) {
   if (!ur(e))
@@ -1374,21 +1374,21 @@ function lr(e) {
   const t = At(e * e), n = At(t * e + BigInt(7));
   let r = cr(n);
   r % nt !== lt && (r = At(-r));
-  const i = new Yt(e, r, ar);
+  const i = new Xt(e, r, ar);
   return i.assertValidity(), i;
 }
 function fr(...e) {
   return Ge(G(rt("BIP0340/challenge", ...e)));
 }
 function ys(e) {
-  return Mt(e).bytes;
+  return Pt(e).bytes;
 }
 function gs(e, t, n = Yn(32)) {
-  const r = Z("message", e), { bytes: i, scalar: s } = Mt(t), o = Z("auxRand", n, 32), c = Ot(s ^ G(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Ge(G(a));
+  const r = Z("message", e), { bytes: i, scalar: s } = Pt(t), o = Z("auxRand", n, 32), c = Mt(s ^ G(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Ge(G(a));
   if (l === lt)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Mt(l), p = fr(f, i, r), w = new Uint8Array(64);
-  if (w.set(f, 0), w.set(Ot(Ge(u + p * s)), 32), !hr(w, r, i))
+  const { bytes: f, scalar: u } = Pt(l), y = fr(f, i, r), w = new Uint8Array(64);
+  if (w.set(f, 0), w.set(Mt(Ge(u + y * s)), 32), !hr(w, r, i))
     throw new Error("sign: Invalid signature produced");
   return w;
 }
@@ -1401,7 +1401,7 @@ function hr(e, t, n) {
     const a = G(r.subarray(32, 64));
     if (!ds(a))
       return !1;
-    const l = fr(Ot(c), Jt(o), i), f = ps(o, a, Ge(-l));
+    const l = fr(Mt(c), Yt(o), i), f = ps(o, a, Ge(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
   } catch {
     return !1;
@@ -1414,20 +1414,20 @@ const Ze = {
   utils: {
     randomPrivateKey: _e.utils.randomPrivateKey,
     lift_x: lr,
-    pointToBytes: Jt,
-    numberToBytesBE: Ke,
+    pointToBytes: Yt,
+    numberToBytesBE: Ne,
     bytesToNumberBE: G,
     taggedHash: rt,
     mod: V
   }
 }, 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, Bt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, ws = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Qt = (e) => e instanceof Uint8Array, kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, ws = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!ws)
   throw new Error("Non little-endian hardware is not supported");
 const bs = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function P(e) {
-  if (!Xt(e))
+  if (!Qt(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
@@ -1455,7 +1455,7 @@ function vs(e) {
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Je(e) {
-  if (typeof e == "string" && (e = vs(e)), !Xt(e))
+  if (typeof e == "string" && (e = vs(e)), !Qt(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -1463,7 +1463,7 @@ function ft(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!Xt(r))
+    if (!Qt(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
@@ -1483,7 +1483,7 @@ function yr(e = 32) {
     return Ct.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Pt(e) {
+function Ht(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -1500,7 +1500,7 @@ function gr(e, ...t) {
 function Es(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Pt(e.outputLen), Pt(e.blockLen);
+  Ht(e.outputLen), Ht(e.blockLen);
 }
 function xs(e, t = !0) {
   if (e.destroyed)
@@ -1508,21 +1508,21 @@ function xs(e, t = !0) {
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function Ns(e, t) {
+function Ks(e, t) {
   gr(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const se = {
-  number: Pt,
+  number: Ht,
   bool: ms,
   bytes: gr,
   hash: Es,
   exists: xs,
-  output: Ns
+  output: Ks
 };
-function Ks(e, t, n, r) {
+function Ns(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
   const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), c = Number(n & s), a = r ? 4 : 0, l = r ? 0 : 4;
@@ -1530,7 +1530,7 @@ function Ks(e, t, n, r) {
 }
 class Ss extends dr {
   constructor(t, n, r, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Bt(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 = kt(this.buffer);
   }
   update(t) {
     se.exists(this);
@@ -1540,7 +1540,7 @@ class Ss extends dr {
     for (let o = 0; o < s; ) {
       const c = Math.min(i - this.pos, s - o);
       if (c === i) {
-        const a = Bt(t);
+        const a = kt(t);
         for (; i <= s - o; o += i)
           this.process(a, o);
         continue;
@@ -1556,8 +1556,8 @@ class Ss extends dr {
     n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(r, 0), o = 0);
     for (let u = o; u < i; u++)
       n[u] = 0;
-    Ks(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const c = Bt(t), a = this.outputLen;
+    Ns(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const c = kt(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = a / 4, f = this.get();
@@ -1578,7 +1578,7 @@ class Ss extends dr {
     return t.length = i, t.pos = c, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 }
-const As = (e, t, n) => e & t ^ ~e & n, Cs = (e, t, n) => e & t ^ e & n ^ t & n, Bs = new Uint32Array([
+const As = (e, t, n) => e & t ^ ~e & n, Cs = (e, t, n) => e & t ^ e & n ^ t & n, ks = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1669,12 +1669,12 @@ class wr extends Ss {
     for (let u = 0; u < 16; u++, n += 4)
       Ee[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const p = Ee[u - 15], w = Ee[u - 2], g = ie(p, 7) ^ ie(p, 18) ^ p >>> 3, h = ie(w, 17) ^ ie(w, 19) ^ w >>> 10;
+      const y = Ee[u - 15], w = Ee[u - 2], g = ie(y, 7) ^ ie(y, 18) ^ y >>> 3, h = ie(w, 17) ^ ie(w, 19) ^ w >>> 10;
       Ee[u] = h + Ee[u - 7] + g + Ee[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const p = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), w = f + p + As(c, a, l) + Bs[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + Cs(r, i, s) | 0;
+      const y = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), w = f + y + As(c, a, l) + ks[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + Cs(r, i, s) | 0;
       f = l, l = a, a = c, c = o + w | 0, o = s, s = i, i = r, r = w + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
@@ -1686,13 +1686,13 @@ class wr extends Ss {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 }
-class ks extends wr {
+class Bs extends wr {
   constructor() {
     super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28;
   }
 }
 const fe = pr(() => new wr());
-pr(() => new ks());
+pr(() => new Bs());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function We(e) {
   if (!Number.isSafeInteger(e))
@@ -1781,7 +1781,7 @@ function br(e) {
     throw new Error("normalize fn should be function");
   return { encode: (t) => t, decode: (t) => e(t) };
 }
-function Rn(e, t, n) {
+function Tn(e, t, n) {
   if (t < 2)
     throw new Error(`convertRadix: wrong from=${t}, base cannot be less than 2`);
   if (n < 2)
@@ -1815,7 +1815,7 @@ function Rn(e, t, n) {
   return i.reverse();
 }
 const vr = (e, t) => t ? vr(t, e % t) : e, it = (e, t) => e + (t - vr(e, t));
-function Ht(e, t, n, r) {
+function Dt(e, t, n, r) {
   if (!Array.isArray(e))
     throw new Error("convertRadix2: data should be array");
   if (t <= 0 || t > 32)
@@ -1846,12 +1846,12 @@ function Is(e) {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
-      return Rn(Array.from(t), 2 ** 8, e);
+      return Tn(Array.from(t), 2 ** 8, e);
     },
     decode: (t) => {
       if (!Array.isArray(t) || t.length && typeof t[0] != "number")
         throw new Error("radix.decode input should be array of strings");
-      return Uint8Array.from(Rn(t, e, 2 ** 8));
+      return Uint8Array.from(Tn(t, e, 2 ** 8));
     }
   };
 }
@@ -1864,16 +1864,16 @@ function Se(e, t = !1) {
     encode: (n) => {
       if (!(n instanceof Uint8Array))
         throw new Error("radix2.encode input should be Uint8Array");
-      return Ht(Array.from(n), 8, e, !t);
+      return Dt(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(Ht(n, e, 8, t));
+      return Uint8Array.from(Dt(n, e, 8, t));
     }
   };
 }
-function Tn(e) {
+function On(e) {
   if (typeof e != "function")
     throw new Error("unsafeWrapper fn should be function");
   return function(...t) {
@@ -1886,22 +1886,22 @@ function Tn(e) {
 const _s = de(Se(4), pe("0123456789ABCDEF"), ye("")), Us = de(Se(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ht(5), ye(""));
 de(Se(5), pe("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ht(5), ye(""));
 de(Se(5), pe("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), ye(""), br((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const he = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ht(6), ye("")), Ls = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ht(6), ye("")), Qt = (e) => de(Is(58), pe(e), ye("")), qt = Qt("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-Qt("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
-Qt("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
-const On = [0, 2, 3, 5, 6, 7, 9, 10, 11], $s = {
+const he = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ht(6), ye("")), Ls = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ht(6), ye("")), en = (e) => de(Is(58), pe(e), ye("")), qt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
+en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
+const Mn = [0, 2, 3, 5, 6, 7, 9, 10, 11], $s = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
       const r = e.subarray(n, n + 8);
-      t += qt.encode(r).padStart(On[r.length], "1");
+      t += qt.encode(r).padStart(Mn[r.length], "1");
     }
     return t;
   },
   decode(e) {
     let t = [];
     for (let n = 0; n < e.length; n += 11) {
-      const r = e.slice(n, n + 11), i = On.indexOf(r.length), s = qt.decode(r);
+      const r = e.slice(n, n + 11), i = Mn.indexOf(r.length), s = qt.decode(r);
       for (let o = 0; o < s.length - i; o++)
         if (s[o] !== 0)
           throw new Error("base58xmr: wrong padding");
@@ -1909,15 +1909,15 @@ const On = [0, 2, 3, 5, 6, 7, 9, 10, 11], $s = {
     }
     return Uint8Array.from(t);
   }
-}, Dt = de(pe("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), ye("")), Mn = [996825010, 642813549, 513874426, 1027748829, 705979059];
+}, jt = de(pe("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), ye("")), Pn = [996825010, 642813549, 513874426, 1027748829, 705979059];
 function Fe(e) {
   const t = e >> 25;
   let n = (e & 33554431) << 5;
-  for (let r = 0; r < Mn.length; r++)
-    (t >> r & 1) === 1 && (n ^= Mn[r]);
+  for (let r = 0; r < Pn.length; r++)
+    (t >> r & 1) === 1 && (n ^= Pn[r]);
   return n;
 }
-function Pn(e, t, n = 1) {
+function Hn(e, t, n = 1) {
   const r = e.length;
   let i = 1;
   for (let s = 0; s < r; s++) {
@@ -1933,44 +1933,44 @@ function Pn(e, t, n = 1) {
     i = Fe(i) ^ s;
   for (let s = 0; s < 6; s++)
     i = Fe(i);
-  return i ^= n, Dt.encode(Ht([i % 2 ** 30], 30, 5, !1));
+  return i ^= n, jt.encode(Dt([i % 2 ** 30], 30, 5, !1));
 }
 function mr(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, s = Tn(r);
-  function o(f, u, p = 90) {
+  const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, s = On(r);
+  function o(f, u, y = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
     if (!Array.isArray(u) || u.length && typeof u[0] != "number")
       throw new Error(`bech32.encode words should be array of numbers, not ${typeof u}`);
     const w = f.length + 7 + u.length;
-    if (p !== !1 && w > p)
-      throw new TypeError(`Length ${w} exceeds limit ${p}`);
-    return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${Pn(f, u, t)}`;
+    if (y !== !1 && w > y)
+      throw new TypeError(`Length ${w} exceeds limit ${y}`);
+    return f = f.toLowerCase(), `${f}1${jt.encode(u)}${Hn(f, u, t)}`;
   }
   function c(f, u = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.decode input should be string, not ${typeof f}`);
     if (f.length < 8 || u !== !1 && f.length > u)
       throw new TypeError(`Wrong string length: ${f.length} (${f}). Expected (8..${u})`);
-    const p = f.toLowerCase();
-    if (f !== p && f !== f.toUpperCase())
+    const y = f.toLowerCase();
+    if (f !== y && f !== f.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
-    f = p;
+    f = y;
     const w = f.lastIndexOf("1");
     if (w === 0 || w === -1)
       throw new Error('Letter "1" must be present between prefix and data only');
     const g = f.slice(0, w), h = f.slice(w + 1);
     if (h.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const d = Dt.decode(h).slice(0, -6), y = Pn(g, d, t);
-    if (!h.endsWith(y))
-      throw new Error(`Invalid checksum in ${f}: expected "${y}"`);
+    const d = jt.decode(h).slice(0, -6), p = Hn(g, d, t);
+    if (!h.endsWith(p))
+      throw new Error(`Invalid checksum in ${f}: expected "${p}"`);
     return { prefix: g, words: d };
   }
-  const a = Tn(c);
+  const a = On(c);
   function l(f) {
-    const { prefix: u, words: p } = c(f, !1);
-    return { prefix: u, words: p, bytes: r(p) };
+    const { prefix: u, words: y } = c(f, !1);
+    return { prefix: u, words: y, bytes: r(y) };
   }
   return { encode: o, decode: c, decodeToBytes: l, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
@@ -1994,11 +1994,11 @@ const Rs = {
   base58xmr: $s
 };
 `${Object.keys(Os).join(", ")}`;
-function kt(e) {
+function Bt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
-function Hn(e) {
+function Dn(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
@@ -2020,7 +2020,7 @@ function Hs(e, t) {
     throw new Error("options must be defined");
   return Object.assign(e, t);
 }
-function qs(e, t) {
+function Ds(e, t) {
   if (e.length !== t.length)
     return !1;
   let n = 0;
@@ -2028,19 +2028,19 @@ function qs(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Ds = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ne = 16, js = 283;
-function en(e) {
+const qs = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ke = 16, js = 283;
+function tn(e) {
   return e << 1 ^ js & -(e >> 7);
 }
 function He(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
-    n ^= e & -(t & 1), e = en(e);
+    n ^= e & -(t & 1), e = tn(e);
   return n;
 }
-const jt = /* @__PURE__ */ (() => {
+const zt = /* @__PURE__ */ (() => {
   let e = new Uint8Array(256);
-  for (let n = 0, r = 1; n < 256; n++, r ^= en(r))
+  for (let n = 0, r = 1; n < 256; n++, r ^= tn(r))
     e[n] = r;
   const t = new Uint8Array(256);
   t[0] = 99;
@@ -2049,7 +2049,7 @@ const jt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), zs = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Ws = (e) => e << 24 | e >>> 8, It = (e) => e << 8 | e >>> 24;
+})(), zs = /* @__PURE__ */ zt.map((e, t) => zt.indexOf(t)), Ws = (e) => e << 24 | e >>> 8, It = (e) => e << 8 | e >>> 24;
 function Er(e, t) {
   if (e.length !== 256)
     throw new Error("Wrong sbox length");
@@ -2061,18 +2061,18 @@ function Er(e, t) {
     }
   return { sbox: e, sbox2: a, T0: n, T1: r, T2: i, T3: s, T01: o, T23: c };
 }
-const tn = /* @__PURE__ */ Er(jt, (e) => He(e, 3) << 24 | e << 16 | e << 8 | He(e, 2)), xr = /* @__PURE__ */ Er(zs, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), Vs = /* @__PURE__ */ (() => {
+const nn = /* @__PURE__ */ Er(zt, (e) => He(e, 3) << 24 | e << 16 | e << 8 | He(e, 2)), xr = /* @__PURE__ */ Er(zs, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), Vs = /* @__PURE__ */ (() => {
   const e = new Uint8Array(16);
-  for (let t = 0, n = 1; t < 16; t++, n = en(n))
+  for (let t = 0, n = 1; t < 16; t++, n = tn(n))
     e[t] = n;
   return e;
 })();
-function Nr(e) {
+function Kr(e) {
   ue(e);
   const t = e.length;
   if (![16, 24, 32].includes(t))
     throw new Error(`aes: wrong key size: should be 16, 24 or 32, got: ${t}`);
-  const { sbox2: n } = tn, r = F(e), i = r.length, s = (c) => oe(n, c, c, c, c), o = new Uint32Array(t + 28);
+  const { sbox2: n } = nn, r = F(e), i = r.length, s = (c) => oe(n, c, c, c, c), o = new Uint32Array(t + 28);
   o.set(r);
   for (let c = i; c < o.length; c++) {
     let a = o[c - 1];
@@ -2081,7 +2081,7 @@ function Nr(e) {
   return o;
 }
 function Zs(e) {
-  const t = Nr(e), n = t.slice(), r = t.length, { sbox2: i } = tn, { T0: s, T1: o, T2: c, T3: a } = xr;
+  const t = Kr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: c, T3: a } = xr;
   for (let l = 0; l < r; l += 4)
     for (let f = 0; f < 4; f++)
       n[l + f] = t[r - l - 4 + f];
@@ -2099,16 +2099,16 @@ function oe(e, t, n, r, i) {
   return e[t & 255 | n & 65280] | e[r >>> 16 & 255 | i >>> 16 & 65280] << 16;
 }
 function qn(e, t, n, r, i) {
-  const { sbox2: s, T01: o, T23: c } = tn;
+  const { sbox2: s, T01: o, T23: c } = nn;
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
   for (let g = 0; g < l; g++) {
-    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), y = e[a++] ^ xe(o, c, r, i, t, n), E = e[a++] ^ xe(o, c, i, t, n, r);
-    t = h, n = d, r = y, i = E;
+    const 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), m = e[a++] ^ xe(o, c, i, t, n, r);
+    t = h, n = d, r = p, i = m;
   }
-  const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), p = e[a++] ^ oe(s, r, i, t, n), w = e[a++] ^ oe(s, i, t, n, r);
-  return { s0: f, s1: u, s2: p, s3: w };
+  const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), y = e[a++] ^ oe(s, r, i, t, n), w = e[a++] ^ oe(s, i, t, n, r);
+  return { s0: f, s1: u, s2: y, s3: w };
 }
 function Fs(e, t, n, r, i) {
   const { sbox2: s, T01: o, T23: c } = xr;
@@ -2116,13 +2116,13 @@ function Fs(e, t, n, r, i) {
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
   for (let g = 0; g < l; g++) {
-    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), y = e[a++] ^ xe(o, c, r, n, t, i), E = e[a++] ^ xe(o, c, i, r, n, t);
-    t = h, n = d, r = y, i = E;
+    const 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), m = e[a++] ^ xe(o, c, i, r, n, t);
+    t = h, n = d, r = p, i = m;
   }
-  const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), p = e[a++] ^ oe(s, r, n, t, i), w = e[a++] ^ oe(s, i, r, n, t);
-  return { s0: f, s1: u, s2: p, s3: w };
+  const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), y = e[a++] ^ oe(s, r, n, t, i), w = e[a++] ^ oe(s, i, r, n, t);
+  return { s0: f, s1: u, s2: y, s3: w };
 }
-function Kr(e, t) {
+function Nr(e, t) {
   if (!t)
     return new Uint8Array(e);
   if (ue(t), t.length < e)
@@ -2130,20 +2130,20 @@ function Kr(e, t) {
   return t;
 }
 function Gs(e) {
-  if (ue(e), e.length % Ne !== 0)
-    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ne}`);
+  if (ue(e), e.length % Ke !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ke}`);
 }
 function Js(e, t, n) {
   let r = e.length;
-  const i = r % Ne;
+  const i = r % Ke;
   if (!t && i !== 0)
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
   const s = F(e);
   if (t) {
-    let a = Ne - i;
-    a || (a = Ne), r = r + a;
+    let a = Ke - i;
+    a || (a = Ke), r = r + a;
   }
-  const o = Kr(r, n), c = F(o);
+  const o = Nr(r, n), c = F(o);
   return { b: s, o: c, out: o };
 }
 function Ys(e, t) {
@@ -2164,35 +2164,35 @@ function Ys(e, t) {
 function Xs(e) {
   const t = new Uint8Array(16), n = F(t);
   t.set(e);
-  const r = Ne - e.length;
-  for (let i = Ne - r; i < Ne; i++)
+  const r = Ke - e.length;
+  for (let i = Ke - r; i < Ke; i++)
     t[i] = r;
   return n;
 }
-const Sr = /* @__PURE__ */ Ds({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
+const Sr = /* @__PURE__ */ qs({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
   ue(t), ue(n, 16);
   const i = !r.disablePadding;
   return {
     encrypt: (s, o) => {
-      const c = Nr(t), { b: a, o: l, out: f } = Js(s, i, o), u = F(n);
-      let p = u[0], w = u[1], g = u[2], h = u[3], d = 0;
+      const c = Kr(t), { b: a, o: l, out: f } = Js(s, i, o), u = F(n);
+      let y = u[0], w = u[1], g = u[2], h = u[3], d = 0;
       for (; d + 4 <= a.length; )
-        p ^= a[d + 0], w ^= a[d + 1], g ^= a[d + 2], h ^= a[d + 3], { s0: p, s1: w, s2: g, s3: h } = qn(c, p, w, g, h), l[d++] = p, l[d++] = w, l[d++] = g, l[d++] = h;
+        y ^= a[d + 0], w ^= a[d + 1], g ^= a[d + 2], h ^= a[d + 3], { s0: y, s1: w, s2: g, s3: h } = qn(c, y, w, g, h), l[d++] = y, l[d++] = w, l[d++] = g, l[d++] = h;
       if (i) {
-        const y = Xs(s.subarray(d * 4));
-        p ^= y[0], w ^= y[1], g ^= y[2], h ^= y[3], { s0: p, s1: w, s2: g, s3: h } = qn(c, p, w, g, h), l[d++] = p, l[d++] = w, l[d++] = g, l[d++] = h;
+        const p = Xs(s.subarray(d * 4));
+        y ^= p[0], w ^= p[1], g ^= p[2], h ^= p[3], { s0: y, s1: w, s2: g, s3: h } = qn(c, y, w, g, h), l[d++] = y, l[d++] = w, l[d++] = g, l[d++] = h;
       }
       return c.fill(0), f;
     },
     decrypt: (s, o) => {
       Gs(s);
-      const c = Zs(t), a = F(n), l = Kr(s.length, o), f = F(s), u = F(l);
-      let p = a[0], w = a[1], g = a[2], h = a[3];
+      const c = Zs(t), a = F(n), l = Nr(s.length, o), f = F(s), u = F(l);
+      let y = a[0], w = a[1], g = a[2], h = a[3];
       for (let d = 0; d + 4 <= f.length; ) {
-        const y = p, E = w, S = g, _ = h;
-        p = f[d + 0], w = f[d + 1], g = f[d + 2], h = f[d + 3];
-        const { s0: B, s1: m, s2: x, s3: N } = Fs(c, p, w, g, h);
-        u[d++] = B ^ y, u[d++] = m ^ E, u[d++] = x ^ S, u[d++] = N ^ _;
+        const p = y, m = w, S = g, _ = h;
+        y = f[d + 0], w = f[d + 1], g = f[d + 2], h = f[d + 3];
+        const { s0: k, s1: E, s2: x, s3: K } = Fs(c, y, w, g, h);
+        u[d++] = k ^ p, u[d++] = E ^ m, u[d++] = x ^ S, u[d++] = K ^ _;
       }
       return c.fill(0), Ys(l, i);
     }
@@ -2202,27 +2202,27 @@ Cr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
 }
-function zt(e) {
+function Wt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Xe = 64, no = 16, Br = 2 ** 32 - 1, Dn = new Uint32Array();
+const Xe = 64, no = 16, kr = 2 ** 32 - 1, jn = new Uint32Array();
 function ro(e, t, n, r, i, s, o, c) {
-  const a = i.length, l = new Uint8Array(Xe), f = F(l), u = zt(i) && zt(s), p = u ? F(i) : Dn, w = u ? F(s) : Dn;
+  const a = i.length, l = new Uint8Array(Xe), f = F(l), u = Wt(i) && Wt(s), y = u ? F(i) : jn, w = u ? F(s) : jn;
   for (let g = 0; g < a; o++) {
-    if (e(t, n, r, f, o, c), o >= Br)
+    if (e(t, n, r, f, o, c), o >= kr)
       throw new Error("arx: counter overflow");
     const h = Math.min(Xe, a - g);
     if (u && h === Xe) {
       const d = g / 4;
       if (g % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let y = 0, E; y < no; y++)
-        E = d + y, w[E] = p[E] ^ f[y];
+      for (let p = 0, m; p < no; p++)
+        m = d + p, w[m] = y[m] ^ f[p];
       g += Xe;
       continue;
     }
-    for (let d = 0, y; d < h; d++)
-      y = g + d, s[y] = i[y] ^ l[d];
+    for (let d = 0, p; d < h; d++)
+      p = g + d, s[p] = i[p] ^ l[d];
     g += h;
   }
 }
@@ -2230,13 +2230,13 @@ function io(e, t) {
   const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = Hs({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return kt(i), kt(o), Hn(s), Hn(n), (c, a, l, f, u = 0) => {
+  return Bt(i), Bt(o), Dn(s), Dn(n), (c, a, l, f, u = 0) => {
     ue(c), ue(a), ue(l);
-    const p = l.length;
-    if (f || (f = new Uint8Array(p)), ue(f), kt(u), u < 0 || u >= Br)
+    const y = l.length;
+    if (f || (f = new Uint8Array(y)), ue(f), Bt(u), u < 0 || u >= kr)
       throw new Error("arx: counter overflow");
-    if (f.length < p)
-      throw new Error(`arx: output (${f.length}) is shorter than data (${p})`);
+    if (f.length < y)
+      throw new Error(`arx: output (${f.length}) is shorter than data (${y})`);
     const w = [];
     let g = c.length, h, d;
     if (g === 32)
@@ -2245,34 +2245,34 @@ function io(e, t) {
       h = new Uint8Array(32), h.set(c), h.set(c, 16), d = to, w.push(h);
     else
       throw new Error(`arx: invalid 32-byte key, got length=${g}`);
-    zt(a) || (a = a.slice(), w.push(a));
-    const y = F(h);
+    Wt(a) || (a = a.slice(), w.push(a));
+    const p = F(h);
     if (r) {
       if (a.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(d, y, F(a.subarray(0, 16)), y), a = a.subarray(16);
+      r(d, p, F(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 m = 16 - i;
+    if (m !== a.length)
+      throw new Error(`arx: nonce must be ${m} or 16 bytes`);
+    if (m !== 12) {
       const _ = new Uint8Array(12);
       _.set(a, s ? 0 : 12 - a.length), a = _, w.push(a);
     }
     const S = F(a);
-    for (ro(e, d, y, S, l, f, u, o); w.length > 0; )
+    for (ro(e, d, p, S, l, f, u, o); w.length > 0; )
       w.pop().fill(0);
     return f;
   };
 }
 function so(e, t, n, r, i, s = 20) {
-  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], p = t[2], w = t[3], g = t[4], h = t[5], d = t[6], y = t[7], E = i, S = n[0], _ = n[1], B = n[2], m = o, x = c, N = a, M = l, I = f, A = u, R = p, T = w, q = g, b = h, v = d, K = y, k = E, C = S, U = _, O = B;
+  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], y = t[2], w = t[3], g = t[4], h = t[5], d = t[6], p = t[7], m = i, S = n[0], _ = n[1], k = n[2], E = o, x = c, K = a, M = l, I = f, A = u, R = y, T = w, D = g, b = h, v = d, N = p, B = m, C = S, U = _, O = k;
   for (let ee = 0; ee < s; ee += 2)
-    m = m + I | 0, k = L(k ^ m, 16), q = q + k | 0, I = L(I ^ q, 12), m = m + I | 0, k = L(k ^ m, 8), q = q + k | 0, I = L(I ^ q, 7), x = x + A | 0, C = L(C ^ x, 16), b = b + C | 0, A = L(A ^ b, 12), x = x + A | 0, C = L(C ^ x, 8), b = b + C | 0, A = L(A ^ b, 7), N = N + R | 0, U = L(U ^ N, 16), v = v + U | 0, R = L(R ^ v, 12), N = N + R | 0, U = L(U ^ N, 8), v = v + U | 0, R = L(R ^ v, 7), M = M + T | 0, O = L(O ^ M, 16), K = K + O | 0, T = L(T ^ K, 12), M = M + T | 0, O = L(O ^ M, 8), K = K + O | 0, T = L(T ^ K, 7), m = m + A | 0, O = L(O ^ m, 16), v = v + O | 0, A = L(A ^ v, 12), m = m + A | 0, O = L(O ^ m, 8), v = v + O | 0, A = L(A ^ v, 7), x = x + R | 0, k = L(k ^ x, 16), K = K + k | 0, R = L(R ^ K, 12), x = x + R | 0, k = L(k ^ x, 8), K = K + k | 0, R = L(R ^ K, 7), N = N + T | 0, C = L(C ^ N, 16), q = q + C | 0, T = L(T ^ q, 12), N = N + T | 0, C = L(C ^ N, 8), q = q + C | 0, T = L(T ^ q, 7), M = M + I | 0, U = L(U ^ M, 16), b = b + U | 0, I = L(I ^ b, 12), M = M + I | 0, U = L(U ^ M, 8), b = b + U | 0, I = L(I ^ b, 7);
+    E = E + I | 0, B = L(B ^ E, 16), D = D + B | 0, I = L(I ^ D, 12), E = E + I | 0, B = L(B ^ E, 8), D = D + B | 0, I = L(I ^ D, 7), x = x + A | 0, C = L(C ^ x, 16), b = b + C | 0, A = L(A ^ b, 12), x = x + A | 0, C = L(C ^ x, 8), b = b + C | 0, A = L(A ^ b, 7), K = K + R | 0, U = L(U ^ K, 16), v = v + U | 0, R = L(R ^ v, 12), K = K + R | 0, U = L(U ^ K, 8), v = v + U | 0, R = L(R ^ v, 7), M = M + T | 0, O = L(O ^ M, 16), N = N + O | 0, T = L(T ^ N, 12), M = M + T | 0, O = L(O ^ M, 8), N = N + O | 0, T = L(T ^ N, 7), E = E + A | 0, O = L(O ^ E, 16), v = v + O | 0, A = L(A ^ v, 12), E = E + A | 0, O = L(O ^ E, 8), v = v + O | 0, A = L(A ^ v, 7), x = x + R | 0, B = L(B ^ x, 16), N = N + B | 0, R = L(R ^ N, 12), x = x + R | 0, B = L(B ^ x, 8), N = N + B | 0, R = L(R ^ N, 7), K = K + T | 0, C = L(C ^ K, 16), D = D + C | 0, T = L(T ^ D, 12), K = K + T | 0, C = L(C ^ K, 8), D = D + C | 0, T = L(T ^ D, 7), M = M + I | 0, U = L(U ^ M, 16), b = b + U | 0, I = L(I ^ b, 12), M = M + I | 0, U = L(U ^ M, 8), b = b + U | 0, I = L(I ^ b, 7);
   let $ = 0;
-  r[$++] = o + m | 0, r[$++] = c + x | 0, r[$++] = a + N | 0, r[$++] = l + M | 0, r[$++] = f + I | 0, r[$++] = u + A | 0, r[$++] = p + R | 0, r[$++] = w + T | 0, r[$++] = g + q | 0, r[$++] = h + b | 0, r[$++] = d + v | 0, r[$++] = y + K | 0, r[$++] = E + k | 0, r[$++] = S + C | 0, r[$++] = _ + U | 0, r[$++] = B + O | 0;
+  r[$++] = o + E | 0, r[$++] = c + x | 0, r[$++] = a + K | 0, r[$++] = l + M | 0, r[$++] = f + I | 0, r[$++] = u + A | 0, r[$++] = y + R | 0, r[$++] = w + T | 0, r[$++] = g + D | 0, r[$++] = h + b | 0, r[$++] = d + v | 0, r[$++] = p + N | 0, r[$++] = m + B | 0, r[$++] = S + C | 0, r[$++] = _ + U | 0, r[$++] = k + O | 0;
 }
-const kr = /* @__PURE__ */ io(so, {
+const Br = /* @__PURE__ */ io(so, {
   counterRight: !1,
   counterLength: 4,
   allowShortKeys: !1
@@ -2314,18 +2314,18 @@ class Ir extends dr {
 }
 const dt = (e, t, n) => new Ir(e, t).update(n).digest();
 dt.create = (e, t) => new Ir(e, t);
-function nn(e, t, n) {
+function rn(e, t, n) {
   return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), dt(e, Je(n), Je(t));
 }
-const _t = new Uint8Array([0]), jn = new Uint8Array();
+const _t = new Uint8Array([0]), zn = new Uint8Array();
 function _r(e, t, n, r = 32) {
   if (se.hash(e), se.number(r), r > 255 * e.outputLen)
     throw new Error("Length should be <= 255*HashLen");
   const i = Math.ceil(r / e.outputLen);
-  n === void 0 && (n = jn);
+  n === void 0 && (n = zn);
   const s = new Uint8Array(i * e.outputLen), o = dt.create(e, t), c = o._cloneInto(), a = new Uint8Array(o.outputLen);
   for (let l = 0; l < i; l++)
-    _t[0] = l + 1, c.update(l === 0 ? jn : a).update(n).update(_t).digestInto(a), s.set(a, e.outputLen * l), o._cloneInto(c);
+    _t[0] = l + 1, c.update(l === 0 ? zn : a).update(n).update(_t).digestInto(a), s.set(a, e.outputLen * l), o._cloneInto(c);
   return o.destroy(), c.destroy(), a.fill(0), _t.fill(0), s.slice(0, r);
 }
 var oo = Object.defineProperty, H = (e, t) => {
@@ -2349,7 +2349,7 @@ var co = {};
 H(co, {
   Queue: () => ho,
   QueueNode: () => Ur,
-  binarySearch: () => rn,
+  binarySearch: () => sn,
   bytesToHex: () => P,
   hexToBytes: () => j,
   insertEventIntoAscendingList: () => fo,
@@ -2369,14 +2369,14 @@ function uo(e) {
   }
 }
 function lo(e, t) {
-  const [n, r] = rn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
+  const [n, r] = sn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
   return r || e.splice(n, 0, t), e;
 }
 function fo(e, t) {
-  const [n, r] = rn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
+  const [n, r] = sn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
   return r || e.splice(n, 0, t), e;
 }
-function rn(e, t) {
+function sn(e, t) {
   let n = 0, r = e.length - 1;
   for (; n <= r; ) {
     const i = Math.floor((n + r) / 2), s = t(e[i]);
@@ -2422,12 +2422,12 @@ var Ur = class {
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = P(Ze.getPublicKey(t)), n.id = qe(n), n.sig = P(Ze.sign(qe(n), t)), n[Te] = !0, n;
+    return n.pubkey = P(Ze.getPublicKey(t)), n.id = De(n), n.sig = P(Ze.sign(De(n), t)), n[Te] = !0, n;
   }
   verifyEvent(e) {
     if (typeof e[Te] == "boolean")
       return e[Te];
-    const t = qe(e);
+    const t = De(e);
     if (t !== e.id)
       return e[Te] = !1, !1;
     try {
@@ -2443,25 +2443,25 @@ function yo(e) {
     throw new Error("can't serialize event with wrong or missing properties");
   return JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content]);
 }
-function qe(e) {
+function De(e) {
   let t = fe(ne.encode(yo(e)));
   return P(t);
 }
-var yt = new po(), ke = yt.generateSecretKey, ae = yt.getPublicKey, Q = yt.finalizeEvent, gt = yt.verifyEvent, go = {};
+var yt = new po(), Be = yt.generateSecretKey, ae = yt.getPublicKey, Q = yt.finalizeEvent, gt = yt.verifyEvent, go = {};
 H(go, {
   Application: () => ya,
-  BadgeAward: () => Ko,
+  BadgeAward: () => No,
   BadgeDefinition: () => ca,
   BlockedRelaysList: () => Vo,
   BookmarkList: () => jo,
   Bookmarksets: () => sa,
   Calendar: () => xa,
-  CalendarEventRSVP: () => Na,
+  CalendarEventRSVP: () => Ka,
   ChannelCreation: () => Mr,
-  ChannelHideMessage: () => qr,
+  ChannelHideMessage: () => Dr,
   ChannelMessage: () => Hr,
   ChannelMetadata: () => Pr,
-  ChannelMuteUser: () => Dr,
+  ChannelMuteUser: () => qr,
   ClassifiedListing: () => ba,
   ClientAuth: () => zr,
   CommunitiesList: () => zo,
@@ -2477,16 +2477,16 @@ H(go, {
   DraftLong: () => da,
   Emojisets: () => pa,
   EncryptedDirectMessage: () => xo,
-  EventDeletion: () => No,
+  EventDeletion: () => Ko,
   FileMetadata: () => Ao,
   FileServerPreference: () => Yo,
   Followsets: () => na,
-  GenericRepost: () => un,
+  GenericRepost: () => ln,
   Genericlists: () => ra,
   GiftWrap: () => jr,
-  HTTPAuth: () => ln,
+  HTTPAuth: () => fn,
   Handlerinformation: () => Sa,
-  Handlerrecommendation: () => Ka,
+  Handlerrecommendation: () => Na,
   Highlights: () => Po,
   InterestsList: () => Fo,
   Interestsets: () => ua,
@@ -2505,18 +2505,18 @@ H(go, {
   NWCWalletResponse: () => ea,
   NostrConnect: () => ta,
   OpenTimestamps: () => So,
-  Pinlist: () => qo,
+  Pinlist: () => Do,
   PrivateDirectMessage: () => Or,
-  ProblemTracker: () => Bo,
+  ProblemTracker: () => ko,
   ProfileBadges: () => aa,
   PublicChatsList: () => Wo,
-  Reaction: () => cn,
+  Reaction: () => un,
   RecommendRelay: () => mo,
-  RelayList: () => Do,
+  RelayList: () => qo,
   Relaysets: () => ia,
-  Report: () => ko,
+  Report: () => Bo,
   Reporting: () => Io,
-  Repost: () => an,
+  Repost: () => cn,
   Seal: () => Tr,
   SearchRelaysList: () => Zo,
   ShortTextNote: () => Rr,
@@ -2527,41 +2527,41 @@ H(go, {
   ZapGoal: () => To,
   ZapRequest: () => Oo,
   classifyKind: () => wo,
-  isAddressableKind: () => on,
+  isAddressableKind: () => an,
   isEphemeralKind: () => $r,
   isKind: () => bo,
   isRegularKind: () => Lr,
-  isReplaceableKind: () => sn
+  isReplaceableKind: () => on
 });
 function Lr(e) {
   return 1e3 <= e && e < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(e);
 }
-function sn(e) {
+function on(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
 function $r(e) {
   return 2e4 <= e && e < 3e4;
 }
-function on(e) {
+function an(e) {
   return 3e4 <= e && e < 4e4;
 }
 function wo(e) {
-  return Lr(e) ? "regular" : sn(e) ? "replaceable" : $r(e) ? "ephemeral" : on(e) ? "parameterized" : "unknown";
+  return Lr(e) ? "regular" : on(e) ? "replaceable" : $r(e) ? "ephemeral" : an(e) ? "parameterized" : "unknown";
 }
 function bo(e, t) {
   const n = t instanceof Array ? t : [t];
   return pt(e) && n.includes(e.kind) || !1;
 }
-var vo = 0, Rr = 1, mo = 2, Eo = 3, xo = 4, No = 5, an = 6, cn = 7, Ko = 8, Tr = 13, Or = 14, un = 16, Mr = 40, Pr = 41, Hr = 42, qr = 43, Dr = 44, So = 1040, jr = 1059, Ao = 1063, Co = 1311, Bo = 1971, ko = 1984, Io = 1984, _o = 1985, Uo = 4550, Lo = 5999, $o = 6999, Ro = 7e3, To = 9041, Oo = 9734, Mo = 9735, Po = 9802, Ho = 1e4, qo = 10001, Do = 10002, jo = 10003, zo = 10004, Wo = 10005, Vo = 10006, Zo = 10007, Fo = 10015, Go = 10030, Jo = 10050, Yo = 10096, Xo = 13194, Qo = 21e3, zr = 22242, Wr = 23194, ea = 23195, ta = 24133, ln = 27235, na = 3e4, ra = 30001, ia = 30002, sa = 30003, oa = 30004, aa = 30008, ca = 30009, ua = 30015, la = 30017, fa = 30018, ha = 30023, da = 30024, pa = 30030, ya = 30078, ga = 30311, wa = 30315, ba = 30402, va = 30403, ma = 31922, Ea = 31923, xa = 31924, Na = 31925, Ka = 31989, Sa = 31990, Aa = 34550, Ca = {};
+var vo = 0, Rr = 1, mo = 2, Eo = 3, xo = 4, Ko = 5, cn = 6, un = 7, No = 8, Tr = 13, Or = 14, ln = 16, Mr = 40, Pr = 41, Hr = 42, Dr = 43, qr = 44, So = 1040, jr = 1059, Ao = 1063, Co = 1311, ko = 1971, Bo = 1984, Io = 1984, _o = 1985, Uo = 4550, Lo = 5999, $o = 6999, Ro = 7e3, To = 9041, Oo = 9734, Mo = 9735, Po = 9802, Ho = 1e4, Do = 10001, qo = 10002, jo = 10003, zo = 10004, Wo = 10005, Vo = 10006, Zo = 10007, Fo = 10015, Go = 10030, Jo = 10050, Yo = 10096, Xo = 13194, Qo = 21e3, zr = 22242, Wr = 23194, ea = 23195, ta = 24133, fn = 27235, na = 3e4, ra = 30001, ia = 30002, sa = 30003, oa = 30004, aa = 30008, ca = 30009, ua = 30015, la = 30017, fa = 30018, ha = 30023, da = 30024, pa = 30030, ya = 30078, ga = 30311, wa = 30315, ba = 30402, va = 30403, ma = 31922, Ea = 31923, xa = 31924, Ka = 31925, Na = 31989, Sa = 31990, Aa = 34550, Ca = {};
 H(Ca, {
-  getHex64: () => fn,
+  getHex64: () => hn,
   getInt: () => Vr,
-  getSubscriptionId: () => Ba,
-  matchEventId: () => ka,
+  getSubscriptionId: () => ka,
+  matchEventId: () => Ba,
   matchEventKind: () => _a,
   matchEventPubkey: () => Ia
 });
-function fn(e, t) {
+function hn(e, t) {
   let n = t.length + 3, r = e.indexOf(`"${t}":`) + n, i = e.slice(r).indexOf('"') + r + 1;
   return e.slice(i, i + 64);
 }
@@ -2569,7 +2569,7 @@ function Vr(e, t) {
   let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), s = Math.min(i.indexOf(","), i.indexOf("}"));
   return parseInt(i.slice(0, s), 10);
 }
-function Ba(e) {
+function ka(e) {
   let t = e.slice(0, 22).indexOf('"EVENT"');
   if (t === -1)
     return null;
@@ -2582,11 +2582,11 @@ function Ba(e) {
   let s = r + 1 + i;
   return e.slice(r + 1, s);
 }
-function ka(e, t) {
-  return t === fn(e, "id");
+function Ba(e, t) {
+  return t === hn(e, "id");
 }
 function Ia(e, t) {
-  return t === fn(e, "pubkey");
+  return t === hn(e, "pubkey");
 }
 function _a(e, t) {
   return t === Vr(e, "kind");
@@ -2619,16 +2619,16 @@ try {
 var Ta = {};
 H(Ta, {
   BECH32_REGEX: () => Zr,
-  Bech32MaxSize: () => hn,
+  Bech32MaxSize: () => dn,
   NostrTypeGuard: () => Oa,
   decode: () => wt,
   decodeNostrURI: () => Pa,
   encodeBytes: () => vt,
   naddrEncode: () => Wa,
   neventEncode: () => za,
-  noteEncode: () => Da,
+  noteEncode: () => qa,
   nprofileEncode: () => ja,
-  npubEncode: () => qa,
+  npubEncode: () => Da,
   nsecEncode: () => Ha
 });
 var Oa = {
@@ -2639,7 +2639,7 @@ var Oa = {
   isNPub: (e) => /^npub1[a-z\d]{58}$/.test(e || ""),
   isNote: (e) => /^note1[a-z\d]+$/.test(e || ""),
   isNcryptsec: (e) => /^ncryptsec1[a-z\d]+$/.test(e || "")
-}, hn = 5e3, Zr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
+}, dn = 5e3, Zr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
 function Ma(e) {
   const t = new Uint8Array(4);
   return t[0] = e >> 24 & 255, t[1] = e >> 16 & 255, t[2] = e >> 8 & 255, t[3] = e & 255, t;
@@ -2653,7 +2653,7 @@ function Pa(e) {
 }
 function wt(e) {
   var i, s, o, c, a, l, f;
-  let { prefix: t, words: n } = ze.decode(e, hn), r = new Uint8Array(ze.fromWords(n));
+  let { prefix: t, words: n } = ze.decode(e, dn), r = new Uint8Array(ze.fromWords(n));
   switch (t) {
     case "nprofile": {
       let u = Ut(r);
@@ -2665,7 +2665,7 @@ function wt(e) {
         type: "nprofile",
         data: {
           pubkey: P(u[0][0]),
-          relays: u[1] ? u[1].map((p) => le.decode(p)) : []
+          relays: u[1] ? u[1].map((y) => le.decode(y)) : []
         }
       };
     }
@@ -2683,7 +2683,7 @@ function wt(e) {
         type: "nevent",
         data: {
           id: P(u[0][0]),
-          relays: u[1] ? u[1].map((p) => le.decode(p)) : [],
+          relays: u[1] ? u[1].map((y) => le.decode(y)) : [],
           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
         }
@@ -2707,7 +2707,7 @@ function wt(e) {
           identifier: le.decode(u[0][0]),
           pubkey: P(u[2][0]),
           kind: parseInt(P(u[3][0]), 16),
-          relays: u[1] ? u[1].map((p) => le.decode(p)) : []
+          relays: u[1] ? u[1].map((y) => le.decode(y)) : []
         }
       };
     }
@@ -2733,21 +2733,21 @@ function Ut(e) {
 function Ha(e) {
   return vt("nsec", e);
 }
-function qa(e) {
+function Da(e) {
   return vt("npub", j(e));
 }
-function Da(e) {
+function qa(e) {
   return vt("note", j(e));
 }
 function bt(e, t) {
   let n = ze.toWords(t);
-  return ze.encode(e, n, hn);
+  return ze.encode(e, n, dn);
 }
 function vt(e, t) {
   return bt(e, t);
 }
 function ja(e) {
-  let t = dn({
+  let t = pn({
     0: [j(e.pubkey)],
     1: (e.relays || []).map((n) => ne.encode(n))
   });
@@ -2756,7 +2756,7 @@ function ja(e) {
 function za(e) {
   let t;
   e.kind !== void 0 && (t = Ma(e.kind));
-  let n = dn({
+  let n = pn({
     0: [j(e.id)],
     1: (e.relays || []).map((r) => ne.encode(r)),
     2: e.author ? [j(e.author)] : [],
@@ -2767,7 +2767,7 @@ function za(e) {
 function Wa(e) {
   let t = new ArrayBuffer(4);
   new DataView(t).setUint32(0, e.kind, !1);
-  let n = dn({
+  let n = pn({
     0: [ne.encode(e.identifier)],
     1: (e.relays || []).map((r) => ne.encode(r)),
     2: [j(e.pubkey)],
@@ -2775,7 +2775,7 @@ function Wa(e) {
   });
   return bt("naddr", n);
 }
-function dn(e) {
+function pn(e) {
   let t = [];
   return Object.entries(e).reverse().forEach(([n, r]) => {
     r.forEach((i) => {
@@ -2804,14 +2804,14 @@ function Gr(e) {
 }
 var Fa = {};
 H(Fa, {
-  NIP05_REGEX: () => pn,
+  NIP05_REGEX: () => yn,
   isNip05: () => Ga,
   isValid: () => Xa,
   queryProfile: () => Jr,
   searchDomain: () => Ya,
   useFetchImplementation: () => Ja
 });
-var pn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Ga = (e) => pn.test(e || ""), mt;
+var yn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Ga = (e) => yn.test(e || ""), mt;
 try {
   mt = fetch;
 } catch {
@@ -2831,7 +2831,7 @@ async function Ya(e, t = "") {
 }
 async function Jr(e) {
   var i;
-  const t = e.match(pn);
+  const t = e.match(yn);
   if (!t)
     return null;
   const [, n = "_", r] = t;
@@ -2984,22 +2984,22 @@ H(ac, {
   createRumor: () => ci,
   createSeal: () => ui,
   createWrap: () => li,
-  unwrapEvent: () => vn,
+  unwrapEvent: () => mn,
   unwrapManyEvents: () => fi,
   wrapEvent: () => st,
   wrapManyEvents: () => pc
 });
-var D = {};
-H(D, {
-  decrypt: () => bn,
-  encrypt: () => wn,
-  getConversationKey: () => yn,
+var q = {};
+H(q, {
+  decrypt: () => vn,
+  encrypt: () => bn,
+  getConversationKey: () => gn,
   v2: () => hc
 });
 var ei = 1, ti = 65535;
-function yn(e, t) {
+function gn(e, t) {
   const n = _e.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return nn(fe, n, "nip44-v2");
+  return rn(fe, n, "nip44-v2");
 }
 function ni(e, t) {
   const n = _r(fe, e, t, 76);
@@ -3009,7 +3009,7 @@ function ni(e, t) {
     hmac_key: n.subarray(44, 76)
   };
 }
-function gn(e) {
+function wn(e) {
   if (!Number.isSafeInteger(e) || e < 1)
     throw new Error("expected positive integer");
   if (e <= 32)
@@ -3024,12 +3024,12 @@ function cc(e) {
   return new DataView(t.buffer).setUint16(0, e, !1), t;
 }
 function uc(e) {
-  const t = ne.encode(e), n = t.length, r = cc(n), i = new Uint8Array(gn(n) - n);
+  const t = ne.encode(e), n = t.length, r = cc(n), i = new Uint8Array(wn(n) - n);
   return ft(r, t, i);
 }
 function lc(e) {
   const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
-  if (t < ei || t > ti || n.length !== t || e.length !== 2 + gn(t))
+  if (t < ei || t > ti || n.length !== t || e.length !== 2 + wn(t))
     throw new Error("invalid padding");
   return le.decode(n);
 }
@@ -3065,25 +3065,25 @@ function fc(e) {
     mac: n.subarray(-32)
   };
 }
-function wn(e, t, n = yr(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ni(t, n), o = uc(e), c = kr(r, i, o), a = ri(s, c, n);
+function bn(e, t, n = yr(32)) {
+  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ni(t, n), o = uc(e), c = Br(r, i, o), a = ri(s, c, n);
   return he.encode(ft(new Uint8Array([2]), n, c, a));
 }
-function bn(e, t) {
+function vn(e, t) {
   const { nonce: n, ciphertext: r, mac: i } = fc(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = ni(t, n), a = ri(c, r, n);
-  if (!qs(a, i))
+  if (!Ds(a, i))
     throw new Error("invalid MAC");
-  const l = kr(s, o, r);
+  const l = Br(s, o, r);
   return lc(l);
 }
 var hc = {
   utils: {
-    getConversationKey: yn,
-    calcPaddedLen: gn
+    getConversationKey: gn,
+    calcPaddedLen: wn
   },
-  encrypt: wn,
-  decrypt: bn
-}, dc = 2 * 24 * 60 * 60, ii = () => Math.round(Date.now() / 1e3), si = () => Math.round(ii() - Math.random() * dc), oi = (e, t) => yn(e, t), ai = (e, t, n) => wn(JSON.stringify(e), oi(t, n)), zn = (e, t) => JSON.parse(bn(e.content, oi(t, e.pubkey)));
+  encrypt: bn,
+  decrypt: vn
+}, dc = 2 * 24 * 60 * 60, ii = () => Math.round(Date.now() / 1e3), si = () => Math.round(ii() - Math.random() * dc), oi = (e, t) => gn(e, t), ai = (e, t, n) => bn(JSON.stringify(e), oi(t, n)), Wn = (e, t) => JSON.parse(vn(e.content, oi(t, e.pubkey)));
 function ci(e, t) {
   const n = {
     created_at: ii(),
@@ -3092,7 +3092,7 @@ function ci(e, t) {
     ...e,
     pubkey: ae(t)
   };
-  return n.id = qe(n), n;
+  return n.id = De(n), n;
 }
 function ui(e, t, n) {
   return Q(
@@ -3106,7 +3106,7 @@ function ui(e, t, n) {
   );
 }
 function li(e, t) {
-  const n = ke();
+  const n = Be();
   return Q(
     {
       kind: jr,
@@ -3129,14 +3129,14 @@ function pc(e, t, n) {
     i.push(st(e, t, s));
   }), i;
 }
-function vn(e, t) {
-  const n = zn(e, t);
-  return zn(n, t);
+function mn(e, t) {
+  const n = Wn(e, t);
+  return Wn(n, t);
 }
 function fi(e, t) {
   let n = [];
   return e.forEach((r) => {
-    n.push(vn(r, t));
+    n.push(mn(r, t));
   }), n.sort((r, i) => r.created_at - i.created_at), n;
 }
 function yc(e, t, n, r) {
@@ -3161,7 +3161,7 @@ function gc(e, t, n, r, i) {
     (o) => hi(e, o, n, r, i)
   );
 }
-var wc = vn, bc = fi, vc = {};
+var wc = mn, bc = fi, vc = {};
 H(vc, {
   finishRepostEvent: () => mc,
   getRepostedEvent: () => Ec,
@@ -3171,7 +3171,7 @@ function mc(e, t, n, r) {
   var o;
   let i;
   const s = [...e.tags ?? [], ["e", t.id, n], ["p", t.pubkey]];
-  return t.kind === Rr ? i = an : (i = un, s.push(["k", String(t.kind)])), Q(
+  return t.kind === Rr ? i = cn : (i = ln, s.push(["k", String(t.kind)])), Q(
     {
       kind: i,
       tags: s,
@@ -3182,7 +3182,7 @@ function mc(e, t, n, r) {
   );
 }
 function di(e) {
-  if (![an, un].includes(e.kind))
+  if (![cn, ln].includes(e.kind))
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -3211,16 +3211,16 @@ function Ec(e, { skipVerification: t } = {}) {
 }
 var xc = {};
 H(xc, {
-  NOSTR_URI_REGEX: () => mn,
-  parse: () => Kc,
-  test: () => Nc
+  NOSTR_URI_REGEX: () => En,
+  parse: () => Nc,
+  test: () => Kc
 });
-var mn = new RegExp(`nostr:(${Zr.source})`);
-function Nc(e) {
-  return typeof e == "string" && new RegExp(`^${mn.source}$`).test(e);
-}
+var En = new RegExp(`nostr:(${Zr.source})`);
 function Kc(e) {
-  const t = e.match(new RegExp(`^${mn.source}$`));
+  return typeof e == "string" && new RegExp(`^${En.source}$`).test(e);
+}
+function Nc(e) {
+  const t = e.match(new RegExp(`^${En.source}$`));
   if (!t)
     throw new Error(`Invalid Nostr URI: ${e}`);
   return {
@@ -3239,7 +3239,7 @@ function Ac(e, t, n) {
   return Q(
     {
       ...e,
-      kind: cn,
+      kind: un,
       tags: [...e.tags ?? [], ...r, ["e", t.id], ["p", t.pubkey]],
       content: e.content ?? "+"
     },
@@ -3247,7 +3247,7 @@ function Ac(e, t, n) {
   );
 }
 function Cc(e) {
-  if (e.kind !== cn)
+  if (e.kind !== un)
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -3261,11 +3261,11 @@ function Cc(e) {
       author: n[1]
     };
 }
-var Bc = {};
-H(Bc, {
+var kc = {};
+H(kc, {
   parse: () => Ic
 });
-var kc = /\W/m, Wn = /\W |\W$|$|,| /m;
+var Bc = /\W/m, Vn = /\W |\W$|$|,| /m;
 function* Ic(e) {
   const t = e.length;
   let n = 0, r = 0;
@@ -3274,7 +3274,7 @@ function* Ic(e) {
     if (i === -1)
       break;
     if (e.substring(i - 5, i) === "nostr") {
-      const s = e.substring(i + 60).match(kc), o = s ? i + 60 + s.index : t;
+      const s = e.substring(i + 60).match(Bc), o = s ? i + 60 + s.index : t;
       try {
         let c, { data: a, type: l } = wt(e.substring(i + 1, o));
         switch (l) {
@@ -3295,7 +3295,7 @@ function* Ic(e) {
         continue;
       }
     } else if (e.substring(i - 5, i) === "https" || e.substring(i - 4, i) === "http") {
-      const s = e.substring(i + 4).match(Wn), o = s ? i + 4 + s.index : t, c = e[i - 1] === "s" ? 5 : 4;
+      const s = e.substring(i + 4).match(Vn), o = s ? i + 4 + s.index : t, c = e[i - 1] === "s" ? 5 : 4;
       try {
         let a = new URL(e.substring(i - c, o));
         if (a.hostname.indexOf(".") === -1)
@@ -3319,7 +3319,7 @@ function* Ic(e) {
         continue;
       }
     } else if (e.substring(i - 3, i) === "wss" || e.substring(i - 2, i) === "ws") {
-      const s = e.substring(i + 4).match(Wn), o = s ? i + 4 + s.index : t, c = e[i - 1] === "s" ? 3 : 2;
+      const s = e.substring(i + 4).match(Vn), o = s ? i + 4 + s.index : t, c = e[i - 1] === "s" ? 3 : 2;
       try {
         let a = new URL(e.substring(i - c, o));
         if (a.hostname.indexOf(".") === -1)
@@ -3400,7 +3400,7 @@ var Uc = (e, t) => {
     return;
   return Q(
     {
-      kind: qr,
+      kind: Dr,
       tags: [["e", e.channel_message_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3417,7 +3417,7 @@ var Uc = (e, t) => {
     return;
   return Q(
     {
-      kind: Dr,
+      kind: qr,
       tags: [["p", e.pubkey_to_mute], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3428,12 +3428,12 @@ var Uc = (e, t) => {
 H(Oc, {
   EMOJI_SHORTCODE_REGEX: () => pi,
   matchAll: () => Mc,
-  regex: () => En,
+  regex: () => xn,
   replaceAll: () => Pc
 });
-var pi = /:(\w+):/, En = () => new RegExp(`\\B${pi.source}\\B`, "g");
+var pi = /:(\w+):/, xn = () => new RegExp(`\\B${pi.source}\\B`, "g");
 function* Mc(e) {
-  const t = e.matchAll(En());
+  const t = e.matchAll(xn());
   for (const n of t)
     try {
       const [r, i] = n;
@@ -3447,27 +3447,27 @@ function* Mc(e) {
     }
 }
 function Pc(e, t) {
-  return e.replaceAll(En(), (n, r) => t({
+  return e.replaceAll(xn(), (n, r) => t({
     shortcode: n,
     name: r
   }));
 }
 var Hc = {};
 H(Hc, {
-  useFetchImplementation: () => qc,
-  validateGithub: () => Dc
+  useFetchImplementation: () => Dc,
+  validateGithub: () => qc
 });
-var xn;
+var Kn;
 try {
-  xn = fetch;
+  Kn = fetch;
 } catch {
 }
-function qc(e) {
-  xn = e;
+function Dc(e) {
+  Kn = e;
 }
-async function Dc(e, t, n) {
+async function qc(e, t, n) {
   try {
-    return await (await xn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
+    return await (await Kn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
   } catch {
     return !1;
   }
@@ -3478,10 +3478,10 @@ H(jc, {
   parseConnectionString: () => zc
 });
 function zc(e) {
-  const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), s = n.get("secret");
-  if (!r || !i || !s)
+  const { host: t, pathname: n, searchParams: r } = new URL(e), i = n || t, s = r.get("relay"), o = r.get("secret");
+  if (!i || !s || !o)
     throw new Error("invalid connection string");
-  return { pubkey: r, relay: i, secret: s };
+  return { pubkey: i, relay: s, secret: o };
 }
 async function Wc(e, t, n) {
   const i = Fr(t, e, JSON.stringify({
@@ -3539,40 +3539,31 @@ async function Jc(e) {
   }
   return null;
 }
-function Yc({
-  profile: e,
-  event: t,
-  amount: n,
-  relays: r,
-  comment: i = ""
-}) {
-  if (!n)
-    throw new Error("amount not given");
-  if (!e)
-    throw new Error("profile not given");
-  let s = {
+function Yc(e) {
+  let t = {
     kind: 9734,
     created_at: Math.round(Date.now() / 1e3),
-    content: i,
+    content: e.comment || "",
     tags: [
-      ["p", e],
-      ["amount", n.toString()],
-      ["relays", ...r]
+      ["p", "pubkey" in e ? e.pubkey : e.event.pubkey],
+      ["amount", e.amount.toString()],
+      ["relays", ...e.relays]
     ]
   };
-  if (t && typeof t == "string" && s.tags.push(["e", t]), t && typeof t == "object") {
-    if (sn(t.kind)) {
-      const o = ["a", `${t.kind}:${t.pubkey}:`];
-      s.tags.push(o);
-    } else if (on(t.kind)) {
-      let o = t.tags.find(([a, l]) => a === "d" && l);
-      if (!o)
+  if ("event" in e) {
+    if (t.tags.push(["e", e.event.id]), on(e.event.kind)) {
+      const n = ["a", `${e.event.kind}:${e.event.pubkey}:`];
+      t.tags.push(n);
+    } else if (an(e.event.kind)) {
+      let n = e.event.tags.find(([i, s]) => i === "d" && s);
+      if (!n)
         throw new Error("d tag not found or is empty");
-      const c = ["a", `${t.kind}:${t.pubkey}:${o[1]}`];
-      s.tags.push(c);
+      const r = ["a", `${e.event.kind}:${e.event.pubkey}:${n[1]}`];
+      t.tags.push(r);
     }
+    t.tags.push(["k", e.event.kind.toString()]);
   }
-  return s;
+  return t;
 }
 function Xc(e) {
   let t;
@@ -3641,7 +3632,7 @@ function eu(e) {
 var tu = {};
 H(tu, {
   getToken: () => nu,
-  hashPayload: () => Kn,
+  hashPayload: () => Sn,
   unpackEventFromToken: () => gi,
   validateEvent: () => xi,
   validateEventKind: () => bi,
@@ -3654,7 +3645,7 @@ H(tu, {
 var yi = "Nostr ";
 async function nu(e, t, n, r = !1, i) {
   const s = {
-    kind: ln,
+    kind: fn,
     tags: [
       ["u", e],
       ["method", t]
@@ -3662,7 +3653,7 @@ async function nu(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && s.tags.push(["payload", Kn(i)]);
+  i && s.tags.push(["payload", Sn(i)]);
   const o = await n(s);
   return (r ? yi : "") + he.encode(ne.encode(JSON.stringify(o)));
 }
@@ -3687,7 +3678,7 @@ function wi(e) {
   return e.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - e.created_at < 60 : !1;
 }
 function bi(e) {
-  return e.kind === ln;
+  return e.kind === fn;
 }
 function vi(e, t) {
   const n = e.tags.find((r) => r[0] === "u");
@@ -3697,7 +3688,7 @@ function mi(e, t) {
   const n = e.tags.find((r) => r[0] === "method");
   return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
 }
-function Kn(e) {
+function Sn(e) {
   const t = fe(ne.encode(JSON.stringify(e)));
   return P(t);
 }
@@ -3705,7 +3696,7 @@ function Ei(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
   if (!n)
     return !1;
-  const r = Kn(t);
+  const r = Sn(t);
   return n.length > 0 && n[1] === r;
 }
 async function xi(e, t, n, r) {
@@ -3723,7 +3714,7 @@ async function xi(e, t, n, r) {
     throw new Error("Invalid nostr event, payload tag does not match request body hash");
   return !0;
 }
-const Oe = 1060, Vn = 30078, Zn = 1059, iu = 14, wu = 100, su = 1;
+const Oe = 1060, Lt = 30078, Zn = 1059, iu = 14, wu = 100, su = 1;
 function bu(e) {
   return JSON.stringify({
     version: su,
@@ -3838,7 +3829,7 @@ async function* mu(e) {
   }
 }
 function Me(e, t = new Uint8Array(32), n = 1) {
-  const r = nn(fe, e, t), i = [];
+  const r = rn(fe, e, t), i = [];
   for (let s = 1; s <= n; s++)
     i.push(_r(fe, r, new Uint8Array([s]), 32));
   return i;
@@ -3874,9 +3865,9 @@ class ot {
    * @returns A new Session instance
    */
   static init(t, n, r, i, s, o) {
-    const c = ke();
+    const c = Be();
     let a, l, f, u;
-    i ? ([a, l] = Me(s, D.getConversationKey(c, n), 2), f = {
+    i ? ([a, l] = Me(s, q.getConversationKey(c, n), 2), f = {
       publicKey: ae(r),
       privateKey: r
     }, u = {
@@ -3886,7 +3877,7 @@ class ot {
       publicKey: ae(r),
       privateKey: r
     });
-    const p = {
+    const y = {
       rootKey: a,
       theirNextNostrPublicKey: n,
       ourCurrentNostrKey: f,
@@ -3897,7 +3888,7 @@ class ot {
       receivingChainMessageNumber: 0,
       previousSendingChainMessageCount: 0,
       skippedKeys: {}
-    }, w = new ot(t, p);
+    }, w = new ot(t, y);
     return o && (w.name = o), w;
   }
   /**
@@ -3933,8 +3924,8 @@ class ot {
       tags: t.tags || [],
       pubkey: t.pubkey || au
     };
-    r.tags.some(([l]) => l === "ms") || r.tags.push(["ms", String(n)]), r.id = qe(r);
-    const [i, s] = this.ratchetEncrypt(JSON.stringify(r)), o = D.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNextNostrPublicKey), c = D.encrypt(JSON.stringify(i), o);
+    r.tags.some(([l]) => l === "ms") || r.tags.push(["ms", String(n)]), r.id = De(r);
+    const [i, s] = this.ratchetEncrypt(JSON.stringify(r)), o = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNextNostrPublicKey), c = q.encrypt(JSON.stringify(i), o);
     return { event: Q({
       content: s,
       kind: Oe,
@@ -3965,25 +3956,25 @@ class ot {
       number: this.state.sendingChainMessageNumber++,
       nextPublicKey: this.state.ourNextNostrKey.publicKey,
       previousChainLength: this.state.previousSendingChainMessageCount
-    }, D.encrypt(t, r)];
+    }, q.encrypt(t, r)];
   }
   ratchetDecrypt(t, n, r) {
     const i = this.trySkippedMessageKeys(t, n, r);
     if (i) return i;
     this.skipMessageKeys(t.number, r);
     const [s, o] = Me(this.state.receivingChainKey, new Uint8Array([1]), 2);
-    return this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++, D.decrypt(n, o);
+    return this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++, q.decrypt(n, o);
   }
   ratchetStep() {
     this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0;
-    const t = D.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [n, r] = Me(this.state.rootKey, t, 2);
+    const t = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [n, r] = Me(this.state.rootKey, t, 2);
     this.state.receivingChainKey = r, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
-    const i = ke();
+    const i = Be();
     this.state.ourNextNostrKey = {
       publicKey: ae(i),
       privateKey: i
     };
-    const s = D.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [o, c] = Me(n, s, 2);
+    const s = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [o, c] = Me(n, s, 2);
     this.state.rootKey = o, this.state.sendingChainKey = c;
   }
   // 3. MESSAGE KEY FUNCTIONS
@@ -3996,10 +3987,10 @@ class ot {
           headerKeys: [],
           messageKeys: {}
         }, this.state.ourCurrentNostrKey) {
-          const i = D.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
+          const i = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
           this.state.skippedKeys[n].headerKeys.includes(i) || this.state.skippedKeys[n].headerKeys.push(i);
         }
-        const r = D.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
+        const r = q.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
         this.state.skippedKeys[n].headerKeys.includes(r) || this.state.skippedKeys[n].headerKeys.push(r);
       }
       for (; this.state.receivingChainMessageNumber < t; ) {
@@ -4012,28 +4003,28 @@ class ot {
     const i = this.state.skippedKeys[r];
     if (!i) return null;
     const s = i.messageKeys[t.number];
-    return s ? (delete i.messageKeys[t.number], Object.keys(i.messageKeys).length === 0 && delete this.state.skippedKeys[r], D.decrypt(n, s)) : null;
+    return s ? (delete i.messageKeys[t.number], Object.keys(i.messageKeys).length === 0 && delete this.state.skippedKeys[r], q.decrypt(n, s)) : null;
   }
   // 4. NOSTR EVENT HANDLING
   decryptHeader(t) {
     const n = t.tags[0][1];
     if (this.state.ourCurrentNostrKey) {
-      const s = D.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
+      const s = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
       try {
-        return [JSON.parse(D.decrypt(n, s)), !1, !1];
+        return [JSON.parse(q.decrypt(n, s)), !1, !1];
       } catch {
       }
     }
-    const r = D.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
+    const r = q.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
     try {
-      return [JSON.parse(D.decrypt(n, r)), !0, !1];
+      return [JSON.parse(q.decrypt(n, r)), !0, !1];
     } catch {
     }
     const i = this.state.skippedKeys[t.pubkey];
     if (i != null && i.headerKeys)
       for (const s of i.headerKeys)
         try {
-          return [JSON.parse(D.decrypt(n, s)), !1, !0];
+          return [JSON.parse(q.decrypt(n, s)), !1, !0];
         } catch {
         }
     throw new Error("Failed to decrypt header with current and skipped header keys");
@@ -4050,7 +4041,7 @@ class ot {
       else if (!((r = this.state.skippedKeys[t.pubkey]) != null && r.messageKeys[i.number]))
         return;
       const c = this.ratchetDecrypt(i, t.content, t.pubkey), a = JSON.parse(c);
-      if (!pt(a) || a.id !== qe(a))
+      if (!pt(a) || a.id !== De(a))
         return;
       this.internalSubscriptions.forEach((l) => l(a, t));
     } catch (i) {
@@ -4079,7 +4070,7 @@ new TextDecoder("utf-8");
 new TextEncoder();
 function Qe(e, t) {
   const n = _e.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return nn(fe, n, "nip44-v2");
+  return rn(fe, n, "nip44-v2");
 }
 const cu = 2 * 24 * 60 * 60, uu = () => Math.round(Date.now() / 1e3), lu = () => Math.round(uu() - Math.random() * cu);
 class Pe {
@@ -4089,7 +4080,7 @@ class Pe {
   static createNew(t, n, r) {
     if (!t)
       throw new Error("Inviter public key is required");
-    const i = ke(), s = ae(i), o = P(ke());
+    const i = Be(), s = ae(i), o = P(Be());
     return new Pe(
       s,
       o,
@@ -4140,7 +4131,7 @@ class Pe {
     const { tags: n } = t;
     if (!n)
       throw new Error("Invalid invite event: missing tags");
-    const r = (a = n.find(([p]) => p === "ephemeralKey")) == null ? void 0 : a[1], i = (l = n.find(([p]) => p === "sharedSecret")) == null ? void 0 : l[1], s = t.pubkey, o = (f = n.find(([p]) => p === "d")) == null ? void 0 : f[1], c = (u = o == null ? void 0 : o.split("/")) == null ? void 0 : u[2];
+    const r = (a = n.find(([y]) => y === "ephemeralKey")) == null ? void 0 : a[1], i = (l = n.find(([y]) => y === "sharedSecret")) == null ? void 0 : l[1], s = t.pubkey, o = (f = n.find(([y]) => y === "d")) == null ? void 0 : f[1], c = (u = o == null ? void 0 : o.split("/")) == null ? void 0 : u[2];
     if (!r || !i)
       throw new Error("Invalid invite event: missing session key or sharedSecret");
     return new Pe(
@@ -4154,11 +4145,15 @@ class Pe {
   }
   static fromUser(t, n, r) {
     const i = {
-      kinds: [Vn],
+      kinds: [Lt],
       authors: [t],
       "#l": ["double-ratchet/invites"]
     }, s = /* @__PURE__ */ new Set();
     return n(i, (c) => {
+      if (c.pubkey !== t) {
+        console.error("Got invite event from wrong user", c.pubkey, "expected", t);
+        return;
+      }
       if (!s.has(c.id)) {
         s.add(c.id);
         try {
@@ -4198,7 +4193,7 @@ class Pe {
     if (!this.deviceId)
       throw new Error("Device ID is required");
     return {
-      kind: Vn,
+      kind: Lt,
       pubkey: this.inviter,
       content: "",
       created_at: Math.floor(Date.now() / 1e3),
@@ -4210,35 +4205,60 @@ class Pe {
       ]
     };
   }
+  /**
+   * Creates an "invite tombstone" event that clears the original content and removes the list tag.
+   * Used when the inviter logs out and wants to make the invite invisible to other devices.
+   */
+  getDeletionEvent() {
+    if (!this.deviceId)
+      throw new Error("Device ID is required");
+    return {
+      kind: Lt,
+      pubkey: this.inviter,
+      content: "",
+      // deliberately empty
+      created_at: Math.floor(Date.now() / 1e3),
+      tags: [
+        ["ephemeralKey", this.inviterEphemeralPublicKey],
+        ["sharedSecret", this.sharedSecret],
+        ["d", "double-ratchet/invites/" + this.deviceId]
+        // same d tag
+      ]
+    };
+  }
   /**
        * Called by the invitee. Accepts the invite and creates a new session with the inviter.
        *
        * @param nostrSubscribe - A function to subscribe to Nostr events
        * @param inviteePublicKey - The invitee's public key
        * @param encryptor - The invitee's secret key or a signing/encrypt function
+       * @param deviceId - Optional device ID to identify the invitee's device
        * @returns An object containing the new session and an event to be published
        *
        * 1. Inner event: No signature, content encrypted with DH(inviter, invitee).
-       *    Purpose: Authenticate invitee. Contains invitee session key.
+       *    Purpose: Authenticate invitee. Contains invitee session key and deviceId.
        * 2. Envelope: No signature, content encrypted with DH(inviter, random key).
        *    Purpose: Contains inner event. Hides invitee from others who might have the shared Nostr key.
   
        * Note: You need to publish the returned event on Nostr using NDK or another Nostr system of your choice,
        * so the inviter can create the session on their side.
        */
-  async accept(t, n, r) {
-    const i = ke(), s = ae(i), o = this.inviter || this.inviterEphemeralPublicKey, c = j(this.sharedSecret), a = ot.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), f = await (typeof r == "function" ? r : (d, y) => Promise.resolve(D.encrypt(d, Qe(r, y))))(s, o), u = {
+  async accept(t, n, r, i) {
+    const s = Be(), o = ae(s), c = this.inviter || this.inviterEphemeralPublicKey, a = j(this.sharedSecret), l = ot.init(t, this.inviterEphemeralPublicKey, s, !0, a, void 0), f = typeof r == "function" ? r : (m, S) => Promise.resolve(q.encrypt(m, Qe(r, S))), u = JSON.stringify({
+      sessionKey: o,
+      deviceId: i
+    }), y = await f(u, c), w = {
       pubkey: n,
-      content: await D.encrypt(f, c),
+      content: await q.encrypt(y, a),
       created_at: Math.floor(Date.now() / 1e3)
-    }, p = JSON.stringify(u), w = ke(), g = ae(w), h = {
+    }, g = JSON.stringify(w), h = Be(), d = ae(h), p = {
       kind: Zn,
-      pubkey: g,
-      content: D.encrypt(p, Qe(w, this.inviterEphemeralPublicKey)),
+      pubkey: d,
+      content: q.encrypt(g, Qe(h, this.inviterEphemeralPublicKey)),
       created_at: lu(),
       tags: [["p", this.inviterEphemeralPublicKey]]
     };
-    return { session: a, event: Q(h, w) };
+    return { session: l, event: Q(p, h) };
   }
   listen(t, n, r) {
     if (!this.inviterEphemeralPrivateKey)
@@ -4251,10 +4271,18 @@ class Pe {
       try {
         if (this.maxUses && this.usedBy.length >= this.maxUses)
           return;
-        const o = await D.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o), a = j(this.sharedSecret), l = c.pubkey;
+        const o = await q.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o), a = j(this.sharedSecret), l = c.pubkey;
         this.usedBy.push(l);
-        const f = await D.decrypt(c.content, a), p = await (typeof t == "function" ? t : (h, d) => Promise.resolve(D.decrypt(h, Qe(t, d))))(f, l), w = s.id, g = ot.init(n, p, this.inviterEphemeralPrivateKey, !1, a, w);
-        r(g, l);
+        const f = await q.decrypt(c.content, a), y = await (typeof t == "function" ? t : (p, m) => Promise.resolve(q.decrypt(p, Qe(t, m))))(f, l);
+        let w, g;
+        try {
+          const p = JSON.parse(y);
+          w = p.sessionKey, g = p.deviceId;
+        } catch {
+          w = y;
+        }
+        const h = s.id, d = ot.init(n, w, this.inviterEphemeralPrivateKey, !1, a, h);
+        r(d, l, g);
       } catch {
       }
     });
@@ -4262,7 +4290,7 @@ class Pe {
 }
 export {
   iu as CHAT_MESSAGE_KIND,
-  Vn as INVITE_EVENT_KIND,
+  Lt as INVITE_EVENT_KIND,
   Zn as INVITE_RESPONSE_KIND,
   Pe as Invite,
   wu as MAX_SKIP,