nostr-double-ratchet 0.0.8 → 0.0.9

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

@@ -1,7 +1,7 @@
-var si = Object.defineProperty;
-var ai = (e, t, n) => t in e ? si(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+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 mn(e) {
+function En(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -14,7 +14,7 @@ function Pn(e, ...t) {
 function ci(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  mn(e.outputLen), mn(e.blockLen);
+  En(e.outputLen), En(e.blockLen);
 }
 function rt(e, t = !0) {
   if (e.destroyed)
@@ -70,8 +70,8 @@ function qn(e = 32) {
 function yi(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
-  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), a = Number(n & o), c = r ? 4 : 0, l = r ? 0 : 4;
-  e.setUint32(t + c, s, r), e.setUint32(t + l, a, 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 {
   constructor(t, n, r, i) {
@@ -81,27 +81,27 @@ let pi = class extends Hn {
     rt(this);
     const { view: n, buffer: r, blockLen: i } = this;
     t = Ft(t);
-    const o = t.length;
-    for (let s = 0; s < o; ) {
-      const a = Math.min(i - this.pos, o - s);
+    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);
-        for (; i <= o - s; s += i)
-          this.process(c, s);
+        for (; i <= s - o; o += i)
+          this.process(c, o);
         continue;
       }
-      r.set(t.subarray(s, s + a), this.pos), this.pos += a, s += a, this.pos === i && (this.process(n, 0), this.pos = 0);
+      r.set(t.subarray(o, o + a), this.pos), this.pos += a, o += a, this.pos === i && (this.process(n, 0), this.pos = 0);
     }
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
     rt(this), li(t, this), this.finished = !0;
-    const { buffer: n, view: r, blockLen: i, isLE: o } = this;
-    let { pos: s } = this;
-    n[s++] = 128, this.buffer.subarray(s).fill(0), this.padOffset > i - s && (this.process(r, 0), s = 0);
-    for (let u = s; u < i; u++)
+    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), o), this.process(r, 0);
+    yi(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");
@@ -109,7 +109,7 @@ let pi = class extends Hn {
     if (l > f.length)
       throw new Error("_sha2: outputLen bigger than state");
     for (let u = 0; u < l; u++)
-      a.setUint32(4 * u, f[u], o);
+      a.setUint32(4 * u, f[u], s);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -119,8 +119,8 @@ let pi = class extends Hn {
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: r, length: i, finished: o, destroyed: s, pos: a } = this;
-    return t.length = i, t.pos = a, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
+    const { blockLen: n, buffer: r, length: i, finished: s, destroyed: o, pos: a } = this;
+    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([
@@ -203,12 +203,12 @@ let vi = class extends pi {
     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;
   }
   get() {
-    const { A: t, B: n, C: r, D: i, E: o, F: s, G: a, H: c } = this;
-    return [t, n, r, i, o, s, a, c];
+    const { A: t, B: n, C: r, D: i, E: s, F: o, G: a, H: c } = this;
+    return [t, n, r, i, s, o, a, c];
   }
   // prettier-ignore
-  set(t, n, r, i, o, s, a, c) {
-    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = o | 0, this.F = s | 0, this.G = a | 0, this.H = c | 0;
+  set(t, n, r, i, s, o, a, c) {
+    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = s | 0, this.F = o | 0, this.G = a | 0, this.H = c | 0;
   }
   process(t, n) {
     for (let u = 0; u < 16; u++, n += 4)
@@ -217,12 +217,12 @@ let vi = class extends pi {
       const d = we[u - 15], p = we[u - 2], g = ne(d, 7) ^ ne(d, 18) ^ d >>> 3, h = ne(p, 17) ^ ne(p, 19) ^ p >>> 10;
       we[u] = h + we[u - 7] + g + we[u - 16] | 0;
     }
-    let { A: r, B: i, C: o, D: s, E: a, F: c, G: l, H: f } = this;
+    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, o) | 0;
-      f = l, l = c, c = a, a = s + p | 0, s = o, o = i, i = r, r = p + h | 0;
+      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;
+      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, o = o + this.C | 0, s = s + 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, o, s, a, c, l, f);
+    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);
   }
   roundClean() {
     we.fill(0);
@@ -233,13 +233,13 @@ let vi = class extends pi {
 };
 const $t = /* @__PURE__ */ di(() => new vi());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Dn = BigInt(0), lt = BigInt(1), Ei = BigInt(2), ut = (e) => e instanceof Uint8Array, mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+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"));
 function qe(e) {
   if (!ut(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += mi[e[n]];
+    t += Ei[e[n]];
   return t;
 }
 function jn(e) {
@@ -259,10 +259,10 @@ function De(e) {
     throw new Error("padded hex string expected, got unpadded hex of length " + t);
   const n = new Uint8Array(t / 2);
   for (let r = 0; r < n.length; r++) {
-    const i = r * 2, o = e.slice(i, i + 2), s = Number.parseInt(o, 16);
-    if (Number.isNaN(s) || s < 0)
+    const i = r * 2, s = e.slice(i, i + 2), o = Number.parseInt(s, 16);
+    if (Number.isNaN(o) || o < 0)
       throw new Error("Invalid byte sequence");
-    n[r] = s;
+    n[r] = o;
   }
   return n;
 }
@@ -288,8 +288,8 @@ function Z(e, t, n) {
   if (typeof t == "string")
     try {
       r = De(t);
-    } catch (o) {
-      throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${o}`);
+    } catch (s) {
+      throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${s}`);
     }
   else if (ut(t))
     r = Uint8Array.from(t);
@@ -300,7 +300,7 @@ function Z(e, t, n) {
     throw new Error(`${e} expected ${n} bytes, got ${i}`);
   return r;
 }
-function Be(...e) {
+function ke(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -331,7 +331,7 @@ function Ki(e) {
 function Ni(e, t) {
   return e >> BigInt(t) & lt;
 }
-const Ci = (e, t, n) => e | (n ? lt : Dn) << BigInt(t), Yt = (e) => (Ei << BigInt(e - 1)) - lt, Nt = (e) => new Uint8Array(e), xn = (e) => Uint8Array.from(e);
+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) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -339,13 +339,13 @@ function Vn(e, t, n) {
     throw new Error("qByteLen must be a number");
   if (typeof n != "function")
     throw new Error("hmacFn must be a function");
-  let r = Nt(e), i = Nt(e), o = 0;
-  const s = () => {
-    r.fill(1), i.fill(0), o = 0;
+  let r = Nt(e), i = Nt(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());
   }, l = () => {
-    if (o++ >= 1e3)
+    if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
     const d = [];
@@ -354,17 +354,17 @@ function Vn(e, t, n) {
       const p = r.slice();
       d.push(p), u += r.length;
     }
-    return Be(...d);
+    return ke(...d);
   };
   return (u, d) => {
-    s(), c(u);
+    o(), c(u);
     let p;
     for (; !(p = d(l())); )
       c();
-    return s(), p;
+    return o(), p;
   };
 }
-const ki = {
+const Ci = {
   bigint: (e) => typeof e == "bigint",
   function: (e) => typeof e == "function",
   boolean: (e) => typeof e == "boolean",
@@ -376,30 +376,30 @@ const ki = {
   hash: (e) => typeof e == "function" && Number.isSafeInteger(e.outputLen)
 };
 function Ye(e, t, n = {}) {
-  const r = (i, o, s) => {
-    const a = ki[o];
+  const r = (i, s, o) => {
+    const a = Ci[s];
     if (typeof a != "function")
-      throw new Error(`Invalid validator "${o}", expected function`);
+      throw new Error(`Invalid validator "${s}", expected function`);
     const c = e[i];
-    if (!(s && c === void 0) && !a(c, e))
-      throw new Error(`Invalid param ${String(i)}=${c} (${typeof c}), expected ${o}`);
+    if (!(o && c === void 0) && !a(c, e))
+      throw new Error(`Invalid param ${String(i)}=${c} (${typeof c}), expected ${s}`);
   };
-  for (const [i, o] of Object.entries(t))
-    r(i, o, !1);
-  for (const [i, o] of Object.entries(n))
-    r(i, o, !0);
+  for (const [i, s] of Object.entries(t))
+    r(i, s, !1);
+  for (const [i, s] of Object.entries(n))
+    r(i, s, !0);
   return e;
 }
-const Bi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const ki = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   bitGet: Ni,
   bitLen: Ki,
   bitMask: Yt,
-  bitSet: Ci,
+  bitSet: Bi,
   bytesToHex: qe,
   bytesToNumberBE: G,
   bytesToNumberLE: Gt,
-  concatBytes: Be,
+  concatBytes: ke,
   createHmacDrbg: Vn,
   ensureBytes: Z,
   equalBytes: Si,
@@ -439,10 +439,10 @@ function J(e, t, n) {
 function Ot(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, o = q;
+  let n = z(e, t), r = t, i = V, s = q;
   for (; n !== V; ) {
-    const a = r / n, c = r % n, l = i - o * a;
-    r = n, n = c, i = o, o = l;
+    const a = r / n, c = r % n, l = i - s * a;
+    r = n, n = c, i = s, s = l;
   }
   if (r !== q)
     throw new Error("invert: does not exist");
@@ -456,19 +456,19 @@ function _i(e) {
   for (i = Ne; i < e && Ii(i, t, e) !== e - q; i++)
     ;
   if (r === 1) {
-    const s = (e + q) / Rt;
+    const o = (e + q) / Rt;
     return function(c, l) {
-      const f = c.pow(l, s);
+      const f = c.pow(l, o);
       if (!c.eql(c.sqr(f), l))
         throw new Error("Cannot find square root");
       return f;
     };
   }
-  const o = (n + q) / Ne;
+  const s = (n + q) / Ne;
   return function(a, c) {
     if (a.pow(c, t) === a.neg(a.ONE))
       throw new Error("Cannot find square root");
-    let l = r, f = a.pow(a.mul(a.ONE, i), n), u = a.pow(c, o), d = a.pow(c, n);
+    let l = r, f = a.pow(a.mul(a.ONE, i), n), u = a.pow(c, s), d = a.pow(c, n);
     for (; !a.eql(d, a.ONE); ) {
       if (a.eql(d, a.ZERO))
         return a.ZERO;
@@ -485,16 +485,16 @@ function Li(e) {
   if (e % Rt === Ui) {
     const t = (e + q) / Rt;
     return function(r, i) {
-      const o = r.pow(i, t);
-      if (!r.eql(r.sqr(o), i))
+      const s = r.pow(i, t);
+      if (!r.eql(r.sqr(s), i))
         throw new Error("Cannot find square root");
-      return o;
+      return s;
     };
   }
   if (e % An === Sn) {
     const t = (e - Sn) / An;
     return function(r, i) {
-      const o = r.mul(i, Ne), s = r.pow(o, t), a = r.mul(i, s), c = r.mul(r.mul(a, Ne), s), l = r.mul(a, r.sub(c, r.ONE));
+      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))
         throw new Error("Cannot find square root");
       return l;
@@ -543,8 +543,8 @@ function Ri(e, t, n) {
   return r;
 }
 function Oi(e, t) {
-  const n = new Array(t.length), r = t.reduce((o, s, a) => e.is0(s) ? o : (n[a] = o, e.mul(o, s)), e.ONE), i = e.inv(r);
-  return t.reduceRight((o, s, a) => e.is0(s) ? o : (n[a] = e.mul(o, n[a]), e.mul(o, s)), i), n;
+  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) {
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
@@ -553,13 +553,13 @@ function zn(e, t) {
 function Pi(e, t, n = !1, r = {}) {
   if (e <= V)
     throw new Error(`Expected Field ORDER > 0, got ${e}`);
-  const { nBitLength: i, nByteLength: o } = zn(e, t);
-  if (o > 2048)
+  const { nBitLength: i, nByteLength: s } = zn(e, t);
+  if (s > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const s = Li(e), a = Object.freeze({
+  const o = Li(e), a = Object.freeze({
     ORDER: e,
     BITS: i,
-    BYTES: o,
+    BYTES: s,
     MASK: Yt(i),
     ZERO: V,
     ONE: q,
@@ -585,15 +585,15 @@ function Pi(e, t, n = !1, r = {}) {
     subN: (c, l) => c - l,
     mulN: (c, l) => c * l,
     inv: (c) => Ot(c, e),
-    sqrt: r.sqrt || ((c) => s(a, c)),
+    sqrt: r.sqrt || ((c) => o(a, c)),
     invertBatch: (c) => Oi(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, o) : xe(c, o),
+    toBytes: (c) => n ? Jt(c, s) : xe(c, s),
     fromBytes: (c) => {
-      if (c.length !== o)
-        throw new Error(`Fp.fromBytes: expected ${o}, got ${c.length}`);
+      if (c.length !== s)
+        throw new Error(`Fp.fromBytes: expected ${s}, got ${c.length}`);
       return n ? Gt(c) : G(c);
     }
   });
@@ -610,30 +610,30 @@ function Fn(e) {
   return t + Math.ceil(t / 2);
 }
 function Mi(e, t, n = !1) {
-  const r = e.length, i = Zn(t), o = Fn(t);
-  if (r < 16 || r < o || r > 1024)
-    throw new Error(`expected ${o}-1024 bytes of input, got ${r}`);
-  const s = n ? G(e) : Gt(e), a = z(s, t - q) + q;
+  const r = e.length, i = Zn(t), s = Fn(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);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Hi = BigInt(0), Ct = BigInt(1);
+const Hi = BigInt(0), Bt = BigInt(1);
 function qi(e, t) {
-  const n = (i, o) => {
-    const s = o.negate();
-    return i ? s : o;
+  const n = (i, s) => {
+    const o = s.negate();
+    return i ? o : s;
   }, r = (i) => {
-    const o = Math.ceil(t / i) + 1, s = 2 ** (i - 1);
-    return { windows: o, windowSize: s };
+    const s = Math.ceil(t / i) + 1, o = 2 ** (i - 1);
+    return { windows: s, windowSize: o };
   };
   return {
     constTimeNegate: n,
     // non-const time multiplication ladder
-    unsafeLadder(i, o) {
-      let s = e.ZERO, a = i;
-      for (; o > Hi; )
-        o & Ct && (s = s.add(a)), a = a.double(), o >>= Ct;
-      return s;
+    unsafeLadder(i, s) {
+      let o = e.ZERO, a = i;
+      for (; s > Hi; )
+        s & Bt && (o = o.add(a)), a = a.double(), s >>= Bt;
+      return o;
     },
     /**
      * Creates a wNAF precomputation window. Used for caching.
@@ -645,10 +645,10 @@ function qi(e, t) {
      * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
      * @returns precomputed point tables flattened to a single array
      */
-    precomputeWindow(i, o) {
-      const { windows: s, windowSize: a } = r(o), c = [];
+    precomputeWindow(i, s) {
+      const { windows: o, windowSize: a } = r(s), c = [];
       let l = i, f = l;
-      for (let u = 0; u < s; u++) {
+      for (let u = 0; u < o; u++) {
         f = l, c.push(f);
         for (let d = 1; d < a; d++)
           f = f.add(l), c.push(f);
@@ -663,23 +663,23 @@ function qi(e, t) {
      * @param n scalar (we don't check here, but should be less than curve order)
      * @returns real and fake (for const-time) points
      */
-    wNAF(i, o, s) {
+    wNAF(i, s, o) {
       const { windows: a, windowSize: c } = r(i);
       let l = e.ZERO, f = e.BASE;
       const u = BigInt(2 ** i - 1), d = 2 ** i, p = BigInt(i);
       for (let g = 0; g < a; g++) {
         const h = g * c;
-        let y = Number(s & u);
-        s >>= p, y > c && (y -= d, s += Ct);
-        const w = h, m = h + Math.abs(y) - 1, K = g % 2 !== 0, I = y < 0;
-        y === 0 ? f = f.add(n(K, o[w])) : l = l.add(n(I, o[m]));
+        let y = Number(o & u);
+        o >>= p, y > c && (y -= d, o += Bt);
+        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]));
       }
       return { p: l, f };
     },
-    wNAFCached(i, o, s, a) {
+    wNAFCached(i, s, o, a) {
       const c = i._WINDOW_SIZE || 1;
-      let l = o.get(i);
-      return l || (l = this.precomputeWindow(i, c), c !== 1 && o.set(i, a(l))), this.wNAF(c, l, s);
+      let l = s.get(i);
+      return l || (l = this.precomputeWindow(i, c), c !== 1 && s.set(i, a(l))), this.wNAF(c, l, o);
     }
   };
 }
@@ -722,7 +722,7 @@ function Di(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: ji, hexToBytes: Vi } = Bi, Ce = {
+const { bytesToNumberBE: ji, hexToBytes: Vi } = ki, Be = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -730,7 +730,7 @@ const { bytesToNumberBE: ji, hexToBytes: Vi } = Bi, Ce = {
     }
   },
   _parseInt(e) {
-    const { Err: t } = Ce;
+    const { Err: t } = Be;
     if (e.length < 2 || e[0] !== 2)
       throw new t("Invalid signature integer tag");
     const n = e[1], r = e.subarray(2, n + 2);
@@ -743,7 +743,7 @@ const { bytesToNumberBE: ji, hexToBytes: Vi } = Bi, Ce = {
     return { d: ji(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = Ce, n = typeof e == "string" ? Vi(e) : e;
+    const { Err: t } = Be, n = typeof e == "string" ? Vi(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -751,17 +751,17 @@ const { bytesToNumberBE: ji, hexToBytes: Vi } = Bi, Ce = {
       throw new t("Invalid signature tag");
     if (n[1] !== r - 2)
       throw new t("Invalid signature: incorrect length");
-    const { d: i, l: o } = Ce._parseInt(n.subarray(2)), { d: s, l: a } = Ce._parseInt(o);
+    const { d: i, l: s } = Be._parseInt(n.subarray(2)), { d: o, l: a } = Be._parseInt(s);
     if (a.length)
       throw new t("Invalid signature: left bytes after parsing");
-    return { r: i, s };
+    return { r: i, s: o };
   },
   hexFromSig(e) {
     const t = (l) => Number.parseInt(l[0], 16) & 8 ? "00" + l : l, n = (l) => {
       const f = l.toString(16);
       return f.length & 1 ? `0${f}` : f;
-    }, r = t(n(e.s)), i = t(n(e.r)), o = r.length / 2, s = i.length / 2, a = n(o), c = n(s);
-    return `30${n(s + o + 4)}02${c}${i}02${a}${r}`;
+    }, r = t(n(e.s)), i = t(n(e.r)), s = r.length / 2, o = i.length / 2, a = n(s), c = n(o);
+    return `30${n(o + s + 4)}02${c}${i}02${a}${r}`;
   }
 }, ce = BigInt(0), Y = BigInt(1);
 BigInt(2);
@@ -770,26 +770,26 @@ BigInt(4);
 function zi(e) {
   const t = Di(e), { Fp: n } = t, r = t.toBytes || ((g, h, y) => {
     const w = h.toAffine();
-    return Be(Uint8Array.from([4]), n.toBytes(w.x), n.toBytes(w.y));
+    return ke(Uint8Array.from([4]), n.toBytes(w.x), n.toBytes(w.y));
   }), i = t.fromBytes || ((g) => {
     const h = g.subarray(1), y = n.fromBytes(h.subarray(0, n.BYTES)), w = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
     return { x: y, y: w };
   });
-  function o(g) {
-    const { a: h, b: y } = t, w = n.sqr(g), m = n.mul(w, g);
-    return n.add(n.add(m, n.mul(g, h)), y);
+  function s(g) {
+    const { a: h, b: y } = t, w = n.sqr(g), E = n.mul(w, g);
+    return n.add(n.add(E, n.mul(g, h)), y);
   }
-  if (!n.eql(n.sqr(t.Gy), o(t.Gx)))
+  if (!n.eql(n.sqr(t.Gy), s(t.Gx)))
     throw new Error("bad generator point: equation left != right");
-  function s(g) {
+  function o(g) {
     return typeof g == "bigint" && ce < g && g < t.n;
   }
   function a(g) {
-    if (!s(g))
+    if (!o(g))
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
   function c(g) {
-    const { allowedPrivateKeyLengths: h, nByteLength: y, wrapPrivateKey: w, n: m } = t;
+    const { allowedPrivateKeyLengths: h, nByteLength: y, wrapPrivateKey: w, n: E } = t;
     if (h && typeof g != "bigint") {
       if (g instanceof Uint8Array && (g = qe(g)), typeof g != "string" || !h.includes(g.length))
         throw new Error("Invalid key");
@@ -801,7 +801,7 @@ function zi(e) {
     } catch {
       throw new Error(`private key must be ${y} bytes, hex or bigint, not ${typeof g}`);
     }
-    return w && (K = z(K, m)), a(K), K;
+    return w && (K = z(K, E)), a(K), K;
   }
   const l = /* @__PURE__ */ new Map();
   function f(g) {
@@ -825,8 +825,8 @@ function zi(e) {
         throw new Error("invalid affine point");
       if (h instanceof u)
         throw new Error("projective point not allowed");
-      const m = (K) => n.eql(K, n.ZERO);
-      return m(y) && m(w) ? u.ZERO : new u(y, w, n.ONE);
+      const E = (K) => n.eql(K, n.ZERO);
+      return E(y) && E(w) ? u.ZERO : new u(y, w, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -842,7 +842,7 @@ function zi(e) {
      */
     static normalizeZ(h) {
       const y = n.invertBatch(h.map((w) => w.pz));
-      return h.map((w, m) => w.toAffine(y[m])).map(u.fromAffine);
+      return h.map((w, E) => w.toAffine(y[E])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
@@ -870,8 +870,8 @@ function zi(e) {
       const { x: h, y } = this.toAffine();
       if (!n.isValid(h) || !n.isValid(y))
         throw new Error("bad point: x or y not FE");
-      const w = n.sqr(y), m = o(h);
-      if (!n.eql(w, m))
+      const w = n.sqr(y), E = s(h);
+      if (!n.eql(w, E))
         throw new Error("bad point: equation left != right");
       if (!this.isTorsionFree())
         throw new Error("bad point: not in prime-order subgroup");
@@ -887,8 +887,8 @@ function zi(e) {
      */
     equals(h) {
       f(h);
-      const { px: y, py: w, pz: m } = this, { px: K, py: I, pz: k } = h, E = n.eql(n.mul(y, k), n.mul(K, m)), x = n.eql(n.mul(w, k), n.mul(I, m));
-      return E && x;
+      const { px: y, py: w, pz: E } = this, { px: K, py: I, pz: C } = h, m = n.eql(n.mul(y, C), n.mul(K, E)), x = n.eql(n.mul(w, C), n.mul(I, E));
+      return m && x;
     }
     /**
      * Flips point to one corresponding to (x, -y) in Affine coordinates.
@@ -901,9 +901,9 @@ 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: m, py: K, pz: I } = this;
-      let k = n.ZERO, E = n.ZERO, x = n.ZERO, S = n.mul(m, m), P = n.mul(K, K), U = n.mul(I, I), N = n.mul(m, K);
-      return N = n.add(N, N), x = n.mul(m, I), x = n.add(x, x), k = n.mul(h, x), E = n.mul(w, U), E = n.add(k, E), k = n.sub(P, E), E = n.add(P, E), E = n.mul(k, E), k = n.mul(N, k), 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), E = n.add(E, S), U = n.mul(K, I), U = n.add(U, U), S = n.mul(U, N), k = n.sub(k, S), x = n.mul(U, P), x = n.add(x, x), x = n.add(x, x), new u(k, E, x);
+      const { a: h, b: y } = t, w = n.mul(y, Kn), { 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);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function zi(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: y, py: w, pz: m } = this, { px: K, py: I, pz: k } = h;
-      let E = n.ZERO, x = n.ZERO, S = n.ZERO;
+      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);
-      let N = n.mul(y, K), $ = n.mul(w, I), R = n.mul(m, k), 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, m);
-      let v = n.add(K, k);
-      return b = n.mul(b, v), v = n.add(N, R), b = n.sub(b, v), v = n.add(w, m), E = n.add(I, k), v = n.mul(v, E), E = n.add($, R), v = n.sub(v, E), S = n.mul(P, b), E = n.mul(U, R), S = n.add(E, S), E = n.sub($, S), S = n.add($, S), x = n.mul(E, S), $ = n.add(N, N), $ = n.add($, N), R = n.mul(P, R), b = n.mul(U, b), $ = n.add($, R), R = n.sub(N, R), R = n.mul(P, R), b = n.add(b, R), N = n.mul($, b), x = n.add(x, N), N = n.mul(v, b), E = n.mul(H, E), E = n.sub(E, N), N = n.mul(H, $), S = n.mul(v, S), S = n.add(S, N), new u(E, x, S);
+      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);
+      return b = n.mul(b, v), v = n.add(N, R), b = n.sub(b, v), v = n.add(w, E), m = n.add(I, C), v = n.mul(v, m), m = n.add($, R), v = n.sub(v, m), S = n.mul(P, b), m = n.mul(U, R), S = n.add(m, S), m = n.sub($, S), S = n.add($, S), x = n.mul(m, S), $ = n.add(N, N), $ = n.add($, N), R = n.mul(P, R), b = n.mul(U, b), $ = n.add($, R), R = n.sub(N, R), R = n.mul(P, R), b = n.add(b, R), N = n.mul($, b), x = n.add(x, N), N = n.mul(v, b), m = n.mul(H, m), m = n.sub(m, N), N = n.mul(H, $), S = n.mul(v, S), S = n.add(S, N), new u(m, x, S);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -927,8 +927,8 @@ function zi(e) {
     }
     wNAF(h) {
       return p.wNAFCached(this, l, h, (y) => {
-        const w = n.invertBatch(y.map((m) => m.pz));
-        return y.map((m, K) => m.toAffine(w[K])).map(u.fromAffine);
+        const w = n.invertBatch(y.map((E) => E.pz));
+        return y.map((E, K) => E.toAffine(w[K])).map(u.fromAffine);
       });
     }
     /**
@@ -945,10 +945,10 @@ function zi(e) {
       const { endo: w } = t;
       if (!w)
         return p.unsafeLadder(this, h);
-      let { k1neg: m, k1: K, k2neg: I, k2: k } = w.splitScalar(h), E = y, x = y, S = this;
-      for (; K > ce || k > ce; )
-        K & Y && (E = E.add(S)), k & Y && (x = x.add(S)), S = S.double(), K >>= Y, k >>= Y;
-      return m && (E = E.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, w.beta), x.py, x.pz), E.add(x);
+      let { k1neg: E, k1: K, k2neg: I, k2: C } = w.splitScalar(h), m = y, x = y, S = this;
+      for (; K > ce || C > ce; )
+        K & Y && (m = m.add(S)), C & Y && (x = x.add(S)), S = S.double(), K >>= Y, C >>= Y;
+      return E && (m = m.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, w.beta), x.py, x.pz), m.add(x);
     }
     /**
      * Constant time multiplication.
@@ -961,17 +961,17 @@ function zi(e) {
      */
     multiply(h) {
       a(h);
-      let y = h, w, m;
+      let y = h, w, E;
       const { endo: K } = t;
       if (K) {
-        const { k1neg: I, k1: k, k2neg: E, k2: x } = K.splitScalar(y);
-        let { p: S, f: P } = this.wNAF(k), { p: U, f: N } = this.wNAF(x);
-        S = p.constTimeNegate(I, S), U = p.constTimeNegate(E, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), w = S.add(U), m = P.add(N);
+        const { k1neg: I, k1: C, k2neg: m, k2: x } = K.splitScalar(y);
+        let { p: S, f: P } = this.wNAF(C), { p: U, f: N } = this.wNAF(x);
+        S = p.constTimeNegate(I, S), U = p.constTimeNegate(m, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), w = S.add(U), E = P.add(N);
       } else {
-        const { p: I, f: k } = this.wNAF(y);
-        w = I, m = k;
+        const { p: I, f: C } = this.wNAF(y);
+        w = I, E = C;
       }
-      return u.normalizeZ([w, m])[0];
+      return u.normalizeZ([w, E])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -980,21 +980,21 @@ function zi(e) {
      * @returns non-zero affine point
      */
     multiplyAndAddUnsafe(h, y, w) {
-      const m = u.BASE, K = (k, E) => E === ce || E === Y || !k.equals(m) ? k.multiplyUnsafe(E) : k.multiply(E), I = K(this, y).add(K(h, w));
+      const E = u.BASE, K = (C, m) => m === ce || m === Y || !C.equals(E) ? C.multiplyUnsafe(m) : C.multiply(m), I = K(this, y).add(K(h, w));
       return I.is0() ? void 0 : I;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
     // (x, y, z) ∋ (x=x/z, y=y/z)
     toAffine(h) {
-      const { px: y, py: w, pz: m } = this, K = this.is0();
-      h == null && (h = K ? n.ONE : n.inv(m));
-      const I = n.mul(y, h), k = n.mul(w, h), E = n.mul(m, h);
+      const { px: y, py: w, pz: E } = this, K = this.is0();
+      h == null && (h = K ? n.ONE : n.inv(E));
+      const I = n.mul(y, h), C = n.mul(w, h), m = n.mul(E, h);
       if (K)
         return { x: n.ZERO, y: n.ZERO };
-      if (!n.eql(E, n.ONE))
+      if (!n.eql(m, n.ONE))
         throw new Error("invZ was invalid");
-      return { x: I, y: k };
+      return { x: I, y: C };
     }
     isTorsionFree() {
       const { h, isTorsionFree: y } = t;
@@ -1021,8 +1021,8 @@ function zi(e) {
     CURVE: t,
     ProjectivePoint: u,
     normPrivateKeyToScalar: c,
-    weierstrassEquation: o,
-    isWithinCurveOrder: s
+    weierstrassEquation: s,
+    isWithinCurveOrder: o
   };
 }
 function Zi(e) {
@@ -1038,8 +1038,8 @@ function Zi(e) {
   }), Object.freeze({ lowS: !0, ...t });
 }
 function Fi(e) {
-  const t = Zi(e), { Fp: n, n: r } = t, i = n.BYTES + 1, o = 2 * n.BYTES + 1;
-  function s(b) {
+  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;
   }
   function a(b) {
@@ -1051,24 +1051,24 @@ function Fi(e) {
   const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: d } = zi({
     ...t,
     toBytes(b, v, A) {
-      const B = v.toAffine(), C = n.toBytes(B.x), _ = Be;
-      return A ? _(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : _(Uint8Array.from([4]), C, n.toBytes(B.y));
+      const k = v.toAffine(), B = n.toBytes(k.x), _ = ke;
+      return A ? _(Uint8Array.from([v.hasEvenY() ? 2 : 3]), B) : _(Uint8Array.from([4]), B, n.toBytes(k.y));
     },
     fromBytes(b) {
-      const v = b.length, A = b[0], B = b.subarray(1);
+      const v = b.length, A = b[0], k = b.subarray(1);
       if (v === i && (A === 2 || A === 3)) {
-        const C = G(B);
-        if (!s(C))
+        const B = G(k);
+        if (!o(B))
           throw new Error("Point is not on curve");
-        const _ = u(C);
+        const _ = u(B);
         let O = n.sqrt(_);
         const T = (O & Y) === Y;
-        return (A & 1) === 1 !== T && (O = n.neg(O)), { x: C, y: O };
-      } else if (v === o && A === 4) {
-        const C = n.fromBytes(B.subarray(0, n.BYTES)), _ = n.fromBytes(B.subarray(n.BYTES, 2 * n.BYTES));
-        return { x: C, y: _ };
+        return (A & 1) === 1 !== T && (O = n.neg(O)), { x: B, y: O };
+      } else if (v === s && A === 4) {
+        const B = n.fromBytes(k.subarray(0, n.BYTES)), _ = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
+        return { x: B, y: _ };
       } else
-        throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${o} uncompressed bytes`);
+        throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${s} uncompressed bytes`);
     }
   }), p = (b) => qe(xe(b, t.nByteLength));
   function g(b) {
@@ -1080,8 +1080,8 @@ function Fi(e) {
   }
   const y = (b, v, A) => G(b.slice(v, A));
   class w {
-    constructor(v, A, B) {
-      this.r = v, this.s = A, this.recovery = B, this.assertValidity();
+    constructor(v, A, k) {
+      this.r = v, this.s = A, this.recovery = k, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
@@ -1091,8 +1091,8 @@ function Fi(e) {
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
     static fromDER(v) {
-      const { r: A, s: B } = Ce.toSig(Z("DER", v));
-      return new w(A, B);
+      const { r: A, s: k } = Be.toSig(Z("DER", v));
+      return new w(A, k);
     }
     assertValidity() {
       if (!d(this.r))
@@ -1104,13 +1104,13 @@ function Fi(e) {
       return new w(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: A, s: B, recovery: C } = this, _ = x(Z("msgHash", v));
-      if (C == null || ![0, 1, 2, 3].includes(C))
+      const { r: A, s: k, recovery: B } = this, _ = x(Z("msgHash", v));
+      if (B == null || ![0, 1, 2, 3].includes(B))
         throw new Error("recovery id invalid");
-      const O = C === 2 || C === 3 ? A + t.n : A;
+      const O = B === 2 || B === 3 ? A + t.n : A;
       if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const T = C & 1 ? "03" : "02", X = l.fromHex(T + p(O)), ye = c(O), Ie = a(-_ * ye), ze = a(B * ye), pe = l.BASE.multiplyAndAddUnsafe(X, Ie, ze);
+      const T = B & 1 ? "03" : "02", X = l.fromHex(T + p(O)), ye = c(O), Ie = a(-_ * ye), ze = a(k * ye), pe = l.BASE.multiplyAndAddUnsafe(X, Ie, ze);
       if (!pe)
         throw new Error("point at infinify");
       return pe.assertValidity(), pe;
@@ -1127,7 +1127,7 @@ function Fi(e) {
       return De(this.toDERHex());
     }
     toDERHex() {
-      return Ce.hexFromSig({ r: this.r, s: this.s });
+      return Be.hexFromSig({ r: this.r, s: this.s });
     }
     // padded bytes of r, then padded bytes of s
     toCompactRawBytes() {
@@ -1137,7 +1137,7 @@ function Fi(e) {
       return p(this.r) + p(this.s);
     }
   }
-  const m = {
+  const E = {
     isValidPrivateKey(b) {
       try {
         return f(b), !0;
@@ -1170,21 +1170,21 @@ function Fi(e) {
     return l.fromPrivateKey(b).toRawBytes(v);
   }
   function I(b) {
-    const v = b instanceof Uint8Array, A = typeof b == "string", B = (v || A) && b.length;
-    return v ? B === i || B === o : A ? B === 2 * i || B === 2 * o : b instanceof l;
+    const v = b instanceof Uint8Array, A = typeof b == "string", k = (v || A) && b.length;
+    return v ? k === i || k === s : A ? k === 2 * i || k === 2 * s : b instanceof l;
   }
-  function k(b, v, A = !0) {
+  function C(b, v, A = !0) {
     if (I(b))
       throw new Error("first arg must be private key");
     if (!I(v))
       throw new Error("second arg must be public key");
     return l.fromHex(v).multiply(f(b)).toRawBytes(A);
   }
-  const E = t.bits2int || function(b) {
+  const m = t.bits2int || function(b) {
     const v = G(b), A = b.length * 8 - t.nBitLength;
     return A > 0 ? v >> BigInt(A) : v;
   }, x = t.bits2int_modN || function(b) {
-    return a(E(b));
+    return a(m(b));
   }, S = Yt(t.nBitLength);
   function P(b) {
     if (typeof b != "bigint")
@@ -1196,17 +1196,17 @@ function Fi(e) {
   function U(b, v, A = N) {
     if (["recovered", "canonical"].some((Ke) => Ke in A))
       throw new Error("sign() legacy options not supported");
-    const { hash: B, randomBytes: C } = t;
+    const { hash: k, randomBytes: B } = t;
     let { lowS: _, prehash: O, extraEntropy: T } = A;
-    _ == null && (_ = !0), b = Z("msgHash", b), O && (b = Z("prehashed msgHash", B(b)));
+    _ == null && (_ = !0), b = Z("msgHash", b), O && (b = Z("prehashed msgHash", k(b)));
     const X = x(b), ye = f(v), Ie = [P(ye), P(X)];
     if (T != null) {
-      const Ke = T === !0 ? C(n.BYTES) : T;
+      const Ke = T === !0 ? B(n.BYTES) : T;
       Ie.push(Z("extraEntropy", Ke));
     }
-    const ze = Be(...Ie), pe = X;
+    const ze = ke(...Ie), pe = X;
     function St(Ke) {
-      const _e = E(Ke);
+      const _e = m(Ke);
       if (!d(_e))
         return;
       const bn = c(_e), Le = l.BASE.multiply(_e).toAffine(), Q = a(Le.x);
@@ -1215,35 +1215,35 @@ function Fi(e) {
       const Te = a(bn * a(pe + Q * ye));
       if (Te === ce)
         return;
-      let vn = (Le.x === Q ? 0 : 2) | Number(Le.y & Y), En = Te;
-      return _ && g(Te) && (En = h(Te), vn ^= 1), new w(Q, En, vn);
+      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);
     }
     return { seed: ze, k2sig: St };
   }
   const N = { lowS: t.lowS, prehash: !1 }, $ = { lowS: t.lowS, prehash: !1 };
   function R(b, v, A = N) {
-    const { seed: B, k2sig: C } = U(b, v, A), _ = t;
-    return Vn(_.hash.outputLen, _.nByteLength, _.hmac)(B, C);
+    const { seed: k, k2sig: B } = U(b, v, A), _ = t;
+    return Vn(_.hash.outputLen, _.nByteLength, _.hmac)(k, B);
   }
   l.BASE._setWindowSize(8);
-  function H(b, v, A, B = $) {
+  function H(b, v, A, k = $) {
     var Le;
-    const C = b;
-    if (v = Z("msgHash", v), A = Z("publicKey", A), "strict" in B)
+    const B = b;
+    if (v = Z("msgHash", v), A = Z("publicKey", A), "strict" in k)
       throw new Error("options.strict was renamed to lowS");
-    const { lowS: _, prehash: O } = B;
+    const { lowS: _, prehash: O } = k;
     let T, X;
     try {
-      if (typeof C == "string" || C instanceof Uint8Array)
+      if (typeof B == "string" || B instanceof Uint8Array)
         try {
-          T = w.fromDER(C);
+          T = w.fromDER(B);
         } catch (Q) {
-          if (!(Q instanceof Ce.Err))
+          if (!(Q instanceof Be.Err))
             throw Q;
-          T = w.fromCompact(C);
+          T = w.fromCompact(B);
         }
-      else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
-        const { r: Q, s: Te } = C;
+      else if (typeof B == "object" && typeof B.r == "bigint" && typeof B.s == "bigint") {
+        const { r: Q, s: Te } = B;
         T = new w(Q, Te);
       } else
         throw new Error("PARSE");
@@ -1262,12 +1262,12 @@ function Fi(e) {
   return {
     CURVE: t,
     getPublicKey: K,
-    getSharedSecret: k,
+    getSharedSecret: C,
     sign: R,
     verify: H,
     ProjectivePoint: l,
     Signature: w,
-    utils: m
+    utils: E
   };
 }
 let Gn = class extends Hn {
@@ -1277,14 +1277,14 @@ let Gn = class extends Hn {
     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;
-    const i = this.blockLen, o = new Uint8Array(i);
-    o.set(r.length > i ? t.create().update(r).digest() : r);
-    for (let s = 0; s < o.length; s++)
-      o[s] ^= 54;
-    this.iHash.update(o), this.oHash = t.create();
-    for (let s = 0; s < o.length; s++)
-      o[s] ^= 106;
-    this.oHash.update(o), o.fill(0);
+    const i = this.blockLen, s = new Uint8Array(i);
+    s.set(r.length > i ? t.create().update(r).digest() : r);
+    for (let o = 0; o < s.length; o++)
+      s[o] ^= 54;
+    this.iHash.update(s), this.oHash = t.create();
+    for (let o = 0; o < s.length; o++)
+      s[o] ^= 106;
+    this.oHash.update(s), s.fill(0);
   }
   update(t) {
     return rt(this), this.iHash.update(t), this;
@@ -1298,8 +1298,8 @@ let Gn = class extends Hn {
   }
   _cloneInto(t) {
     t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: n, iHash: r, finished: i, destroyed: o, blockLen: s, outputLen: a } = this;
-    return t = t, t.finished = i, t.destroyed = o, t.blockLen = s, t.outputLen = a, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
+    const { oHash: n, iHash: r, finished: i, destroyed: s, blockLen: o, outputLen: a } = this;
+    return t = t, t.finished = i, t.destroyed = s, t.blockLen = o, t.outputLen = a, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
   }
   destroy() {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
@@ -1320,12 +1320,12 @@ function Gi(e, t) {
   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), ot = BigInt(2), Nn = (e, t) => (e + t / ot) / t;
+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), o = BigInt(22), s = 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, ot, t) * l % t, g = J(p, i, t) * p % t, h = J(g, o, t) * g % t, y = J(h, a, t) * h % t, w = J(y, c, t) * y % t, m = J(w, a, t) * h % t, K = J(m, n, t) * f % t, I = J(K, s, t) * g % t, k = J(I, r, t) * l % t, E = J(k, ot, t);
-  if (!Pt.eql(Pt.sqr(E), 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))
     throw new Error("Cannot find square root");
-  return E;
+  return m;
 }
 const Pt = Pi(ft, void 0, void 0, { sqrt: Xn }), Ue = Gi({
   a: BigInt(0),
@@ -1346,24 +1346,24 @@ 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"), o = n, s = BigInt("0x100000000000000000000000000000000"), a = Nn(o * e, t), c = Nn(-r * e, t);
-      let l = z(e - a * n - c * i, t), f = z(-a * r - c * o, t);
-      const u = l > s, d = f > s;
-      if (u && (l = t - l), d && (f = t - f), l > s || f > s)
+      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);
+      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)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
       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, Cn = {};
-function st(e, ...t) {
-  let n = Cn[e];
+}, $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];
   if (n === void 0) {
     const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = Be(r, r), Cn[e] = n;
+    n = ke(r, r), Bn[e] = n;
   }
-  return $t(Be(n, ...t));
+  return $t(ke(n, ...t));
 }
-const Xt = (e) => e.toRawBytes(!0).slice(1), Mt = (e) => xe(e, 32), kt = (e) => z(e, ft), Ge = (e) => z(e, it), Qt = Ue.ProjectivePoint, Yi = (e, t, n) => Qt.BASE.multiplyAndAddUnsafe(e, t, n);
+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) };
@@ -1371,37 +1371,37 @@ function Ht(e) {
 function er(e) {
   if (!Qn(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = kt(e * e), n = kt(t * e + BigInt(7));
+  const t = Ct(e * e), n = Ct(t * e + BigInt(7));
   let r = Xn(n);
-  r % ot !== ht && (r = kt(-r));
+  r % st !== ht && (r = Ct(-r));
   const i = new Qt(e, r, Yn);
   return i.assertValidity(), i;
 }
 function tr(...e) {
-  return Ge(G(st("BIP0340/challenge", ...e)));
+  return Ge(G(ot("BIP0340/challenge", ...e)));
 }
 function Xi(e) {
   return Ht(e).bytes;
 }
 function Qi(e, t, n = qn(32)) {
-  const r = Z("message", e), { bytes: i, scalar: o } = Ht(t), s = Z("auxRand", n, 32), a = Mt(o ^ G(st("BIP0340/aux", s))), c = st("BIP0340/nonce", a, i, r), l = Ge(G(c));
+  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)
     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 * o)), 32), !nr(p, r, i))
+  if (p.set(f, 0), p.set(Mt(Ge(u + d * s)), 32), !nr(p, r, i))
     throw new Error("sign: Invalid signature produced");
   return p;
 }
 function nr(e, t, n) {
-  const r = Z("signature", e, 64), i = Z("message", t), o = Z("publicKey", n, 32);
+  const r = Z("signature", e, 64), i = Z("message", t), s = Z("publicKey", n, 32);
   try {
-    const s = er(G(o)), a = G(r.subarray(0, 32));
+    const o = er(G(s)), a = G(r.subarray(0, 32));
     if (!Qn(a))
       return !1;
     const c = G(r.subarray(32, 64));
     if (!Ji(c))
       return !1;
-    const l = tr(Mt(a), Xt(s), i), f = Yi(s, c, Ge(-l));
+    const l = tr(Mt(a), Xt(o), i), f = Yi(o, c, Ge(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== a);
   } catch {
     return !1;
@@ -1417,21 +1417,21 @@ const Ze = {
     pointToBytes: Xt,
     numberToBytesBE: xe,
     bytesToNumberBE: G,
-    taggedHash: st,
+    taggedHash: ot,
     mod: z
   }
-}, Bt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+}, kt = 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, eo = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!eo)
+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)
   throw new Error("Non little-endian hardware is not supported");
-const to = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const ts = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function M(e) {
   if (!en(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += to[e[n]];
+    t += ts[e[n]];
   return t;
 }
 function W(e) {
@@ -1442,20 +1442,20 @@ function W(e) {
     throw new Error("padded hex string expected, got unpadded hex of length " + t);
   const n = new Uint8Array(t / 2);
   for (let r = 0; r < n.length; r++) {
-    const i = r * 2, o = e.slice(i, i + 2), s = Number.parseInt(o, 16);
-    if (Number.isNaN(s) || s < 0)
+    const i = r * 2, s = e.slice(i, i + 2), o = Number.parseInt(s, 16);
+    if (Number.isNaN(o) || o < 0)
       throw new Error("Invalid byte sequence");
-    n[r] = s;
+    n[r] = o;
   }
   return n;
 }
-function no(e) {
+function ns(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 = no(e)), !en(e))
+  if (typeof e == "string" && (e = ns(e)), !en(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -1478,85 +1478,85 @@ function ir(e) {
   const t = (r) => e().update(Je(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-function or(e = 32) {
-  if (Bt && typeof Bt.getRandomValues == "function")
-    return Bt.getRandomValues(new Uint8Array(e));
+function sr(e = 32) {
+  if (kt && typeof kt.getRandomValues == "function")
+    return kt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 function qt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function ro(e) {
+function rs(e) {
   if (typeof e != "boolean")
     throw new Error(`Expected boolean, not ${e}`);
 }
-function sr(e, ...t) {
+function or(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 io(e) {
+function is(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);
 }
-function oo(e, t = !0) {
+function ss(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 so(e, t) {
-  sr(e);
+function os(e, t) {
+  or(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const oe = {
+const se = {
   number: qt,
-  bool: ro,
-  bytes: sr,
-  hash: io,
-  exists: oo,
-  output: so
+  bool: rs,
+  bytes: or,
+  hash: is,
+  exists: ss,
+  output: os
 };
-function ao(e, t, n, r) {
+function as(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
-  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), a = Number(n & o), c = r ? 4 : 0, l = r ? 0 : 4;
-  e.setUint32(t + c, s, r), e.setUint32(t + l, a, 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 co extends rr {
+class cs extends rr {
   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);
   }
   update(t) {
-    oe.exists(this);
+    se.exists(this);
     const { view: n, buffer: r, blockLen: i } = this;
     t = Je(t);
-    const o = t.length;
-    for (let s = 0; s < o; ) {
-      const a = Math.min(i - this.pos, o - s);
+    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);
-        for (; i <= o - s; s += i)
-          this.process(c, s);
+        for (; i <= s - o; o += i)
+          this.process(c, o);
         continue;
       }
-      r.set(t.subarray(s, s + a), this.pos), this.pos += a, s += a, this.pos === i && (this.process(n, 0), this.pos = 0);
+      r.set(t.subarray(o, o + a), this.pos), this.pos += a, o += a, this.pos === i && (this.process(n, 0), this.pos = 0);
     }
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    oe.exists(this), oe.output(t, this), this.finished = !0;
-    const { buffer: n, view: r, blockLen: i, isLE: o } = this;
-    let { pos: s } = this;
-    n[s++] = 128, this.buffer.subarray(s).fill(0), this.padOffset > i - s && (this.process(r, 0), s = 0);
-    for (let u = s; u < i; u++)
+    se.exists(this), se.output(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;
-    ao(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
+    as(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
     const a = Ut(t), c = this.outputLen;
     if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
@@ -1564,7 +1564,7 @@ class co extends rr {
     if (l > f.length)
       throw new Error("_sha2: outputLen bigger than state");
     for (let u = 0; u < l; u++)
-      a.setUint32(4 * u, f[u], o);
+      a.setUint32(4 * u, f[u], s);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -1574,11 +1574,11 @@ class co extends rr {
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: r, length: i, finished: o, destroyed: s, pos: a } = this;
-    return t.length = i, t.pos = a, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
+    const { blockLen: n, buffer: r, length: i, finished: s, destroyed: o, pos: a } = this;
+    return t.length = i, t.pos = a, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 }
-const lo = (e, t, n) => e & t ^ ~e & n, uo = (e, t, n) => e & t ^ e & n ^ t & n, fo = new Uint32Array([
+const ls = (e, t, n) => e & t ^ ~e & n, us = (e, t, n) => e & t ^ e & n ^ t & n, fs = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1653,17 +1653,17 @@ const lo = (e, t, n) => e & t ^ ~e & n, uo = (e, t, n) => e & t ^ e & n ^ t & n,
   528734635,
   1541459225
 ]), ve = new Uint32Array(64);
-class ar extends co {
+class ar extends cs {
   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;
   }
   get() {
-    const { A: t, B: n, C: r, D: i, E: o, F: s, G: a, H: c } = this;
-    return [t, n, r, i, o, s, a, c];
+    const { A: t, B: n, C: r, D: i, E: s, F: o, G: a, H: c } = this;
+    return [t, n, r, i, s, o, a, c];
   }
   // prettier-ignore
-  set(t, n, r, i, o, s, a, c) {
-    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = o | 0, this.F = s | 0, this.G = a | 0, this.H = c | 0;
+  set(t, n, r, i, s, o, a, c) {
+    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = s | 0, this.F = o | 0, this.G = a | 0, this.H = c | 0;
   }
   process(t, n) {
     for (let u = 0; u < 16; u++, n += 4)
@@ -1672,12 +1672,12 @@ class ar extends co {
       const d = ve[u - 15], p = ve[u - 2], g = re(d, 7) ^ re(d, 18) ^ d >>> 3, h = re(p, 17) ^ re(p, 19) ^ p >>> 10;
       ve[u] = h + ve[u - 7] + g + ve[u - 16] | 0;
     }
-    let { A: r, B: i, C: o, D: s, E: a, F: c, G: l, H: f } = this;
+    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 + lo(a, c, l) + fo[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + uo(r, i, o) | 0;
-      f = l, l = c, c = a, a = s + p | 0, s = o, o = i, i = r, r = p + h | 0;
+      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;
+      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, o = o + this.C | 0, s = s + 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, o, s, a, c, l, f);
+    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);
   }
   roundClean() {
     ve.fill(0);
@@ -1686,20 +1686,20 @@ class ar extends co {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 }
-class ho extends ar {
+class hs extends ar {
   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 ho());
+ir(() => new hs());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function Ve(e) {
   if (!Number.isSafeInteger(e))
     throw new Error(`Wrong integer: ${e}`);
 }
 function fe(...e) {
-  const t = (i, o) => (s) => i(o(s)), n = Array.from(e).reverse().reduce((i, o) => i ? t(i, o.encode) : o.encode, void 0), r = e.reduce((i, o) => i ? t(i, o.decode) : o.decode, void 0);
+  const t = (i, s) => (o) => i(s(o)), n = Array.from(e).reverse().reduce((i, s) => i ? t(i, s.encode) : s.encode, void 0), r = e.reduce((i, s) => i ? t(i, s.decode) : s.decode, void 0);
   return { encode: n, decode: r };
 }
 function he(e) {
@@ -1781,7 +1781,7 @@ function cr(e) {
     throw new Error("normalize fn should be function");
   return { encode: (t) => t, decode: (t) => e(t) };
 }
-function kn(e, t, n) {
+function Cn(e, t, n) {
   if (t < 2)
     throw new Error(`convertRadix: wrong from=${t}, base cannot be less than 2`);
   if (n < 2)
@@ -1791,26 +1791,26 @@ function kn(e, t, n) {
   if (!e.length)
     return [];
   let r = 0;
-  const i = [], o = Array.from(e);
-  for (o.forEach((s) => {
-    if (Ve(s), s < 0 || s >= t)
-      throw new Error(`Wrong integer: ${s}`);
+  const i = [], s = Array.from(e);
+  for (s.forEach((o) => {
+    if (Ve(o), o < 0 || o >= t)
+      throw new Error(`Wrong integer: ${o}`);
   }); ; ) {
-    let s = 0, a = !0;
-    for (let c = r; c < o.length; c++) {
-      const l = o[c], f = t * s + l;
-      if (!Number.isSafeInteger(f) || t * s / t !== s || f - l !== t * s)
+    let o = 0, a = !0;
+    for (let c = r; c < s.length; c++) {
+      const l = s[c], f = t * o + l;
+      if (!Number.isSafeInteger(f) || t * o / t !== o || f - l !== t * o)
         throw new Error("convertRadix: carry overflow");
-      if (s = f % n, o[c] = Math.floor(f / n), !Number.isSafeInteger(o[c]) || o[c] * n + s !== f)
+      if (o = f % n, s[c] = Math.floor(f / n), !Number.isSafeInteger(s[c]) || s[c] * n + o !== f)
         throw new Error("convertRadix: carry overflow");
       if (a)
-        o[c] ? a = !1 : r = c;
+        s[c] ? a = !1 : r = c;
       else continue;
     }
-    if (i.push(s), a)
+    if (i.push(o), a)
       break;
   }
-  for (let s = 0; s < e.length - 1 && e[s] === 0; s++)
+  for (let o = 0; o < e.length - 1 && e[o] === 0; o++)
     i.push(0);
   return i.reverse();
 }
@@ -1824,34 +1824,34 @@ function Dt(e, t, n, r) {
     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)}`);
-  let i = 0, o = 0;
-  const s = 2 ** n - 1, a = [];
+  let i = 0, s = 0;
+  const o = 2 ** n - 1, a = [];
   for (const c of e) {
     if (Ve(c), c >= 2 ** t)
       throw new Error(`convertRadix2: invalid data word=${c} from=${t}`);
-    if (i = i << t | c, o + t > 32)
-      throw new Error(`convertRadix2: carry overflow pos=${o} from=${t}`);
-    for (o += t; o >= n; o -= n)
-      a.push((i >> o - n & s) >>> 0);
-    i &= 2 ** o - 1;
+    if (i = i << t | c, s + t > 32)
+      throw new Error(`convertRadix2: carry overflow pos=${s} from=${t}`);
+    for (s += t; s >= n; s -= n)
+      a.push((i >> s - n & o) >>> 0);
+    i &= 2 ** s - 1;
   }
-  if (i = i << n - o & s, !r && o >= t)
+  if (i = i << n - s & o, !r && s >= t)
     throw new Error("Excess padding");
   if (!r && i)
     throw new Error(`Non-zero padding: ${i}`);
-  return r && o > 0 && a.push(i >>> 0), a;
+  return r && s > 0 && a.push(i >>> 0), a;
 }
-function yo(e) {
+function ds(e) {
   return Ve(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
-      return kn(Array.from(t), 2 ** 8, e);
+      return Cn(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(kn(t, e, 2 ** 8));
+      return Uint8Array.from(Cn(t, e, 2 ** 8));
     }
   };
 }
@@ -1873,7 +1873,7 @@ function Ae(e, t = !1) {
     }
   };
 }
-function Bn(e) {
+function kn(e) {
   if (typeof e != "function")
     throw new Error("unsafeWrapper fn should be function");
   return function(...t) {
@@ -1883,13 +1883,13 @@ function Bn(e) {
     }
   };
 }
-const po = fe(Ae(4), he("0123456789ABCDEF"), de("")), go = fe(Ae(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), yt(5), de(""));
+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("")), wo = fe(Ae(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), yt(6), de("")), tn = (e) => fe(yo(58), he(e), de("")), jt = tn("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+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], bo = {
+const Un = [0, 2, 3, 5, 6, 7, 9, 10, 11], ws = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
@@ -1901,11 +1901,11 @@ const Un = [0, 2, 3, 5, 6, 7, 9, 10, 11], bo = {
   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), o = jt.decode(r);
-      for (let s = 0; s < o.length - i; s++)
-        if (o[s] !== 0)
+      const r = e.slice(n, n + 11), i = Un.indexOf(r.length), s = jt.decode(r);
+      for (let o = 0; o < s.length - i; o++)
+        if (s[o] !== 0)
           throw new Error("base58xmr: wrong padding");
-      t = t.concat(Array.from(o.slice(o.length - i)));
+      t = t.concat(Array.from(s.slice(s.length - i)));
     }
     return Uint8Array.from(t);
   }
@@ -1920,24 +1920,24 @@ function Fe(e) {
 function _n(e, t, n = 1) {
   const r = e.length;
   let i = 1;
-  for (let o = 0; o < r; o++) {
-    const s = e.charCodeAt(o);
-    if (s < 33 || s > 126)
+  for (let s = 0; s < r; s++) {
+    const o = e.charCodeAt(s);
+    if (o < 33 || o > 126)
       throw new Error(`Invalid prefix (${e})`);
-    i = Fe(i) ^ s >> 5;
+    i = Fe(i) ^ o >> 5;
   }
   i = Fe(i);
-  for (let o = 0; o < r; o++)
-    i = Fe(i) ^ e.charCodeAt(o) & 31;
-  for (let o of t)
-    i = Fe(i) ^ o;
-  for (let o = 0; o < 6; o++)
+  for (let s = 0; s < r; s++)
+    i = Fe(i) ^ e.charCodeAt(s) & 31;
+  for (let s of t)
+    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));
 }
 function ur(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Ae(5), r = n.decode, i = n.encode, o = Bn(r);
-  function s(f, u, d = 90) {
+  const t = e === "bech32" ? 1 : 734539939, n = Ae(5), r = n.decode, i = n.encode, s = kn(r);
+  function o(f, u, d = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
     if (!Array.isArray(u) || u.length && typeof u[0] != "number")
@@ -1967,33 +1967,33 @@ function ur(e) {
       throw new Error(`Invalid checksum in ${f}: expected "${w}"`);
     return { prefix: g, words: y };
   }
-  const c = Bn(a);
+  const c = kn(a);
   function l(f) {
     const { prefix: u, words: d } = a(f, !1);
     return { prefix: u, words: d, bytes: r(d) };
   }
-  return { encode: s, decode: a, decodeToBytes: l, decodeUnsafe: c, fromWords: r, fromWordsUnsafe: o, toWords: i };
+  return { encode: o, decode: a, decodeToBytes: l, decodeUnsafe: c, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
 const je = ur("bech32");
 ur("bech32m");
-const vo = {
+const bs = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, Eo = fe(Ae(4), he("0123456789abcdef"), de(""), cr((e) => {
+}, vs = fe(Ae(4), he("0123456789abcdef"), de(""), cr((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();
-})), mo = {
-  utf8: vo,
-  hex: Eo,
-  base16: po,
-  base32: go,
+})), ms = {
+  utf8: bs,
+  hex: vs,
+  base16: ys,
+  base32: ps,
   base64: ue,
-  base64url: wo,
+  base64url: gs,
   base58: jt,
-  base58xmr: bo
+  base58xmr: ws
 };
-`${Object.keys(mo).join(", ")}`;
+`${Object.keys(ms).join(", ")}`;
 function It(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
@@ -2002,25 +2002,25 @@ function Ln(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
-function xo(e) {
+function Es(e) {
   return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
 }
 function le(e, ...t) {
-  if (!xo(e))
+  if (!Es(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)), So = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!So)
+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)
   throw new Error("Non little-endian hardware is not supported");
-function Ao(e, t) {
+function Ss(e, t) {
   if (t == null || typeof t != "object")
     throw new Error("options must be defined");
   return Object.assign(e, t);
 }
-function Ko(e, t) {
+function As(e, t) {
   if (e.length !== t.length)
     return !1;
   let n = 0;
@@ -2028,9 +2028,9 @@ function Ko(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const No = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), me = 16, Co = 283;
+const Ks = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ee = 16, Ns = 283;
 function nn(e) {
-  return e << 1 ^ Co & -(e >> 7);
+  return e << 1 ^ Ns & -(e >> 7);
 }
 function Pe(e, t) {
   let n = 0;
@@ -2049,19 +2049,19 @@ const zt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), ko = /* @__PURE__ */ zt.map((e, t) => zt.indexOf(t)), Bo = (e) => e << 24 | e >>> 8, _t = (e) => e << 8 | e >>> 24;
+})(), 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) {
   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), o = i.map(_t), s = 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(_t), i = r.map(_t), s = i.map(_t), 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;
-      s[u] = n[l] ^ r[f], a[u] = i[l] ^ o[f], c[u] = e[l] << 8 | e[f];
+      o[u] = n[l] ^ r[f], a[u] = i[l] ^ s[f], c[u] = e[l] << 8 | e[f];
     }
-  return { sbox: e, sbox2: c, T0: n, T1: r, T2: i, T3: o, T01: s, T23: a };
+  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(ko, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), Uo = /* @__PURE__ */ (() => {
+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 e = new Uint8Array(16);
   for (let t = 0, n = 1; t < 16; t++, n = nn(n))
     e[t] = n;
@@ -2072,54 +2072,54 @@ function dr(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, o = (a) => se(n, a, a, a, a), s = new Uint32Array(t + 28);
-  s.set(r);
-  for (let a = i; a < s.length; a++) {
-    let c = s[a - 1];
-    a % i === 0 ? c = o(Bo(c)) ^ Uo[a / i - 1] : i > 6 && a % i === 4 && (c = o(c)), s[a] = s[a - i] ^ c;
+  const { sbox2: n } = rn, 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;
   }
-  return s;
+  return o;
 }
-function Io(e) {
-  const t = dr(e), n = t.slice(), r = t.length, { sbox2: i } = rn, { T0: o, T1: s, T2: a, T3: c } = hr;
+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;
   for (let l = 0; l < r; l += 4)
     for (let f = 0; f < 4; f++)
       n[l + f] = t[r - l - 4 + f];
   t.fill(0);
   for (let l = 4; l < r - 4; l++) {
-    const f = n[l], u = se(i, f, f, f, f);
-    n[l] = o[u & 255] ^ s[u >>> 8 & 255] ^ a[u >>> 16 & 255] ^ c[u >>> 24];
+    const f = n[l], u = oe(i, f, f, f, f);
+    n[l] = s[u & 255] ^ o[u >>> 8 & 255] ^ a[u >>> 16 & 255] ^ c[u >>> 24];
   }
   return n;
 }
-function Ee(e, t, n, r, i, o) {
-  return e[n << 8 & 65280 | r >>> 8 & 255] ^ t[i >>> 8 & 65280 | o >>> 24 & 255];
+function me(e, t, n, r, i, s) {
+  return e[n << 8 & 65280 | r >>> 8 & 255] ^ t[i >>> 8 & 65280 | s >>> 24 & 255];
 }
-function se(e, t, n, r, i) {
+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: o, T01: s, T23: a } = rn;
+  const { sbox2: s, T01: o, T23: a } = rn;
   let c = 0;
   t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
   const l = e.length / 4 - 2;
   for (let g = 0; g < l; g++) {
-    const h = e[c++] ^ Ee(s, a, t, n, r, i), y = e[c++] ^ Ee(s, a, n, r, i, t), w = e[c++] ^ Ee(s, a, r, i, t, n), m = e[c++] ^ Ee(s, a, i, t, n, r);
-    t = h, n = y, r = w, i = m;
+    const h = e[c++] ^ me(o, a, t, n, r, i), y = e[c++] ^ me(o, a, n, r, i, t), w = e[c++] ^ me(o, a, r, i, t, n), E = e[c++] ^ me(o, a, i, t, n, r);
+    t = h, n = y, r = w, i = E;
   }
-  const f = e[c++] ^ se(o, t, n, r, i), u = e[c++] ^ se(o, n, r, i, t), d = e[c++] ^ se(o, r, i, t, n), p = e[c++] ^ se(o, i, t, n, r);
+  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 _o(e, t, n, r, i) {
-  const { sbox2: o, T01: s, T23: a } = hr;
+function Is(e, t, n, r, i) {
+  const { sbox2: s, T01: o, T23: a } = hr;
   let c = 0;
   t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
   const l = e.length / 4 - 2;
   for (let g = 0; g < l; g++) {
-    const h = e[c++] ^ Ee(s, a, t, i, r, n), y = e[c++] ^ Ee(s, a, n, t, i, r), w = e[c++] ^ Ee(s, a, r, n, t, i), m = e[c++] ^ Ee(s, a, i, r, n, t);
-    t = h, n = y, r = w, i = m;
+    const h = e[c++] ^ me(o, a, t, i, r, n), y = e[c++] ^ me(o, a, n, t, i, r), w = e[c++] ^ me(o, a, r, n, t, i), E = e[c++] ^ me(o, a, i, r, n, t);
+    t = h, n = y, r = w, i = E;
   }
-  const f = e[c++] ^ se(o, t, i, r, n), u = e[c++] ^ se(o, n, t, i, r), d = e[c++] ^ se(o, r, n, t, i), p = e[c++] ^ se(o, i, r, n, t);
+  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) {
@@ -2129,24 +2129,24 @@ function yr(e, t) {
     throw new Error(`aes: wrong destination length, expected at least ${e}, got: ${t.length}`);
   return t;
 }
-function Lo(e) {
-  if (le(e), e.length % me !== 0)
-    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${me}`);
+function _s(e) {
+  if (le(e), e.length % Ee !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ee}`);
 }
-function To(e, t, n) {
+function Ls(e, t, n) {
   let r = e.length;
-  const i = r % me;
+  const i = r % Ee;
   if (!t && i !== 0)
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
-  const o = F(e);
+  const s = F(e);
   if (t) {
-    let c = me - i;
-    c || (c = me), r = r + c;
+    let c = Ee - i;
+    c || (c = Ee), r = r + c;
   }
-  const s = yr(r, n), a = F(s);
-  return { b: o, o: a, out: s };
+  const o = yr(r, n), a = F(o);
+  return { b: s, o: a, out: o };
 }
-function $o(e, t) {
+function Ts(e, t) {
   if (!t)
     return e;
   const n = e.length;
@@ -2156,48 +2156,48 @@ function $o(e, t) {
   if (r <= 0 || r > 16)
     throw new Error(`aes/pcks5: wrong padding byte: ${r}`);
   const i = e.subarray(0, -r);
-  for (let o = 0; o < r; o++)
-    if (e[n - o - 1] !== r)
+  for (let s = 0; s < r; s++)
+    if (e[n - s - 1] !== r)
       throw new Error("aes/pcks5: wrong padding");
   return i;
 }
-function Ro(e) {
+function $s(e) {
   const t = new Uint8Array(16), n = F(t);
   t.set(e);
-  const r = me - e.length;
-  for (let i = me - r; i < me; i++)
+  const r = Ee - e.length;
+  for (let i = Ee - r; i < Ee; i++)
     t[i] = r;
   return n;
 }
-const pr = /* @__PURE__ */ No({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
+const pr = /* @__PURE__ */ Ks({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
   le(t), le(n, 16);
   const i = !r.disablePadding;
   return {
-    encrypt: (o, s) => {
-      const a = dr(t), { b: c, o: l, out: f } = To(o, i, s), u = F(n);
+    encrypt: (s, o) => {
+      const a = dr(t), { b: c, o: l, out: f } = Ls(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;
       if (i) {
-        const w = Ro(o.subarray(y * 4));
+        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;
       }
       return a.fill(0), f;
     },
-    decrypt: (o, s) => {
-      Lo(o);
-      const a = Io(t), c = F(n), l = yr(o.length, s), f = F(o), u = F(l);
+    decrypt: (s, o) => {
+      _s(s);
+      const a = Us(t), c = F(n), l = yr(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, m = p, K = g, I = h;
+        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: k, s1: E, s2: x, s3: S } = _o(a, d, p, g, h);
-        u[y++] = k ^ w, u[y++] = E ^ m, u[y++] = x ^ K, u[y++] = S ^ I;
+        const { s0: C, s1: m, s2: x, s3: S } = Is(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), $o(l, i);
+      return a.fill(0), Ts(l, i);
     }
   };
-}), gr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Oo = gr("expand 16-byte k"), Po = gr("expand 32-byte k"), Mo = F(Oo), wr = F(Po);
+}), 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();
 function L(e, t) {
   return e << t | e >>> 32 - t;
@@ -2205,32 +2205,32 @@ function L(e, t) {
 function Zt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Qe = 64, Ho = 16, br = 2 ** 32 - 1, $n = new Uint32Array();
-function qo(e, t, n, r, i, o, s, a) {
-  const c = i.length, l = new Uint8Array(Qe), f = F(l), u = Zt(i) && Zt(o), d = u ? F(i) : $n, p = u ? F(o) : $n;
-  for (let g = 0; g < c; s++) {
-    if (e(t, n, r, f, s, a), s >= br)
+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;
+  for (let g = 0; g < c; o++) {
+    if (e(t, n, r, f, o, a), o >= br)
       throw new Error("arx: counter overflow");
     const h = Math.min(Qe, c - g);
     if (u && h === Qe) {
       const y = g / 4;
       if (g % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let w = 0, m; w < Ho; w++)
-        m = y + w, p[m] = d[m] ^ f[w];
+      for (let w = 0, E; w < Ms; w++)
+        E = y + w, p[E] = d[E] ^ f[w];
       g += Qe;
       continue;
     }
     for (let y = 0, w; y < h; y++)
-      w = g + y, o[w] = i[w] ^ l[y];
+      w = g + y, s[w] = i[w] ^ l[y];
     g += h;
   }
 }
-function Do(e, t) {
-  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: o, rounds: s } = Ao({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
+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);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return It(i), It(s), Ln(o), Ln(n), (a, c, l, f, u = 0) => {
+  return It(i), It(o), Ln(s), Ln(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)
@@ -2242,7 +2242,7 @@ function Do(e, t) {
     if (g === 32)
       h = a.slice(), p.push(h), y = wr;
     else if (g === 16 && n)
-      h = new Uint8Array(32), h.set(a), h.set(a, 16), y = Mo, p.push(h);
+      h = new Uint8Array(32), h.set(a), h.set(a, 16), y = Ps, p.push(h);
     else
       throw new Error(`arx: invalid 32-byte key, got length=${g}`);
     Zt(c) || (c = c.slice(), p.push(c));
@@ -2252,52 +2252,52 @@ function Do(e, t) {
         throw new Error("arx: extended nonce must be 24 bytes");
       r(y, w, F(c.subarray(0, 16)), w), c = c.subarray(16);
     }
-    const m = 16 - i;
-    if (m !== c.length)
-      throw new Error(`arx: nonce must be ${m} or 16 bytes`);
-    if (m !== 12) {
+    const E = 16 - i;
+    if (E !== c.length)
+      throw new Error(`arx: nonce must be ${E} or 16 bytes`);
+    if (E !== 12) {
       const I = new Uint8Array(12);
-      I.set(c, o ? 0 : 12 - c.length), c = I, p.push(c);
+      I.set(c, s ? 0 : 12 - c.length), c = I, p.push(c);
     }
     const K = F(c);
-    for (qo(e, y, w, K, l, f, u, s); p.length > 0; )
+    for (Hs(e, y, w, K, l, f, u, o); p.length > 0; )
       p.pop().fill(0);
     return f;
   };
 }
-function jo(e, t, n, r, i, o = 20) {
-  let s = 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], m = i, K = n[0], I = n[1], k = n[2], E = s, x = a, S = c, P = l, U = f, N = u, $ = d, R = p, H = g, b = h, v = y, A = w, B = m, C = K, _ = I, O = k;
-  for (let X = 0; X < o; X += 2)
-    E = E + U | 0, B = L(B ^ E, 16), H = H + B | 0, U = L(U ^ H, 12), E = E + U | 0, B = L(B ^ E, 8), H = H + B | 0, U = L(U ^ H, 7), x = x + N | 0, C = L(C ^ x, 16), b = b + C | 0, N = L(N ^ b, 12), x = x + N | 0, C = L(C ^ x, 8), b = b + C | 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), E = E + N | 0, O = L(O ^ E, 16), v = v + O | 0, N = L(N ^ v, 12), E = E + N | 0, O = L(O ^ E, 8), v = v + O | 0, N = L(N ^ v, 7), x = x + $ | 0, B = L(B ^ x, 16), A = A + B | 0, $ = L($ ^ A, 12), x = x + $ | 0, B = L(B ^ x, 8), A = A + B | 0, $ = L($ ^ A, 7), S = S + R | 0, C = L(C ^ S, 16), H = H + C | 0, R = L(R ^ H, 12), S = S + R | 0, C = L(C ^ S, 8), H = H + C | 0, R = L(R ^ H, 7), P = P + 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);
+function Ds(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++] = s + E | 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++] = m + B | 0, r[T++] = K + C | 0, r[T++] = I + _ | 0, r[T++] = k + O | 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__ */ Do(jo, {
+const vr = /* @__PURE__ */ qs(Ds, {
   counterRight: !1,
   counterLength: 4,
   allowShortKeys: !1
 });
-class Er extends rr {
+class mr extends rr {
   constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, oe.hash(t);
+    super(), this.finished = !1, this.destroyed = !1, se.hash(t);
     const r = Je(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;
-    const i = this.blockLen, o = new Uint8Array(i);
-    o.set(r.length > i ? t.create().update(r).digest() : r);
-    for (let s = 0; s < o.length; s++)
-      o[s] ^= 54;
-    this.iHash.update(o), this.oHash = t.create();
-    for (let s = 0; s < o.length; s++)
-      o[s] ^= 106;
-    this.oHash.update(o), o.fill(0);
+    const i = this.blockLen, s = new Uint8Array(i);
+    s.set(r.length > i ? t.create().update(r).digest() : r);
+    for (let o = 0; o < s.length; o++)
+      s[o] ^= 54;
+    this.iHash.update(s), this.oHash = t.create();
+    for (let o = 0; o < s.length; o++)
+      s[o] ^= 106;
+    this.oHash.update(s), s.fill(0);
   }
   update(t) {
-    return oe.exists(this), this.iHash.update(t), this;
+    return se.exists(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    oe.exists(this), oe.bytes(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    se.exists(this), se.bytes(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);
@@ -2305,35 +2305,35 @@ class Er extends rr {
   }
   _cloneInto(t) {
     t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: n, iHash: r, finished: i, destroyed: o, blockLen: s, outputLen: a } = this;
-    return t = t, t.finished = i, t.destroyed = o, t.blockLen = s, t.outputLen = a, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
+    const { oHash: n, iHash: r, finished: i, destroyed: s, blockLen: o, outputLen: a } = this;
+    return t = t, t.finished = i, t.destroyed = s, t.blockLen = o, t.outputLen = a, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
   }
   destroy() {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const pt = (e, t, n) => new Er(e, t).update(n).digest();
-pt.create = (e, t) => new Er(e, t);
-function on(e, t, n) {
-  return oe.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), pt(e, Je(n), Je(t));
+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 Lt = new Uint8Array([0]), Rn = new Uint8Array();
-function mr(e, t, n, r = 32) {
-  if (oe.hash(e), oe.number(r), r > 255 * e.outputLen)
+function Er(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 o = new Uint8Array(i * e.outputLen), s = pt.create(e, t), a = s._cloneInto(), c = new Uint8Array(s.outputLen);
+  const s = new Uint8Array(i * e.outputLen), o = pt.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), o.set(c, e.outputLen * l), s._cloneInto(a);
-  return s.destroy(), a.destroy(), c.fill(0), Lt.fill(0), o.slice(0, r);
+    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);
 }
-var Vo = Object.defineProperty, D = (e, t) => {
+var js = Object.defineProperty, D = (e, t) => {
   for (var n in t)
-    Vo(e, n, { get: t[n], enumerable: !0 });
-}, $e = Symbol("verified"), zo = (e) => e instanceof Object;
+    js(e, n, { get: t[n], enumerable: !0 });
+}, $e = Symbol("verified"), Vs = (e) => e instanceof Object;
 function xr(e) {
-  if (!zo(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))
+  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))
     return !1;
   for (let t = 0; t < e.tags.length; t++) {
     let n = e.tags[t];
@@ -2345,38 +2345,38 @@ function xr(e) {
   }
   return !0;
 }
-var Zo = {};
-D(Zo, {
-  Queue: () => Jo,
+var zs = {};
+D(zs, {
+  Queue: () => Gs,
   QueueNode: () => Sr,
-  binarySearch: () => sn,
-  insertEventIntoAscendingList: () => Go,
-  insertEventIntoDescendingList: () => Wo,
-  normalizeURL: () => Fo,
+  binarySearch: () => on,
+  insertEventIntoAscendingList: () => Ws,
+  insertEventIntoDescendingList: () => Fs,
+  normalizeURL: () => Zs,
   utf8Decoder: () => ie,
   utf8Encoder: () => te
 });
 var ie = new TextDecoder("utf-8"), te = new TextEncoder();
-function Fo(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 Wo(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);
+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);
   return r || e.splice(n, 0, t), e;
 }
-function Go(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);
+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);
   return r || e.splice(n, 0, t), e;
 }
-function sn(e, t) {
+function on(e, t) {
   let n = 0, r = e.length - 1;
   for (; n <= r; ) {
-    const i = Math.floor((n + r) / 2), o = t(e[i]);
-    if (o === 0)
+    const i = Math.floor((n + r) / 2), s = t(e[i]);
+    if (s === 0)
       return [i, !0];
-    o < 0 ? r = i - 1 : n = i + 1;
+    s < 0 ? r = i - 1 : n = i + 1;
   }
   return [n, !1];
 }
@@ -2387,7 +2387,7 @@ var Sr = class {
     ee(this, "prev", null);
     this.value = e;
   }
-}, Jo = class {
+}, Gs = class {
   constructor() {
     ee(this, "first");
     ee(this, "last");
@@ -2407,7 +2407,7 @@ var Sr = class {
     const e = this.first;
     return this.first = e.next, e.value;
   }
-}, Yo = class {
+}, Js = class {
   generateSecretKey() {
     return Ze.utils.randomPrivateKey();
   }
@@ -2432,94 +2432,94 @@ var Sr = class {
     }
   }
 };
-function Xo(e) {
+function Ys(e) {
   if (!xr(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(Xo(e)));
+  let t = Se(te.encode(Ys(e)));
   return M(t);
 }
-var gt = new Yo(), Me = gt.generateSecretKey, ke = gt.getPublicKey, ae = gt.finalizeEvent, wt = gt.verifyEvent, Qo = {};
-D(Qo, {
-  Application: () => Qs,
-  BadgeAward: () => cs,
-  BadgeDefinition: () => Zs,
-  BlockedRelaysList: () => Is,
-  BookmarkList: () => ks,
-  Bookmarksets: () => js,
-  Calendar: () => sa,
+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: () => kr,
+  ChannelCreation: () => Cr,
   ChannelHideMessage: () => Ir,
   ChannelMessage: () => Ur,
-  ChannelMetadata: () => Br,
+  ChannelMetadata: () => kr,
   ChannelMuteUser: () => _r,
   ClassifiedListing: () => na,
   ClientAuth: () => Lr,
-  CommunitiesList: () => Bs,
+  CommunitiesList: () => ko,
   CommunityDefinition: () => ua,
-  CommunityPostApproval: () => ws,
-  Contacts: () => is,
-  CreateOrUpdateProduct: () => Gs,
-  CreateOrUpdateStall: () => Ws,
-  Curationsets: () => Vs,
+  CommunityPostApproval: () => wo,
+  Contacts: () => ro,
+  CreateOrUpdateProduct: () => Go,
+  CreateOrUpdateStall: () => Wo,
+  Curationsets: () => Vo,
   Date: () => ia,
   DraftClassifiedListing: () => ra,
-  DraftLong: () => Ys,
-  Emojisets: () => Xs,
-  EncryptedDirectMessage: () => os,
-  EncryptedDirectMessages: () => ss,
-  EventDeletion: () => as,
-  FileMetadata: () => fs,
-  FileServerPreference: () => $s,
-  Followsets: () => Hs,
-  GenericRepost: () => ls,
-  Genericlists: () => qs,
+  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: () => As,
-  InterestsList: () => Ls,
-  Interestsets: () => Fs,
-  JobFeedback: () => Es,
-  JobRequest: () => bs,
-  JobResult: () => vs,
-  Label: () => gs,
-  LightningPubRPC: () => Os,
-  LiveChatMessage: () => hs,
+  Highlights: () => Ao,
+  InterestsList: () => Lo,
+  Interestsets: () => Fo,
+  JobFeedback: () => mo,
+  JobRequest: () => bo,
+  JobResult: () => vo,
+  Label: () => go,
+  LightningPubRPC: () => Oo,
+  LiveChatMessage: () => fo,
   LiveEvent: () => ea,
-  LongFormArticle: () => Js,
-  Metadata: () => ts,
-  Mutelist: () => Ks,
-  NWCWalletInfo: () => Rs,
+  LongFormArticle: () => Jo,
+  Metadata: () => eo,
+  Mutelist: () => Ko,
+  NWCWalletInfo: () => Ro,
   NWCWalletRequest: () => Tr,
-  NWCWalletResponse: () => Ps,
-  NostrConnect: () => Ms,
-  OpenTimestamps: () => us,
-  Pinlist: () => Ns,
-  ProblemTracker: () => ds,
-  ProfileBadges: () => zs,
-  PublicChatsList: () => Us,
+  NWCWalletResponse: () => Po,
+  NostrConnect: () => Mo,
+  OpenTimestamps: () => lo,
+  Pinlist: () => No,
+  ProblemTracker: () => ho,
+  ProfileBadges: () => zo,
+  PublicChatsList: () => Uo,
   Reaction: () => cn,
-  RecommendRelay: () => rs,
-  RelayList: () => Cs,
-  Relaysets: () => Ds,
-  Report: () => ys,
-  Reporting: () => ps,
+  RecommendRelay: () => no,
+  RelayList: () => Bo,
+  Relaysets: () => Do,
+  Report: () => yo,
+  Reporting: () => po,
   Repost: () => an,
-  SearchRelaysList: () => _s,
-  ShortTextNote: () => ns,
-  Time: () => oa,
-  UserEmojiList: () => Ts,
+  SearchRelaysList: () => _o,
+  ShortTextNote: () => to,
+  Time: () => sa,
+  UserEmojiList: () => To,
   UserStatuses: () => ta,
-  Zap: () => Ss,
-  ZapGoal: () => ms,
-  ZapRequest: () => xs,
-  classifyKind: () => es,
+  Zap: () => So,
+  ZapGoal: () => Eo,
+  ZapRequest: () => xo,
+  classifyKind: () => Qs,
   isEphemeralKind: () => Nr,
-  isParameterizedReplaceableKind: () => Cr,
+  isParameterizedReplaceableKind: () => Br,
   isRegularKind: () => Ar,
   isReplaceableKind: () => Kr
 });
@@ -2532,13 +2532,13 @@ function Kr(e) {
 function Nr(e) {
   return 2e4 <= e && e < 3e4;
 }
-function Cr(e) {
+function Br(e) {
   return 3e4 <= e && e < 4e4;
 }
-function es(e) {
-  return Ar(e) ? "regular" : Kr(e) ? "replaceable" : Nr(e) ? "ephemeral" : Cr(e) ? "parameterized" : "unknown";
+function Qs(e) {
+  return Ar(e) ? "regular" : Kr(e) ? "replaceable" : Nr(e) ? "ephemeral" : Br(e) ? "parameterized" : "unknown";
 }
-var ts = 0, ns = 1, rs = 2, is = 3, os = 4, ss = 4, as = 5, an = 6, cn = 7, cs = 8, ls = 16, kr = 40, Br = 41, Ur = 42, Ir = 43, _r = 44, us = 1040, fs = 1063, hs = 1311, ds = 1971, ys = 1984, ps = 1984, gs = 1985, ws = 4550, bs = 5999, vs = 6999, Es = 7e3, ms = 9041, xs = 9734, Ss = 9735, As = 9802, Ks = 1e4, Ns = 10001, Cs = 10002, ks = 10003, Bs = 10004, Us = 10005, Is = 10006, _s = 10007, Ls = 10015, Ts = 10030, $s = 10096, Rs = 13194, Os = 21e3, Lr = 22242, Tr = 23194, Ps = 23195, Ms = 24133, ln = 27235, Hs = 3e4, qs = 30001, Ds = 30002, js = 30003, Vs = 30004, zs = 30008, Zs = 30009, Fs = 30015, Ws = 30017, Gs = 30018, Js = 30023, Ys = 30024, Xs = 30030, Qs = 30078, ea = 30311, ta = 30315, na = 30402, ra = 30403, ia = 31922, oa = 31923, sa = 31924, aa = 31925, ca = 31989, la = 31990, ua = 34550, fa = {};
+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,
@@ -2552,8 +2552,8 @@ function un(e, t) {
   return e.slice(i, i + 64);
 }
 function $r(e, t) {
-  let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), o = Math.min(i.indexOf(","), i.indexOf("}"));
-  return parseInt(i.slice(0, o), 10);
+  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) {
   let t = e.slice(0, 22).indexOf('"EVENT"');
@@ -2565,8 +2565,8 @@ function ha(e) {
   let r = t + 7 + 1 + n, i = e.slice(r + 1, 80).indexOf('"');
   if (i === -1)
     return null;
-  let o = r + 1 + i;
-  return e.slice(r + 1, o);
+  let s = r + 1 + i;
+  return e.slice(r + 1, s);
 }
 function da(e, t) {
   return t === un(e, "id");
@@ -2613,16 +2613,16 @@ D(We, {
   noteEncode: () => Sa,
   nprofileEncode: () => Aa,
   npubEncode: () => xa,
-  nrelayEncode: () => Ca,
-  nsecEncode: () => ma
+  nrelayEncode: () => Ba,
+  nsecEncode: () => Ea
 });
 var fn = 5e3, Rr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
-function Ea(e) {
+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) {
-  var i, o, s, a, c, l, f, u;
+  var i, s, o, a, c, l, f, u;
   let { prefix: t, words: n } = je.decode(e, fn), r = new Uint8Array(je.fromWords(n));
   switch (t) {
     case "nprofile": {
@@ -2641,7 +2641,7 @@ function bt(e) {
     }
     case "nevent": {
       let d = et(r);
-      if (!((o = d[0]) != null && o[0]))
+      if (!((s = d[0]) != null && s[0]))
         throw new Error("missing TLV 0 for nevent");
       if (d[0][0].length !== 32)
         throw new Error("TLV 0 should be 32 bytes");
@@ -2654,7 +2654,7 @@ function bt(e) {
         data: {
           id: M(d[0][0]),
           relays: d[1] ? d[1].map((p) => ie.decode(p)) : [],
-          author: (s = d[2]) != null && s[0] ? M(d[2][0]) : void 0,
+          author: (o = d[2]) != null && o[0] ? M(d[2][0]) : void 0,
           kind: (a = d[3]) != null && a[0] ? parseInt(M(d[3][0]), 16) : void 0
         }
       };
@@ -2702,14 +2702,14 @@ function bt(e) {
 function et(e) {
   let t = {}, n = e;
   for (; n.length > 0; ) {
-    let r = n[0], i = n[1], o = n.slice(2, 2 + i);
-    if (n = n.slice(2 + i), o.length < i)
+    let r = n[0], i = n[1], s = n.slice(2, 2 + i);
+    if (n = n.slice(2 + i), s.length < i)
       throw new Error(`not enough data to read on TLV ${r}`);
-    t[r] = t[r] || [], t[r].push(o);
+    t[r] = t[r] || [], t[r].push(s);
   }
   return t;
 }
-function ma(e) {
+function Ea(e) {
   return vt("nsec", e);
 }
 function xa(e) {
@@ -2726,7 +2726,7 @@ function vt(e, t) {
   return Xe(e, t);
 }
 function Aa(e) {
-  let t = Et({
+  let t = mt({
     0: [W(e.pubkey)],
     1: (e.relays || []).map((n) => te.encode(n))
   });
@@ -2734,8 +2734,8 @@ function Aa(e) {
 }
 function Ka(e) {
   let t;
-  e.kind !== void 0 && (t = Ea(e.kind));
-  let n = Et({
+  e.kind !== void 0 && (t = ma(e.kind));
+  let n = mt({
     0: [W(e.id)],
     1: (e.relays || []).map((r) => te.encode(r)),
     2: e.author ? [W(e.author)] : [],
@@ -2746,7 +2746,7 @@ function Ka(e) {
 function Na(e) {
   let t = new ArrayBuffer(4);
   new DataView(t).setUint32(0, e.kind, !1);
-  let n = Et({
+  let n = mt({
     0: [te.encode(e.identifier)],
     1: (e.relays || []).map((r) => te.encode(r)),
     2: [W(e.pubkey)],
@@ -2754,34 +2754,34 @@ function Na(e) {
   });
   return Xe("naddr", n);
 }
-function Ca(e) {
-  let t = Et({
+function Ba(e) {
+  let t = mt({
     0: [te.encode(e)]
   });
   return Xe("nrelay", t);
 }
-function Et(e) {
+function mt(e) {
   let t = [];
   return Object.entries(e).reverse().forEach(([n, r]) => {
     r.forEach((i) => {
-      let o = new Uint8Array(i.length + 2);
-      o.set([parseInt(n)], 0), o.set([i.length], 1), o.set(i, 2), t.push(o);
+      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);
 }
-var ka = {};
-D(ka, {
-  decrypt: () => Ba,
+var Ca = {};
+D(Ca, {
+  decrypt: () => ka,
   encrypt: () => Or
 });
 async function Or(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e, i = Ue.getSharedSecret(r, "02" + t), o = Pr(i);
-  let s = Uint8Array.from(or(16)), a = te.encode(n), c = pr(o, s).encrypt(a), l = ue.encode(new Uint8Array(c)), f = ue.encode(new Uint8Array(s.buffer));
+  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));
   return `${l}?iv=${f}`;
 }
-async function Ba(e, t, n) {
+async function ka(e, t, n) {
   const r = e instanceof Uint8Array ? M(e) : e;
-  let [i, o] = n.split("?iv="), s = Ue.getSharedSecret(r, "02" + t), a = Pr(s), c = ue.decode(o), l = ue.decode(i), f = pr(a, c).decrypt(l);
+  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);
   return ie.decode(f);
 }
 function Pr(e) {
@@ -2795,32 +2795,32 @@ D(Ua, {
   searchDomain: () => _a,
   useFetchImplementation: () => Ia
 });
-var Mr = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, mt;
+var Mr = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Et;
 try {
-  mt = fetch;
+  Et = fetch;
 } catch {
 }
 function Ia(e) {
-  mt = e;
+  Et = e;
 }
 async function _a(e, t = "") {
   try {
     const n = `https://${e}/.well-known/nostr.json?name=${t}`;
-    return (await (await mt(n, { redirect: "error" })).json()).names;
+    return (await (await Et(n, { redirect: "error" })).json()).names;
   } catch {
     return {};
   }
 }
 async function Hr(e) {
-  var o;
+  var s;
   const t = e.match(Mr);
   if (!t)
     return null;
   const [n, r = "_", i] = t;
   try {
-    const s = `https://${i}/.well-known/nostr.json?name=${r}`, a = await (await mt(s, { redirect: "error" })).json();
+    const o = `https://${i}/.well-known/nostr.json?name=${r}`, a = await (await Et(o, { redirect: "error" })).json();
     let c = a.names[r];
-    return c ? { pubkey: c, relays: (o = a.relays) == null ? void 0 : o[c] } : null;
+    return c ? { pubkey: c, relays: (s = a.relays) == null ? void 0 : s[c] } : null;
   } catch {
     return null;
   }
@@ -2846,8 +2846,8 @@ function $a(e) {
       relays: r[2] ? [r[2]] : []
     });
   for (let r = 0; r < n.length; r++) {
-    const i = n[r], [o, s, a, c] = i, l = {
-      id: s,
+    const i = n[r], [s, o, a, c] = i, l = {
+      id: o,
       relays: a ? [a] : []
     }, f = r === 0, u = r === n.length - 1;
     if (c === "root") {
@@ -2914,8 +2914,8 @@ function Ha(e, t) {
   let n = 0;
   const r = e, i = ["nonce", n.toString(), t.toString()];
   for (r.tags.push(i); ; ) {
-    const o = Math.floor((/* @__PURE__ */ new Date()).getTime() / 1e3);
-    if (o !== r.created_at && (n = 0, r.created_at = o), i[1] = (++n).toString(), r.id = nt(r), Dr(r.id) >= t)
+    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)
       break;
   }
   return r;
@@ -3064,7 +3064,7 @@ var ec = (e, t) => {
     return;
   return ae(
     {
-      kind: kr,
+      kind: Cr,
       tags: [...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3081,7 +3081,7 @@ var ec = (e, t) => {
     return;
   return ae(
     {
-      kind: Br,
+      kind: kr,
       tags: [["e", e.channel_create_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3133,15 +3133,15 @@ var ec = (e, t) => {
     },
     t
   );
-}, oc = {};
-D(oc, {
+}, sc = {};
+D(sc, {
   EMOJI_SHORTCODE_REGEX: () => Vr,
-  matchAll: () => sc,
+  matchAll: () => oc,
   regex: () => dn,
   replaceAll: () => ac
 });
 var Vr = /:(\w+):/, dn = () => new RegExp(`\\B${Vr.source}\\B`, "g");
-function* sc(e) {
+function* oc(e) {
   const t = e.matchAll(dn());
   for (const n of t)
     try {
@@ -3191,10 +3191,10 @@ D(j, {
 var zr = 1, Zr = 65535;
 function Fr(e, t) {
   const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return on(Se, n, "nip44-v2");
+  return sn(Se, n, "nip44-v2");
 }
 function Wr(e, t) {
-  const n = mr(Se, e, t, 76);
+  const n = Er(Se, e, t, 76);
   return {
     chacha_key: n.subarray(0, 32),
     chacha_nonce: n.subarray(32, 44),
@@ -3242,8 +3242,8 @@ function yc(e) {
   let n;
   try {
     n = ue.decode(e);
-  } catch (o) {
-    throw new Error("invalid base64: " + o.message);
+  } catch (s) {
+    throw new Error("invalid base64: " + s.message);
   }
   const r = n.length;
   if (r < 99 || r > 65603)
@@ -3257,15 +3257,15 @@ function yc(e) {
     mac: n.subarray(-32)
   };
 }
-function Jr(e, t, n = or(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: o } = Wr(t, n), s = hc(e), a = vr(r, i, s), c = Gr(o, a, n);
+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 Yr(e, t) {
-  const { nonce: n, ciphertext: r, mac: i } = yc(e), { chacha_key: o, chacha_nonce: s, hmac_key: a } = Wr(t, n), c = Gr(a, r, n);
-  if (!Ko(c, i))
+  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))
     throw new Error("invalid MAC");
-  const l = vr(o, s, r);
+  const l = vr(s, o, r);
   return dc(l);
 }
 var pc = {
@@ -3281,10 +3281,10 @@ D(gc, {
   parseConnectionString: () => wc
 });
 function wc(e) {
-  const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), o = n.get("secret");
-  if (!r || !i || !o)
+  const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), s = n.get("secret");
+  if (!r || !i || !s)
     throw new Error("invalid connection string");
-  return { pubkey: r, relay: i, secret: o };
+  return { pubkey: r, relay: i, secret: s };
 }
 async function bc(e, t, n) {
   const i = await Or(t, e, JSON.stringify({
@@ -3292,20 +3292,20 @@ async function bc(e, t, n) {
     params: {
       invoice: n
     }
-  })), o = {
+  })), s = {
     kind: Tr,
     created_at: Math.round(Date.now() / 1e3),
     content: i,
     tags: [["p", e]]
   };
-  return ae(o, t);
+  return ae(s, t);
 }
 var vc = {};
 D(vc, {
-  getZapEndpoint: () => mc,
+  getZapEndpoint: () => Ec,
   makeZapReceipt: () => Ac,
   makeZapRequest: () => xc,
-  useFetchImplementation: () => Ec,
+  useFetchImplementation: () => mc,
   validateZapRequest: () => Sc
 });
 var gn;
@@ -3313,23 +3313,23 @@ try {
   gn = fetch;
 } catch {
 }
-function Ec(e) {
+function mc(e) {
   gn = e;
 }
-async function mc(e) {
+async function Ec(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
-      let { words: s } = je.decode(n, 1e3), a = je.fromWords(s);
+      let { words: o } = je.decode(n, 1e3), a = je.fromWords(o);
       t = ie.decode(a);
     } else if (r) {
-      let [s, a] = r.split("@");
-      t = new URL(`/.well-known/lnurlp/${s}`, `https://${a}`).toString();
+      let [o, a] = r.split("@");
+      t = new URL(`/.well-known/lnurlp/${o}`, `https://${a}`).toString();
     } else
       return null;
-    let o = await (await gn(t)).json();
-    if (o.allowsNostr && o.nostrPubkey)
-      return o.callback;
+    let s = await (await gn(t)).json();
+    if (s.allowsNostr && s.nostrPubkey)
+      return s.callback;
   } catch {
   }
   return null;
@@ -3345,7 +3345,7 @@ function xc({
     throw new Error("amount not given");
   if (!e)
     throw new Error("profile not given");
-  let o = {
+  let s = {
     kind: 9734,
     created_at: Math.round(Date.now() / 1e3),
     content: i,
@@ -3355,7 +3355,7 @@ function xc({
       ["relays", ...r]
     ]
   };
-  return t && o.tags.push(["e", t]), o;
+  return t && s.tags.push(["e", t]), s;
 }
 function Sc(e) {
   let t;
@@ -3368,13 +3368,13 @@ function Sc(e) {
     return "Zap request is not a valid Nostr event.";
   if (!wt(t))
     return "Invalid signature on zap request.";
-  let n = t.tags.find(([o, s]) => o === "p" && s);
+  let n = t.tags.find(([s, o]) => s === "p" && o);
   if (!n)
     return "Zap request doesn't have a 'p' tag.";
   if (!n[1].match(/^[a-f0-9]{64}$/))
     return "Zap request 'p' tag is not valid hex.";
-  let r = t.tags.find(([o, s]) => o === "e" && s);
-  return r && !r[1].match(/^[a-f0-9]{64}$/) ? "Zap request 'e' tag is not valid hex." : t.tags.find(([o, s]) => o === "relays" && s) ? null : "Zap request doesn't have a 'relays' tag.";
+  let r = t.tags.find(([s, o]) => s === "e" && o);
+  return r && !r[1].match(/^[a-f0-9]{64}$/) ? "Zap request 'e' tag is not valid hex." : t.tags.find(([s, o]) => s === "relays" && o) ? null : "Zap request doesn't have a 'relays' tag.";
 }
 function Ac({
   zapRequest: e,
@@ -3382,30 +3382,30 @@ function Ac({
   bolt11: n,
   paidAt: r
 }) {
-  let i = JSON.parse(e), o = i.tags.filter(([a]) => a === "e" || a === "p" || a === "a"), s = {
+  let i = JSON.parse(e), s = i.tags.filter(([a]) => a === "e" || a === "p" || a === "a"), o = {
     kind: 9735,
     created_at: Math.round(r.getTime() / 1e3),
     content: "",
-    tags: [...o, ["P", i.pubkey], ["bolt11", n], ["description", e]]
+    tags: [...s, ["P", i.pubkey], ["bolt11", n], ["description", e]]
   };
-  return t && s.tags.push(["preimage", t]), s;
+  return t && o.tags.push(["preimage", t]), o;
 }
 var Kc = {};
 D(Kc, {
   getToken: () => Nc,
   hashPayload: () => wn,
   unpackEventFromToken: () => Qr,
-  validateEvent: () => oi,
+  validateEvent: () => si,
   validateEventKind: () => ti,
   validateEventMethodTag: () => ri,
   validateEventPayloadTag: () => ii,
   validateEventTimestamp: () => ei,
   validateEventUrlTag: () => ni,
-  validateToken: () => Cc
+  validateToken: () => Bc
 });
 var Xr = "Nostr ";
 async function Nc(e, t, n, r = !1, i) {
-  const o = {
+  const s = {
     kind: ln,
     tags: [
       ["u", e],
@@ -3414,16 +3414,16 @@ async function Nc(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && o.tags.push(["payload", wn(i)]);
-  const s = await n(o);
-  return (r ? Xr : "") + ue.encode(te.encode(JSON.stringify(s)));
+  i && s.tags.push(["payload", wn(i)]);
+  const o = await n(s);
+  return (r ? Xr : "") + ue.encode(te.encode(JSON.stringify(o)));
 }
-async function Cc(e, t, n) {
-  const r = await Qr(e).catch((o) => {
-    throw o;
+async function Bc(e, t, n) {
+  const r = await Qr(e).catch((s) => {
+    throw s;
   });
-  return await oi(r, t, n).catch((o) => {
-    throw o;
+  return await si(r, t, n).catch((s) => {
+    throw s;
   });
 }
 async function Qr(e) {
@@ -3460,7 +3460,7 @@ function ii(e, t) {
   const r = wn(t);
   return n.length > 0 && n[1] === r;
 }
-async function oi(e, t, n, r) {
+async function si(e, t, n, r) {
   if (!wt(e))
     throw new Error("Invalid nostr event, signature invalid");
   if (!ti(e))
@@ -3476,7 +3476,7 @@ async function oi(e, t, n, r) {
   return !0;
 }
 const He = 4, On = 30078, Rc = 100;
-var kc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(kc || {});
+var Cc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Cc || {});
 function Oc(e) {
   return JSON.stringify({
     rootKey: M(e.rootKey),
@@ -3556,15 +3556,15 @@ async function* Mc(e) {
   }
 }
 function Re(e, t = new Uint8Array(32), n = 1) {
-  const r = on(Se, e, t), i = [];
-  for (let o = 1; o <= n; o++)
-    i.push(mr(Se, r, new Uint8Array([o]), 32));
+  const r = sn(Se, e, t), i = [];
+  for (let s = 1; s <= n; s++)
+    i.push(Er(Se, r, new Uint8Array([s]), 32));
   return i;
 }
 function Tt(e, t) {
   return `${e}:${t}`;
 }
-const Bc = 1e3;
+const kc = 1e3;
 class ct {
   // 1. CHANNEL PUBLIC INTERFACE
   constructor(t, n) {
@@ -3585,12 +3585,12 @@ class ct {
    * @param name Optional name for the channel (for debugging)
    * @returns A new Channel instance
    */
-  static init(t, n, r, i, o, s) {
-    const a = Me(), [c, l] = Re(o, j.getConversationKey(a, n), 2);
+  static init(t, n, r, i, s, o) {
+    const a = Me(), [c, l] = Re(s, j.getConversationKey(a, n), 2);
     let f, u;
-    i ? (f = { publicKey: ke(r), privateKey: r }, u = { publicKey: ke(a), privateKey: a }) : u = { publicKey: ke(r), privateKey: r };
+    i ? (f = { publicKey: Ce(r), privateKey: r }, u = { publicKey: Ce(a), privateKey: a }) : u = { publicKey: Ce(r), privateKey: r };
     const d = {
-      rootKey: i ? c : o,
+      rootKey: i ? c : s,
       theirNostrPublicKey: n,
       ourCurrentNostrKey: f,
       ourNextNostrKey: u,
@@ -3602,7 +3602,7 @@ class ct {
       skippedMessageKeys: {},
       skippedHeaderKeys: {}
     }, p = new ct(t, d);
-    return s && (p.name = s), p;
+    return o && (p.name = o), p;
   }
   /**
    * Sends an encrypted message through the channel
@@ -3613,11 +3613,11 @@ class ct {
   send(t) {
     if (!this.state.theirNostrPublicKey || !this.state.ourCurrentNostrKey)
       throw new Error("we are not the initiator, so we can't send the first message");
-    const [n, r] = this.ratchetEncrypt(t), i = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNostrPublicKey), o = j.encrypt(JSON.stringify(n), i);
+    const [n, r] = this.ratchetEncrypt(t), i = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNostrPublicKey), s = j.encrypt(JSON.stringify(n), i);
     return ae({
       content: r,
       kind: He,
-      tags: [["header", o]],
+      tags: [["header", s]],
       created_at: Math.floor(Date.now() / 1e3)
     }, this.state.ourCurrentNostrKey.privateKey);
   }
@@ -3651,13 +3651,13 @@ class ct {
     const i = this.trySkippedMessageKeys(t, n, r);
     if (i) return i;
     this.skipMessageKeys(t.number, r);
-    const [o, s] = Re(this.state.receivingChainKey, new Uint8Array([1]), 2);
-    this.state.receivingChainKey = o, this.state.receivingChainMessageNumber++;
+    const [s, o] = Re(this.state.receivingChainKey, new Uint8Array([1]), 2);
+    this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++;
     try {
-      return j.decrypt(n, s);
+      return j.decrypt(n, o);
     } catch (a) {
       throw console.error(this.name, "Decryption failed:", a, {
-        messageKey: M(s).slice(0, 4),
+        messageKey: M(o).slice(0, 4),
         receivingChainKey: M(this.state.receivingChainKey).slice(0, 4),
         sendingChainKey: this.state.sendingChainKey && M(this.state.sendingChainKey).slice(0, 4),
         rootKey: M(this.state.rootKey).slice(0, 4)
@@ -3668,40 +3668,40 @@ class ct {
     this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.theirNostrPublicKey = t;
     const n = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [r, i] = Re(this.state.rootKey, n, 2);
     this.state.receivingChainKey = i, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
-    const o = Me();
+    const s = Me();
     this.state.ourNextNostrKey = {
-      publicKey: ke(o),
-      privateKey: o
+      publicKey: Ce(s),
+      privateKey: s
     };
-    const s = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [a, c] = Re(r, s, 2);
+    const o = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [a, c] = Re(r, o, 2);
     this.state.rootKey = a, this.state.sendingChainKey = c;
   }
   // 3. MESSAGE KEY FUNCTIONS
   skipMessageKeys(t, n) {
-    if (this.state.receivingChainMessageNumber + Bc < t)
+    if (this.state.receivingChainMessageNumber + kc < t)
       throw new Error("Too many skipped messages");
     for (; this.state.receivingChainMessageNumber < t; ) {
       const [r, i] = Re(this.state.receivingChainKey, new Uint8Array([1]), 2);
       this.state.receivingChainKey = r;
-      const o = Tt(n, this.state.receivingChainMessageNumber);
-      if (this.state.skippedMessageKeys[o] = i, !this.state.skippedHeaderKeys[n]) {
-        const s = [];
+      const s = Tt(n, this.state.receivingChainMessageNumber);
+      if (this.state.skippedMessageKeys[s] = i, !this.state.skippedHeaderKeys[n]) {
+        const o = [];
         if (this.state.ourCurrentNostrKey) {
           const c = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
-          s.push(c);
+          o.push(c);
         }
         const a = j.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
-        s.push(a), this.state.skippedHeaderKeys[n] = s;
+        o.push(a), this.state.skippedHeaderKeys[n] = o;
       }
       this.state.receivingChainMessageNumber++;
     }
   }
   trySkippedMessageKeys(t, n, r) {
-    var o;
+    var s;
     const i = Tt(r, t.number);
     if (i in this.state.skippedMessageKeys) {
-      const s = 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], (o = this.nostrUnsubscribe) == null || o.call(this), this.nostrUnsubscribe = void 0), j.decrypt(n, s);
+      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);
     }
     return null;
   }
@@ -3709,9 +3709,9 @@ class ct {
   decryptHeader(t) {
     const n = t.tags[0][1];
     if (this.state.ourCurrentNostrKey) {
-      const o = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
+      const s = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
       try {
-        return [JSON.parse(j.decrypt(n, o)), !1, !1];
+        return [JSON.parse(j.decrypt(n, s)), !1, !1];
       } catch {
       }
     }
@@ -3722,25 +3722,25 @@ class ct {
     }
     const i = this.state.skippedHeaderKeys[t.pubkey];
     if (i)
-      for (const o of i)
+      for (const s of i)
         try {
-          return [JSON.parse(j.decrypt(n, o)), !1, !0];
+          return [JSON.parse(j.decrypt(n, s)), !1, !0];
         } catch {
         }
     throw new Error("Failed to decrypt header with current and skipped header keys");
   }
   handleNostrEvent(t) {
-    var s;
+    var o;
     const [n, r, i] = this.decryptHeader(t);
     if (!i)
-      this.state.theirNostrPublicKey !== n.nextPublicKey && (this.state.theirNostrPublicKey = n.nextPublicKey, (s = this.nostrUnsubscribe) == null || s.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
+      this.state.theirNostrPublicKey !== n.nextPublicKey && (this.state.theirNostrPublicKey = n.nextPublicKey, (o = this.nostrUnsubscribe) == null || o.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
         { 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))
       return;
-    const o = this.ratchetDecrypt(n, t.content, t.pubkey);
-    this.internalSubscriptions.forEach((a) => a({ id: t.id, data: o, pubkey: n.nextPublicKey, time: n.time }));
+    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 }));
   }
   subscribeToNostrEvents() {
     if (this.nostrNextUnsubscribe) return;
@@ -3759,17 +3759,17 @@ new TextDecoder("utf-8");
 new TextEncoder();
 function tt(e, t) {
   const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return on(Se, n, "nip44-v2");
+  return sn(Se, n, "nip44-v2");
 }
 class Oe {
-  constructor(t, n, r, i, o, s, a = []) {
-    this.inviterSessionPublicKey = t, this.linkSecret = n, this.inviter = r, this.inviterSessionPrivateKey = i, this.label = o, this.maxUses = s, this.usedBy = a;
+  constructor(t, n, r, i, s, o, a = []) {
+    this.inviterSessionPublicKey = t, this.linkSecret = n, this.inviter = r, this.inviterSessionPrivateKey = i, this.label = s, this.maxUses = o, this.usedBy = a;
   }
   static createNew(t, n, r) {
-    const i = Me(), o = ke(i), s = M(Me());
+    const i = Me(), s = Ce(i), o = M(Me());
     return new Oe(
-      o,
       s,
+      o,
       t,
       i,
       n,
@@ -3781,16 +3781,16 @@ class Oe {
     if (!r)
       throw new Error("No invite data found in the URL hash.");
     const i = decodeURIComponent(r);
-    let o;
+    let s;
     try {
-      o = JSON.parse(i);
+      s = JSON.parse(i);
     } catch (u) {
       throw new Error("Invite data in URL hash is not valid JSON: " + u);
     }
-    const { inviter: s, sessionKey: a, linkSecret: c } = o;
-    if (!s || !a || !c)
+    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(s), f = We.decode(a);
+    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")
@@ -3814,41 +3814,44 @@ class Oe {
     );
   }
   static fromEvent(t) {
-    var s, a;
+    var o, a;
     if (!t.sig)
       throw new Error("Event is not signed");
     if (!wt(t))
       throw new Error("Event signature is invalid");
-    const { tags: n } = t, r = (s = n.find(([c]) => c === "sessionKey")) == null ? void 0 : s[1], i = (a = n.find(([c]) => c === "linkSecret")) == null ? void 0 : a[1], o = t.pubkey;
+    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)
       throw new Error("Invalid invite event: missing session key or link secret");
     return new Oe(
       r,
       i,
-      o
+      s
     );
   }
   static fromUser(t, n) {
     const r = {
       kinds: [On],
-      pubkey: t,
+      authors: [t],
       limit: 1,
       "#d": ["nostr-double-ratchet/invite"]
     };
     return new Promise((i) => {
-      const o = n(r, (s) => {
+      const s = n(r, (o) => {
         try {
-          const a = Oe.fromEvent(s);
-          o(), i(a);
+          const a = Oe.fromEvent(o);
+          s(), i(a);
         } catch {
-          o(), i(void 0);
+          s(), i(void 0);
         }
       });
       setTimeout(() => {
-        o(), i(void 0);
+        s(), i(void 0);
       }, 1e4);
     });
   }
+  /**
+   * Save Invite as JSON. Includes the inviter's session private key, so don't share this.
+   */
   serialize() {
     return JSON.stringify({
       inviterSessionPublicKey: this.inviterSessionPublicKey,
@@ -3860,6 +3863,9 @@ class Oe {
       usedBy: this.usedBy
     });
   }
+  /**
+   * Invite parameters are in the URL's hash so they are not sent to the server.
+   */
   getUrl(t = "https://iris.to") {
     const n = {
       inviter: We.npubEncode(this.inviter),
@@ -3878,7 +3884,7 @@ class Oe {
     };
   }
   /**
-       * Accepts the invite and creates a new channel with the inviter.
+       * Called by the invitee. Accepts the invite and creates a new channel with the inviter.
        * 
        * @param inviteeSecretKey - The invitee's secret key or a signing function
        * @param nostrSubscribe - A function to subscribe to Nostr events
@@ -3893,10 +3899,10 @@ class Oe {
        * so the inviter can create the channel on their side.
        */
   async accept(t, n, r) {
-    const i = Me(), o = ke(i), s = this.inviter || this.inviterSessionPublicKey, a = W(this.linkSecret), c = ct.init(t, this.inviterSessionPublicKey, i, !0, a, void 0), l = Me(), f = ke(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 = 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 = {
       pubkey: n,
       tags: [["secret", this.linkSecret]],
-      content: await u(o, s),
+      content: await u(s, o),
       created_at: Math.floor(Date.now() / 1e3)
     }, p = {
       kind: He,
@@ -3914,17 +3920,23 @@ class Oe {
       kinds: [He],
       "#p": [this.inviterSessionPublicKey]
     };
-    return n(i, async (o) => {
+    return n(i, async (s) => {
       try {
-        const s = await j.decrypt(o.content, tt(this.inviterSessionPrivateKey, o.pubkey)), a = JSON.parse(s);
-        if (!a.tags || !a.tags.some(([p, g]) => p === "secret" && g === this.linkSecret)) {
-          console.error("Invalid secret from event", o);
+        if (this.maxUses && this.usedBy.length >= this.maxUses) {
+          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);
+        if (!a.tags || !a.tags.some(([g, h]) => g === "secret" && h === this.linkSecret)) {
+          console.error("Invalid secret from event", s);
           return;
         }
-        const l = await (typeof t == "function" ? t : (p, g) => Promise.resolve(j.decrypt(p, tt(t, g))))(a.content, a.pubkey), f = W(this.linkSecret), u = o.id, d = ct.init(n, l, this.inviterSessionPrivateKey, !1, f, u);
-        r(d, a.pubkey);
-      } catch (s) {
-        console.error("Error processing invite message:", s);
+        const c = typeof t == "function" ? t : (g, h) => Promise.resolve(j.decrypt(g, tt(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);
+        r(p, l);
+      } catch (o) {
+        console.error("Error processing invite message:", o);
       }
     });
   }
@@ -3935,7 +3947,7 @@ export {
   Oe as Invite,
   Rc as MAX_SKIP,
   He as MESSAGE_EVENT_KIND,
-  kc as Sender,
+  Cc as Sender,
   Mc as createMessageStream,
   Pc as deserializeChannelState,
   Re as kdf,