nostr-double-ratchet 0.0.27 → 0.0.28

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

@@ -1,20 +1,20 @@
-var bi = Object.defineProperty;
-var vi = (e, t, n) => t in e ? bi(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var J = (e, t, n) => vi(e, typeof t != "symbol" ? t + "" : t, n);
-function Sn(e) {
+var Ki = Object.defineProperty;
+var Ni = (e, t, n) => t in e ? Ki(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var J = (e, t, n) => Ni(e, typeof t != "symbol" ? t + "" : t, n);
+function Bn(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function zn(e, ...t) {
+function Gn(e, ...t) {
   if (!(e instanceof Uint8Array))
     throw new Error("Expected Uint8Array");
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
 }
-function mi(e) {
+function Si(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Sn(e.outputLen), Sn(e.blockLen);
+  Bn(e.outputLen), Bn(e.blockLen);
 }
 function et(e, t = !0) {
   if (e.destroyed)
@@ -22,70 +22,70 @@ function et(e, t = !0) {
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function Ei(e, t) {
-  zn(e);
+function Ai(e, t) {
+  Gn(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const xt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const Kt = 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, Kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, xi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!xi)
+const Fn = (e) => e instanceof Uint8Array, Nt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Ci = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!Ci)
   throw new Error("Non little-endian hardware is not supported");
-function Ki(e) {
+function Bi(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Wt(e) {
-  if (typeof e == "string" && (e = Ki(e)), !Vn(e))
+function Vt(e) {
+  if (typeof e == "string" && (e = Bi(e)), !Fn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function Ni(...e) {
+function ki(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!Vn(r))
+    if (!Fn(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
 }
-let Wn = class {
+let Jn = class {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 };
-function Si(e) {
-  const t = (r) => e().update(Wt(r)).digest(), n = e();
+function _i(e) {
+  const t = (r) => e().update(Vt(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-function Zn(e = 32) {
-  if (xt && typeof xt.getRandomValues == "function")
-    return xt.getRandomValues(new Uint8Array(e));
+function Yn(e = 32) {
+  if (Kt && typeof Kt.getRandomValues == "function")
+    return Kt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Ai(e, t, n, r) {
+function Ii(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
   const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), c = Number(n & s), a = r ? 4 : 0, l = r ? 0 : 4;
   e.setUint32(t + a, o, r), e.setUint32(t + l, c, r);
 }
-let Ci = class extends Wn {
+let Ui = class extends Jn {
   constructor(t, n, r, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Kt(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 = Nt(this.buffer);
   }
   update(t) {
     et(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Wt(t);
+    t = Vt(t);
     const s = t.length;
     for (let o = 0; o < s; ) {
       const c = Math.min(i - this.pos, s - o);
       if (c === i) {
-        const a = Kt(t);
+        const a = Nt(t);
         for (; i <= s - o; o += i)
           this.process(a, o);
         continue;
@@ -95,14 +95,14 @@ let Ci = class extends Wn {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    et(this), Ei(t, this), this.finished = !0;
+    et(this), Ai(t, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: i, isLE: s } = this;
     let { pos: o } = this;
     n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(r, 0), o = 0);
     for (let u = o; u < i; u++)
       n[u] = 0;
-    Ai(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const c = Kt(t), a = this.outputLen;
+    Ii(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const c = Nt(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = a / 4, f = this.get();
@@ -123,7 +123,7 @@ let Ci = class extends Wn {
     return t.length = i, t.pos = c, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 };
-const Bi = (e, t, n) => e & t ^ ~e & n, ki = (e, t, n) => e & t ^ e & n ^ t & n, _i = /* @__PURE__ */ new Uint32Array([
+const Li = (e, t, n) => e & t ^ ~e & n, $i = (e, t, n) => e & t ^ e & n ^ t & n, Ri = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -198,7 +198,7 @@ const Bi = (e, t, n) => e & t ^ ~e & n, ki = (e, t, n) => e & t ^ e & n ^ t & n,
   528734635,
   1541459225
 ]), ve = /* @__PURE__ */ new Uint32Array(64);
-let Ii = class extends Ci {
+let Ti = class extends Ui {
   constructor() {
     super(64, 32, 8, !1), this.A = be[0] | 0, this.B = be[1] | 0, this.C = be[2] | 0, this.D = be[3] | 0, this.E = be[4] | 0, this.F = be[5] | 0, this.G = be[6] | 0, this.H = be[7] | 0;
   }
@@ -214,12 +214,12 @@ let Ii = class extends Ci {
     for (let u = 0; u < 16; u++, n += 4)
       ve[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const g = ve[u - 15], w = ve[u - 2], p = re(g, 7) ^ re(g, 18) ^ g >>> 3, h = re(w, 17) ^ re(w, 19) ^ w >>> 10;
-      ve[u] = h + ve[u - 7] + p + ve[u - 16] | 0;
+      const g = ve[u - 15], w = ve[u - 2], y = re(g, 7) ^ re(g, 18) ^ g >>> 3, h = re(w, 17) ^ re(w, 19) ^ w >>> 10;
+      ve[u] = h + ve[u - 7] + y + ve[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const g = re(c, 6) ^ re(c, 11) ^ re(c, 25), w = f + g + Bi(c, a, l) + _i[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ki(r, i, s) | 0;
+      const g = re(c, 6) ^ re(c, 11) ^ re(c, 25), w = f + g + Li(c, a, l) + Ri[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + $i(r, i, s) | 0;
       f = l, l = a, a = c, c = o + w | 0, o = s, s = i, i = r, r = w + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
@@ -231,18 +231,18 @@ let Ii = class extends Ci {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const Lt = /* @__PURE__ */ Si(() => new Ii());
+const $t = /* @__PURE__ */ _i(() => new Ti());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Gn = BigInt(0), ot = BigInt(1), Ui = BigInt(2), at = (e) => e instanceof Uint8Array, Li = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const Xn = BigInt(0), at = BigInt(1), Oi = BigInt(2), ct = (e) => e instanceof Uint8Array, Mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function De(e) {
-  if (!at(e))
+  if (!ct(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += Li[e[n]];
+    t += Mi[e[n]];
   return t;
 }
-function Fn(e) {
+function Qn(e) {
   const t = e.toString(16);
   return t.length & 1 ? `0${t}` : t;
 }
@@ -270,7 +270,7 @@ function F(e) {
   return Zt(De(e));
 }
 function Gt(e) {
-  if (!at(e))
+  if (!ct(e))
     throw new Error("Uint8Array expected");
   return Zt(De(Uint8Array.from(e).reverse()));
 }
@@ -280,8 +280,8 @@ function Ne(e, t) {
 function Ft(e, t) {
   return Ne(e, t).reverse();
 }
-function $i(e) {
-  return je(Fn(e));
+function Pi(e) {
+  return je(Qn(e));
 }
 function Z(e, t, n) {
   let r;
@@ -291,7 +291,7 @@ function Z(e, t, n) {
     } catch (s) {
       throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${s}`);
     }
-  else if (at(t))
+  else if (ct(t))
     r = Uint8Array.from(t);
   else
     throw new Error(`${e} must be hex string or Uint8Array`);
@@ -304,12 +304,12 @@ function _e(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!at(r))
+    if (!ct(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
 }
-function Ti(e, t) {
+function Hi(e, t) {
   if (e.length !== t.length)
     return !1;
   for (let n = 0; n < e.length; n++)
@@ -317,33 +317,33 @@ function Ti(e, t) {
       return !1;
   return !0;
 }
-function Ri(e) {
+function qi(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Oi(e) {
+function Di(e) {
   let t;
-  for (t = 0; e > Gn; e >>= ot, t += 1)
+  for (t = 0; e > Xn; e >>= at, t += 1)
     ;
   return t;
 }
-function Pi(e, t) {
-  return e >> BigInt(t) & ot;
+function ji(e, t) {
+  return e >> BigInt(t) & at;
 }
-const Mi = (e, t, n) => e | (n ? ot : Gn) << BigInt(t), Jt = (e) => (Ui << BigInt(e - 1)) - ot, Nt = (e) => new Uint8Array(e), An = (e) => Uint8Array.from(e);
-function Jn(e, t, n) {
+const zi = (e, t, n) => e | (n ? at : Xn) << BigInt(t), Jt = (e) => (Oi << BigInt(e - 1)) - at, St = (e) => new Uint8Array(e), kn = (e) => Uint8Array.from(e);
+function er(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
   if (typeof t != "number" || t < 2)
     throw new Error("qByteLen must be a number");
   if (typeof n != "function")
     throw new Error("hmacFn must be a function");
-  let r = Nt(e), i = Nt(e), s = 0;
+  let r = St(e), i = St(e), s = 0;
   const o = () => {
     r.fill(1), i.fill(0), s = 0;
-  }, c = (...u) => n(i, r, ...u), a = (u = Nt()) => {
-    i = c(An([0]), u), r = c(), u.length !== 0 && (i = c(An([1]), u), r = c());
+  }, c = (...u) => n(i, r, ...u), a = (u = St()) => {
+    i = c(kn([0]), u), r = c(), u.length !== 0 && (i = c(kn([1]), u), r = c());
   }, l = () => {
     if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
@@ -364,7 +364,7 @@ function Jn(e, t, n) {
     return o(), w;
   };
 }
-const Hi = {
+const Wi = {
   bigint: (e) => typeof e == "bigint",
   function: (e) => typeof e == "function",
   boolean: (e) => typeof e == "boolean",
@@ -377,7 +377,7 @@ const Hi = {
 };
 function Ye(e, t, n = {}) {
   const r = (i, s, o) => {
-    const c = Hi[s];
+    const c = Wi[s];
     if (typeof c != "function")
       throw new Error(`Invalid validator "${s}", expected function`);
     const a = e[i];
@@ -390,73 +390,73 @@ function Ye(e, t, n = {}) {
     r(i, s, !0);
   return e;
 }
-const qi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Vi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  bitGet: Pi,
-  bitLen: Oi,
+  bitGet: ji,
+  bitLen: Di,
   bitMask: Jt,
-  bitSet: Mi,
+  bitSet: zi,
   bytesToHex: De,
   bytesToNumberBE: F,
   bytesToNumberLE: Gt,
   concatBytes: _e,
-  createHmacDrbg: Jn,
+  createHmacDrbg: er,
   ensureBytes: Z,
-  equalBytes: Ti,
+  equalBytes: Hi,
   hexToBytes: je,
   hexToNumber: Zt,
   numberToBytesBE: Ne,
   numberToBytesLE: Ft,
-  numberToHexUnpadded: Fn,
-  numberToVarBytesBE: $i,
-  utf8ToBytes: Ri,
+  numberToHexUnpadded: Qn,
+  numberToVarBytesBE: Pi,
+  utf8ToBytes: qi,
   validateObject: Ye
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const V = BigInt(0), j = BigInt(1), Ce = BigInt(2), Di = BigInt(3), $t = BigInt(4), Cn = BigInt(5), Bn = BigInt(8);
+const W = BigInt(0), j = BigInt(1), Ce = BigInt(2), Zi = BigInt(3), Rt = BigInt(4), _n = BigInt(5), In = BigInt(8);
 BigInt(9);
 BigInt(16);
-function W(e, t) {
+function V(e, t) {
   const n = e % t;
-  return n >= V ? n : t + n;
+  return n >= W ? n : t + n;
 }
-function ji(e, t, n) {
-  if (n <= V || t < V)
+function Gi(e, t, n) {
+  if (n <= W || t < W)
     throw new Error("Expected power/modulo > 0");
   if (n === j)
-    return V;
+    return W;
   let r = j;
-  for (; t > V; )
+  for (; t > W; )
     t & j && (r = r * e % n), e = e * e % n, t >>= j;
   return r;
 }
 function Y(e, t, n) {
   let r = e;
-  for (; t-- > V; )
+  for (; t-- > W; )
     r *= r, r %= n;
   return r;
 }
 function Tt(e, t) {
-  if (e === V || t <= V)
+  if (e === W || t <= W)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
-  let n = W(e, t), r = t, i = V, s = j;
-  for (; n !== V; ) {
+  let n = V(e, t), r = t, i = W, s = j;
+  for (; n !== W; ) {
     const c = r / n, a = r % n, l = i - s * c;
     r = n, n = a, i = s, s = l;
   }
   if (r !== j)
     throw new Error("invert: does not exist");
-  return W(i, t);
+  return V(i, t);
 }
-function zi(e) {
+function Fi(e) {
   const t = (e - j) / Ce;
   let n, r, i;
-  for (n = e - j, r = 0; n % Ce === V; n /= Ce, r++)
+  for (n = e - j, r = 0; n % Ce === W; n /= Ce, r++)
     ;
-  for (i = Ce; i < e && ji(i, t, e) !== e - j; i++)
+  for (i = Ce; i < e && Gi(i, t, e) !== e - j; i++)
     ;
   if (r === 1) {
-    const o = (e + j) / $t;
+    const o = (e + j) / Rt;
     return function(a, l) {
       const f = a.pow(l, o);
       if (!a.eql(a.sqr(f), l))
@@ -475,15 +475,15 @@ function zi(e) {
       let w = 1;
       for (let h = c.sqr(g); w < l && !c.eql(h, c.ONE); w++)
         h = c.sqr(h);
-      const p = c.pow(f, j << BigInt(l - w - 1));
-      f = c.sqr(p), u = c.mul(u, p), g = c.mul(g, f), l = w;
+      const y = c.pow(f, j << BigInt(l - w - 1));
+      f = c.sqr(y), u = c.mul(u, y), g = c.mul(g, f), l = w;
     }
     return u;
   };
 }
-function Vi(e) {
-  if (e % $t === Di) {
-    const t = (e + j) / $t;
+function Ji(e) {
+  if (e % Rt === Zi) {
+    const t = (e + j) / Rt;
     return function(r, i) {
       const s = r.pow(i, t);
       if (!r.eql(r.sqr(s), i))
@@ -491,8 +491,8 @@ function Vi(e) {
       return s;
     };
   }
-  if (e % Bn === Cn) {
-    const t = (e - Cn) / Bn;
+  if (e % In === _n) {
+    const t = (e - _n) / In;
     return function(r, i) {
       const s = r.mul(i, Ce), o = r.pow(s, t), c = r.mul(i, o), a = r.mul(r.mul(c, Ce), o), l = r.mul(c, r.sub(a, r.ONE));
       if (!r.eql(r.sqr(l), i))
@@ -500,9 +500,9 @@ function Vi(e) {
       return l;
     };
   }
-  return zi(e);
+  return Fi(e);
 }
-const Wi = [
+const Yi = [
   "create",
   "isValid",
   "is0",
@@ -521,64 +521,64 @@ const Wi = [
   "mulN",
   "sqrN"
 ];
-function Zi(e) {
+function Xi(e) {
   const t = {
     ORDER: "bigint",
     MASK: "bigint",
     BYTES: "isSafeInteger",
     BITS: "isSafeInteger"
-  }, n = Wi.reduce((r, i) => (r[i] = "function", r), t);
+  }, n = Yi.reduce((r, i) => (r[i] = "function", r), t);
   return Ye(e, n);
 }
-function Gi(e, t, n) {
-  if (n < V)
+function Qi(e, t, n) {
+  if (n < W)
     throw new Error("Expected power > 0");
-  if (n === V)
+  if (n === W)
     return e.ONE;
   if (n === j)
     return t;
   let r = e.ONE, i = t;
-  for (; n > V; )
+  for (; n > W; )
     n & j && (r = e.mul(r, i)), i = e.sqr(i), n >>= j;
   return r;
 }
-function Fi(e, t) {
+function es(e, t) {
   const n = new Array(t.length), r = t.reduce((s, o, c) => e.is0(o) ? s : (n[c] = s, e.mul(s, o)), e.ONE), i = e.inv(r);
   return t.reduceRight((s, o, c) => e.is0(o) ? s : (n[c] = e.mul(s, n[c]), e.mul(s, o)), i), n;
 }
-function Yn(e, t) {
+function tr(e, t) {
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
   return { nBitLength: n, nByteLength: r };
 }
-function Ji(e, t, n = !1, r = {}) {
-  if (e <= V)
+function ts(e, t, n = !1, r = {}) {
+  if (e <= W)
     throw new Error(`Expected Field ORDER > 0, got ${e}`);
-  const { nBitLength: i, nByteLength: s } = Yn(e, t);
+  const { nBitLength: i, nByteLength: s } = tr(e, t);
   if (s > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const o = Vi(e), c = Object.freeze({
+  const o = Ji(e), c = Object.freeze({
     ORDER: e,
     BITS: i,
     BYTES: s,
     MASK: Jt(i),
-    ZERO: V,
+    ZERO: W,
     ONE: j,
-    create: (a) => W(a, e),
+    create: (a) => V(a, e),
     isValid: (a) => {
       if (typeof a != "bigint")
         throw new Error(`Invalid field element: expected bigint, got ${typeof a}`);
-      return V <= a && a < e;
+      return W <= a && a < e;
     },
-    is0: (a) => a === V,
+    is0: (a) => a === W,
     isOdd: (a) => (a & j) === j,
-    neg: (a) => W(-a, e),
+    neg: (a) => V(-a, e),
     eql: (a, l) => a === l,
-    sqr: (a) => W(a * a, e),
-    add: (a, l) => W(a + l, e),
-    sub: (a, l) => W(a - l, e),
-    mul: (a, l) => W(a * l, e),
-    pow: (a, l) => Gi(c, a, l),
-    div: (a, l) => W(a * Tt(l, e), e),
+    sqr: (a) => V(a * a, e),
+    add: (a, l) => V(a + l, e),
+    sub: (a, l) => V(a - l, e),
+    mul: (a, l) => V(a * l, e),
+    pow: (a, l) => Qi(c, a, l),
+    div: (a, l) => V(a * Tt(l, e), e),
     // Same as above, but doesn't normalize
     sqrN: (a) => a * a,
     addN: (a, l) => a + l,
@@ -586,7 +586,7 @@ function Ji(e, t, n = !1, r = {}) {
     mulN: (a, l) => a * l,
     inv: (a) => Tt(a, e),
     sqrt: r.sqrt || ((a) => o(c, a)),
-    invertBatch: (a) => Fi(c, a),
+    invertBatch: (a) => es(c, a),
     // TODO: do we really need constant cmov?
     // We don't have const-time bigints anyway, so probably will be not very useful
     cmov: (a, l, f) => f ? l : a,
@@ -599,26 +599,26 @@ function Ji(e, t, n = !1, r = {}) {
   });
   return Object.freeze(c);
 }
-function Xn(e) {
+function nr(e) {
   if (typeof e != "bigint")
     throw new Error("field order must be bigint");
   const t = e.toString(2).length;
   return Math.ceil(t / 8);
 }
-function Qn(e) {
-  const t = Xn(e);
+function rr(e) {
+  const t = nr(e);
   return t + Math.ceil(t / 2);
 }
-function Yi(e, t, n = !1) {
-  const r = e.length, i = Xn(t), s = Qn(t);
+function ns(e, t, n = !1) {
+  const r = e.length, i = nr(t), s = rr(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error(`expected ${s}-1024 bytes of input, got ${r}`);
-  const o = n ? F(e) : Gt(e), c = W(o, t - j) + j;
+  const o = n ? F(e) : Gt(e), c = V(o, t - j) + j;
   return n ? Ft(c, i) : Ne(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Xi = BigInt(0), St = BigInt(1);
-function Qi(e, t) {
+const rs = BigInt(0), At = BigInt(1);
+function is(e, t) {
   const n = (i, s) => {
     const o = s.negate();
     return i ? o : s;
@@ -631,8 +631,8 @@ function Qi(e, t) {
     // non-const time multiplication ladder
     unsafeLadder(i, s) {
       let o = e.ZERO, c = i;
-      for (; s > Xi; )
-        s & St && (o = o.add(c)), c = c.double(), s >>= St;
+      for (; s > rs; )
+        s & At && (o = o.add(c)), c = c.double(), s >>= At;
       return o;
     },
     /**
@@ -667,12 +667,12 @@ function Qi(e, t) {
       const { windows: c, windowSize: a } = r(i);
       let l = e.ZERO, f = e.BASE;
       const u = BigInt(2 ** i - 1), g = 2 ** i, w = BigInt(i);
-      for (let p = 0; p < c; p++) {
-        const h = p * a;
+      for (let y = 0; y < c; y++) {
+        const h = y * a;
         let d = Number(o & u);
-        o >>= w, d > a && (d -= g, o += St);
-        const y = h, E = h + Math.abs(d) - 1, S = p % 2 !== 0, I = d < 0;
-        d === 0 ? f = f.add(n(S, s[y])) : l = l.add(n(I, s[E]));
+        o >>= w, d > a && (d -= g, o += At);
+        const p = h, E = h + Math.abs(d) - 1, S = y % 2 !== 0, I = d < 0;
+        d === 0 ? f = f.add(n(S, s[p])) : l = l.add(n(I, s[E]));
       }
       return { p: l, f };
     },
@@ -683,8 +683,8 @@ function Qi(e, t) {
     }
   };
 }
-function er(e) {
-  return Zi(e.Fp), Ye(e, {
+function ir(e) {
+  return Xi(e.Fp), Ye(e, {
     n: "bigint",
     h: "bigint",
     Gx: "field",
@@ -693,14 +693,14 @@ function er(e) {
     nBitLength: "isSafeInteger",
     nByteLength: "isSafeInteger"
   }), Object.freeze({
-    ...Yn(e.n, e.nBitLength),
+    ...tr(e.n, e.nBitLength),
     ...e,
     p: e.Fp.ORDER
   });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function es(e) {
-  const t = er(e);
+function ss(e) {
+  const t = ir(e);
   Ye(t, {
     a: "field",
     b: "field"
@@ -722,7 +722,7 @@ function es(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: ts, hexToBytes: ns } = qi, Be = {
+const { bytesToNumberBE: os, hexToBytes: as } = Vi, Be = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -740,10 +740,10 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, Be = {
       throw new t("Invalid signature integer: negative");
     if (r[0] === 0 && !(r[1] & 128))
       throw new t("Invalid signature integer: unnecessary leading zero");
-    return { d: ts(r), l: e.subarray(n + 2) };
+    return { d: os(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = Be, n = typeof e == "string" ? ns(e) : e;
+    const { Err: t } = Be, n = typeof e == "string" ? as(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -763,70 +763,70 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, Be = {
     }, r = t(n(e.s)), i = t(n(e.r)), s = r.length / 2, o = i.length / 2, c = n(s), a = n(o);
     return `30${n(o + s + 4)}02${a}${i}02${c}${r}`;
   }
-}, ae = BigInt(0), X = BigInt(1);
+}, ce = BigInt(0), X = BigInt(1);
 BigInt(2);
-const kn = BigInt(3);
+const Un = BigInt(3);
 BigInt(4);
-function rs(e) {
-  const t = es(e), { Fp: n } = t, r = t.toBytes || ((p, h, d) => {
-    const y = h.toAffine();
-    return _e(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 };
+function cs(e) {
+  const t = ss(e), { Fp: n } = t, r = t.toBytes || ((y, h, d) => {
+    const p = h.toAffine();
+    return _e(Uint8Array.from([4]), n.toBytes(p.x), n.toBytes(p.y));
+  }), i = t.fromBytes || ((y) => {
+    const h = y.subarray(1), d = n.fromBytes(h.subarray(0, n.BYTES)), p = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
+    return { x: d, y: p };
   });
-  function s(p) {
-    const { a: h, b: d } = t, y = n.sqr(p), E = n.mul(y, p);
-    return n.add(n.add(E, n.mul(p, h)), d);
+  function s(y) {
+    const { a: h, b: d } = t, p = n.sqr(y), E = n.mul(p, y);
+    return n.add(n.add(E, n.mul(y, h)), d);
   }
   if (!n.eql(n.sqr(t.Gy), s(t.Gx)))
     throw new Error("bad generator point: equation left != right");
-  function o(p) {
-    return typeof p == "bigint" && ae < p && p < t.n;
+  function o(y) {
+    return typeof y == "bigint" && ce < y && y < t.n;
   }
-  function c(p) {
-    if (!o(p))
+  function c(y) {
+    if (!o(y))
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
-  function a(p) {
-    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: y, n: E } = t;
-    if (h && typeof p != "bigint") {
-      if (p instanceof Uint8Array && (p = De(p)), typeof p != "string" || !h.includes(p.length))
+  function a(y) {
+    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: p, n: E } = t;
+    if (h && typeof y != "bigint") {
+      if (y instanceof Uint8Array && (y = De(y)), typeof y != "string" || !h.includes(y.length))
         throw new Error("Invalid key");
-      p = p.padStart(d * 2, "0");
+      y = y.padStart(d * 2, "0");
     }
     let S;
     try {
-      S = typeof p == "bigint" ? p : F(Z("private key", p, d));
+      S = typeof y == "bigint" ? y : F(Z("private key", y, d));
     } catch {
-      throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof p}`);
+      throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof y}`);
     }
-    return y && (S = W(S, E)), c(S), S;
+    return p && (S = V(S, E)), c(S), S;
   }
   const l = /* @__PURE__ */ new Map();
-  function f(p) {
-    if (!(p instanceof u))
+  function f(y) {
+    if (!(y instanceof u))
       throw new Error("ProjectivePoint expected");
   }
   class u {
-    constructor(h, d, y) {
-      if (this.px = h, this.py = d, this.pz = y, h == null || !n.isValid(h))
+    constructor(h, d, p) {
+      if (this.px = h, this.py = d, this.pz = p, h == null || !n.isValid(h))
         throw new Error("x required");
       if (d == null || !n.isValid(d))
         throw new Error("y required");
-      if (y == null || !n.isValid(y))
+      if (p == null || !n.isValid(p))
         throw new Error("z required");
     }
     // Does not validate if the point is on-curve.
     // Use fromHex instead, or call assertValidity() later.
     static fromAffine(h) {
-      const { x: d, y } = h || {};
-      if (!h || !n.isValid(d) || !n.isValid(y))
+      const { x: d, y: p } = h || {};
+      if (!h || !n.isValid(d) || !n.isValid(p))
         throw new Error("invalid affine point");
       if (h instanceof u)
         throw new Error("projective point not allowed");
       const E = (S) => n.eql(S, n.ZERO);
-      return E(d) && E(y) ? u.ZERO : new u(d, y, n.ONE);
+      return E(d) && E(p) ? u.ZERO : new u(d, p, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -841,8 +841,8 @@ function rs(e) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(h) {
-      const d = n.invertBatch(h.map((y) => y.pz));
-      return h.map((y, E) => y.toAffine(d[E])).map(u.fromAffine);
+      const d = n.invertBatch(h.map((p) => p.pz));
+      return h.map((p, E) => p.toAffine(d[E])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
@@ -870,8 +870,8 @@ function rs(e) {
       const { x: h, y: d } = this.toAffine();
       if (!n.isValid(h) || !n.isValid(d))
         throw new Error("bad point: x or y not FE");
-      const y = n.sqr(d), E = s(h);
-      if (!n.eql(y, E))
+      const p = n.sqr(d), E = s(h);
+      if (!n.eql(p, E))
         throw new Error("bad point: equation left != right");
       if (!this.isTorsionFree())
         throw new Error("bad point: not in prime-order subgroup");
@@ -887,7 +887,7 @@ function rs(e) {
      */
     equals(h) {
       f(h);
-      const { px: d, py: y, pz: E } = this, { px: S, py: I, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(S, E)), x = n.eql(n.mul(y, B), n.mul(I, E));
+      const { px: d, py: p, pz: E } = this, { px: S, py: I, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(S, E)), x = n.eql(n.mul(p, B), n.mul(I, E));
       return m && x;
     }
     /**
@@ -901,9 +901,9 @@ function rs(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: h, b: d } = t, y = n.mul(d, kn), { px: E, py: S, pz: I } = this;
+      const { a: h, b: d } = t, p = n.mul(d, Un), { px: E, py: S, pz: I } = this;
       let B = n.ZERO, m = n.ZERO, x = n.ZERO, K = n.mul(E, E), M = n.mul(S, S), _ = n.mul(I, I), A = n.mul(E, S);
-      return A = n.add(A, A), x = n.mul(E, I), x = n.add(x, x), B = n.mul(h, x), m = n.mul(y, _), m = n.add(B, m), B = n.sub(M, m), m = n.add(M, m), m = n.mul(B, m), B = n.mul(A, B), x = n.mul(y, x), _ = n.mul(h, _), A = n.sub(K, _), A = n.mul(h, A), A = n.add(A, x), x = n.add(K, K), K = n.add(x, K), K = n.add(K, _), K = n.mul(K, A), m = n.add(m, K), _ = n.mul(S, I), _ = n.add(_, _), K = n.mul(_, A), B = n.sub(B, K), x = n.mul(_, M), x = n.add(x, x), x = n.add(x, x), new u(B, m, x);
+      return A = n.add(A, A), x = n.mul(E, I), x = n.add(x, x), B = n.mul(h, x), m = n.mul(p, _), m = n.add(B, m), B = n.sub(M, m), m = n.add(M, m), m = n.mul(B, m), B = n.mul(A, B), x = n.mul(p, x), _ = n.mul(h, _), A = n.sub(K, _), A = n.mul(h, A), A = n.add(A, x), x = n.add(K, K), K = n.add(x, K), K = n.add(K, _), K = n.mul(K, A), m = n.add(m, K), _ = n.mul(S, I), _ = n.add(_, _), K = n.mul(_, A), B = n.sub(B, K), x = n.mul(_, M), x = n.add(x, x), x = n.add(x, x), new u(B, m, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function rs(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: d, py: y, pz: E } = this, { px: S, py: I, pz: B } = h;
+      const { px: d, py: p, pz: E } = this, { px: S, py: I, pz: B } = h;
       let m = n.ZERO, x = n.ZERO, K = n.ZERO;
-      const M = t.a, _ = n.mul(t.b, kn);
-      let A = n.mul(d, S), T = n.mul(y, I), R = n.mul(E, B), H = n.add(d, y), b = n.add(S, I);
-      H = n.mul(H, b), b = n.add(A, T), H = n.sub(H, b), b = n.add(d, E);
+      const M = t.a, _ = n.mul(t.b, Un);
+      let A = n.mul(d, S), R = n.mul(p, I), T = n.mul(E, B), q = n.add(d, p), b = n.add(S, I);
+      q = n.mul(q, b), b = n.add(A, R), q = n.sub(q, b), b = n.add(d, E);
       let v = n.add(S, B);
-      return b = n.mul(b, v), v = n.add(A, R), b = n.sub(b, v), v = n.add(y, E), m = n.add(I, B), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), K = n.mul(M, b), m = n.mul(_, R), K = n.add(m, K), m = n.sub(T, K), K = n.add(T, K), x = n.mul(m, K), T = n.add(A, A), T = n.add(T, A), R = n.mul(M, R), b = n.mul(_, b), T = n.add(T, R), R = n.sub(A, R), R = n.mul(M, R), b = n.add(b, R), A = n.mul(T, b), x = n.add(x, A), A = n.mul(v, b), m = n.mul(H, m), m = n.sub(m, A), A = n.mul(H, T), K = n.mul(v, K), K = n.add(K, A), new u(m, x, K);
+      return b = n.mul(b, v), v = n.add(A, T), b = n.sub(b, v), v = n.add(p, E), m = n.add(I, B), v = n.mul(v, m), m = n.add(R, T), v = n.sub(v, m), K = n.mul(M, b), m = n.mul(_, T), K = n.add(m, K), m = n.sub(R, K), K = n.add(R, K), x = n.mul(m, K), R = n.add(A, A), R = n.add(R, A), T = n.mul(M, T), b = n.mul(_, b), R = n.add(R, T), T = n.sub(A, T), T = n.mul(M, T), b = n.add(b, T), A = n.mul(R, b), x = n.add(x, A), A = n.mul(v, b), m = n.mul(q, m), m = n.sub(m, A), A = n.mul(q, R), K = n.mul(v, K), K = n.add(K, A), new u(m, x, K);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -927,8 +927,8 @@ function rs(e) {
     }
     wNAF(h) {
       return w.wNAFCached(this, l, h, (d) => {
-        const y = n.invertBatch(d.map((E) => E.pz));
-        return d.map((E, S) => E.toAffine(y[S])).map(u.fromAffine);
+        const p = n.invertBatch(d.map((E) => E.pz));
+        return d.map((E, S) => E.toAffine(p[S])).map(u.fromAffine);
       });
     }
     /**
@@ -938,17 +938,17 @@ function rs(e) {
      */
     multiplyUnsafe(h) {
       const d = u.ZERO;
-      if (h === ae)
+      if (h === ce)
         return d;
       if (c(h), h === X)
         return this;
-      const { endo: y } = t;
-      if (!y)
+      const { endo: p } = t;
+      if (!p)
         return w.unsafeLadder(this, h);
-      let { k1neg: E, k1: S, k2neg: I, k2: B } = y.splitScalar(h), m = d, x = d, K = this;
-      for (; S > ae || B > ae; )
+      let { k1neg: E, k1: S, k2neg: I, k2: B } = p.splitScalar(h), m = d, x = d, K = this;
+      for (; S > ce || B > ce; )
         S & X && (m = m.add(K)), B & X && (x = x.add(K)), K = K.double(), S >>= X, B >>= X;
-      return E && (m = m.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, y.beta), x.py, x.pz), m.add(x);
+      return E && (m = m.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, p.beta), x.py, x.pz), m.add(x);
     }
     /**
      * Constant time multiplication.
@@ -961,17 +961,17 @@ function rs(e) {
      */
     multiply(h) {
       c(h);
-      let d = h, y, E;
+      let d = h, p, E;
       const { endo: S } = t;
       if (S) {
         const { k1neg: I, k1: B, k2neg: m, k2: x } = S.splitScalar(d);
         let { p: K, f: M } = this.wNAF(B), { p: _, f: A } = this.wNAF(x);
-        K = w.constTimeNegate(I, K), _ = w.constTimeNegate(m, _), _ = new u(n.mul(_.px, S.beta), _.py, _.pz), y = K.add(_), E = M.add(A);
+        K = w.constTimeNegate(I, K), _ = w.constTimeNegate(m, _), _ = new u(n.mul(_.px, S.beta), _.py, _.pz), p = K.add(_), E = M.add(A);
       } else {
         const { p: I, f: B } = this.wNAF(d);
-        y = I, E = B;
+        p = I, E = B;
       }
-      return u.normalizeZ([y, E])[0];
+      return u.normalizeZ([p, E])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -979,17 +979,17 @@ function rs(e) {
      * The trick could be useful if both P and Q are not G (not in our case).
      * @returns non-zero affine point
      */
-    multiplyAndAddUnsafe(h, d, y) {
-      const E = u.BASE, S = (B, m) => m === ae || m === X || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), I = S(this, d).add(S(h, y));
+    multiplyAndAddUnsafe(h, d, p) {
+      const E = u.BASE, S = (B, m) => m === ce || m === X || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), I = S(this, d).add(S(h, p));
       return I.is0() ? void 0 : I;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
     // (x, y, z) ∋ (x=x/z, y=y/z)
     toAffine(h) {
-      const { px: d, py: y, pz: E } = this, S = this.is0();
+      const { px: d, py: p, pz: E } = this, S = this.is0();
       h == null && (h = S ? n.ONE : n.inv(E));
-      const I = n.mul(d, h), B = n.mul(y, h), m = n.mul(E, h);
+      const I = n.mul(d, h), B = n.mul(p, h), m = n.mul(E, h);
       if (S)
         return { x: n.ZERO, y: n.ZERO };
       if (!n.eql(m, n.ONE))
@@ -1016,7 +1016,7 @@ function rs(e) {
     }
   }
   u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
-  const g = t.nBitLength, w = Qi(u, t.endo ? Math.ceil(g / 2) : g);
+  const g = t.nBitLength, w = is(u, t.endo ? Math.ceil(g / 2) : g);
   return {
     CURVE: t,
     ProjectivePoint: u,
@@ -1025,8 +1025,8 @@ function rs(e) {
     isWithinCurveOrder: o
   };
 }
-function is(e) {
-  const t = er(e);
+function us(e) {
+  const t = ir(e);
   return Ye(t, {
     hash: "hash",
     hmac: "function",
@@ -1037,18 +1037,18 @@ function is(e) {
     lowS: "boolean"
   }), Object.freeze({ lowS: !0, ...t });
 }
-function ss(e) {
-  const t = is(e), { Fp: n, n: r } = t, i = n.BYTES + 1, s = 2 * n.BYTES + 1;
+function ls(e) {
+  const t = us(e), { Fp: n, n: r } = t, i = n.BYTES + 1, s = 2 * n.BYTES + 1;
   function o(b) {
-    return ae < b && b < n.ORDER;
+    return ce < b && b < n.ORDER;
   }
   function c(b) {
-    return W(b, r);
+    return V(b, r);
   }
   function a(b) {
     return Tt(b, r);
   }
-  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: g } = rs({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: g } = cs({
     ...t,
     toBytes(b, v, N) {
       const k = v.toAffine(), C = n.toBytes(k.x), U = _e;
@@ -1071,28 +1071,28 @@ function ss(e) {
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${s} uncompressed bytes`);
     }
   }), w = (b) => De(Ne(b, t.nByteLength));
-  function p(b) {
+  function y(b) {
     const v = r >> X;
     return b > v;
   }
   function h(b) {
-    return p(b) ? c(-b) : b;
+    return y(b) ? c(-b) : b;
   }
   const d = (b, v, N) => F(b.slice(v, N));
-  class y {
+  class p {
     constructor(v, N, k) {
       this.r = v, this.s = N, this.recovery = k, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
       const N = t.nByteLength;
-      return v = Z("compactSignature", v, N * 2), new y(d(v, 0, N), d(v, N, 2 * N));
+      return v = Z("compactSignature", v, N * 2), new p(d(v, 0, N), d(v, N, 2 * N));
     }
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
     static fromDER(v) {
       const { r: N, s: k } = Be.toSig(Z("DER", v));
-      return new y(N, k);
+      return new p(N, k);
     }
     assertValidity() {
       if (!g(this.r))
@@ -1101,7 +1101,7 @@ function ss(e) {
         throw new Error("s must be 0 < s < CURVE.n");
     }
     addRecoveryBit(v) {
-      return new y(this.r, this.s, v);
+      return new p(this.r, this.s, v);
     }
     recoverPublicKey(v) {
       const { r: N, s: k, recovery: C } = this, U = x(Z("msgHash", v));
@@ -1110,17 +1110,17 @@ function ss(e) {
       const O = C === 2 || C === 3 ? N + t.n : N;
       if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const $ = C & 1 ? "03" : "02", ee = l.fromHex($ + w(O)), ge = a(O), Ue = c(-U * ge), We = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(ee, Ue, We);
+      const $ = (C & 1) === 0 ? "02" : "03", ee = l.fromHex($ + w(O)), ge = a(O), Ue = c(-U * ge), Ve = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(ee, Ue, Ve);
       if (!we)
         throw new Error("point at infinify");
       return we.assertValidity(), we;
     }
     // Signatures should be low-s, to prevent malleability.
     hasHighS() {
-      return p(this.s);
+      return y(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new y(this.r, c(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new p(this.r, c(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
@@ -1151,8 +1151,8 @@ function ss(e) {
      * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
      */
     randomPrivateKey: () => {
-      const b = Qn(t.n);
-      return Yi(t.randomBytes(b), t.n);
+      const b = rr(t.n);
+      return ns(t.randomBytes(b), t.n);
     },
     /**
      * Creates precompute table for an arbitrary EC point. Makes point "cached".
@@ -1189,7 +1189,7 @@ function ss(e) {
   function M(b) {
     if (typeof b != "bigint")
       throw new Error("bigint expected");
-    if (!(ae <= b && b < K))
+    if (!(ce <= b && b < K))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
     return Ne(b, t.nByteLength);
   }
@@ -1204,29 +1204,29 @@ function ss(e) {
       const Ae = $ === !0 ? C(n.BYTES) : $;
       Ue.push(Z("extraEntropy", Ae));
     }
-    const We = _e(...Ue), we = ee;
-    function Et(Ae) {
+    const Ve = _e(...Ue), we = ee;
+    function xt(Ae) {
       const Le = m(Ae);
       if (!g(Le))
         return;
-      const xn = a(Le), $e = l.BASE.multiply(Le).toAffine(), te = c($e.x);
-      if (te === ae)
+      const Sn = a(Le), $e = l.BASE.multiply(Le).toAffine(), te = c($e.x);
+      if (te === ce)
         return;
-      const Te = c(xn * c(we + te * ge));
-      if (Te === ae)
+      const Re = c(Sn * c(we + te * ge));
+      if (Re === ce)
         return;
-      let Kn = ($e.x === te ? 0 : 2) | Number($e.y & X), Nn = Te;
-      return U && p(Te) && (Nn = h(Te), Kn ^= 1), new y(te, Nn, Kn);
+      let An = ($e.x === te ? 0 : 2) | Number($e.y & X), Cn = Re;
+      return U && y(Re) && (Cn = h(Re), An ^= 1), new p(te, Cn, An);
     }
-    return { seed: We, k2sig: Et };
+    return { seed: Ve, k2sig: xt };
   }
-  const A = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
-  function R(b, v, N = A) {
+  const A = { lowS: t.lowS, prehash: !1 }, R = { lowS: t.lowS, prehash: !1 };
+  function T(b, v, N = A) {
     const { seed: k, k2sig: C } = _(b, v, N), U = t;
-    return Jn(U.hash.outputLen, U.nByteLength, U.hmac)(k, C);
+    return er(U.hash.outputLen, U.nByteLength, U.hmac)(k, C);
   }
   l.BASE._setWindowSize(8);
-  function H(b, v, N, k = T) {
+  function q(b, v, N, k = R) {
     var $e;
     const C = b;
     if (v = Z("msgHash", v), N = Z("publicKey", N), "strict" in k)
@@ -1236,15 +1236,15 @@ function ss(e) {
     try {
       if (typeof C == "string" || C instanceof Uint8Array)
         try {
-          $ = y.fromDER(C);
+          $ = p.fromDER(C);
         } catch (te) {
           if (!(te instanceof Be.Err))
             throw te;
-          $ = y.fromCompact(C);
+          $ = p.fromCompact(C);
         }
       else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
-        const { r: te, s: Te } = C;
-        $ = new y(te, Te);
+        const { r: te, s: Re } = C;
+        $ = new p(te, Re);
       } else
         throw new Error("PARSE");
       ee = l.fromHex(N);
@@ -1256,24 +1256,24 @@ function ss(e) {
     if (U && $.hasHighS())
       return !1;
     O && (v = t.hash(v));
-    const { r: ge, s: Ue } = $, We = x(v), we = a(Ue), Et = c(We * we), Ae = c(ge * we), Le = ($e = l.BASE.multiplyAndAddUnsafe(ee, Et, Ae)) == null ? void 0 : $e.toAffine();
+    const { r: ge, s: Ue } = $, Ve = x(v), we = a(Ue), xt = c(Ve * we), Ae = c(ge * we), Le = ($e = l.BASE.multiplyAndAddUnsafe(ee, xt, Ae)) == null ? void 0 : $e.toAffine();
     return Le ? c(Le.x) === ge : !1;
   }
   return {
     CURVE: t,
     getPublicKey: S,
     getSharedSecret: B,
-    sign: R,
-    verify: H,
+    sign: T,
+    verify: q,
     ProjectivePoint: l,
-    Signature: y,
+    Signature: p,
     utils: E
   };
 }
-let tr = class extends Wn {
+let sr = class extends Jn {
   constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, mi(t);
-    const r = Wt(n);
+    super(), this.finished = !1, this.destroyed = !1, Si(t);
+    const r = Vt(n);
     if (this.iHash = t.create(), typeof this.iHash.update != "function")
       throw new Error("Expected instance of class which extends utils.Hash");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
@@ -1290,7 +1290,7 @@ let tr = class extends Wn {
     return et(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    et(this), zn(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    et(this), Gn(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
   }
   digest() {
     const t = new Uint8Array(this.oHash.outputLen);
@@ -1305,32 +1305,32 @@ let tr = class extends Wn {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 };
-const nr = (e, t, n) => new tr(e, t).update(n).digest();
-nr.create = (e, t) => new tr(e, t);
+const or = (e, t, n) => new sr(e, t).update(n).digest();
+or.create = (e, t) => new sr(e, t);
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function os(e) {
+function fs(e) {
   return {
     hash: e,
-    hmac: (t, ...n) => nr(e, t, Ni(...n)),
-    randomBytes: Zn
+    hmac: (t, ...n) => or(e, t, ki(...n)),
+    randomBytes: Yn
   };
 }
-function as(e, t) {
-  const n = (r) => ss({ ...e, ...os(r) });
+function hs(e, t) {
+  const n = (r) => ls({ ...e, ...fs(r) });
   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), _n = (e, t) => (e + t / nt) / t;
-function ir(e) {
-  const t = ct, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = Y(f, n, t) * f % t, g = Y(u, n, t) * f % t, w = Y(g, nt, t) * l % t, p = Y(w, i, t) * w % t, h = Y(p, s, t) * p % t, d = Y(h, c, t) * h % t, y = Y(d, a, t) * d % t, E = Y(y, c, t) * h % t, S = Y(E, n, t) * f % t, I = Y(S, o, t) * p % t, B = Y(I, r, t) * l % t, m = Y(B, nt, t);
-  if (!Rt.eql(Rt.sqr(m), e))
+const ut = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), ar = BigInt(1), nt = BigInt(2), Ln = (e, t) => (e + t / nt) / t;
+function cr(e) {
+  const t = ut, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = Y(f, n, t) * f % t, g = Y(u, n, t) * f % t, w = Y(g, nt, t) * l % t, y = Y(w, i, t) * w % t, h = Y(y, s, t) * y % t, d = Y(h, c, t) * h % t, p = Y(d, a, t) * d % t, E = Y(p, c, t) * h % t, S = Y(E, n, t) * f % t, I = Y(S, o, t) * y % t, B = Y(I, r, t) * l % t, m = Y(B, nt, t);
+  if (!Ot.eql(Ot.sqr(m), e))
     throw new Error("Cannot find square root");
   return m;
 }
-const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), Ie = as({
+const Ot = ts(ut, void 0, void 0, { sqrt: cr }), Ie = hs({
   a: BigInt(0),
   b: BigInt(7),
-  Fp: Rt,
+  Fp: Ot,
   n: tt,
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
@@ -1346,92 +1346,92 @@ 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 = _n(s * e, t), a = _n(-r * e, t);
-      let l = W(e - c * n - a * i, t), f = W(-c * r - a * s, t);
+      const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -ar * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = Ln(s * e, t), a = Ln(-r * e, t);
+      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)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
       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), lt = BigInt(0), ur = (e) => typeof e == "bigint" && lt < e && e < ut, ds = (e) => typeof e == "bigint" && lt < e && e < tt, $n = {};
 function rt(e, ...t) {
-  let n = In[e];
+  let n = $n[e];
   if (n === void 0) {
-    const r = Lt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = _e(r, r), In[e] = n;
+    const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    n = _e(r, r), $n[e] = n;
   }
-  return Lt(_e(n, ...t));
+  return $t(_e(n, ...t));
 }
-const Yt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => Ne(e, 32), At = (e) => W(e, ct), Fe = (e) => W(e, tt), Xt = Ie.ProjectivePoint, us = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
+const Yt = (e) => e.toRawBytes(!0).slice(1), Mt = (e) => Ne(e, 32), Ct = (e) => V(e, ut), Fe = (e) => V(e, tt), Xt = Ie.ProjectivePoint, ps = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
 function Pt(e) {
   let t = Ie.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
   return { scalar: n.hasEvenY() ? t : Fe(-t), bytes: Yt(n) };
 }
-function or(e) {
-  if (!sr(e))
+function lr(e) {
+  if (!ur(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = At(e * e), n = At(t * e + BigInt(7));
-  let r = ir(n);
-  r % nt !== ut && (r = At(-r));
-  const i = new Xt(e, r, rr);
+  const t = Ct(e * e), n = Ct(t * e + BigInt(7));
+  let r = cr(n);
+  r % nt !== lt && (r = Ct(-r));
+  const i = new Xt(e, r, ar);
   return i.assertValidity(), i;
 }
-function ar(...e) {
+function fr(...e) {
   return Fe(F(rt("BIP0340/challenge", ...e)));
 }
-function ls(e) {
+function ys(e) {
   return Pt(e).bytes;
 }
-function fs(e, t, n = Zn(32)) {
-  const r = Z("message", e), { bytes: i, scalar: s } = Pt(t), o = Z("auxRand", n, 32), c = Ot(s ^ F(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Fe(F(a));
-  if (l === ut)
+function gs(e, t, n = Yn(32)) {
+  const r = Z("message", e), { bytes: i, scalar: s } = Pt(t), o = Z("auxRand", n, 32), c = Mt(s ^ F(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Fe(F(a));
+  if (l === lt)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Pt(l), g = ar(f, i, r), w = new Uint8Array(64);
-  if (w.set(f, 0), w.set(Ot(Fe(u + g * s)), 32), !cr(w, r, i))
+  const { bytes: f, scalar: u } = Pt(l), g = fr(f, i, r), w = new Uint8Array(64);
+  if (w.set(f, 0), w.set(Mt(Fe(u + g * s)), 32), !hr(w, r, i))
     throw new Error("sign: Invalid signature produced");
   return w;
 }
-function cr(e, t, n) {
+function hr(e, t, n) {
   const r = Z("signature", e, 64), i = Z("message", t), s = Z("publicKey", n, 32);
   try {
-    const o = or(F(s)), c = F(r.subarray(0, 32));
-    if (!sr(c))
+    const o = lr(F(s)), c = F(r.subarray(0, 32));
+    if (!ur(c))
       return !1;
     const a = F(r.subarray(32, 64));
-    if (!cs(a))
+    if (!ds(a))
       return !1;
-    const l = ar(Ot(c), Yt(o), i), f = us(o, a, Fe(-l));
+    const l = fr(Mt(c), Yt(o), i), f = ps(o, a, Fe(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
   } catch {
     return !1;
   }
 }
 const Ze = {
-  getPublicKey: ls,
-  sign: fs,
-  verify: cr,
+  getPublicKey: ys,
+  sign: gs,
+  verify: hr,
   utils: {
     randomPrivateKey: Ie.utils.randomPrivateKey,
-    lift_x: or,
+    lift_x: lr,
     pointToBytes: Yt,
     numberToBytesBE: Ne,
     bytesToNumberBE: F,
     taggedHash: rt,
-    mod: W
+    mod: V
   }
-}, Ct = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+}, Bt = 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, 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)
+const Qt = (e) => e instanceof Uint8Array, kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, ws = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!ws)
   throw new Error("Non little-endian hardware is not supported");
-const ds = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function P(e) {
+const bs = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+function H(e) {
   if (!Qt(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += ds[e[n]];
+    t += bs[e[n]];
   return t;
 }
 function z(e) {
@@ -1449,17 +1449,17 @@ function z(e) {
   }
   return n;
 }
-function ys(e) {
+function vs(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Je(e) {
-  if (typeof e == "string" && (e = ys(e)), !Qt(e))
+  if (typeof e == "string" && (e = vs(e)), !Qt(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function lt(...e) {
+function ft(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -1468,69 +1468,69 @@ function lt(...e) {
     t.set(r, n), n += r.length;
   }), t;
 }
-class ur {
+class dr {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 }
-function lr(e) {
+function pr(e) {
   const t = (r) => e().update(Je(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-function fr(e = 32) {
-  if (Ct && typeof Ct.getRandomValues == "function")
-    return Ct.getRandomValues(new Uint8Array(e));
+function yr(e = 32) {
+  if (Bt && typeof Bt.getRandomValues == "function")
+    return Bt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Mt(e) {
+function Ht(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function ps(e) {
+function ms(e) {
   if (typeof e != "boolean")
     throw new Error(`Expected boolean, not ${e}`);
 }
-function hr(e, ...t) {
+function gr(e, ...t) {
   if (!(e instanceof Uint8Array))
     throw new Error("Expected Uint8Array");
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
 }
-function gs(e) {
+function Es(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Mt(e.outputLen), Mt(e.blockLen);
+  Ht(e.outputLen), Ht(e.blockLen);
 }
-function ws(e, t = !0) {
+function xs(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function bs(e, t) {
-  hr(e);
+function Ks(e, t) {
+  gr(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const se = {
-  number: Mt,
-  bool: ps,
-  bytes: hr,
-  hash: gs,
-  exists: ws,
-  output: bs
+  number: Ht,
+  bool: ms,
+  bytes: gr,
+  hash: Es,
+  exists: xs,
+  output: Ks
 };
-function vs(e, t, n, r) {
+function Ns(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
   const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), c = Number(n & s), a = r ? 4 : 0, l = r ? 0 : 4;
   e.setUint32(t + a, o, r), e.setUint32(t + l, c, r);
 }
-class ms extends ur {
+class Ss extends dr {
   constructor(t, n, r, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Bt(this.buffer);
+    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = kt(this.buffer);
   }
   update(t) {
     se.exists(this);
@@ -1540,7 +1540,7 @@ class ms extends ur {
     for (let o = 0; o < s; ) {
       const c = Math.min(i - this.pos, s - o);
       if (c === i) {
-        const a = Bt(t);
+        const a = kt(t);
         for (; i <= s - o; o += i)
           this.process(a, o);
         continue;
@@ -1556,8 +1556,8 @@ class ms extends ur {
     n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(r, 0), o = 0);
     for (let u = o; u < i; u++)
       n[u] = 0;
-    vs(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const c = Bt(t), a = this.outputLen;
+    Ns(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const c = kt(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = a / 4, f = this.get();
@@ -1578,7 +1578,7 @@ class ms extends ur {
     return t.length = i, t.pos = c, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 }
-const Es = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n, Ks = new Uint32Array([
+const As = (e, t, n) => e & t ^ ~e & n, Cs = (e, t, n) => e & t ^ e & n ^ t & n, Bs = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1653,7 +1653,7 @@ const Es = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n,
   528734635,
   1541459225
 ]), Ee = new Uint32Array(64);
-class dr extends ms {
+class wr extends Ss {
   constructor() {
     super(64, 32, 8, !1), this.A = me[0] | 0, this.B = me[1] | 0, this.C = me[2] | 0, this.D = me[3] | 0, this.E = me[4] | 0, this.F = me[5] | 0, this.G = me[6] | 0, this.H = me[7] | 0;
   }
@@ -1669,12 +1669,12 @@ class dr extends ms {
     for (let u = 0; u < 16; u++, n += 4)
       Ee[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const g = Ee[u - 15], w = Ee[u - 2], p = ie(g, 7) ^ ie(g, 18) ^ g >>> 3, h = ie(w, 17) ^ ie(w, 19) ^ w >>> 10;
-      Ee[u] = h + Ee[u - 7] + p + Ee[u - 16] | 0;
+      const g = Ee[u - 15], w = Ee[u - 2], y = ie(g, 7) ^ ie(g, 18) ^ g >>> 3, h = ie(w, 17) ^ ie(w, 19) ^ w >>> 10;
+      Ee[u] = h + Ee[u - 7] + y + Ee[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const g = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), w = f + g + Es(c, a, l) + Ks[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + xs(r, i, s) | 0;
+      const g = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), w = f + g + As(c, a, l) + Bs[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + Cs(r, i, s) | 0;
       f = l, l = a, a = c, c = o + w | 0, o = s, s = i, i = r, r = w + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
@@ -1686,15 +1686,15 @@ class dr extends ms {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 }
-class Ns extends dr {
+class ks extends wr {
   constructor() {
     super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28;
   }
 }
-const fe = lr(() => new dr());
-lr(() => new Ns());
+const fe = pr(() => new wr());
+pr(() => new ks());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function Ve(e) {
+function We(e) {
   if (!Number.isSafeInteger(e))
     throw new Error(`Wrong integer: ${e}`);
 }
@@ -1702,13 +1702,13 @@ function de(...e) {
   const t = (i, s) => (o) => i(s(o)), n = Array.from(e).reverse().reduce((i, s) => i ? t(i, s.encode) : s.encode, void 0), r = e.reduce((i, s) => i ? t(i, s.decode) : s.decode, void 0);
   return { encode: n, decode: r };
 }
-function ye(e) {
+function pe(e) {
   return {
     encode: (t) => {
       if (!Array.isArray(t) || t.length && typeof t[0] != "number")
         throw new Error("alphabet.encode input should be an array of numbers");
       return t.map((n) => {
-        if (Ve(n), n < 0 || n >= e.length)
+        if (We(n), n < 0 || n >= e.length)
           throw new Error(`Digit index outside alphabet: ${n} (alphabet: ${e.length})`);
         return e[n];
       });
@@ -1727,7 +1727,7 @@ function ye(e) {
     }
   };
 }
-function pe(e = "") {
+function ye(e = "") {
   if (typeof e != "string")
     throw new Error("join separator should be string");
   return {
@@ -1746,8 +1746,8 @@ function pe(e = "") {
     }
   };
 }
-function ft(e, t = "=") {
-  if (Ve(e), typeof t != "string")
+function ht(e, t = "=") {
+  if (We(e), typeof t != "string")
     throw new Error("padding chr should be string");
   return {
     encode(n) {
@@ -1776,12 +1776,12 @@ function ft(e, t = "=") {
     }
   };
 }
-function yr(e) {
+function br(e) {
   if (typeof e != "function")
     throw new Error("normalize fn should be function");
   return { encode: (t) => t, decode: (t) => e(t) };
 }
-function Un(e, t, n) {
+function Rn(e, t, n) {
   if (t < 2)
     throw new Error(`convertRadix: wrong from=${t}, base cannot be less than 2`);
   if (n < 2)
@@ -1793,7 +1793,7 @@ function Un(e, t, n) {
   let r = 0;
   const i = [], s = Array.from(e);
   for (s.forEach((o) => {
-    if (Ve(o), o < 0 || o >= t)
+    if (We(o), o < 0 || o >= t)
       throw new Error(`Wrong integer: ${o}`);
   }); ; ) {
     let o = 0, c = !0;
@@ -1814,8 +1814,8 @@ function Un(e, t, n) {
     i.push(0);
   return i.reverse();
 }
-const pr = (e, t) => t ? pr(t, e % t) : e, it = (e, t) => e + (t - pr(e, t));
-function Ht(e, t, n, r) {
+const vr = (e, t) => t ? vr(t, e % t) : e, it = (e, t) => e + (t - vr(e, t));
+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 (Ve(a), a >= 2 ** t)
+    if (We(a), a >= 2 ** t)
       throw new Error(`convertRadix2: invalid data word=${a} from=${t}`);
     if (i = i << t | a, s + t > 32)
       throw new Error(`convertRadix2: carry overflow pos=${s} from=${t}`);
@@ -1841,22 +1841,22 @@ function Ht(e, t, n, r) {
     throw new Error(`Non-zero padding: ${i}`);
   return r && s > 0 && c.push(i >>> 0), c;
 }
-function Ss(e) {
-  return Ve(e), {
+function _s(e) {
+  return We(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
-      return Un(Array.from(t), 2 ** 8, e);
+      return Rn(Array.from(t), 2 ** 8, e);
     },
     decode: (t) => {
       if (!Array.isArray(t) || t.length && typeof t[0] != "number")
         throw new Error("radix.decode input should be array of strings");
-      return Uint8Array.from(Un(t, e, 2 ** 8));
+      return Uint8Array.from(Rn(t, e, 2 ** 8));
     }
   };
 }
 function Se(e, t = !1) {
-  if (Ve(e), e <= 0 || e > 32)
+  if (We(e), e <= 0 || e > 32)
     throw new Error("radix2: bits should be in (0..32]");
   if (it(8, e) > 32 || it(e, 8) > 32)
     throw new Error("radix2: carry overflow");
@@ -1864,16 +1864,16 @@ function Se(e, t = !1) {
     encode: (n) => {
       if (!(n instanceof Uint8Array))
         throw new Error("radix2.encode input should be Uint8Array");
-      return Ht(Array.from(n), 8, e, !t);
+      return 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));
     }
   };
 }
-function Ln(e) {
+function Tn(e) {
   if (typeof e != "function")
     throw new Error("unsafeWrapper fn should be function");
   return function(...t) {
@@ -1883,25 +1883,25 @@ function Ln(e) {
     }
   };
 }
-const As = de(Se(4), ye("0123456789ABCDEF"), pe("")), Cs = de(Se(5), ye("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ft(5), pe(""));
-de(Se(5), ye("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ft(5), pe(""));
-de(Se(5), ye("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), pe(""), yr((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const he = de(Se(6), ye("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ft(6), pe("")), Bs = de(Se(6), ye("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ft(6), pe("")), en = (e) => de(Ss(58), ye(e), pe("")), qt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+const Is = de(Se(4), pe("0123456789ABCDEF"), ye("")), Us = de(Se(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ht(5), ye(""));
+de(Se(5), pe("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ht(5), ye(""));
+de(Se(5), pe("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), ye(""), br((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
+const he = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ht(6), ye("")), Ls = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ht(6), ye("")), en = (e) => de(_s(58), pe(e), ye("")), Dt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
 en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
 en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
-const $n = [0, 2, 3, 5, 6, 7, 9, 10, 11], ks = {
+const On = [0, 2, 3, 5, 6, 7, 9, 10, 11], $s = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
       const r = e.subarray(n, n + 8);
-      t += qt.encode(r).padStart($n[r.length], "1");
+      t += Dt.encode(r).padStart(On[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 = $n.indexOf(r.length), s = qt.decode(r);
+      const r = e.slice(n, n + 11), i = On.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,15 +1909,15 @@ const $n = [0, 2, 3, 5, 6, 7, 9, 10, 11], ks = {
     }
     return Uint8Array.from(t);
   }
-}, Dt = de(ye("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), pe("")), Tn = [996825010, 642813549, 513874426, 1027748829, 705979059];
+}, jt = de(pe("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), ye("")), Mn = [996825010, 642813549, 513874426, 1027748829, 705979059];
 function Ge(e) {
   const t = e >> 25;
   let n = (e & 33554431) << 5;
-  for (let r = 0; r < Tn.length; r++)
-    (t >> r & 1) === 1 && (n ^= Tn[r]);
+  for (let r = 0; r < Mn.length; r++)
+    (t >> r & 1) === 1 && (n ^= Mn[r]);
   return n;
 }
-function Rn(e, t, n = 1) {
+function Pn(e, t, n = 1) {
   const r = e.length;
   let i = 1;
   for (let s = 0; s < r; s++) {
@@ -1933,10 +1933,10 @@ function Rn(e, t, n = 1) {
     i = Ge(i) ^ s;
   for (let s = 0; s < 6; s++)
     i = Ge(i);
-  return i ^= n, Dt.encode(Ht([i % 2 ** 30], 30, 5, !1));
+  return i ^= n, jt.encode(qt([i % 2 ** 30], 30, 5, !1));
 }
-function gr(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, s = Ln(r);
+function mr(e) {
+  const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, s = Tn(r);
   function o(f, u, g = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
@@ -1945,7 +1945,7 @@ function gr(e) {
     const w = f.length + 7 + u.length;
     if (g !== !1 && w > g)
       throw new TypeError(`Length ${w} exceeds limit ${g}`);
-    return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${Rn(f, u, t)}`;
+    return f = f.toLowerCase(), `${f}1${jt.encode(u)}${Pn(f, u, t)}`;
   }
   function c(f, u = 90) {
     if (typeof f != "string")
@@ -1959,68 +1959,68 @@ function gr(e) {
     const w = f.lastIndexOf("1");
     if (w === 0 || w === -1)
       throw new Error('Letter "1" must be present between prefix and data only');
-    const p = f.slice(0, w), h = f.slice(w + 1);
+    const y = f.slice(0, w), h = f.slice(w + 1);
     if (h.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const d = Dt.decode(h).slice(0, -6), y = Rn(p, d, t);
-    if (!h.endsWith(y))
-      throw new Error(`Invalid checksum in ${f}: expected "${y}"`);
-    return { prefix: p, words: d };
+    const d = jt.decode(h).slice(0, -6), p = Pn(y, d, t);
+    if (!h.endsWith(p))
+      throw new Error(`Invalid checksum in ${f}: expected "${p}"`);
+    return { prefix: y, words: d };
   }
-  const a = Ln(c);
+  const a = Tn(c);
   function l(f) {
     const { prefix: u, words: g } = c(f, !1);
     return { prefix: u, words: g, bytes: r(g) };
   }
   return { encode: o, decode: c, decodeToBytes: l, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
-const ze = gr("bech32");
-gr("bech32m");
-const _s = {
+const ze = mr("bech32");
+mr("bech32m");
+const Rs = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, Is = de(Se(4), ye("0123456789abcdef"), pe(""), yr((e) => {
+}, Ts = de(Se(4), pe("0123456789abcdef"), ye(""), br((e) => {
   if (typeof e != "string" || e.length % 2)
     throw new TypeError(`hex.decode: expected string, got ${typeof e} with length ${e.length}`);
   return e.toLowerCase();
-})), Us = {
-  utf8: _s,
-  hex: Is,
-  base16: As,
-  base32: Cs,
+})), Os = {
+  utf8: Rs,
+  hex: Ts,
+  base16: Is,
+  base32: Us,
   base64: he,
-  base64url: Bs,
-  base58: qt,
-  base58xmr: ks
+  base64url: Ls,
+  base58: Dt,
+  base58xmr: $s
 };
-`${Object.keys(Us).join(", ")}`;
-function kt(e) {
+`${Object.keys(Os).join(", ")}`;
+function _t(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
-function On(e) {
+function Hn(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
-function Ls(e) {
+function Ms(e) {
   return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
 }
-function ce(e, ...t) {
-  if (!Ls(e))
+function ue(e, ...t) {
+  if (!Ms(e))
     throw new Error("Uint8Array expected");
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
 }
 /*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */
-const G = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), $s = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!$s)
+const G = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), Ps = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!Ps)
   throw new Error("Non little-endian hardware is not supported");
-function Ts(e, t) {
+function Hs(e, t) {
   if (t == null || typeof t != "object")
     throw new Error("options must be defined");
   return Object.assign(e, t);
 }
-function Rs(e, t) {
+function qs(e, t) {
   if (e.length !== t.length)
     return !1;
   let n = 0;
@@ -2028,9 +2028,9 @@ function Rs(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Os = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ke = 16, Ps = 283;
+const Ds = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ke = 16, js = 283;
 function tn(e) {
-  return e << 1 ^ Ps & -(e >> 7);
+  return e << 1 ^ js & -(e >> 7);
 }
 function He(e, t) {
   let n = 0;
@@ -2038,7 +2038,7 @@ function He(e, t) {
     n ^= e & -(t & 1), e = tn(e);
   return n;
 }
-const jt = /* @__PURE__ */ (() => {
+const zt = /* @__PURE__ */ (() => {
   let e = new Uint8Array(256);
   for (let n = 0, r = 1; n < 256; n++, r ^= tn(r))
     e[n] = r;
@@ -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;
-})(), Ms = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Hs = (e) => e << 24 | e >>> 8, _t = (e) => e << 8 | e >>> 24;
-function wr(e, t) {
+})(), zs = /* @__PURE__ */ zt.map((e, t) => zt.indexOf(t)), Ws = (e) => e << 24 | e >>> 8, It = (e) => e << 8 | e >>> 24;
+function Er(e, t) {
   if (e.length !== 256)
     throw new Error("Wrong sbox length");
-  const n = new Uint32Array(256).map((l, f) => t(e[f])), r = n.map(_t), i = r.map(_t), s = i.map(_t), o = new Uint32Array(256 * 256), c = new Uint32Array(256 * 256), a = new Uint16Array(256 * 256);
+  const n = new Uint32Array(256).map((l, f) => t(e[f])), r = n.map(It), i = r.map(It), s = i.map(It), o = new Uint32Array(256 * 256), c = new Uint32Array(256 * 256), a = new Uint16Array(256 * 256);
   for (let l = 0; l < 256; l++)
     for (let f = 0; f < 256; f++) {
       const u = l * 256 + f;
@@ -2061,14 +2061,14 @@ 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(Ms, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), qs = /* @__PURE__ */ (() => {
+const nn = /* @__PURE__ */ Er(zt, (e) => He(e, 3) << 24 | e << 16 | e << 8 | He(e, 2)), xr = /* @__PURE__ */ Er(zs, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), Vs = /* @__PURE__ */ (() => {
   const e = new Uint8Array(16);
   for (let t = 0, n = 1; t < 16; t++, n = tn(n))
     e[t] = n;
   return e;
 })();
-function vr(e) {
-  ce(e);
+function Kr(e) {
+  ue(e);
   const t = e.length;
   if (![16, 24, 32].includes(t))
     throw new Error(`aes: wrong key size: should be 16, 24 or 32, got: ${t}`);
@@ -2076,12 +2076,12 @@ function vr(e) {
   o.set(r);
   for (let c = i; c < o.length; c++) {
     let a = o[c - 1];
-    c % i === 0 ? a = s(Hs(a)) ^ qs[c / i - 1] : i > 6 && c % i === 4 && (a = s(a)), o[c] = o[c - i] ^ a;
+    c % i === 0 ? a = s(Ws(a)) ^ Vs[c / i - 1] : i > 6 && c % i === 4 && (a = s(a)), o[c] = o[c - i] ^ a;
   }
   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;
+function Zs(e) {
+  const t = Kr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: c, T3: a } = xr;
   for (let l = 0; l < r; l += 4)
     for (let f = 0; f < 4; f++)
       n[l + f] = t[r - l - 4 + f];
@@ -2098,42 +2098,42 @@ function xe(e, t, n, r, i, s) {
 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) {
+function qn(e, t, n, r, i) {
   const { sbox2: s, T01: o, T23: c } = nn;
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
-  for (let p = 0; p < l; p++) {
-    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), y = e[a++] ^ xe(o, c, r, i, t, n), E = e[a++] ^ xe(o, c, i, t, n, r);
-    t = h, n = d, r = y, i = E;
+  for (let y = 0; y < l; y++) {
+    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), p = e[a++] ^ xe(o, c, r, i, t, n), E = e[a++] ^ xe(o, c, i, t, n, r);
+    t = h, n = d, r = p, i = E;
   }
   const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), g = e[a++] ^ oe(s, r, i, t, n), w = e[a++] ^ oe(s, i, t, n, r);
   return { s0: f, s1: u, s2: g, s3: w };
 }
-function js(e, t, n, r, i) {
-  const { sbox2: s, T01: o, T23: c } = br;
+function Gs(e, t, n, r, i) {
+  const { sbox2: s, T01: o, T23: c } = xr;
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
-  for (let p = 0; p < l; p++) {
-    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), y = e[a++] ^ xe(o, c, r, n, t, i), E = e[a++] ^ xe(o, c, i, r, n, t);
-    t = h, n = d, r = y, i = E;
+  for (let y = 0; y < l; y++) {
+    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), p = e[a++] ^ xe(o, c, r, n, t, i), E = e[a++] ^ xe(o, c, i, r, n, t);
+    t = h, n = d, r = p, i = E;
   }
   const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), g = e[a++] ^ oe(s, r, n, t, i), w = e[a++] ^ oe(s, i, r, n, t);
   return { s0: f, s1: u, s2: g, s3: w };
 }
-function mr(e, t) {
+function Nr(e, t) {
   if (!t)
     return new Uint8Array(e);
-  if (ce(t), t.length < e)
+  if (ue(t), t.length < e)
     throw new Error(`aes: wrong destination length, expected at least ${e}, got: ${t.length}`);
   return t;
 }
-function zs(e) {
-  if (ce(e), e.length % Ke !== 0)
+function Fs(e) {
+  if (ue(e), e.length % Ke !== 0)
     throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ke}`);
 }
-function Vs(e, t, n) {
+function Js(e, t, n) {
   let r = e.length;
   const i = r % Ke;
   if (!t && i !== 0)
@@ -2143,10 +2143,10 @@ function Vs(e, t, n) {
     let a = Ke - i;
     a || (a = Ke), r = r + a;
   }
-  const o = mr(r, n), c = G(o);
+  const o = Nr(r, n), c = G(o);
   return { b: s, o: c, out: o };
 }
-function Ws(e, t) {
+function Ys(e, t) {
   if (!t)
     return e;
   const n = e.length;
@@ -2161,7 +2161,7 @@ function Ws(e, t) {
       throw new Error("aes/pcks5: wrong padding");
   return i;
 }
-function Zs(e) {
+function Xs(e) {
   const t = new Uint8Array(16), n = G(t);
   t.set(e);
   const r = Ke - e.length;
@@ -2169,88 +2169,88 @@ function Zs(e) {
     t[i] = r;
   return n;
 }
-const Er = /* @__PURE__ */ Os({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
-  ce(t), ce(n, 16);
+const Sr = /* @__PURE__ */ Ds({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
+  ue(t), ue(n, 16);
   const i = !r.disablePadding;
   return {
     encrypt: (s, o) => {
-      const c = vr(t), { b: a, o: l, out: f } = Vs(s, i, o), u = G(n);
-      let g = u[0], w = u[1], p = u[2], h = u[3], d = 0;
+      const c = Kr(t), { b: a, o: l, out: f } = Js(s, i, o), u = G(n);
+      let g = u[0], w = u[1], y = u[2], h = u[3], d = 0;
       for (; d + 4 <= a.length; )
-        g ^= a[d + 0], w ^= a[d + 1], p ^= a[d + 2], h ^= a[d + 3], { s0: g, s1: w, s2: p, s3: h } = Pn(c, g, w, p, h), l[d++] = g, l[d++] = w, l[d++] = p, l[d++] = h;
+        g ^= a[d + 0], w ^= a[d + 1], y ^= a[d + 2], h ^= a[d + 3], { s0: g, s1: w, s2: y, s3: h } = qn(c, g, w, y, h), l[d++] = g, l[d++] = w, l[d++] = y, l[d++] = h;
       if (i) {
-        const y = Zs(s.subarray(d * 4));
-        g ^= y[0], w ^= y[1], p ^= y[2], h ^= y[3], { s0: g, s1: w, s2: p, s3: h } = Pn(c, g, w, p, h), l[d++] = g, l[d++] = w, l[d++] = p, l[d++] = h;
+        const p = Xs(s.subarray(d * 4));
+        g ^= p[0], w ^= p[1], y ^= p[2], h ^= p[3], { s0: g, s1: w, s2: y, s3: h } = qn(c, g, w, y, h), l[d++] = g, l[d++] = w, l[d++] = y, l[d++] = h;
       }
       return c.fill(0), f;
     },
     decrypt: (s, o) => {
-      zs(s);
-      const c = Ds(t), a = G(n), l = mr(s.length, o), f = G(s), u = G(l);
-      let g = a[0], w = a[1], p = a[2], h = a[3];
+      Fs(s);
+      const c = Zs(t), a = G(n), l = Nr(s.length, o), f = G(s), u = G(l);
+      let g = a[0], w = a[1], y = a[2], h = a[3];
       for (let d = 0; d + 4 <= f.length; ) {
-        const y = g, E = w, S = p, I = h;
-        g = f[d + 0], w = f[d + 1], p = f[d + 2], h = f[d + 3];
-        const { s0: B, s1: m, s2: x, s3: K } = js(c, g, w, p, h);
-        u[d++] = B ^ y, u[d++] = m ^ E, u[d++] = x ^ S, u[d++] = K ^ I;
+        const p = g, E = w, S = y, I = h;
+        g = f[d + 0], w = f[d + 1], y = f[d + 2], h = f[d + 3];
+        const { s0: B, s1: m, s2: x, s3: K } = Gs(c, g, w, y, h);
+        u[d++] = B ^ p, u[d++] = m ^ E, u[d++] = x ^ S, u[d++] = K ^ I;
       }
-      return c.fill(0), Ws(l, i);
+      return c.fill(0), Ys(l, i);
     }
   };
-}), xr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Gs = xr("expand 16-byte k"), Fs = xr("expand 32-byte k"), Js = G(Gs), Kr = G(Fs);
-Kr.slice();
+}), Ar = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Qs = Ar("expand 16-byte k"), eo = Ar("expand 32-byte k"), to = G(Qs), Cr = G(eo);
+Cr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
 }
-function zt(e) {
+function Wt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Xe = 64, Ys = 16, Nr = 2 ** 32 - 1, Mn = new Uint32Array();
-function Xs(e, t, n, r, i, s, o, c) {
-  const a = i.length, l = new Uint8Array(Xe), f = G(l), u = zt(i) && zt(s), g = u ? G(i) : Mn, w = u ? G(s) : Mn;
-  for (let p = 0; p < a; o++) {
-    if (e(t, n, r, f, o, c), o >= Nr)
+const Xe = 64, no = 16, Br = 2 ** 32 - 1, Dn = new Uint32Array();
+function ro(e, t, n, r, i, s, o, c) {
+  const a = i.length, l = new Uint8Array(Xe), f = G(l), u = Wt(i) && Wt(s), g = u ? G(i) : Dn, w = u ? G(s) : Dn;
+  for (let y = 0; y < a; o++) {
+    if (e(t, n, r, f, o, c), o >= Br)
       throw new Error("arx: counter overflow");
-    const h = Math.min(Xe, a - p);
+    const h = Math.min(Xe, a - y);
     if (u && h === Xe) {
-      const d = p / 4;
-      if (p % 4 !== 0)
+      const d = y / 4;
+      if (y % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let y = 0, E; y < Ys; y++)
-        E = d + y, w[E] = g[E] ^ f[y];
-      p += Xe;
+      for (let p = 0, E; p < no; p++)
+        E = d + p, w[E] = g[E] ^ f[p];
+      y += Xe;
       continue;
     }
-    for (let d = 0, y; d < h; d++)
-      y = p + d, s[y] = i[y] ^ l[d];
-    p += h;
+    for (let d = 0, p; d < h; d++)
+      p = y + d, s[p] = i[p] ^ l[d];
+    y += h;
   }
 }
-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);
+function io(e, t) {
+  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = Hs({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return kt(i), kt(o), On(s), On(n), (c, a, l, f, u = 0) => {
-    ce(c), ce(a), ce(l);
+  return _t(i), _t(o), Hn(s), Hn(n), (c, a, l, f, u = 0) => {
+    ue(c), ue(a), ue(l);
     const g = l.length;
-    if (f || (f = new Uint8Array(g)), ce(f), kt(u), u < 0 || u >= Nr)
+    if (f || (f = new Uint8Array(g)), ue(f), _t(u), u < 0 || u >= Br)
       throw new Error("arx: counter overflow");
     if (f.length < g)
       throw new Error(`arx: output (${f.length}) is shorter than data (${g})`);
     const w = [];
-    let p = c.length, h, d;
-    if (p === 32)
-      h = c.slice(), w.push(h), d = Kr;
-    else if (p === 16 && n)
-      h = new Uint8Array(32), h.set(c), h.set(c, 16), d = Js, w.push(h);
+    let y = c.length, h, d;
+    if (y === 32)
+      h = c.slice(), w.push(h), d = Cr;
+    else if (y === 16 && n)
+      h = new Uint8Array(32), h.set(c), h.set(c, 16), d = to, w.push(h);
     else
-      throw new Error(`arx: invalid 32-byte key, got length=${p}`);
-    zt(a) || (a = a.slice(), w.push(a));
-    const y = G(h);
+      throw new Error(`arx: invalid 32-byte key, got length=${y}`);
+    Wt(a) || (a = a.slice(), w.push(a));
+    const p = G(h);
     if (r) {
       if (a.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(d, y, G(a.subarray(0, 16)), y), a = a.subarray(16);
+      r(d, p, G(a.subarray(0, 16)), p), a = a.subarray(16);
     }
     const E = 16 - i;
     if (E !== a.length)
@@ -2260,24 +2260,24 @@ function Qs(e, t) {
       I.set(a, s ? 0 : 12 - a.length), a = I, w.push(a);
     }
     const S = G(a);
-    for (Xs(e, d, y, S, l, f, u, o); w.length > 0; )
+    for (ro(e, d, p, S, l, f, u, o); w.length > 0; )
       w.pop().fill(0);
     return f;
   };
 }
-function 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], w = t[3], p = t[4], h = t[5], d = t[6], y = t[7], E = i, S = n[0], I = n[1], B = n[2], m = o, x = c, K = a, M = l, _ = f, A = u, T = g, R = w, H = p, b = h, v = d, N = y, k = E, C = S, U = I, O = B;
+function so(e, t, n, r, i, s = 20) {
+  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], g = t[2], w = t[3], y = t[4], h = t[5], d = t[6], p = t[7], E = i, S = n[0], I = n[1], B = n[2], m = o, x = c, K = a, M = l, _ = f, A = u, R = g, T = w, q = y, b = h, v = d, N = p, k = E, C = S, U = I, O = B;
   for (let ee = 0; ee < s; ee += 2)
-    m = m + _ | 0, k = L(k ^ m, 16), H = H + k | 0, _ = L(_ ^ H, 12), m = m + _ | 0, k = L(k ^ m, 8), H = H + k | 0, _ = L(_ ^ H, 7), x = x + A | 0, C = L(C ^ x, 16), b = b + C | 0, A = L(A ^ b, 12), x = x + A | 0, C = L(C ^ x, 8), b = b + C | 0, A = L(A ^ b, 7), K = K + T | 0, U = L(U ^ K, 16), v = v + U | 0, T = L(T ^ v, 12), K = K + T | 0, U = L(U ^ K, 8), v = v + U | 0, T = L(T ^ v, 7), M = M + R | 0, O = L(O ^ M, 16), N = N + O | 0, R = L(R ^ N, 12), M = M + R | 0, O = L(O ^ M, 8), N = N + O | 0, R = L(R ^ N, 7), m = m + A | 0, O = L(O ^ m, 16), v = v + O | 0, A = L(A ^ v, 12), m = m + A | 0, O = L(O ^ m, 8), v = v + O | 0, A = L(A ^ v, 7), x = x + T | 0, k = L(k ^ x, 16), N = N + k | 0, T = L(T ^ N, 12), x = x + T | 0, k = L(k ^ x, 8), N = N + k | 0, T = L(T ^ N, 7), K = K + R | 0, C = L(C ^ K, 16), H = H + C | 0, R = L(R ^ H, 12), K = K + R | 0, C = L(C ^ K, 8), H = H + C | 0, R = L(R ^ H, 7), M = M + _ | 0, U = L(U ^ M, 16), b = b + U | 0, _ = L(_ ^ b, 12), M = M + _ | 0, U = L(U ^ M, 8), b = b + U | 0, _ = L(_ ^ b, 7);
+    m = m + _ | 0, k = L(k ^ m, 16), q = q + k | 0, _ = L(_ ^ q, 12), m = m + _ | 0, k = L(k ^ m, 8), q = q + k | 0, _ = L(_ ^ q, 7), x = x + A | 0, C = L(C ^ x, 16), b = b + C | 0, A = L(A ^ b, 12), x = x + A | 0, C = L(C ^ x, 8), b = b + C | 0, A = L(A ^ b, 7), K = K + R | 0, U = L(U ^ K, 16), v = v + U | 0, R = L(R ^ v, 12), K = K + R | 0, U = L(U ^ K, 8), v = v + U | 0, R = L(R ^ v, 7), M = M + T | 0, O = L(O ^ M, 16), N = N + O | 0, T = L(T ^ N, 12), M = M + T | 0, O = L(O ^ M, 8), N = N + O | 0, T = L(T ^ N, 7), m = m + A | 0, O = L(O ^ m, 16), v = v + O | 0, A = L(A ^ v, 12), m = m + A | 0, O = L(O ^ m, 8), v = v + O | 0, A = L(A ^ v, 7), x = x + R | 0, k = L(k ^ x, 16), N = N + k | 0, R = L(R ^ N, 12), x = x + R | 0, k = L(k ^ x, 8), N = N + k | 0, R = L(R ^ N, 7), K = K + T | 0, C = L(C ^ K, 16), q = q + C | 0, T = L(T ^ q, 12), K = K + T | 0, C = L(C ^ K, 8), q = q + C | 0, T = L(T ^ q, 7), M = M + _ | 0, U = L(U ^ M, 16), b = b + U | 0, _ = L(_ ^ b, 12), M = M + _ | 0, U = L(U ^ M, 8), b = b + U | 0, _ = L(_ ^ b, 7);
   let $ = 0;
-  r[$++] = o + m | 0, r[$++] = c + x | 0, r[$++] = a + K | 0, r[$++] = l + M | 0, r[$++] = f + _ | 0, r[$++] = u + A | 0, r[$++] = g + T | 0, r[$++] = w + R | 0, r[$++] = p + H | 0, r[$++] = h + b | 0, r[$++] = d + v | 0, r[$++] = y + N | 0, r[$++] = E + k | 0, r[$++] = S + C | 0, r[$++] = I + U | 0, r[$++] = B + O | 0;
+  r[$++] = o + m | 0, r[$++] = c + x | 0, r[$++] = a + K | 0, r[$++] = l + M | 0, r[$++] = f + _ | 0, r[$++] = u + A | 0, r[$++] = g + R | 0, r[$++] = w + T | 0, r[$++] = y + q | 0, r[$++] = h + b | 0, r[$++] = d + v | 0, r[$++] = p + N | 0, r[$++] = E + k | 0, r[$++] = S + C | 0, r[$++] = I + U | 0, r[$++] = B + O | 0;
 }
-const Sr = /* @__PURE__ */ Qs(eo, {
+const kr = /* @__PURE__ */ io(so, {
   counterRight: !1,
   counterLength: 4,
   allowShortKeys: !1
 });
-class Ar extends ur {
+class _r extends dr {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, se.hash(t);
     const r = Je(n);
@@ -2312,61 +2312,65 @@ class Ar extends ur {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const ht = (e, t, n) => new Ar(e, t).update(n).digest();
-ht.create = (e, t) => new Ar(e, t);
+const dt = (e, t, n) => new _r(e, t).update(n).digest();
+dt.create = (e, t) => new _r(e, t);
 function rn(e, t, n) {
-  return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), ht(e, Je(n), Je(t));
+  return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), dt(e, Je(n), Je(t));
 }
-const It = new Uint8Array([0]), Hn = new Uint8Array();
-function Cr(e, t, n, r = 32) {
+const Ut = new Uint8Array([0]), jn = new Uint8Array();
+function Ir(e, t, n, r = 32) {
   if (se.hash(e), se.number(r), r > 255 * e.outputLen)
     throw new Error("Length should be <= 255*HashLen");
   const i = Math.ceil(r / e.outputLen);
-  n === void 0 && (n = Hn);
-  const s = new Uint8Array(i * e.outputLen), o = ht.create(e, t), c = o._cloneInto(), a = new Uint8Array(o.outputLen);
+  n === void 0 && (n = jn);
+  const s = new Uint8Array(i * e.outputLen), o = dt.create(e, t), c = o._cloneInto(), a = new Uint8Array(o.outputLen);
   for (let l = 0; l < i; l++)
-    It[0] = l + 1, c.update(l === 0 ? Hn : 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);
+    Ut[0] = l + 1, c.update(l === 0 ? jn : 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);
 }
-var to = Object.defineProperty, D = (e, t) => {
+var oo = Object.defineProperty, P = (e, t) => {
   for (var n in t)
-    to(e, n, { get: t[n], enumerable: !0 });
-}, Re = Symbol("verified"), no = (e) => e instanceof Object;
-function dt(e) {
-  if (!no(e) || typeof e.kind != "number" || typeof e.content != "string" || typeof e.created_at != "number" || typeof e.pubkey != "string" || !e.pubkey.match(/^[a-f0-9]{64}$/) || !Array.isArray(e.tags))
+    oo(e, n, { get: t[n], enumerable: !0 });
+}, Te = Symbol("verified"), ao = (e) => e instanceof Object;
+function pt(e) {
+  if (!ao(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++) {
     let n = e.tags[t];
     if (!Array.isArray(n))
       return !1;
     for (let r = 0; r < n.length; r++)
-      if (typeof n[r] == "object")
+      if (typeof n[r] != "string")
         return !1;
   }
   return !0;
 }
-var ro = {};
-D(ro, {
-  Queue: () => ao,
-  QueueNode: () => Br,
+var co = {};
+P(co, {
+  Queue: () => ho,
+  QueueNode: () => Ur,
   binarySearch: () => sn,
-  insertEventIntoAscendingList: () => oo,
-  insertEventIntoDescendingList: () => so,
-  normalizeURL: () => io,
-  utf8Decoder: () => ue,
+  insertEventIntoAscendingList: () => fo,
+  insertEventIntoDescendingList: () => lo,
+  normalizeURL: () => uo,
+  utf8Decoder: () => le,
   utf8Encoder: () => ne
 });
-var ue = new TextDecoder("utf-8"), ne = new TextEncoder();
-function io(e) {
-  e.indexOf("://") === -1 && (e = "wss://" + e);
-  let t = new URL(e);
-  return t.pathname = t.pathname.replace(/\/+/g, "/"), t.pathname.endsWith("/") && (t.pathname = t.pathname.slice(0, -1)), (t.port === "80" && t.protocol === "ws:" || t.port === "443" && t.protocol === "wss:") && (t.port = ""), t.searchParams.sort(), t.hash = "", t.toString();
+var le = new TextDecoder("utf-8"), ne = new TextEncoder();
+function uo(e) {
+  try {
+    e.indexOf("://") === -1 && (e = "wss://" + e);
+    let t = new URL(e);
+    return t.pathname = t.pathname.replace(/\/+/g, "/"), t.pathname.endsWith("/") && (t.pathname = t.pathname.slice(0, -1)), (t.port === "80" && t.protocol === "ws:" || t.port === "443" && t.protocol === "wss:") && (t.port = ""), t.searchParams.sort(), t.hash = "", t.toString();
+  } catch {
+    throw new Error(`Invalid URL: ${e}`);
+  }
 }
-function so(e, t) {
+function lo(e, t) {
   const [n, r] = sn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
   return r || e.splice(n, 0, t), e;
 }
-function oo(e, t) {
+function fo(e, t) {
   const [n, r] = sn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
   return r || e.splice(n, 0, t), e;
 }
@@ -2380,21 +2384,21 @@ function sn(e, t) {
   }
   return [n, !1];
 }
-var Br = class {
+var Ur = class {
   constructor(e) {
     J(this, "value");
     J(this, "next", null);
     J(this, "prev", null);
     this.value = e;
   }
-}, ao = class {
+}, ho = class {
   constructor() {
     J(this, "first");
     J(this, "last");
     this.first = null, this.last = null;
   }
   enqueue(e) {
-    const t = new Br(e);
+    const t = new Ur(e);
     return this.last ? this.last === this.first ? (this.last = t, this.last.prev = this.first, this.first.next = t) : (t.prev = this.last, this.last.next = t, this.last = t) : (this.first = t, this.last = t), !0;
   }
   dequeue() {
@@ -2405,165 +2409,167 @@ var Br = class {
       return this.first = null, this.last = null, t.value;
     }
     const e = this.first;
-    return this.first = e.next, e.value;
+    return this.first = e.next, this.first && (this.first.prev = null), e.value;
   }
-}, co = class {
+}, po = class {
   generateSecretKey() {
     return Ze.utils.randomPrivateKey();
   }
   getPublicKey(e) {
-    return P(Ze.getPublicKey(e));
+    return H(Ze.getPublicKey(e));
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = P(Ze.getPublicKey(t)), n.id = qe(n), n.sig = P(Ze.sign(qe(n), t)), n[Re] = !0, n;
+    return n.pubkey = H(Ze.getPublicKey(t)), n.id = qe(n), n.sig = H(Ze.sign(qe(n), t)), n[Te] = !0, n;
   }
   verifyEvent(e) {
-    if (typeof e[Re] == "boolean")
-      return e[Re];
+    if (typeof e[Te] == "boolean")
+      return e[Te];
     const t = qe(e);
     if (t !== e.id)
-      return e[Re] = !1, !1;
+      return e[Te] = !1, !1;
     try {
       const n = Ze.verify(e.sig, t, e.pubkey);
-      return e[Re] = n, n;
+      return e[Te] = n, n;
     } catch {
-      return e[Re] = !1, !1;
+      return e[Te] = !1, !1;
     }
   }
 };
-function uo(e) {
-  if (!dt(e))
+function yo(e) {
+  if (!pt(e))
     throw new Error("can't serialize event with wrong or missing properties");
   return JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content]);
 }
 function qe(e) {
-  let t = fe(ne.encode(uo(e)));
-  return P(t);
-}
-var yt = new co(), ke = yt.generateSecretKey, le = yt.getPublicKey, Q = yt.finalizeEvent, pt = yt.verifyEvent, lo = {};
-D(lo, {
-  Application: () => da,
-  BadgeAward: () => mo,
-  BadgeDefinition: () => oa,
-  BlockedRelaysList: () => zo,
-  BookmarkList: () => qo,
-  Bookmarksets: () => ra,
-  Calendar: () => ma,
-  CalendarEventRSVP: () => Ea,
-  ChannelCreation: () => $r,
-  ChannelHideMessage: () => Or,
-  ChannelMessage: () => Rr,
-  ChannelMetadata: () => Tr,
-  ChannelMuteUser: () => Pr,
-  ClassifiedListing: () => ga,
-  ClientAuth: () => Hr,
-  CommunitiesList: () => Do,
-  CommunityDefinition: () => Na,
-  CommunityPostApproval: () => _o,
-  Contacts: () => wo,
-  CreateOrUpdateProduct: () => ua,
-  CreateOrUpdateStall: () => ca,
-  Curationsets: () => ia,
-  Date: () => ba,
-  DirectMessageRelaysList: () => Go,
-  DraftClassifiedListing: () => wa,
-  DraftLong: () => fa,
-  Emojisets: () => ha,
-  EncryptedDirectMessage: () => bo,
-  EventDeletion: () => vo,
-  FileMetadata: () => No,
-  FileServerPreference: () => Fo,
-  Followsets: () => ea,
-  GenericRepost: () => xo,
-  Genericlists: () => ta,
-  GiftWrap: () => Mr,
-  HTTPAuth: () => cn,
-  Handlerinformation: () => Ka,
-  Handlerrecommendation: () => xa,
-  Highlights: () => Oo,
-  InterestsList: () => Wo,
-  Interestsets: () => aa,
-  JobFeedback: () => Lo,
-  JobRequest: () => Io,
-  JobResult: () => Uo,
-  Label: () => ko,
-  LightningPubRPC: () => Yo,
-  LiveChatMessage: () => So,
-  LiveEvent: () => ya,
-  LongFormArticle: () => la,
-  Metadata: () => yo,
-  Mutelist: () => Po,
-  NWCWalletInfo: () => Jo,
-  NWCWalletRequest: () => qr,
-  NWCWalletResponse: () => Xo,
-  NostrConnect: () => Qo,
-  OpenTimestamps: () => Ko,
-  Pinlist: () => Mo,
-  PrivateDirectMessage: () => Eo,
-  ProblemTracker: () => Ao,
-  ProfileBadges: () => sa,
-  PublicChatsList: () => jo,
-  Reaction: () => an,
-  RecommendRelay: () => go,
-  RelayList: () => Ho,
-  Relaysets: () => na,
-  Report: () => Co,
-  Reporting: () => Bo,
-  Repost: () => on,
-  Seal: () => Lr,
-  SearchRelaysList: () => Vo,
-  ShortTextNote: () => po,
-  Time: () => va,
-  UserEmojiList: () => Zo,
-  UserStatuses: () => pa,
-  Zap: () => Ro,
-  ZapGoal: () => $o,
-  ZapRequest: () => To,
-  classifyKind: () => fo,
-  isEphemeralKind: () => Ir,
-  isKind: () => ho,
-  isParameterizedReplaceableKind: () => Ur,
-  isRegularKind: () => kr,
-  isReplaceableKind: () => _r
+  let t = fe(ne.encode(yo(e)));
+  return H(t);
+}
+var yt = new po(), ke = yt.generateSecretKey, ae = yt.getPublicKey, Q = yt.finalizeEvent, gt = yt.verifyEvent, go = {};
+P(go, {
+  Application: () => ga,
+  BadgeAward: () => So,
+  BadgeDefinition: () => ua,
+  BlockedRelaysList: () => Zo,
+  BookmarkList: () => zo,
+  Bookmarksets: () => oa,
+  Calendar: () => Ka,
+  CalendarEventRSVP: () => Na,
+  ChannelCreation: () => Mr,
+  ChannelHideMessage: () => qr,
+  ChannelMessage: () => Hr,
+  ChannelMetadata: () => Pr,
+  ChannelMuteUser: () => Dr,
+  ClassifiedListing: () => va,
+  ClientAuth: () => zr,
+  CommunitiesList: () => Wo,
+  CommunityDefinition: () => Ca,
+  CommunityPostApproval: () => Lo,
+  Contacts: () => xo,
+  CreateOrUpdateProduct: () => ha,
+  CreateOrUpdateStall: () => fa,
+  Curationsets: () => aa,
+  Date: () => Ea,
+  DirectMessageRelaysList: () => Yo,
+  DraftClassifiedListing: () => ma,
+  DraftLong: () => pa,
+  Emojisets: () => ya,
+  EncryptedDirectMessage: () => Ko,
+  EventDeletion: () => No,
+  FileMetadata: () => Co,
+  FileServerPreference: () => Xo,
+  Followsets: () => ra,
+  GenericRepost: () => un,
+  Genericlists: () => ia,
+  GiftWrap: () => jr,
+  HTTPAuth: () => ln,
+  Handlerinformation: () => Aa,
+  Handlerrecommendation: () => Sa,
+  Highlights: () => Ho,
+  InterestsList: () => Fo,
+  Interestsets: () => la,
+  JobFeedback: () => To,
+  JobRequest: () => $o,
+  JobResult: () => Ro,
+  Label: () => Uo,
+  LightningPubRPC: () => ea,
+  LiveChatMessage: () => Bo,
+  LiveEvent: () => wa,
+  LongFormArticle: () => da,
+  Metadata: () => mo,
+  Mutelist: () => qo,
+  NWCWalletInfo: () => Qo,
+  NWCWalletRequest: () => Wr,
+  NWCWalletResponse: () => ta,
+  NostrConnect: () => na,
+  OpenTimestamps: () => Ao,
+  Pinlist: () => Do,
+  PrivateDirectMessage: () => Or,
+  ProblemTracker: () => ko,
+  ProfileBadges: () => ca,
+  PublicChatsList: () => Vo,
+  Reaction: () => cn,
+  RecommendRelay: () => Eo,
+  RelayList: () => jo,
+  Relaysets: () => sa,
+  Report: () => _o,
+  Reporting: () => Io,
+  Repost: () => an,
+  Seal: () => Tr,
+  SearchRelaysList: () => Go,
+  ShortTextNote: () => Rr,
+  Time: () => xa,
+  UserEmojiList: () => Jo,
+  UserStatuses: () => ba,
+  Zap: () => Po,
+  ZapGoal: () => Oo,
+  ZapRequest: () => Mo,
+  classifyKind: () => bo,
+  isAddressableKind: () => wt,
+  isEphemeralKind: () => $r,
+  isKind: () => vo,
+  isParameterizedReplaceableKind: () => wo,
+  isRegularKind: () => Lr,
+  isReplaceableKind: () => on
 });
-function kr(e) {
+function Lr(e) {
   return 1e3 <= e && e < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(e);
 }
-function _r(e) {
+function on(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
-function Ir(e) {
+function $r(e) {
   return 2e4 <= e && e < 3e4;
 }
-function Ur(e) {
+function wt(e) {
   return 3e4 <= e && e < 4e4;
 }
-function fo(e) {
-  return kr(e) ? "regular" : _r(e) ? "replaceable" : Ir(e) ? "ephemeral" : Ur(e) ? "parameterized" : "unknown";
+var wo = wt;
+function bo(e) {
+  return Lr(e) ? "regular" : on(e) ? "replaceable" : $r(e) ? "ephemeral" : wt(e) ? "parameterized" : "unknown";
 }
-function ho(e, t) {
+function vo(e, t) {
   const n = t instanceof Array ? t : [t];
-  return dt(e) && n.includes(e.kind) || !1;
-}
-var yo = 0, po = 1, go = 2, wo = 3, bo = 4, vo = 5, on = 6, an = 7, mo = 8, Lr = 13, Eo = 14, xo = 16, $r = 40, Tr = 41, Rr = 42, Or = 43, Pr = 44, Ko = 1040, Mr = 1059, No = 1063, So = 1311, Ao = 1971, Co = 1984, Bo = 1984, ko = 1985, _o = 4550, Io = 5999, Uo = 6999, Lo = 7e3, $o = 9041, To = 9734, Ro = 9735, Oo = 9802, Po = 1e4, Mo = 10001, Ho = 10002, qo = 10003, Do = 10004, jo = 10005, zo = 10006, Vo = 10007, Wo = 10015, Zo = 10030, Go = 10050, Fo = 10096, Jo = 13194, Yo = 21e3, Hr = 22242, qr = 23194, Xo = 23195, Qo = 24133, cn = 27235, ea = 3e4, ta = 30001, na = 30002, ra = 30003, ia = 30004, sa = 30008, oa = 30009, aa = 30015, ca = 30017, ua = 30018, la = 30023, fa = 30024, ha = 30030, da = 30078, ya = 30311, pa = 30315, ga = 30402, wa = 30403, ba = 31922, va = 31923, ma = 31924, Ea = 31925, xa = 31989, Ka = 31990, Na = 34550, Sa = {};
-D(Sa, {
-  getHex64: () => un,
-  getInt: () => Dr,
-  getSubscriptionId: () => Aa,
-  matchEventId: () => Ca,
-  matchEventKind: () => ka,
-  matchEventPubkey: () => Ba
+  return pt(e) && n.includes(e.kind) || !1;
+}
+var mo = 0, Rr = 1, Eo = 2, xo = 3, Ko = 4, No = 5, an = 6, cn = 7, So = 8, Tr = 13, Or = 14, un = 16, Mr = 40, Pr = 41, Hr = 42, qr = 43, Dr = 44, Ao = 1040, jr = 1059, Co = 1063, Bo = 1311, ko = 1971, _o = 1984, Io = 1984, Uo = 1985, Lo = 4550, $o = 5999, Ro = 6999, To = 7e3, Oo = 9041, Mo = 9734, Po = 9735, Ho = 9802, qo = 1e4, Do = 10001, jo = 10002, zo = 10003, Wo = 10004, Vo = 10005, Zo = 10006, Go = 10007, Fo = 10015, Jo = 10030, Yo = 10050, Xo = 10096, Qo = 13194, ea = 21e3, zr = 22242, Wr = 23194, ta = 23195, na = 24133, ln = 27235, ra = 3e4, ia = 30001, sa = 30002, oa = 30003, aa = 30004, ca = 30008, ua = 30009, la = 30015, fa = 30017, ha = 30018, da = 30023, pa = 30024, ya = 30030, ga = 30078, wa = 30311, ba = 30315, va = 30402, ma = 30403, Ea = 31922, xa = 31923, Ka = 31924, Na = 31925, Sa = 31989, Aa = 31990, Ca = 34550, Ba = {};
+P(Ba, {
+  getHex64: () => fn,
+  getInt: () => Vr,
+  getSubscriptionId: () => ka,
+  matchEventId: () => _a,
+  matchEventKind: () => Ua,
+  matchEventPubkey: () => Ia
 });
-function un(e, t) {
+function fn(e, t) {
   let n = t.length + 3, r = e.indexOf(`"${t}":`) + n, i = e.slice(r).indexOf('"') + r + 1;
   return e.slice(i, i + 64);
 }
-function Dr(e, t) {
+function Vr(e, t) {
   let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), s = Math.min(i.indexOf(","), i.indexOf("}"));
   return parseInt(i.slice(0, s), 10);
 }
-function Aa(e) {
+function ka(e) {
   let t = e.slice(0, 22).indexOf('"EVENT"');
   if (t === -1)
     return null;
@@ -2576,22 +2582,22 @@ function Aa(e) {
   let s = r + 1 + i;
   return e.slice(r + 1, s);
 }
-function Ca(e, t) {
-  return t === un(e, "id");
+function _a(e, t) {
+  return t === fn(e, "id");
 }
-function Ba(e, t) {
-  return t === un(e, "pubkey");
+function Ia(e, t) {
+  return t === fn(e, "pubkey");
 }
-function ka(e, t) {
-  return t === Dr(e, "kind");
+function Ua(e, t) {
+  return t === Vr(e, "kind");
 }
-var _a = {};
-D(_a, {
-  makeAuthEvent: () => Ia
+var La = {};
+P(La, {
+  makeAuthEvent: () => $a
 });
-function Ia(e, t) {
+function $a(e, t) {
   return {
-    kind: Hr,
+    kind: zr,
     created_at: Math.floor(Date.now() / 1e3),
     tags: [
       ["relay", e],
@@ -2600,31 +2606,32 @@ function Ia(e, t) {
     content: ""
   };
 }
-var Ua;
+var Ra;
 try {
-  Ua = WebSocket;
+  Ra = WebSocket;
 } catch {
 }
-var La;
+var Ta;
 try {
-  La = WebSocket;
+  Ta = WebSocket;
 } catch {
 }
-var $a = {};
-D($a, {
-  BECH32_REGEX: () => jr,
-  Bech32MaxSize: () => ln,
-  NostrTypeGuard: () => Ta,
-  decode: () => gt,
-  encodeBytes: () => bt,
-  naddrEncode: () => Da,
-  neventEncode: () => qa,
-  noteEncode: () => Ma,
-  nprofileEncode: () => Ha,
-  npubEncode: () => Pa,
-  nsecEncode: () => Oa
+var Oa = {};
+P(Oa, {
+  BECH32_REGEX: () => Zr,
+  Bech32MaxSize: () => hn,
+  NostrTypeGuard: () => Ma,
+  decode: () => bt,
+  decodeNostrURI: () => Ha,
+  encodeBytes: () => mt,
+  naddrEncode: () => Va,
+  neventEncode: () => Wa,
+  noteEncode: () => ja,
+  nprofileEncode: () => za,
+  npubEncode: () => Da,
+  nsecEncode: () => qa
 });
-var Ta = {
+var Ma = {
   isNProfile: (e) => /^nprofile1[a-z\d]+$/.test(e || ""),
   isNEvent: (e) => /^nevent1[a-z\d]+$/.test(e || ""),
   isNAddr: (e) => /^naddr1[a-z\d]+$/.test(e || ""),
@@ -2632,17 +2639,24 @@ var Ta = {
   isNPub: (e) => /^npub1[a-z\d]{58}$/.test(e || ""),
   isNote: (e) => /^note1[a-z\d]+$/.test(e || ""),
   isNcryptsec: (e) => /^ncryptsec1[a-z\d]+$/.test(e || "")
-}, ln = 5e3, jr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
-function Ra(e) {
+}, hn = 5e3, Zr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
+function Pa(e) {
   const t = new Uint8Array(4);
   return t[0] = e >> 24 & 255, t[1] = e >> 16 & 255, t[2] = e >> 8 & 255, t[3] = e & 255, t;
 }
-function gt(e) {
+function Ha(e) {
+  try {
+    return e.startsWith("nostr:") && (e = e.substring(6)), bt(e);
+  } catch {
+    return { type: "invalid", data: null };
+  }
+}
+function bt(e) {
   var i, s, o, c, a, l, f;
-  let { prefix: t, words: n } = ze.decode(e, ln), r = new Uint8Array(ze.fromWords(n));
+  let { prefix: t, words: n } = ze.decode(e, hn), r = new Uint8Array(ze.fromWords(n));
   switch (t) {
     case "nprofile": {
-      let u = Ut(r);
+      let u = Lt(r);
       if (!((i = u[0]) != null && i[0]))
         throw new Error("missing TLV 0 for nprofile");
       if (u[0][0].length !== 32)
@@ -2650,13 +2664,13 @@ function gt(e) {
       return {
         type: "nprofile",
         data: {
-          pubkey: P(u[0][0]),
-          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
+          pubkey: H(u[0][0]),
+          relays: u[1] ? u[1].map((g) => le.decode(g)) : []
         }
       };
     }
     case "nevent": {
-      let u = Ut(r);
+      let u = Lt(r);
       if (!((s = u[0]) != null && s[0]))
         throw new Error("missing TLV 0 for nevent");
       if (u[0][0].length !== 32)
@@ -2668,15 +2682,15 @@ function gt(e) {
       return {
         type: "nevent",
         data: {
-          id: P(u[0][0]),
-          relays: u[1] ? u[1].map((g) => ue.decode(g)) : [],
-          author: (o = u[2]) != null && o[0] ? P(u[2][0]) : void 0,
-          kind: (c = u[3]) != null && c[0] ? parseInt(P(u[3][0]), 16) : void 0
+          id: H(u[0][0]),
+          relays: u[1] ? u[1].map((g) => le.decode(g)) : [],
+          author: (o = u[2]) != null && o[0] ? H(u[2][0]) : void 0,
+          kind: (c = u[3]) != null && c[0] ? parseInt(H(u[3][0]), 16) : void 0
         }
       };
     }
     case "naddr": {
-      let u = Ut(r);
+      let u = Lt(r);
       if (!((a = u[0]) != null && a[0]))
         throw new Error("missing TLV 0 for naddr");
       if (!((l = u[2]) != null && l[0]))
@@ -2690,10 +2704,10 @@ function gt(e) {
       return {
         type: "naddr",
         data: {
-          identifier: ue.decode(u[0][0]),
-          pubkey: P(u[2][0]),
-          kind: parseInt(P(u[3][0]), 16),
-          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
+          identifier: le.decode(u[0][0]),
+          pubkey: H(u[2][0]),
+          kind: parseInt(H(u[3][0]), 16),
+          relays: u[1] ? u[1].map((g) => le.decode(g)) : []
         }
       };
     }
@@ -2701,12 +2715,12 @@ function gt(e) {
       return { type: t, data: r };
     case "npub":
     case "note":
-      return { type: t, data: P(r) };
+      return { type: t, data: H(r) };
     default:
       throw new Error(`unknown prefix ${t}`);
   }
 }
-function Ut(e) {
+function Lt(e) {
   let t = {}, n = e;
   for (; n.length > 0; ) {
     let r = n[0], i = n[1], s = n.slice(2, 2 + i);
@@ -2716,98 +2730,98 @@ function Ut(e) {
   }
   return t;
 }
-function Oa(e) {
-  return bt("nsec", e);
+function qa(e) {
+  return mt("nsec", e);
 }
-function Pa(e) {
-  return bt("npub", z(e));
+function Da(e) {
+  return mt("npub", z(e));
 }
-function Ma(e) {
-  return bt("note", z(e));
+function ja(e) {
+  return mt("note", z(e));
 }
-function wt(e, t) {
+function vt(e, t) {
   let n = ze.toWords(t);
-  return ze.encode(e, n, ln);
+  return ze.encode(e, n, hn);
 }
-function bt(e, t) {
-  return wt(e, t);
+function mt(e, t) {
+  return vt(e, t);
 }
-function Ha(e) {
-  let t = fn({
+function za(e) {
+  let t = dn({
     0: [z(e.pubkey)],
     1: (e.relays || []).map((n) => ne.encode(n))
   });
-  return wt("nprofile", t);
+  return vt("nprofile", t);
 }
-function qa(e) {
+function Wa(e) {
   let t;
-  e.kind !== void 0 && (t = Ra(e.kind));
-  let n = fn({
+  e.kind !== void 0 && (t = Pa(e.kind));
+  let n = dn({
     0: [z(e.id)],
     1: (e.relays || []).map((r) => ne.encode(r)),
     2: e.author ? [z(e.author)] : [],
     3: t ? [new Uint8Array(t)] : []
   });
-  return wt("nevent", n);
+  return vt("nevent", n);
 }
-function Da(e) {
+function Va(e) {
   let t = new ArrayBuffer(4);
   new DataView(t).setUint32(0, e.kind, !1);
-  let n = fn({
+  let n = dn({
     0: [ne.encode(e.identifier)],
     1: (e.relays || []).map((r) => ne.encode(r)),
     2: [z(e.pubkey)],
     3: [new Uint8Array(t)]
   });
-  return wt("naddr", n);
+  return vt("naddr", n);
 }
-function fn(e) {
+function dn(e) {
   let t = [];
   return Object.entries(e).reverse().forEach(([n, r]) => {
     r.forEach((i) => {
       let s = new Uint8Array(i.length + 2);
       s.set([parseInt(n)], 0), s.set([i.length], 1), s.set(i, 2), t.push(s);
     });
-  }), lt(...t);
+  }), ft(...t);
 }
-var ja = {};
-D(ja, {
-  decrypt: () => za,
-  encrypt: () => zr
+var Za = {};
+P(Za, {
+  decrypt: () => Ga,
+  encrypt: () => Gr
 });
-async function zr(e, t, n) {
-  const r = e instanceof Uint8Array ? P(e) : e, i = Ie.getSharedSecret(r, "02" + t), s = Vr(i);
-  let o = Uint8Array.from(fr(16)), c = ne.encode(n), a = Er(s, o).encrypt(c), l = he.encode(new Uint8Array(a)), f = he.encode(new Uint8Array(o.buffer));
+function Gr(e, t, n) {
+  const r = e instanceof Uint8Array ? H(e) : e, i = Ie.getSharedSecret(r, "02" + t), s = Fr(i);
+  let o = Uint8Array.from(yr(16)), c = ne.encode(n), a = Sr(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 ? P(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 = Er(c, a).decrypt(l);
-  return ue.decode(f);
+function Ga(e, t, n) {
+  const r = e instanceof Uint8Array ? H(e) : e;
+  let [i, s] = n.split("?iv="), o = Ie.getSharedSecret(r, "02" + t), c = Fr(o), a = he.decode(s), l = he.decode(i), f = Sr(c, a).decrypt(l);
+  return le.decode(f);
 }
-function Vr(e) {
+function Fr(e) {
   return e.slice(1, 33);
 }
-var Va = {};
-D(Va, {
-  NIP05_REGEX: () => hn,
-  isNip05: () => Wa,
-  isValid: () => Fa,
-  queryProfile: () => Wr,
-  searchDomain: () => Ga,
-  useFetchImplementation: () => Za
+var Fa = {};
+P(Fa, {
+  NIP05_REGEX: () => pn,
+  isNip05: () => Ja,
+  isValid: () => Qa,
+  queryProfile: () => Jr,
+  searchDomain: () => Xa,
+  useFetchImplementation: () => Ya
 });
-var hn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Wa = (e) => hn.test(e || ""), vt;
+var pn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Ja = (e) => pn.test(e || ""), Et;
 try {
-  vt = fetch;
+  Et = fetch;
 } catch {
 }
-function Za(e) {
-  vt = e;
+function Ya(e) {
+  Et = e;
 }
-async function Ga(e, t = "") {
+async function Xa(e, t = "") {
   try {
-    const n = `https://${e}/.well-known/nostr.json?name=${t}`, r = await vt(n, { redirect: "manual" });
+    const n = `https://${e}/.well-known/nostr.json?name=${t}`, r = await Et(n, { redirect: "manual" });
     if (r.status !== 200)
       throw Error("Wrong response code");
     return (await r.json()).names;
@@ -2815,14 +2829,14 @@ async function Ga(e, t = "") {
     return {};
   }
 }
-async function Wr(e) {
+async function Jr(e) {
   var i;
-  const t = e.match(hn);
+  const t = e.match(pn);
   if (!t)
     return null;
   const [, n = "_", r] = t;
   try {
-    const s = `https://${r}/.well-known/nostr.json?name=${n}`, o = await vt(s, { redirect: "manual" });
+    const s = `https://${r}/.well-known/nostr.json?name=${n}`, o = await Et(s, { redirect: "manual" });
     if (o.status !== 200)
       throw Error("Wrong response code");
     const c = await o.json(), a = c.names[n];
@@ -2831,15 +2845,15 @@ async function Wr(e) {
     return null;
   }
 }
-async function Fa(e, t) {
-  const n = await Wr(t);
+async function Qa(e, t) {
+  const n = await Jr(t);
   return n ? n.pubkey === e : !1;
 }
-var Ja = {};
-D(Ja, {
-  parse: () => Ya
+var ec = {};
+P(ec, {
+  parse: () => tc
 });
-function Ya(e) {
+function tc(e) {
   const t = {
     reply: void 0,
     root: void 0,
@@ -2906,31 +2920,31 @@ function Ya(e) {
     }
   }), t;
 }
-var Xa = {};
-D(Xa, {
-  fetchRelayInformation: () => ec,
-  useFetchImplementation: () => Qa
+var nc = {};
+P(nc, {
+  fetchRelayInformation: () => ic,
+  useFetchImplementation: () => rc
 });
-var Zr;
+var Yr;
 try {
-  Zr = fetch;
+  Yr = fetch;
 } catch {
 }
-function Qa(e) {
-  Zr = e;
+function rc(e) {
+  Yr = e;
 }
-async function ec(e) {
+async function ic(e) {
   return await (await fetch(e.replace("ws://", "http://").replace("wss://", "https://"), {
     headers: { Accept: "application/nostr+json" }
   })).json();
 }
-var tc = {};
-D(tc, {
-  fastEventHash: () => Fr,
-  getPow: () => Gr,
-  minePow: () => nc
+var sc = {};
+P(sc, {
+  fastEventHash: () => Qr,
+  getPow: () => Xr,
+  minePow: () => oc
 });
-function Gr(e) {
+function Xr(e) {
   let t = 0;
   for (let n = 0; n < 64; n += 8) {
     const r = parseInt(e.substring(n, n + 8), 16);
@@ -2943,40 +2957,232 @@ function Gr(e) {
   }
   return t;
 }
-function nc(e, t) {
+function oc(e, t) {
   let n = 0;
   const r = e, i = ["nonce", n.toString(), t.toString()];
   for (r.tags.push(i); ; ) {
     const s = Math.floor((/* @__PURE__ */ new Date()).getTime() / 1e3);
-    if (s !== r.created_at && (n = 0, r.created_at = s), i[1] = (++n).toString(), r.id = Fr(r), Gr(r.id) >= t)
+    if (s !== r.created_at && (n = 0, r.created_at = s), i[1] = (++n).toString(), r.id = Qr(r), Xr(r.id) >= t)
       break;
   }
   return r;
 }
-function Fr(e) {
-  return P(
+function Qr(e) {
+  return H(
     fe(ne.encode(JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content])))
   );
 }
-var rc = {};
-D(rc, {
-  finishRepostEvent: () => ic,
-  getRepostedEvent: () => sc,
-  getRepostedEventPointer: () => Jr
+var ac = {};
+P(ac, {
+  unwrapEvent: () => bc,
+  unwrapManyEvents: () => vc,
+  wrapEvent: () => hi,
+  wrapManyEvents: () => wc
+});
+var cc = {};
+P(cc, {
+  createRumor: () => ci,
+  createSeal: () => ui,
+  createWrap: () => li,
+  unwrapEvent: () => vn,
+  unwrapManyEvents: () => fi,
+  wrapEvent: () => st,
+  wrapManyEvents: () => yc
+});
+var D = {};
+P(D, {
+  decrypt: () => bn,
+  encrypt: () => wn,
+  getConversationKey: () => yn,
+  v2: () => dc
 });
-function ic(e, t, n, r) {
+var ei = 1, ti = 65535;
+function yn(e, t) {
+  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return rn(fe, n, "nip44-v2");
+}
+function ni(e, t) {
+  const n = Ir(fe, e, t, 76);
+  return {
+    chacha_key: n.subarray(0, 32),
+    chacha_nonce: n.subarray(32, 44),
+    hmac_key: n.subarray(44, 76)
+  };
+}
+function gn(e) {
+  if (!Number.isSafeInteger(e) || e < 1)
+    throw new Error("expected positive integer");
+  if (e <= 32)
+    return 32;
+  const t = 1 << Math.floor(Math.log2(e - 1)) + 1, n = t <= 256 ? 32 : t / 8;
+  return n * (Math.floor((e - 1) / n) + 1);
+}
+function uc(e) {
+  if (!Number.isSafeInteger(e) || e < ei || e > ti)
+    throw new Error("invalid plaintext size: must be between 1 and 65535 bytes");
+  const t = new Uint8Array(2);
+  return new DataView(t.buffer).setUint16(0, e, !1), t;
+}
+function lc(e) {
+  const t = ne.encode(e), n = t.length, r = uc(n), i = new Uint8Array(gn(n) - n);
+  return ft(r, t, i);
+}
+function fc(e) {
+  const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
+  if (t < ei || t > ti || n.length !== t || e.length !== 2 + gn(t))
+    throw new Error("invalid padding");
+  return le.decode(n);
+}
+function ri(e, t, n) {
+  if (n.length !== 32)
+    throw new Error("AAD associated data must be 32 bytes");
+  const r = ft(n, t);
+  return dt(fe, e, r);
+}
+function hc(e) {
+  if (typeof e != "string")
+    throw new Error("payload must be a valid string");
+  const t = e.length;
+  if (t < 132 || t > 87472)
+    throw new Error("invalid payload length: " + t);
+  if (e[0] === "#")
+    throw new Error("unknown encryption version");
+  let n;
+  try {
+    n = he.decode(e);
+  } catch (s) {
+    throw new Error("invalid base64: " + s.message);
+  }
+  const r = n.length;
+  if (r < 99 || r > 65603)
+    throw new Error("invalid data length: " + r);
+  const i = n[0];
+  if (i !== 2)
+    throw new Error("unknown encryption version " + i);
+  return {
+    nonce: n.subarray(1, 33),
+    ciphertext: n.subarray(33, -32),
+    mac: n.subarray(-32)
+  };
+}
+function wn(e, t, n = yr(32)) {
+  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ni(t, n), o = lc(e), c = kr(r, i, o), a = ri(s, c, n);
+  return he.encode(ft(new Uint8Array([2]), n, c, a));
+}
+function bn(e, t) {
+  const { nonce: n, ciphertext: r, mac: i } = hc(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = ni(t, n), a = ri(c, r, n);
+  if (!qs(a, i))
+    throw new Error("invalid MAC");
+  const l = kr(s, o, r);
+  return fc(l);
+}
+var dc = {
+  utils: {
+    getConversationKey: yn,
+    calcPaddedLen: gn
+  },
+  encrypt: wn,
+  decrypt: bn
+}, pc = 2 * 24 * 60 * 60, ii = () => Math.round(Date.now() / 1e3), si = () => Math.round(ii() - Math.random() * pc), oi = (e, t) => yn(e, t), ai = (e, t, n) => wn(JSON.stringify(e), oi(t, n)), zn = (e, t) => JSON.parse(bn(e.content, oi(t, e.pubkey)));
+function ci(e, t) {
+  const n = {
+    created_at: ii(),
+    content: "",
+    tags: [],
+    ...e,
+    pubkey: ae(t)
+  };
+  return n.id = qe(n), n;
+}
+function ui(e, t, n) {
+  return Q(
+    {
+      kind: Tr,
+      content: ai(e, t, n),
+      created_at: si(),
+      tags: []
+    },
+    t
+  );
+}
+function li(e, t) {
+  const n = ke();
   return Q(
     {
-      kind: on,
-      tags: [...e.tags ?? [], ["e", t.id, n], ["p", t.pubkey]],
-      content: e.content === "" ? "" : JSON.stringify(t),
+      kind: jr,
+      content: ai(e, n, t),
+      created_at: si(),
+      tags: [["p", t]]
+    },
+    n
+  );
+}
+function st(e, t, n) {
+  const r = ci(e, t), i = ui(r, t, n);
+  return li(i, n);
+}
+function yc(e, t, n) {
+  if (!n || n.length === 0)
+    throw new Error("At least one recipient is required.");
+  const r = ae(t), i = [st(e, t, r)];
+  return n.forEach((s) => {
+    i.push(st(e, t, s));
+  }), i;
+}
+function vn(e, t) {
+  const n = zn(e, t);
+  return zn(n, t);
+}
+function fi(e, t) {
+  let n = [];
+  return e.forEach((r) => {
+    n.push(vn(r, t));
+  }), n.sort((r, i) => r.created_at - i.created_at), n;
+}
+function gc(e, t, n, r) {
+  const i = {
+    created_at: Math.ceil(Date.now() / 1e3),
+    kind: Or,
+    tags: [],
+    content: t
+  };
+  return (Array.isArray(e) ? e : [e]).forEach(({ publicKey: o, relayUrl: c }) => {
+    i.tags.push(c ? ["p", o, c] : ["p", o]);
+  }), r && i.tags.push(["e", r.eventId, r.relayUrl || "", "reply"]), n && i.tags.push(["subject", n]), i;
+}
+function hi(e, t, n, r, i) {
+  const s = gc(t, n, r, i);
+  return st(s, e, t.publicKey);
+}
+function wc(e, t, n, r, i) {
+  if (!t || t.length === 0)
+    throw new Error("At least one recipient is required.");
+  return [{ publicKey: ae(e) }, ...t].map(
+    (o) => hi(e, o, n, r, i)
+  );
+}
+var bc = vn, vc = fi, mc = {};
+P(mc, {
+  finishRepostEvent: () => Ec,
+  getRepostedEvent: () => xc,
+  getRepostedEventPointer: () => di
+});
+function Ec(e, t, n, r) {
+  var o;
+  let i;
+  const s = [...e.tags ?? [], ["e", t.id, n], ["p", t.pubkey]];
+  return t.kind === Rr ? i = an : (i = un, s.push(["k", String(t.kind)])), Q(
+    {
+      kind: i,
+      tags: s,
+      content: e.content === "" || (o = t.tags) != null && o.find((c) => c[0] === "-") ? "" : JSON.stringify(t),
       created_at: e.created_at
     },
     r
   );
 }
-function Jr(e) {
-  if (e.kind !== on)
+function di(e) {
+  if (![an, un].includes(e.kind))
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -2990,8 +3196,8 @@ function Jr(e) {
       author: n == null ? void 0 : n[1]
     };
 }
-function sc(e, { skipVerification: t } = {}) {
-  const n = Jr(e);
+function xc(e, { skipVerification: t } = {}) {
+  const n = di(e);
   if (n === void 0 || e.content === "")
     return;
   let r;
@@ -3000,48 +3206,48 @@ function sc(e, { skipVerification: t } = {}) {
   } catch {
     return;
   }
-  if (r.id === n.id && !(!t && !pt(r)))
+  if (r.id === n.id && !(!t && !gt(r)))
     return r;
 }
-var oc = {};
-D(oc, {
-  NOSTR_URI_REGEX: () => mt,
-  parse: () => cc,
-  test: () => ac
+var Kc = {};
+P(Kc, {
+  NOSTR_URI_REGEX: () => mn,
+  parse: () => Sc,
+  test: () => Nc
 });
-var mt = new RegExp(`nostr:(${jr.source})`);
-function ac(e) {
-  return typeof e == "string" && new RegExp(`^${mt.source}$`).test(e);
+var mn = new RegExp(`nostr:(${Zr.source})`);
+function Nc(e) {
+  return typeof e == "string" && new RegExp(`^${mn.source}$`).test(e);
 }
-function cc(e) {
-  const t = e.match(new RegExp(`^${mt.source}$`));
+function Sc(e) {
+  const t = e.match(new RegExp(`^${mn.source}$`));
   if (!t)
     throw new Error(`Invalid Nostr URI: ${e}`);
   return {
     uri: t[0],
     value: t[1],
-    decoded: gt(t[1])
+    decoded: bt(t[1])
   };
 }
-var uc = {};
-D(uc, {
-  finishReactionEvent: () => lc,
-  getReactedEventPointer: () => fc
+var Ac = {};
+P(Ac, {
+  finishReactionEvent: () => Cc,
+  getReactedEventPointer: () => Bc
 });
-function lc(e, t, n) {
+function Cc(e, t, n) {
   const r = t.tags.filter((i) => i.length >= 2 && (i[0] === "e" || i[0] === "p"));
   return Q(
     {
       ...e,
-      kind: an,
+      kind: cn,
       tags: [...e.tags ?? [], ...r, ["e", t.id], ["p", t.pubkey]],
       content: e.content ?? "+"
     },
     n
   );
 }
-function fc(e) {
-  if (e.kind !== an)
+function Bc(e) {
+  if (e.kind !== cn)
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -3055,44 +3261,91 @@ function fc(e) {
       author: n[1]
     };
 }
-var hc = {};
-D(hc, {
-  matchAll: () => dc,
-  regex: () => dn,
-  replaceAll: () => yc
+var kc = {};
+P(kc, {
+  parse: () => Ic
 });
-var dn = () => new RegExp(`\\b${mt.source}\\b`, "g");
-function* dc(e) {
-  const t = e.matchAll(dn());
-  for (const n of t)
-    try {
-      const [r, i] = n;
-      yield {
-        uri: r,
-        value: i,
-        decoded: gt(i),
-        start: n.index,
-        end: n.index + r.length
-      };
-    } catch {
+var _c = /\W/m, Wn = /\W |\W$|$|,| /m;
+function* Ic(e) {
+  const t = e.length;
+  let n = 0, r = 0;
+  for (; r < t; ) {
+    let i = e.indexOf(":", r);
+    if (i === -1)
+      break;
+    if (e.substring(i - 5, i) === "nostr") {
+      const s = e.substring(i + 60).match(_c), o = s ? i + 60 + s.index : t;
+      try {
+        let c, { data: a, type: l } = bt(e.substring(i + 1, o));
+        switch (l) {
+          case "npub":
+            c = { pubkey: a };
+            break;
+          case "nsec":
+          case "note":
+            r = o + 1;
+            continue;
+          default:
+            c = a;
+        }
+        n !== i - 5 && (yield { type: "text", text: e.substring(n, i - 5) }), yield { type: "reference", pointer: c }, r = o, n = r;
+        continue;
+      } catch {
+        r = i + 1;
+        continue;
+      }
+    } else if (e.substring(i - 5, i) === "https" || e.substring(i - 4, i) === "http") {
+      const s = e.substring(i + 4).match(Wn), o = s ? i + 4 + s.index : t, c = e[i - 1] === "s" ? 5 : 4;
+      try {
+        let a = new URL(e.substring(i - c, o));
+        if (a.hostname.indexOf(".") === -1)
+          throw new Error("invalid url");
+        if (n !== i - c && (yield { type: "text", text: e.substring(n, i - c) }), a.pathname.endsWith(".png") || a.pathname.endsWith(".jpg") || a.pathname.endsWith(".jpeg") || a.pathname.endsWith(".gif") || a.pathname.endsWith(".webp")) {
+          yield { type: "image", url: a.toString() }, r = o, n = r;
+          continue;
+        }
+        if (a.pathname.endsWith(".mp4") || a.pathname.endsWith(".avi") || a.pathname.endsWith(".webm") || a.pathname.endsWith(".mkv")) {
+          yield { type: "video", url: a.toString() }, r = o, n = r;
+          continue;
+        }
+        if (a.pathname.endsWith(".mp3") || a.pathname.endsWith(".aac") || a.pathname.endsWith(".ogg") || a.pathname.endsWith(".opus")) {
+          yield { type: "audio", url: a.toString() }, r = o, n = r;
+          continue;
+        }
+        yield { type: "url", url: a.toString() }, r = o, n = r;
+        continue;
+      } catch {
+        r = o + 1;
+        continue;
+      }
+    } else if (e.substring(i - 3, i) === "wss" || e.substring(i - 2, i) === "ws") {
+      const s = e.substring(i + 4).match(Wn), o = s ? i + 4 + s.index : t, c = e[i - 1] === "s" ? 3 : 2;
+      try {
+        let a = new URL(e.substring(i - c, o));
+        if (a.hostname.indexOf(".") === -1)
+          throw new Error("invalid ws url");
+        n !== i - c && (yield { type: "text", text: e.substring(n, i - c) }), yield { type: "relay", url: a.toString() }, r = o, n = r;
+        continue;
+      } catch {
+        r = o + 1;
+        continue;
+      }
+    } else {
+      r = i + 1;
+      continue;
     }
+  }
+  n !== t && (yield { type: "text", text: e.substring(n) });
 }
-function yc(e, t) {
-  return e.replaceAll(dn(), (n, r) => t({
-    uri: n,
-    value: r,
-    decoded: gt(r)
-  }));
-}
-var pc = {};
-D(pc, {
-  channelCreateEvent: () => gc,
-  channelHideMessageEvent: () => vc,
-  channelMessageEvent: () => bc,
-  channelMetadataEvent: () => wc,
-  channelMuteUserEvent: () => mc
+var Uc = {};
+P(Uc, {
+  channelCreateEvent: () => Lc,
+  channelHideMessageEvent: () => Tc,
+  channelMessageEvent: () => Rc,
+  channelMetadataEvent: () => $c,
+  channelMuteUserEvent: () => Oc
 });
-var gc = (e, t) => {
+var Lc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3102,14 +3355,14 @@ var gc = (e, t) => {
     return;
   return Q(
     {
-      kind: $r,
+      kind: Mr,
       tags: [...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, wc = (e, t) => {
+}, $c = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3119,25 +3372,25 @@ var gc = (e, t) => {
     return;
   return Q(
     {
-      kind: Tr,
+      kind: Pr,
       tags: [["e", e.channel_create_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, bc = (e, t) => {
+}, Rc = (e, t) => {
   const n = [["e", e.channel_create_event_id, e.relay_url, "root"]];
   return e.reply_to_channel_message_event_id && n.push(["e", e.reply_to_channel_message_event_id, e.relay_url, "reply"]), Q(
     {
-      kind: Rr,
+      kind: Hr,
       tags: [...n, ...e.tags ?? []],
       content: e.content,
       created_at: e.created_at
     },
     t
   );
-}, vc = (e, t) => {
+}, Tc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3147,14 +3400,14 @@ var gc = (e, t) => {
     return;
   return Q(
     {
-      kind: Or,
+      kind: qr,
       tags: [["e", e.channel_message_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, mc = (e, t) => {
+}, Oc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3164,23 +3417,23 @@ var gc = (e, t) => {
     return;
   return Q(
     {
-      kind: Pr,
+      kind: Dr,
       tags: [["p", e.pubkey_to_mute], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, Ec = {};
-D(Ec, {
-  EMOJI_SHORTCODE_REGEX: () => Yr,
-  matchAll: () => xc,
-  regex: () => yn,
-  replaceAll: () => Kc
+}, Mc = {};
+P(Mc, {
+  EMOJI_SHORTCODE_REGEX: () => pi,
+  matchAll: () => Pc,
+  regex: () => En,
+  replaceAll: () => Hc
 });
-var Yr = /:(\w+):/, yn = () => new RegExp(`\\B${Yr.source}\\B`, "g");
-function* xc(e) {
-  const t = e.matchAll(yn());
+var pi = /:(\w+):/, En = () => new RegExp(`\\B${pi.source}\\B`, "g");
+function* Pc(e) {
+  const t = e.matchAll(En());
   for (const n of t)
     try {
       const [r, i] = n;
@@ -3193,186 +3446,99 @@ function* xc(e) {
     } catch {
     }
 }
-function Kc(e, t) {
-  return e.replaceAll(yn(), (n, r) => t({
+function Hc(e, t) {
+  return e.replaceAll(En(), (n, r) => t({
     shortcode: n,
     name: r
   }));
 }
-var Nc = {};
-D(Nc, {
-  useFetchImplementation: () => Sc,
-  validateGithub: () => Ac
+var qc = {};
+P(qc, {
+  useFetchImplementation: () => Dc,
+  validateGithub: () => jc
 });
-var pn;
+var xn;
 try {
-  pn = fetch;
+  xn = fetch;
 } catch {
 }
-function Sc(e) {
-  pn = e;
+function Dc(e) {
+  xn = e;
 }
-async function Ac(e, t, n) {
+async function jc(e, t, n) {
   try {
-    return await (await pn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
+    return await (await xn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
   } catch {
     return !1;
   }
 }
-var q = {};
-D(q, {
-  decrypt: () => vn,
-  encrypt: () => bn,
-  getConversationKey: () => gn,
-  v2: () => Ic
+var zc = {};
+P(zc, {
+  makeNwcRequestEvent: () => Vc,
+  parseConnectionString: () => Wc
 });
-var Xr = 1, Qr = 65535;
-function gn(e, t) {
-  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return rn(fe, n, "nip44-v2");
-}
-function ei(e, t) {
-  const n = Cr(fe, e, t, 76);
-  return {
-    chacha_key: n.subarray(0, 32),
-    chacha_nonce: n.subarray(32, 44),
-    hmac_key: n.subarray(44, 76)
-  };
-}
-function wn(e) {
-  if (!Number.isSafeInteger(e) || e < 1)
-    throw new Error("expected positive integer");
-  if (e <= 32)
-    return 32;
-  const t = 1 << Math.floor(Math.log2(e - 1)) + 1, n = t <= 256 ? 32 : t / 8;
-  return n * (Math.floor((e - 1) / n) + 1);
-}
-function Cc(e) {
-  if (!Number.isSafeInteger(e) || e < Xr || e > Qr)
-    throw new Error("invalid plaintext size: must be between 1 and 65535 bytes");
-  const t = new Uint8Array(2);
-  return new DataView(t.buffer).setUint16(0, e, !1), t;
-}
-function Bc(e) {
-  const t = ne.encode(e), n = t.length, r = Cc(n), i = new Uint8Array(wn(n) - n);
-  return lt(r, t, i);
-}
-function kc(e) {
-  const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
-  if (t < Xr || t > Qr || n.length !== t || e.length !== 2 + wn(t))
-    throw new Error("invalid padding");
-  return ue.decode(n);
-}
-function ti(e, t, n) {
-  if (n.length !== 32)
-    throw new Error("AAD associated data must be 32 bytes");
-  const r = lt(n, t);
-  return ht(fe, e, r);
-}
-function _c(e) {
-  if (typeof e != "string")
-    throw new Error("payload must be a valid string");
-  const t = e.length;
-  if (t < 132 || t > 87472)
-    throw new Error("invalid payload length: " + t);
-  if (e[0] === "#")
-    throw new Error("unknown encryption version");
-  let n;
-  try {
-    n = he.decode(e);
-  } catch (s) {
-    throw new Error("invalid base64: " + s.message);
-  }
-  const r = n.length;
-  if (r < 99 || r > 65603)
-    throw new Error("invalid data length: " + r);
-  const i = n[0];
-  if (i !== 2)
-    throw new Error("unknown encryption version " + i);
-  return {
-    nonce: n.subarray(1, 33),
-    ciphertext: n.subarray(33, -32),
-    mac: n.subarray(-32)
-  };
-}
-function bn(e, t, n = fr(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ei(t, n), o = Bc(e), c = Sr(r, i, o), a = ti(s, c, n);
-  return he.encode(lt(new Uint8Array([2]), n, c, a));
-}
-function vn(e, t) {
-  const { nonce: n, ciphertext: r, mac: i } = _c(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = ei(t, n), a = ti(c, r, n);
-  if (!Rs(a, i))
-    throw new Error("invalid MAC");
-  const l = Sr(s, o, r);
-  return kc(l);
-}
-var Ic = {
-  utils: {
-    getConversationKey: gn,
-    calcPaddedLen: wn
-  },
-  encrypt: bn,
-  decrypt: vn
-}, Uc = {};
-D(Uc, {
-  makeNwcRequestEvent: () => $c,
-  parseConnectionString: () => Lc
-});
-function Lc(e) {
+function Wc(e) {
   const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), s = n.get("secret");
   if (!r || !i || !s)
     throw new Error("invalid connection string");
   return { pubkey: r, relay: i, secret: s };
 }
-async function $c(e, t, n) {
-  const i = await zr(t, e, JSON.stringify({
+async function Vc(e, t, n) {
+  const i = await Gr(t, e, JSON.stringify({
     method: "pay_invoice",
     params: {
       invoice: n
     }
   })), s = {
-    kind: qr,
+    kind: Wr,
     created_at: Math.round(Date.now() / 1e3),
     content: i,
     tags: [["p", e]]
   };
   return Q(s, t);
 }
-var Tc = {};
-D(Tc, {
-  getZapEndpoint: () => Oc,
-  makeZapReceipt: () => Hc,
-  makeZapRequest: () => Pc,
-  useFetchImplementation: () => Rc,
-  validateZapRequest: () => Mc
+var Zc = {};
+P(Zc, {
+  normalizeIdentifier: () => Gc
+});
+function Gc(e) {
+  return e = e.trim().toLowerCase(), e = e.normalize("NFKC"), Array.from(e).map((t) => new RegExp("\\p{Letter}", "u").test(t) || new RegExp("\\p{Number}", "u").test(t) ? t : "-").join("");
+}
+var Fc = {};
+P(Fc, {
+  getZapEndpoint: () => Yc,
+  makeZapReceipt: () => eu,
+  makeZapRequest: () => Xc,
+  useFetchImplementation: () => Jc,
+  validateZapRequest: () => Qc
 });
-var mn;
+var Kn;
 try {
-  mn = fetch;
+  Kn = fetch;
 } catch {
 }
-function Rc(e) {
-  mn = e;
+function Jc(e) {
+  Kn = e;
 }
-async function Oc(e) {
+async function Yc(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
       let { words: o } = ze.decode(n, 1e3), c = ze.fromWords(o);
-      t = ue.decode(c);
+      t = le.decode(c);
     } else if (r) {
       let [o, c] = r.split("@");
       t = new URL(`/.well-known/lnurlp/${o}`, `https://${c}`).toString();
     } else
       return null;
-    let s = await (await mn(t)).json();
+    let s = await (await Kn(t)).json();
     if (s.allowsNostr && s.nostrPubkey)
       return s.callback;
   } catch {
   }
   return null;
 }
-function Pc({
+function Xc({
   profile: e,
   event: t,
   amount: n,
@@ -3393,18 +3559,30 @@ function Pc({
       ["relays", ...r]
     ]
   };
-  return t && s.tags.push(["e", t]), s;
+  if (t && typeof t == "string" && s.tags.push(["e", t]), t && typeof t == "object") {
+    if (on(t.kind)) {
+      const o = ["a", `${t.kind}:${t.pubkey}:`];
+      s.tags.push(o);
+    } else if (wt(t.kind)) {
+      let o = t.tags.find(([a, l]) => a === "d" && l);
+      if (!o)
+        throw new Error("d tag not found or is empty");
+      const c = ["a", `${t.kind}:${t.pubkey}:${o[1]}`];
+      s.tags.push(c);
+    }
+  }
+  return s;
 }
-function Mc(e) {
+function Qc(e) {
   let t;
   try {
     t = JSON.parse(e);
   } catch {
     return "Invalid zap request JSON.";
   }
-  if (!dt(t))
-    return "Zap request is not a valid Nostr event.";
   if (!pt(t))
+    return "Zap request is not a valid Nostr event.";
+  if (!gt(t))
     return "Invalid signature on zap request.";
   let n = t.tags.find(([s, o]) => s === "p" && o);
   if (!n)
@@ -3414,7 +3592,7 @@ function Mc(e) {
   let r = t.tags.find(([s, o]) => s === "e" && o);
   return r && !r[1].match(/^[a-f0-9]{64}$/) ? "Zap request 'e' tag is not valid hex." : t.tags.find(([s, o]) => s === "relays" && o) ? null : "Zap request doesn't have a 'relays' tag.";
 }
-function Hc({
+function eu({
   zapRequest: e,
   preimage: t,
   bolt11: n,
@@ -3428,89 +3606,23 @@ function Hc({
   };
   return t && o.tags.push(["preimage", t]), o;
 }
-var qc = {};
-D(qc, {
-  createRumor: () => oi,
-  createSeal: () => ai,
-  createWrap: () => ci,
-  unwrapEvent: () => ui,
-  unwrapManyEvents: () => zc,
-  wrapEvent: () => Vt,
-  wrapManyEvents: () => jc
-});
-var Dc = 2 * 24 * 60 * 60, ni = () => Math.round(Date.now() / 1e3), ri = () => Math.round(ni() - Math.random() * Dc), ii = (e, t) => gn(e, t), si = (e, t, n) => bn(JSON.stringify(e), ii(t, n)), qn = (e, t) => JSON.parse(vn(e.content, ii(t, e.pubkey)));
-function oi(e, t) {
-  const n = {
-    created_at: ni(),
-    content: "",
-    tags: [],
-    ...e,
-    pubkey: le(t)
-  };
-  return n.id = qe(n), n;
-}
-function ai(e, t, n) {
-  return Q(
-    {
-      kind: Lr,
-      content: si(e, t, n),
-      created_at: ri(),
-      tags: []
-    },
-    t
-  );
-}
-function ci(e, t) {
-  const n = ke();
-  return Q(
-    {
-      kind: Mr,
-      content: si(e, n, t),
-      created_at: ri(),
-      tags: [["p", t]]
-    },
-    n
-  );
-}
-function Vt(e, t, n) {
-  const r = oi(e, t), i = ai(r, t, n);
-  return ci(i, n);
-}
-function jc(e, t, n) {
-  if (!n || n.length === 0)
-    throw new Error("At least one recipient is required.");
-  const r = le(t), i = [Vt(e, t, r)];
-  return n.forEach((s) => {
-    i.push(Vt(e, t, s));
-  }), i;
-}
-function ui(e, t) {
-  const n = qn(e, t);
-  return qn(n, t);
-}
-function zc(e, t) {
-  let n = [];
-  return e.forEach((r) => {
-    n.push(ui(r, t));
-  }), n.sort((r, i) => r.created_at - i.created_at), n;
-}
-var Vc = {};
-D(Vc, {
-  getToken: () => Wc,
-  hashPayload: () => En,
-  unpackEventFromToken: () => fi,
-  validateEvent: () => wi,
-  validateEventKind: () => di,
-  validateEventMethodTag: () => pi,
-  validateEventPayloadTag: () => gi,
-  validateEventTimestamp: () => hi,
-  validateEventUrlTag: () => yi,
-  validateToken: () => Zc
+var tu = {};
+P(tu, {
+  getToken: () => nu,
+  hashPayload: () => Nn,
+  unpackEventFromToken: () => gi,
+  validateEvent: () => xi,
+  validateEventKind: () => bi,
+  validateEventMethodTag: () => mi,
+  validateEventPayloadTag: () => Ei,
+  validateEventTimestamp: () => wi,
+  validateEventUrlTag: () => vi,
+  validateToken: () => ru
 });
-var li = "Nostr ";
-async function Wc(e, t, n, r = !1, i) {
+var yi = "Nostr ";
+async function nu(e, t, n, r = !1, i) {
   const s = {
-    kind: cn,
+    kind: ln,
     tags: [
       ["u", e],
       ["method", t]
@@ -3518,84 +3630,84 @@ async function Wc(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && s.tags.push(["payload", En(i)]);
+  i && s.tags.push(["payload", Nn(i)]);
   const o = await n(s);
-  return (r ? li : "") + he.encode(ne.encode(JSON.stringify(o)));
+  return (r ? yi : "") + he.encode(ne.encode(JSON.stringify(o)));
 }
-async function Zc(e, t, n) {
-  const r = await fi(e).catch((s) => {
+async function ru(e, t, n) {
+  const r = await gi(e).catch((s) => {
     throw s;
   });
-  return await wi(r, t, n).catch((s) => {
+  return await xi(r, t, n).catch((s) => {
     throw s;
   });
 }
-async function fi(e) {
+async function gi(e) {
   if (!e)
     throw new Error("Missing token");
-  e = e.replace(li, "");
-  const t = ue.decode(he.decode(e));
+  e = e.replace(yi, "");
+  const t = le.decode(he.decode(e));
   if (!t || t.length === 0 || !t.startsWith("{"))
     throw new Error("Invalid token");
   return JSON.parse(t);
 }
-function hi(e) {
+function wi(e) {
   return e.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - e.created_at < 60 : !1;
 }
-function di(e) {
-  return e.kind === cn;
+function bi(e) {
+  return e.kind === ln;
 }
-function yi(e, t) {
+function vi(e, t) {
   const n = e.tags.find((r) => r[0] === "u");
   return n ? n.length > 0 && n[1] === t : !1;
 }
-function pi(e, t) {
+function mi(e, t) {
   const n = e.tags.find((r) => r[0] === "method");
   return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
 }
-function En(e) {
+function Nn(e) {
   const t = fe(ne.encode(JSON.stringify(e)));
-  return P(t);
+  return H(t);
 }
-function gi(e, t) {
+function Ei(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
   if (!n)
     return !1;
-  const r = En(t);
+  const r = Nn(t);
   return n.length > 0 && n[1] === r;
 }
-async function wi(e, t, n, r) {
-  if (!pt(e))
+async function xi(e, t, n, r) {
+  if (!gt(e))
     throw new Error("Invalid nostr event, signature invalid");
-  if (!di(e))
+  if (!bi(e))
     throw new Error("Invalid nostr event, kind invalid");
-  if (!hi(e))
+  if (!wi(e))
     throw new Error("Invalid nostr event, created_at timestamp invalid");
-  if (!yi(e, t))
+  if (!vi(e, t))
     throw new Error("Invalid nostr event, url tag invalid");
-  if (!pi(e, n))
+  if (!mi(e, n))
     throw new Error("Invalid nostr event, method tag invalid");
-  if (r && typeof r == "object" && Object.keys(r).length > 0 && !gi(e, r))
+  if (r && typeof r == "object" && Object.keys(r).length > 0 && !Ei(e, r))
     throw new Error("Invalid nostr event, payload tag does not match request body hash");
   return !0;
 }
-const Oe = 1060, Dn = 30078, jn = 1059, Gc = 14, au = 100, Fc = 1;
-function cu(e) {
+const Oe = 1060, Vn = 30078, Zn = 1059, iu = 14, wu = 100, su = 1;
+function bu(e) {
   return JSON.stringify({
-    version: Fc,
-    rootKey: P(e.rootKey),
+    version: su,
+    rootKey: H(e.rootKey),
     theirCurrentNostrPublicKey: e.theirCurrentNostrPublicKey,
     theirNextNostrPublicKey: e.theirNextNostrPublicKey,
     ourCurrentNostrKey: e.ourCurrentNostrKey ? {
       publicKey: e.ourCurrentNostrKey.publicKey,
-      privateKey: P(e.ourCurrentNostrKey.privateKey)
+      privateKey: H(e.ourCurrentNostrKey.privateKey)
     } : void 0,
     ourNextNostrKey: {
       publicKey: e.ourNextNostrKey.publicKey,
-      privateKey: P(e.ourNextNostrKey.privateKey)
+      privateKey: H(e.ourNextNostrKey.privateKey)
     },
-    receivingChainKey: e.receivingChainKey ? P(e.receivingChainKey) : void 0,
-    sendingChainKey: e.sendingChainKey ? P(e.sendingChainKey) : void 0,
+    receivingChainKey: e.receivingChainKey ? H(e.receivingChainKey) : void 0,
+    sendingChainKey: e.sendingChainKey ? H(e.sendingChainKey) : void 0,
     sendingChainMessageNumber: e.sendingChainMessageNumber,
     receivingChainMessageNumber: e.receivingChainMessageNumber,
     previousSendingChainMessageCount: e.previousSendingChainMessageCount,
@@ -3603,11 +3715,11 @@ function cu(e) {
       Object.entries(e.skippedKeys).map(([t, n]) => [
         t,
         {
-          headerKeys: n.headerKeys.map((r) => P(r)),
+          headerKeys: n.headerKeys.map((r) => H(r)),
           messageKeys: Object.fromEntries(
             Object.entries(n.messageKeys).map(([r, i]) => [
               r,
-              P(i)
+              H(i)
             ])
           )
         }
@@ -3615,7 +3727,7 @@ function cu(e) {
     )
   });
 }
-function uu(e) {
+function vu(e) {
   const t = JSON.parse(e);
   if (!t.version) {
     const n = {};
@@ -3678,7 +3790,7 @@ function uu(e) {
     )
   };
 }
-async function* lu(e) {
+async function* mu(e) {
   const t = [];
   let n = null;
   const r = e.onEvent((i) => {
@@ -3693,22 +3805,22 @@ async function* lu(e) {
     r();
   }
 }
-function Pe(e, t = new Uint8Array(32), n = 1) {
+function Me(e, t = new Uint8Array(32), n = 1) {
   const r = rn(fe, e, t), i = [];
   for (let s = 1; s <= n; s++)
-    i.push(Cr(fe, r, new Uint8Array([s]), 32));
+    i.push(Ir(fe, r, new Uint8Array([s]), 32));
   return i;
 }
-function fu(e, t) {
+function Eu(e, t) {
   return `${e}:${t}`;
 }
-function hu(e) {
+function xu(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 Jc = 1e3, Yc = "0000000000000000000000000000000000000000000000000000000000000000";
-class st {
+const ou = 1e3, au = "0000000000000000000000000000000000000000000000000000000000000000";
+class ot {
   // 1. CHANNEL PUBLIC INTERFACE
   constructor(t, n) {
     J(this, "skippedSubscription");
@@ -3721,7 +3833,7 @@ class st {
   }
   /**
    * Initializes a new secure communication session
-   * @param nostrSubscribe Function to subscribe to Nostr events
+   * @param nostrSubscribe Function to subscribe to Nostr events. Make sure it deduplicates events (doesnt return the same event twice), otherwise you'll see decryption errors!
    * @param theirNextNostrPublicKey The public key of the other party
    * @param ourCurrentPrivateKey Our current private key for Nostr
    * @param isInitiator Whether we are initiating the conversation (true) or responding (false)
@@ -3732,14 +3844,14 @@ class st {
   static init(t, n, r, i, s, o) {
     const c = ke();
     let a, l, f, u;
-    i ? ([a, l] = Pe(s, q.getConversationKey(c, n), 2), f = {
-      publicKey: le(r),
+    i ? ([a, l] = Me(s, D.getConversationKey(c, n), 2), f = {
+      publicKey: ae(r),
       privateKey: r
     }, u = {
-      publicKey: le(c),
+      publicKey: ae(c),
       privateKey: c
     }) : (a = s, l = void 0, f = void 0, u = {
-      publicKey: le(r),
+      publicKey: ae(r),
       privateKey: r
     });
     const g = {
@@ -3753,7 +3865,7 @@ class st {
       receivingChainMessageNumber: 0,
       previousSendingChainMessageCount: 0,
       skippedKeys: {}
-    }, w = new st(t, g);
+    }, w = new ot(t, g);
     return o && (w.name = o), w;
   }
   /**
@@ -3766,7 +3878,7 @@ class st {
   send(t) {
     return this.sendEvent({
       content: t,
-      kind: Gc
+      kind: iu
     });
   }
   /**
@@ -3787,10 +3899,10 @@ class st {
       kind: t.kind || Oe,
       created_at: t.created_at || Math.floor(n / 1e3),
       tags: t.tags || [],
-      pubkey: t.pubkey || Yc
+      pubkey: t.pubkey || au
     };
     r.tags.some(([l]) => l === "ms") || r.tags.push(["ms", String(n)]), r.id = qe(r);
-    const [i, s] = this.ratchetEncrypt(JSON.stringify(r)), o = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNextNostrPublicKey), c = q.encrypt(JSON.stringify(i), o);
+    const [i, s] = this.ratchetEncrypt(JSON.stringify(r)), o = D.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNextNostrPublicKey), c = D.encrypt(JSON.stringify(i), o);
     return { event: Q({
       content: s,
       kind: Oe,
@@ -3816,60 +3928,50 @@ class st {
   }
   // 2. RATCHET FUNCTIONS
   ratchetEncrypt(t) {
-    const [n, r] = Pe(this.state.sendingChainKey, new Uint8Array([1]), 2);
+    const [n, r] = Me(this.state.sendingChainKey, new Uint8Array([1]), 2);
     return this.state.sendingChainKey = n, [{
       number: this.state.sendingChainMessageNumber++,
       nextPublicKey: this.state.ourNextNostrKey.publicKey,
       previousChainLength: this.state.previousSendingChainMessageCount
-    }, q.encrypt(t, r)];
+    }, D.encrypt(t, r)];
   }
   ratchetDecrypt(t, n, r) {
     const i = this.trySkippedMessageKeys(t, n, r);
     if (i) return i;
     this.skipMessageKeys(t.number, r);
-    const [s, o] = Pe(this.state.receivingChainKey, new Uint8Array([1]), 2);
-    this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++;
-    try {
-      return q.decrypt(n, o);
-    } catch (c) {
-      throw console.error(this.name, "Decryption failed:", c, {
-        messageKey: P(o).slice(0, 4),
-        receivingChainKey: P(this.state.receivingChainKey).slice(0, 4),
-        sendingChainKey: this.state.sendingChainKey && P(this.state.sendingChainKey).slice(0, 4),
-        rootKey: P(this.state.rootKey).slice(0, 4)
-      }), c;
-    }
+    const [s, o] = Me(this.state.receivingChainKey, new Uint8Array([1]), 2);
+    return this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++, D.decrypt(n, o);
   }
   ratchetStep() {
     this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0;
-    const t = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [n, r] = Pe(this.state.rootKey, t, 2);
+    const t = D.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [n, r] = Me(this.state.rootKey, t, 2);
     this.state.receivingChainKey = r, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
     const i = ke();
     this.state.ourNextNostrKey = {
-      publicKey: le(i),
+      publicKey: ae(i),
       privateKey: i
     };
-    const s = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [o, c] = Pe(n, s, 2);
+    const s = D.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [o, c] = Me(n, s, 2);
     this.state.rootKey = o, this.state.sendingChainKey = c;
   }
   // 3. MESSAGE KEY FUNCTIONS
   skipMessageKeys(t, n) {
     if (!(t <= this.state.receivingChainMessageNumber)) {
-      if (t > this.state.receivingChainMessageNumber + Jc)
+      if (t > this.state.receivingChainMessageNumber + ou)
         throw new Error("Too many skipped messages");
       if (!this.state.skippedKeys[n]) {
         if (this.state.skippedKeys[n] = {
           headerKeys: [],
           messageKeys: {}
         }, this.state.ourCurrentNostrKey) {
-          const i = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
+          const i = D.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
           this.state.skippedKeys[n].headerKeys.includes(i) || this.state.skippedKeys[n].headerKeys.push(i);
         }
-        const r = q.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
+        const r = D.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
         this.state.skippedKeys[n].headerKeys.includes(r) || this.state.skippedKeys[n].headerKeys.push(r);
       }
       for (; this.state.receivingChainMessageNumber < t; ) {
-        const [r, i] = Pe(this.state.receivingChainKey, new Uint8Array([1]), 2);
+        const [r, i] = Me(this.state.receivingChainKey, new Uint8Array([1]), 2);
         this.state.receivingChainKey = r, this.state.skippedKeys[n].messageKeys[this.state.receivingChainMessageNumber] = i, this.state.receivingChainMessageNumber++;
       }
     }
@@ -3878,28 +3980,28 @@ class st {
     const i = this.state.skippedKeys[r];
     if (!i) return null;
     const s = i.messageKeys[t.number];
-    return s ? (delete i.messageKeys[t.number], Object.keys(i.messageKeys).length === 0 && delete this.state.skippedKeys[r], q.decrypt(n, s)) : null;
+    return s ? (delete i.messageKeys[t.number], Object.keys(i.messageKeys).length === 0 && delete this.state.skippedKeys[r], D.decrypt(n, s)) : null;
   }
   // 4. NOSTR EVENT HANDLING
   decryptHeader(t) {
     const n = t.tags[0][1];
     if (this.state.ourCurrentNostrKey) {
-      const s = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
+      const s = D.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
       try {
-        return [JSON.parse(q.decrypt(n, s)), !1, !1];
+        return [JSON.parse(D.decrypt(n, s)), !1, !1];
       } catch {
       }
     }
-    const r = q.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
+    const r = D.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
     try {
-      return [JSON.parse(q.decrypt(n, r)), !0, !1];
+      return [JSON.parse(D.decrypt(n, r)), !0, !1];
     } catch {
     }
     const i = this.state.skippedKeys[t.pubkey];
     if (i != null && i.headerKeys)
       for (const s of i.headerKeys)
         try {
-          return [JSON.parse(q.decrypt(n, s)), !1, !0];
+          return [JSON.parse(D.decrypt(n, s)), !1, !0];
         } catch {
         }
     throw new Error("Failed to decrypt header with current and skipped header keys");
@@ -3915,15 +4017,7 @@ class st {
     else if (!((a = this.state.skippedKeys[t.pubkey]) != null && a.messageKeys[n.number]))
       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((l) => l(o, t));
+    pt(o) && o.id === qe(o) && this.internalSubscriptions.forEach((l) => l(o, t));
   }
   subscribeToNostrEvents() {
     if (this.nostrNextUnsubscribe) return;
@@ -3947,16 +4041,16 @@ function Qe(e, t) {
   const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
   return rn(fe, n, "nip44-v2");
 }
-const Xc = 2 * 24 * 60 * 60, Qc = () => Math.round(Date.now() / 1e3), eu = () => Math.round(Qc() - Math.random() * Xc);
-class Me {
+const cu = 2 * 24 * 60 * 60, uu = () => Math.round(Date.now() / 1e3), lu = () => Math.round(uu() - Math.random() * cu);
+class Pe {
   constructor(t, n, r, i, s, o, c = []) {
     this.inviterEphemeralPublicKey = t, this.sharedSecret = n, this.inviter = r, this.inviterEphemeralPrivateKey = i, this.label = s, this.maxUses = o, this.usedBy = c;
   }
   static createNew(t, n, r) {
     if (!t)
       throw new Error("Inviter public key is required");
-    const i = ke(), s = le(i), o = P(ke());
-    return new Me(
+    const i = ke(), s = ae(i), o = H(ke());
+    return new Pe(
       s,
       o,
       t,
@@ -3979,7 +4073,7 @@ class Me {
     const { inviter: o, ephemeralKey: c, sharedSecret: a } = s;
     if (!o || !c || !a)
       throw new Error("Missing required fields (inviter, ephemeralKey, sharedSecret) in invite data.");
-    return new Me(
+    return new Pe(
       c,
       a,
       o
@@ -3987,7 +4081,7 @@ class Me {
   }
   static deserialize(t) {
     const n = JSON.parse(t);
-    return new Me(
+    return new Pe(
       n.inviterEphemeralPublicKey,
       n.sharedSecret,
       n.inviter,
@@ -4001,7 +4095,7 @@ class Me {
     var o, c;
     if (!t.sig)
       throw new Error("Event is not signed");
-    if (!pt(t))
+    if (!gt(t))
       throw new Error("Event signature is invalid");
     const { tags: n } = t;
     if (!n)
@@ -4009,7 +4103,7 @@ class Me {
     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 Me(
+    return new Pe(
       r,
       i,
       s
@@ -4017,20 +4111,18 @@ class Me {
   }
   static fromUser(t, n, r) {
     const i = {
-      kinds: [Dn],
+      kinds: [Vn],
       authors: [t],
-      limit: 1,
-      "#d": ["double-ratchet/invites/public"]
+      "#l": ["double-ratchet/invites"]
     };
     let s = 0;
     return n(i, (c) => {
       if (!(!c.created_at || c.created_at <= s)) {
         s = c.created_at;
         try {
-          const a = Me.fromEvent(c);
+          const a = Pe.fromEvent(c);
           r(a);
-        } catch (a) {
-          console.error("Error processing invite:", a, "event:", c);
+        } catch {
         }
       }
     });
@@ -4060,16 +4152,18 @@ class Me {
     }, r = new URL(t);
     return r.hash = encodeURIComponent(JSON.stringify(n)), r.toString();
   }
-  getEvent() {
+  getEvent(t) {
+    if (!t)
+      throw new Error("Device name is required");
     return {
-      kind: Dn,
+      kind: Vn,
       pubkey: this.inviter,
       content: "",
       created_at: Math.floor(Date.now() / 1e3),
       tags: [
         ["ephemeralKey", this.inviterEphemeralPublicKey],
         ["sharedSecret", this.sharedSecret],
-        ["d", "double-ratchet/invites/public"],
+        ["d", "double-ratchet/invites/" + t],
         ["l", "double-ratchet/invites"]
       ]
     };
@@ -4090,15 +4184,15 @@ class Me {
        * so the inviter can create the session on their side.
        */
   async accept(t, n, r) {
-    const i = ke(), s = le(i), o = this.inviter || this.inviterEphemeralPublicKey, c = z(this.sharedSecret), a = st.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), f = await (typeof r == "function" ? r : (d, y) => Promise.resolve(q.encrypt(d, Qe(r, y))))(s, o), u = {
+    const i = ke(), s = ae(i), o = this.inviter || this.inviterEphemeralPublicKey, c = z(this.sharedSecret), a = ot.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), f = await (typeof r == "function" ? r : (d, p) => Promise.resolve(D.encrypt(d, Qe(r, p))))(s, o), u = {
       pubkey: n,
-      content: await q.encrypt(f, c),
+      content: await D.encrypt(f, c),
       created_at: Math.floor(Date.now() / 1e3)
-    }, g = JSON.stringify(u), w = ke(), p = le(w), h = {
-      kind: jn,
-      pubkey: p,
-      content: q.encrypt(g, Qe(w, this.inviterEphemeralPublicKey)),
-      created_at: eu(),
+    }, g = JSON.stringify(u), w = ke(), y = ae(w), h = {
+      kind: Zn,
+      pubkey: y,
+      content: D.encrypt(g, Qe(w, this.inviterEphemeralPublicKey)),
+      created_at: lu(),
       tags: [["p", this.inviterEphemeralPublicKey]]
     };
     return { session: a, event: Q(h, w) };
@@ -4107,37 +4201,34 @@ class Me {
     if (!this.inviterEphemeralPrivateKey)
       throw new Error("Inviter session key is not available");
     const i = {
-      kinds: [jn],
+      kinds: [Zn],
       "#p": [this.inviterEphemeralPublicKey]
     };
     return n(i, async (s) => {
       try {
-        if (this.maxUses && this.usedBy.length >= this.maxUses) {
-          console.error("Invite has reached maximum number of uses");
+        if (this.maxUses && this.usedBy.length >= this.maxUses)
           return;
-        }
-        const o = await q.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o), a = z(this.sharedSecret), l = c.pubkey;
+        const o = await D.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o), a = z(this.sharedSecret), l = c.pubkey;
         this.usedBy.push(l);
-        const f = await q.decrypt(c.content, a), g = await (typeof t == "function" ? t : (h, d) => Promise.resolve(q.decrypt(h, Qe(t, d))))(f, l), w = s.id, p = st.init(n, g, this.inviterEphemeralPrivateKey, !1, a, w);
-        r(p, l);
-      } catch (o) {
-        console.error("Error processing invite message:", o, "event", s);
+        const f = await D.decrypt(c.content, a), g = await (typeof t == "function" ? t : (h, d) => Promise.resolve(D.decrypt(h, Qe(t, d))))(f, l), w = s.id, y = ot.init(n, g, this.inviterEphemeralPrivateKey, !1, a, w);
+        r(y, l);
+      } catch {
       }
     });
   }
 }
 export {
-  Gc as CHAT_MESSAGE_KIND,
-  Dn as INVITE_EVENT_KIND,
-  jn as INVITE_RESPONSE_KIND,
-  Me as Invite,
-  au as MAX_SKIP,
+  iu as CHAT_MESSAGE_KIND,
+  Vn as INVITE_EVENT_KIND,
+  Zn as INVITE_RESPONSE_KIND,
+  Pe as Invite,
+  wu as MAX_SKIP,
   Oe as MESSAGE_EVENT_KIND,
-  st as Session,
-  lu as createEventStream,
-  uu as deserializeSessionState,
-  hu as getMillisecondTimestamp,
-  Pe as kdf,
-  cu as serializeSessionState,
-  fu as skippedMessageIndexKey
+  ot as Session,
+  mu as createEventStream,
+  vu as deserializeSessionState,
+  xu as getMillisecondTimestamp,
+  Me as kdf,
+  bu as serializeSessionState,
+  Eu as skippedMessageIndexKey
 };