nostr-double-ratchet 0.0.15 → 0.0.17

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

@@ -28,9 +28,9 @@ function mi(e, t) {
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const mt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const xt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Vn = (e) => e instanceof Uint8Array, xt = (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, 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;
 if (!xi)
   throw new Error("Non little-endian hardware is not supported");
 function Si(e) {
@@ -38,7 +38,7 @@ function Si(e) {
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Wt(e) {
+function Zt(e) {
   if (typeof e == "string" && (e = Si(e)), !Vn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
@@ -59,12 +59,12 @@ let Wn = class {
   }
 };
 function Ai(e) {
-  const t = (r) => e().update(Wt(r)).digest(), n = e();
+  const t = (r) => e().update(Zt(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function Zn(e = 32) {
-  if (mt && typeof mt.getRandomValues == "function")
-    return mt.getRandomValues(new Uint8Array(e));
+  if (xt && typeof xt.getRandomValues == "function")
+    return xt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 function Ki(e, t, n, r) {
@@ -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 = xt(this.buffer);
+    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = St(this.buffer);
   }
   update(t) {
     et(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Wt(t);
+    t = Zt(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 = xt(t);
+        const a = St(t);
         for (; i <= s - o; o += i)
           this.process(a, o);
         continue;
@@ -102,7 +102,7 @@ let Ci = class extends Wn {
     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 = xt(t), a = this.outputLen;
+    const c = St(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = a / 4, f = this.get();
@@ -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 Ui = class extends Ci {
+let Ii = 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;
   }
@@ -231,10 +231,10 @@ let Ui = class extends Ci {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const Lt = /* @__PURE__ */ Ai(() => new Ui());
+const $t = /* @__PURE__ */ Ai(() => new Ii());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Gn = BigInt(0), ot = BigInt(1), Ii = BigInt(2), at = (e) => e instanceof Uint8Array, Li = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function qe(e) {
+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) {
   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 Zt(e) {
+function Gt(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   return BigInt(e === "" ? "0" : `0x${e}`);
 }
-function De(e) {
+function je(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   const t = e.length;
@@ -267,27 +267,27 @@ function De(e) {
   return n;
 }
 function F(e) {
-  return Zt(qe(e));
+  return Gt(De(e));
 }
-function Gt(e) {
+function Ft(e) {
   if (!at(e))
     throw new Error("Uint8Array expected");
-  return Zt(qe(Uint8Array.from(e).reverse()));
+  return Gt(De(Uint8Array.from(e).reverse()));
 }
 function Ne(e, t) {
-  return De(e.toString(16).padStart(t * 2, "0"));
+  return je(e.toString(16).padStart(t * 2, "0"));
 }
-function Ft(e, t) {
+function Jt(e, t) {
   return Ne(e, t).reverse();
 }
 function $i(e) {
-  return De(Fn(e));
+  return je(Fn(e));
 }
 function W(e, t, n) {
   let r;
   if (typeof t == "string")
     try {
-      r = De(t);
+      r = je(t);
     } catch (s) {
       throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${s}`);
     }
@@ -300,7 +300,7 @@ function W(e, t, n) {
     throw new Error(`${e} expected ${n} bytes, got ${i}`);
   return r;
 }
-function Ue(...e) {
+function Ie(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -331,7 +331,7 @@ function Oi(e) {
 function Mi(e, t) {
   return e >> BigInt(t) & ot;
 }
-const Pi = (e, t, n) => e | (n ? ot : Gn) << BigInt(t), Jt = (e) => (Ii << BigInt(e - 1)) - ot, St = (e) => new Uint8Array(e), Cn = (e) => Uint8Array.from(e);
+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);
 function Jn(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -339,10 +339,10 @@ function Jn(e, t, n) {
     throw new Error("qByteLen must be a number");
   if (typeof n != "function")
     throw new Error("hmacFn must be a function");
-  let r = St(e), i = St(e), s = 0;
+  let r = Nt(e), i = Nt(e), s = 0;
   const o = () => {
     r.fill(1), i.fill(0), s = 0;
-  }, c = (...u) => n(i, r, ...u), a = (u = St()) => {
+  }, 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());
   }, l = () => {
     if (s++ >= 1e3)
@@ -354,7 +354,7 @@ function Jn(e, t, n) {
       const b = r.slice();
       g.push(b), u += r.length;
     }
-    return Ue(...g);
+    return Ie(...g);
   };
   return (u, g) => {
     o(), a(u);
@@ -394,26 +394,26 @@ const qi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   bitGet: Mi,
   bitLen: Oi,
-  bitMask: Jt,
+  bitMask: Yt,
   bitSet: Pi,
-  bytesToHex: qe,
+  bytesToHex: De,
   bytesToNumberBE: F,
-  bytesToNumberLE: Gt,
-  concatBytes: Ue,
+  bytesToNumberLE: Ft,
+  concatBytes: Ie,
   createHmacDrbg: Jn,
   ensureBytes: W,
   equalBytes: Ti,
-  hexToBytes: De,
-  hexToNumber: Zt,
+  hexToBytes: je,
+  hexToNumber: Gt,
   numberToBytesBE: Ne,
-  numberToBytesLE: Ft,
+  numberToBytesLE: Jt,
   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), $t = BigInt(4), Bn = BigInt(5), kn = BigInt(8);
+const z = BigInt(0), j = BigInt(1), Ce = BigInt(2), Di = BigInt(3), Tt = BigInt(4), Bn = BigInt(5), kn = BigInt(8);
 BigInt(9);
 BigInt(16);
 function V(e, t) {
@@ -436,7 +436,7 @@ function J(e, t, n) {
     r *= r, r %= n;
   return r;
 }
-function Tt(e, t) {
+function Rt(e, t) {
   if (e === z || t <= z)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
   let n = V(e, t), r = t, i = z, s = j;
@@ -456,7 +456,7 @@ function zi(e) {
   for (i = Ce; i < e && ji(i, t, e) !== e - j; i++)
     ;
   if (r === 1) {
-    const o = (e + j) / $t;
+    const o = (e + j) / Tt;
     return function(a, l) {
       const f = a.pow(l, o);
       if (!a.eql(a.sqr(f), l))
@@ -482,8 +482,8 @@ function zi(e) {
   };
 }
 function Vi(e) {
-  if (e % $t === Di) {
-    const t = (e + j) / $t;
+  if (e % Tt === Di) {
+    const t = (e + j) / Tt;
     return function(r, i) {
       const s = r.pow(i, t);
       if (!r.eql(r.sqr(s), i))
@@ -560,7 +560,7 @@ function Ji(e, t, n = !1, r = {}) {
     ORDER: e,
     BITS: i,
     BYTES: s,
-    MASK: Jt(i),
+    MASK: Yt(i),
     ZERO: z,
     ONE: j,
     create: (a) => V(a, e),
@@ -578,23 +578,23 @@ function Ji(e, t, n = !1, r = {}) {
     sub: (a, l) => V(a - l, e),
     mul: (a, l) => V(a * l, e),
     pow: (a, l) => Gi(c, a, l),
-    div: (a, l) => V(a * Tt(l, e), e),
+    div: (a, l) => V(a * Rt(l, e), e),
     // Same as above, but doesn't normalize
     sqrN: (a) => a * a,
     addN: (a, l) => a + l,
     subN: (a, l) => a - l,
     mulN: (a, l) => a * l,
-    inv: (a) => Tt(a, e),
+    inv: (a) => Rt(a, e),
     sqrt: r.sqrt || ((a) => o(c, a)),
     invertBatch: (a) => 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 ? Ft(a, s) : Ne(a, s),
+    toBytes: (a) => n ? Jt(a, s) : Ne(a, s),
     fromBytes: (a) => {
       if (a.length !== s)
         throw new Error(`Fp.fromBytes: expected ${s}, got ${a.length}`);
-      return n ? Gt(a) : F(a);
+      return n ? Ft(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) : Gt(e), c = V(o, t - j) + j;
-  return n ? Ft(c, i) : Ne(c, i);
+  const o = n ? F(e) : Ft(e), c = V(o, t - j) + j;
+  return n ? Jt(c, i) : Ne(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Xi = BigInt(0), Nt = BigInt(1);
+const Xi = BigInt(0), At = 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 & Nt && (o = o.add(c)), c = c.double(), s >>= Nt;
+        s & At && (o = o.add(c)), c = c.double(), s >>= At;
       return o;
     },
     /**
@@ -670,9 +670,9 @@ function Qi(e, t) {
       for (let p = 0; p < c; p++) {
         const h = p * a;
         let d = Number(o & u);
-        o >>= b, d > a && (d -= g, o += Nt);
-        const y = h, m = h + Math.abs(d) - 1, A = p % 2 !== 0, U = d < 0;
-        d === 0 ? f = f.add(n(A, s[y])) : l = l.add(n(U, s[m]));
+        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]));
       }
       return { p: l, f };
     },
@@ -770,7 +770,7 @@ BigInt(4);
 function rs(e) {
   const t = es(e), { Fp: n } = t, r = t.toBytes || ((p, h, d) => {
     const y = h.toAffine();
-    return Ue(Uint8Array.from([4]), n.toBytes(y.x), n.toBytes(y.y));
+    return Ie(Uint8Array.from([4]), n.toBytes(y.x), n.toBytes(y.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 };
@@ -791,7 +791,7 @@ function rs(e) {
   function a(p) {
     const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: y, n: m } = t;
     if (h && typeof p != "bigint") {
-      if (p instanceof Uint8Array && (p = qe(p)), typeof p != "string" || !h.includes(p.length))
+      if (p instanceof Uint8Array && (p = De(p)), typeof p != "string" || !h.includes(p.length))
         throw new Error("Invalid key");
       p = p.padStart(d * 2, "0");
     }
@@ -887,7 +887,7 @@ function rs(e) {
      */
     equals(h) {
       f(h);
-      const { px: d, py: y, pz: m } = this, { px: A, py: U, pz: B } = h, E = n.eql(n.mul(d, B), n.mul(A, m)), x = n.eql(n.mul(y, B), n.mul(U, m));
+      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;
     }
     /**
@@ -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: U } = this;
-      let B = n.ZERO, E = n.ZERO, x = n.ZERO, S = n.mul(m, m), P = n.mul(A, A), _ = n.mul(U, U), K = n.mul(m, A);
-      return K = n.add(K, K), x = n.mul(m, U), 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, U), _ = 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, 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);
     }
     // 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: U, pz: B } = 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, U), R = n.mul(m, B), H = n.add(d, y), w = n.add(A, U);
+      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(U, 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);
+      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);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -945,10 +945,10 @@ function rs(e) {
       const { endo: y } = t;
       if (!y)
         return b.unsafeLadder(this, h);
-      let { k1neg: m, k1: A, k2neg: U, k2: B } = y.splitScalar(h), E = d, x = d, S = this;
+      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()), U && (x = x.negate()), x = new u(n.mul(x.px, y.beta), x.py, x.pz), E.add(x);
+      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);
     }
     /**
      * Constant time multiplication.
@@ -964,12 +964,12 @@ function rs(e) {
       let d = h, y, m;
       const { endo: A } = t;
       if (A) {
-        const { k1neg: U, k1: B, k2neg: E, k2: x } = A.splitScalar(d);
+        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(U, S), _ = b.constTimeNegate(E, _), _ = new u(n.mul(_.px, A.beta), _.py, _.pz), y = S.add(_), m = P.add(K);
+        S = b.constTimeNegate(I, S), _ = b.constTimeNegate(E, _), _ = new u(n.mul(_.px, A.beta), _.py, _.pz), y = S.add(_), m = P.add(K);
       } else {
-        const { p: U, f: B } = this.wNAF(d);
-        y = U, m = B;
+        const { p: I, f: B } = this.wNAF(d);
+        y = I, m = B;
       }
       return u.normalizeZ([y, m])[0];
     }
@@ -980,8 +980,8 @@ function rs(e) {
      * @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), U = A(this, d).add(A(h, y));
-      return U.is0() ? void 0 : U;
+      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;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
@@ -989,12 +989,12 @@ function rs(e) {
     toAffine(h) {
       const { px: d, py: y, pz: m } = this, A = this.is0();
       h == null && (h = A ? n.ONE : n.inv(m));
-      const U = n.mul(d, h), B = n.mul(y, h), E = n.mul(m, h);
+      const I = n.mul(d, h), B = n.mul(y, h), E = n.mul(m, h);
       if (A)
         return { x: n.ZERO, y: n.ZERO };
       if (!n.eql(E, n.ONE))
         throw new Error("invZ was invalid");
-      return { x: U, y: B };
+      return { x: I, y: B };
     }
     isTorsionFree() {
       const { h, isTorsionFree: d } = t;
@@ -1012,7 +1012,7 @@ function rs(e) {
       return this.assertValidity(), r(u, this, h);
     }
     toHex(h = !0) {
-      return qe(this.toRawBytes(h));
+      return De(this.toRawBytes(h));
     }
   }
   u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
@@ -1046,13 +1046,13 @@ function ss(e) {
     return V(w, r);
   }
   function a(w) {
-    return Tt(w, r);
+    return Rt(w, r);
   }
   const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: g } = rs({
     ...t,
     toBytes(w, v, N) {
-      const k = v.toAffine(), C = n.toBytes(k.x), I = Ue;
-      return N ? I(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : I(Uint8Array.from([4]), C, n.toBytes(k.y));
+      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));
     },
     fromBytes(w) {
       const v = w.length, N = w[0], k = w.subarray(1);
@@ -1060,17 +1060,17 @@ function ss(e) {
         const C = F(k);
         if (!o(C))
           throw new Error("Point is not on curve");
-        const I = u(C);
-        let O = n.sqrt(I);
+        const U = u(C);
+        let O = n.sqrt(U);
         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)), I = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
-        return { x: C, y: I };
+        const C = n.fromBytes(k.subarray(0, n.BYTES)), U = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
+        return { x: C, y: U };
       } else
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${s} uncompressed bytes`);
     }
-  }), b = (w) => qe(Ne(w, t.nByteLength));
+  }), b = (w) => De(Ne(w, t.nByteLength));
   function p(w) {
     const v = r >> Y;
     return w > v;
@@ -1104,13 +1104,13 @@ function ss(e) {
       return new y(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: N, s: k, recovery: C } = this, I = x(W("msgHash", v));
+      const { r: N, s: k, recovery: C } = this, U = x(W("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(-I * ge), Ve = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(Q, Le, Ve);
+      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);
       if (!we)
         throw new Error("point at infinify");
       return we.assertValidity(), we;
@@ -1124,14 +1124,14 @@ function ss(e) {
     }
     // DER-encoded
     toDERRawBytes() {
-      return De(this.toDERHex());
+      return je(this.toDERHex());
     }
     toDERHex() {
       return ke.hexFromSig({ r: this.r, s: this.s });
     }
     // padded bytes of r, then padded bytes of s
     toCompactRawBytes() {
-      return De(this.toCompactHex());
+      return je(this.toCompactHex());
     }
     toCompactHex() {
       return b(this.r) + b(this.s);
@@ -1169,14 +1169,14 @@ function ss(e) {
   function A(w, v = !0) {
     return l.fromPrivateKey(w).toRawBytes(v);
   }
-  function U(w) {
+  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 B(w, v, N = !0) {
-    if (U(w))
+    if (I(w))
       throw new Error("first arg must be private key");
-    if (!U(v))
+    if (!I(v))
       throw new Error("second arg must be public key");
     return l.fromHex(v).multiply(f(w)).toRawBytes(N);
   }
@@ -1185,7 +1185,7 @@ function ss(e) {
     return N > 0 ? v >> BigInt(N) : v;
   }, x = t.bits2int_modN || function(w) {
     return c(E(w));
-  }, S = Jt(t.nBitLength);
+  }, S = Yt(t.nBitLength);
   function P(w) {
     if (typeof w != "bigint")
       throw new Error("bigint expected");
@@ -1197,15 +1197,15 @@ function ss(e) {
     if (["recovered", "canonical"].some((Ke) => Ke in N))
       throw new Error("sign() legacy options not supported");
     const { hash: k, randomBytes: C } = t;
-    let { lowS: I, prehash: O, extraEntropy: $ } = N;
-    I == null && (I = !0), w = W("msgHash", w), O && (w = W("prehashed msgHash", k(w)));
+    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)];
     if ($ != null) {
       const Ke = $ === !0 ? C(n.BYTES) : $;
       Le.push(W("extraEntropy", Ke));
     }
-    const Ve = Ue(...Le), we = Q;
-    function Et(Ke) {
+    const We = Ie(...Le), we = Q;
+    function mt(Ke) {
       const $e = E(Ke);
       if (!g($e))
         return;
@@ -1216,14 +1216,14 @@ function ss(e) {
       if (Re === ae)
         return;
       let Nn = (Te.x === ee ? 0 : 2) | Number(Te.y & Y), An = Re;
-      return I && p(Re) && (An = h(Re), Nn ^= 1), new y(ee, An, Nn);
+      return U && p(Re) && (An = h(Re), Nn ^= 1), new y(ee, An, Nn);
     }
-    return { seed: Ve, k2sig: Et };
+    return { seed: We, k2sig: mt };
   }
   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), I = t;
-    return Jn(I.hash.outputLen, I.nByteLength, I.hmac)(k, C);
+    const { seed: k, k2sig: C } = _(w, v, N), U = t;
+    return Jn(U.hash.outputLen, U.nByteLength, U.hmac)(k, C);
   }
   l.BASE._setWindowSize(8);
   function H(w, v, N, k = T) {
@@ -1231,7 +1231,7 @@ function ss(e) {
     const C = w;
     if (v = W("msgHash", v), N = W("publicKey", N), "strict" in k)
       throw new Error("options.strict was renamed to lowS");
-    const { lowS: I, prehash: O } = k;
+    const { lowS: U, prehash: O } = k;
     let $, Q;
     try {
       if (typeof C == "string" || C instanceof Uint8Array)
@@ -1253,10 +1253,10 @@ function ss(e) {
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
       return !1;
     }
-    if (I && $.hasHighS())
+    if (U && $.hasHighS())
       return !1;
     O && (v = t.hash(v));
-    const { r: ge, s: Le } = $, Ve = x(v), we = a(Le), Et = c(Ve * we), Ke = c(ge * we), $e = (Te = l.BASE.multiplyAndAddUnsafe(Q, Et, Ke)) == null ? void 0 : Te.toAffine();
+    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;
   }
   return {
@@ -1273,7 +1273,7 @@ function ss(e) {
 let tr = class extends Wn {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, Ei(t);
-    const r = Wt(n);
+    const r = Zt(n);
     if (this.iHash = t.create(), typeof this.iHash.update != "function")
       throw new Error("Expected instance of class which extends utils.Hash");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
@@ -1320,17 +1320,17 @@ function as(e, t) {
   return Object.freeze({ ...n(t), create: n });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const ct = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), rr = BigInt(1), nt = BigInt(2), Un = (e, t) => (e + t / nt) / t;
+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, U = J(A, o, t) * p % t, B = J(U, r, t) * l % t, E = J(B, nt, t);
-  if (!Rt.eql(Rt.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, 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))
     throw new Error("Cannot find square root");
   return E;
 }
-const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), Ie = as({
+const Ot = Ji(ct, void 0, void 0, { sqrt: ir }), Ue = as({
   a: BigInt(0),
   b: BigInt(7),
-  Fp: Rt,
+  Fp: Ot,
   n: tt,
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
@@ -1346,7 +1346,7 @@ const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), Ie = as({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
-      const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -rr * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = Un(s * e, t), a = Un(-r * e, t);
+      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)
@@ -1354,41 +1354,41 @@ const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), Ie = as({
       return { k1neg: u, k1: l, k2neg: g, k2: f };
     }
   }
-}, Lt), ut = BigInt(0), sr = (e) => typeof e == "bigint" && ut < e && e < ct, cs = (e) => typeof e == "bigint" && ut < e && e < tt, In = {};
+}, $t), ut = BigInt(0), sr = (e) => typeof e == "bigint" && ut < e && e < ct, cs = (e) => typeof e == "bigint" && ut < e && e < tt, Un = {};
 function rt(e, ...t) {
-  let n = In[e];
+  let n = Un[e];
   if (n === void 0) {
-    const r = Lt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = Ue(r, r), In[e] = n;
+    const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    n = Ie(r, r), Un[e] = n;
   }
-  return Lt(Ue(n, ...t));
+  return $t(Ie(n, ...t));
 }
-const Yt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => Ne(e, 32), At = (e) => V(e, ct), Fe = (e) => V(e, tt), Xt = Ie.ProjectivePoint, us = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
-function Mt(e) {
-  let t = Ie.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
-  return { scalar: n.hasEvenY() ? t : Fe(-t), bytes: Yt(n) };
+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);
+function Pt(e) {
+  let t = Ue.utils.normPrivateKeyToScalar(e), n = Qt.fromPrivateKey(t);
+  return { scalar: n.hasEvenY() ? t : Fe(-t), bytes: Xt(n) };
 }
 function or(e) {
   if (!sr(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = At(e * e), n = At(t * e + BigInt(7));
+  const t = Kt(e * e), n = Kt(t * e + BigInt(7));
   let r = ir(n);
-  r % nt !== ut && (r = At(-r));
-  const i = new Xt(e, r, rr);
+  r % nt !== ut && (r = Kt(-r));
+  const i = new Qt(e, r, rr);
   return i.assertValidity(), i;
 }
 function ar(...e) {
   return Fe(F(rt("BIP0340/challenge", ...e)));
 }
 function ls(e) {
-  return Mt(e).bytes;
+  return Pt(e).bytes;
 }
 function fs(e, t, n = Zn(32)) {
-  const r = W("message", e), { bytes: i, scalar: s } = Mt(t), o = W("auxRand", n, 32), c = Ot(s ^ F(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Fe(F(a));
+  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));
   if (l === ut)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Mt(l), g = ar(f, i, r), b = new Uint8Array(64);
-  if (b.set(f, 0), b.set(Ot(Fe(u + g * s)), 32), !cr(b, r, i))
+  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))
     throw new Error("sign: Invalid signature produced");
   return b;
 }
@@ -1401,33 +1401,33 @@ function cr(e, t, n) {
     const a = F(r.subarray(32, 64));
     if (!cs(a))
       return !1;
-    const l = ar(Ot(c), Yt(o), i), f = us(o, a, Fe(-l));
+    const l = ar(Mt(c), Xt(o), i), f = us(o, a, Fe(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
   } catch {
     return !1;
   }
 }
-const We = {
+const Ze = {
   getPublicKey: ls,
   sign: fs,
   verify: cr,
   utils: {
-    randomPrivateKey: Ie.utils.randomPrivateKey,
+    randomPrivateKey: Ue.utils.randomPrivateKey,
     lift_x: or,
-    pointToBytes: Yt,
+    pointToBytes: Xt,
     numberToBytesBE: Ne,
     bytesToNumberBE: F,
     taggedHash: rt,
     mod: V
   }
-}, Kt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+}, Ct = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Qt = (e) => e instanceof Uint8Array, Ct = (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 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;
 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 (!Qt(e))
+  if (!en(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
@@ -1455,7 +1455,7 @@ function ps(e) {
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Je(e) {
-  if (typeof e == "string" && (e = ps(e)), !Qt(e))
+  if (typeof e == "string" && (e = ps(e)), !en(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 (!Qt(r))
+    if (!en(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
@@ -1479,11 +1479,11 @@ function lr(e) {
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function fr(e = 32) {
-  if (Kt && typeof Kt.getRandomValues == "function")
-    return Kt.getRandomValues(new Uint8Array(e));
+  if (Ct && typeof Ct.getRandomValues == "function")
+    return Ct.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Pt(e) {
+function Ht(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${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");
-  Pt(e.outputLen), Pt(e.blockLen);
+  Ht(e.outputLen), Ht(e.blockLen);
 }
 function ws(e, t = !0) {
   if (e.destroyed)
@@ -1515,7 +1515,7 @@ function bs(e, t) {
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const se = {
-  number: Pt,
+  number: Ht,
   bool: ys,
   bytes: hr,
   hash: gs,
@@ -1530,7 +1530,7 @@ function vs(e, t, n, r) {
 }
 class Es 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 = Ct(this.buffer);
+    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Bt(this.buffer);
   }
   update(t) {
     se.exists(this);
@@ -1540,7 +1540,7 @@ class Es extends ur {
     for (let o = 0; o < s; ) {
       const c = Math.min(i - this.pos, s - o);
       if (c === i) {
-        const a = Ct(t);
+        const a = Bt(t);
         for (; i <= s - o; o += i)
           this.process(a, o);
         continue;
@@ -1557,7 +1557,7 @@ class Es extends ur {
     for (let u = o; u < i; u++)
       n[u] = 0;
     vs(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const c = Ct(t), a = this.outputLen;
+    const c = Bt(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = a / 4, f = this.get();
@@ -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 ze(e) {
+function Ve(e) {
   if (!Number.isSafeInteger(e))
     throw new Error(`Wrong integer: ${e}`);
 }
@@ -1708,7 +1708,7 @@ function pe(e) {
       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 (ze(n), n < 0 || n >= e.length)
+        if (Ve(n), n < 0 || n >= e.length)
           throw new Error(`Digit index outside alphabet: ${n} (alphabet: ${e.length})`);
         return e[n];
       });
@@ -1747,7 +1747,7 @@ function ye(e = "") {
   };
 }
 function ft(e, t = "=") {
-  if (ze(e), typeof t != "string")
+  if (Ve(e), typeof t != "string")
     throw new Error("padding chr should be string");
   return {
     encode(n) {
@@ -1793,7 +1793,7 @@ function Ln(e, t, n) {
   let r = 0;
   const i = [], s = Array.from(e);
   for (s.forEach((o) => {
-    if (ze(o), o < 0 || o >= t)
+    if (Ve(o), o < 0 || o >= t)
       throw new Error(`Wrong integer: ${o}`);
   }); ; ) {
     let o = 0, c = !0;
@@ -1815,7 +1815,7 @@ function Ln(e, t, n) {
   return i.reverse();
 }
 const yr = (e, t) => t ? yr(t, e % t) : e, it = (e, t) => e + (t - yr(e, t));
-function Ht(e, t, n, r) {
+function qt(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 Ht(e, t, n, r) {
   let i = 0, s = 0;
   const o = 2 ** n - 1, c = [];
   for (const a of e) {
-    if (ze(a), a >= 2 ** t)
+    if (Ve(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}`);
@@ -1842,7 +1842,7 @@ function Ht(e, t, n, r) {
   return r && s > 0 && c.push(i >>> 0), c;
 }
 function As(e) {
-  return ze(e), {
+  return Ve(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
@@ -1856,7 +1856,7 @@ function As(e) {
   };
 }
 function Ae(e, t = !1) {
-  if (ze(e), e <= 0 || e > 32)
+  if (Ve(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,12 +1864,12 @@ function Ae(e, t = !1) {
     encode: (n) => {
       if (!(n instanceof Uint8Array))
         throw new Error("radix2.encode input should be Uint8Array");
-      return Ht(Array.from(n), 8, e, !t);
+      return qt(Array.from(n), 8, e, !t);
     },
     decode: (n) => {
       if (!Array.isArray(n) || n.length && typeof n[0] != "number")
         throw new Error("radix2.decode input should be array of strings");
-      return Uint8Array.from(Ht(n, e, 8, t));
+      return Uint8Array.from(qt(n, e, 8, t));
     }
   };
 }
@@ -1886,22 +1886,22 @@ 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("")), en = (e) => de(As(58), pe(e), ye("")), qt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
-en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
+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 = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
       const r = e.subarray(n, n + 8);
-      t += qt.encode(r).padStart(Tn[r.length], "1");
+      t += Dt.encode(r).padStart(Tn[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 = qt.decode(r);
+      const r = e.slice(n, n + 11), i = Tn.indexOf(r.length), s = Dt.decode(r);
       for (let o = 0; o < s.length - i; o++)
         if (s[o] !== 0)
           throw new Error("base58xmr: wrong padding");
@@ -1909,8 +1909,8 @@ const Tn = [0, 2, 3, 5, 6, 7, 9, 10, 11], ks = {
     }
     return Uint8Array.from(t);
   }
-}, Dt = de(pe("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), ye("")), Rn = [996825010, 642813549, 513874426, 1027748829, 705979059];
-function Ze(e) {
+}, jt = de(pe("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), ye("")), Rn = [996825010, 642813549, 513874426, 1027748829, 705979059];
+function Ge(e) {
   const t = e >> 25;
   let n = (e & 33554431) << 5;
   for (let r = 0; r < Rn.length; r++)
@@ -1924,16 +1924,16 @@ function On(e, t, n = 1) {
     const o = e.charCodeAt(s);
     if (o < 33 || o > 126)
       throw new Error(`Invalid prefix (${e})`);
-    i = Ze(i) ^ o >> 5;
+    i = Ge(i) ^ o >> 5;
   }
-  i = Ze(i);
+  i = Ge(i);
   for (let s = 0; s < r; s++)
-    i = Ze(i) ^ e.charCodeAt(s) & 31;
+    i = Ge(i) ^ e.charCodeAt(s) & 31;
   for (let s of t)
-    i = Ze(i) ^ s;
+    i = Ge(i) ^ s;
   for (let s = 0; s < 6; s++)
-    i = Ze(i);
-  return i ^= n, Dt.encode(Ht([i % 2 ** 30], 30, 5, !1));
+    i = Ge(i);
+  return i ^= n, jt.encode(qt([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);
@@ -1945,7 +1945,7 @@ function gr(e) {
     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${Dt.encode(u)}${On(f, u, t)}`;
+    return f = f.toLowerCase(), `${f}1${jt.encode(u)}${On(f, u, t)}`;
   }
   function c(f, u = 90) {
     if (typeof f != "string")
@@ -1962,7 +1962,7 @@ function gr(e) {
     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 = Dt.decode(h).slice(0, -6), y = On(p, d, t);
+    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}"`);
     return { prefix: p, words: d };
@@ -1974,27 +1974,27 @@ function gr(e) {
   }
   return { encode: o, decode: c, decodeToBytes: l, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
-const je = gr("bech32");
+const ze = gr("bech32");
 gr("bech32m");
 const _s = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, Us = de(Ae(4), pe("0123456789abcdef"), ye(""), pr((e) => {
+}, Is = de(Ae(4), pe("0123456789abcdef"), ye(""), pr((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();
-})), Is = {
+})), Us = {
   utf8: _s,
-  hex: Us,
+  hex: Is,
   base16: Ks,
   base32: Cs,
   base64: he,
   base64url: Bs,
-  base58: qt,
+  base58: Dt,
   base58xmr: ks
 };
-`${Object.keys(Is).join(", ")}`;
-function Bt(e) {
+`${Object.keys(Us).join(", ")}`;
+function kt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
@@ -2029,18 +2029,18 @@ function Rs(e, t) {
   return n === 0;
 }
 const Os = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Se = 16, Ms = 283;
-function tn(e) {
+function nn(e) {
   return e << 1 ^ Ms & -(e >> 7);
 }
 function He(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
-    n ^= e & -(t & 1), e = tn(e);
+    n ^= e & -(t & 1), e = nn(e);
   return n;
 }
-const jt = /* @__PURE__ */ (() => {
+const zt = /* @__PURE__ */ (() => {
   let e = new Uint8Array(256);
-  for (let n = 0, r = 1; n < 256; n++, r ^= tn(r))
+  for (let n = 0, r = 1; n < 256; n++, r ^= nn(r))
     e[n] = r;
   const t = new Uint8Array(256);
   t[0] = 99;
@@ -2049,11 +2049,11 @@ const jt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), Ps = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Hs = (e) => e << 24 | e >>> 8, kt = (e) => e << 8 | e >>> 24;
+})(), Ps = /* @__PURE__ */ zt.map((e, t) => zt.indexOf(t)), Hs = (e) => e << 24 | e >>> 8, _t = (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(kt), i = r.map(kt), s = i.map(kt), 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(_t), i = r.map(_t), s = i.map(_t), 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 nn = /* @__PURE__ */ wr(jt, (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 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 e = new Uint8Array(16);
-  for (let t = 0, n = 1; t < 16; t++, n = tn(n))
+  for (let t = 0, n = 1; t < 16; t++, n = nn(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 } = nn, r = Z(e), i = r.length, s = (c) => oe(n, c, c, c, c), o = new Uint32Array(t + 28);
+  const { sbox2: n } = rn, r = Z(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 } = nn, { T0: s, T1: o, T2: c, T3: a } = br;
+  const t = vr(e), n = t.slice(), r = t.length, { sbox2: i } = rn, { 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,7 +2099,7 @@ 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 } = nn;
+  const { sbox2: s, T01: o, T23: c } = rn;
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
@@ -2189,10 +2189,10 @@ const mr = /* @__PURE__ */ Os({ blockSize: 16, nonceLength: 16 }, function(t, n,
       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];
       for (let d = 0; d + 4 <= f.length; ) {
-        const y = g, m = b, A = p, U = h;
+        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 ^ U;
+        u[d++] = B ^ y, u[d++] = E ^ m, u[d++] = x ^ A, u[d++] = S ^ I;
       }
       return c.fill(0), Ws(l, i);
     }
@@ -2202,12 +2202,12 @@ Sr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
 }
-function zt(e) {
+function Vt(e) {
   return e.byteOffset % 4 === 0;
 }
 const Xe = 64, Ys = 16, Nr = 2 ** 32 - 1, Hn = new Uint32Array();
 function Xs(e, t, n, r, i, s, o, c) {
-  const a = i.length, l = new Uint8Array(Xe), f = Z(l), u = zt(i) && zt(s), g = u ? Z(i) : Hn, b = u ? Z(s) : Hn;
+  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;
   for (let p = 0; p < a; o++) {
     if (e(t, n, r, f, o, c), o >= Nr)
       throw new Error("arx: counter overflow");
@@ -2230,10 +2230,10 @@ 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 Bt(i), Bt(o), Mn(s), Mn(n), (c, a, l, f, u = 0) => {
+  return kt(i), kt(o), Mn(s), Mn(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), Bt(u), u < 0 || u >= Nr)
+    if (f || (f = new Uint8Array(g)), ce(f), kt(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})`);
@@ -2245,7 +2245,7 @@ function Qs(e, t) {
       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}`);
-    zt(a) || (a = a.slice(), b.push(a));
+    Vt(a) || (a = a.slice(), b.push(a));
     const y = Z(h);
     if (r) {
       if (a.length !== 24)
@@ -2256,8 +2256,8 @@ function Qs(e, t) {
     if (m !== a.length)
       throw new Error(`arx: nonce must be ${m} or 16 bytes`);
     if (m !== 12) {
-      const U = new Uint8Array(12);
-      U.set(a, s ? 0 : 12 - a.length), a = U, b.push(a);
+      const I = new Uint8Array(12);
+      I.set(a, s ? 0 : 12 - a.length), a = I, b.push(a);
     }
     const A = Z(a);
     for (Xs(e, d, y, A, l, f, u, o); b.length > 0; )
@@ -2266,11 +2266,11 @@ function Qs(e, t) {
   };
 }
 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], U = 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, I = U, O = B;
+  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;
   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, I = L(I ^ S, 16), v = v + I | 0, T = L(T ^ v, 12), S = S + T | 0, I = L(I ^ S, 8), v = v + I | 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, I = L(I ^ P, 16), w = w + I | 0, _ = L(_ ^ w, 12), P = P + _ | 0, I = L(I ^ P, 8), w = w + I | 0, _ = L(_ ^ w, 7);
+    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);
   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[$++] = U + I | 0, r[$++] = B + O | 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;
 }
 const Ar = /* @__PURE__ */ Qs(eo, {
   counterRight: !1,
@@ -2314,10 +2314,10 @@ class Kr extends ur {
 }
 const ht = (e, t, n) => new Kr(e, t).update(n).digest();
 ht.create = (e, t) => new Kr(e, t);
-function rn(e, t, n) {
+function sn(e, t, n) {
   return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), ht(e, Je(n), Je(t));
 }
-const _t = new Uint8Array([0]), qn = new Uint8Array();
+const It = new Uint8Array([0]), qn = 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");
@@ -2325,14 +2325,14 @@ function Cr(e, t, n, r = 32) {
   n === void 0 && (n = qn);
   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++)
-    _t[0] = l + 1, c.update(l === 0 ? qn : a).update(n).update(_t).digestInto(a), s.set(a, e.outputLen * l), o._cloneInto(c);
-  return o.destroy(), c.destroy(), a.fill(0), _t.fill(0), s.slice(0, r);
+    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);
 }
 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;
-function sn(e) {
+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;
   for (let t = 0; t < e.tags.length; t++) {
@@ -2409,23 +2409,23 @@ var Br = class {
   }
 }, co = class {
   generateSecretKey() {
-    return We.utils.randomPrivateKey();
+    return Ze.utils.randomPrivateKey();
   }
   getPublicKey(e) {
-    return M(We.getPublicKey(e));
+    return M(Ze.getPublicKey(e));
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = M(We.getPublicKey(t)), n.id = Ge(n), n.sig = M(We.sign(Ge(n), t)), n[Oe] = !0, n;
+    return n.pubkey = M(Ze.getPublicKey(t)), n.id = qe(n), n.sig = M(Ze.sign(qe(n), t)), n[Oe] = !0, n;
   }
   verifyEvent(e) {
     if (typeof e[Oe] == "boolean")
       return e[Oe];
-    const t = Ge(e);
+    const t = qe(e);
     if (t !== e.id)
       return e[Oe] = !1, !1;
     try {
-      const n = We.verify(e.sig, t, e.pubkey);
+      const n = Ze.verify(e.sig, t, e.pubkey);
       return e[Oe] = n, n;
     } catch {
       return e[Oe] = !1, !1;
@@ -2433,15 +2433,15 @@ var Br = class {
   }
 };
 function uo(e) {
-  if (!sn(e))
+  if (!dt(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 Ge(e) {
+function qe(e) {
   let t = fe(ne.encode(uo(e)));
   return M(t);
 }
-var dt = new co(), _e = dt.generateSecretKey, le = dt.getPublicKey, X = dt.finalizeEvent, pt = dt.verifyEvent, lo = {};
+var pt = new co(), _e = pt.generateSecretKey, le = pt.getPublicKey, X = pt.finalizeEvent, yt = pt.verifyEvent, lo = {};
 D(lo, {
   Application: () => da,
   BadgeAward: () => Eo,
@@ -2485,8 +2485,8 @@ D(lo, {
   InterestsList: () => Wo,
   Interestsets: () => aa,
   JobFeedback: () => Lo,
-  JobRequest: () => Uo,
-  JobResult: () => Io,
+  JobRequest: () => Io,
+  JobResult: () => Uo,
   Label: () => ko,
   LightningPubRPC: () => Yo,
   LiveChatMessage: () => Ao,
@@ -2521,9 +2521,9 @@ D(lo, {
   ZapGoal: () => $o,
   ZapRequest: () => To,
   classifyKind: () => fo,
-  isEphemeralKind: () => Ur,
+  isEphemeralKind: () => Ir,
   isKind: () => ho,
-  isParameterizedReplaceableKind: () => Ir,
+  isParameterizedReplaceableKind: () => Ur,
   isRegularKind: () => kr,
   isReplaceableKind: () => _r
 });
@@ -2533,20 +2533,20 @@ function kr(e) {
 function _r(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
-function Ur(e) {
+function Ir(e) {
   return 2e4 <= e && e < 3e4;
 }
-function Ir(e) {
+function Ur(e) {
   return 3e4 <= e && e < 4e4;
 }
 function fo(e) {
-  return kr(e) ? "regular" : _r(e) ? "replaceable" : Ur(e) ? "ephemeral" : Ir(e) ? "parameterized" : "unknown";
+  return kr(e) ? "regular" : _r(e) ? "replaceable" : Ir(e) ? "ephemeral" : Ur(e) ? "parameterized" : "unknown";
 }
 function ho(e, t) {
   const n = t instanceof Array ? t : [t];
-  return sn(e) && n.includes(e.kind) || !1;
+  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, Uo = 5999, Io = 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 = {};
+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,
   getInt: () => Dr,
@@ -2587,9 +2587,9 @@ function ka(e, t) {
 }
 var _a = {};
 D(_a, {
-  makeAuthEvent: () => Ua
+  makeAuthEvent: () => Ia
 });
-function Ua(e, t) {
+function Ia(e, t) {
   return {
     kind: Hr,
     created_at: Math.floor(Date.now() / 1e3),
@@ -2600,9 +2600,9 @@ function Ua(e, t) {
     content: ""
   };
 }
-var Ia;
+var Ua;
 try {
-  Ia = WebSocket;
+  Ua = WebSocket;
 } catch {
 }
 var La;
@@ -2615,8 +2615,8 @@ D($a, {
   BECH32_REGEX: () => jr,
   Bech32MaxSize: () => fn,
   NostrTypeGuard: () => Ta,
-  decode: () => yt,
-  encodeBytes: () => wt,
+  decode: () => gt,
+  encodeBytes: () => bt,
   naddrEncode: () => Da,
   neventEncode: () => qa,
   noteEncode: () => Pa,
@@ -2637,9 +2637,9 @@ 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 yt(e) {
+function gt(e) {
   var i, s, o, c, a, l, f;
-  let { prefix: t, words: n } = je.decode(e, fn), r = new Uint8Array(je.fromWords(n));
+  let { prefix: t, words: n } = ze.decode(e, fn), r = new Uint8Array(ze.fromWords(n));
   switch (t) {
     case "nprofile": {
       let u = Ut(r);
@@ -2717,27 +2717,27 @@ function Ut(e) {
   return t;
 }
 function Oa(e) {
-  return wt("nsec", e);
+  return bt("nsec", e);
 }
 function Ma(e) {
-  return wt("npub", G(e));
+  return bt("npub", G(e));
 }
 function Pa(e) {
-  return wt("note", G(e));
-}
-function gt(e, t) {
-  let n = je.toWords(t);
-  return je.encode(e, n, fn);
+  return bt("note", G(e));
 }
 function wt(e, t) {
-  return gt(e, t);
+  let n = ze.toWords(t);
+  return ze.encode(e, n, fn);
+}
+function bt(e, t) {
+  return wt(e, t);
 }
 function Ha(e) {
   let t = hn({
     0: [G(e.pubkey)],
     1: (e.relays || []).map((n) => ne.encode(n))
   });
-  return gt("nprofile", t);
+  return wt("nprofile", t);
 }
 function qa(e) {
   let t;
@@ -2748,7 +2748,7 @@ function qa(e) {
     2: e.author ? [G(e.author)] : [],
     3: t ? [new Uint8Array(t)] : []
   });
-  return gt("nevent", n);
+  return wt("nevent", n);
 }
 function Da(e) {
   let t = new ArrayBuffer(4);
@@ -2759,7 +2759,7 @@ function Da(e) {
     2: [G(e.pubkey)],
     3: [new Uint8Array(t)]
   });
-  return gt("naddr", n);
+  return wt("naddr", n);
 }
 function hn(e) {
   let t = [];
@@ -2776,13 +2776,13 @@ D(ja, {
   encrypt: () => zr
 });
 async function zr(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e, i = Ie.getSharedSecret(r, "02" + t), s = Vr(i);
+  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));
   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 = Ie.getSharedSecret(r, "02" + t), c = Vr(o), a = he.decode(s), l = he.decode(i), f = mr(c, a).decrypt(l);
+  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);
   return ue.decode(f);
 }
 function Vr(e) {
@@ -2797,17 +2797,17 @@ D(Va, {
   searchDomain: () => Ga,
   useFetchImplementation: () => Za
 });
-var dn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Wa = (e) => dn.test(e || ""), bt;
+var dn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Wa = (e) => dn.test(e || ""), vt;
 try {
-  bt = fetch;
+  vt = fetch;
 } catch {
 }
 function Za(e) {
-  bt = e;
+  vt = e;
 }
 async function Ga(e, t = "") {
   try {
-    const n = `https://${e}/.well-known/nostr.json?name=${t}`, r = await bt(n, { redirect: "manual" });
+    const n = `https://${e}/.well-known/nostr.json?name=${t}`, r = await vt(n, { redirect: "manual" });
     if (r.status !== 200)
       throw Error("Wrong response code");
     return (await r.json()).names;
@@ -2822,7 +2822,7 @@ async function Wr(e) {
     return null;
   const [, n = "_", r] = t;
   try {
-    const s = `https://${r}/.well-known/nostr.json?name=${n}`, o = await bt(s, { redirect: "manual" });
+    const s = `https://${r}/.well-known/nostr.json?name=${n}`, o = await vt(s, { redirect: "manual" });
     if (o.status !== 200)
       throw Error("Wrong response code");
     const c = await o.json(), a = c.names[n];
@@ -3000,27 +3000,27 @@ function sc(e, { skipVerification: t } = {}) {
   } catch {
     return;
   }
-  if (r.id === n.id && !(!t && !pt(r)))
+  if (r.id === n.id && !(!t && !yt(r)))
     return r;
 }
 var oc = {};
 D(oc, {
-  NOSTR_URI_REGEX: () => vt,
+  NOSTR_URI_REGEX: () => Et,
   parse: () => cc,
   test: () => ac
 });
-var vt = new RegExp(`nostr:(${jr.source})`);
+var Et = new RegExp(`nostr:(${jr.source})`);
 function ac(e) {
-  return typeof e == "string" && new RegExp(`^${vt.source}$`).test(e);
+  return typeof e == "string" && new RegExp(`^${Et.source}$`).test(e);
 }
 function cc(e) {
-  const t = e.match(new RegExp(`^${vt.source}$`));
+  const t = e.match(new RegExp(`^${Et.source}$`));
   if (!t)
     throw new Error(`Invalid Nostr URI: ${e}`);
   return {
     uri: t[0],
     value: t[1],
-    decoded: yt(t[1])
+    decoded: gt(t[1])
   };
 }
 var uc = {};
@@ -3061,7 +3061,7 @@ D(hc, {
   regex: () => pn,
   replaceAll: () => pc
 });
-var pn = () => new RegExp(`\\b${vt.source}\\b`, "g");
+var pn = () => new RegExp(`\\b${Et.source}\\b`, "g");
 function* dc(e) {
   const t = e.matchAll(pn());
   for (const n of t)
@@ -3070,7 +3070,7 @@ function* dc(e) {
       yield {
         uri: r,
         value: i,
-        decoded: yt(i),
+        decoded: gt(i),
         start: n.index,
         end: n.index + r.length
       };
@@ -3081,7 +3081,7 @@ function pc(e, t) {
   return e.replaceAll(pn(), (n, r) => t({
     uri: n,
     value: r,
-    decoded: yt(r)
+    decoded: gt(r)
   }));
 }
 var yc = {};
@@ -3224,12 +3224,12 @@ D(q, {
   decrypt: () => En,
   encrypt: () => vn,
   getConversationKey: () => wn,
-  v2: () => Uc
+  v2: () => Ic
 });
 var Xr = 1, Qr = 65535;
 function wn(e, t) {
-  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return rn(fe, n, "nip44-v2");
+  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return sn(fe, n, "nip44-v2");
 }
 function ei(e, t) {
   const n = Cr(fe, e, t, 76);
@@ -3306,15 +3306,15 @@ function En(e, t) {
   const l = Ar(s, o, r);
   return kc(l);
 }
-var Uc = {
+var Ic = {
   utils: {
     getConversationKey: wn,
     calcPaddedLen: bn
   },
   encrypt: vn,
   decrypt: En
-}, Ic = {};
-D(Ic, {
+}, Uc = {};
+D(Uc, {
   makeNwcRequestEvent: () => $c,
   parseConnectionString: () => Lc
 });
@@ -3358,7 +3358,7 @@ async function Oc(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
-      let { words: o } = je.decode(n, 1e3), c = je.fromWords(o);
+      let { words: o } = ze.decode(n, 1e3), c = ze.fromWords(o);
       t = ue.decode(c);
     } else if (r) {
       let [o, c] = r.split("@");
@@ -3402,9 +3402,9 @@ function Pc(e) {
   } catch {
     return "Invalid zap request JSON.";
   }
-  if (!sn(t))
+  if (!dt(t))
     return "Zap request is not a valid Nostr event.";
-  if (!pt(t))
+  if (!yt(t))
     return "Invalid signature on zap request.";
   let n = t.tags.find(([s, o]) => s === "p" && o);
   if (!n)
@@ -3435,7 +3435,7 @@ D(qc, {
   createWrap: () => ci,
   unwrapEvent: () => ui,
   unwrapManyEvents: () => zc,
-  wrapEvent: () => Vt,
+  wrapEvent: () => Wt,
   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)));
@@ -3447,7 +3447,7 @@ function oi(e, t) {
     ...e,
     pubkey: le(t)
   };
-  return n.id = Ge(n), n;
+  return n.id = qe(n), n;
 }
 function ai(e, t, n) {
   return X(
@@ -3472,16 +3472,16 @@ function ci(e, t) {
     n
   );
 }
-function Vt(e, t, n) {
+function Wt(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 = [Vt(e, t, r)];
+  const r = le(t), i = [Wt(e, t, r)];
   return n.forEach((s) => {
-    i.push(Vt(e, t, s));
+    i.push(Wt(e, t, s));
   }), i;
 }
 function ui(e, t) {
@@ -3565,7 +3565,7 @@ function gi(e, t) {
   return n.length > 0 && n[1] === r;
 }
 async function wi(e, t, n, r) {
-  if (!pt(e))
+  if (!yt(e))
     throw new Error("Invalid nostr event, signature invalid");
   if (!di(e))
     throw new Error("Invalid nostr event, kind invalid");
@@ -3661,14 +3661,18 @@ async function* ou(e) {
   }
 }
 function Me(e, t = new Uint8Array(32), n = 1) {
-  const r = rn(fe, e, t), i = [];
+  const r = sn(fe, e, t), i = [];
   for (let s = 1; s <= n; s++)
     i.push(Cr(fe, r, new Uint8Array([s]), 32));
   return i;
 }
-function It(e, t) {
+function Lt(e, t) {
   return `${e}:${t}`;
 }
+function au(e) {
+  const t = e.tags.find((n) => n[0] === "ms");
+  return t ? parseInt(t[1]) : e.created_at * 1e3;
+}
 const Fc = 1e3, Jc = "0000000000000000000000000000000000000000000000000000000000000000";
 class st {
   // 1. CHANNEL PUBLIC INTERFACE
@@ -3722,7 +3726,8 @@ class st {
     });
   }
   /**
-   * Send a Nostr event through the encrypted session
+   * Send a partial Nostr event through the encrypted session.
+   * In addition to chat messages, it could be files, webrtc negotiation or many other types of messages.
    * @param event Partial Nostr event to send. Must be unsigned. Id and will be generated if not provided.
    * @returns A verified Nostr event containing the encrypted message
    * @throws Error if we are not the initiator and trying to send the first message
@@ -3740,14 +3745,14 @@ class st {
       tags: t.tags || [],
       pubkey: t.pubkey || Jc
     };
-    n.tags.some(([a]) => a === "ms") || n.tags.push(["ms", Date.now().toString()]), n.id = Ge(n);
-    const [r, i] = this.ratchetEncrypt(JSON.stringify(t)), s = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNextNostrPublicKey), o = q.encrypt(JSON.stringify(r), s);
-    return X({
+    n.tags.some(([a]) => a === "ms") || n.tags.push(["ms", Date.now().toString()]), n.id = qe(n);
+    const [r, i] = this.ratchetEncrypt(JSON.stringify(n)), s = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNextNostrPublicKey), o = q.encrypt(JSON.stringify(r), s);
+    return { event: X({
       content: i,
       kind: Be,
       tags: [["header", o]],
       created_at: Math.floor(Date.now() / 1e3)
-    }, this.state.ourCurrentNostrKey.privateKey);
+    }, this.state.ourCurrentNostrKey.privateKey), innerEvent: n };
   }
   /**
    * Subscribes to incoming messages on this session
@@ -3810,7 +3815,7 @@ class st {
     for (; this.state.receivingChainMessageNumber < t; ) {
       const [r, i] = Me(this.state.receivingChainKey, new Uint8Array([1]), 2);
       this.state.receivingChainKey = r;
-      const s = It(n, this.state.receivingChainMessageNumber);
+      const s = Lt(n, this.state.receivingChainMessageNumber);
       if (this.state.skippedMessageKeys[s] = i, !this.state.skippedHeaderKeys[n]) {
         const o = [];
         if (this.state.ourCurrentNostrKey) {
@@ -3825,7 +3830,7 @@ class st {
   }
   trySkippedMessageKeys(t, n, r) {
     var s;
-    const i = It(r, t.number);
+    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);
@@ -3864,9 +3869,17 @@ class st {
         { authors: [this.state.theirNextNostrPublicKey], kinds: [Be] },
         (a) => this.handleNostrEvent(a)
       )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey));
-    else if (!(It(t.pubkey, n.number) in this.state.skippedMessageKeys))
+    else if (!(Lt(t.pubkey, n.number) in this.state.skippedMessageKeys))
       return;
     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)) {
+      console.error("Event hash does not match", o);
+      return;
+    }
     this.internalSubscriptions.forEach((a) => a(o, t));
   }
   subscribeToNostrEvents() {
@@ -3885,8 +3898,8 @@ class st {
 new TextDecoder("utf-8");
 new TextEncoder();
 function Qe(e, t) {
-  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return rn(fe, n, "nip44-v2");
+  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return sn(fe, n, "nip44-v2");
 }
 class Pe {
   constructor(t, n, r, i, s, o, c = []) {
@@ -3941,7 +3954,7 @@ class Pe {
     var o, c;
     if (!t.sig)
       throw new Error("Event is not signed");
-    if (!pt(t))
+    if (!yt(t))
       throw new Error("Event signature is invalid");
     const { tags: n } = t, r = (o = n.find(([a]) => a === "ephemeralKey")) == null ? void 0 : o[1], i = (c = n.find(([a]) => a === "sharedSecret")) == null ? void 0 : c[1], s = t.pubkey;
     if (!r || !i)
@@ -4073,7 +4086,8 @@ export {
   st as Session,
   ou as createEventStream,
   su as deserializeSessionState,
+  au as getMillisecondTimestamp,
   Me as kdf,
   iu as serializeSessionState,
-  It as skippedMessageIndexKey
+  Lt as skippedMessageIndexKey
 };