npm - nostr-double-ratchet - Versions diffs - 0.0.8 → 0.0.10 - Mend

nostr-double-ratchet 0.0.8 → 0.0.10

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (6) hide show

package/dist/Invite.d.ts +10 -5
package/dist/Invite.d.ts.map +1 -1
package/dist/nostr-double-ratchet.es.js +1125 -1118
package/dist/nostr-double-ratchet.umd.js +1 -1
package/package.json +1 -1
package/src/Invite.ts +27 -24

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

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