nostr-double-ratchet 0.0.20 → 0.0.22

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

@@ -1,7 +1,7 @@
 var bi = Object.defineProperty;
 var vi = (e, t, n) => t in e ? bi(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
 var te = (e, t, n) => vi(e, typeof t != "symbol" ? t + "" : t, n);
-function Kn(e) {
+function Sn(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -11,10 +11,10 @@ function zn(e, ...t) {
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
 }
-function Ei(e) {
+function mi(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Kn(e.outputLen), Kn(e.blockLen);
+  Sn(e.outputLen), Sn(e.blockLen);
 }
 function et(e, t = !0) {
   if (e.destroyed)
@@ -22,7 +22,7 @@ function et(e, t = !0) {
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function mi(e, t) {
+function Ei(e, t) {
   zn(e);
   const n = t.outputLen;
   if (e.length < n)
@@ -30,16 +30,16 @@ function mi(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 Vn = (e) => e instanceof Uint8Array, St = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, xi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Vn = (e) => e instanceof Uint8Array, Kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, xi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!xi)
   throw new Error("Non little-endian hardware is not supported");
-function Si(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 Zt(e) {
-  if (typeof e == "string" && (e = Si(e)), !Vn(e))
+function Wt(e) {
+  if (typeof e == "string" && (e = Ki(e)), !Vn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -58,8 +58,8 @@ let Wn = class {
     return this._cloneInto();
   }
 };
-function Ai(e) {
-  const t = (r) => e().update(Zt(r)).digest(), n = e();
+function Si(e) {
+  const t = (r) => e().update(Wt(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function Zn(e = 32) {
@@ -67,7 +67,7 @@ function Zn(e = 32) {
     return xt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Ki(e, t, n, r) {
+function Ai(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;
@@ -75,17 +75,17 @@ function Ki(e, t, n, r) {
 }
 let Ci = class extends Wn {
   constructor(t, n, r, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = St(this.buffer);
+    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Kt(this.buffer);
   }
   update(t) {
     et(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Zt(t);
+    t = Wt(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 = St(t);
+        const a = Kt(t);
         for (; i <= s - o; o += i)
           this.process(a, o);
         continue;
@@ -95,14 +95,14 @@ let Ci = class extends Wn {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    et(this), mi(t, this), this.finished = !0;
+    et(this), Ei(t, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: i, isLE: s } = this;
     let { pos: o } = this;
     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;
-    Ki(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const c = St(t), a = this.outputLen;
+    Ai(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();
@@ -123,7 +123,7 @@ let Ci = class extends Wn {
     return t.length = i, t.pos = c, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 };
-const Bi = (e, t, n) => e & t ^ ~e & n, ki = (e, t, n) => e & t ^ e & n ^ t & n, _i = /* @__PURE__ */ new Uint32Array([
+const Bi = (e, t, n) => e & t ^ ~e & n, _i = (e, t, n) => e & t ^ e & n ^ t & n, Ii = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -198,7 +198,7 @@ const Bi = (e, t, n) => e & t ^ ~e & n, ki = (e, t, n) => e & t ^ e & n ^ t & n,
   528734635,
   1541459225
 ]), ve = /* @__PURE__ */ new Uint32Array(64);
-let Ii = class extends Ci {
+let ki = class extends Ci {
   constructor() {
     super(64, 32, 8, !1), this.A = be[0] | 0, this.B = be[1] | 0, this.C = be[2] | 0, this.D = be[3] | 0, this.E = be[4] | 0, this.F = be[5] | 0, this.G = be[6] | 0, this.H = be[7] | 0;
   }
@@ -214,12 +214,12 @@ let Ii = class extends Ci {
     for (let u = 0; u < 16; u++, n += 4)
       ve[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const g = ve[u - 15], b = ve[u - 2], p = re(g, 7) ^ re(g, 18) ^ g >>> 3, h = re(b, 17) ^ re(b, 19) ^ b >>> 10;
+      const y = ve[u - 15], b = ve[u - 2], p = re(y, 7) ^ re(y, 18) ^ y >>> 3, h = re(b, 17) ^ re(b, 19) ^ b >>> 10;
       ve[u] = h + ve[u - 7] + p + ve[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const g = re(c, 6) ^ re(c, 11) ^ re(c, 25), b = f + g + Bi(c, a, l) + _i[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ki(r, i, s) | 0;
+      const y = re(c, 6) ^ re(c, 11) ^ re(c, 25), b = f + y + Bi(c, a, l) + Ii[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 + b | 0, o = s, s = i, i = r, r = b + 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 Ii = class extends Ci {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const $t = /* @__PURE__ */ Ai(() => new Ii());
+const Lt = /* @__PURE__ */ Si(() => new ki());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Gn = BigInt(0), ot = BigInt(1), Ui = BigInt(2), at = (e) => e instanceof Uint8Array, Li = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function De(e) {
+function qe(e) {
   if (!at(e))
     throw new Error("Uint8Array expected");
   let t = "";
@@ -246,12 +246,12 @@ function Fn(e) {
   const t = e.toString(16);
   return t.length & 1 ? `0${t}` : t;
 }
-function Gt(e) {
+function Zt(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   return BigInt(e === "" ? "0" : `0x${e}`);
 }
-function je(e) {
+function De(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   const t = e.length;
@@ -267,27 +267,27 @@ function je(e) {
   return n;
 }
 function F(e) {
-  return Gt(De(e));
+  return Zt(qe(e));
 }
-function Ft(e) {
+function Gt(e) {
   if (!at(e))
     throw new Error("Uint8Array expected");
-  return Gt(De(Uint8Array.from(e).reverse()));
+  return Zt(qe(Uint8Array.from(e).reverse()));
 }
 function Ne(e, t) {
-  return je(e.toString(16).padStart(t * 2, "0"));
+  return De(e.toString(16).padStart(t * 2, "0"));
 }
-function Jt(e, t) {
+function Ft(e, t) {
   return Ne(e, t).reverse();
 }
 function $i(e) {
-  return je(Fn(e));
+  return De(Fn(e));
 }
-function W(e, t, n) {
+function Z(e, t, n) {
   let r;
   if (typeof t == "string")
     try {
-      r = je(t);
+      r = De(t);
     } catch (s) {
       throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${s}`);
     }
@@ -328,10 +328,10 @@ function Oi(e) {
     ;
   return t;
 }
-function Mi(e, t) {
+function Pi(e, t) {
   return e >> BigInt(t) & ot;
 }
-const Pi = (e, t, n) => e | (n ? ot : Gn) << BigInt(t), Yt = (e) => (Ui << BigInt(e - 1)) - ot, Nt = (e) => new Uint8Array(e), Cn = (e) => Uint8Array.from(e);
+const Mi = (e, t, n) => e | (n ? ot : Gn) << BigInt(t), Jt = (e) => (Ui << BigInt(e - 1)) - ot, Nt = (e) => new Uint8Array(e), An = (e) => Uint8Array.from(e);
 function Jn(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -343,23 +343,23 @@ function Jn(e, t, n) {
   const o = () => {
     r.fill(1), i.fill(0), s = 0;
   }, c = (...u) => n(i, r, ...u), a = (u = Nt()) => {
-    i = c(Cn([0]), u), r = c(), u.length !== 0 && (i = c(Cn([1]), u), r = c());
+    i = c(An([0]), u), r = c(), u.length !== 0 && (i = c(An([1]), u), r = c());
   }, l = () => {
     if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
-    const g = [];
+    const y = [];
     for (; u < t; ) {
       r = c();
       const b = r.slice();
-      g.push(b), u += r.length;
+      y.push(b), u += r.length;
     }
-    return Ie(...g);
+    return Ie(...y);
   };
-  return (u, g) => {
+  return (u, y) => {
     o(), a(u);
     let b;
-    for (; !(b = g(l())); )
+    for (; !(b = y(l())); )
       a();
     return o(), b;
   };
@@ -392,71 +392,71 @@ function Ye(e, t, n = {}) {
 }
 const qi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  bitGet: Mi,
+  bitGet: Pi,
   bitLen: Oi,
-  bitMask: Yt,
-  bitSet: Pi,
-  bytesToHex: De,
+  bitMask: Jt,
+  bitSet: Mi,
+  bytesToHex: qe,
   bytesToNumberBE: F,
-  bytesToNumberLE: Ft,
+  bytesToNumberLE: Gt,
   concatBytes: Ie,
   createHmacDrbg: Jn,
-  ensureBytes: W,
+  ensureBytes: Z,
   equalBytes: Ti,
-  hexToBytes: je,
-  hexToNumber: Gt,
+  hexToBytes: De,
+  hexToNumber: Zt,
   numberToBytesBE: Ne,
-  numberToBytesLE: Jt,
+  numberToBytesLE: Ft,
   numberToHexUnpadded: Fn,
   numberToVarBytesBE: $i,
   utf8ToBytes: Ri,
   validateObject: Ye
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const z = BigInt(0), j = BigInt(1), Ce = BigInt(2), Di = BigInt(3), Tt = BigInt(4), Bn = BigInt(5), kn = BigInt(8);
+const V = BigInt(0), j = BigInt(1), Ce = BigInt(2), Di = BigInt(3), $t = BigInt(4), Cn = BigInt(5), Bn = BigInt(8);
 BigInt(9);
 BigInt(16);
-function V(e, t) {
+function W(e, t) {
   const n = e % t;
-  return n >= z ? n : t + n;
+  return n >= V ? n : t + n;
 }
 function ji(e, t, n) {
-  if (n <= z || t < z)
+  if (n <= V || t < V)
     throw new Error("Expected power/modulo > 0");
   if (n === j)
-    return z;
+    return V;
   let r = j;
-  for (; t > z; )
+  for (; t > V; )
     t & j && (r = r * e % n), e = e * e % n, t >>= j;
   return r;
 }
 function J(e, t, n) {
   let r = e;
-  for (; t-- > z; )
+  for (; t-- > V; )
     r *= r, r %= n;
   return r;
 }
-function Rt(e, t) {
-  if (e === z || t <= z)
+function Tt(e, t) {
+  if (e === V || t <= V)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
-  let n = V(e, t), r = t, i = z, s = j;
-  for (; n !== z; ) {
+  let n = W(e, t), r = t, i = V, s = j;
+  for (; n !== V; ) {
     const c = r / n, a = r % n, l = i - s * c;
     r = n, n = a, i = s, s = l;
   }
   if (r !== j)
     throw new Error("invert: does not exist");
-  return V(i, t);
+  return W(i, t);
 }
 function zi(e) {
   const t = (e - j) / Ce;
   let n, r, i;
-  for (n = e - j, r = 0; n % Ce === z; n /= Ce, r++)
+  for (n = e - j, r = 0; n % Ce === V; n /= Ce, r++)
     ;
   for (i = Ce; i < e && ji(i, t, e) !== e - j; i++)
     ;
   if (r === 1) {
-    const o = (e + j) / Tt;
+    const o = (e + j) / $t;
     return function(a, l) {
       const f = a.pow(l, o);
       if (!a.eql(a.sqr(f), l))
@@ -468,22 +468,22 @@ function zi(e) {
   return function(c, a) {
     if (c.pow(a, t) === c.neg(c.ONE))
       throw new Error("Cannot find square root");
-    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, s), g = c.pow(a, n);
-    for (; !c.eql(g, c.ONE); ) {
-      if (c.eql(g, c.ZERO))
+    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, s), y = c.pow(a, n);
+    for (; !c.eql(y, c.ONE); ) {
+      if (c.eql(y, c.ZERO))
         return c.ZERO;
       let b = 1;
-      for (let h = c.sqr(g); b < l && !c.eql(h, c.ONE); b++)
+      for (let h = c.sqr(y); b < l && !c.eql(h, c.ONE); b++)
         h = c.sqr(h);
       const p = c.pow(f, j << BigInt(l - b - 1));
-      f = c.sqr(p), u = c.mul(u, p), g = c.mul(g, f), l = b;
+      f = c.sqr(p), u = c.mul(u, p), y = c.mul(y, f), l = b;
     }
     return u;
   };
 }
 function Vi(e) {
-  if (e % Tt === Di) {
-    const t = (e + j) / Tt;
+  if (e % $t === Di) {
+    const t = (e + j) / $t;
     return function(r, i) {
       const s = r.pow(i, t);
       if (!r.eql(r.sqr(s), i))
@@ -491,8 +491,8 @@ function Vi(e) {
       return s;
     };
   }
-  if (e % kn === Bn) {
-    const t = (e - Bn) / kn;
+  if (e % Bn === Cn) {
+    const t = (e - Cn) / Bn;
     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))
@@ -531,14 +531,14 @@ function Zi(e) {
   return Ye(e, n);
 }
 function Gi(e, t, n) {
-  if (n < z)
+  if (n < V)
     throw new Error("Expected power > 0");
-  if (n === z)
+  if (n === V)
     return e.ONE;
   if (n === j)
     return t;
   let r = e.ONE, i = t;
-  for (; n > z; )
+  for (; n > V; )
     n & j && (r = e.mul(r, i)), i = e.sqr(i), n >>= j;
   return r;
 }
@@ -551,7 +551,7 @@ function Yn(e, t) {
   return { nBitLength: n, nByteLength: r };
 }
 function Ji(e, t, n = !1, r = {}) {
-  if (e <= z)
+  if (e <= V)
     throw new Error(`Expected Field ORDER > 0, got ${e}`);
   const { nBitLength: i, nByteLength: s } = Yn(e, t);
   if (s > 2048)
@@ -560,41 +560,41 @@ function Ji(e, t, n = !1, r = {}) {
     ORDER: e,
     BITS: i,
     BYTES: s,
-    MASK: Yt(i),
-    ZERO: z,
+    MASK: Jt(i),
+    ZERO: V,
     ONE: j,
-    create: (a) => V(a, e),
+    create: (a) => W(a, e),
     isValid: (a) => {
       if (typeof a != "bigint")
         throw new Error(`Invalid field element: expected bigint, got ${typeof a}`);
-      return z <= a && a < e;
+      return V <= a && a < e;
     },
-    is0: (a) => a === z,
+    is0: (a) => a === V,
     isOdd: (a) => (a & j) === j,
-    neg: (a) => V(-a, e),
+    neg: (a) => W(-a, e),
     eql: (a, l) => a === l,
-    sqr: (a) => V(a * a, e),
-    add: (a, l) => V(a + l, e),
-    sub: (a, l) => V(a - l, e),
-    mul: (a, l) => V(a * l, e),
+    sqr: (a) => W(a * a, e),
+    add: (a, l) => W(a + l, e),
+    sub: (a, l) => W(a - l, e),
+    mul: (a, l) => W(a * l, e),
     pow: (a, l) => Gi(c, a, l),
-    div: (a, l) => V(a * Rt(l, e), e),
+    div: (a, l) => W(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) => Fi(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 ? Jt(a, s) : Ne(a, s),
+    toBytes: (a) => n ? Ft(a, s) : Ne(a, s),
     fromBytes: (a) => {
       if (a.length !== s)
         throw new Error(`Fp.fromBytes: expected ${s}, got ${a.length}`);
-      return n ? Ft(a) : F(a);
+      return n ? Gt(a) : F(a);
     }
   });
   return Object.freeze(c);
@@ -613,11 +613,11 @@ function Yi(e, t, n = !1) {
   const r = e.length, i = Xn(t), s = Qn(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error(`expected ${s}-1024 bytes of input, got ${r}`);
-  const o = n ? F(e) : Ft(e), c = V(o, t - j) + j;
-  return n ? Jt(c, i) : Ne(c, i);
+  const o = n ? F(e) : Gt(e), c = W(o, t - j) + j;
+  return n ? Ft(c, i) : Ne(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Xi = BigInt(0), At = BigInt(1);
+const Xi = BigInt(0), St = BigInt(1);
 function Qi(e, t) {
   const n = (i, s) => {
     const o = s.negate();
@@ -632,7 +632,7 @@ function Qi(e, t) {
     unsafeLadder(i, s) {
       let o = e.ZERO, c = i;
       for (; s > Xi; )
-        s & At && (o = o.add(c)), c = c.double(), s >>= At;
+        s & St && (o = o.add(c)), c = c.double(), s >>= St;
       return o;
     },
     /**
@@ -650,7 +650,7 @@ function Qi(e, t) {
       let l = i, f = l;
       for (let u = 0; u < o; u++) {
         f = l, a.push(f);
-        for (let g = 1; g < c; g++)
+        for (let y = 1; y < c; y++)
           f = f.add(l), a.push(f);
         l = f.double();
       }
@@ -666,13 +666,13 @@ function Qi(e, t) {
     wNAF(i, s, o) {
       const { windows: c, windowSize: a } = r(i);
       let l = e.ZERO, f = e.BASE;
-      const u = BigInt(2 ** i - 1), g = 2 ** i, b = BigInt(i);
+      const u = BigInt(2 ** i - 1), y = 2 ** i, b = BigInt(i);
       for (let p = 0; p < c; p++) {
         const h = p * a;
         let d = Number(o & u);
-        o >>= b, d > a && (d -= g, o += At);
-        const y = h, m = h + Math.abs(d) - 1, A = p % 2 !== 0, I = d < 0;
-        d === 0 ? f = f.add(n(A, s[y])) : l = l.add(n(I, s[m]));
+        o >>= b, d > a && (d -= y, o += St);
+        const g = h, E = h + Math.abs(d) - 1, S = p % 2 !== 0, k = d < 0;
+        d === 0 ? f = f.add(n(S, s[g])) : l = l.add(n(k, s[E]));
       }
       return { p: l, f };
     },
@@ -722,7 +722,7 @@ function es(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: ts, hexToBytes: ns } = qi, ke = {
+const { bytesToNumberBE: ts, hexToBytes: ns } = qi, Be = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -730,7 +730,7 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, ke = {
     }
   },
   _parseInt(e) {
-    const { Err: t } = ke;
+    const { Err: t } = Be;
     if (e.length < 2 || e[0] !== 2)
       throw new t("Invalid signature integer tag");
     const n = e[1], r = e.subarray(2, n + 2);
@@ -743,7 +743,7 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, ke = {
     return { d: ts(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = ke, n = typeof e == "string" ? ns(e) : e;
+    const { Err: t } = Be, n = typeof e == "string" ? ns(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -751,7 +751,7 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, ke = {
       throw new t("Invalid signature tag");
     if (n[1] !== r - 2)
       throw new t("Invalid signature: incorrect length");
-    const { d: i, l: s } = ke._parseInt(n.subarray(2)), { d: o, l: c } = ke._parseInt(s);
+    const { d: i, l: s } = Be._parseInt(n.subarray(2)), { d: o, l: c } = Be._parseInt(s);
     if (c.length)
       throw new t("Invalid signature: left bytes after parsing");
     return { r: i, s: o };
@@ -769,15 +769,15 @@ const _n = BigInt(3);
 BigInt(4);
 function rs(e) {
   const t = es(e), { Fp: n } = t, r = t.toBytes || ((p, h, d) => {
-    const y = h.toAffine();
-    return Ie(Uint8Array.from([4]), n.toBytes(y.x), n.toBytes(y.y));
+    const g = h.toAffine();
+    return Ie(Uint8Array.from([4]), n.toBytes(g.x), n.toBytes(g.y));
   }), i = t.fromBytes || ((p) => {
-    const h = p.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 = p.subarray(1), d = n.fromBytes(h.subarray(0, n.BYTES)), g = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
+    return { x: d, y: g };
   });
   function s(p) {
-    const { a: h, b: d } = t, y = n.sqr(p), m = n.mul(y, p);
-    return n.add(n.add(m, n.mul(p, h)), d);
+    const { a: h, b: d } = t, g = n.sqr(p), E = n.mul(g, p);
+    return n.add(n.add(E, n.mul(p, h)), d);
   }
   if (!n.eql(n.sqr(t.Gy), s(t.Gx)))
     throw new Error("bad generator point: equation left != right");
@@ -789,19 +789,19 @@ function rs(e) {
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
   function a(p) {
-    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: y, n: m } = t;
+    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: g, n: E } = t;
     if (h && typeof p != "bigint") {
-      if (p instanceof Uint8Array && (p = De(p)), typeof p != "string" || !h.includes(p.length))
+      if (p instanceof Uint8Array && (p = qe(p)), typeof p != "string" || !h.includes(p.length))
         throw new Error("Invalid key");
       p = p.padStart(d * 2, "0");
     }
-    let A;
+    let S;
     try {
-      A = typeof p == "bigint" ? p : F(W("private key", p, d));
+      S = typeof p == "bigint" ? p : F(Z("private key", p, d));
     } catch {
       throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof p}`);
     }
-    return y && (A = V(A, m)), c(A), A;
+    return g && (S = W(S, E)), c(S), S;
   }
   const l = /* @__PURE__ */ new Map();
   function f(p) {
@@ -809,24 +809,24 @@ function rs(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, g) {
+      if (this.px = h, this.py = d, this.pz = g, 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 (g == null || !n.isValid(g))
         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: g } = h || {};
+      if (!h || !n.isValid(d) || !n.isValid(g))
         throw new Error("invalid affine point");
       if (h instanceof u)
         throw new Error("projective point not allowed");
-      const m = (A) => n.eql(A, n.ZERO);
-      return m(d) && m(y) ? u.ZERO : new u(d, y, n.ONE);
+      const E = (S) => n.eql(S, n.ZERO);
+      return E(d) && E(g) ? u.ZERO : new u(d, g, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -841,15 +841,15 @@ function rs(e) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(h) {
-      const d = n.invertBatch(h.map((y) => y.pz));
-      return h.map((y, m) => y.toAffine(d[m])).map(u.fromAffine);
+      const d = n.invertBatch(h.map((g) => g.pz));
+      return h.map((g, E) => g.toAffine(d[E])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
      * @param hex short/long ECDSA hex
      */
     static fromHex(h) {
-      const d = u.fromAffine(i(W("pointHex", h)));
+      const d = u.fromAffine(i(Z("pointHex", h)));
       return d.assertValidity(), d;
     }
     // Multiplies generator point by privateKey.
@@ -870,8 +870,8 @@ function rs(e) {
       const { x: h, y: d } = this.toAffine();
       if (!n.isValid(h) || !n.isValid(d))
         throw new Error("bad point: x or y not FE");
-      const y = n.sqr(d), m = s(h);
-      if (!n.eql(y, m))
+      const g = n.sqr(d), E = s(h);
+      if (!n.eql(g, E))
         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 rs(e) {
      */
     equals(h) {
       f(h);
-      const { px: d, py: y, pz: m } = this, { px: A, py: I, pz: B } = h, E = n.eql(n.mul(d, B), n.mul(A, m)), x = n.eql(n.mul(y, B), n.mul(I, m));
-      return E && x;
+      const { px: d, py: g, pz: E } = this, { px: S, py: k, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(S, E)), x = n.eql(n.mul(g, B), n.mul(k, E));
+      return m && x;
     }
     /**
      * Flips point to one corresponding to (x, -y) in Affine coordinates.
@@ -901,9 +901,9 @@ function rs(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: h, b: d } = t, y = n.mul(d, _n), { px: m, py: A, pz: I } = this;
-      let B = n.ZERO, E = n.ZERO, x = n.ZERO, S = n.mul(m, m), P = n.mul(A, A), _ = n.mul(I, I), K = n.mul(m, A);
-      return K = n.add(K, K), x = n.mul(m, I), x = n.add(x, x), B = n.mul(h, x), E = n.mul(y, _), E = n.add(B, E), B = n.sub(P, E), E = n.add(P, E), E = n.mul(B, E), B = n.mul(K, B), x = n.mul(y, x), _ = n.mul(h, _), K = n.sub(S, _), K = n.mul(h, K), K = n.add(K, x), x = n.add(S, S), S = n.add(x, S), S = n.add(S, _), S = n.mul(S, K), E = n.add(E, S), _ = n.mul(A, I), _ = n.add(_, _), S = n.mul(_, K), B = n.sub(B, S), x = n.mul(_, P), x = n.add(x, x), x = n.add(x, x), new u(B, E, x);
+      const { a: h, b: d } = t, g = n.mul(d, _n), { px: E, py: S, pz: k } = this;
+      let B = n.ZERO, m = n.ZERO, x = n.ZERO, K = n.mul(E, E), M = n.mul(S, S), I = n.mul(k, k), A = n.mul(E, S);
+      return A = n.add(A, A), x = n.mul(E, k), x = n.add(x, x), B = n.mul(h, x), m = n.mul(g, 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(g, 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), m = n.add(m, K), I = n.mul(S, k), I = n.add(I, I), K = n.mul(I, A), B = n.sub(B, K), x = n.mul(I, M), x = n.add(x, x), x = n.add(x, x), new u(B, m, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function rs(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: d, py: y, pz: m } = this, { px: A, py: I, pz: B } = h;
-      let E = n.ZERO, x = n.ZERO, S = n.ZERO;
-      const P = t.a, _ = n.mul(t.b, _n);
-      let K = n.mul(d, A), T = n.mul(y, I), R = n.mul(m, B), H = n.add(d, y), w = n.add(A, I);
-      H = n.mul(H, w), w = n.add(K, T), H = n.sub(H, w), w = n.add(d, m);
-      let v = n.add(A, B);
-      return w = n.mul(w, v), v = n.add(K, R), w = n.sub(w, v), v = n.add(y, m), E = n.add(I, B), v = n.mul(v, E), E = n.add(T, R), v = n.sub(v, E), S = n.mul(P, w), E = n.mul(_, R), S = n.add(E, S), E = n.sub(T, S), S = n.add(T, S), x = n.mul(E, S), T = n.add(K, K), T = n.add(T, K), R = n.mul(P, R), w = n.mul(_, w), T = n.add(T, R), R = n.sub(K, R), R = n.mul(P, R), w = n.add(w, R), K = n.mul(T, w), x = n.add(x, K), K = n.mul(v, w), E = n.mul(H, E), E = n.sub(E, K), K = n.mul(H, T), S = n.mul(v, S), S = n.add(S, K), new u(E, x, S);
+      const { px: d, py: g, pz: E } = this, { px: S, py: k, pz: B } = h;
+      let m = n.ZERO, x = n.ZERO, K = n.ZERO;
+      const M = t.a, I = n.mul(t.b, _n);
+      let A = n.mul(d, S), T = n.mul(g, k), R = n.mul(E, B), H = n.add(d, g), w = n.add(S, k);
+      H = n.mul(H, w), w = n.add(A, T), H = n.sub(H, w), w = n.add(d, E);
+      let v = n.add(S, B);
+      return w = n.mul(w, v), v = n.add(A, R), w = n.sub(w, v), v = n.add(g, E), m = n.add(k, B), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), K = n.mul(M, w), m = n.mul(I, R), K = n.add(m, K), m = n.sub(T, K), K = n.add(T, K), x = n.mul(m, K), T = n.add(A, A), T = n.add(T, A), R = n.mul(M, R), w = n.mul(I, w), T = n.add(T, R), R = n.sub(A, R), R = n.mul(M, R), w = n.add(w, R), A = n.mul(T, w), x = n.add(x, A), A = n.mul(v, w), m = n.mul(H, m), m = n.sub(m, A), A = n.mul(H, T), K = n.mul(v, K), K = n.add(K, A), new u(m, x, K);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -927,8 +927,8 @@ function rs(e) {
     }
     wNAF(h) {
       return b.wNAFCached(this, l, h, (d) => {
-        const y = n.invertBatch(d.map((m) => m.pz));
-        return d.map((m, A) => m.toAffine(y[A])).map(u.fromAffine);
+        const g = n.invertBatch(d.map((E) => E.pz));
+        return d.map((E, S) => E.toAffine(g[S])).map(u.fromAffine);
       });
     }
     /**
@@ -942,13 +942,13 @@ function rs(e) {
         return d;
       if (c(h), h === Y)
         return this;
-      const { endo: y } = t;
-      if (!y)
+      const { endo: g } = t;
+      if (!g)
         return b.unsafeLadder(this, h);
-      let { k1neg: m, k1: A, k2neg: I, k2: B } = y.splitScalar(h), E = d, x = d, S = this;
-      for (; A > ae || B > ae; )
-        A & Y && (E = E.add(S)), B & Y && (x = x.add(S)), S = S.double(), A >>= Y, B >>= Y;
-      return m && (E = E.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, y.beta), x.py, x.pz), E.add(x);
+      let { k1neg: E, k1: S, k2neg: k, k2: B } = g.splitScalar(h), m = d, x = d, K = this;
+      for (; S > ae || B > ae; )
+        S & Y && (m = m.add(K)), B & Y && (x = x.add(K)), K = K.double(), S >>= Y, B >>= Y;
+      return E && (m = m.negate()), k && (x = x.negate()), x = new u(n.mul(x.px, g.beta), x.py, x.pz), m.add(x);
     }
     /**
      * Constant time multiplication.
@@ -961,17 +961,17 @@ function rs(e) {
      */
     multiply(h) {
       c(h);
-      let d = h, y, m;
-      const { endo: A } = t;
-      if (A) {
-        const { k1neg: I, k1: B, k2neg: E, k2: x } = A.splitScalar(d);
-        let { p: S, f: P } = this.wNAF(B), { p: _, f: K } = this.wNAF(x);
-        S = b.constTimeNegate(I, S), _ = b.constTimeNegate(E, _), _ = new u(n.mul(_.px, A.beta), _.py, _.pz), y = S.add(_), m = P.add(K);
+      let d = h, g, E;
+      const { endo: S } = t;
+      if (S) {
+        const { k1neg: k, k1: B, k2neg: m, k2: x } = S.splitScalar(d);
+        let { p: K, f: M } = this.wNAF(B), { p: I, f: A } = this.wNAF(x);
+        K = b.constTimeNegate(k, K), I = b.constTimeNegate(m, I), I = new u(n.mul(I.px, S.beta), I.py, I.pz), g = K.add(I), E = M.add(A);
       } else {
-        const { p: I, f: B } = this.wNAF(d);
-        y = I, m = B;
+        const { p: k, f: B } = this.wNAF(d);
+        g = k, E = B;
       }
-      return u.normalizeZ([y, m])[0];
+      return u.normalizeZ([g, E])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -979,22 +979,22 @@ function rs(e) {
      * The trick could be useful if both P and Q are not G (not in our case).
      * @returns non-zero affine point
      */
-    multiplyAndAddUnsafe(h, d, y) {
-      const m = u.BASE, A = (B, E) => E === ae || E === Y || !B.equals(m) ? B.multiplyUnsafe(E) : B.multiply(E), I = A(this, d).add(A(h, y));
-      return I.is0() ? void 0 : I;
+    multiplyAndAddUnsafe(h, d, g) {
+      const E = u.BASE, S = (B, m) => m === ae || m === Y || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), k = S(this, d).add(S(h, g));
+      return k.is0() ? void 0 : k;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
     // (x, y, z) ∋ (x=x/z, y=y/z)
     toAffine(h) {
-      const { px: d, py: y, pz: m } = this, A = this.is0();
-      h == null && (h = A ? n.ONE : n.inv(m));
-      const I = n.mul(d, h), B = n.mul(y, h), E = n.mul(m, h);
-      if (A)
+      const { px: d, py: g, pz: E } = this, S = this.is0();
+      h == null && (h = S ? n.ONE : n.inv(E));
+      const k = n.mul(d, h), B = n.mul(g, h), m = n.mul(E, h);
+      if (S)
         return { x: n.ZERO, y: n.ZERO };
-      if (!n.eql(E, n.ONE))
+      if (!n.eql(m, n.ONE))
         throw new Error("invZ was invalid");
-      return { x: I, y: B };
+      return { x: k, y: B };
     }
     isTorsionFree() {
       const { h, isTorsionFree: d } = t;
@@ -1012,11 +1012,11 @@ function rs(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 g = t.nBitLength, b = Qi(u, t.endo ? Math.ceil(g / 2) : g);
+  const y = t.nBitLength, b = Qi(u, t.endo ? Math.ceil(y / 2) : y);
   return {
     CURVE: t,
     ProjectivePoint: u,
@@ -1043,21 +1043,21 @@ function ss(e) {
     return ae < w && w < n.ORDER;
   }
   function c(w) {
-    return V(w, r);
+    return W(w, r);
   }
   function a(w) {
-    return Rt(w, r);
+    return Tt(w, r);
   }
-  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: g } = rs({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: y } = rs({
     ...t,
     toBytes(w, v, N) {
-      const k = v.toAffine(), C = n.toBytes(k.x), U = Ie;
-      return N ? U(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : U(Uint8Array.from([4]), C, n.toBytes(k.y));
+      const _ = v.toAffine(), C = n.toBytes(_.x), U = Ie;
+      return N ? U(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : U(Uint8Array.from([4]), C, n.toBytes(_.y));
     },
     fromBytes(w) {
-      const v = w.length, N = w[0], k = w.subarray(1);
+      const v = w.length, N = w[0], _ = w.subarray(1);
       if (v === i && (N === 2 || N === 3)) {
-        const C = F(k);
+        const C = F(_);
         if (!o(C))
           throw new Error("Point is not on curve");
         const U = u(C);
@@ -1065,12 +1065,12 @@ function ss(e) {
         const $ = (O & Y) === Y;
         return (N & 1) === 1 !== $ && (O = n.neg(O)), { x: C, y: O };
       } else if (v === s && N === 4) {
-        const C = n.fromBytes(k.subarray(0, n.BYTES)), U = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
+        const C = n.fromBytes(_.subarray(0, n.BYTES)), U = n.fromBytes(_.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`);
     }
-  }), b = (w) => De(Ne(w, t.nByteLength));
+  }), b = (w) => qe(Ne(w, t.nByteLength));
   function p(w) {
     const v = r >> Y;
     return w > v;
@@ -1079,38 +1079,38 @@ function ss(e) {
     return p(w) ? c(-w) : w;
   }
   const d = (w, v, N) => F(w.slice(v, N));
-  class y {
-    constructor(v, N, k) {
-      this.r = v, this.s = N, this.recovery = k, this.assertValidity();
+  class g {
+    constructor(v, N, _) {
+      this.r = v, this.s = N, this.recovery = _, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
       const N = t.nByteLength;
-      return v = W("compactSignature", v, N * 2), new y(d(v, 0, N), d(v, N, 2 * N));
+      return v = Z("compactSignature", v, N * 2), new g(d(v, 0, N), d(v, N, 2 * N));
     }
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
     static fromDER(v) {
-      const { r: N, s: k } = ke.toSig(W("DER", v));
-      return new y(N, k);
+      const { r: N, s: _ } = Be.toSig(Z("DER", v));
+      return new g(N, _);
     }
     assertValidity() {
-      if (!g(this.r))
+      if (!y(this.r))
         throw new Error("r must be 0 < r < CURVE.n");
-      if (!g(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 g(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: N, s: k, recovery: C } = this, U = x(W("msgHash", v));
+      const { r: N, s: _, recovery: C } = this, U = x(Z("msgHash", v));
       if (C == null || ![0, 1, 2, 3].includes(C))
         throw new Error("recovery id invalid");
       const O = C === 2 || C === 3 ? N + t.n : N;
       if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const $ = C & 1 ? "03" : "02", Q = l.fromHex($ + b(O)), ge = a(O), Le = c(-U * ge), We = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(Q, Le, We);
+      const $ = C & 1 ? "03" : "02", Q = l.fromHex($ + b(O)), ge = a(O), Ue = c(-U * ge), Ve = c(_ * ge), we = l.BASE.multiplyAndAddUnsafe(Q, Ue, Ve);
       if (!we)
         throw new Error("point at infinify");
       return we.assertValidity(), we;
@@ -1120,24 +1120,24 @@ function ss(e) {
       return p(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new y(this.r, c(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new g(this.r, c(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
-      return je(this.toDERHex());
+      return De(this.toDERHex());
     }
     toDERHex() {
-      return ke.hexFromSig({ r: this.r, s: this.s });
+      return Be.hexFromSig({ r: this.r, s: this.s });
     }
     // padded bytes of r, then padded bytes of s
     toCompactRawBytes() {
-      return je(this.toCompactHex());
+      return De(this.toCompactHex());
     }
     toCompactHex() {
       return b(this.r) + b(this.s);
     }
   }
-  const m = {
+  const E = {
     isValidPrivateKey(w) {
       try {
         return f(w), !0;
@@ -1166,85 +1166,85 @@ function ss(e) {
       return v._setWindowSize(w), v.multiply(BigInt(3)), v;
     }
   };
-  function A(w, v = !0) {
+  function S(w, v = !0) {
     return l.fromPrivateKey(w).toRawBytes(v);
   }
-  function I(w) {
-    const v = w instanceof Uint8Array, N = typeof w == "string", k = (v || N) && w.length;
-    return v ? k === i || k === s : N ? k === 2 * i || k === 2 * s : w instanceof l;
+  function k(w) {
+    const v = w instanceof Uint8Array, N = typeof w == "string", _ = (v || N) && w.length;
+    return v ? _ === i || _ === s : N ? _ === 2 * i || _ === 2 * s : w instanceof l;
   }
   function B(w, v, N = !0) {
-    if (I(w))
+    if (k(w))
       throw new Error("first arg must be private key");
-    if (!I(v))
+    if (!k(v))
       throw new Error("second arg must be public key");
     return l.fromHex(v).multiply(f(w)).toRawBytes(N);
   }
-  const E = t.bits2int || function(w) {
+  const m = t.bits2int || function(w) {
     const v = F(w), N = w.length * 8 - t.nBitLength;
     return N > 0 ? v >> BigInt(N) : v;
   }, x = t.bits2int_modN || function(w) {
-    return c(E(w));
-  }, S = Yt(t.nBitLength);
-  function P(w) {
+    return c(m(w));
+  }, K = Jt(t.nBitLength);
+  function M(w) {
     if (typeof w != "bigint")
       throw new Error("bigint expected");
-    if (!(ae <= w && w < S))
+    if (!(ae <= w && w < K))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
     return Ne(w, t.nByteLength);
   }
-  function _(w, v, N = K) {
-    if (["recovered", "canonical"].some((Ke) => Ke in N))
+  function I(w, 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;
+    const { hash: _, randomBytes: C } = t;
     let { lowS: U, prehash: O, extraEntropy: $ } = N;
-    U == null && (U = !0), w = W("msgHash", w), O && (w = W("prehashed msgHash", k(w)));
-    const Q = x(w), ge = f(v), Le = [P(ge), P(Q)];
+    U == null && (U = !0), w = Z("msgHash", w), O && (w = Z("prehashed msgHash", _(w)));
+    const Q = x(w), ge = f(v), Ue = [M(ge), M(Q)];
     if ($ != null) {
-      const Ke = $ === !0 ? C(n.BYTES) : $;
-      Le.push(W("extraEntropy", Ke));
+      const Ae = $ === !0 ? C(n.BYTES) : $;
+      Ue.push(Z("extraEntropy", Ae));
     }
-    const We = Ie(...Le), we = Q;
-    function mt(Ke) {
-      const $e = E(Ke);
-      if (!g($e))
+    const Ve = Ie(...Ue), we = Q;
+    function Et(Ae) {
+      const Le = m(Ae);
+      if (!y(Le))
         return;
-      const Sn = a($e), Te = l.BASE.multiply($e).toAffine(), ee = c(Te.x);
+      const xn = a(Le), $e = l.BASE.multiply(Le).toAffine(), ee = c($e.x);
       if (ee === ae)
         return;
-      const Re = c(Sn * c(we + ee * ge));
-      if (Re === ae)
+      const Te = c(xn * c(we + ee * ge));
+      if (Te === ae)
         return;
-      let Nn = (Te.x === ee ? 0 : 2) | Number(Te.y & Y), An = Re;
-      return U && p(Re) && (An = h(Re), Nn ^= 1), new y(ee, An, Nn);
+      let Kn = ($e.x === ee ? 0 : 2) | Number($e.y & Y), Nn = Te;
+      return U && p(Te) && (Nn = h(Te), Kn ^= 1), new g(ee, Nn, Kn);
     }
-    return { seed: We, k2sig: mt };
+    return { seed: Ve, k2sig: Et };
   }
-  const K = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
-  function R(w, v, N = K) {
-    const { seed: k, k2sig: C } = _(w, v, N), U = t;
-    return Jn(U.hash.outputLen, U.nByteLength, U.hmac)(k, C);
+  const A = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
+  function R(w, v, N = A) {
+    const { seed: _, k2sig: C } = I(w, v, N), U = t;
+    return Jn(U.hash.outputLen, U.nByteLength, U.hmac)(_, C);
   }
   l.BASE._setWindowSize(8);
-  function H(w, v, N, k = T) {
-    var Te;
+  function H(w, v, N, _ = T) {
+    var $e;
     const C = w;
-    if (v = W("msgHash", v), N = W("publicKey", N), "strict" in k)
+    if (v = Z("msgHash", v), N = Z("publicKey", N), "strict" in _)
       throw new Error("options.strict was renamed to lowS");
-    const { lowS: U, prehash: O } = k;
+    const { lowS: U, prehash: O } = _;
     let $, Q;
     try {
       if (typeof C == "string" || C instanceof Uint8Array)
         try {
-          $ = y.fromDER(C);
+          $ = g.fromDER(C);
         } catch (ee) {
-          if (!(ee instanceof ke.Err))
+          if (!(ee instanceof Be.Err))
             throw ee;
-          $ = y.fromCompact(C);
+          $ = g.fromCompact(C);
         }
       else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
-        const { r: ee, s: Re } = C;
-        $ = new y(ee, Re);
+        const { r: ee, s: Te } = C;
+        $ = new g(ee, Te);
       } else
         throw new Error("PARSE");
       Q = l.fromHex(N);
@@ -1256,24 +1256,24 @@ function ss(e) {
     if (U && $.hasHighS())
       return !1;
     O && (v = t.hash(v));
-    const { r: ge, s: Le } = $, We = x(v), we = a(Le), mt = c(We * we), Ke = c(ge * we), $e = (Te = l.BASE.multiplyAndAddUnsafe(Q, mt, Ke)) == null ? void 0 : Te.toAffine();
-    return $e ? c($e.x) === ge : !1;
+    const { r: ge, s: Ue } = $, Ve = x(v), we = a(Ue), Et = c(Ve * we), Ae = c(ge * we), Le = ($e = l.BASE.multiplyAndAddUnsafe(Q, Et, Ae)) == null ? void 0 : $e.toAffine();
+    return Le ? c(Le.x) === ge : !1;
   }
   return {
     CURVE: t,
-    getPublicKey: A,
+    getPublicKey: S,
     getSharedSecret: B,
     sign: R,
     verify: H,
     ProjectivePoint: l,
-    Signature: y,
-    utils: m
+    Signature: g,
+    utils: E
   };
 }
 let tr = class extends Wn {
   constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, Ei(t);
-    const r = Zt(n);
+    super(), this.finished = !1, this.destroyed = !1, mi(t);
+    const r = Wt(n);
     if (this.iHash = t.create(), typeof this.iHash.update != "function")
       throw new Error("Expected instance of class which extends utils.Hash");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
@@ -1322,15 +1322,15 @@ function as(e, t) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const ct = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), rr = BigInt(1), nt = BigInt(2), In = (e, t) => (e + t / nt) / t;
 function ir(e) {
-  const t = ct, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, g = J(u, n, t) * f % t, b = J(g, nt, t) * l % t, p = J(b, i, t) * b % t, h = J(p, s, t) * p % t, d = J(h, c, t) * h % t, y = J(d, a, t) * d % t, m = J(y, c, t) * h % t, A = J(m, n, t) * f % t, I = J(A, o, t) * p % t, B = J(I, r, t) * l % t, E = J(B, nt, t);
-  if (!Ot.eql(Ot.sqr(E), e))
+  const t = ct, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, y = J(u, n, t) * f % t, b = J(y, nt, t) * l % t, p = J(b, i, t) * b % t, h = J(p, s, t) * p % t, d = J(h, c, t) * h % t, g = J(d, a, t) * d % t, E = J(g, c, t) * h % t, S = J(E, n, t) * f % t, k = J(S, o, t) * p % t, B = J(k, r, t) * l % t, m = J(B, nt, t);
+  if (!Rt.eql(Rt.sqr(m), e))
     throw new Error("Cannot find square root");
-  return E;
+  return m;
 }
-const Ot = Ji(ct, void 0, void 0, { sqrt: ir }), Ue = as({
+const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), ke = as({
   a: BigInt(0),
   b: BigInt(7),
-  Fp: Ot,
+  Fp: Rt,
   n: tt,
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
@@ -1347,34 +1347,34 @@ const Ot = Ji(ct, void 0, void 0, { sqrt: ir }), Ue = as({
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
       const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -rr * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = In(s * e, t), a = In(-r * e, t);
-      let l = V(e - c * n - a * i, t), f = V(-c * r - a * s, t);
-      const u = l > o, g = f > o;
-      if (u && (l = t - l), g && (f = t - f), l > o || f > o)
+      let l = W(e - c * n - a * i, t), f = W(-c * r - a * s, t);
+      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: g, k2: f };
+      return { k1neg: u, k1: l, k2neg: y, k2: f };
     }
   }
-}, $t), ut = BigInt(0), sr = (e) => typeof e == "bigint" && ut < e && e < ct, cs = (e) => typeof e == "bigint" && ut < e && e < tt, Un = {};
+}, Lt), ut = BigInt(0), sr = (e) => typeof e == "bigint" && ut < e && e < ct, cs = (e) => typeof e == "bigint" && ut < e && e < tt, kn = {};
 function rt(e, ...t) {
-  let n = Un[e];
+  let n = kn[e];
   if (n === void 0) {
-    const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = Ie(r, r), Un[e] = n;
+    const r = Lt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    n = Ie(r, r), kn[e] = n;
   }
-  return $t(Ie(n, ...t));
+  return Lt(Ie(n, ...t));
 }
-const Xt = (e) => e.toRawBytes(!0).slice(1), Mt = (e) => Ne(e, 32), Kt = (e) => V(e, ct), Fe = (e) => V(e, tt), Qt = Ue.ProjectivePoint, us = (e, t, n) => Qt.BASE.multiplyAndAddUnsafe(e, t, n);
+const Yt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => Ne(e, 32), At = (e) => W(e, ct), Fe = (e) => W(e, tt), Xt = ke.ProjectivePoint, us = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
 function Pt(e) {
-  let t = Ue.utils.normPrivateKeyToScalar(e), n = Qt.fromPrivateKey(t);
-  return { scalar: n.hasEvenY() ? t : Fe(-t), bytes: Xt(n) };
+  let t = ke.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
+  return { scalar: n.hasEvenY() ? t : Fe(-t), bytes: Yt(n) };
 }
 function or(e) {
   if (!sr(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = Kt(e * e), n = Kt(t * e + BigInt(7));
+  const t = At(e * e), n = At(t * e + BigInt(7));
   let r = ir(n);
-  r % nt !== ut && (r = Kt(-r));
-  const i = new Qt(e, r, rr);
+  r % nt !== ut && (r = At(-r));
+  const i = new Xt(e, r, rr);
   return i.assertValidity(), i;
 }
 function ar(...e) {
@@ -1384,16 +1384,16 @@ function ls(e) {
   return Pt(e).bytes;
 }
 function fs(e, t, n = Zn(32)) {
-  const r = W("message", e), { bytes: i, scalar: s } = Pt(t), o = W("auxRand", n, 32), c = Mt(s ^ F(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Fe(F(a));
+  const r = Z("message", e), { bytes: i, scalar: s } = Pt(t), o = Z("auxRand", n, 32), c = Ot(s ^ F(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Fe(F(a));
   if (l === ut)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Pt(l), g = ar(f, i, r), b = new Uint8Array(64);
-  if (b.set(f, 0), b.set(Mt(Fe(u + g * s)), 32), !cr(b, r, i))
+  const { bytes: f, scalar: u } = Pt(l), y = ar(f, i, r), b = new Uint8Array(64);
+  if (b.set(f, 0), b.set(Ot(Fe(u + y * s)), 32), !cr(b, r, i))
     throw new Error("sign: Invalid signature produced");
   return b;
 }
 function cr(e, t, n) {
-  const r = W("signature", e, 64), i = W("message", t), s = W("publicKey", n, 32);
+  const r = Z("signature", e, 64), i = Z("message", t), s = Z("publicKey", n, 32);
   try {
     const o = or(F(s)), c = F(r.subarray(0, 32));
     if (!sr(c))
@@ -1401,40 +1401,40 @@ function cr(e, t, n) {
     const a = F(r.subarray(32, 64));
     if (!cs(a))
       return !1;
-    const l = ar(Mt(c), Xt(o), i), f = us(o, a, Fe(-l));
+    const l = ar(Ot(c), Yt(o), i), f = us(o, a, Fe(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
   } catch {
     return !1;
   }
 }
-const Ze = {
+const We = {
   getPublicKey: ls,
   sign: fs,
   verify: cr,
   utils: {
-    randomPrivateKey: Ue.utils.randomPrivateKey,
+    randomPrivateKey: ke.utils.randomPrivateKey,
     lift_x: or,
-    pointToBytes: Xt,
+    pointToBytes: Yt,
     numberToBytesBE: Ne,
     bytesToNumberBE: F,
     taggedHash: rt,
-    mod: V
+    mod: W
   }
 }, Ct = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const en = (e) => e instanceof Uint8Array, Bt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, hs = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Qt = (e) => e instanceof Uint8Array, Bt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, hs = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!hs)
   throw new Error("Non little-endian hardware is not supported");
 const ds = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function M(e) {
-  if (!en(e))
+function P(e) {
+  if (!Qt(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
     t += ds[e[n]];
   return t;
 }
-function G(e) {
+function z(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   const t = e.length;
@@ -1449,13 +1449,13 @@ function G(e) {
   }
   return n;
 }
-function ps(e) {
+function ys(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Je(e) {
-  if (typeof e == "string" && (e = ps(e)), !en(e))
+  if (typeof e == "string" && (e = ys(e)), !Qt(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -1463,7 +1463,7 @@ function lt(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!en(r))
+    if (!Qt(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
@@ -1483,11 +1483,11 @@ function fr(e = 32) {
     return Ct.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Ht(e) {
+function Mt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function ys(e) {
+function ps(e) {
   if (typeof e != "boolean")
     throw new Error(`Expected boolean, not ${e}`);
 }
@@ -1500,7 +1500,7 @@ function hr(e, ...t) {
 function gs(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Ht(e.outputLen), Ht(e.blockLen);
+  Mt(e.outputLen), Mt(e.blockLen);
 }
 function ws(e, t = !0) {
   if (e.destroyed)
@@ -1515,8 +1515,8 @@ function bs(e, t) {
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const se = {
-  number: Ht,
-  bool: ys,
+  number: Mt,
+  bool: ps,
   bytes: hr,
   hash: gs,
   exists: ws,
@@ -1528,7 +1528,7 @@ function vs(e, 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;
   e.setUint32(t + a, o, r), e.setUint32(t + l, c, r);
 }
-class Es extends ur {
+class ms extends ur {
   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);
   }
@@ -1578,7 +1578,7 @@ class Es extends ur {
     return t.length = i, t.pos = c, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 }
-const ms = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n, Ss = new Uint32Array([
+const Es = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n, Ks = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1643,7 +1643,7 @@ const ms = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n,
   2756734187,
   3204031479,
   3329325298
-]), Ee = new Uint32Array([
+]), me = new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -1652,10 +1652,10 @@ const ms = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n,
   2600822924,
   528734635,
   1541459225
-]), me = new Uint32Array(64);
-class dr extends Es {
+]), Ee = new Uint32Array(64);
+class dr extends ms {
   constructor() {
-    super(64, 32, 8, !1), this.A = Ee[0] | 0, this.B = Ee[1] | 0, this.C = Ee[2] | 0, this.D = Ee[3] | 0, this.E = Ee[4] | 0, this.F = Ee[5] | 0, this.G = Ee[6] | 0, this.H = Ee[7] | 0;
+    super(64, 32, 8, !1), this.A = me[0] | 0, this.B = me[1] | 0, this.C = me[2] | 0, this.D = me[3] | 0, this.E = me[4] | 0, this.F = me[5] | 0, this.G = me[6] | 0, this.H = me[7] | 0;
   }
   get() {
     const { A: t, B: n, C: r, D: i, E: s, F: o, G: c, H: a } = this;
@@ -1667,20 +1667,20 @@ class dr extends Es {
   }
   process(t, n) {
     for (let u = 0; u < 16; u++, n += 4)
-      me[u] = t.getUint32(n, !1);
+      Ee[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const g = me[u - 15], b = me[u - 2], p = ie(g, 7) ^ ie(g, 18) ^ g >>> 3, h = ie(b, 17) ^ ie(b, 19) ^ b >>> 10;
-      me[u] = h + me[u - 7] + p + me[u - 16] | 0;
+      const y = Ee[u - 15], b = Ee[u - 2], p = ie(y, 7) ^ ie(y, 18) ^ y >>> 3, h = ie(b, 17) ^ ie(b, 19) ^ b >>> 10;
+      Ee[u] = h + Ee[u - 7] + p + Ee[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const g = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), b = f + g + ms(c, a, l) + Ss[u] + me[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + xs(r, i, s) | 0;
+      const y = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), b = f + y + Es(c, a, l) + Ks[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + xs(r, i, s) | 0;
       f = l, l = a, a = c, c = o + b | 0, o = s, s = i, i = r, r = b + h | 0;
     }
     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);
   }
   roundClean() {
-    me.fill(0);
+    Ee.fill(0);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
@@ -1694,7 +1694,7 @@ class Ns extends dr {
 const fe = lr(() => new dr());
 lr(() => new Ns());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function Ve(e) {
+function ze(e) {
   if (!Number.isSafeInteger(e))
     throw new Error(`Wrong integer: ${e}`);
 }
@@ -1702,13 +1702,13 @@ function de(...e) {
   const t = (i, s) => (o) => i(s(o)), n = Array.from(e).reverse().reduce((i, s) => i ? t(i, s.encode) : s.encode, void 0), r = e.reduce((i, s) => i ? t(i, s.decode) : s.decode, void 0);
   return { encode: n, decode: r };
 }
-function pe(e) {
+function ye(e) {
   return {
     encode: (t) => {
       if (!Array.isArray(t) || t.length && typeof t[0] != "number")
         throw new Error("alphabet.encode input should be an array of numbers");
       return t.map((n) => {
-        if (Ve(n), n < 0 || n >= e.length)
+        if (ze(n), n < 0 || n >= e.length)
           throw new Error(`Digit index outside alphabet: ${n} (alphabet: ${e.length})`);
         return e[n];
       });
@@ -1727,7 +1727,7 @@ function pe(e) {
     }
   };
 }
-function ye(e = "") {
+function pe(e = "") {
   if (typeof e != "string")
     throw new Error("join separator should be string");
   return {
@@ -1747,7 +1747,7 @@ function ye(e = "") {
   };
 }
 function ft(e, t = "=") {
-  if (Ve(e), typeof t != "string")
+  if (ze(e), typeof t != "string")
     throw new Error("padding chr should be string");
   return {
     encode(n) {
@@ -1776,12 +1776,12 @@ function ft(e, t = "=") {
     }
   };
 }
-function pr(e) {
+function yr(e) {
   if (typeof e != "function")
     throw new Error("normalize fn should be function");
   return { encode: (t) => t, decode: (t) => e(t) };
 }
-function Ln(e, t, n) {
+function Un(e, t, n) {
   if (t < 2)
     throw new Error(`convertRadix: wrong from=${t}, base cannot be less than 2`);
   if (n < 2)
@@ -1793,7 +1793,7 @@ function Ln(e, t, n) {
   let r = 0;
   const i = [], s = Array.from(e);
   for (s.forEach((o) => {
-    if (Ve(o), o < 0 || o >= t)
+    if (ze(o), o < 0 || o >= t)
       throw new Error(`Wrong integer: ${o}`);
   }); ; ) {
     let o = 0, c = !0;
@@ -1814,8 +1814,8 @@ function Ln(e, t, n) {
     i.push(0);
   return i.reverse();
 }
-const yr = (e, t) => t ? yr(t, e % t) : e, it = (e, t) => e + (t - yr(e, t));
-function qt(e, t, n, r) {
+const pr = (e, t) => t ? pr(t, e % t) : e, it = (e, t) => e + (t - pr(e, t));
+function Ht(e, t, n, r) {
   if (!Array.isArray(e))
     throw new Error("convertRadix2: data should be array");
   if (t <= 0 || t > 32)
@@ -1827,7 +1827,7 @@ function qt(e, t, n, r) {
   let i = 0, s = 0;
   const o = 2 ** n - 1, c = [];
   for (const a of e) {
-    if (Ve(a), a >= 2 ** t)
+    if (ze(a), a >= 2 ** t)
       throw new Error(`convertRadix2: invalid data word=${a} from=${t}`);
     if (i = i << t | a, s + t > 32)
       throw new Error(`convertRadix2: carry overflow pos=${s} from=${t}`);
@@ -1841,22 +1841,22 @@ function qt(e, t, n, r) {
     throw new Error(`Non-zero padding: ${i}`);
   return r && s > 0 && c.push(i >>> 0), c;
 }
-function As(e) {
-  return Ve(e), {
+function Ss(e) {
+  return ze(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
-      return Ln(Array.from(t), 2 ** 8, e);
+      return Un(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(Ln(t, e, 2 ** 8));
+      return Uint8Array.from(Un(t, e, 2 ** 8));
     }
   };
 }
-function Ae(e, t = !1) {
-  if (Ve(e), e <= 0 || e > 32)
+function Se(e, t = !1) {
+  if (ze(e), e <= 0 || e > 32)
     throw new Error("radix2: bits should be in (0..32]");
   if (it(8, e) > 32 || it(e, 8) > 32)
     throw new Error("radix2: carry overflow");
@@ -1864,16 +1864,16 @@ function Ae(e, t = !1) {
     encode: (n) => {
       if (!(n instanceof Uint8Array))
         throw new Error("radix2.encode input should be Uint8Array");
-      return qt(Array.from(n), 8, e, !t);
+      return Ht(Array.from(n), 8, e, !t);
     },
     decode: (n) => {
       if (!Array.isArray(n) || n.length && typeof n[0] != "number")
         throw new Error("radix2.decode input should be array of strings");
-      return Uint8Array.from(qt(n, e, 8, t));
+      return Uint8Array.from(Ht(n, e, 8, t));
     }
   };
 }
-function $n(e) {
+function Ln(e) {
   if (typeof e != "function")
     throw new Error("unsafeWrapper fn should be function");
   return function(...t) {
@@ -1883,25 +1883,25 @@ function $n(e) {
     }
   };
 }
-const Ks = de(Ae(4), pe("0123456789ABCDEF"), ye("")), Cs = de(Ae(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ft(5), ye(""));
-de(Ae(5), pe("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ft(5), ye(""));
-de(Ae(5), pe("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), ye(""), pr((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const he = de(Ae(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ft(6), ye("")), Bs = de(Ae(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ft(6), ye("")), tn = (e) => de(As(58), pe(e), ye("")), Dt = tn("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-tn("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
-tn("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
-const Tn = [0, 2, 3, 5, 6, 7, 9, 10, 11], ks = {
+const As = de(Se(4), ye("0123456789ABCDEF"), pe("")), Cs = de(Se(5), ye("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ft(5), pe(""));
+de(Se(5), ye("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ft(5), pe(""));
+de(Se(5), ye("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), pe(""), yr((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
+const he = de(Se(6), ye("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ft(6), pe("")), Bs = de(Se(6), ye("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ft(6), pe("")), en = (e) => de(Ss(58), ye(e), pe("")), qt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
+en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
+const $n = [0, 2, 3, 5, 6, 7, 9, 10, 11], _s = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
       const r = e.subarray(n, n + 8);
-      t += Dt.encode(r).padStart(Tn[r.length], "1");
+      t += qt.encode(r).padStart($n[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 = Tn.indexOf(r.length), s = Dt.decode(r);
+      const r = e.slice(n, n + 11), i = $n.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,96 +1909,96 @@ const Tn = [0, 2, 3, 5, 6, 7, 9, 10, 11], ks = {
     }
     return Uint8Array.from(t);
   }
-}, jt = de(pe("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), ye("")), Rn = [996825010, 642813549, 513874426, 1027748829, 705979059];
-function Ge(e) {
+}, Dt = de(ye("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), pe("")), Tn = [996825010, 642813549, 513874426, 1027748829, 705979059];
+function Ze(e) {
   const t = e >> 25;
   let n = (e & 33554431) << 5;
-  for (let r = 0; r < Rn.length; r++)
-    (t >> r & 1) === 1 && (n ^= Rn[r]);
+  for (let r = 0; r < Tn.length; r++)
+    (t >> r & 1) === 1 && (n ^= Tn[r]);
   return n;
 }
-function On(e, t, n = 1) {
+function Rn(e, t, n = 1) {
   const r = e.length;
   let i = 1;
   for (let s = 0; s < r; s++) {
     const o = e.charCodeAt(s);
     if (o < 33 || o > 126)
       throw new Error(`Invalid prefix (${e})`);
-    i = Ge(i) ^ o >> 5;
+    i = Ze(i) ^ o >> 5;
   }
-  i = Ge(i);
+  i = Ze(i);
   for (let s = 0; s < r; s++)
-    i = Ge(i) ^ e.charCodeAt(s) & 31;
+    i = Ze(i) ^ e.charCodeAt(s) & 31;
   for (let s of t)
-    i = Ge(i) ^ s;
+    i = Ze(i) ^ s;
   for (let s = 0; s < 6; s++)
-    i = Ge(i);
-  return i ^= n, jt.encode(qt([i % 2 ** 30], 30, 5, !1));
+    i = Ze(i);
+  return i ^= n, Dt.encode(Ht([i % 2 ** 30], 30, 5, !1));
 }
 function gr(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Ae(5), r = n.decode, i = n.encode, s = $n(r);
-  function o(f, u, g = 90) {
+  const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, s = Ln(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 b = f.length + 7 + u.length;
-    if (g !== !1 && b > g)
-      throw new TypeError(`Length ${b} exceeds limit ${g}`);
-    return f = f.toLowerCase(), `${f}1${jt.encode(u)}${On(f, u, t)}`;
+    if (y !== !1 && b > y)
+      throw new TypeError(`Length ${b} exceeds limit ${y}`);
+    return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${Rn(f, u, t)}`;
   }
   function c(f, u = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.decode input should be string, not ${typeof f}`);
     if (f.length < 8 || u !== !1 && f.length > u)
       throw new TypeError(`Wrong string length: ${f.length} (${f}). Expected (8..${u})`);
-    const g = f.toLowerCase();
-    if (f !== g && f !== f.toUpperCase())
+    const y = f.toLowerCase();
+    if (f !== y && f !== f.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
-    f = g;
+    f = y;
     const b = f.lastIndexOf("1");
     if (b === 0 || b === -1)
       throw new Error('Letter "1" must be present between prefix and data only');
     const p = f.slice(0, b), h = f.slice(b + 1);
     if (h.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const d = jt.decode(h).slice(0, -6), y = On(p, d, t);
-    if (!h.endsWith(y))
-      throw new Error(`Invalid checksum in ${f}: expected "${y}"`);
+    const d = Dt.decode(h).slice(0, -6), g = Rn(p, d, t);
+    if (!h.endsWith(g))
+      throw new Error(`Invalid checksum in ${f}: expected "${g}"`);
     return { prefix: p, words: d };
   }
-  const a = $n(c);
+  const a = Ln(c);
   function l(f) {
-    const { prefix: u, words: g } = c(f, !1);
-    return { prefix: u, words: g, bytes: r(g) };
+    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 };
 }
-const ze = gr("bech32");
+const je = gr("bech32");
 gr("bech32m");
-const _s = {
+const Is = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, Is = de(Ae(4), pe("0123456789abcdef"), ye(""), pr((e) => {
+}, ks = de(Se(4), ye("0123456789abcdef"), pe(""), yr((e) => {
   if (typeof e != "string" || e.length % 2)
     throw new TypeError(`hex.decode: expected string, got ${typeof e} with length ${e.length}`);
   return e.toLowerCase();
 })), Us = {
-  utf8: _s,
-  hex: Is,
-  base16: Ks,
+  utf8: Is,
+  hex: ks,
+  base16: As,
   base32: Cs,
   base64: he,
   base64url: Bs,
-  base58: Dt,
-  base58xmr: ks
+  base58: qt,
+  base58xmr: _s
 };
 `${Object.keys(Us).join(", ")}`;
-function kt(e) {
+function _t(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
-function Mn(e) {
+function On(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
@@ -2012,7 +2012,7 @@ function ce(e, ...t) {
     throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
 }
 /*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */
-const Z = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), $s = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const G = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), $s = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!$s)
   throw new Error("Non little-endian hardware is not supported");
 function Ts(e, t) {
@@ -2028,19 +2028,19 @@ function Rs(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Os = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Se = 16, Ms = 283;
-function nn(e) {
-  return e << 1 ^ Ms & -(e >> 7);
+const Os = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ke = 16, Ps = 283;
+function tn(e) {
+  return e << 1 ^ Ps & -(e >> 7);
 }
-function He(e, t) {
+function Me(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
-    n ^= e & -(t & 1), e = nn(e);
+    n ^= e & -(t & 1), e = tn(e);
   return n;
 }
-const zt = /* @__PURE__ */ (() => {
+const jt = /* @__PURE__ */ (() => {
   let e = new Uint8Array(256);
-  for (let n = 0, r = 1; n < 256; n++, r ^= nn(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,11 +2049,11 @@ const zt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), Ps = /* @__PURE__ */ zt.map((e, t) => zt.indexOf(t)), Hs = (e) => e << 24 | e >>> 8, _t = (e) => e << 8 | e >>> 24;
+})(), Ms = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Hs = (e) => e << 24 | e >>> 8, It = (e) => e << 8 | e >>> 24;
 function wr(e, t) {
   if (e.length !== 256)
     throw new Error("Wrong sbox length");
-  const n = new Uint32Array(256).map((l, f) => t(e[f])), r = n.map(_t), i = r.map(_t), s = i.map(_t), o = new Uint32Array(256 * 256), c = new Uint32Array(256 * 256), a = new Uint16Array(256 * 256);
+  const n = new Uint32Array(256).map((l, f) => t(e[f])), r = n.map(It), i = r.map(It), s = i.map(It), o = new Uint32Array(256 * 256), c = new Uint32Array(256 * 256), a = new Uint16Array(256 * 256);
   for (let l = 0; l < 256; l++)
     for (let f = 0; f < 256; f++) {
       const u = l * 256 + f;
@@ -2061,9 +2061,9 @@ function wr(e, t) {
     }
   return { sbox: e, sbox2: a, T0: n, T1: r, T2: i, T3: s, T01: o, T23: c };
 }
-const rn = /* @__PURE__ */ wr(zt, (e) => He(e, 3) << 24 | e << 16 | e << 8 | He(e, 2)), br = /* @__PURE__ */ wr(Ps, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), qs = /* @__PURE__ */ (() => {
+const nn = /* @__PURE__ */ wr(jt, (e) => Me(e, 3) << 24 | e << 16 | e << 8 | Me(e, 2)), br = /* @__PURE__ */ wr(Ms, (e) => Me(e, 11) << 24 | Me(e, 13) << 16 | Me(e, 9) << 8 | Me(e, 14)), qs = /* @__PURE__ */ (() => {
   const e = new Uint8Array(16);
-  for (let t = 0, n = 1; t < 16; t++, n = nn(n))
+  for (let t = 0, n = 1; t < 16; t++, n = tn(n))
     e[t] = n;
   return e;
 })();
@@ -2072,7 +2072,7 @@ function vr(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 } = rn, r = Z(e), i = r.length, s = (c) => oe(n, c, c, c, c), o = new Uint32Array(t + 28);
+  const { sbox2: n } = nn, r = G(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 vr(e) {
   return o;
 }
 function Ds(e) {
-  const t = vr(e), n = t.slice(), r = t.length, { sbox2: i } = rn, { T0: s, T1: o, T2: c, T3: a } = br;
+  const t = vr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: c, T3: a } = br;
   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 Pn(e, t, n, r, i) {
-  const { sbox2: s, T01: o, T23: c } = rn;
+  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 p = 0; p < l; p++) {
-    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), m = e[a++] ^ xe(o, c, i, t, n, r);
-    t = h, n = d, r = y, i = m;
+    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), g = e[a++] ^ xe(o, c, r, i, t, n), E = e[a++] ^ xe(o, c, i, t, n, r);
+    t = h, n = d, r = g, i = E;
   }
-  const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), g = e[a++] ^ oe(s, r, i, t, n), b = e[a++] ^ oe(s, i, t, n, r);
-  return { s0: f, s1: u, s2: g, s3: b };
+  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), b = e[a++] ^ oe(s, i, t, n, r);
+  return { s0: f, s1: u, s2: y, s3: b };
 }
 function js(e, t, n, r, i) {
   const { sbox2: s, T01: o, T23: c } = br;
@@ -2116,13 +2116,13 @@ function js(e, t, n, r, i) {
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
   for (let p = 0; p < l; p++) {
-    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), m = e[a++] ^ xe(o, c, i, r, n, t);
-    t = h, n = d, r = y, i = m;
+    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), g = e[a++] ^ xe(o, c, r, n, t, i), E = e[a++] ^ xe(o, c, i, r, n, t);
+    t = h, n = d, r = g, i = E;
   }
-  const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), g = e[a++] ^ oe(s, r, n, t, i), b = e[a++] ^ oe(s, i, r, n, t);
-  return { s0: f, s1: u, s2: g, s3: b };
+  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), b = e[a++] ^ oe(s, i, r, n, t);
+  return { s0: f, s1: u, s2: y, s3: b };
 }
-function Er(e, t) {
+function mr(e, t) {
   if (!t)
     return new Uint8Array(e);
   if (ce(t), t.length < e)
@@ -2130,20 +2130,20 @@ function Er(e, t) {
   return t;
 }
 function zs(e) {
-  if (ce(e), e.length % Se !== 0)
-    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Se}`);
+  if (ce(e), e.length % Ke !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ke}`);
 }
 function Vs(e, t, n) {
   let r = e.length;
-  const i = r % Se;
+  const i = r % Ke;
   if (!t && i !== 0)
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
-  const s = Z(e);
+  const s = G(e);
   if (t) {
-    let a = Se - i;
-    a || (a = Se), r = r + a;
+    let a = Ke - i;
+    a || (a = Ke), r = r + a;
   }
-  const o = Er(r, n), c = Z(o);
+  const o = mr(r, n), c = G(o);
   return { b: s, o: c, out: o };
 }
 function Ws(e, t) {
@@ -2162,52 +2162,52 @@ function Ws(e, t) {
   return i;
 }
 function Zs(e) {
-  const t = new Uint8Array(16), n = Z(t);
+  const t = new Uint8Array(16), n = G(t);
   t.set(e);
-  const r = Se - e.length;
-  for (let i = Se - r; i < Se; i++)
+  const r = Ke - e.length;
+  for (let i = Ke - r; i < Ke; i++)
     t[i] = r;
   return n;
 }
-const mr = /* @__PURE__ */ Os({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
+const Er = /* @__PURE__ */ Os({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
   ce(t), ce(n, 16);
   const i = !r.disablePadding;
   return {
     encrypt: (s, o) => {
-      const c = vr(t), { b: a, o: l, out: f } = Vs(s, i, o), u = Z(n);
-      let g = u[0], b = u[1], p = u[2], h = u[3], d = 0;
+      const c = vr(t), { b: a, o: l, out: f } = Vs(s, i, o), u = G(n);
+      let y = u[0], b = u[1], p = u[2], h = u[3], d = 0;
       for (; d + 4 <= a.length; )
-        g ^= a[d + 0], b ^= a[d + 1], p ^= a[d + 2], h ^= a[d + 3], { s0: g, s1: b, s2: p, s3: h } = Pn(c, g, b, p, h), l[d++] = g, l[d++] = b, l[d++] = p, l[d++] = h;
+        y ^= a[d + 0], b ^= a[d + 1], p ^= a[d + 2], h ^= a[d + 3], { s0: y, s1: b, s2: p, s3: h } = Pn(c, y, b, p, h), l[d++] = y, l[d++] = b, l[d++] = p, l[d++] = h;
       if (i) {
-        const y = Zs(s.subarray(d * 4));
-        g ^= y[0], b ^= y[1], p ^= y[2], h ^= y[3], { s0: g, s1: b, s2: p, s3: h } = Pn(c, g, b, p, h), l[d++] = g, l[d++] = b, l[d++] = p, l[d++] = h;
+        const g = Zs(s.subarray(d * 4));
+        y ^= g[0], b ^= g[1], p ^= g[2], h ^= g[3], { s0: y, s1: b, s2: p, s3: h } = Pn(c, y, b, p, h), l[d++] = y, l[d++] = b, l[d++] = p, l[d++] = h;
       }
       return c.fill(0), f;
     },
     decrypt: (s, o) => {
       zs(s);
-      const c = Ds(t), a = Z(n), l = Er(s.length, o), f = Z(s), u = Z(l);
-      let g = a[0], b = a[1], p = a[2], h = a[3];
+      const c = Ds(t), a = G(n), l = mr(s.length, o), f = G(s), u = G(l);
+      let y = a[0], b = a[1], p = a[2], h = a[3];
       for (let d = 0; d + 4 <= f.length; ) {
-        const y = g, m = b, A = p, I = h;
-        g = f[d + 0], b = f[d + 1], p = f[d + 2], h = f[d + 3];
-        const { s0: B, s1: E, s2: x, s3: S } = js(c, g, b, p, h);
-        u[d++] = B ^ y, u[d++] = E ^ m, u[d++] = x ^ A, u[d++] = S ^ I;
+        const g = y, E = b, S = p, k = h;
+        y = f[d + 0], b = f[d + 1], p = f[d + 2], h = f[d + 3];
+        const { s0: B, s1: m, s2: x, s3: K } = js(c, y, b, p, h);
+        u[d++] = B ^ g, u[d++] = m ^ E, u[d++] = x ^ S, u[d++] = K ^ k;
       }
       return c.fill(0), Ws(l, i);
     }
   };
-}), xr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Gs = xr("expand 16-byte k"), Fs = xr("expand 32-byte k"), Js = Z(Gs), Sr = Z(Fs);
-Sr.slice();
+}), xr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Gs = xr("expand 16-byte k"), Fs = xr("expand 32-byte k"), Js = G(Gs), Kr = G(Fs);
+Kr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
 }
-function Vt(e) {
+function zt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Xe = 64, Ys = 16, Nr = 2 ** 32 - 1, Hn = new Uint32Array();
+const Xe = 64, Ys = 16, Nr = 2 ** 32 - 1, Mn = new Uint32Array();
 function Xs(e, t, n, r, i, s, o, c) {
-  const a = i.length, l = new Uint8Array(Xe), f = Z(l), u = Vt(i) && Vt(s), g = u ? Z(i) : Hn, b = u ? Z(s) : Hn;
+  const a = i.length, l = new Uint8Array(Xe), f = G(l), u = zt(i) && zt(s), y = u ? G(i) : Mn, b = u ? G(s) : Mn;
   for (let p = 0; p < a; o++) {
     if (e(t, n, r, f, o, c), o >= Nr)
       throw new Error("arx: counter overflow");
@@ -2216,13 +2216,13 @@ function Xs(e, t, n, r, i, s, o, c) {
       const d = p / 4;
       if (p % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let y = 0, m; y < Ys; y++)
-        m = d + y, b[m] = g[m] ^ f[y];
+      for (let g = 0, E; g < Ys; g++)
+        E = d + g, b[E] = y[E] ^ f[g];
       p += Xe;
       continue;
     }
-    for (let d = 0, y; d < h; d++)
-      y = p + d, s[y] = i[y] ^ l[d];
+    for (let d = 0, g; d < h; d++)
+      g = p + d, s[g] = i[g] ^ l[d];
     p += h;
   }
 }
@@ -2230,54 +2230,54 @@ function Qs(e, t) {
   const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = Ts({ 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), Mn(s), Mn(n), (c, a, l, f, u = 0) => {
+  return _t(i), _t(o), On(s), On(n), (c, a, l, f, u = 0) => {
     ce(c), ce(a), ce(l);
-    const g = l.length;
-    if (f || (f = new Uint8Array(g)), ce(f), kt(u), u < 0 || u >= Nr)
+    const y = l.length;
+    if (f || (f = new Uint8Array(y)), ce(f), _t(u), u < 0 || u >= Nr)
       throw new Error("arx: counter overflow");
-    if (f.length < g)
-      throw new Error(`arx: output (${f.length}) is shorter than data (${g})`);
+    if (f.length < y)
+      throw new Error(`arx: output (${f.length}) is shorter than data (${y})`);
     const b = [];
     let p = c.length, h, d;
     if (p === 32)
-      h = c.slice(), b.push(h), d = Sr;
+      h = c.slice(), b.push(h), d = Kr;
     else if (p === 16 && n)
       h = new Uint8Array(32), h.set(c), h.set(c, 16), d = Js, b.push(h);
     else
       throw new Error(`arx: invalid 32-byte key, got length=${p}`);
-    Vt(a) || (a = a.slice(), b.push(a));
-    const y = Z(h);
+    zt(a) || (a = a.slice(), b.push(a));
+    const g = G(h);
     if (r) {
       if (a.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(d, y, Z(a.subarray(0, 16)), y), a = a.subarray(16);
+      r(d, g, G(a.subarray(0, 16)), g), a = a.subarray(16);
     }
-    const m = 16 - i;
-    if (m !== a.length)
-      throw new Error(`arx: nonce must be ${m} or 16 bytes`);
-    if (m !== 12) {
-      const I = new Uint8Array(12);
-      I.set(a, s ? 0 : 12 - a.length), a = I, b.push(a);
+    const E = 16 - i;
+    if (E !== a.length)
+      throw new Error(`arx: nonce must be ${E} or 16 bytes`);
+    if (E !== 12) {
+      const k = new Uint8Array(12);
+      k.set(a, s ? 0 : 12 - a.length), a = k, b.push(a);
     }
-    const A = Z(a);
-    for (Xs(e, d, y, A, l, f, u, o); b.length > 0; )
+    const S = G(a);
+    for (Xs(e, d, g, S, l, f, u, o); b.length > 0; )
       b.pop().fill(0);
     return f;
   };
 }
 function eo(e, t, n, r, i, s = 20) {
-  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], g = t[2], b = t[3], p = t[4], h = t[5], d = t[6], y = t[7], m = i, A = n[0], I = n[1], B = n[2], E = o, x = c, S = a, P = l, _ = f, K = u, T = g, R = b, H = p, w = h, v = d, N = y, k = m, C = A, U = I, O = B;
+  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], y = t[2], b = t[3], p = t[4], h = t[5], d = t[6], g = t[7], E = i, S = n[0], k = n[1], B = n[2], m = o, x = c, K = a, M = l, I = f, A = u, T = y, R = b, H = p, w = h, v = d, N = g, _ = E, C = S, U = k, O = B;
   for (let Q = 0; Q < s; Q += 2)
-    E = E + _ | 0, k = L(k ^ E, 16), H = H + k | 0, _ = L(_ ^ H, 12), E = E + _ | 0, k = L(k ^ E, 8), H = H + k | 0, _ = L(_ ^ H, 7), x = x + K | 0, C = L(C ^ x, 16), w = w + C | 0, K = L(K ^ w, 12), x = x + K | 0, C = L(C ^ x, 8), w = w + C | 0, K = L(K ^ w, 7), S = S + T | 0, U = L(U ^ S, 16), v = v + U | 0, T = L(T ^ v, 12), S = S + T | 0, U = L(U ^ S, 8), v = v + U | 0, T = L(T ^ v, 7), P = P + R | 0, O = L(O ^ P, 16), N = N + O | 0, R = L(R ^ N, 12), P = P + R | 0, O = L(O ^ P, 8), N = N + O | 0, R = L(R ^ N, 7), E = E + K | 0, O = L(O ^ E, 16), v = v + O | 0, K = L(K ^ v, 12), E = E + K | 0, O = L(O ^ E, 8), v = v + O | 0, K = L(K ^ v, 7), x = x + T | 0, k = L(k ^ x, 16), N = N + k | 0, T = L(T ^ N, 12), x = x + T | 0, k = L(k ^ x, 8), N = N + k | 0, T = L(T ^ N, 7), S = S + R | 0, C = L(C ^ S, 16), H = H + C | 0, R = L(R ^ H, 12), S = S + R | 0, C = L(C ^ S, 8), H = H + C | 0, R = L(R ^ H, 7), P = P + _ | 0, U = L(U ^ P, 16), w = w + U | 0, _ = L(_ ^ w, 12), P = P + _ | 0, U = L(U ^ P, 8), w = w + U | 0, _ = L(_ ^ w, 7);
+    m = m + I | 0, _ = L(_ ^ m, 16), H = H + _ | 0, I = L(I ^ H, 12), m = m + I | 0, _ = L(_ ^ m, 8), H = H + _ | 0, I = L(I ^ H, 7), x = x + A | 0, C = L(C ^ x, 16), w = w + C | 0, A = L(A ^ w, 12), x = x + A | 0, C = L(C ^ x, 8), w = w + C | 0, A = L(A ^ w, 7), K = K + T | 0, U = L(U ^ K, 16), v = v + U | 0, T = L(T ^ v, 12), K = K + T | 0, U = L(U ^ K, 8), v = v + U | 0, T = L(T ^ v, 7), M = M + R | 0, O = L(O ^ M, 16), N = N + O | 0, R = L(R ^ N, 12), M = M + R | 0, O = L(O ^ M, 8), N = N + O | 0, R = L(R ^ N, 7), m = m + A | 0, O = L(O ^ m, 16), v = v + O | 0, A = L(A ^ v, 12), m = m + A | 0, O = L(O ^ m, 8), v = v + O | 0, A = L(A ^ v, 7), x = x + T | 0, _ = L(_ ^ x, 16), N = N + _ | 0, T = L(T ^ N, 12), x = x + T | 0, _ = L(_ ^ x, 8), N = N + _ | 0, T = L(T ^ N, 7), K = K + R | 0, C = L(C ^ K, 16), H = H + C | 0, R = L(R ^ H, 12), K = K + R | 0, C = L(C ^ K, 8), H = H + C | 0, R = L(R ^ H, 7), M = M + I | 0, U = L(U ^ M, 16), w = w + U | 0, I = L(I ^ w, 12), M = M + I | 0, U = L(U ^ M, 8), w = w + U | 0, I = L(I ^ w, 7);
   let $ = 0;
-  r[$++] = o + E | 0, r[$++] = c + x | 0, r[$++] = a + S | 0, r[$++] = l + P | 0, r[$++] = f + _ | 0, r[$++] = u + K | 0, r[$++] = g + T | 0, r[$++] = b + R | 0, r[$++] = p + H | 0, r[$++] = h + w | 0, r[$++] = d + v | 0, r[$++] = y + N | 0, r[$++] = m + k | 0, r[$++] = A + C | 0, r[$++] = I + U | 0, r[$++] = B + O | 0;
+  r[$++] = o + m | 0, r[$++] = c + x | 0, r[$++] = a + K | 0, r[$++] = l + M | 0, r[$++] = f + I | 0, r[$++] = u + A | 0, r[$++] = y + T | 0, r[$++] = b + R | 0, r[$++] = p + H | 0, r[$++] = h + w | 0, r[$++] = d + v | 0, r[$++] = g + N | 0, r[$++] = E + _ | 0, r[$++] = S + C | 0, r[$++] = k + U | 0, r[$++] = B + O | 0;
 }
-const Ar = /* @__PURE__ */ Qs(eo, {
+const Sr = /* @__PURE__ */ Qs(eo, {
   counterRight: !1,
   counterLength: 4,
   allowShortKeys: !1
 });
-class Kr extends ur {
+class Ar extends ur {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, se.hash(t);
     const r = Je(n);
@@ -2312,26 +2312,26 @@ class Kr extends ur {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const ht = (e, t, n) => new Kr(e, t).update(n).digest();
-ht.create = (e, t) => new Kr(e, t);
-function sn(e, t, n) {
+const ht = (e, t, n) => new Ar(e, t).update(n).digest();
+ht.create = (e, t) => new Ar(e, t);
+function rn(e, t, n) {
   return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), ht(e, Je(n), Je(t));
 }
-const It = new Uint8Array([0]), qn = new Uint8Array();
+const kt = new Uint8Array([0]), Hn = new Uint8Array();
 function Cr(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 = qn);
+  n === void 0 && (n = Hn);
   const s = new Uint8Array(i * e.outputLen), o = ht.create(e, t), c = o._cloneInto(), a = new Uint8Array(o.outputLen);
   for (let l = 0; l < i; l++)
-    It[0] = l + 1, c.update(l === 0 ? qn : a).update(n).update(It).digestInto(a), s.set(a, e.outputLen * l), o._cloneInto(c);
-  return o.destroy(), c.destroy(), a.fill(0), It.fill(0), s.slice(0, r);
+    kt[0] = l + 1, c.update(l === 0 ? Hn : a).update(n).update(kt).digestInto(a), s.set(a, e.outputLen * l), o._cloneInto(c);
+  return o.destroy(), c.destroy(), a.fill(0), kt.fill(0), s.slice(0, r);
 }
 var to = Object.defineProperty, D = (e, t) => {
   for (var n in t)
     to(e, n, { get: t[n], enumerable: !0 });
-}, Oe = Symbol("verified"), no = (e) => e instanceof Object;
+}, Re = Symbol("verified"), no = (e) => e instanceof Object;
 function dt(e) {
   if (!no(e) || typeof e.kind != "number" || typeof e.content != "string" || typeof e.created_at != "number" || typeof e.pubkey != "string" || !e.pubkey.match(/^[a-f0-9]{64}$/) || !Array.isArray(e.tags))
     return !1;
@@ -2349,7 +2349,7 @@ var ro = {};
 D(ro, {
   Queue: () => ao,
   QueueNode: () => Br,
-  binarySearch: () => on,
+  binarySearch: () => sn,
   insertEventIntoAscendingList: () => oo,
   insertEventIntoDescendingList: () => so,
   normalizeURL: () => io,
@@ -2363,14 +2363,14 @@ function io(e) {
   return t.pathname = t.pathname.replace(/\/+/g, "/"), t.pathname.endsWith("/") && (t.pathname = t.pathname.slice(0, -1)), (t.port === "80" && t.protocol === "ws:" || t.port === "443" && t.protocol === "wss:") && (t.port = ""), t.searchParams.sort(), t.hash = "", t.toString();
 }
 function so(e, t) {
-  const [n, r] = on(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 oo(e, t) {
-  const [n, r] = on(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 on(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]);
@@ -2409,26 +2409,26 @@ var Br = class {
   }
 }, co = class {
   generateSecretKey() {
-    return Ze.utils.randomPrivateKey();
+    return We.utils.randomPrivateKey();
   }
   getPublicKey(e) {
-    return M(Ze.getPublicKey(e));
+    return P(We.getPublicKey(e));
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = M(Ze.getPublicKey(t)), n.id = qe(n), n.sig = M(Ze.sign(qe(n), t)), n[Oe] = !0, n;
+    return n.pubkey = P(We.getPublicKey(t)), n.id = He(n), n.sig = P(We.sign(He(n), t)), n[Re] = !0, n;
   }
   verifyEvent(e) {
-    if (typeof e[Oe] == "boolean")
-      return e[Oe];
-    const t = qe(e);
+    if (typeof e[Re] == "boolean")
+      return e[Re];
+    const t = He(e);
     if (t !== e.id)
-      return e[Oe] = !1, !1;
+      return e[Re] = !1, !1;
     try {
-      const n = Ze.verify(e.sig, t, e.pubkey);
-      return e[Oe] = n, n;
+      const n = We.verify(e.sig, t, e.pubkey);
+      return e[Re] = n, n;
     } catch {
-      return e[Oe] = !1, !1;
+      return e[Re] = !1, !1;
     }
   }
 };
@@ -2437,30 +2437,30 @@ function uo(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 He(e) {
   let t = fe(ne.encode(uo(e)));
-  return M(t);
+  return P(t);
 }
-var pt = new co(), _e = pt.generateSecretKey, le = pt.getPublicKey, X = pt.finalizeEvent, yt = pt.verifyEvent, lo = {};
+var yt = new co(), _e = yt.generateSecretKey, le = yt.getPublicKey, X = yt.finalizeEvent, pt = yt.verifyEvent, lo = {};
 D(lo, {
   Application: () => da,
-  BadgeAward: () => Eo,
+  BadgeAward: () => mo,
   BadgeDefinition: () => oa,
   BlockedRelaysList: () => zo,
   BookmarkList: () => qo,
   Bookmarksets: () => ra,
-  Calendar: () => Ea,
-  CalendarEventRSVP: () => ma,
+  Calendar: () => ma,
+  CalendarEventRSVP: () => Ea,
   ChannelCreation: () => $r,
   ChannelHideMessage: () => Or,
   ChannelMessage: () => Rr,
   ChannelMetadata: () => Tr,
-  ChannelMuteUser: () => Mr,
+  ChannelMuteUser: () => Pr,
   ClassifiedListing: () => ga,
   ClientAuth: () => Hr,
   CommunitiesList: () => Do,
   CommunityDefinition: () => Na,
-  CommunityPostApproval: () => _o,
+  CommunityPostApproval: () => Io,
   Contacts: () => wo,
   CreateOrUpdateProduct: () => ua,
   CreateOrUpdateStall: () => ca,
@@ -2477,85 +2477,85 @@ D(lo, {
   Followsets: () => ea,
   GenericRepost: () => xo,
   Genericlists: () => ta,
-  GiftWrap: () => Pr,
-  HTTPAuth: () => un,
-  Handlerinformation: () => Sa,
+  GiftWrap: () => Mr,
+  HTTPAuth: () => cn,
+  Handlerinformation: () => Ka,
   Handlerrecommendation: () => xa,
   Highlights: () => Oo,
   InterestsList: () => Wo,
   Interestsets: () => aa,
   JobFeedback: () => Lo,
-  JobRequest: () => Io,
+  JobRequest: () => ko,
   JobResult: () => Uo,
-  Label: () => ko,
+  Label: () => _o,
   LightningPubRPC: () => Yo,
-  LiveChatMessage: () => Ao,
-  LiveEvent: () => pa,
+  LiveChatMessage: () => So,
+  LiveEvent: () => ya,
   LongFormArticle: () => la,
-  Metadata: () => po,
-  Mutelist: () => Mo,
+  Metadata: () => yo,
+  Mutelist: () => Po,
   NWCWalletInfo: () => Jo,
   NWCWalletRequest: () => qr,
   NWCWalletResponse: () => Xo,
   NostrConnect: () => Qo,
-  OpenTimestamps: () => So,
-  Pinlist: () => Po,
-  PrivateDirectMessage: () => mo,
-  ProblemTracker: () => Ko,
+  OpenTimestamps: () => Ko,
+  Pinlist: () => Mo,
+  PrivateDirectMessage: () => Eo,
+  ProblemTracker: () => Ao,
   ProfileBadges: () => sa,
   PublicChatsList: () => jo,
-  Reaction: () => cn,
+  Reaction: () => an,
   RecommendRelay: () => go,
   RelayList: () => Ho,
   Relaysets: () => na,
   Report: () => Co,
   Reporting: () => Bo,
-  Repost: () => an,
+  Repost: () => on,
   Seal: () => Lr,
   SearchRelaysList: () => Vo,
-  ShortTextNote: () => yo,
+  ShortTextNote: () => po,
   Time: () => va,
   UserEmojiList: () => Zo,
-  UserStatuses: () => ya,
+  UserStatuses: () => pa,
   Zap: () => Ro,
   ZapGoal: () => $o,
   ZapRequest: () => To,
   classifyKind: () => fo,
-  isEphemeralKind: () => Ir,
+  isEphemeralKind: () => kr,
   isKind: () => ho,
   isParameterizedReplaceableKind: () => Ur,
-  isRegularKind: () => kr,
-  isReplaceableKind: () => _r
+  isRegularKind: () => _r,
+  isReplaceableKind: () => Ir
 });
-function kr(e) {
+function _r(e) {
   return 1e3 <= e && e < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(e);
 }
-function _r(e) {
+function Ir(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
-function Ir(e) {
+function kr(e) {
   return 2e4 <= e && e < 3e4;
 }
 function Ur(e) {
   return 3e4 <= e && e < 4e4;
 }
 function fo(e) {
-  return kr(e) ? "regular" : _r(e) ? "replaceable" : Ir(e) ? "ephemeral" : Ur(e) ? "parameterized" : "unknown";
+  return _r(e) ? "regular" : Ir(e) ? "replaceable" : kr(e) ? "ephemeral" : Ur(e) ? "parameterized" : "unknown";
 }
 function ho(e, t) {
   const n = t instanceof Array ? t : [t];
   return dt(e) && n.includes(e.kind) || !1;
 }
-var po = 0, yo = 1, go = 2, wo = 3, bo = 4, vo = 5, an = 6, cn = 7, Eo = 8, Lr = 13, mo = 14, xo = 16, $r = 40, Tr = 41, Rr = 42, Or = 43, Mr = 44, So = 1040, Pr = 1059, No = 1063, Ao = 1311, Ko = 1971, Co = 1984, Bo = 1984, ko = 1985, _o = 4550, Io = 5999, Uo = 6999, Lo = 7e3, $o = 9041, To = 9734, Ro = 9735, Oo = 9802, Mo = 1e4, Po = 10001, Ho = 10002, qo = 10003, Do = 10004, jo = 10005, zo = 10006, Vo = 10007, Wo = 10015, Zo = 10030, Go = 10050, Fo = 10096, Jo = 13194, Yo = 21e3, Hr = 22242, qr = 23194, Xo = 23195, Qo = 24133, un = 27235, ea = 3e4, ta = 30001, na = 30002, ra = 30003, ia = 30004, sa = 30008, oa = 30009, aa = 30015, ca = 30017, ua = 30018, la = 30023, fa = 30024, ha = 30030, da = 30078, pa = 30311, ya = 30315, ga = 30402, wa = 30403, ba = 31922, va = 31923, Ea = 31924, ma = 31925, xa = 31989, Sa = 31990, Na = 34550, Aa = {};
-D(Aa, {
-  getHex64: () => ln,
+var yo = 0, po = 1, go = 2, wo = 3, bo = 4, vo = 5, on = 6, an = 7, mo = 8, Lr = 13, Eo = 14, xo = 16, $r = 40, Tr = 41, Rr = 42, Or = 43, Pr = 44, Ko = 1040, Mr = 1059, No = 1063, So = 1311, Ao = 1971, Co = 1984, Bo = 1984, _o = 1985, Io = 4550, ko = 5999, Uo = 6999, Lo = 7e3, $o = 9041, To = 9734, Ro = 9735, Oo = 9802, Po = 1e4, Mo = 10001, Ho = 10002, qo = 10003, Do = 10004, jo = 10005, zo = 10006, Vo = 10007, Wo = 10015, Zo = 10030, Go = 10050, Fo = 10096, Jo = 13194, Yo = 21e3, Hr = 22242, qr = 23194, Xo = 23195, Qo = 24133, cn = 27235, ea = 3e4, ta = 30001, na = 30002, ra = 30003, ia = 30004, sa = 30008, oa = 30009, aa = 30015, ca = 30017, ua = 30018, la = 30023, fa = 30024, ha = 30030, da = 30078, ya = 30311, pa = 30315, ga = 30402, wa = 30403, ba = 31922, va = 31923, ma = 31924, Ea = 31925, xa = 31989, Ka = 31990, Na = 34550, Sa = {};
+D(Sa, {
+  getHex64: () => un,
   getInt: () => Dr,
-  getSubscriptionId: () => Ka,
+  getSubscriptionId: () => Aa,
   matchEventId: () => Ca,
-  matchEventKind: () => ka,
+  matchEventKind: () => _a,
   matchEventPubkey: () => Ba
 });
-function ln(e, t) {
+function un(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);
 }
@@ -2563,7 +2563,7 @@ function Dr(e, t) {
   let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), s = Math.min(i.indexOf(","), i.indexOf("}"));
   return parseInt(i.slice(0, s), 10);
 }
-function Ka(e) {
+function Aa(e) {
   let t = e.slice(0, 22).indexOf('"EVENT"');
   if (t === -1)
     return null;
@@ -2577,19 +2577,19 @@ function Ka(e) {
   return e.slice(r + 1, s);
 }
 function Ca(e, t) {
-  return t === ln(e, "id");
+  return t === un(e, "id");
 }
 function Ba(e, t) {
-  return t === ln(e, "pubkey");
+  return t === un(e, "pubkey");
 }
-function ka(e, t) {
+function _a(e, t) {
   return t === Dr(e, "kind");
 }
-var _a = {};
-D(_a, {
-  makeAuthEvent: () => Ia
+var Ia = {};
+D(Ia, {
+  makeAuthEvent: () => ka
 });
-function Ia(e, t) {
+function ka(e, t) {
   return {
     kind: Hr,
     created_at: Math.floor(Date.now() / 1e3),
@@ -2613,15 +2613,15 @@ try {
 var $a = {};
 D($a, {
   BECH32_REGEX: () => jr,
-  Bech32MaxSize: () => fn,
+  Bech32MaxSize: () => ln,
   NostrTypeGuard: () => Ta,
   decode: () => gt,
   encodeBytes: () => bt,
   naddrEncode: () => Da,
   neventEncode: () => qa,
-  noteEncode: () => Pa,
+  noteEncode: () => Ma,
   nprofileEncode: () => Ha,
-  npubEncode: () => Ma,
+  npubEncode: () => Pa,
   nsecEncode: () => Oa
 });
 var Ta = {
@@ -2632,14 +2632,14 @@ var Ta = {
   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 || "")
-}, fn = 5e3, jr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
+}, ln = 5e3, jr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
 function Ra(e) {
   const t = new Uint8Array(4);
   return t[0] = e >> 24 & 255, t[1] = e >> 16 & 255, t[2] = e >> 8 & 255, t[3] = e & 255, t;
 }
 function gt(e) {
   var i, s, o, c, a, l, f;
-  let { prefix: t, words: n } = ze.decode(e, fn), r = new Uint8Array(ze.fromWords(n));
+  let { prefix: t, words: n } = je.decode(e, ln), r = new Uint8Array(je.fromWords(n));
   switch (t) {
     case "nprofile": {
       let u = Ut(r);
@@ -2650,8 +2650,8 @@ function gt(e) {
       return {
         type: "nprofile",
         data: {
-          pubkey: M(u[0][0]),
-          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
+          pubkey: P(u[0][0]),
+          relays: u[1] ? u[1].map((y) => ue.decode(y)) : []
         }
       };
     }
@@ -2668,10 +2668,10 @@ function gt(e) {
       return {
         type: "nevent",
         data: {
-          id: M(u[0][0]),
-          relays: u[1] ? u[1].map((g) => ue.decode(g)) : [],
-          author: (o = u[2]) != null && o[0] ? M(u[2][0]) : void 0,
-          kind: (c = u[3]) != null && c[0] ? parseInt(M(u[3][0]), 16) : void 0
+          id: P(u[0][0]),
+          relays: u[1] ? u[1].map((y) => ue.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
         }
       };
     }
@@ -2691,9 +2691,9 @@ function gt(e) {
         type: "naddr",
         data: {
           identifier: ue.decode(u[0][0]),
-          pubkey: M(u[2][0]),
-          kind: parseInt(M(u[3][0]), 16),
-          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
+          pubkey: P(u[2][0]),
+          kind: parseInt(P(u[3][0]), 16),
+          relays: u[1] ? u[1].map((y) => ue.decode(y)) : []
         }
       };
     }
@@ -2701,7 +2701,7 @@ function gt(e) {
       return { type: t, data: r };
     case "npub":
     case "note":
-      return { type: t, data: M(r) };
+      return { type: t, data: P(r) };
     default:
       throw new Error(`unknown prefix ${t}`);
   }
@@ -2719,22 +2719,22 @@ function Ut(e) {
 function Oa(e) {
   return bt("nsec", e);
 }
-function Ma(e) {
-  return bt("npub", G(e));
-}
 function Pa(e) {
-  return bt("note", G(e));
+  return bt("npub", z(e));
+}
+function Ma(e) {
+  return bt("note", z(e));
 }
 function wt(e, t) {
-  let n = ze.toWords(t);
-  return ze.encode(e, n, fn);
+  let n = je.toWords(t);
+  return je.encode(e, n, ln);
 }
 function bt(e, t) {
   return wt(e, t);
 }
 function Ha(e) {
-  let t = hn({
-    0: [G(e.pubkey)],
+  let t = fn({
+    0: [z(e.pubkey)],
     1: (e.relays || []).map((n) => ne.encode(n))
   });
   return wt("nprofile", t);
@@ -2742,10 +2742,10 @@ function Ha(e) {
 function qa(e) {
   let t;
   e.kind !== void 0 && (t = Ra(e.kind));
-  let n = hn({
-    0: [G(e.id)],
+  let n = fn({
+    0: [z(e.id)],
     1: (e.relays || []).map((r) => ne.encode(r)),
-    2: e.author ? [G(e.author)] : [],
+    2: e.author ? [z(e.author)] : [],
     3: t ? [new Uint8Array(t)] : []
   });
   return wt("nevent", n);
@@ -2753,15 +2753,15 @@ function qa(e) {
 function Da(e) {
   let t = new ArrayBuffer(4);
   new DataView(t).setUint32(0, e.kind, !1);
-  let n = hn({
+  let n = fn({
     0: [ne.encode(e.identifier)],
     1: (e.relays || []).map((r) => ne.encode(r)),
-    2: [G(e.pubkey)],
+    2: [z(e.pubkey)],
     3: [new Uint8Array(t)]
   });
   return wt("naddr", n);
 }
-function hn(e) {
+function fn(e) {
   let t = [];
   return Object.entries(e).reverse().forEach(([n, r]) => {
     r.forEach((i) => {
@@ -2776,13 +2776,13 @@ D(ja, {
   encrypt: () => zr
 });
 async function zr(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e, i = Ue.getSharedSecret(r, "02" + t), s = Vr(i);
-  let o = Uint8Array.from(fr(16)), c = ne.encode(n), a = mr(s, o).encrypt(c), l = he.encode(new Uint8Array(a)), f = he.encode(new Uint8Array(o.buffer));
+  const r = e instanceof Uint8Array ? P(e) : e, i = ke.getSharedSecret(r, "02" + t), s = Vr(i);
+  let o = Uint8Array.from(fr(16)), c = ne.encode(n), a = Er(s, o).encrypt(c), l = he.encode(new Uint8Array(a)), f = he.encode(new Uint8Array(o.buffer));
   return `${l}?iv=${f}`;
 }
 async function za(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e;
-  let [i, s] = n.split("?iv="), o = Ue.getSharedSecret(r, "02" + t), c = Vr(o), a = he.decode(s), l = he.decode(i), f = mr(c, a).decrypt(l);
+  const r = e instanceof Uint8Array ? P(e) : e;
+  let [i, s] = n.split("?iv="), o = ke.getSharedSecret(r, "02" + t), c = Vr(o), a = he.decode(s), l = he.decode(i), f = Er(c, a).decrypt(l);
   return ue.decode(f);
 }
 function Vr(e) {
@@ -2790,14 +2790,14 @@ function Vr(e) {
 }
 var Va = {};
 D(Va, {
-  NIP05_REGEX: () => dn,
+  NIP05_REGEX: () => hn,
   isNip05: () => Wa,
   isValid: () => Fa,
   queryProfile: () => Wr,
   searchDomain: () => Ga,
   useFetchImplementation: () => Za
 });
-var dn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Wa = (e) => dn.test(e || ""), vt;
+var hn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Wa = (e) => hn.test(e || ""), vt;
 try {
   vt = fetch;
 } catch {
@@ -2817,7 +2817,7 @@ async function Ga(e, t = "") {
 }
 async function Wr(e) {
   var i;
-  const t = e.match(dn);
+  const t = e.match(hn);
   if (!t)
     return null;
   const [, n = "_", r] = t;
@@ -2954,7 +2954,7 @@ function nc(e, t) {
   return r;
 }
 function Fr(e) {
-  return M(
+  return P(
     fe(ne.encode(JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content])))
   );
 }
@@ -2967,7 +2967,7 @@ D(rc, {
 function ic(e, t, n, r) {
   return X(
     {
-      kind: an,
+      kind: on,
       tags: [...e.tags ?? [], ["e", t.id, n], ["p", t.pubkey]],
       content: e.content === "" ? "" : JSON.stringify(t),
       created_at: e.created_at
@@ -2976,7 +2976,7 @@ function ic(e, t, n, r) {
   );
 }
 function Jr(e) {
-  if (e.kind !== an)
+  if (e.kind !== on)
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -3000,21 +3000,21 @@ function sc(e, { skipVerification: t } = {}) {
   } catch {
     return;
   }
-  if (r.id === n.id && !(!t && !yt(r)))
+  if (r.id === n.id && !(!t && !pt(r)))
     return r;
 }
 var oc = {};
 D(oc, {
-  NOSTR_URI_REGEX: () => Et,
+  NOSTR_URI_REGEX: () => mt,
   parse: () => cc,
   test: () => ac
 });
-var Et = new RegExp(`nostr:(${jr.source})`);
+var mt = new RegExp(`nostr:(${jr.source})`);
 function ac(e) {
-  return typeof e == "string" && new RegExp(`^${Et.source}$`).test(e);
+  return typeof e == "string" && new RegExp(`^${mt.source}$`).test(e);
 }
 function cc(e) {
-  const t = e.match(new RegExp(`^${Et.source}$`));
+  const t = e.match(new RegExp(`^${mt.source}$`));
   if (!t)
     throw new Error(`Invalid Nostr URI: ${e}`);
   return {
@@ -3033,7 +3033,7 @@ function lc(e, t, n) {
   return X(
     {
       ...e,
-      kind: cn,
+      kind: an,
       tags: [...e.tags ?? [], ...r, ["e", t.id], ["p", t.pubkey]],
       content: e.content ?? "+"
     },
@@ -3041,7 +3041,7 @@ function lc(e, t, n) {
   );
 }
 function fc(e) {
-  if (e.kind !== cn)
+  if (e.kind !== an)
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -3058,12 +3058,12 @@ function fc(e) {
 var hc = {};
 D(hc, {
   matchAll: () => dc,
-  regex: () => pn,
-  replaceAll: () => pc
+  regex: () => dn,
+  replaceAll: () => yc
 });
-var pn = () => new RegExp(`\\b${Et.source}\\b`, "g");
+var dn = () => new RegExp(`\\b${mt.source}\\b`, "g");
 function* dc(e) {
-  const t = e.matchAll(pn());
+  const t = e.matchAll(dn());
   for (const n of t)
     try {
       const [r, i] = n;
@@ -3077,20 +3077,20 @@ function* dc(e) {
     } catch {
     }
 }
-function pc(e, t) {
-  return e.replaceAll(pn(), (n, r) => t({
+function yc(e, t) {
+  return e.replaceAll(dn(), (n, r) => t({
     uri: n,
     value: r,
     decoded: gt(r)
   }));
 }
-var yc = {};
-D(yc, {
+var pc = {};
+D(pc, {
   channelCreateEvent: () => gc,
   channelHideMessageEvent: () => vc,
   channelMessageEvent: () => bc,
   channelMetadataEvent: () => wc,
-  channelMuteUserEvent: () => Ec
+  channelMuteUserEvent: () => mc
 });
 var gc = (e, t) => {
   let n;
@@ -3154,7 +3154,7 @@ var gc = (e, t) => {
     },
     t
   );
-}, Ec = (e, t) => {
+}, mc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3164,19 +3164,19 @@ var gc = (e, t) => {
     return;
   return X(
     {
-      kind: Mr,
+      kind: Pr,
       tags: [["p", e.pubkey_to_mute], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, mc = {};
-D(mc, {
+}, Ec = {};
+D(Ec, {
   EMOJI_SHORTCODE_REGEX: () => Yr,
   matchAll: () => xc,
   regex: () => yn,
-  replaceAll: () => Sc
+  replaceAll: () => Kc
 });
 var Yr = /:(\w+):/, yn = () => new RegExp(`\\B${Yr.source}\\B`, "g");
 function* xc(e) {
@@ -3193,7 +3193,7 @@ function* xc(e) {
     } catch {
     }
 }
-function Sc(e, t) {
+function Kc(e, t) {
   return e.replaceAll(yn(), (n, r) => t({
     shortcode: n,
     name: r
@@ -3201,35 +3201,35 @@ function Sc(e, t) {
 }
 var Nc = {};
 D(Nc, {
-  useFetchImplementation: () => Ac,
-  validateGithub: () => Kc
+  useFetchImplementation: () => Sc,
+  validateGithub: () => Ac
 });
-var gn;
+var pn;
 try {
-  gn = fetch;
+  pn = fetch;
 } catch {
 }
-function Ac(e) {
-  gn = e;
+function Sc(e) {
+  pn = e;
 }
-async function Kc(e, t, n) {
+async function Ac(e, t, n) {
   try {
-    return await (await gn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
+    return await (await pn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
   } catch {
     return !1;
   }
 }
 var q = {};
 D(q, {
-  decrypt: () => En,
-  encrypt: () => vn,
-  getConversationKey: () => wn,
-  v2: () => Ic
+  decrypt: () => vn,
+  encrypt: () => bn,
+  getConversationKey: () => gn,
+  v2: () => kc
 });
 var Xr = 1, Qr = 65535;
-function wn(e, t) {
-  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return sn(fe, n, "nip44-v2");
+function gn(e, t) {
+  const n = ke.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return rn(fe, n, "nip44-v2");
 }
 function ei(e, t) {
   const n = Cr(fe, e, t, 76);
@@ -3239,7 +3239,7 @@ function ei(e, t) {
     hmac_key: n.subarray(44, 76)
   };
 }
-function bn(e) {
+function wn(e) {
   if (!Number.isSafeInteger(e) || e < 1)
     throw new Error("expected positive integer");
   if (e <= 32)
@@ -3254,12 +3254,12 @@ function Cc(e) {
   return new DataView(t.buffer).setUint16(0, e, !1), t;
 }
 function Bc(e) {
-  const t = ne.encode(e), n = t.length, r = Cc(n), i = new Uint8Array(bn(n) - n);
+  const t = ne.encode(e), n = t.length, r = Cc(n), i = new Uint8Array(wn(n) - n);
   return lt(r, t, i);
 }
-function kc(e) {
+function _c(e) {
   const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
-  if (t < Xr || t > Qr || n.length !== t || e.length !== 2 + bn(t))
+  if (t < Xr || t > Qr || n.length !== t || e.length !== 2 + wn(t))
     throw new Error("invalid padding");
   return ue.decode(n);
 }
@@ -3269,7 +3269,7 @@ function ti(e, t, n) {
   const r = lt(n, t);
   return ht(fe, e, r);
 }
-function _c(e) {
+function Ic(e) {
   if (typeof e != "string")
     throw new Error("payload must be a valid string");
   const t = e.length;
@@ -3295,24 +3295,24 @@ function _c(e) {
     mac: n.subarray(-32)
   };
 }
-function vn(e, t, n = fr(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ei(t, n), o = Bc(e), c = Ar(r, i, o), a = ti(s, c, n);
+function bn(e, t, n = fr(32)) {
+  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ei(t, n), o = Bc(e), c = Sr(r, i, o), a = ti(s, c, n);
   return he.encode(lt(new Uint8Array([2]), n, c, a));
 }
-function En(e, t) {
-  const { nonce: n, ciphertext: r, mac: i } = _c(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = ei(t, n), a = ti(c, r, n);
+function vn(e, t) {
+  const { nonce: n, ciphertext: r, mac: i } = Ic(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = ei(t, n), a = ti(c, r, n);
   if (!Rs(a, i))
     throw new Error("invalid MAC");
-  const l = Ar(s, o, r);
-  return kc(l);
+  const l = Sr(s, o, r);
+  return _c(l);
 }
-var Ic = {
+var kc = {
   utils: {
-    getConversationKey: wn,
-    calcPaddedLen: bn
+    getConversationKey: gn,
+    calcPaddedLen: wn
   },
-  encrypt: vn,
-  decrypt: En
+  encrypt: bn,
+  decrypt: vn
 }, Uc = {};
 D(Uc, {
   makeNwcRequestEvent: () => $c,
@@ -3342,9 +3342,9 @@ var Tc = {};
 D(Tc, {
   getZapEndpoint: () => Oc,
   makeZapReceipt: () => Hc,
-  makeZapRequest: () => Mc,
+  makeZapRequest: () => Pc,
   useFetchImplementation: () => Rc,
-  validateZapRequest: () => Pc
+  validateZapRequest: () => Mc
 });
 var mn;
 try {
@@ -3358,7 +3358,7 @@ async function Oc(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
-      let { words: o } = ze.decode(n, 1e3), c = ze.fromWords(o);
+      let { words: o } = je.decode(n, 1e3), c = je.fromWords(o);
       t = ue.decode(c);
     } else if (r) {
       let [o, c] = r.split("@");
@@ -3372,7 +3372,7 @@ async function Oc(e) {
   }
   return null;
 }
-function Mc({
+function Pc({
   profile: e,
   event: t,
   amount: n,
@@ -3395,7 +3395,7 @@ function Mc({
   };
   return t && s.tags.push(["e", t]), s;
 }
-function Pc(e) {
+function Mc(e) {
   let t;
   try {
     t = JSON.parse(e);
@@ -3404,7 +3404,7 @@ function Pc(e) {
   }
   if (!dt(t))
     return "Zap request is not a valid Nostr event.";
-  if (!yt(t))
+  if (!pt(t))
     return "Invalid signature on zap request.";
   let n = t.tags.find(([s, o]) => s === "p" && o);
   if (!n)
@@ -3435,10 +3435,10 @@ D(qc, {
   createWrap: () => ci,
   unwrapEvent: () => ui,
   unwrapManyEvents: () => zc,
-  wrapEvent: () => Wt,
+  wrapEvent: () => Vt,
   wrapManyEvents: () => jc
 });
-var Dc = 2 * 24 * 60 * 60, ni = () => Math.round(Date.now() / 1e3), ri = () => Math.round(ni() - Math.random() * Dc), ii = (e, t) => wn(e, t), si = (e, t, n) => vn(JSON.stringify(e), ii(t, n)), Dn = (e, t) => JSON.parse(En(e.content, ii(t, e.pubkey)));
+var Dc = 2 * 24 * 60 * 60, ni = () => Math.round(Date.now() / 1e3), ri = () => Math.round(ni() - Math.random() * Dc), ii = (e, t) => gn(e, t), si = (e, t, n) => bn(JSON.stringify(e), ii(t, n)), qn = (e, t) => JSON.parse(vn(e.content, ii(t, e.pubkey)));
 function oi(e, t) {
   const n = {
     created_at: ni(),
@@ -3447,7 +3447,7 @@ function oi(e, t) {
     ...e,
     pubkey: le(t)
   };
-  return n.id = qe(n), n;
+  return n.id = He(n), n;
 }
 function ai(e, t, n) {
   return X(
@@ -3464,7 +3464,7 @@ function ci(e, t) {
   const n = _e();
   return X(
     {
-      kind: Pr,
+      kind: Mr,
       content: si(e, n, t),
       created_at: ri(),
       tags: [["p", t]]
@@ -3472,21 +3472,21 @@ function ci(e, t) {
     n
   );
 }
-function Wt(e, t, n) {
+function Vt(e, t, n) {
   const r = oi(e, t), i = ai(r, t, n);
   return ci(i, n);
 }
 function jc(e, t, n) {
   if (!n || n.length === 0)
     throw new Error("At least one recipient is required.");
-  const r = le(t), i = [Wt(e, t, r)];
+  const r = le(t), i = [Vt(e, t, r)];
   return n.forEach((s) => {
-    i.push(Wt(e, t, s));
+    i.push(Vt(e, t, s));
   }), i;
 }
 function ui(e, t) {
-  const n = Dn(e, t);
-  return Dn(n, t);
+  const n = qn(e, t);
+  return qn(n, t);
 }
 function zc(e, t) {
   let n = [];
@@ -3497,20 +3497,20 @@ function zc(e, t) {
 var Vc = {};
 D(Vc, {
   getToken: () => Wc,
-  hashPayload: () => xn,
+  hashPayload: () => En,
   unpackEventFromToken: () => fi,
   validateEvent: () => wi,
   validateEventKind: () => di,
-  validateEventMethodTag: () => yi,
+  validateEventMethodTag: () => pi,
   validateEventPayloadTag: () => gi,
   validateEventTimestamp: () => hi,
-  validateEventUrlTag: () => pi,
+  validateEventUrlTag: () => yi,
   validateToken: () => Zc
 });
 var li = "Nostr ";
 async function Wc(e, t, n, r = !1, i) {
   const s = {
-    kind: un,
+    kind: cn,
     tags: [
       ["u", e],
       ["method", t]
@@ -3518,7 +3518,7 @@ async function Wc(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && s.tags.push(["payload", xn(i)]);
+  i && s.tags.push(["payload", En(i)]);
   const o = await n(s);
   return (r ? li : "") + he.encode(ne.encode(JSON.stringify(o)));
 }
@@ -3543,109 +3543,142 @@ function hi(e) {
   return e.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - e.created_at < 60 : !1;
 }
 function di(e) {
-  return e.kind === un;
+  return e.kind === cn;
 }
-function pi(e, t) {
+function yi(e, t) {
   const n = e.tags.find((r) => r[0] === "u");
   return n ? n.length > 0 && n[1] === t : !1;
 }
-function yi(e, t) {
+function pi(e, t) {
   const n = e.tags.find((r) => r[0] === "method");
   return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
 }
-function xn(e) {
+function En(e) {
   const t = fe(ne.encode(JSON.stringify(e)));
-  return M(t);
+  return P(t);
 }
 function gi(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
   if (!n)
     return !1;
-  const r = xn(t);
+  const r = En(t);
   return n.length > 0 && n[1] === r;
 }
 async function wi(e, t, n, r) {
-  if (!yt(e))
+  if (!pt(e))
     throw new Error("Invalid nostr event, signature invalid");
   if (!di(e))
     throw new Error("Invalid nostr event, kind invalid");
   if (!hi(e))
     throw new Error("Invalid nostr event, created_at timestamp invalid");
-  if (!pi(e, t))
+  if (!yi(e, t))
     throw new Error("Invalid nostr event, url tag invalid");
-  if (!yi(e, n))
+  if (!pi(e, n))
     throw new Error("Invalid nostr event, method tag invalid");
   if (r && typeof r == "object" && Object.keys(r).length > 0 && !gi(e, r))
     throw new Error("Invalid nostr event, payload tag does not match request body hash");
   return !0;
 }
-const Be = 30078, jn = 30078, Gc = 14, ru = 100;
-function iu(e) {
+const Ge = 30078, Dn = 30078, jn = 1059, Gc = 14, au = 100, Fc = 1;
+function cu(e) {
   return JSON.stringify({
-    rootKey: M(e.rootKey),
+    version: Fc,
+    rootKey: P(e.rootKey),
     theirCurrentNostrPublicKey: e.theirCurrentNostrPublicKey,
     theirNextNostrPublicKey: e.theirNextNostrPublicKey,
     ourCurrentNostrKey: e.ourCurrentNostrKey ? {
       publicKey: e.ourCurrentNostrKey.publicKey,
-      privateKey: M(e.ourCurrentNostrKey.privateKey)
+      privateKey: P(e.ourCurrentNostrKey.privateKey)
     } : void 0,
     ourNextNostrKey: {
       publicKey: e.ourNextNostrKey.publicKey,
-      privateKey: M(e.ourNextNostrKey.privateKey)
+      privateKey: P(e.ourNextNostrKey.privateKey)
     },
-    receivingChainKey: e.receivingChainKey ? M(e.receivingChainKey) : void 0,
-    sendingChainKey: e.sendingChainKey ? M(e.sendingChainKey) : void 0,
+    receivingChainKey: e.receivingChainKey ? P(e.receivingChainKey) : void 0,
+    sendingChainKey: e.sendingChainKey ? P(e.sendingChainKey) : void 0,
     sendingChainMessageNumber: e.sendingChainMessageNumber,
     receivingChainMessageNumber: e.receivingChainMessageNumber,
     previousSendingChainMessageCount: e.previousSendingChainMessageCount,
-    skippedMessageKeys: Object.fromEntries(
-      Object.entries(e.skippedMessageKeys).map(([t, n]) => [
-        t,
-        M(n)
-      ])
-    ),
-    skippedHeaderKeys: Object.fromEntries(
-      Object.entries(e.skippedHeaderKeys).map(([t, n]) => [
+    skippedKeys: Object.fromEntries(
+      Object.entries(e.skippedKeys).map(([t, n]) => [
         t,
-        n.map((r) => M(r))
+        {
+          headerKeys: n.headerKeys.map((r) => P(r)),
+          messageKeys: Object.fromEntries(
+            Object.entries(n.messageKeys).map(([r, i]) => [
+              r,
+              P(i)
+            ])
+          )
+        }
       ])
     )
   });
 }
-function su(e) {
+function uu(e) {
   const t = JSON.parse(e);
+  if (!t.version) {
+    const n = {};
+    return t.skippedMessageKeys && Object.entries(t.skippedMessageKeys).forEach(([r, i]) => {
+      var s;
+      n[r] = {
+        headerKeys: ((s = t.skippedHeaderKeys) == null ? void 0 : s[r]) || [],
+        messageKeys: i
+      };
+    }), {
+      rootKey: z(t.rootKey),
+      theirCurrentNostrPublicKey: t.theirCurrentNostrPublicKey,
+      theirNextNostrPublicKey: t.theirNextNostrPublicKey,
+      ourCurrentNostrKey: t.ourCurrentNostrKey ? {
+        publicKey: t.ourCurrentNostrKey.publicKey,
+        privateKey: z(t.ourCurrentNostrKey.privateKey)
+      } : void 0,
+      ourNextNostrKey: {
+        publicKey: t.ourNextNostrKey.publicKey,
+        privateKey: z(t.ourNextNostrKey.privateKey)
+      },
+      receivingChainKey: t.receivingChainKey ? z(t.receivingChainKey) : void 0,
+      sendingChainKey: t.sendingChainKey ? z(t.sendingChainKey) : void 0,
+      sendingChainMessageNumber: t.sendingChainMessageNumber,
+      receivingChainMessageNumber: t.receivingChainMessageNumber,
+      previousSendingChainMessageCount: t.previousSendingChainMessageCount,
+      skippedKeys: n
+    };
+  }
   return {
-    rootKey: G(t.rootKey),
+    rootKey: z(t.rootKey),
     theirCurrentNostrPublicKey: t.theirCurrentNostrPublicKey,
     theirNextNostrPublicKey: t.theirNextNostrPublicKey,
     ourCurrentNostrKey: t.ourCurrentNostrKey ? {
       publicKey: t.ourCurrentNostrKey.publicKey,
-      privateKey: G(t.ourCurrentNostrKey.privateKey)
+      privateKey: z(t.ourCurrentNostrKey.privateKey)
     } : void 0,
     ourNextNostrKey: {
       publicKey: t.ourNextNostrKey.publicKey,
-      privateKey: G(t.ourNextNostrKey.privateKey)
+      privateKey: z(t.ourNextNostrKey.privateKey)
     },
-    receivingChainKey: t.receivingChainKey ? G(t.receivingChainKey) : void 0,
-    sendingChainKey: t.sendingChainKey ? G(t.sendingChainKey) : void 0,
+    receivingChainKey: t.receivingChainKey ? z(t.receivingChainKey) : void 0,
+    sendingChainKey: t.sendingChainKey ? z(t.sendingChainKey) : void 0,
     sendingChainMessageNumber: t.sendingChainMessageNumber,
     receivingChainMessageNumber: t.receivingChainMessageNumber,
     previousSendingChainMessageCount: t.previousSendingChainMessageCount,
-    skippedMessageKeys: Object.fromEntries(
-      Object.entries(t.skippedMessageKeys).map(([n, r]) => [
-        n,
-        G(r)
-      ])
-    ),
-    skippedHeaderKeys: Object.fromEntries(
-      Object.entries(t.skippedHeaderKeys || {}).map(([n, r]) => [
+    skippedKeys: Object.fromEntries(
+      Object.entries(t.skippedKeys || {}).map(([n, r]) => [
         n,
-        r.map((i) => G(i))
+        {
+          headerKeys: r.headerKeys.map((i) => z(i)),
+          messageKeys: Object.fromEntries(
+            Object.entries(r.messageKeys).map(([i, s]) => [
+              i,
+              z(s)
+            ])
+          )
+        }
       ])
     )
   };
 }
-async function* ou(e) {
+async function* lu(e) {
   const t = [];
   let n = null;
   const r = e.onEvent((i) => {
@@ -3660,21 +3693,21 @@ async function* ou(e) {
     r();
   }
 }
-function Me(e, t = new Uint8Array(32), n = 1) {
-  const r = sn(fe, e, t), i = [];
+function Oe(e, t = new Uint8Array(32), n = 1) {
+  const r = rn(fe, e, t), i = [];
   for (let s = 1; s <= n; s++)
     i.push(Cr(fe, r, new Uint8Array([s]), 32));
   return i;
 }
-function Lt(e, t) {
+function fu(e, t) {
   return `${e}:${t}`;
 }
-function au(e) {
+function hu(e) {
   var n;
   const t = (n = e.tags) == null ? void 0 : n.find((r) => r[0] === "ms");
   return t ? parseInt(t[1]) : e.created_at * 1e3;
 }
-const Fc = 1e3, Jc = "0000000000000000000000000000000000000000000000000000000000000000";
+const Jc = 1e3, Yc = "0000000000000000000000000000000000000000000000000000000000000000";
 class st {
   // 1. CHANNEL PUBLIC INTERFACE
   constructor(t, n) {
@@ -3696,10 +3729,10 @@ class st {
    * @returns A new Session instance
    */
   static init(t, n, r, i, s, o) {
-    const c = _e(), [a, l] = Me(s, q.getConversationKey(c, n), 2);
+    const c = _e(), [a, l] = Oe(s, q.getConversationKey(c, n), 2);
     let f, u;
     i ? (f = { publicKey: le(r), privateKey: r }, u = { publicKey: le(c), privateKey: c }) : u = { publicKey: le(r), privateKey: r };
-    const g = {
+    const y = {
       rootKey: i ? a : s,
       theirNextNostrPublicKey: n,
       ourCurrentNostrKey: f,
@@ -3709,9 +3742,8 @@ class st {
       sendingChainMessageNumber: 0,
       receivingChainMessageNumber: 0,
       previousSendingChainMessageCount: 0,
-      skippedMessageKeys: {},
-      skippedHeaderKeys: {}
-    }, b = new st(t, g);
+      skippedKeys: {}
+    }, b = new st(t, y);
     return o && (b.name = o), b;
   }
   /**
@@ -3742,18 +3774,18 @@ class st {
     const n = Date.now(), r = {
       ...t,
       content: t.content || "",
-      kind: t.kind || Be,
+      kind: t.kind || Ge,
       created_at: t.created_at || Math.floor(n / 1e3),
       tags: t.tags || [],
-      pubkey: t.pubkey || Jc
+      pubkey: t.pubkey || Yc
     };
-    r.tags.some(([l]) => l === "ms") || r.tags.push(["ms", String(n)]), r.id = qe(r);
+    r.tags.some(([l]) => l === "ms") || r.tags.push(["ms", String(n)]), r.id = He(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: X({
       content: s,
-      kind: Be,
+      kind: Ge,
       tags: [["header", c]],
-      created_at: Math.floor(Date.now() / 1e3)
+      created_at: Math.floor(n / 1e3)
     }, this.state.ourCurrentNostrKey.privateKey), innerEvent: r };
   }
   /**
@@ -3774,7 +3806,7 @@ class st {
   }
   // 2. RATCHET FUNCTIONS
   ratchetEncrypt(t) {
-    const [n, r] = Me(this.state.sendingChainKey, new Uint8Array([1]), 2);
+    const [n, r] = Oe(this.state.sendingChainKey, new Uint8Array([1]), 2);
     return this.state.sendingChainKey = n, [{
       number: this.state.sendingChainMessageNumber++,
       nextPublicKey: this.state.ourNextNostrKey.publicKey,
@@ -3785,59 +3817,57 @@ class st {
     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);
+    const [s, o] = Oe(this.state.receivingChainKey, new Uint8Array([1]), 2);
     this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++;
     try {
       return q.decrypt(n, o);
     } catch (c) {
       throw console.error(this.name, "Decryption failed:", c, {
-        messageKey: M(o).slice(0, 4),
-        receivingChainKey: M(this.state.receivingChainKey).slice(0, 4),
-        sendingChainKey: this.state.sendingChainKey && M(this.state.sendingChainKey).slice(0, 4),
-        rootKey: M(this.state.rootKey).slice(0, 4)
+        messageKey: P(o).slice(0, 4),
+        receivingChainKey: P(this.state.receivingChainKey).slice(0, 4),
+        sendingChainKey: this.state.sendingChainKey && P(this.state.sendingChainKey).slice(0, 4),
+        rootKey: P(this.state.rootKey).slice(0, 4)
       }), c;
     }
   }
   ratchetStep(t) {
     this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.theirNextNostrPublicKey = t;
-    const n = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [r, i] = Me(this.state.rootKey, n, 2);
+    const n = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [r, i] = Oe(this.state.rootKey, n, 2);
     this.state.receivingChainKey = i, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
     const s = _e();
     this.state.ourNextNostrKey = {
       publicKey: le(s),
       privateKey: s
     };
-    const o = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [c, a] = Me(r, o, 2);
+    const o = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [c, a] = Oe(r, o, 2);
     this.state.rootKey = c, this.state.sendingChainKey = a;
   }
   // 3. MESSAGE KEY FUNCTIONS
   skipMessageKeys(t, n) {
-    if (this.state.receivingChainMessageNumber + Fc < t)
+    if (this.state.receivingChainMessageNumber + Jc < t)
       throw new Error("Too many skipped messages");
-    for (; this.state.receivingChainMessageNumber < t; ) {
-      const [r, i] = Me(this.state.receivingChainKey, new Uint8Array([1]), 2);
-      this.state.receivingChainKey = r;
-      const s = Lt(n, this.state.receivingChainMessageNumber);
-      if (this.state.skippedMessageKeys[s] = i, !this.state.skippedHeaderKeys[n]) {
-        const o = [];
-        if (this.state.ourCurrentNostrKey) {
-          const a = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
-          o.push(a);
-        }
-        const c = q.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
-        o.push(c), this.state.skippedHeaderKeys[n] = o;
+    if (!this.state.skippedKeys[n]) {
+      if (this.state.skippedKeys[n] = {
+        headerKeys: [],
+        messageKeys: {}
+      }, this.state.ourCurrentNostrKey) {
+        const i = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
+        this.state.skippedKeys[n].headerKeys.push(i);
       }
-      this.state.receivingChainMessageNumber++;
+      const r = q.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
+      this.state.skippedKeys[n].headerKeys.push(r);
+    }
+    for (; this.state.receivingChainMessageNumber < t; ) {
+      const [r, i] = Oe(this.state.receivingChainKey, new Uint8Array([1]), 2);
+      this.state.receivingChainKey = r, this.state.skippedKeys[n].messageKeys[this.state.receivingChainMessageNumber] = i, this.state.receivingChainMessageNumber++;
     }
   }
   trySkippedMessageKeys(t, n, r) {
-    var s;
-    const i = Lt(r, t.number);
-    if (i in this.state.skippedMessageKeys) {
-      const o = this.state.skippedMessageKeys[i];
-      return delete this.state.skippedMessageKeys[i], Object.keys(this.state.skippedMessageKeys).some((a) => a.startsWith(`${r}:`)) || (delete this.state.skippedHeaderKeys[r], (s = this.nostrUnsubscribe) == null || s.call(this), this.nostrUnsubscribe = void 0), q.decrypt(n, o);
-    }
-    return null;
+    var o;
+    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], (o = this.nostrUnsubscribe) == null || o.call(this), this.nostrUnsubscribe = void 0), q.decrypt(n, s)) : null;
   }
   // 4. NOSTR EVENT HANDLING
   decryptHeader(t) {
@@ -3854,9 +3884,9 @@ class st {
       return [JSON.parse(q.decrypt(n, r)), !0, !1];
     } catch {
     }
-    const i = this.state.skippedHeaderKeys[t.pubkey];
-    if (i)
-      for (const s of i)
+    const i = this.state.skippedKeys[t.pubkey];
+    if (i != null && i.headerKeys)
+      for (const s of i.headerKeys)
         try {
           return [JSON.parse(q.decrypt(n, s)), !1, !0];
         } catch {
@@ -3866,19 +3896,16 @@ class st {
   handleNostrEvent(t) {
     var c;
     const [n, r, i] = this.decryptHeader(t);
-    if (!i)
-      this.state.theirNextNostrPublicKey !== n.nextPublicKey && (this.state.theirCurrentNostrPublicKey = this.state.theirNextNostrPublicKey, this.state.theirNextNostrPublicKey = n.nextPublicKey, (c = this.nostrUnsubscribe) == null || c.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
-        { authors: [this.state.theirNextNostrPublicKey], kinds: [Be] },
-        (a) => this.handleNostrEvent(a)
-      )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey));
-    else if (!(Lt(t.pubkey, n.number) in this.state.skippedMessageKeys))
-      return;
+    i || (this.state.theirNextNostrPublicKey !== n.nextPublicKey && (this.state.theirCurrentNostrPublicKey = this.state.theirNextNostrPublicKey, this.state.theirNextNostrPublicKey = n.nextPublicKey, (c = this.nostrUnsubscribe) == null || c.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
+      { authors: [this.state.theirNextNostrPublicKey], kinds: [Ge] },
+      (a) => this.handleNostrEvent(a)
+    )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey)));
     const s = this.ratchetDecrypt(n, t.content, t.pubkey), o = JSON.parse(s);
     if (!dt(o)) {
       console.error("Invalid event received", o);
       return;
     }
-    if (o.id !== qe(o)) {
+    if (o.id !== He(o)) {
       console.error("Event hash does not match", o);
       return;
     }
@@ -3887,12 +3914,12 @@ class st {
   subscribeToNostrEvents() {
     if (this.nostrNextUnsubscribe) return;
     this.nostrNextUnsubscribe = this.nostrSubscribe(
-      { authors: [this.state.theirNextNostrPublicKey], kinds: [Be] },
+      { authors: [this.state.theirNextNostrPublicKey], kinds: [Ge] },
       (n) => this.handleNostrEvent(n)
     );
-    const t = Object.keys(this.state.skippedHeaderKeys);
+    const t = Object.keys(this.state.skippedKeys);
     this.state.theirCurrentNostrPublicKey && !t.includes(this.state.theirCurrentNostrPublicKey) && t.push(this.state.theirCurrentNostrPublicKey), this.nostrUnsubscribe = this.nostrSubscribe(
-      { authors: t, kinds: [Be] },
+      { authors: t, kinds: [Ge] },
       (n) => this.handleNostrEvent(n)
     );
   }
@@ -3900,9 +3927,10 @@ class st {
 new TextDecoder("utf-8");
 new TextEncoder();
 function Qe(e, t) {
-  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return sn(fe, n, "nip44-v2");
+  const n = ke.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return rn(fe, n, "nip44-v2");
 }
+const Xc = 2 * 24 * 60 * 60, Qc = () => Math.round(Date.now() / 1e3), eu = () => Math.round(Qc() - Math.random() * Xc);
 class Pe {
   constructor(t, n, r, i, s, o, c = []) {
     this.inviterEphemeralPublicKey = t, this.sharedSecret = n, this.inviter = r, this.inviterEphemeralPrivateKey = i, this.label = s, this.maxUses = o, this.usedBy = c;
@@ -3910,7 +3938,7 @@ class Pe {
   static createNew(t, n, r) {
     if (!t)
       throw new Error("Inviter public key is required");
-    const i = _e(), s = le(i), o = M(_e());
+    const i = _e(), s = le(i), o = P(_e());
     return new Pe(
       s,
       o,
@@ -3956,7 +3984,7 @@ class Pe {
     var o, c;
     if (!t.sig)
       throw new Error("Event is not signed");
-    if (!yt(t))
+    if (!pt(t))
       throw new Error("Event signature is invalid");
     const { tags: n } = t;
     if (!n)
@@ -3972,7 +4000,7 @@ class Pe {
   }
   static fromUser(t, n, r) {
     const i = {
-      kinds: [jn],
+      kinds: [Dn],
       authors: [t],
       limit: 1,
       "#d": ["double-ratchet/invites/public"]
@@ -4017,7 +4045,7 @@ class Pe {
   }
   getEvent() {
     return {
-      kind: jn,
+      kind: Dn,
       pubkey: this.inviter,
       content: "",
       created_at: Math.floor(Date.now() / 1e3),
@@ -4045,25 +4073,24 @@ class Pe {
        * so the inviter can create the session on their side.
        */
   async accept(t, n, r) {
-    const i = _e(), s = le(i), o = this.inviter || this.inviterEphemeralPublicKey, c = G(this.sharedSecret), a = st.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), l = _e(), f = le(l), g = await (typeof r == "function" ? r : (h, d) => Promise.resolve(q.encrypt(h, Qe(r, d))))(s, o), b = {
+    const i = _e(), s = le(i), o = this.inviter || this.inviterEphemeralPublicKey, c = z(this.sharedSecret), a = st.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), f = await (typeof r == "function" ? r : (h, d) => Promise.resolve(q.encrypt(h, Qe(r, d))))(s, o), u = {
       pubkey: n,
-      tags: [["sharedSecret", this.sharedSecret]],
-      content: await q.encrypt(g, c),
+      content: await q.encrypt(f, c),
       created_at: Math.floor(Date.now() / 1e3)
-    }, p = {
-      kind: Be,
-      pubkey: f,
-      content: q.encrypt(JSON.stringify(b), Qe(l, this.inviterEphemeralPublicKey)),
-      created_at: Math.floor(Date.now() / 1e3),
+    }, y = _e(), b = le(y), p = {
+      kind: jn,
+      pubkey: b,
+      content: q.encrypt(JSON.stringify(u), Qe(y, this.inviterEphemeralPublicKey)),
+      created_at: eu(),
       tags: [["p", this.inviterEphemeralPublicKey]]
     };
-    return { session: a, event: X(p, l) };
+    return { session: a, event: X(p, y) };
   }
   listen(t, n, r) {
     if (!this.inviterEphemeralPrivateKey)
       throw new Error("Inviter session key is not available");
     const i = {
-      kinds: [Be],
+      kinds: [jn],
       "#p": [this.inviterEphemeralPublicKey]
     };
     return n(i, async (s) => {
@@ -4072,14 +4099,9 @@ class Pe {
           console.error("Invite has reached maximum number of uses");
           return;
         }
-        const o = await q.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o);
-        if (!c.tags || !c.tags.some(([h, d]) => h === "sharedSecret" && d === this.sharedSecret)) {
-          console.error("Invalid secret from event", s);
-          return;
-        }
-        const a = G(this.sharedSecret), l = c.pubkey;
+        const o = await q.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o), a = z(this.sharedSecret), l = c.pubkey;
         this.usedBy.push(l);
-        const f = await q.decrypt(c.content, a), g = await (typeof t == "function" ? t : (h, d) => Promise.resolve(q.decrypt(h, Qe(t, d))))(f, l), b = s.id, p = st.init(n, g, this.inviterEphemeralPrivateKey, !1, a, b);
+        const f = await q.decrypt(c.content, a), y = await (typeof t == "function" ? t : (h, d) => Promise.resolve(q.decrypt(h, Qe(t, d))))(f, l), b = s.id, p = st.init(n, y, this.inviterEphemeralPrivateKey, !1, a, b);
         r(p, l);
       } catch (o) {
         console.error("Error processing invite message:", o, "event", s);
@@ -4089,15 +4111,16 @@ class Pe {
 }
 export {
   Gc as CHAT_MESSAGE_KIND,
-  jn as INVITE_EVENT_KIND,
+  Dn as INVITE_EVENT_KIND,
+  jn as INVITE_RESPONSE_KIND,
   Pe as Invite,
-  ru as MAX_SKIP,
-  Be as MESSAGE_EVENT_KIND,
+  au as MAX_SKIP,
+  Ge as MESSAGE_EVENT_KIND,
   st as Session,
-  ou as createEventStream,
-  su as deserializeSessionState,
-  au as getMillisecondTimestamp,
-  Me as kdf,
-  iu as serializeSessionState,
-  Lt as skippedMessageIndexKey
+  lu as createEventStream,
+  uu as deserializeSessionState,
+  hu as getMillisecondTimestamp,
+  Oe as kdf,
+  cu as serializeSessionState,
+  fu as skippedMessageIndexKey
 };