nostr-double-ratchet 0.0.9 → 0.0.10

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

@@ -1,91 +1,91 @@
-var oi = Object.defineProperty;
-var ai = (e, t, n) => t in e ? oi(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var ee = (e, t, n) => ai(e, typeof t != "symbol" ? t + "" : t, n);
-function En(e) {
+var si = Object.defineProperty;
+var oi = (e, t, n) => t in e ? si(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var ee = (e, t, n) => oi(e, typeof t != "symbol" ? t + "" : t, n);
+function mn(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function Pn(e, ...t) {
+function On(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 ci(e) {
+function ai(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  En(e.outputLen), En(e.blockLen);
+  mn(e.outputLen), mn(e.blockLen);
 }
-function rt(e, t = !0) {
+function nt(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 li(e, t) {
-  Pn(e);
+function ci(e, t) {
+  On(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const At = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const St = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Mn = (e) => e instanceof Uint8Array, Kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ne = (e, t) => e << 32 - t | e >>> t, ui = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!ui)
+const Pn = (e) => e instanceof Uint8Array, At = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ne = (e, t) => e << 32 - t | e >>> t, li = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!li)
   throw new Error("Non little-endian hardware is not supported");
-function fi(e) {
+function ui(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Ft(e) {
-  if (typeof e == "string" && (e = fi(e)), !Mn(e))
+function Zt(e) {
+  if (typeof e == "string" && (e = ui(e)), !Pn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function hi(...e) {
+function fi(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!Mn(r))
+    if (!Pn(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
 }
-let Hn = class {
+let Mn = class {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 };
-function di(e) {
-  const t = (r) => e().update(Ft(r)).digest(), n = e();
+function hi(e) {
+  const t = (r) => e().update(Zt(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-function qn(e = 32) {
-  if (At && typeof At.getRandomValues == "function")
-    return At.getRandomValues(new Uint8Array(e));
+function Hn(e = 32) {
+  if (St && typeof St.getRandomValues == "function")
+    return St.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function yi(e, t, n, r) {
+function di(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), a = Number(n & s), c = r ? 4 : 0, l = r ? 0 : 4;
   e.setUint32(t + c, o, r), e.setUint32(t + l, a, r);
 }
-let pi = class extends Hn {
+let yi = class extends Mn {
   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 = At(this.buffer);
   }
   update(t) {
-    rt(this);
+    nt(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Ft(t);
+    t = Zt(t);
     const s = t.length;
     for (let o = 0; o < s; ) {
       const a = Math.min(i - this.pos, s - o);
       if (a === i) {
-        const c = Kt(t);
+        const c = At(t);
         for (; i <= s - o; o += i)
           this.process(c, o);
         continue;
@@ -95,14 +95,14 @@ let pi = class extends Hn {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    rt(this), li(t, this), this.finished = !0;
+    nt(this), ci(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;
-    yi(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const a = Kt(t), c = this.outputLen;
+    di(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const a = At(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = c / 4, f = this.get();
@@ -123,7 +123,7 @@ let pi = class extends Hn {
     return t.length = i, t.pos = a, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 };
-const gi = (e, t, n) => e & t ^ ~e & n, wi = (e, t, n) => e & t ^ e & n ^ t & n, bi = /* @__PURE__ */ new Uint32Array([
+const pi = (e, t, n) => e & t ^ ~e & n, gi = (e, t, n) => e & t ^ e & n ^ t & n, wi = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -198,7 +198,7 @@ const gi = (e, t, n) => e & t ^ ~e & n, wi = (e, t, n) => e & t ^ e & n ^ t & n,
   528734635,
   1541459225
 ]), we = /* @__PURE__ */ new Uint32Array(64);
-let vi = class extends pi {
+let bi = class extends yi {
   constructor() {
     super(64, 32, 8, !1), this.A = ge[0] | 0, this.B = ge[1] | 0, this.C = ge[2] | 0, this.D = ge[3] | 0, this.E = ge[4] | 0, this.F = ge[5] | 0, this.G = ge[6] | 0, this.H = ge[7] | 0;
   }
@@ -219,7 +219,7 @@ let vi = class extends pi {
     }
     let { A: r, B: i, C: s, D: o, E: a, F: c, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const d = ne(a, 6) ^ ne(a, 11) ^ ne(a, 25), p = f + d + gi(a, c, l) + bi[u] + we[u] | 0, h = (ne(r, 2) ^ ne(r, 13) ^ ne(r, 22)) + wi(r, i, s) | 0;
+      const d = ne(a, 6) ^ ne(a, 11) ^ ne(a, 25), p = f + d + pi(a, c, l) + wi[u] + we[u] | 0, h = (ne(r, 2) ^ ne(r, 13) ^ ne(r, 22)) + gi(r, i, s) | 0;
       f = l, l = c, c = a, a = o + p | 0, o = s, s = i, i = r, r = p + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, a, c, l, f);
@@ -231,22 +231,22 @@ let vi = class extends pi {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const $t = /* @__PURE__ */ di(() => new vi());
+const Tt = /* @__PURE__ */ hi(() => new bi());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Dn = BigInt(0), lt = BigInt(1), mi = BigInt(2), ut = (e) => e instanceof Uint8Array, Ei = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const qn = BigInt(0), ct = BigInt(1), vi = BigInt(2), lt = (e) => e instanceof Uint8Array, mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function qe(e) {
-  if (!ut(e))
+  if (!lt(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += Ei[e[n]];
+    t += mi[e[n]];
   return t;
 }
-function jn(e) {
+function Dn(e) {
   const t = e.toString(16);
   return t.length & 1 ? `0${t}` : t;
 }
-function Wt(e) {
+function Ft(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   return BigInt(e === "" ? "0" : `0x${e}`);
@@ -267,21 +267,21 @@ function De(e) {
   return n;
 }
 function G(e) {
-  return Wt(qe(e));
+  return Ft(qe(e));
 }
-function Gt(e) {
-  if (!ut(e))
+function Wt(e) {
+  if (!lt(e))
     throw new Error("Uint8Array expected");
-  return Wt(qe(Uint8Array.from(e).reverse()));
+  return Ft(qe(Uint8Array.from(e).reverse()));
 }
 function xe(e, t) {
   return De(e.toString(16).padStart(t * 2, "0"));
 }
-function Jt(e, t) {
+function Gt(e, t) {
   return xe(e, t).reverse();
 }
-function xi(e) {
-  return De(jn(e));
+function Ei(e) {
+  return De(Dn(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 (ut(t))
+  else if (lt(t))
     r = Uint8Array.from(t);
   else
     throw new Error(`${e} must be hex string or Uint8Array`);
@@ -304,12 +304,12 @@ function ke(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!ut(r))
+    if (!lt(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
 }
-function Si(e, t) {
+function xi(e, t) {
   if (e.length !== t.length)
     return !1;
   for (let n = 0; n < e.length; n++)
@@ -317,33 +317,33 @@ function Si(e, t) {
       return !1;
   return !0;
 }
-function Ai(e) {
+function Si(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Ki(e) {
+function Ai(e) {
   let t;
-  for (t = 0; e > Dn; e >>= lt, t += 1)
+  for (t = 0; e > qn; e >>= ct, t += 1)
     ;
   return t;
 }
-function Ni(e, t) {
-  return e >> BigInt(t) & lt;
+function Ki(e, t) {
+  return e >> BigInt(t) & ct;
 }
-const Bi = (e, t, n) => e | (n ? lt : Dn) << BigInt(t), Yt = (e) => (mi << BigInt(e - 1)) - lt, Nt = (e) => new Uint8Array(e), xn = (e) => Uint8Array.from(e);
-function Vn(e, t, n) {
+const Ni = (e, t, n) => e | (n ? ct : qn) << BigInt(t), Jt = (e) => (vi << BigInt(e - 1)) - ct, Kt = (e) => new Uint8Array(e), En = (e) => Uint8Array.from(e);
+function jn(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 = Kt(e), i = Kt(e), s = 0;
   const o = () => {
     r.fill(1), i.fill(0), s = 0;
-  }, a = (...u) => n(i, r, ...u), c = (u = Nt()) => {
-    i = a(xn([0]), u), r = a(), u.length !== 0 && (i = a(xn([1]), u), r = a());
+  }, a = (...u) => n(i, r, ...u), c = (u = Kt()) => {
+    i = a(En([0]), u), r = a(), u.length !== 0 && (i = a(En([1]), u), r = a());
   }, l = () => {
     if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
@@ -364,7 +364,7 @@ function Vn(e, t, n) {
     return o(), p;
   };
 }
-const Ci = {
+const Bi = {
   bigint: (e) => typeof e == "bigint",
   function: (e) => typeof e == "function",
   boolean: (e) => typeof e == "boolean",
@@ -375,9 +375,9 @@ const Ci = {
   field: (e, t) => t.Fp.isValid(e),
   hash: (e) => typeof e == "function" && Number.isSafeInteger(e.outputLen)
 };
-function Ye(e, t, n = {}) {
+function Je(e, t, n = {}) {
   const r = (i, s, o) => {
-    const a = Ci[s];
+    const a = Bi[s];
     if (typeof a != "function")
       throw new Error(`Invalid validator "${s}", expected function`);
     const c = e[i];
@@ -390,37 +390,37 @@ function Ye(e, t, n = {}) {
     r(i, s, !0);
   return e;
 }
-const ki = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Ci = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  bitGet: Ni,
-  bitLen: Ki,
-  bitMask: Yt,
-  bitSet: Bi,
+  bitGet: Ki,
+  bitLen: Ai,
+  bitMask: Jt,
+  bitSet: Ni,
   bytesToHex: qe,
   bytesToNumberBE: G,
-  bytesToNumberLE: Gt,
+  bytesToNumberLE: Wt,
   concatBytes: ke,
-  createHmacDrbg: Vn,
+  createHmacDrbg: jn,
   ensureBytes: Z,
-  equalBytes: Si,
+  equalBytes: xi,
   hexToBytes: De,
-  hexToNumber: Wt,
+  hexToNumber: Ft,
   numberToBytesBE: xe,
-  numberToBytesLE: Jt,
-  numberToHexUnpadded: jn,
-  numberToVarBytesBE: xi,
-  utf8ToBytes: Ai,
-  validateObject: Ye
+  numberToBytesLE: Gt,
+  numberToHexUnpadded: Dn,
+  numberToVarBytesBE: Ei,
+  utf8ToBytes: Si,
+  validateObject: Je
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const V = BigInt(0), q = BigInt(1), Ne = BigInt(2), Ui = BigInt(3), Rt = BigInt(4), Sn = BigInt(5), An = BigInt(8);
+const V = BigInt(0), q = BigInt(1), Ne = BigInt(2), ki = BigInt(3), $t = BigInt(4), xn = BigInt(5), Sn = BigInt(8);
 BigInt(9);
 BigInt(16);
 function z(e, t) {
   const n = e % t;
   return n >= V ? n : t + n;
 }
-function Ii(e, t, n) {
+function Ui(e, t, n) {
   if (n <= V || t < V)
     throw new Error("Expected power/modulo > 0");
   if (n === q)
@@ -436,7 +436,7 @@ function J(e, t, n) {
     r *= r, r %= n;
   return r;
 }
-function Ot(e, t) {
+function Rt(e, t) {
   if (e === V || t <= V)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
   let n = z(e, t), r = t, i = V, s = q;
@@ -448,15 +448,15 @@ function Ot(e, t) {
     throw new Error("invert: does not exist");
   return z(i, t);
 }
-function _i(e) {
+function Ii(e) {
   const t = (e - q) / Ne;
   let n, r, i;
   for (n = e - q, r = 0; n % Ne === V; n /= Ne, r++)
     ;
-  for (i = Ne; i < e && Ii(i, t, e) !== e - q; i++)
+  for (i = Ne; i < e && Ui(i, t, e) !== e - q; i++)
     ;
   if (r === 1) {
-    const o = (e + q) / Rt;
+    const o = (e + q) / $t;
     return function(c, l) {
       const f = c.pow(l, o);
       if (!c.eql(c.sqr(f), l))
@@ -481,9 +481,9 @@ function _i(e) {
     return u;
   };
 }
-function Li(e) {
-  if (e % Rt === Ui) {
-    const t = (e + q) / Rt;
+function _i(e) {
+  if (e % $t === ki) {
+    const t = (e + q) / $t;
     return function(r, i) {
       const s = r.pow(i, t);
       if (!r.eql(r.sqr(s), i))
@@ -491,8 +491,8 @@ function Li(e) {
       return s;
     };
   }
-  if (e % An === Sn) {
-    const t = (e - Sn) / An;
+  if (e % Sn === xn) {
+    const t = (e - xn) / Sn;
     return function(r, i) {
       const s = r.mul(i, Ne), o = r.pow(s, t), a = r.mul(i, o), c = r.mul(r.mul(a, Ne), o), l = r.mul(a, r.sub(c, r.ONE));
       if (!r.eql(r.sqr(l), i))
@@ -500,9 +500,9 @@ function Li(e) {
       return l;
     };
   }
-  return _i(e);
+  return Ii(e);
 }
-const Ti = [
+const Li = [
   "create",
   "isValid",
   "is0",
@@ -521,16 +521,16 @@ const Ti = [
   "mulN",
   "sqrN"
 ];
-function $i(e) {
+function Ti(e) {
   const t = {
     ORDER: "bigint",
     MASK: "bigint",
     BYTES: "isSafeInteger",
     BITS: "isSafeInteger"
-  }, n = Ti.reduce((r, i) => (r[i] = "function", r), t);
-  return Ye(e, n);
+  }, n = Li.reduce((r, i) => (r[i] = "function", r), t);
+  return Je(e, n);
 }
-function Ri(e, t, n) {
+function $i(e, t, n) {
   if (n < V)
     throw new Error("Expected power > 0");
   if (n === V)
@@ -542,25 +542,25 @@ function Ri(e, t, n) {
     n & q && (r = e.mul(r, i)), i = e.sqr(i), n >>= q;
   return r;
 }
-function Oi(e, t) {
+function Ri(e, t) {
   const n = new Array(t.length), r = t.reduce((s, o, a) => e.is0(o) ? s : (n[a] = s, e.mul(s, o)), e.ONE), i = e.inv(r);
   return t.reduceRight((s, o, a) => e.is0(o) ? s : (n[a] = e.mul(s, n[a]), e.mul(s, o)), i), n;
 }
-function zn(e, t) {
+function Vn(e, t) {
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
   return { nBitLength: n, nByteLength: r };
 }
-function Pi(e, t, n = !1, r = {}) {
+function Oi(e, t, n = !1, r = {}) {
   if (e <= V)
     throw new Error(`Expected Field ORDER > 0, got ${e}`);
-  const { nBitLength: i, nByteLength: s } = zn(e, t);
+  const { nBitLength: i, nByteLength: s } = Vn(e, t);
   if (s > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const o = Li(e), a = Object.freeze({
+  const o = _i(e), a = Object.freeze({
     ORDER: e,
     BITS: i,
     BYTES: s,
-    MASK: Yt(i),
+    MASK: Jt(i),
     ZERO: V,
     ONE: q,
     create: (c) => z(c, e),
@@ -577,48 +577,48 @@ function Pi(e, t, n = !1, r = {}) {
     add: (c, l) => z(c + l, e),
     sub: (c, l) => z(c - l, e),
     mul: (c, l) => z(c * l, e),
-    pow: (c, l) => Ri(a, c, l),
-    div: (c, l) => z(c * Ot(l, e), e),
+    pow: (c, l) => $i(a, c, l),
+    div: (c, l) => z(c * Rt(l, e), e),
     // Same as above, but doesn't normalize
     sqrN: (c) => c * c,
     addN: (c, l) => c + l,
     subN: (c, l) => c - l,
     mulN: (c, l) => c * l,
-    inv: (c) => Ot(c, e),
+    inv: (c) => Rt(c, e),
     sqrt: r.sqrt || ((c) => o(a, c)),
-    invertBatch: (c) => Oi(a, c),
+    invertBatch: (c) => Ri(a, c),
     // TODO: do we really need constant cmov?
     // We don't have const-time bigints anyway, so probably will be not very useful
     cmov: (c, l, f) => f ? l : c,
-    toBytes: (c) => n ? Jt(c, s) : xe(c, s),
+    toBytes: (c) => n ? Gt(c, s) : xe(c, s),
     fromBytes: (c) => {
       if (c.length !== s)
         throw new Error(`Fp.fromBytes: expected ${s}, got ${c.length}`);
-      return n ? Gt(c) : G(c);
+      return n ? Wt(c) : G(c);
     }
   });
   return Object.freeze(a);
 }
-function Zn(e) {
+function zn(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 Fn(e) {
-  const t = Zn(e);
+function Zn(e) {
+  const t = zn(e);
   return t + Math.ceil(t / 2);
 }
-function Mi(e, t, n = !1) {
-  const r = e.length, i = Zn(t), s = Fn(t);
+function Pi(e, t, n = !1) {
+  const r = e.length, i = zn(t), s = Zn(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error(`expected ${s}-1024 bytes of input, got ${r}`);
-  const o = n ? G(e) : Gt(e), a = z(o, t - q) + q;
-  return n ? Jt(a, i) : xe(a, i);
+  const o = n ? G(e) : Wt(e), a = z(o, t - q) + q;
+  return n ? Gt(a, i) : xe(a, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Hi = BigInt(0), Bt = BigInt(1);
-function qi(e, t) {
+const Mi = BigInt(0), Nt = BigInt(1);
+function Hi(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, a = i;
-      for (; s > Hi; )
-        s & Bt && (o = o.add(a)), a = a.double(), s >>= Bt;
+      for (; s > Mi; )
+        s & Nt && (o = o.add(a)), a = a.double(), s >>= Nt;
       return o;
     },
     /**
@@ -670,7 +670,7 @@ function qi(e, t) {
       for (let g = 0; g < a; g++) {
         const h = g * c;
         let y = Number(o & u);
-        o >>= p, y > c && (y -= d, o += Bt);
+        o >>= p, y > c && (y -= d, o += Nt);
         const w = h, E = h + Math.abs(y) - 1, K = g % 2 !== 0, I = y < 0;
         y === 0 ? f = f.add(n(K, s[w])) : l = l.add(n(I, s[E]));
       }
@@ -683,8 +683,8 @@ function qi(e, t) {
     }
   };
 }
-function Wn(e) {
-  return $i(e.Fp), Ye(e, {
+function Fn(e) {
+  return Ti(e.Fp), Je(e, {
     n: "bigint",
     h: "bigint",
     Gx: "field",
@@ -693,15 +693,15 @@ function Wn(e) {
     nBitLength: "isSafeInteger",
     nByteLength: "isSafeInteger"
   }), Object.freeze({
-    ...zn(e.n, e.nBitLength),
+    ...Vn(e.n, e.nBitLength),
     ...e,
     p: e.Fp.ORDER
   });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function Di(e) {
-  const t = Wn(e);
-  Ye(t, {
+function qi(e) {
+  const t = Fn(e);
+  Je(t, {
     a: "field",
     b: "field"
   }, {
@@ -722,7 +722,7 @@ function Di(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: ji, hexToBytes: Vi } = ki, Be = {
+const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Be = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -740,10 +740,10 @@ const { bytesToNumberBE: ji, hexToBytes: Vi } = ki, 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: ji(r), l: e.subarray(n + 2) };
+    return { d: Di(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = Be, n = typeof e == "string" ? Vi(e) : e;
+    const { Err: t } = Be, n = typeof e == "string" ? ji(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -765,10 +765,10 @@ const { bytesToNumberBE: ji, hexToBytes: Vi } = ki, Be = {
   }
 }, ce = BigInt(0), Y = BigInt(1);
 BigInt(2);
-const Kn = BigInt(3);
+const An = BigInt(3);
 BigInt(4);
-function zi(e) {
-  const t = Di(e), { Fp: n } = t, r = t.toBytes || ((g, h, y) => {
+function Vi(e) {
+  const t = qi(e), { Fp: n } = t, r = t.toBytes || ((g, h, y) => {
     const w = h.toAffine();
     return ke(Uint8Array.from([4]), n.toBytes(w.x), n.toBytes(w.y));
   }), i = t.fromBytes || ((g) => {
@@ -901,7 +901,7 @@ function zi(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: h, b: y } = t, w = n.mul(y, Kn), { px: E, py: K, pz: I } = this;
+      const { a: h, b: y } = t, w = n.mul(y, An), { px: E, py: K, pz: I } = this;
       let C = n.ZERO, m = n.ZERO, x = n.ZERO, S = n.mul(E, E), P = n.mul(K, K), U = n.mul(I, I), N = n.mul(E, K);
       return N = n.add(N, N), x = n.mul(E, I), x = n.add(x, x), C = n.mul(h, x), m = n.mul(w, U), m = n.add(C, m), C = n.sub(P, m), m = n.add(P, m), m = n.mul(C, m), C = n.mul(N, C), x = n.mul(w, x), U = n.mul(h, U), N = n.sub(S, U), N = n.mul(h, N), N = n.add(N, x), x = n.add(S, S), S = n.add(x, S), S = n.add(S, U), S = n.mul(S, N), m = n.add(m, S), U = n.mul(K, I), U = n.add(U, U), S = n.mul(U, N), C = n.sub(C, S), x = n.mul(U, P), x = n.add(x, x), x = n.add(x, x), new u(C, m, x);
     }
@@ -913,7 +913,7 @@ function zi(e) {
       f(h);
       const { px: y, py: w, pz: E } = this, { px: K, py: I, pz: C } = h;
       let m = n.ZERO, x = n.ZERO, S = n.ZERO;
-      const P = t.a, U = n.mul(t.b, Kn);
+      const P = t.a, U = n.mul(t.b, An);
       let N = n.mul(y, K), $ = n.mul(w, I), R = n.mul(E, C), H = n.add(y, w), b = n.add(K, I);
       H = n.mul(H, b), b = n.add(N, $), H = n.sub(H, b), b = n.add(y, E);
       let v = n.add(K, C);
@@ -1016,7 +1016,7 @@ function zi(e) {
     }
   }
   u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
-  const d = t.nBitLength, p = qi(u, t.endo ? Math.ceil(d / 2) : d);
+  const d = t.nBitLength, p = Hi(u, t.endo ? Math.ceil(d / 2) : d);
   return {
     CURVE: t,
     ProjectivePoint: u,
@@ -1025,9 +1025,9 @@ function zi(e) {
     isWithinCurveOrder: o
   };
 }
-function Zi(e) {
-  const t = Wn(e);
-  return Ye(t, {
+function zi(e) {
+  const t = Fn(e);
+  return Je(t, {
     hash: "hash",
     hmac: "function",
     randomBytes: "function"
@@ -1037,8 +1037,8 @@ function Zi(e) {
     lowS: "boolean"
   }), Object.freeze({ lowS: !0, ...t });
 }
-function Fi(e) {
-  const t = Zi(e), { Fp: n, n: r } = t, i = n.BYTES + 1, s = 2 * n.BYTES + 1;
+function Zi(e) {
+  const t = zi(e), { Fp: n, n: r } = t, i = n.BYTES + 1, s = 2 * n.BYTES + 1;
   function o(b) {
     return ce < b && b < n.ORDER;
   }
@@ -1046,9 +1046,9 @@ function Fi(e) {
     return z(b, r);
   }
   function c(b) {
-    return Ot(b, r);
+    return Rt(b, r);
   }
-  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: d } = zi({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: d } = Vi({
     ...t,
     toBytes(b, v, A) {
       const k = v.toAffine(), B = n.toBytes(k.x), _ = ke;
@@ -1151,8 +1151,8 @@ function Fi(e) {
      * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
      */
     randomPrivateKey: () => {
-      const b = Fn(t.n);
-      return Mi(t.randomBytes(b), t.n);
+      const b = Zn(t.n);
+      return Pi(t.randomBytes(b), t.n);
     },
     /**
      * Creates precompute table for an arbitrary EC point. Makes point "cached".
@@ -1185,7 +1185,7 @@ function Fi(e) {
     return A > 0 ? v >> BigInt(A) : v;
   }, x = t.bits2int_modN || function(b) {
     return a(m(b));
-  }, S = Yt(t.nBitLength);
+  }, S = Jt(t.nBitLength);
   function P(b) {
     if (typeof b != "bigint")
       throw new Error("bigint expected");
@@ -1205,25 +1205,25 @@ function Fi(e) {
       Ie.push(Z("extraEntropy", Ke));
     }
     const ze = ke(...Ie), pe = X;
-    function St(Ke) {
+    function xt(Ke) {
       const _e = m(Ke);
       if (!d(_e))
         return;
-      const bn = c(_e), Le = l.BASE.multiply(_e).toAffine(), Q = a(Le.x);
+      const wn = c(_e), Le = l.BASE.multiply(_e).toAffine(), Q = a(Le.x);
       if (Q === ce)
         return;
-      const Te = a(bn * a(pe + Q * ye));
+      const Te = a(wn * a(pe + Q * ye));
       if (Te === ce)
         return;
-      let vn = (Le.x === Q ? 0 : 2) | Number(Le.y & Y), mn = Te;
-      return _ && g(Te) && (mn = h(Te), vn ^= 1), new w(Q, mn, vn);
+      let bn = (Le.x === Q ? 0 : 2) | Number(Le.y & Y), vn = Te;
+      return _ && g(Te) && (vn = h(Te), bn ^= 1), new w(Q, vn, bn);
     }
-    return { seed: ze, k2sig: St };
+    return { seed: ze, k2sig: xt };
   }
   const N = { lowS: t.lowS, prehash: !1 }, $ = { lowS: t.lowS, prehash: !1 };
   function R(b, v, A = N) {
     const { seed: k, k2sig: B } = U(b, v, A), _ = t;
-    return Vn(_.hash.outputLen, _.nByteLength, _.hmac)(k, B);
+    return jn(_.hash.outputLen, _.nByteLength, _.hmac)(k, B);
   }
   l.BASE._setWindowSize(8);
   function H(b, v, A, k = $) {
@@ -1256,7 +1256,7 @@ function Fi(e) {
     if (_ && T.hasHighS())
       return !1;
     O && (v = t.hash(v));
-    const { r: ye, s: Ie } = T, ze = x(v), pe = c(Ie), St = a(ze * pe), Ke = a(ye * pe), _e = (Le = l.BASE.multiplyAndAddUnsafe(X, St, Ke)) == null ? void 0 : Le.toAffine();
+    const { r: ye, s: Ie } = T, ze = x(v), pe = c(Ie), xt = a(ze * pe), Ke = a(ye * pe), _e = (Le = l.BASE.multiplyAndAddUnsafe(X, xt, Ke)) == null ? void 0 : Le.toAffine();
     return _e ? a(_e.x) === ye : !1;
   }
   return {
@@ -1270,10 +1270,10 @@ function Fi(e) {
     utils: E
   };
 }
-let Gn = class extends Hn {
+let Wn = class extends Mn {
   constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, ci(t);
-    const r = Ft(n);
+    super(), this.finished = !1, this.destroyed = !1, ai(t);
+    const r = Zt(n);
     if (this.iHash = t.create(), typeof this.iHash.update != "function")
       throw new Error("Expected instance of class which extends utils.Hash");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
@@ -1287,10 +1287,10 @@ let Gn = class extends Hn {
     this.oHash.update(s), s.fill(0);
   }
   update(t) {
-    return rt(this), this.iHash.update(t), this;
+    return nt(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    rt(this), Pn(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    nt(this), On(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,33 +1305,33 @@ let Gn = class extends Hn {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 };
-const Jn = (e, t, n) => new Gn(e, t).update(n).digest();
-Jn.create = (e, t) => new Gn(e, t);
+const Gn = (e, t, n) => new Wn(e, t).update(n).digest();
+Gn.create = (e, t) => new Wn(e, t);
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function Wi(e) {
+function Fi(e) {
   return {
     hash: e,
-    hmac: (t, ...n) => Jn(e, t, hi(...n)),
-    randomBytes: qn
+    hmac: (t, ...n) => Gn(e, t, fi(...n)),
+    randomBytes: Hn
   };
 }
-function Gi(e, t) {
-  const n = (r) => Fi({ ...e, ...Wi(r) });
+function Wi(e, t) {
+  const n = (r) => Zi({ ...e, ...Fi(r) });
   return Object.freeze({ ...n(t), create: n });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const ft = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), it = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Yn = BigInt(1), st = BigInt(2), Nn = (e, t) => (e + t / st) / t;
-function Xn(e) {
-  const t = ft, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, d = J(u, n, t) * f % t, p = J(d, st, t) * l % t, g = J(p, i, t) * p % t, h = J(g, s, t) * g % t, y = J(h, a, t) * h % t, w = J(y, c, t) * y % t, E = J(w, a, t) * h % t, K = J(E, n, t) * f % t, I = J(K, o, t) * g % t, C = J(I, r, t) * l % t, m = J(C, st, t);
-  if (!Pt.eql(Pt.sqr(m), e))
+const ut = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), rt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), it = BigInt(2), Kn = (e, t) => (e + t / it) / t;
+function Yn(e) {
+  const t = ut, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, d = J(u, n, t) * f % t, p = J(d, it, t) * l % t, g = J(p, i, t) * p % t, h = J(g, s, t) * g % t, y = J(h, a, t) * h % t, w = J(y, c, t) * y % t, E = J(w, a, t) * h % t, K = J(E, n, t) * f % t, I = J(K, o, t) * g % t, C = J(I, r, t) * l % t, m = J(C, it, t);
+  if (!Ot.eql(Ot.sqr(m), e))
     throw new Error("Cannot find square root");
   return m;
 }
-const Pt = Pi(ft, void 0, void 0, { sqrt: Xn }), Ue = Gi({
+const Ot = Oi(ut, void 0, void 0, { sqrt: Yn }), Ue = Wi({
   a: BigInt(0),
   b: BigInt(7),
-  Fp: Pt,
-  n: it,
+  Fp: Ot,
+  n: rt,
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
   Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),
@@ -1346,7 +1346,7 @@ const Pt = Pi(ft, void 0, void 0, { sqrt: Xn }), Ue = Gi({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
-      const t = it, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Yn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), a = Nn(s * e, t), c = Nn(-r * e, t);
+      const t = rt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Jn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), a = Kn(s * e, t), c = Kn(-r * e, t);
       let l = z(e - a * n - c * i, t), f = z(-a * r - c * s, t);
       const u = l > o, d = f > o;
       if (u && (l = t - l), d && (f = t - f), l > o || f > o)
@@ -1354,84 +1354,84 @@ const Pt = Pi(ft, void 0, void 0, { sqrt: Xn }), Ue = Gi({
       return { k1neg: u, k1: l, k2neg: d, k2: f };
     }
   }
-}, $t), ht = BigInt(0), Qn = (e) => typeof e == "bigint" && ht < e && e < ft, Ji = (e) => typeof e == "bigint" && ht < e && e < it, Bn = {};
-function ot(e, ...t) {
-  let n = Bn[e];
+}, Tt), ft = BigInt(0), Xn = (e) => typeof e == "bigint" && ft < e && e < ut, Gi = (e) => typeof e == "bigint" && ft < e && e < rt, Nn = {};
+function st(e, ...t) {
+  let n = Nn[e];
   if (n === void 0) {
-    const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = ke(r, r), Bn[e] = n;
+    const r = Tt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    n = ke(r, r), Nn[e] = n;
   }
-  return $t(ke(n, ...t));
+  return Tt(ke(n, ...t));
 }
-const Xt = (e) => e.toRawBytes(!0).slice(1), Mt = (e) => xe(e, 32), Ct = (e) => z(e, ft), Ge = (e) => z(e, it), Qt = Ue.ProjectivePoint, Yi = (e, t, n) => Qt.BASE.multiplyAndAddUnsafe(e, t, n);
-function Ht(e) {
-  let t = Ue.utils.normPrivateKeyToScalar(e), n = Qt.fromPrivateKey(t);
-  return { scalar: n.hasEvenY() ? t : Ge(-t), bytes: Xt(n) };
+const Yt = (e) => e.toRawBytes(!0).slice(1), Pt = (e) => xe(e, 32), Bt = (e) => z(e, ut), We = (e) => z(e, rt), Xt = Ue.ProjectivePoint, Ji = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
+function Mt(e) {
+  let t = Ue.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
+  return { scalar: n.hasEvenY() ? t : We(-t), bytes: Yt(n) };
 }
-function er(e) {
-  if (!Qn(e))
+function Qn(e) {
+  if (!Xn(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = Ct(e * e), n = Ct(t * e + BigInt(7));
-  let r = Xn(n);
-  r % st !== ht && (r = Ct(-r));
-  const i = new Qt(e, r, Yn);
+  const t = Bt(e * e), n = Bt(t * e + BigInt(7));
+  let r = Yn(n);
+  r % it !== ft && (r = Bt(-r));
+  const i = new Xt(e, r, Jn);
   return i.assertValidity(), i;
 }
-function tr(...e) {
-  return Ge(G(ot("BIP0340/challenge", ...e)));
+function er(...e) {
+  return We(G(st("BIP0340/challenge", ...e)));
 }
-function Xi(e) {
-  return Ht(e).bytes;
+function Yi(e) {
+  return Mt(e).bytes;
 }
-function Qi(e, t, n = qn(32)) {
-  const r = Z("message", e), { bytes: i, scalar: s } = Ht(t), o = Z("auxRand", n, 32), a = Mt(s ^ G(ot("BIP0340/aux", o))), c = ot("BIP0340/nonce", a, i, r), l = Ge(G(c));
-  if (l === ht)
+function Xi(e, t, n = Hn(32)) {
+  const r = Z("message", e), { bytes: i, scalar: s } = Mt(t), o = Z("auxRand", n, 32), a = Pt(s ^ G(st("BIP0340/aux", o))), c = st("BIP0340/nonce", a, i, r), l = We(G(c));
+  if (l === ft)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Ht(l), d = tr(f, i, r), p = new Uint8Array(64);
-  if (p.set(f, 0), p.set(Mt(Ge(u + d * s)), 32), !nr(p, r, i))
+  const { bytes: f, scalar: u } = Mt(l), d = er(f, i, r), p = new Uint8Array(64);
+  if (p.set(f, 0), p.set(Pt(We(u + d * s)), 32), !tr(p, r, i))
     throw new Error("sign: Invalid signature produced");
   return p;
 }
-function nr(e, t, n) {
+function tr(e, t, n) {
   const r = Z("signature", e, 64), i = Z("message", t), s = Z("publicKey", n, 32);
   try {
-    const o = er(G(s)), a = G(r.subarray(0, 32));
-    if (!Qn(a))
+    const o = Qn(G(s)), a = G(r.subarray(0, 32));
+    if (!Xn(a))
       return !1;
     const c = G(r.subarray(32, 64));
-    if (!Ji(c))
+    if (!Gi(c))
       return !1;
-    const l = tr(Mt(a), Xt(o), i), f = Yi(o, c, Ge(-l));
+    const l = er(Pt(a), Yt(o), i), f = Ji(o, c, We(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== a);
   } catch {
     return !1;
   }
 }
 const Ze = {
-  getPublicKey: Xi,
-  sign: Qi,
-  verify: nr,
+  getPublicKey: Yi,
+  sign: Xi,
+  verify: tr,
   utils: {
     randomPrivateKey: Ue.utils.randomPrivateKey,
-    lift_x: er,
-    pointToBytes: Xt,
+    lift_x: Qn,
+    pointToBytes: Yt,
     numberToBytesBE: xe,
     bytesToNumberBE: G,
-    taggedHash: ot,
+    taggedHash: st,
     mod: z
   }
-}, kt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+}, Ct = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const en = (e) => e instanceof Uint8Array, Ut = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, es = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!es)
+const Qt = (e) => e instanceof Uint8Array, kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Qi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!Qi)
   throw new Error("Non little-endian hardware is not supported");
-const ts = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const es = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function M(e) {
-  if (!en(e))
+  if (!Qt(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += ts[e[n]];
+    t += es[e[n]];
   return t;
 }
 function W(e) {
@@ -1449,98 +1449,98 @@ function W(e) {
   }
   return n;
 }
-function ns(e) {
+function ts(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 = ns(e)), !en(e))
+function Ge(e) {
+  if (typeof e == "string" && (e = ts(e)), !Qt(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function dt(...e) {
+function ht(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!en(r))
+    if (!Qt(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
 }
-class rr {
+class nr {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 }
-function ir(e) {
-  const t = (r) => e().update(Je(r)).digest(), n = e();
+function rr(e) {
+  const t = (r) => e().update(Ge(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-function sr(e = 32) {
-  if (kt && typeof kt.getRandomValues == "function")
-    return kt.getRandomValues(new Uint8Array(e));
+function ir(e = 32) {
+  if (Ct && typeof Ct.getRandomValues == "function")
+    return Ct.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function qt(e) {
+function Ht(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function rs(e) {
+function ns(e) {
   if (typeof e != "boolean")
     throw new Error(`Expected boolean, not ${e}`);
 }
-function or(e, ...t) {
+function sr(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 is(e) {
+function rs(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  qt(e.outputLen), qt(e.blockLen);
+  Ht(e.outputLen), Ht(e.blockLen);
 }
-function ss(e, t = !0) {
+function is(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 os(e, t) {
-  or(e);
+function ss(e, t) {
+  sr(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const se = {
-  number: qt,
-  bool: rs,
-  bytes: or,
-  hash: is,
-  exists: ss,
-  output: os
+  number: Ht,
+  bool: ns,
+  bytes: sr,
+  hash: rs,
+  exists: is,
+  output: ss
 };
-function as(e, t, n, r) {
+function os(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), a = Number(n & s), c = r ? 4 : 0, l = r ? 0 : 4;
   e.setUint32(t + c, o, r), e.setUint32(t + l, a, r);
 }
-class cs extends rr {
+class as extends nr {
   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 = Ut(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);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Je(t);
+    t = Ge(t);
     const s = t.length;
     for (let o = 0; o < s; ) {
       const a = Math.min(i - this.pos, s - o);
       if (a === i) {
-        const c = Ut(t);
+        const c = kt(t);
         for (; i <= s - o; o += i)
           this.process(c, o);
         continue;
@@ -1556,8 +1556,8 @@ class cs extends rr {
     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;
-    as(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const a = Ut(t), c = this.outputLen;
+    os(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const a = kt(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = c / 4, f = this.get();
@@ -1578,7 +1578,7 @@ class cs extends rr {
     return t.length = i, t.pos = a, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 }
-const ls = (e, t, n) => e & t ^ ~e & n, us = (e, t, n) => e & t ^ e & n ^ t & n, fs = new Uint32Array([
+const cs = (e, t, n) => e & t ^ ~e & n, ls = (e, t, n) => e & t ^ e & n ^ t & n, us = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1653,7 +1653,7 @@ const ls = (e, t, n) => e & t ^ ~e & n, us = (e, t, n) => e & t ^ e & n ^ t & n,
   528734635,
   1541459225
 ]), ve = new Uint32Array(64);
-class ar extends cs {
+class or extends as {
   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;
   }
@@ -1674,7 +1674,7 @@ class ar extends cs {
     }
     let { A: r, B: i, C: s, D: o, E: a, F: c, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const d = re(a, 6) ^ re(a, 11) ^ re(a, 25), p = f + d + ls(a, c, l) + fs[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + us(r, i, s) | 0;
+      const d = re(a, 6) ^ re(a, 11) ^ re(a, 25), p = f + d + cs(a, c, l) + us[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ls(r, i, s) | 0;
       f = l, l = c, c = a, a = o + p | 0, o = s, s = i, i = r, r = p + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, a, c, l, f);
@@ -1686,13 +1686,13 @@ class ar extends cs {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 }
-class hs extends ar {
+class fs extends or {
   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 Se = ir(() => new ar());
-ir(() => new hs());
+const Se = rr(() => new or());
+rr(() => new fs());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function Ve(e) {
   if (!Number.isSafeInteger(e))
@@ -1746,7 +1746,7 @@ function de(e = "") {
     }
   };
 }
-function yt(e, t = "=") {
+function dt(e, t = "=") {
   if (Ve(e), typeof t != "string")
     throw new Error("padding chr should be string");
   return {
@@ -1776,12 +1776,12 @@ function yt(e, t = "=") {
     }
   };
 }
-function cr(e) {
+function ar(e) {
   if (typeof e != "function")
     throw new Error("normalize fn should be function");
   return { encode: (t) => t, decode: (t) => e(t) };
 }
-function Cn(e, t, n) {
+function Bn(e, t, n) {
   if (t < 2)
     throw new Error(`convertRadix: wrong from=${t}, base cannot be less than 2`);
   if (n < 2)
@@ -1814,16 +1814,16 @@ function Cn(e, t, n) {
     i.push(0);
   return i.reverse();
 }
-const lr = (e, t) => t ? lr(t, e % t) : e, at = (e, t) => e + (t - lr(e, t));
-function Dt(e, t, n, r) {
+const cr = (e, t) => t ? cr(t, e % t) : e, ot = (e, t) => e + (t - cr(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)
     throw new Error(`convertRadix2: wrong from=${t}`);
   if (n <= 0 || n > 32)
     throw new Error(`convertRadix2: wrong to=${n}`);
-  if (at(t, n) > 32)
-    throw new Error(`convertRadix2: carry overflow from=${t} to=${n} carryBits=${at(t, n)}`);
+  if (ot(t, n) > 32)
+    throw new Error(`convertRadix2: carry overflow from=${t} to=${n} carryBits=${ot(t, n)}`);
   let i = 0, s = 0;
   const o = 2 ** n - 1, a = [];
   for (const c of e) {
@@ -1841,39 +1841,39 @@ function Dt(e, t, n, r) {
     throw new Error(`Non-zero padding: ${i}`);
   return r && s > 0 && a.push(i >>> 0), a;
 }
-function ds(e) {
+function hs(e) {
   return Ve(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
-      return Cn(Array.from(t), 2 ** 8, e);
+      return Bn(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(Cn(t, e, 2 ** 8));
+      return Uint8Array.from(Bn(t, e, 2 ** 8));
     }
   };
 }
 function Ae(e, t = !1) {
   if (Ve(e), e <= 0 || e > 32)
     throw new Error("radix2: bits should be in (0..32]");
-  if (at(8, e) > 32 || at(e, 8) > 32)
+  if (ot(8, e) > 32 || ot(e, 8) > 32)
     throw new Error("radix2: carry overflow");
   return {
     encode: (n) => {
       if (!(n instanceof Uint8Array))
         throw new Error("radix2.encode input should be Uint8Array");
-      return Dt(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(Dt(n, e, 8, t));
+      return Uint8Array.from(qt(n, e, 8, t));
     }
   };
 }
-function kn(e) {
+function Cn(e) {
   if (typeof e != "function")
     throw new Error("unsafeWrapper fn should be function");
   return function(...t) {
@@ -1883,25 +1883,25 @@ function kn(e) {
     }
   };
 }
-const ys = fe(Ae(4), he("0123456789ABCDEF"), de("")), ps = fe(Ae(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), yt(5), de(""));
-fe(Ae(5), he("0123456789ABCDEFGHIJKLMNOPQRSTUV"), yt(5), de(""));
-fe(Ae(5), he("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), de(""), cr((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const ue = fe(Ae(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), yt(6), de("")), gs = fe(Ae(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), yt(6), de("")), tn = (e) => fe(ds(58), he(e), de("")), jt = tn("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-tn("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
-tn("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
-const Un = [0, 2, 3, 5, 6, 7, 9, 10, 11], ws = {
+const ds = fe(Ae(4), he("0123456789ABCDEF"), de("")), ys = fe(Ae(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), dt(5), de(""));
+fe(Ae(5), he("0123456789ABCDEFGHIJKLMNOPQRSTUV"), dt(5), de(""));
+fe(Ae(5), he("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), de(""), ar((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
+const ue = fe(Ae(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), dt(6), de("")), ps = fe(Ae(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), dt(6), de("")), en = (e) => fe(hs(58), he(e), de("")), Dt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
+en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
+const kn = [0, 2, 3, 5, 6, 7, 9, 10, 11], gs = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
       const r = e.subarray(n, n + 8);
-      t += jt.encode(r).padStart(Un[r.length], "1");
+      t += Dt.encode(r).padStart(kn[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 = Un.indexOf(r.length), s = jt.decode(r);
+      const r = e.slice(n, n + 11), i = kn.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 Un = [0, 2, 3, 5, 6, 7, 9, 10, 11], ws = {
     }
     return Uint8Array.from(t);
   }
-}, Vt = fe(he("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), de("")), In = [996825010, 642813549, 513874426, 1027748829, 705979059];
+}, jt = fe(he("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), de("")), Un = [996825010, 642813549, 513874426, 1027748829, 705979059];
 function Fe(e) {
   const t = e >> 25;
   let n = (e & 33554431) << 5;
-  for (let r = 0; r < In.length; r++)
-    (t >> r & 1) === 1 && (n ^= In[r]);
+  for (let r = 0; r < Un.length; r++)
+    (t >> r & 1) === 1 && (n ^= Un[r]);
   return n;
 }
-function _n(e, t, n = 1) {
+function In(e, t, n = 1) {
   const r = e.length;
   let i = 1;
   for (let s = 0; s < r; s++) {
@@ -1933,10 +1933,10 @@ function _n(e, t, n = 1) {
     i = Fe(i) ^ s;
   for (let s = 0; s < 6; s++)
     i = Fe(i);
-  return i ^= n, Vt.encode(Dt([i % 2 ** 30], 30, 5, !1));
+  return i ^= n, jt.encode(qt([i % 2 ** 30], 30, 5, !1));
 }
-function ur(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Ae(5), r = n.decode, i = n.encode, s = kn(r);
+function lr(e) {
+  const t = e === "bech32" ? 1 : 734539939, n = Ae(5), r = n.decode, i = n.encode, s = Cn(r);
   function o(f, u, d = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
@@ -1945,7 +1945,7 @@ function ur(e) {
     const p = f.length + 7 + u.length;
     if (d !== !1 && p > d)
       throw new TypeError(`Length ${p} exceeds limit ${d}`);
-    return f = f.toLowerCase(), `${f}1${Vt.encode(u)}${_n(f, u, t)}`;
+    return f = f.toLowerCase(), `${f}1${jt.encode(u)}${In(f, u, t)}`;
   }
   function a(f, u = 90) {
     if (typeof f != "string")
@@ -1962,65 +1962,65 @@ function ur(e) {
     const g = f.slice(0, p), h = f.slice(p + 1);
     if (h.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const y = Vt.decode(h).slice(0, -6), w = _n(g, y, t);
+    const y = jt.decode(h).slice(0, -6), w = In(g, y, t);
     if (!h.endsWith(w))
       throw new Error(`Invalid checksum in ${f}: expected "${w}"`);
     return { prefix: g, words: y };
   }
-  const c = kn(a);
+  const c = Cn(a);
   function l(f) {
     const { prefix: u, words: d } = a(f, !1);
     return { prefix: u, words: d, bytes: r(d) };
   }
   return { encode: o, decode: a, decodeToBytes: l, decodeUnsafe: c, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
-const je = ur("bech32");
-ur("bech32m");
-const bs = {
+const je = lr("bech32");
+lr("bech32m");
+const ws = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, vs = fe(Ae(4), he("0123456789abcdef"), de(""), cr((e) => {
+}, bs = fe(Ae(4), he("0123456789abcdef"), de(""), ar((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();
-})), ms = {
-  utf8: bs,
-  hex: vs,
-  base16: ys,
-  base32: ps,
+})), vs = {
+  utf8: ws,
+  hex: bs,
+  base16: ds,
+  base32: ys,
   base64: ue,
-  base64url: gs,
-  base58: jt,
-  base58xmr: ws
+  base64url: ps,
+  base58: Dt,
+  base58xmr: gs
 };
-`${Object.keys(ms).join(", ")}`;
-function It(e) {
+`${Object.keys(vs).join(", ")}`;
+function Ut(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
-function Ln(e) {
+function _n(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
-function Es(e) {
+function ms(e) {
   return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
 }
 function le(e, ...t) {
-  if (!Es(e))
+  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 F = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), xs = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!xs)
+const F = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), Es = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!Es)
   throw new Error("Non little-endian hardware is not supported");
-function Ss(e, t) {
+function xs(e, t) {
   if (t == null || typeof t != "object")
     throw new Error("options must be defined");
   return Object.assign(e, t);
 }
-function As(e, t) {
+function Ss(e, t) {
   if (e.length !== t.length)
     return !1;
   let n = 0;
@@ -2028,19 +2028,19 @@ function As(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Ks = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ee = 16, Ns = 283;
-function nn(e) {
-  return e << 1 ^ Ns & -(e >> 7);
+const As = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ee = 16, Ks = 283;
+function tn(e) {
+  return e << 1 ^ Ks & -(e >> 7);
 }
 function Pe(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
-    n ^= e & -(t & 1), e = nn(e);
+    n ^= e & -(t & 1), e = tn(e);
   return n;
 }
-const zt = /* @__PURE__ */ (() => {
+const Vt = /* @__PURE__ */ (() => {
   let e = new Uint8Array(256);
-  for (let n = 0, r = 1; n < 256; n++, r ^= nn(r))
+  for (let n = 0, r = 1; n < 256; n++, r ^= tn(r))
     e[n] = r;
   const t = new Uint8Array(256);
   t[0] = 99;
@@ -2049,11 +2049,11 @@ const zt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), Bs = /* @__PURE__ */ zt.map((e, t) => zt.indexOf(t)), Cs = (e) => e << 24 | e >>> 8, _t = (e) => e << 8 | e >>> 24;
-function fr(e, t) {
+})(), Ns = /* @__PURE__ */ Vt.map((e, t) => Vt.indexOf(t)), Bs = (e) => e << 24 | e >>> 8, It = (e) => e << 8 | e >>> 24;
+function ur(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), a = new Uint32Array(256 * 256), c = 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), a = new Uint32Array(256 * 256), c = new Uint16Array(256 * 256);
   for (let l = 0; l < 256; l++)
     for (let f = 0; f < 256; f++) {
       const u = l * 256 + f;
@@ -2061,27 +2061,27 @@ function fr(e, t) {
     }
   return { sbox: e, sbox2: c, T0: n, T1: r, T2: i, T3: s, T01: o, T23: a };
 }
-const rn = /* @__PURE__ */ fr(zt, (e) => Pe(e, 3) << 24 | e << 16 | e << 8 | Pe(e, 2)), hr = /* @__PURE__ */ fr(Bs, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), ks = /* @__PURE__ */ (() => {
+const nn = /* @__PURE__ */ ur(Vt, (e) => Pe(e, 3) << 24 | e << 16 | e << 8 | Pe(e, 2)), fr = /* @__PURE__ */ ur(Ns, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), Cs = /* @__PURE__ */ (() => {
   const e = new Uint8Array(16);
-  for (let t = 0, n = 1; t < 16; t++, n = nn(n))
+  for (let t = 0, n = 1; t < 16; t++, n = tn(n))
     e[t] = n;
   return e;
 })();
-function dr(e) {
+function hr(e) {
   le(e);
   const t = e.length;
   if (![16, 24, 32].includes(t))
     throw new Error(`aes: wrong key size: should be 16, 24 or 32, got: ${t}`);
-  const { sbox2: n } = rn, r = F(e), i = r.length, s = (a) => oe(n, a, a, a, a), o = new Uint32Array(t + 28);
+  const { sbox2: n } = nn, r = F(e), i = r.length, s = (a) => oe(n, a, a, a, a), o = new Uint32Array(t + 28);
   o.set(r);
   for (let a = i; a < o.length; a++) {
     let c = o[a - 1];
-    a % i === 0 ? c = s(Cs(c)) ^ ks[a / i - 1] : i > 6 && a % i === 4 && (c = s(c)), o[a] = o[a - i] ^ c;
+    a % i === 0 ? c = s(Bs(c)) ^ Cs[a / i - 1] : i > 6 && a % i === 4 && (c = s(c)), o[a] = o[a - i] ^ c;
   }
   return o;
 }
-function Us(e) {
-  const t = dr(e), n = t.slice(), r = t.length, { sbox2: i } = rn, { T0: s, T1: o, T2: a, T3: c } = hr;
+function ks(e) {
+  const t = hr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: a, T3: c } = fr;
   for (let l = 0; l < r; l += 4)
     for (let f = 0; f < 4; f++)
       n[l + f] = t[r - l - 4 + f];
@@ -2098,8 +2098,8 @@ function me(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 Tn(e, t, n, r, i) {
-  const { sbox2: s, T01: o, T23: a } = rn;
+function Ln(e, t, n, r, i) {
+  const { sbox2: s, T01: o, T23: a } = nn;
   let c = 0;
   t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
   const l = e.length / 4 - 2;
@@ -2110,8 +2110,8 @@ function Tn(e, t, n, r, i) {
   const f = e[c++] ^ oe(s, t, n, r, i), u = e[c++] ^ oe(s, n, r, i, t), d = e[c++] ^ oe(s, r, i, t, n), p = e[c++] ^ oe(s, i, t, n, r);
   return { s0: f, s1: u, s2: d, s3: p };
 }
-function Is(e, t, n, r, i) {
-  const { sbox2: s, T01: o, T23: a } = hr;
+function Us(e, t, n, r, i) {
+  const { sbox2: s, T01: o, T23: a } = fr;
   let c = 0;
   t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
   const l = e.length / 4 - 2;
@@ -2122,18 +2122,18 @@ function Is(e, t, n, r, i) {
   const f = e[c++] ^ oe(s, t, i, r, n), u = e[c++] ^ oe(s, n, t, i, r), d = e[c++] ^ oe(s, r, n, t, i), p = e[c++] ^ oe(s, i, r, n, t);
   return { s0: f, s1: u, s2: d, s3: p };
 }
-function yr(e, t) {
+function dr(e, t) {
   if (!t)
     return new Uint8Array(e);
   if (le(t), t.length < e)
     throw new Error(`aes: wrong destination length, expected at least ${e}, got: ${t.length}`);
   return t;
 }
-function _s(e) {
+function Is(e) {
   if (le(e), e.length % Ee !== 0)
     throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ee}`);
 }
-function Ls(e, t, n) {
+function _s(e, t, n) {
   let r = e.length;
   const i = r % Ee;
   if (!t && i !== 0)
@@ -2143,10 +2143,10 @@ function Ls(e, t, n) {
     let c = Ee - i;
     c || (c = Ee), r = r + c;
   }
-  const o = yr(r, n), a = F(o);
+  const o = dr(r, n), a = F(o);
   return { b: s, o: a, out: o };
 }
-function Ts(e, t) {
+function Ls(e, t) {
   if (!t)
     return e;
   const n = e.length;
@@ -2161,7 +2161,7 @@ function Ts(e, t) {
       throw new Error("aes/pcks5: wrong padding");
   return i;
 }
-function $s(e) {
+function Ts(e) {
   const t = new Uint8Array(16), n = F(t);
   t.set(e);
   const r = Ee - e.length;
@@ -2169,56 +2169,56 @@ function $s(e) {
     t[i] = r;
   return n;
 }
-const pr = /* @__PURE__ */ Ks({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
+const yr = /* @__PURE__ */ As({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
   le(t), le(n, 16);
   const i = !r.disablePadding;
   return {
     encrypt: (s, o) => {
-      const a = dr(t), { b: c, o: l, out: f } = Ls(s, i, o), u = F(n);
+      const a = hr(t), { b: c, o: l, out: f } = _s(s, i, o), u = F(n);
       let d = u[0], p = u[1], g = u[2], h = u[3], y = 0;
       for (; y + 4 <= c.length; )
-        d ^= c[y + 0], p ^= c[y + 1], g ^= c[y + 2], h ^= c[y + 3], { s0: d, s1: p, s2: g, s3: h } = Tn(a, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
+        d ^= c[y + 0], p ^= c[y + 1], g ^= c[y + 2], h ^= c[y + 3], { s0: d, s1: p, s2: g, s3: h } = Ln(a, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
       if (i) {
-        const w = $s(s.subarray(y * 4));
-        d ^= w[0], p ^= w[1], g ^= w[2], h ^= w[3], { s0: d, s1: p, s2: g, s3: h } = Tn(a, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
+        const w = Ts(s.subarray(y * 4));
+        d ^= w[0], p ^= w[1], g ^= w[2], h ^= w[3], { s0: d, s1: p, s2: g, s3: h } = Ln(a, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
       }
       return a.fill(0), f;
     },
     decrypt: (s, o) => {
-      _s(s);
-      const a = Us(t), c = F(n), l = yr(s.length, o), f = F(s), u = F(l);
+      Is(s);
+      const a = ks(t), c = F(n), l = dr(s.length, o), f = F(s), u = F(l);
       let d = c[0], p = c[1], g = c[2], h = c[3];
       for (let y = 0; y + 4 <= f.length; ) {
         const w = d, E = p, K = g, I = h;
         d = f[y + 0], p = f[y + 1], g = f[y + 2], h = f[y + 3];
-        const { s0: C, s1: m, s2: x, s3: S } = Is(a, d, p, g, h);
+        const { s0: C, s1: m, s2: x, s3: S } = Us(a, d, p, g, h);
         u[y++] = C ^ w, u[y++] = m ^ E, u[y++] = x ^ K, u[y++] = S ^ I;
       }
-      return a.fill(0), Ts(l, i);
+      return a.fill(0), Ls(l, i);
     }
   };
-}), gr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Rs = gr("expand 16-byte k"), Os = gr("expand 32-byte k"), Ps = F(Rs), wr = F(Os);
-wr.slice();
+}), pr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), $s = pr("expand 16-byte k"), Rs = pr("expand 32-byte k"), Os = F($s), gr = F(Rs);
+gr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
 }
-function Zt(e) {
+function zt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Qe = 64, Ms = 16, br = 2 ** 32 - 1, $n = new Uint32Array();
-function Hs(e, t, n, r, i, s, o, a) {
-  const c = i.length, l = new Uint8Array(Qe), f = F(l), u = Zt(i) && Zt(s), d = u ? F(i) : $n, p = u ? F(s) : $n;
+const Xe = 64, Ps = 16, wr = 2 ** 32 - 1, Tn = new Uint32Array();
+function Ms(e, t, n, r, i, s, o, a) {
+  const c = i.length, l = new Uint8Array(Xe), f = F(l), u = zt(i) && zt(s), d = u ? F(i) : Tn, p = u ? F(s) : Tn;
   for (let g = 0; g < c; o++) {
-    if (e(t, n, r, f, o, a), o >= br)
+    if (e(t, n, r, f, o, a), o >= wr)
       throw new Error("arx: counter overflow");
-    const h = Math.min(Qe, c - g);
-    if (u && h === Qe) {
+    const h = Math.min(Xe, c - g);
+    if (u && h === Xe) {
       const y = g / 4;
       if (g % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let w = 0, E; w < Ms; w++)
+      for (let w = 0, E; w < Ps; w++)
         E = y + w, p[E] = d[E] ^ f[w];
-      g += Qe;
+      g += Xe;
       continue;
     }
     for (let y = 0, w; y < h; y++)
@@ -2226,26 +2226,26 @@ function Hs(e, t, n, r, i, s, o, a) {
     g += h;
   }
 }
-function qs(e, t) {
-  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = Ss({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
+function Hs(e, t) {
+  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = xs({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return It(i), It(o), Ln(s), Ln(n), (a, c, l, f, u = 0) => {
+  return Ut(i), Ut(o), _n(s), _n(n), (a, c, l, f, u = 0) => {
     le(a), le(c), le(l);
     const d = l.length;
-    if (f || (f = new Uint8Array(d)), le(f), It(u), u < 0 || u >= br)
+    if (f || (f = new Uint8Array(d)), le(f), Ut(u), u < 0 || u >= wr)
       throw new Error("arx: counter overflow");
     if (f.length < d)
       throw new Error(`arx: output (${f.length}) is shorter than data (${d})`);
     const p = [];
     let g = a.length, h, y;
     if (g === 32)
-      h = a.slice(), p.push(h), y = wr;
+      h = a.slice(), p.push(h), y = gr;
     else if (g === 16 && n)
-      h = new Uint8Array(32), h.set(a), h.set(a, 16), y = Ps, p.push(h);
+      h = new Uint8Array(32), h.set(a), h.set(a, 16), y = Os, p.push(h);
     else
       throw new Error(`arx: invalid 32-byte key, got length=${g}`);
-    Zt(c) || (c = c.slice(), p.push(c));
+    zt(c) || (c = c.slice(), p.push(c));
     const w = F(h);
     if (r) {
       if (c.length !== 24)
@@ -2260,27 +2260,27 @@ function qs(e, t) {
       I.set(c, s ? 0 : 12 - c.length), c = I, p.push(c);
     }
     const K = F(c);
-    for (Hs(e, y, w, K, l, f, u, o); p.length > 0; )
+    for (Ms(e, y, w, K, l, f, u, o); p.length > 0; )
       p.pop().fill(0);
     return f;
   };
 }
-function Ds(e, t, n, r, i, s = 20) {
+function qs(e, t, n, r, i, s = 20) {
   let o = e[0], a = e[1], c = e[2], l = e[3], f = t[0], u = t[1], d = t[2], p = t[3], g = t[4], h = t[5], y = t[6], w = t[7], E = i, K = n[0], I = n[1], C = n[2], m = o, x = a, S = c, P = l, U = f, N = u, $ = d, R = p, H = g, b = h, v = y, A = w, k = E, B = K, _ = I, O = C;
   for (let X = 0; X < s; X += 2)
     m = m + U | 0, k = L(k ^ m, 16), H = H + k | 0, U = L(U ^ H, 12), m = m + U | 0, k = L(k ^ m, 8), H = H + k | 0, U = L(U ^ H, 7), x = x + N | 0, B = L(B ^ x, 16), b = b + B | 0, N = L(N ^ b, 12), x = x + N | 0, B = L(B ^ x, 8), b = b + B | 0, N = L(N ^ b, 7), S = S + $ | 0, _ = L(_ ^ S, 16), v = v + _ | 0, $ = L($ ^ v, 12), S = S + $ | 0, _ = L(_ ^ S, 8), v = v + _ | 0, $ = L($ ^ v, 7), P = P + R | 0, O = L(O ^ P, 16), A = A + O | 0, R = L(R ^ A, 12), P = P + R | 0, O = L(O ^ P, 8), A = A + O | 0, R = L(R ^ A, 7), m = m + N | 0, O = L(O ^ m, 16), v = v + O | 0, N = L(N ^ v, 12), m = m + N | 0, O = L(O ^ m, 8), v = v + O | 0, N = L(N ^ v, 7), x = x + $ | 0, k = L(k ^ x, 16), A = A + k | 0, $ = L($ ^ A, 12), x = x + $ | 0, k = L(k ^ x, 8), A = A + k | 0, $ = L($ ^ A, 7), S = S + R | 0, B = L(B ^ S, 16), H = H + B | 0, R = L(R ^ H, 12), S = S + R | 0, B = L(B ^ S, 8), H = H + B | 0, R = L(R ^ H, 7), P = P + U | 0, _ = L(_ ^ P, 16), b = b + _ | 0, U = L(U ^ b, 12), P = P + U | 0, _ = L(_ ^ P, 8), b = b + _ | 0, U = L(U ^ b, 7);
   let T = 0;
   r[T++] = o + m | 0, r[T++] = a + x | 0, r[T++] = c + S | 0, r[T++] = l + P | 0, r[T++] = f + U | 0, r[T++] = u + N | 0, r[T++] = d + $ | 0, r[T++] = p + R | 0, r[T++] = g + H | 0, r[T++] = h + b | 0, r[T++] = y + v | 0, r[T++] = w + A | 0, r[T++] = E + k | 0, r[T++] = K + B | 0, r[T++] = I + _ | 0, r[T++] = C + O | 0;
 }
-const vr = /* @__PURE__ */ qs(Ds, {
+const br = /* @__PURE__ */ Hs(qs, {
   counterRight: !1,
   counterLength: 4,
   allowShortKeys: !1
 });
-class mr extends rr {
+class vr extends nr {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, se.hash(t);
-    const r = Je(n);
+    const r = Ge(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;
@@ -2312,28 +2312,28 @@ class mr extends rr {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const pt = (e, t, n) => new mr(e, t).update(n).digest();
-pt.create = (e, t) => new mr(e, t);
-function sn(e, t, n) {
-  return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), pt(e, Je(n), Je(t));
+const yt = (e, t, n) => new vr(e, t).update(n).digest();
+yt.create = (e, t) => new vr(e, t);
+function rn(e, t, n) {
+  return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), yt(e, Ge(n), Ge(t));
 }
-const Lt = new Uint8Array([0]), Rn = new Uint8Array();
-function Er(e, t, n, r = 32) {
+const _t = new Uint8Array([0]), $n = new Uint8Array();
+function mr(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 = Rn);
-  const s = new Uint8Array(i * e.outputLen), o = pt.create(e, t), a = o._cloneInto(), c = new Uint8Array(o.outputLen);
+  n === void 0 && (n = $n);
+  const s = new Uint8Array(i * e.outputLen), o = yt.create(e, t), a = o._cloneInto(), c = new Uint8Array(o.outputLen);
   for (let l = 0; l < i; l++)
-    Lt[0] = l + 1, a.update(l === 0 ? Rn : c).update(n).update(Lt).digestInto(c), s.set(c, e.outputLen * l), o._cloneInto(a);
-  return o.destroy(), a.destroy(), c.fill(0), Lt.fill(0), s.slice(0, r);
+    _t[0] = l + 1, a.update(l === 0 ? $n : c).update(n).update(_t).digestInto(c), s.set(c, e.outputLen * l), o._cloneInto(a);
+  return o.destroy(), a.destroy(), c.fill(0), _t.fill(0), s.slice(0, r);
 }
-var js = Object.defineProperty, D = (e, t) => {
+var Ds = Object.defineProperty, D = (e, t) => {
   for (var n in t)
-    js(e, n, { get: t[n], enumerable: !0 });
-}, $e = Symbol("verified"), Vs = (e) => e instanceof Object;
-function xr(e) {
-  if (!Vs(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))
+    Ds(e, n, { get: t[n], enumerable: !0 });
+}, $e = Symbol("verified"), js = (e) => e instanceof Object;
+function Er(e) {
+  if (!js(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];
@@ -2345,32 +2345,32 @@ function xr(e) {
   }
   return !0;
 }
-var zs = {};
-D(zs, {
-  Queue: () => Gs,
-  QueueNode: () => Sr,
-  binarySearch: () => on,
-  insertEventIntoAscendingList: () => Ws,
-  insertEventIntoDescendingList: () => Fs,
-  normalizeURL: () => Zs,
+var Vs = {};
+D(Vs, {
+  Queue: () => Ws,
+  QueueNode: () => xr,
+  binarySearch: () => sn,
+  insertEventIntoAscendingList: () => Fs,
+  insertEventIntoDescendingList: () => Zs,
+  normalizeURL: () => zs,
   utf8Decoder: () => ie,
   utf8Encoder: () => te
 });
 var ie = new TextDecoder("utf-8"), te = new TextEncoder();
-function Zs(e) {
+function zs(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();
 }
-function Fs(e, t) {
-  const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
+function Zs(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 Ws(e, t) {
-  const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
+function Fs(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;
 }
-function on(e, t) {
+function sn(e, t) {
   let n = 0, r = e.length - 1;
   for (; n <= r; ) {
     const i = Math.floor((n + r) / 2), s = t(e[i]);
@@ -2380,21 +2380,21 @@ function on(e, t) {
   }
   return [n, !1];
 }
-var Sr = class {
+var xr = class {
   constructor(e) {
     ee(this, "value");
     ee(this, "next", null);
     ee(this, "prev", null);
     this.value = e;
   }
-}, Gs = class {
+}, Ws = class {
   constructor() {
     ee(this, "first");
     ee(this, "last");
     this.first = null, this.last = null;
   }
   enqueue(e) {
-    const t = new Sr(e);
+    const t = new xr(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() {
@@ -2407,7 +2407,7 @@ var Sr = class {
     const e = this.first;
     return this.first = e.next, e.value;
   }
-}, Js = class {
+}, Gs = class {
   generateSecretKey() {
     return Ze.utils.randomPrivateKey();
   }
@@ -2416,12 +2416,12 @@ var Sr = class {
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = M(Ze.getPublicKey(t)), n.id = nt(n), n.sig = M(Ze.sign(nt(n), t)), n[$e] = !0, n;
+    return n.pubkey = M(Ze.getPublicKey(t)), n.id = tt(n), n.sig = M(Ze.sign(tt(n), t)), n[$e] = !0, n;
   }
   verifyEvent(e) {
     if (typeof e[$e] == "boolean")
       return e[$e];
-    const t = nt(e);
+    const t = tt(e);
     if (t !== e.id)
       return e[$e] = !1, !1;
     try {
@@ -2432,130 +2432,130 @@ var Sr = class {
     }
   }
 };
-function Ys(e) {
-  if (!xr(e))
+function Js(e) {
+  if (!Er(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 nt(e) {
-  let t = Se(te.encode(Ys(e)));
+function tt(e) {
+  let t = Se(te.encode(Js(e)));
   return M(t);
 }
-var gt = new Js(), Me = gt.generateSecretKey, Ce = gt.getPublicKey, ae = gt.finalizeEvent, wt = gt.verifyEvent, Xs = {};
-D(Xs, {
-  Application: () => Qo,
-  BadgeAward: () => ao,
-  BadgeDefinition: () => Zo,
-  BlockedRelaysList: () => Io,
-  BookmarkList: () => Co,
-  Bookmarksets: () => jo,
-  Calendar: () => oa,
-  CalendarEventRSVP: () => aa,
-  ChannelCreation: () => Cr,
-  ChannelHideMessage: () => Ir,
-  ChannelMessage: () => Ur,
-  ChannelMetadata: () => kr,
-  ChannelMuteUser: () => _r,
-  ClassifiedListing: () => na,
-  ClientAuth: () => Lr,
-  CommunitiesList: () => ko,
-  CommunityDefinition: () => ua,
-  CommunityPostApproval: () => wo,
-  Contacts: () => ro,
-  CreateOrUpdateProduct: () => Go,
-  CreateOrUpdateStall: () => Wo,
-  Curationsets: () => Vo,
-  Date: () => ia,
-  DraftClassifiedListing: () => ra,
-  DraftLong: () => Yo,
-  Emojisets: () => Xo,
-  EncryptedDirectMessage: () => io,
-  EncryptedDirectMessages: () => so,
-  EventDeletion: () => oo,
-  FileMetadata: () => uo,
-  FileServerPreference: () => $o,
-  Followsets: () => Ho,
-  GenericRepost: () => co,
-  Genericlists: () => qo,
-  HTTPAuth: () => ln,
-  Handlerinformation: () => la,
-  Handlerrecommendation: () => ca,
-  Highlights: () => Ao,
-  InterestsList: () => Lo,
-  Interestsets: () => Fo,
-  JobFeedback: () => mo,
-  JobRequest: () => bo,
-  JobResult: () => vo,
-  Label: () => go,
-  LightningPubRPC: () => Oo,
-  LiveChatMessage: () => fo,
-  LiveEvent: () => ea,
-  LongFormArticle: () => Jo,
-  Metadata: () => eo,
-  Mutelist: () => Ko,
-  NWCWalletInfo: () => Ro,
-  NWCWalletRequest: () => Tr,
-  NWCWalletResponse: () => Po,
-  NostrConnect: () => Mo,
-  OpenTimestamps: () => lo,
-  Pinlist: () => No,
-  ProblemTracker: () => ho,
-  ProfileBadges: () => zo,
-  PublicChatsList: () => Uo,
-  Reaction: () => cn,
-  RecommendRelay: () => no,
-  RelayList: () => Bo,
-  Relaysets: () => Do,
-  Report: () => yo,
-  Reporting: () => po,
-  Repost: () => an,
-  SearchRelaysList: () => _o,
-  ShortTextNote: () => to,
-  Time: () => sa,
-  UserEmojiList: () => To,
-  UserStatuses: () => ta,
-  Zap: () => So,
-  ZapGoal: () => Eo,
-  ZapRequest: () => xo,
-  classifyKind: () => Qs,
-  isEphemeralKind: () => Nr,
-  isParameterizedReplaceableKind: () => Br,
-  isRegularKind: () => Ar,
-  isReplaceableKind: () => Kr
+var pt = new Gs(), Me = pt.generateSecretKey, Ce = pt.getPublicKey, ae = pt.finalizeEvent, gt = pt.verifyEvent, Ys = {};
+D(Ys, {
+  Application: () => Xo,
+  BadgeAward: () => oo,
+  BadgeDefinition: () => zo,
+  BlockedRelaysList: () => Uo,
+  BookmarkList: () => Bo,
+  Bookmarksets: () => Do,
+  Calendar: () => sa,
+  CalendarEventRSVP: () => oa,
+  ChannelCreation: () => Br,
+  ChannelHideMessage: () => Ur,
+  ChannelMessage: () => kr,
+  ChannelMetadata: () => Cr,
+  ChannelMuteUser: () => Ir,
+  ClassifiedListing: () => ta,
+  ClientAuth: () => _r,
+  CommunitiesList: () => Co,
+  CommunityDefinition: () => la,
+  CommunityPostApproval: () => go,
+  Contacts: () => no,
+  CreateOrUpdateProduct: () => Wo,
+  CreateOrUpdateStall: () => Fo,
+  Curationsets: () => jo,
+  Date: () => ra,
+  DraftClassifiedListing: () => na,
+  DraftLong: () => Jo,
+  Emojisets: () => Yo,
+  EncryptedDirectMessage: () => ro,
+  EncryptedDirectMessages: () => io,
+  EventDeletion: () => so,
+  FileMetadata: () => lo,
+  FileServerPreference: () => To,
+  Followsets: () => Mo,
+  GenericRepost: () => ao,
+  Genericlists: () => Ho,
+  HTTPAuth: () => cn,
+  Handlerinformation: () => ca,
+  Handlerrecommendation: () => aa,
+  Highlights: () => So,
+  InterestsList: () => _o,
+  Interestsets: () => Zo,
+  JobFeedback: () => vo,
+  JobRequest: () => wo,
+  JobResult: () => bo,
+  Label: () => po,
+  LightningPubRPC: () => Ro,
+  LiveChatMessage: () => uo,
+  LiveEvent: () => Qo,
+  LongFormArticle: () => Go,
+  Metadata: () => Qs,
+  Mutelist: () => Ao,
+  NWCWalletInfo: () => $o,
+  NWCWalletRequest: () => Lr,
+  NWCWalletResponse: () => Oo,
+  NostrConnect: () => Po,
+  OpenTimestamps: () => co,
+  Pinlist: () => Ko,
+  ProblemTracker: () => fo,
+  ProfileBadges: () => Vo,
+  PublicChatsList: () => ko,
+  Reaction: () => an,
+  RecommendRelay: () => to,
+  RelayList: () => No,
+  Relaysets: () => qo,
+  Report: () => ho,
+  Reporting: () => yo,
+  Repost: () => on,
+  SearchRelaysList: () => Io,
+  ShortTextNote: () => eo,
+  Time: () => ia,
+  UserEmojiList: () => Lo,
+  UserStatuses: () => ea,
+  Zap: () => xo,
+  ZapGoal: () => mo,
+  ZapRequest: () => Eo,
+  classifyKind: () => Xs,
+  isEphemeralKind: () => Kr,
+  isParameterizedReplaceableKind: () => Nr,
+  isRegularKind: () => Sr,
+  isReplaceableKind: () => Ar
 });
-function Ar(e) {
+function Sr(e) {
   return 1e3 <= e && e < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(e);
 }
-function Kr(e) {
+function Ar(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
-function Nr(e) {
+function Kr(e) {
   return 2e4 <= e && e < 3e4;
 }
-function Br(e) {
+function Nr(e) {
   return 3e4 <= e && e < 4e4;
 }
-function Qs(e) {
-  return Ar(e) ? "regular" : Kr(e) ? "replaceable" : Nr(e) ? "ephemeral" : Br(e) ? "parameterized" : "unknown";
-}
-var eo = 0, to = 1, no = 2, ro = 3, io = 4, so = 4, oo = 5, an = 6, cn = 7, ao = 8, co = 16, Cr = 40, kr = 41, Ur = 42, Ir = 43, _r = 44, lo = 1040, uo = 1063, fo = 1311, ho = 1971, yo = 1984, po = 1984, go = 1985, wo = 4550, bo = 5999, vo = 6999, mo = 7e3, Eo = 9041, xo = 9734, So = 9735, Ao = 9802, Ko = 1e4, No = 10001, Bo = 10002, Co = 10003, ko = 10004, Uo = 10005, Io = 10006, _o = 10007, Lo = 10015, To = 10030, $o = 10096, Ro = 13194, Oo = 21e3, Lr = 22242, Tr = 23194, Po = 23195, Mo = 24133, ln = 27235, Ho = 3e4, qo = 30001, Do = 30002, jo = 30003, Vo = 30004, zo = 30008, Zo = 30009, Fo = 30015, Wo = 30017, Go = 30018, Jo = 30023, Yo = 30024, Xo = 30030, Qo = 30078, ea = 30311, ta = 30315, na = 30402, ra = 30403, ia = 31922, sa = 31923, oa = 31924, aa = 31925, ca = 31989, la = 31990, ua = 34550, fa = {};
-D(fa, {
-  getHex64: () => un,
-  getInt: () => $r,
-  getSubscriptionId: () => ha,
-  matchEventId: () => da,
-  matchEventKind: () => pa,
-  matchEventPubkey: () => ya
+function Xs(e) {
+  return Sr(e) ? "regular" : Ar(e) ? "replaceable" : Kr(e) ? "ephemeral" : Nr(e) ? "parameterized" : "unknown";
+}
+var Qs = 0, eo = 1, to = 2, no = 3, ro = 4, io = 4, so = 5, on = 6, an = 7, oo = 8, ao = 16, Br = 40, Cr = 41, kr = 42, Ur = 43, Ir = 44, co = 1040, lo = 1063, uo = 1311, fo = 1971, ho = 1984, yo = 1984, po = 1985, go = 4550, wo = 5999, bo = 6999, vo = 7e3, mo = 9041, Eo = 9734, xo = 9735, So = 9802, Ao = 1e4, Ko = 10001, No = 10002, Bo = 10003, Co = 10004, ko = 10005, Uo = 10006, Io = 10007, _o = 10015, Lo = 10030, To = 10096, $o = 13194, Ro = 21e3, _r = 22242, Lr = 23194, Oo = 23195, Po = 24133, cn = 27235, Mo = 3e4, Ho = 30001, qo = 30002, Do = 30003, jo = 30004, Vo = 30008, zo = 30009, Zo = 30015, Fo = 30017, Wo = 30018, Go = 30023, Jo = 30024, Yo = 30030, Xo = 30078, Qo = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, sa = 31924, oa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
+D(ua, {
+  getHex64: () => ln,
+  getInt: () => Tr,
+  getSubscriptionId: () => fa,
+  matchEventId: () => ha,
+  matchEventKind: () => ya,
+  matchEventPubkey: () => da
 });
-function un(e, t) {
+function ln(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 $r(e, t) {
+function Tr(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 ha(e) {
+function fa(e) {
   let t = e.slice(0, 22).indexOf('"EVENT"');
   if (t === -1)
     return null;
@@ -2568,22 +2568,22 @@ function ha(e) {
   let s = r + 1 + i;
   return e.slice(r + 1, s);
 }
+function ha(e, t) {
+  return t === ln(e, "id");
+}
 function da(e, t) {
-  return t === un(e, "id");
+  return t === ln(e, "pubkey");
 }
 function ya(e, t) {
-  return t === un(e, "pubkey");
+  return t === Tr(e, "kind");
 }
-function pa(e, t) {
-  return t === $r(e, "kind");
-}
-var ga = {};
-D(ga, {
-  makeAuthEvent: () => wa
+var pa = {};
+D(pa, {
+  makeAuthEvent: () => ga
 });
-function wa(e, t) {
+function ga(e, t) {
   return {
-    kind: Lr,
+    kind: _r,
     created_at: Math.floor(Date.now() / 1e3),
     tags: [
       ["relay", e],
@@ -2592,22 +2592,22 @@ function wa(e, t) {
     content: ""
   };
 }
-var ba;
+var wa;
 try {
-  ba = WebSocket;
+  wa = WebSocket;
 } catch {
 }
-var va;
+var ba;
 try {
-  va = WebSocket;
+  ba = WebSocket;
 } catch {
 }
-var We = {};
-D(We, {
-  BECH32_REGEX: () => Rr,
-  Bech32MaxSize: () => fn,
-  decode: () => bt,
-  encodeBytes: () => vt,
+var va = {};
+D(va, {
+  BECH32_REGEX: () => $r,
+  Bech32MaxSize: () => un,
+  decode: () => wt,
+  encodeBytes: () => bt,
   naddrEncode: () => Na,
   neventEncode: () => Ka,
   noteEncode: () => Sa,
@@ -2616,17 +2616,17 @@ D(We, {
   nrelayEncode: () => Ba,
   nsecEncode: () => Ea
 });
-var fn = 5e3, Rr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
+var un = 5e3, $r = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
 function ma(e) {
   const t = new Uint8Array(4);
   return t[0] = e >> 24 & 255, t[1] = e >> 16 & 255, t[2] = e >> 8 & 255, t[3] = e & 255, t;
 }
-function bt(e) {
+function wt(e) {
   var i, s, o, a, c, l, f, u;
-  let { prefix: t, words: n } = je.decode(e, fn), r = new Uint8Array(je.fromWords(n));
+  let { prefix: t, words: n } = je.decode(e, un), r = new Uint8Array(je.fromWords(n));
   switch (t) {
     case "nprofile": {
-      let d = et(r);
+      let d = Qe(r);
       if (!((i = d[0]) != null && i[0]))
         throw new Error("missing TLV 0 for nprofile");
       if (d[0][0].length !== 32)
@@ -2640,7 +2640,7 @@ function bt(e) {
       };
     }
     case "nevent": {
-      let d = et(r);
+      let d = Qe(r);
       if (!((s = d[0]) != null && s[0]))
         throw new Error("missing TLV 0 for nevent");
       if (d[0][0].length !== 32)
@@ -2660,7 +2660,7 @@ function bt(e) {
       };
     }
     case "naddr": {
-      let d = et(r);
+      let d = Qe(r);
       if (!((c = d[0]) != null && c[0]))
         throw new Error("missing TLV 0 for naddr");
       if (!((l = d[2]) != null && l[0]))
@@ -2682,7 +2682,7 @@ function bt(e) {
       };
     }
     case "nrelay": {
-      let d = et(r);
+      let d = Qe(r);
       if (!((u = d[0]) != null && u[0]))
         throw new Error("missing TLV 0 for nrelay");
       return {
@@ -2699,7 +2699,7 @@ function bt(e) {
       throw new Error(`unknown prefix ${t}`);
   }
 }
-function et(e) {
+function Qe(e) {
   let t = {}, n = e;
   for (; n.length > 0; ) {
     let r = n[0], i = n[1], s = n.slice(2, 2 + i);
@@ -2710,115 +2710,115 @@ function et(e) {
   return t;
 }
 function Ea(e) {
-  return vt("nsec", e);
+  return bt("nsec", e);
 }
 function xa(e) {
-  return vt("npub", W(e));
+  return bt("npub", W(e));
 }
 function Sa(e) {
-  return vt("note", W(e));
+  return bt("note", W(e));
 }
-function Xe(e, t) {
+function Ye(e, t) {
   let n = je.toWords(t);
-  return je.encode(e, n, fn);
+  return je.encode(e, n, un);
 }
-function vt(e, t) {
-  return Xe(e, t);
+function bt(e, t) {
+  return Ye(e, t);
 }
 function Aa(e) {
-  let t = mt({
+  let t = vt({
     0: [W(e.pubkey)],
     1: (e.relays || []).map((n) => te.encode(n))
   });
-  return Xe("nprofile", t);
+  return Ye("nprofile", t);
 }
 function Ka(e) {
   let t;
   e.kind !== void 0 && (t = ma(e.kind));
-  let n = mt({
+  let n = vt({
     0: [W(e.id)],
     1: (e.relays || []).map((r) => te.encode(r)),
     2: e.author ? [W(e.author)] : [],
     3: t ? [new Uint8Array(t)] : []
   });
-  return Xe("nevent", n);
+  return Ye("nevent", n);
 }
 function Na(e) {
   let t = new ArrayBuffer(4);
   new DataView(t).setUint32(0, e.kind, !1);
-  let n = mt({
+  let n = vt({
     0: [te.encode(e.identifier)],
     1: (e.relays || []).map((r) => te.encode(r)),
     2: [W(e.pubkey)],
     3: [new Uint8Array(t)]
   });
-  return Xe("naddr", n);
+  return Ye("naddr", n);
 }
 function Ba(e) {
-  let t = mt({
+  let t = vt({
     0: [te.encode(e)]
   });
-  return Xe("nrelay", t);
+  return Ye("nrelay", t);
 }
-function mt(e) {
+function vt(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);
     });
-  }), dt(...t);
+  }), ht(...t);
 }
 var Ca = {};
 D(Ca, {
   decrypt: () => ka,
-  encrypt: () => Or
+  encrypt: () => Rr
 });
-async function Or(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e, i = Ue.getSharedSecret(r, "02" + t), s = Pr(i);
-  let o = Uint8Array.from(sr(16)), a = te.encode(n), c = pr(s, o).encrypt(a), l = ue.encode(new Uint8Array(c)), f = ue.encode(new Uint8Array(o.buffer));
+async function Rr(e, t, n) {
+  const r = e instanceof Uint8Array ? M(e) : e, i = Ue.getSharedSecret(r, "02" + t), s = Or(i);
+  let o = Uint8Array.from(ir(16)), a = te.encode(n), c = yr(s, o).encrypt(a), l = ue.encode(new Uint8Array(c)), f = ue.encode(new Uint8Array(o.buffer));
   return `${l}?iv=${f}`;
 }
 async function ka(e, t, n) {
   const r = e instanceof Uint8Array ? M(e) : e;
-  let [i, s] = n.split("?iv="), o = Ue.getSharedSecret(r, "02" + t), a = Pr(o), c = ue.decode(s), l = ue.decode(i), f = pr(a, c).decrypt(l);
+  let [i, s] = n.split("?iv="), o = Ue.getSharedSecret(r, "02" + t), a = Or(o), c = ue.decode(s), l = ue.decode(i), f = yr(a, c).decrypt(l);
   return ie.decode(f);
 }
-function Pr(e) {
+function Or(e) {
   return e.slice(1, 33);
 }
 var Ua = {};
 D(Ua, {
-  NIP05_REGEX: () => Mr,
+  NIP05_REGEX: () => Pr,
   isValid: () => La,
-  queryProfile: () => Hr,
+  queryProfile: () => Mr,
   searchDomain: () => _a,
   useFetchImplementation: () => Ia
 });
-var Mr = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Et;
+var Pr = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, mt;
 try {
-  Et = fetch;
+  mt = fetch;
 } catch {
 }
 function Ia(e) {
-  Et = e;
+  mt = e;
 }
 async function _a(e, t = "") {
   try {
     const n = `https://${e}/.well-known/nostr.json?name=${t}`;
-    return (await (await Et(n, { redirect: "error" })).json()).names;
+    return (await (await mt(n, { redirect: "error" })).json()).names;
   } catch {
     return {};
   }
 }
-async function Hr(e) {
+async function Mr(e) {
   var s;
-  const t = e.match(Mr);
+  const t = e.match(Pr);
   if (!t)
     return null;
   const [n, r = "_", i] = t;
   try {
-    const o = `https://${i}/.well-known/nostr.json?name=${r}`, a = await (await Et(o, { redirect: "error" })).json();
+    const o = `https://${i}/.well-known/nostr.json?name=${r}`, a = await (await mt(o, { redirect: "error" })).json();
     let c = a.names[r];
     return c ? { pubkey: c, relays: (s = a.relays) == null ? void 0 : s[c] } : null;
   } catch {
@@ -2826,7 +2826,7 @@ async function Hr(e) {
   }
 }
 async function La(e, t) {
-  let n = await Hr(t);
+  let n = await Mr(t);
   return n ? n.pubkey === e : !1;
 }
 var Ta = {};
@@ -2879,13 +2879,13 @@ D(Ra, {
   fetchRelayInformation: () => Pa,
   useFetchImplementation: () => Oa
 });
-var qr;
+var Hr;
 try {
-  qr = fetch;
+  Hr = fetch;
 } catch {
 }
 function Oa(e) {
-  qr = e;
+  Hr = e;
 }
 async function Pa(e) {
   return await (await fetch(e.replace("ws://", "http://").replace("wss://", "https://"), {
@@ -2894,10 +2894,10 @@ async function Pa(e) {
 }
 var Ma = {};
 D(Ma, {
-  getPow: () => Dr,
+  getPow: () => qr,
   minePow: () => Ha
 });
-function Dr(e) {
+function qr(e) {
   let t = 0;
   for (let n = 0; n < e.length; n++) {
     const r = parseInt(e[n], 16);
@@ -2915,7 +2915,7 @@ function Ha(e, t) {
   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 = nt(r), Dr(r.id) >= t)
+    if (s !== r.created_at && (n = 0, r.created_at = s), i[1] = (++n).toString(), r.id = tt(r), qr(r.id) >= t)
       break;
   }
   return r;
@@ -2924,12 +2924,12 @@ var qa = {};
 D(qa, {
   finishRepostEvent: () => Da,
   getRepostedEvent: () => ja,
-  getRepostedEventPointer: () => jr
+  getRepostedEventPointer: () => Dr
 });
 function Da(e, t, n, r) {
   return ae(
     {
-      kind: an,
+      kind: on,
       tags: [...e.tags ?? [], ["e", t.id, n], ["p", t.pubkey]],
       content: e.content === "" ? "" : JSON.stringify(t),
       created_at: e.created_at
@@ -2937,8 +2937,8 @@ function Da(e, t, n, r) {
     r
   );
 }
-function jr(e) {
-  if (e.kind !== an)
+function Dr(e) {
+  if (e.kind !== on)
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -2953,7 +2953,7 @@ function jr(e) {
     };
 }
 function ja(e, { skipVerification: t } = {}) {
-  const n = jr(e);
+  const n = Dr(e);
   if (n === void 0 || e.content === "")
     return;
   let r;
@@ -2962,27 +2962,27 @@ function ja(e, { skipVerification: t } = {}) {
   } catch {
     return;
   }
-  if (r.id === n.id && !(!t && !wt(r)))
+  if (r.id === n.id && !(!t && !gt(r)))
     return r;
 }
 var Va = {};
 D(Va, {
-  NOSTR_URI_REGEX: () => xt,
+  NOSTR_URI_REGEX: () => Et,
   parse: () => Za,
   test: () => za
 });
-var xt = new RegExp(`nostr:(${Rr.source})`);
+var Et = new RegExp(`nostr:(${$r.source})`);
 function za(e) {
-  return typeof e == "string" && new RegExp(`^${xt.source}$`).test(e);
+  return typeof e == "string" && new RegExp(`^${Et.source}$`).test(e);
 }
 function Za(e) {
-  const t = e.match(new RegExp(`^${xt.source}$`));
+  const t = e.match(new RegExp(`^${Et.source}$`));
   if (!t)
     throw new Error(`Invalid Nostr URI: ${e}`);
   return {
     uri: t[0],
     value: t[1],
-    decoded: bt(t[1])
+    decoded: wt(t[1])
   };
 }
 var Fa = {};
@@ -2995,7 +2995,7 @@ function Wa(e, t, n) {
   return ae(
     {
       ...e,
-      kind: cn,
+      kind: an,
       tags: [...e.tags ?? [], ...r, ["e", t.id], ["p", t.pubkey]],
       content: e.content ?? "+"
     },
@@ -3003,7 +3003,7 @@ function Wa(e, t, n) {
   );
 }
 function Ga(e) {
-  if (e.kind !== cn)
+  if (e.kind !== an)
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -3020,19 +3020,19 @@ function Ga(e) {
 var Ja = {};
 D(Ja, {
   matchAll: () => Ya,
-  regex: () => hn,
+  regex: () => fn,
   replaceAll: () => Xa
 });
-var hn = () => new RegExp(`\\b${xt.source}\\b`, "g");
+var fn = () => new RegExp(`\\b${Et.source}\\b`, "g");
 function* Ya(e) {
-  const t = e.matchAll(hn());
+  const t = e.matchAll(fn());
   for (const n of t)
     try {
       const [r, i] = n;
       yield {
         uri: r,
         value: i,
-        decoded: bt(i),
+        decoded: wt(i),
         start: n.index,
         end: n.index + r.length
       };
@@ -3040,10 +3040,10 @@ function* Ya(e) {
     }
 }
 function Xa(e, t) {
-  return e.replaceAll(hn(), (n, r) => t({
+  return e.replaceAll(fn(), (n, r) => t({
     uri: n,
     value: r,
-    decoded: bt(r)
+    decoded: wt(r)
   }));
 }
 var Qa = {};
@@ -3064,7 +3064,7 @@ var ec = (e, t) => {
     return;
   return ae(
     {
-      kind: Cr,
+      kind: Br,
       tags: [...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3081,7 +3081,7 @@ var ec = (e, t) => {
     return;
   return ae(
     {
-      kind: kr,
+      kind: Cr,
       tags: [["e", e.channel_create_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3092,7 +3092,7 @@ var ec = (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"]), ae(
     {
-      kind: Ur,
+      kind: kr,
       tags: [...n, ...e.tags ?? []],
       content: e.content,
       created_at: e.created_at
@@ -3109,7 +3109,7 @@ var ec = (e, t) => {
     return;
   return ae(
     {
-      kind: Ir,
+      kind: Ur,
       tags: [["e", e.channel_message_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3126,7 +3126,7 @@ var ec = (e, t) => {
     return;
   return ae(
     {
-      kind: _r,
+      kind: Ir,
       tags: [["p", e.pubkey_to_mute], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3135,14 +3135,14 @@ var ec = (e, t) => {
   );
 }, sc = {};
 D(sc, {
-  EMOJI_SHORTCODE_REGEX: () => Vr,
+  EMOJI_SHORTCODE_REGEX: () => jr,
   matchAll: () => oc,
-  regex: () => dn,
+  regex: () => hn,
   replaceAll: () => ac
 });
-var Vr = /:(\w+):/, dn = () => new RegExp(`\\B${Vr.source}\\B`, "g");
+var jr = /:(\w+):/, hn = () => new RegExp(`\\B${jr.source}\\B`, "g");
 function* oc(e) {
-  const t = e.matchAll(dn());
+  const t = e.matchAll(hn());
   for (const n of t)
     try {
       const [r, i] = n;
@@ -3156,7 +3156,7 @@ function* oc(e) {
     }
 }
 function ac(e, t) {
-  return e.replaceAll(dn(), (n, r) => t({
+  return e.replaceAll(hn(), (n, r) => t({
     shortcode: n,
     name: r
   }));
@@ -3166,42 +3166,42 @@ D(cc, {
   useFetchImplementation: () => lc,
   validateGithub: () => uc
 });
-var yn;
+var dn;
 try {
-  yn = fetch;
+  dn = fetch;
 } catch {
 }
 function lc(e) {
-  yn = e;
+  dn = e;
 }
 async function uc(e, t, n) {
   try {
-    return await (await yn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
+    return await (await dn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
   } catch {
     return !1;
   }
 }
 var j = {};
 D(j, {
-  decrypt: () => Yr,
-  encrypt: () => Jr,
-  getConversationKey: () => Fr,
+  decrypt: () => Jr,
+  encrypt: () => Gr,
+  getConversationKey: () => Zr,
   v2: () => pc
 });
-var zr = 1, Zr = 65535;
-function Fr(e, t) {
+var Vr = 1, zr = 65535;
+function Zr(e, t) {
   const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return sn(Se, n, "nip44-v2");
+  return rn(Se, n, "nip44-v2");
 }
-function Wr(e, t) {
-  const n = Er(Se, e, t, 76);
+function Fr(e, t) {
+  const n = mr(Se, e, t, 76);
   return {
     chacha_key: n.subarray(0, 32),
     chacha_nonce: n.subarray(32, 44),
     hmac_key: n.subarray(44, 76)
   };
 }
-function pn(e) {
+function yn(e) {
   if (!Number.isSafeInteger(e) || e < 1)
     throw new Error("expected positive integer");
   if (e <= 32)
@@ -3210,26 +3210,26 @@ function pn(e) {
   return n * (Math.floor((e - 1) / n) + 1);
 }
 function fc(e) {
-  if (!Number.isSafeInteger(e) || e < zr || e > Zr)
+  if (!Number.isSafeInteger(e) || e < Vr || e > zr)
     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 hc(e) {
-  const t = te.encode(e), n = t.length, r = fc(n), i = new Uint8Array(pn(n) - n);
-  return dt(r, t, i);
+  const t = te.encode(e), n = t.length, r = fc(n), i = new Uint8Array(yn(n) - n);
+  return ht(r, t, i);
 }
 function dc(e) {
   const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
-  if (t < zr || t > Zr || n.length !== t || e.length !== 2 + pn(t))
+  if (t < Vr || t > zr || n.length !== t || e.length !== 2 + yn(t))
     throw new Error("invalid padding");
   return ie.decode(n);
 }
-function Gr(e, t, n) {
+function Wr(e, t, n) {
   if (n.length !== 32)
     throw new Error("AAD associated data must be 32 bytes");
-  const r = dt(n, t);
-  return pt(Se, e, r);
+  const r = ht(n, t);
+  return yt(Se, e, r);
 }
 function yc(e) {
   if (typeof e != "string")
@@ -3257,24 +3257,24 @@ function yc(e) {
     mac: n.subarray(-32)
   };
 }
-function Jr(e, t, n = sr(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = Wr(t, n), o = hc(e), a = vr(r, i, o), c = Gr(s, a, n);
-  return ue.encode(dt(new Uint8Array([2]), n, a, c));
+function Gr(e, t, n = ir(32)) {
+  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = Fr(t, n), o = hc(e), a = br(r, i, o), c = Wr(s, a, n);
+  return ue.encode(ht(new Uint8Array([2]), n, a, c));
 }
-function Yr(e, t) {
-  const { nonce: n, ciphertext: r, mac: i } = yc(e), { chacha_key: s, chacha_nonce: o, hmac_key: a } = Wr(t, n), c = Gr(a, r, n);
-  if (!As(c, i))
+function Jr(e, t) {
+  const { nonce: n, ciphertext: r, mac: i } = yc(e), { chacha_key: s, chacha_nonce: o, hmac_key: a } = Fr(t, n), c = Wr(a, r, n);
+  if (!Ss(c, i))
     throw new Error("invalid MAC");
-  const l = vr(s, o, r);
+  const l = br(s, o, r);
   return dc(l);
 }
 var pc = {
   utils: {
-    getConversationKey: Fr,
-    calcPaddedLen: pn
+    getConversationKey: Zr,
+    calcPaddedLen: yn
   },
-  encrypt: Jr,
-  decrypt: Yr
+  encrypt: Gr,
+  decrypt: Jr
 }, gc = {};
 D(gc, {
   makeNwcRequestEvent: () => bc,
@@ -3287,13 +3287,13 @@ function wc(e) {
   return { pubkey: r, relay: i, secret: s };
 }
 async function bc(e, t, n) {
-  const i = await Or(t, e, JSON.stringify({
+  const i = await Rr(t, e, JSON.stringify({
     method: "pay_invoice",
     params: {
       invoice: n
     }
   })), s = {
-    kind: Tr,
+    kind: Lr,
     created_at: Math.round(Date.now() / 1e3),
     content: i,
     tags: [["p", e]]
@@ -3308,13 +3308,13 @@ D(vc, {
   useFetchImplementation: () => mc,
   validateZapRequest: () => Sc
 });
-var gn;
+var pn;
 try {
-  gn = fetch;
+  pn = fetch;
 } catch {
 }
 function mc(e) {
-  gn = e;
+  pn = e;
 }
 async function Ec(e) {
   try {
@@ -3327,7 +3327,7 @@ async function Ec(e) {
       t = new URL(`/.well-known/lnurlp/${o}`, `https://${a}`).toString();
     } else
       return null;
-    let s = await (await gn(t)).json();
+    let s = await (await pn(t)).json();
     if (s.allowsNostr && s.nostrPubkey)
       return s.callback;
   } catch {
@@ -3364,9 +3364,9 @@ function Sc(e) {
   } catch {
     return "Invalid zap request JSON.";
   }
-  if (!xr(t))
+  if (!Er(t))
     return "Zap request is not a valid Nostr event.";
-  if (!wt(t))
+  if (!gt(t))
     return "Invalid signature on zap request.";
   let n = t.tags.find(([s, o]) => s === "p" && o);
   if (!n)
@@ -3393,20 +3393,20 @@ function Ac({
 var Kc = {};
 D(Kc, {
   getToken: () => Nc,
-  hashPayload: () => wn,
-  unpackEventFromToken: () => Qr,
-  validateEvent: () => si,
-  validateEventKind: () => ti,
-  validateEventMethodTag: () => ri,
-  validateEventPayloadTag: () => ii,
-  validateEventTimestamp: () => ei,
-  validateEventUrlTag: () => ni,
+  hashPayload: () => gn,
+  unpackEventFromToken: () => Xr,
+  validateEvent: () => ii,
+  validateEventKind: () => ei,
+  validateEventMethodTag: () => ni,
+  validateEventPayloadTag: () => ri,
+  validateEventTimestamp: () => Qr,
+  validateEventUrlTag: () => ti,
   validateToken: () => Bc
 });
-var Xr = "Nostr ";
+var Yr = "Nostr ";
 async function Nc(e, t, n, r = !1, i) {
   const s = {
-    kind: ln,
+    kind: cn,
     tags: [
       ["u", e],
       ["method", t]
@@ -3414,68 +3414,68 @@ async function Nc(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && s.tags.push(["payload", wn(i)]);
+  i && s.tags.push(["payload", gn(i)]);
   const o = await n(s);
-  return (r ? Xr : "") + ue.encode(te.encode(JSON.stringify(o)));
+  return (r ? Yr : "") + ue.encode(te.encode(JSON.stringify(o)));
 }
 async function Bc(e, t, n) {
-  const r = await Qr(e).catch((s) => {
+  const r = await Xr(e).catch((s) => {
     throw s;
   });
-  return await si(r, t, n).catch((s) => {
+  return await ii(r, t, n).catch((s) => {
     throw s;
   });
 }
-async function Qr(e) {
+async function Xr(e) {
   if (!e)
     throw new Error("Missing token");
-  e = e.replace(Xr, "");
+  e = e.replace(Yr, "");
   const t = ie.decode(ue.decode(e));
   if (!t || t.length === 0 || !t.startsWith("{"))
     throw new Error("Invalid token");
   return JSON.parse(t);
 }
-function ei(e) {
+function Qr(e) {
   return e.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - e.created_at < 60 : !1;
 }
-function ti(e) {
-  return e.kind === ln;
+function ei(e) {
+  return e.kind === cn;
 }
-function ni(e, t) {
+function ti(e, t) {
   const n = e.tags.find((r) => r[0] === "u");
   return n ? n.length > 0 && n[1] === t : !1;
 }
-function ri(e, t) {
+function ni(e, t) {
   const n = e.tags.find((r) => r[0] === "method");
   return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
 }
-function wn(e) {
+function gn(e) {
   const t = Se(te.encode(JSON.stringify(e)));
   return M(t);
 }
-function ii(e, t) {
+function ri(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
   if (!n)
     return !1;
-  const r = wn(t);
+  const r = gn(t);
   return n.length > 0 && n[1] === r;
 }
-async function si(e, t, n, r) {
-  if (!wt(e))
+async function ii(e, t, n, r) {
+  if (!gt(e))
     throw new Error("Invalid nostr event, signature invalid");
-  if (!ti(e))
-    throw new Error("Invalid nostr event, kind invalid");
   if (!ei(e))
+    throw new Error("Invalid nostr event, kind invalid");
+  if (!Qr(e))
     throw new Error("Invalid nostr event, created_at timestamp invalid");
-  if (!ni(e, t))
+  if (!ti(e, t))
     throw new Error("Invalid nostr event, url tag invalid");
-  if (!ri(e, n))
+  if (!ni(e, n))
     throw new Error("Invalid nostr event, method tag invalid");
-  if (r && typeof r == "object" && Object.keys(r).length > 0 && !ii(e, r))
+  if (r && typeof r == "object" && Object.keys(r).length > 0 && !ri(e, r))
     throw new Error("Invalid nostr event, payload tag does not match request body hash");
   return !0;
 }
-const He = 4, On = 30078, Rc = 100;
+const He = 4, Rn = 30078, Rc = 100;
 var Cc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Cc || {});
 function Oc(e) {
   return JSON.stringify({
@@ -3556,16 +3556,16 @@ async function* Mc(e) {
   }
 }
 function Re(e, t = new Uint8Array(32), n = 1) {
-  const r = sn(Se, e, t), i = [];
+  const r = rn(Se, e, t), i = [];
   for (let s = 1; s <= n; s++)
-    i.push(Er(Se, r, new Uint8Array([s]), 32));
+    i.push(mr(Se, r, new Uint8Array([s]), 32));
   return i;
 }
-function Tt(e, t) {
+function Lt(e, t) {
   return `${e}:${t}`;
 }
 const kc = 1e3;
-class ct {
+class at {
   // 1. CHANNEL PUBLIC INTERFACE
   constructor(t, n) {
     ee(this, "nostrUnsubscribe");
@@ -3601,7 +3601,7 @@ class ct {
       previousSendingChainMessageCount: 0,
       skippedMessageKeys: {},
       skippedHeaderKeys: {}
-    }, p = new ct(t, d);
+    }, p = new at(t, d);
     return o && (p.name = o), p;
   }
   /**
@@ -3683,7 +3683,7 @@ class ct {
     for (; this.state.receivingChainMessageNumber < t; ) {
       const [r, i] = Re(this.state.receivingChainKey, new Uint8Array([1]), 2);
       this.state.receivingChainKey = r;
-      const s = Tt(n, this.state.receivingChainMessageNumber);
+      const s = Lt(n, this.state.receivingChainMessageNumber);
       if (this.state.skippedMessageKeys[s] = i, !this.state.skippedHeaderKeys[n]) {
         const o = [];
         if (this.state.ourCurrentNostrKey) {
@@ -3698,7 +3698,7 @@ class ct {
   }
   trySkippedMessageKeys(t, n, r) {
     var s;
-    const i = Tt(r, t.number);
+    const i = Lt(r, t.number);
     if (i in this.state.skippedMessageKeys) {
       const o = this.state.skippedMessageKeys[i];
       return delete this.state.skippedMessageKeys[i], Object.keys(this.state.skippedMessageKeys).some((c) => c.startsWith(`${r}:`)) || (delete this.state.skippedHeaderKeys[r], (s = this.nostrUnsubscribe) == null || s.call(this), this.nostrUnsubscribe = void 0), j.decrypt(n, o);
@@ -3737,7 +3737,7 @@ class ct {
         { authors: [this.state.theirNostrPublicKey], kinds: [He] },
         (a) => this.handleNostrEvent(a)
       )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey));
-    else if (!(Tt(t.pubkey, n.number) in this.state.skippedMessageKeys))
+    else if (!(Lt(t.pubkey, n.number) in this.state.skippedMessageKeys))
       return;
     const s = this.ratchetDecrypt(n, t.content, t.pubkey);
     this.internalSubscriptions.forEach((a) => a({ id: t.id, data: s, pubkey: n.nextPublicKey, time: n.time }));
@@ -3757,9 +3757,9 @@ class ct {
 }
 new TextDecoder("utf-8");
 new TextEncoder();
-function tt(e, t) {
+function et(e, t) {
   const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return sn(Se, n, "nip44-v2");
+  return rn(Se, n, "nip44-v2");
 }
 class Oe {
   constructor(t, n, r, i, s, o, a = []) {
@@ -3784,21 +3784,16 @@ class Oe {
     let s;
     try {
       s = JSON.parse(i);
-    } catch (u) {
-      throw new Error("Invite data in URL hash is not valid JSON: " + u);
+    } catch (l) {
+      throw new Error("Invite data in URL hash is not valid JSON: " + l);
     }
     const { inviter: o, sessionKey: a, linkSecret: c } = s;
     if (!o || !a || !c)
       throw new Error("Missing required fields (inviter, sessionKey, linkSecret) in invite data.");
-    const l = We.decode(o), f = We.decode(a);
-    if (typeof l.data != "string")
-      throw new Error("Decoded inviter is not a string");
-    if (typeof f.data != "string")
-      throw new Error("Decoded session key is not a string");
     return new Oe(
-      f.data,
+      a,
       c,
-      l.data
+      o
     );
   }
   static deserialize(t) {
@@ -3817,7 +3812,7 @@ class Oe {
     var o, a;
     if (!t.sig)
       throw new Error("Event is not signed");
-    if (!wt(t))
+    if (!gt(t))
       throw new Error("Event signature is invalid");
     const { tags: n } = t, r = (o = n.find(([c]) => c === "sessionKey")) == null ? void 0 : o[1], i = (a = n.find(([c]) => c === "linkSecret")) == null ? void 0 : a[1], s = t.pubkey;
     if (!r || !i)
@@ -3830,7 +3825,7 @@ class Oe {
   }
   static fromUser(t, n) {
     const r = {
-      kinds: [On],
+      kinds: [Rn],
       authors: [t],
       limit: 1,
       "#d": ["nostr-double-ratchet/invite"]
@@ -3868,15 +3863,15 @@ class Oe {
    */
   getUrl(t = "https://iris.to") {
     const n = {
-      inviter: We.npubEncode(this.inviter),
-      sessionKey: We.npubEncode(this.inviterSessionPublicKey),
+      inviter: this.inviter,
+      sessionKey: this.inviterSessionPublicKey,
       linkSecret: this.linkSecret
     }, r = new URL(t);
     return r.hash = encodeURIComponent(JSON.stringify(n)), console.log("url", r.toString()), r.toString();
   }
   getEvent() {
     return {
-      kind: On,
+      kind: Rn,
       pubkey: this.inviter,
       content: "",
       created_at: Math.floor(Date.now() / 1e3),
@@ -3899,7 +3894,7 @@ class Oe {
        * so the inviter can create the channel on their side.
        */
   async accept(t, n, r) {
-    const i = Me(), s = Ce(i), o = this.inviter || this.inviterSessionPublicKey, a = W(this.linkSecret), c = ct.init(t, this.inviterSessionPublicKey, i, !0, a, void 0), l = Me(), f = Ce(l), u = typeof r == "function" ? r : (g, h) => Promise.resolve(j.encrypt(g, tt(r, h))), d = {
+    const i = Me(), s = Ce(i), o = this.inviter || this.inviterSessionPublicKey, a = W(this.linkSecret), c = at.init(t, this.inviterSessionPublicKey, i, !0, a, void 0), l = Me(), f = Ce(l), u = typeof r == "function" ? r : (g, h) => Promise.resolve(j.encrypt(g, et(r, h))), d = {
       pubkey: n,
       tags: [["secret", this.linkSecret]],
       content: await u(s, o),
@@ -3907,7 +3902,7 @@ class Oe {
     }, p = {
       kind: He,
       pubkey: f,
-      content: j.encrypt(JSON.stringify(d), tt(l, this.inviterSessionPublicKey)),
+      content: j.encrypt(JSON.stringify(d), et(l, this.inviterSessionPublicKey)),
       created_at: Math.floor(Date.now() / 1e3),
       tags: [["p", this.inviterSessionPublicKey]]
     };
@@ -3926,14 +3921,14 @@ class Oe {
           console.error("Invite has reached maximum number of uses");
           return;
         }
-        const o = await j.decrypt(s.content, tt(this.inviterSessionPrivateKey, s.pubkey)), a = JSON.parse(o);
+        const o = await j.decrypt(s.content, et(this.inviterSessionPrivateKey, s.pubkey)), a = JSON.parse(o);
         if (!a.tags || !a.tags.some(([g, h]) => g === "secret" && h === this.linkSecret)) {
           console.error("Invalid secret from event", s);
           return;
         }
-        const c = typeof t == "function" ? t : (g, h) => Promise.resolve(j.decrypt(g, tt(t, h))), l = a.pubkey;
+        const c = typeof t == "function" ? t : (g, h) => Promise.resolve(j.decrypt(g, et(t, h))), l = a.pubkey;
         this.usedBy.push(l);
-        const f = await c(a.content, l), u = W(this.linkSecret), d = s.id, p = ct.init(n, f, this.inviterSessionPrivateKey, !1, u, d);
+        const f = await c(a.content, l), u = W(this.linkSecret), d = s.id, p = at.init(n, f, this.inviterSessionPrivateKey, !1, u, d);
         r(p, l);
       } catch (o) {
         console.error("Error processing invite message:", o);
@@ -3942,8 +3937,8 @@ class Oe {
   }
 }
 export {
-  ct as Channel,
-  On as INVITE_EVENT_KIND,
+  at as Channel,
+  Rn as INVITE_EVENT_KIND,
   Oe as Invite,
   Rc as MAX_SKIP,
   He as MESSAGE_EVENT_KIND,
@@ -3952,5 +3947,5 @@ export {
   Pc as deserializeChannelState,
   Re as kdf,
   Oc as serializeChannelState,
-  Tt as skippedMessageIndexKey
+  Lt as skippedMessageIndexKey
 };