nostr-double-ratchet 0.0.16 → 0.0.18

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

@@ -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,9 +231,9 @@ let Ui = class extends Ci {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const $t = /* @__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"));
+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");
@@ -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), Yt = (e) => (Ii << BigInt(e - 1)) - ot, Nt = (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");
@@ -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);
@@ -399,7 +399,7 @@ const qi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   bytesToHex: De,
   bytesToNumberBE: F,
   bytesToNumberLE: Ft,
-  concatBytes: Ue,
+  concatBytes: Ie,
   createHmacDrbg: Jn,
   ensureBytes: W,
   equalBytes: Ti,
@@ -671,8 +671,8 @@ function Qi(e, t) {
         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, U = d < 0;
-        d === 0 ? f = f.add(n(A, s[y])) : l = l.add(n(U, s[m]));
+        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 };
@@ -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;
@@ -1051,8 +1051,8 @@ function ss(e) {
   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,13 +1060,13 @@ 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`);
     }
@@ -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), We = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(Q, Le, We);
+      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;
@@ -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);
   }
@@ -1197,14 +1197,14 @@ 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 We = Ue(...Le), we = Q;
+    const We = Ie(...Le), we = Q;
     function mt(Ke) {
       const $e = E(Ke);
       if (!g($e))
@@ -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: 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,7 +1253,7 @@ 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 } = $, 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();
@@ -1320,14 +1320,14 @@ 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);
+  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 Ot = 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: Ot,
@@ -1346,7 +1346,7 @@ const Ot = 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,18 +1354,18 @@ const Ot = Ji(ct, void 0, void 0, { sqrt: ir }), Ie = as({
       return { k1neg: u, k1: l, k2neg: g, k2: f };
     }
   }
-}, $t), 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 = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = Ue(r, r), In[e] = n;
+    n = Ie(r, r), Un[e] = n;
   }
-  return $t(Ue(n, ...t));
+  return $t(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 = Ie.ProjectivePoint, us = (e, t, n) => Qt.BASE.multiplyAndAddUnsafe(e, t, 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 = Ie.utils.normPrivateKeyToScalar(e), n = Qt.fromPrivateKey(t);
+  let t = Ue.utils.normPrivateKeyToScalar(e), n = Qt.fromPrivateKey(t);
   return { scalar: n.hasEvenY() ? t : Fe(-t), bytes: Xt(n) };
 }
 function or(e) {
@@ -1412,7 +1412,7 @@ const Ze = {
   sign: fs,
   verify: cr,
   utils: {
-    randomPrivateKey: Ie.utils.randomPrivateKey,
+    randomPrivateKey: Ue.utils.randomPrivateKey,
     lift_x: or,
     pointToBytes: Xt,
     numberToBytesBE: Ne,
@@ -1979,13 +1979,13 @@ 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,
@@ -1993,7 +1993,7 @@ const _s = {
   base58: Dt,
   base58xmr: ks
 };
-`${Object.keys(Is).join(", ")}`;
+`${Object.keys(Us).join(", ")}`;
 function kt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
@@ -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);
     }
@@ -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,
@@ -2317,7 +2317,7 @@ ht.create = (e, t) => new Kr(e, t);
 function sn(e, t, n) {
   return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), ht(e, Je(n), Je(t));
 }
-const Ut = 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,8 +2325,8 @@ 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++)
-    Ut[0] = l + 1, c.update(l === 0 ? qn : a).update(n).update(Ut).digestInto(a), s.set(a, e.outputLen * l), o._cloneInto(c);
-  return o.destroy(), c.destroy(), a.fill(0), Ut.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)
@@ -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 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;
@@ -2642,7 +2642,7 @@ function gt(e) {
   let { prefix: t, words: n } = ze.decode(e, fn), r = new Uint8Array(ze.fromWords(n));
   switch (t) {
     case "nprofile": {
-      let u = It(r);
+      let u = Ut(r);
       if (!((i = u[0]) != null && i[0]))
         throw new Error("missing TLV 0 for nprofile");
       if (u[0][0].length !== 32)
@@ -2656,7 +2656,7 @@ function gt(e) {
       };
     }
     case "nevent": {
-      let u = It(r);
+      let u = Ut(r);
       if (!((s = u[0]) != null && s[0]))
         throw new Error("missing TLV 0 for nevent");
       if (u[0][0].length !== 32)
@@ -2676,7 +2676,7 @@ function gt(e) {
       };
     }
     case "naddr": {
-      let u = It(r);
+      let u = Ut(r);
       if (!((a = u[0]) != null && a[0]))
         throw new Error("missing TLV 0 for naddr");
       if (!((l = u[2]) != null && l[0]))
@@ -2706,7 +2706,7 @@ function gt(e) {
       throw new Error(`unknown prefix ${t}`);
   }
 }
-function It(e) {
+function Ut(e) {
   let t = {}, n = e;
   for (; n.length > 0; ) {
     let r = n[0], i = n[1], s = n.slice(2, 2 + i);
@@ -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) {
@@ -3224,11 +3224,11 @@ 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);
+  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
   return sn(fe, n, "nip44-v2");
 }
 function ei(e, t) {
@@ -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
 });
@@ -3669,6 +3669,11 @@ function Me(e, t = new Uint8Array(32), n = 1) {
 function Lt(e, t) {
   return `${e}:${t}`;
 }
+function au(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";
 class st {
   // 1. CHANNEL PUBLIC INTERFACE
@@ -3733,22 +3738,22 @@ class st {
       throw new Error("we are not the initiator, so we can't send the first message");
     if ("sig" in t)
       throw new Error("Event must be unsigned " + JSON.stringify(t));
-    const n = {
+    const n = Date.now(), r = {
       ...t,
       content: t.content || "",
       kind: t.kind || Be,
-      created_at: t.created_at || Math.floor(Date.now() / 1e3),
+      created_at: t.created_at || Math.floor(n / 1e3),
       tags: t.tags || [],
       pubkey: t.pubkey || Jc
     };
-    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 X({
-      content: i,
+    r.tags.some(([l]) => l === "ms") || r.tags.push(["ms", String(n)]), r.id = qe(r);
+    const [i, s] = this.ratchetEncrypt(JSON.stringify(r)), o = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNextNostrPublicKey), c = q.encrypt(JSON.stringify(i), o);
+    return { event: X({
+      content: s,
       kind: Be,
-      tags: [["header", o]],
+      tags: [["header", c]],
       created_at: Math.floor(Date.now() / 1e3)
-    }, this.state.ourCurrentNostrKey.privateKey);
+    }, this.state.ourCurrentNostrKey.privateKey), innerEvent: r };
   }
   /**
    * Subscribes to incoming messages on this session
@@ -3894,7 +3899,7 @@ class st {
 new TextDecoder("utf-8");
 new TextEncoder();
 function Qe(e, t) {
-  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
+  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
   return sn(fe, n, "nip44-v2");
 }
 class Pe {
@@ -3952,7 +3957,10 @@ class Pe {
       throw new Error("Event is not signed");
     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;
+    const { tags: n } = t;
+    if (!n)
+      throw new Error("Invalid invite event: missing tags");
+    const 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)
       throw new Error("Invalid invite event: missing session key or sharedSecret");
     return new Pe(
@@ -4082,6 +4090,7 @@ export {
   st as Session,
   ou as createEventStream,
   su as deserializeSessionState,
+  au as getMillisecondTimestamp,
   Me as kdf,
   iu as serializeSessionState,
   Lt as skippedMessageIndexKey