nostr-double-ratchet 0.0.5 → 0.0.7

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

@@ -1,11 +1,11 @@
 var oi = Object.defineProperty;
 var si = (e, t, n) => t in e ? oi(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
 var ee = (e, t, n) => si(e, typeof t != "symbol" ? t + "" : t, n);
-function mn(e) {
+function En(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-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))
@@ -14,7 +14,7 @@ function Pn(e, ...t) {
 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);
+  En(e.outputLen), En(e.blockLen);
 }
 function rt(e, t = !0) {
   if (e.destroyed)
@@ -23,14 +23,14 @@ function rt(e, t = !0) {
     throw new Error("Hash#digest() has already been called");
 }
 function ci(e, t) {
-  Pn(e);
+  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 On = (e) => e instanceof Uint8Array, St = (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;
+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 ui(e) {
@@ -38,8 +38,8 @@ function ui(e) {
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Vt(e) {
-  if (typeof e == "string" && (e = ui(e)), !On(e))
+function Zt(e) {
+  if (typeof e == "string" && (e = ui(e)), !Pn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -47,7 +47,7 @@ function fi(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!On(r))
+    if (!Pn(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
@@ -59,38 +59,38 @@ let Mn = class {
   }
 };
 function hi(e) {
-  const t = (r) => e().update(Vt(r)).digest(), n = 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 Hn(e = 32) {
-  if (At && typeof At.getRandomValues == "function")
-    return At.getRandomValues(new Uint8Array(e));
+  if (St && typeof St.getRandomValues == "function")
+    return St.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 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), c = Number(n & o), a = r ? 4 : 0, l = r ? 0 : 4;
-  e.setUint32(t + a, s, r), e.setUint32(t + l, c, 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);
 }
 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 = St(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);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Vt(t);
+    t = Zt(t);
     const o = t.length;
     for (let s = 0; s < o; ) {
-      const c = Math.min(i - this.pos, o - s);
-      if (c === i) {
-        const a = St(t);
+      const a = Math.min(i - this.pos, o - s);
+      if (a === i) {
+        const c = At(t);
         for (; i <= o - s; s += i)
-          this.process(a, s);
+          this.process(c, s);
         continue;
       }
-      r.set(t.subarray(s, s + c), this.pos), this.pos += c, s += c, this.pos === i && (this.process(n, 0), this.pos = 0);
+      r.set(t.subarray(s, s + a), this.pos), this.pos += a, s += a, this.pos === i && (this.process(n, 0), this.pos = 0);
     }
     return this.length += t.length, this.roundClean(), this;
   }
@@ -102,14 +102,14 @@ let yi = class extends Mn {
     for (let u = s; u < i; u++)
       n[u] = 0;
     di(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const c = St(t), a = this.outputLen;
-    if (a % 4)
+    const a = At(t), c = this.outputLen;
+    if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const l = a / 4, f = this.get();
+    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++)
-      c.setUint32(4 * u, f[u], o);
+      a.setUint32(4 * u, f[u], o);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -119,8 +119,8 @@ let yi = class extends Mn {
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: r, length: i, finished: o, destroyed: s, pos: c } = this;
-    return t.length = i, t.pos = c, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
+    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 pi = (e, t, n) => e & t ^ ~e & n, gi = (e, t, n) => e & t ^ e & n ^ t & n, wi = /* @__PURE__ */ new Uint32Array([
@@ -203,12 +203,12 @@ let bi = class extends yi {
     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: c, H: a } = this;
-    return [t, n, r, i, o, s, c, a];
+    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];
   }
   // prettier-ignore
-  set(t, n, r, i, o, s, c, a) {
-    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 = c | 0, this.H = a | 0;
+  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;
   }
   process(t, n) {
     for (let u = 0; u < 16; u++, n += 4)
@@ -217,12 +217,12 @@ let bi = class extends yi {
       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: c, F: a, G: l, H: f } = this;
+    let { A: r, B: i, C: o, D: s, E: a, F: c, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const d = ne(c, 6) ^ ne(c, 11) ^ ne(c, 25), p = f + d + pi(c, a, l) + wi[u] + we[u] | 0, h = (ne(r, 2) ^ ne(r, 13) ^ ne(r, 22)) + gi(r, i, o) | 0;
-      f = l, l = a, a = c, c = 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, o) | 0;
+      f = l, l = c, c = a, a = s + p | 0, s = o, o = 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, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, c, a, l, f);
+    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);
   }
   roundClean() {
     we.fill(0);
@@ -231,7 +231,7 @@ let bi = class extends yi {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const Lt = /* @__PURE__ */ hi(() => new bi());
+const $t = /* @__PURE__ */ hi(() => new bi());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const qn = BigInt(0), lt = BigInt(1), vi = BigInt(2), ut = (e) => e instanceof Uint8Array, mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function He(e) {
@@ -246,7 +246,7 @@ function Dn(e) {
   const t = e.toString(16);
   return t.length & 1 ? `0${t}` : t;
 }
-function Zt(e) {
+function Ft(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   return BigInt(e === "" ? "0" : `0x${e}`);
@@ -267,17 +267,17 @@ function qe(e) {
   return n;
 }
 function G(e) {
-  return Zt(He(e));
+  return Ft(He(e));
 }
-function Ft(e) {
+function Wt(e) {
   if (!ut(e))
     throw new Error("Uint8Array expected");
-  return Zt(He(Uint8Array.from(e).reverse()));
+  return Ft(He(Uint8Array.from(e).reverse()));
 }
 function xe(e, t) {
   return qe(e.toString(16).padStart(t * 2, "0"));
 }
-function Wt(e, t) {
+function Gt(e, t) {
   return xe(e, t).reverse();
 }
 function Ei(e) {
@@ -300,7 +300,7 @@ function Z(e, t, n) {
     throw new Error(`${e} expected ${n} bytes, got ${i}`);
   return r;
 }
-function Ie(...e) {
+function ke(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -317,12 +317,12 @@ function xi(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 Si(e) {
+function Ai(e) {
   let t;
   for (t = 0; e > qn; e >>= lt, t += 1)
     ;
@@ -331,7 +331,7 @@ function Si(e) {
 function Ki(e, t) {
   return e >> BigInt(t) & lt;
 }
-const Bi = (e, t, n) => e | (n ? lt : qn) << BigInt(t), Gt = (e) => (vi << BigInt(e - 1)) - lt, Kt = (e) => new Uint8Array(e), En = (e) => Uint8Array.from(e);
+const Ni = (e, t, n) => e | (n ? lt : qn) << BigInt(t), Jt = (e) => (vi << BigInt(e - 1)) - lt, Kt = (e) => new Uint8Array(e), xn = (e) => Uint8Array.from(e);
 function jn(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -342,29 +342,29 @@ function jn(e, t, n) {
   let r = Kt(e), i = Kt(e), o = 0;
   const s = () => {
     r.fill(1), i.fill(0), o = 0;
-  }, c = (...u) => n(i, r, ...u), a = (u = Kt()) => {
-    i = c(En([0]), u), r = c(), u.length !== 0 && (i = c(En([1]), u), r = c());
+  }, a = (...u) => n(i, r, ...u), c = (u = Kt()) => {
+    i = a(xn([0]), u), r = a(), u.length !== 0 && (i = a(xn([1]), u), r = a());
   }, l = () => {
     if (o++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
     const d = [];
     for (; u < t; ) {
-      r = c();
+      r = a();
       const p = r.slice();
       d.push(p), u += r.length;
     }
-    return Ie(...d);
+    return ke(...d);
   };
   return (u, d) => {
-    s(), a(u);
+    s(), c(u);
     let p;
     for (; !(p = d(l())); )
-      a();
+      c();
     return s(), p;
   };
 }
-const Ni = {
+const Ci = {
   bigint: (e) => typeof e == "bigint",
   function: (e) => typeof e == "function",
   boolean: (e) => typeof e == "boolean",
@@ -377,12 +377,12 @@ const Ni = {
 };
 function Je(e, t, n = {}) {
   const r = (i, o, s) => {
-    const c = Ni[o];
-    if (typeof c != "function")
+    const a = Ci[o];
+    if (typeof a != "function")
       throw new Error(`Invalid validator "${o}", expected function`);
-    const a = e[i];
-    if (!(s && a === void 0) && !c(a, e))
-      throw new Error(`Invalid param ${String(i)}=${a} (${typeof a}), expected ${o}`);
+    const c = e[i];
+    if (!(s && c === void 0) && !a(c, e))
+      throw new Error(`Invalid param ${String(i)}=${c} (${typeof c}), expected ${o}`);
   };
   for (const [i, o] of Object.entries(t))
     r(i, o, !1);
@@ -390,100 +390,100 @@ function Je(e, t, n = {}) {
     r(i, o, !0);
   return e;
 }
-const Ci = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Bi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   bitGet: Ki,
-  bitLen: Si,
-  bitMask: Gt,
-  bitSet: Bi,
+  bitLen: Ai,
+  bitMask: Jt,
+  bitSet: Ni,
   bytesToHex: He,
   bytesToNumberBE: G,
-  bytesToNumberLE: Ft,
-  concatBytes: Ie,
+  bytesToNumberLE: Wt,
+  concatBytes: ke,
   createHmacDrbg: jn,
   ensureBytes: Z,
   equalBytes: xi,
   hexToBytes: qe,
-  hexToNumber: Zt,
+  hexToNumber: Ft,
   numberToBytesBE: xe,
-  numberToBytesLE: Wt,
+  numberToBytesLE: Gt,
   numberToHexUnpadded: Dn,
   numberToVarBytesBE: Ei,
-  utf8ToBytes: Ai,
+  utf8ToBytes: Si,
   validateObject: Je
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const j = BigInt(0), q = BigInt(1), Be = BigInt(2), Ii = BigInt(3), $t = BigInt(4), xn = BigInt(5), An = BigInt(8);
+const z = BigInt(0), q = BigInt(1), Ne = BigInt(2), ki = BigInt(3), Tt = BigInt(4), Sn = BigInt(5), An = BigInt(8);
 BigInt(9);
 BigInt(16);
 function V(e, t) {
   const n = e % t;
-  return n >= j ? n : t + n;
+  return n >= z ? n : t + n;
 }
 function Ui(e, t, n) {
-  if (n <= j || t < j)
+  if (n <= z || t < z)
     throw new Error("Expected power/modulo > 0");
   if (n === q)
-    return j;
+    return z;
   let r = q;
-  for (; t > j; )
+  for (; t > z; )
     t & q && (r = r * e % n), e = e * e % n, t >>= q;
   return r;
 }
 function J(e, t, n) {
   let r = e;
-  for (; t-- > j; )
+  for (; t-- > z; )
     r *= r, r %= n;
   return r;
 }
-function Tt(e, t) {
-  if (e === j || t <= j)
+function Rt(e, t) {
+  if (e === z || t <= z)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
-  let n = V(e, t), r = t, i = j, o = q;
-  for (; n !== j; ) {
-    const c = r / n, a = r % n, l = i - o * c;
-    r = n, n = a, i = o, o = l;
+  let n = V(e, t), r = t, i = z, o = q;
+  for (; n !== z; ) {
+    const a = r / n, c = r % n, l = i - o * a;
+    r = n, n = c, i = o, o = l;
   }
   if (r !== q)
     throw new Error("invert: does not exist");
   return V(i, t);
 }
-function ki(e) {
-  const t = (e - q) / Be;
+function Ii(e) {
+  const t = (e - q) / Ne;
   let n, r, i;
-  for (n = e - q, r = 0; n % Be === j; n /= Be, r++)
+  for (n = e - q, r = 0; n % Ne === z; n /= Ne, r++)
     ;
-  for (i = Be; i < e && Ui(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) / $t;
-    return function(a, l) {
-      const f = a.pow(l, s);
-      if (!a.eql(a.sqr(f), l))
+    const s = (e + q) / Tt;
+    return function(c, l) {
+      const f = c.pow(l, s);
+      if (!c.eql(c.sqr(f), l))
         throw new Error("Cannot find square root");
       return f;
     };
   }
-  const o = (n + q) / Be;
-  return function(c, a) {
-    if (c.pow(a, t) === c.neg(c.ONE))
+  const o = (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 = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, o), d = c.pow(a, n);
-    for (; !c.eql(d, c.ONE); ) {
-      if (c.eql(d, c.ZERO))
-        return c.ZERO;
+    let l = r, f = a.pow(a.mul(a.ONE, i), n), u = a.pow(c, o), d = a.pow(c, n);
+    for (; !a.eql(d, a.ONE); ) {
+      if (a.eql(d, a.ZERO))
+        return a.ZERO;
       let p = 1;
-      for (let h = c.sqr(d); p < l && !c.eql(h, c.ONE); p++)
-        h = c.sqr(h);
-      const g = c.pow(f, q << BigInt(l - p - 1));
-      f = c.sqr(g), u = c.mul(u, g), d = c.mul(d, f), l = p;
+      for (let h = a.sqr(d); p < l && !a.eql(h, a.ONE); p++)
+        h = a.sqr(h);
+      const g = a.pow(f, q << BigInt(l - p - 1));
+      f = a.sqr(g), u = a.mul(u, g), d = a.mul(d, f), l = p;
     }
     return u;
   };
 }
 function _i(e) {
-  if (e % $t === Ii) {
-    const t = (e + q) / $t;
+  if (e % Tt === ki) {
+    const t = (e + q) / Tt;
     return function(r, i) {
       const o = r.pow(i, t);
       if (!r.eql(r.sqr(o), i))
@@ -491,16 +491,16 @@ function _i(e) {
       return o;
     };
   }
-  if (e % An === xn) {
-    const t = (e - xn) / An;
+  if (e % An === Sn) {
+    const t = (e - Sn) / An;
     return function(r, i) {
-      const o = r.mul(i, Be), s = r.pow(o, t), c = r.mul(i, s), a = r.mul(r.mul(c, Be), s), l = r.mul(c, r.sub(a, r.ONE));
+      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));
       if (!r.eql(r.sqr(l), i))
         throw new Error("Cannot find square root");
       return l;
     };
   }
-  return ki(e);
+  return Ii(e);
 }
 const Li = [
   "create",
@@ -531,73 +531,73 @@ function $i(e) {
   return Je(e, n);
 }
 function Ti(e, t, n) {
-  if (n < j)
+  if (n < z)
     throw new Error("Expected power > 0");
-  if (n === j)
+  if (n === z)
     return e.ONE;
   if (n === q)
     return t;
   let r = e.ONE, i = t;
-  for (; n > j; )
+  for (; n > z; )
     n & q && (r = e.mul(r, i)), i = e.sqr(i), n >>= q;
   return r;
 }
 function Ri(e, t) {
-  const n = new Array(t.length), r = t.reduce((o, s, c) => e.is0(s) ? o : (n[c] = o, e.mul(o, s)), e.ONE), i = e.inv(r);
-  return t.reduceRight((o, s, c) => e.is0(s) ? o : (n[c] = e.mul(o, n[c]), e.mul(o, s)), i), n;
+  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 zn(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 = {}) {
-  if (e <= j)
+function Oi(e, t, n = !1, r = {}) {
+  if (e <= z)
     throw new Error(`Expected Field ORDER > 0, got ${e}`);
   const { nBitLength: i, nByteLength: o } = zn(e, t);
   if (o > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const s = _i(e), c = Object.freeze({
+  const s = _i(e), a = Object.freeze({
     ORDER: e,
     BITS: i,
     BYTES: o,
-    MASK: Gt(i),
-    ZERO: j,
+    MASK: Jt(i),
+    ZERO: z,
     ONE: q,
-    create: (a) => V(a, e),
-    isValid: (a) => {
-      if (typeof a != "bigint")
-        throw new Error(`Invalid field element: expected bigint, got ${typeof a}`);
-      return j <= a && a < e;
+    create: (c) => V(c, e),
+    isValid: (c) => {
+      if (typeof c != "bigint")
+        throw new Error(`Invalid field element: expected bigint, got ${typeof c}`);
+      return z <= c && c < e;
     },
-    is0: (a) => a === j,
-    isOdd: (a) => (a & q) === q,
-    neg: (a) => V(-a, e),
-    eql: (a, l) => a === l,
-    sqr: (a) => V(a * a, e),
-    add: (a, l) => V(a + l, e),
-    sub: (a, l) => V(a - l, e),
-    mul: (a, l) => V(a * l, e),
-    pow: (a, l) => Ti(c, a, l),
-    div: (a, l) => V(a * Tt(l, e), e),
+    is0: (c) => c === z,
+    isOdd: (c) => (c & q) === q,
+    neg: (c) => V(-c, e),
+    eql: (c, l) => c === l,
+    sqr: (c) => V(c * c, e),
+    add: (c, l) => V(c + l, e),
+    sub: (c, l) => V(c - l, e),
+    mul: (c, l) => V(c * l, e),
+    pow: (c, l) => Ti(a, c, l),
+    div: (c, l) => V(c * Rt(l, e), e),
     // Same as above, but doesn't normalize
-    sqrN: (a) => a * a,
-    addN: (a, l) => a + l,
-    subN: (a, l) => a - l,
-    mulN: (a, l) => a * l,
-    inv: (a) => Tt(a, e),
-    sqrt: r.sqrt || ((a) => s(c, a)),
-    invertBatch: (a) => Ri(c, a),
+    sqrN: (c) => c * c,
+    addN: (c, l) => c + l,
+    subN: (c, l) => c - l,
+    mulN: (c, l) => c * l,
+    inv: (c) => Rt(c, e),
+    sqrt: r.sqrt || ((c) => s(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: (a, l, f) => f ? l : a,
-    toBytes: (a) => n ? Wt(a, o) : xe(a, o),
-    fromBytes: (a) => {
-      if (a.length !== o)
-        throw new Error(`Fp.fromBytes: expected ${o}, got ${a.length}`);
-      return n ? Ft(a) : G(a);
+    cmov: (c, l, f) => f ? l : c,
+    toBytes: (c) => n ? Gt(c, o) : xe(c, o),
+    fromBytes: (c) => {
+      if (c.length !== o)
+        throw new Error(`Fp.fromBytes: expected ${o}, got ${c.length}`);
+      return n ? Wt(c) : G(c);
     }
   });
-  return Object.freeze(c);
+  return Object.freeze(a);
 }
 function Vn(e) {
   if (typeof e != "bigint")
@@ -609,15 +609,15 @@ function Zn(e) {
   const t = Vn(e);
   return t + Math.ceil(t / 2);
 }
-function Oi(e, t, n = !1) {
+function Pi(e, t, n = !1) {
   const r = e.length, i = Vn(t), o = Zn(t);
   if (r < 16 || r < o || r > 1024)
     throw new Error(`expected ${o}-1024 bytes of input, got ${r}`);
-  const s = n ? G(e) : Ft(e), c = V(s, t - q) + q;
-  return n ? Wt(c, i) : xe(c, i);
+  const s = n ? G(e) : Wt(e), a = V(s, t - q) + q;
+  return n ? Gt(a, i) : xe(a, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Mi = BigInt(0), Bt = BigInt(1);
+const Mi = BigInt(0), Nt = BigInt(1);
 function Hi(e, t) {
   const n = (i, o) => {
     const s = o.negate();
@@ -630,9 +630,9 @@ function Hi(e, t) {
     constTimeNegate: n,
     // non-const time multiplication ladder
     unsafeLadder(i, o) {
-      let s = e.ZERO, c = i;
+      let s = e.ZERO, a = i;
       for (; o > Mi; )
-        o & Bt && (s = s.add(c)), c = c.double(), o >>= Bt;
+        o & Nt && (s = s.add(a)), a = a.double(), o >>= Nt;
       return s;
     },
     /**
@@ -646,15 +646,15 @@ function Hi(e, t) {
      * @returns precomputed point tables flattened to a single array
      */
     precomputeWindow(i, o) {
-      const { windows: s, windowSize: c } = r(o), a = [];
+      const { windows: s, windowSize: a } = r(o), c = [];
       let l = i, f = l;
       for (let u = 0; u < s; u++) {
-        f = l, a.push(f);
-        for (let d = 1; d < c; d++)
-          f = f.add(l), a.push(f);
+        f = l, c.push(f);
+        for (let d = 1; d < a; d++)
+          f = f.add(l), c.push(f);
         l = f.double();
       }
-      return a;
+      return c;
     },
     /**
      * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
@@ -664,22 +664,22 @@ function Hi(e, t) {
      * @returns real and fake (for const-time) points
      */
     wNAF(i, o, s) {
-      const { windows: c, windowSize: a } = r(i);
+      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 < c; g++) {
-        const h = g * a;
+      for (let g = 0; g < a; g++) {
+        const h = g * c;
         let y = Number(s & u);
-        s >>= p, y > a && (y -= d, s += Bt);
-        const w = h, E = h + Math.abs(y) - 1, K = g % 2 !== 0, k = y < 0;
-        y === 0 ? f = f.add(n(K, o[w])) : l = l.add(n(k, o[E]));
+        s >>= p, y > c && (y -= d, s += Nt);
+        const w = h, E = 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[E]));
       }
       return { p: l, f };
     },
-    wNAFCached(i, o, s, c) {
-      const a = i._WINDOW_SIZE || 1;
+    wNAFCached(i, o, s, a) {
+      const c = i._WINDOW_SIZE || 1;
       let l = o.get(i);
-      return l || (l = this.precomputeWindow(i, a), a !== 1 && o.set(i, c(l))), this.wNAF(a, l, s);
+      return l || (l = this.precomputeWindow(i, c), c !== 1 && o.set(i, a(l))), this.wNAF(c, l, s);
     }
   };
 }
@@ -722,7 +722,7 @@ function qi(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
+const { bytesToNumberBE: Di, hexToBytes: ji } = Bi, Ce = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -730,7 +730,7 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
     }
   },
   _parseInt(e) {
-    const { Err: t } = Ne;
+    const { Err: t } = Ce;
     if (e.length < 2 || e[0] !== 2)
       throw new t("Invalid signature integer tag");
     const n = e[1], r = e.subarray(2, n + 2);
@@ -743,7 +743,7 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
     return { d: Di(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = Ne, n = typeof e == "string" ? ji(e) : e;
+    const { Err: t } = Ce, n = typeof e == "string" ? ji(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -751,8 +751,8 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
       throw new t("Invalid signature tag");
     if (n[1] !== r - 2)
       throw new t("Invalid signature: incorrect length");
-    const { d: i, l: o } = Ne._parseInt(n.subarray(2)), { d: s, l: c } = Ne._parseInt(o);
-    if (c.length)
+    const { d: i, l: o } = Ce._parseInt(n.subarray(2)), { d: s, l: a } = Ce._parseInt(o);
+    if (a.length)
       throw new t("Invalid signature: left bytes after parsing");
     return { r: i, s };
   },
@@ -760,17 +760,17 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
     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, c = n(o), a = n(s);
-    return `30${n(s + o + 4)}02${a}${i}02${c}${r}`;
+    }, 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}`;
   }
 }, ce = BigInt(0), Y = BigInt(1);
 BigInt(2);
-const Sn = BigInt(3);
+const Kn = BigInt(3);
 BigInt(4);
 function zi(e) {
   const t = qi(e), { Fp: n } = t, r = t.toBytes || ((g, h, y) => {
     const w = h.toAffine();
-    return Ie(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 };
@@ -784,11 +784,11 @@ function zi(e) {
   function s(g) {
     return typeof g == "bigint" && ce < g && g < t.n;
   }
-  function c(g) {
+  function a(g) {
     if (!s(g))
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
-  function a(g) {
+  function c(g) {
     const { allowedPrivateKeyLengths: h, nByteLength: y, wrapPrivateKey: w, n: E } = t;
     if (h && typeof g != "bigint") {
       if (g instanceof Uint8Array && (g = He(g)), typeof g != "string" || !h.includes(g.length))
@@ -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 = V(K, E)), c(K), K;
+    return w && (K = V(K, E)), a(K), K;
   }
   const l = /* @__PURE__ */ new Map();
   function f(g) {
@@ -854,7 +854,7 @@ function zi(e) {
     }
     // Multiplies generator point by privateKey.
     static fromPrivateKey(h) {
-      return u.BASE.multiply(a(h));
+      return u.BASE.multiply(c(h));
     }
     // "Private method", don't use it directly
     _setWindowSize(h) {
@@ -887,7 +887,7 @@ function zi(e) {
      */
     equals(h) {
       f(h);
-      const { px: y, py: w, pz: E } = this, { px: K, py: k, pz: C } = h, m = n.eql(n.mul(y, C), n.mul(K, E)), x = n.eql(n.mul(w, C), n.mul(k, E));
+      const { px: y, py: w, pz: E } = this, { px: K, py: I, pz: B } = h, m = n.eql(n.mul(y, B), n.mul(K, E)), x = n.eql(n.mul(w, B), n.mul(I, E));
       return m && x;
     }
     /**
@@ -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, Sn), { px: E, py: K, pz: k } = this;
-      let C = n.ZERO, m = n.ZERO, x = n.ZERO, A = n.mul(E, E), O = n.mul(K, K), U = n.mul(k, k), B = n.mul(E, K);
-      return B = n.add(B, B), x = n.mul(E, k), x = n.add(x, x), C = n.mul(h, x), m = n.mul(w, U), m = n.add(C, m), C = n.sub(O, m), m = n.add(O, m), m = n.mul(C, m), C = n.mul(B, C), x = n.mul(w, x), U = n.mul(h, U), B = n.sub(A, U), B = n.mul(h, B), B = n.add(B, x), x = n.add(A, A), A = n.add(x, A), A = n.add(A, U), A = n.mul(A, B), m = n.add(m, A), U = n.mul(K, k), U = n.add(U, U), A = n.mul(U, B), C = n.sub(C, A), x = n.mul(U, O), x = n.add(x, x), x = n.add(x, x), new u(C, m, x);
+      const { a: h, b: y } = t, w = n.mul(y, Kn), { px: E, py: K, pz: I } = this;
+      let B = 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), B = n.mul(h, x), m = n.mul(w, U), m = n.add(B, m), B = n.sub(P, m), m = n.add(P, m), m = n.mul(B, m), B = n.mul(N, B), 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), B = n.sub(B, S), x = n.mul(U, P), x = n.add(x, x), x = n.add(x, x), new u(B, m, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function zi(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: y, py: w, pz: E } = this, { px: K, py: k, pz: C } = h;
-      let m = n.ZERO, x = n.ZERO, A = n.ZERO;
-      const O = t.a, U = n.mul(t.b, Sn);
-      let B = n.mul(y, K), T = n.mul(w, k), R = n.mul(E, C), H = n.add(y, w), b = n.add(K, k);
-      H = n.mul(H, b), b = n.add(B, T), 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(B, R), b = n.sub(b, v), v = n.add(w, E), m = n.add(k, C), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), A = n.mul(O, b), m = n.mul(U, R), A = n.add(m, A), m = n.sub(T, A), A = n.add(T, A), x = n.mul(m, A), T = n.add(B, B), T = n.add(T, B), R = n.mul(O, R), b = n.mul(U, b), T = n.add(T, R), R = n.sub(B, R), R = n.mul(O, R), b = n.add(b, R), B = n.mul(T, b), x = n.add(x, B), B = n.mul(v, b), m = n.mul(H, m), m = n.sub(m, B), B = n.mul(H, T), A = n.mul(v, A), A = n.add(A, B), new u(m, x, A);
+      const { px: y, py: w, pz: E } = this, { px: K, py: I, pz: B } = h;
+      let m = n.ZERO, x = n.ZERO, S = n.ZERO;
+      const P = t.a, U = n.mul(t.b, Kn);
+      let N = n.mul(y, K), T = n.mul(w, I), R = n.mul(E, B), H = n.add(y, w), b = n.add(K, I);
+      H = n.mul(H, b), b = n.add(N, T), H = n.sub(H, b), b = n.add(y, E);
+      let v = n.add(K, B);
+      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, B), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), S = n.mul(P, b), m = n.mul(U, R), S = n.add(m, S), m = n.sub(T, S), S = n.add(T, S), x = n.mul(m, S), T = n.add(N, N), T = n.add(T, N), R = n.mul(P, R), b = n.mul(U, b), T = n.add(T, R), R = n.sub(N, R), R = n.mul(P, R), b = n.add(b, R), N = n.mul(T, 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, T), S = n.mul(v, S), S = n.add(S, N), new u(m, x, S);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -940,15 +940,15 @@ function zi(e) {
       const y = u.ZERO;
       if (h === ce)
         return y;
-      if (c(h), h === Y)
+      if (a(h), h === Y)
         return this;
       const { endo: w } = t;
       if (!w)
         return p.unsafeLadder(this, h);
-      let { k1neg: E, k1: K, k2neg: k, k2: C } = w.splitScalar(h), m = y, x = y, A = this;
-      for (; K > ce || C > ce; )
-        K & Y && (m = m.add(A)), C & Y && (x = x.add(A)), A = A.double(), K >>= Y, C >>= Y;
-      return E && (m = m.negate()), k && (x = x.negate()), x = new u(n.mul(x.px, w.beta), x.py, x.pz), m.add(x);
+      let { k1neg: E, k1: K, k2neg: I, k2: B } = w.splitScalar(h), m = y, x = y, S = this;
+      for (; K > ce || B > ce; )
+        K & Y && (m = m.add(S)), B & Y && (x = x.add(S)), S = S.double(), K >>= Y, B >>= 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.
@@ -960,16 +960,16 @@ function zi(e) {
      * @returns New point
      */
     multiply(h) {
-      c(h);
+      a(h);
       let y = h, w, E;
       const { endo: K } = t;
       if (K) {
-        const { k1neg: k, k1: C, k2neg: m, k2: x } = K.splitScalar(y);
-        let { p: A, f: O } = this.wNAF(C), { p: U, f: B } = this.wNAF(x);
-        A = p.constTimeNegate(k, A), U = p.constTimeNegate(m, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), w = A.add(U), E = O.add(B);
+        const { k1neg: I, k1: B, k2neg: m, k2: x } = K.splitScalar(y);
+        let { p: S, f: P } = this.wNAF(B), { 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: k, f: C } = this.wNAF(y);
-        w = k, E = C;
+        const { p: I, f: B } = this.wNAF(y);
+        w = I, E = B;
       }
       return u.normalizeZ([w, E])[0];
     }
@@ -980,8 +980,8 @@ function zi(e) {
      * @returns non-zero affine point
      */
     multiplyAndAddUnsafe(h, y, w) {
-      const E = u.BASE, K = (C, m) => m === ce || m === Y || !C.equals(E) ? C.multiplyUnsafe(m) : C.multiply(m), k = K(this, y).add(K(h, w));
-      return k.is0() ? void 0 : k;
+      const E = u.BASE, K = (B, m) => m === ce || m === Y || !B.equals(E) ? B.multiplyUnsafe(m) : B.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.
@@ -989,12 +989,12 @@ function zi(e) {
     toAffine(h) {
       const { px: y, py: w, pz: E } = this, K = this.is0();
       h == null && (h = K ? n.ONE : n.inv(E));
-      const k = n.mul(y, h), C = n.mul(w, h), m = n.mul(E, h);
+      const I = n.mul(y, h), B = n.mul(w, h), m = n.mul(E, h);
       if (K)
         return { x: n.ZERO, y: n.ZERO };
       if (!n.eql(m, n.ONE))
         throw new Error("invZ was invalid");
-      return { x: k, y: C };
+      return { x: I, y: B };
     }
     isTorsionFree() {
       const { h, isTorsionFree: y } = t;
@@ -1020,7 +1020,7 @@ function zi(e) {
   return {
     CURVE: t,
     ProjectivePoint: u,
-    normPrivateKeyToScalar: a,
+    normPrivateKeyToScalar: c,
     weierstrassEquation: o,
     isWithinCurveOrder: s
   };
@@ -1042,31 +1042,31 @@ function Zi(e) {
   function s(b) {
     return ce < b && b < n.ORDER;
   }
-  function c(b) {
+  function a(b) {
     return V(b, r);
   }
-  function a(b) {
-    return Tt(b, r);
+  function c(b) {
+    return Rt(b, r);
   }
   const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: d } = zi({
     ...t,
-    toBytes(b, v, S) {
-      const I = v.toAffine(), N = n.toBytes(I.x), _ = Ie;
-      return S ? _(Uint8Array.from([v.hasEvenY() ? 2 : 3]), N) : _(Uint8Array.from([4]), N, n.toBytes(I.y));
+    toBytes(b, v, A) {
+      const k = v.toAffine(), C = n.toBytes(k.x), _ = ke;
+      return A ? _(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : _(Uint8Array.from([4]), C, n.toBytes(k.y));
     },
     fromBytes(b) {
-      const v = b.length, S = b[0], I = b.subarray(1);
-      if (v === i && (S === 2 || S === 3)) {
-        const N = G(I);
-        if (!s(N))
+      const v = b.length, A = b[0], k = b.subarray(1);
+      if (v === i && (A === 2 || A === 3)) {
+        const C = G(k);
+        if (!s(C))
           throw new Error("Point is not on curve");
-        const _ = u(N);
-        let P = n.sqrt(_);
-        const $ = (P & Y) === Y;
-        return (S & 1) === 1 !== $ && (P = n.neg(P)), { x: N, y: P };
-      } else if (v === o && S === 4) {
-        const N = n.fromBytes(I.subarray(0, n.BYTES)), _ = n.fromBytes(I.subarray(n.BYTES, 2 * n.BYTES));
-        return { x: N, y: _ };
+        const _ = u(C);
+        let O = n.sqrt(_);
+        const $ = (O & Y) === Y;
+        return (A & 1) === 1 !== $ && (O = n.neg(O)), { x: C, y: O };
+      } else if (v === o && A === 4) {
+        const C = n.fromBytes(k.subarray(0, n.BYTES)), _ = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
+        return { x: C, y: _ };
       } else
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${o} uncompressed bytes`);
     }
@@ -1076,23 +1076,23 @@ function Zi(e) {
     return b > v;
   }
   function h(b) {
-    return g(b) ? c(-b) : b;
+    return g(b) ? a(-b) : b;
   }
-  const y = (b, v, S) => G(b.slice(v, S));
+  const y = (b, v, A) => G(b.slice(v, A));
   class w {
-    constructor(v, S, I) {
-      this.r = v, this.s = S, this.recovery = I, 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) {
-      const S = t.nByteLength;
-      return v = Z("compactSignature", v, S * 2), new w(y(v, 0, S), y(v, S, 2 * S));
+      const A = t.nByteLength;
+      return v = Z("compactSignature", v, A * 2), new w(y(v, 0, A), y(v, A, 2 * A));
     }
     // 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: S, s: I } = Ne.toSig(Z("DER", v));
-      return new w(S, I);
+      const { r: A, s: k } = Ce.toSig(Z("DER", v));
+      return new w(A, k);
     }
     assertValidity() {
       if (!d(this.r))
@@ -1104,13 +1104,13 @@ function Zi(e) {
       return new w(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: S, s: I, recovery: N } = this, _ = x(Z("msgHash", v));
-      if (N == null || ![0, 1, 2, 3].includes(N))
+      const { r: A, s: k, recovery: C } = this, _ = x(Z("msgHash", v));
+      if (C == null || ![0, 1, 2, 3].includes(C))
         throw new Error("recovery id invalid");
-      const P = N === 2 || N === 3 ? S + t.n : S;
-      if (P >= n.ORDER)
+      const O = C === 2 || C === 3 ? A + t.n : A;
+      if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const $ = N & 1 ? "03" : "02", X = l.fromHex($ + p(P)), ye = a(P), ke = c(-_ * ye), ze = c(I * ye), pe = l.BASE.multiplyAndAddUnsafe(X, ke, ze);
+      const $ = C & 1 ? "03" : "02", X = l.fromHex($ + 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;
@@ -1120,14 +1120,14 @@ function Zi(e) {
       return g(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new w(this.r, c(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new w(this.r, a(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
       return qe(this.toDERHex());
     }
     toDERHex() {
-      return Ne.hexFromSig({ r: this.r, s: this.s });
+      return Ce.hexFromSig({ r: this.r, s: this.s });
     }
     // padded bytes of r, then padded bytes of s
     toCompactRawBytes() {
@@ -1152,7 +1152,7 @@ function Zi(e) {
      */
     randomPrivateKey: () => {
       const b = Zn(t.n);
-      return Oi(t.randomBytes(b), t.n);
+      return Pi(t.randomBytes(b), t.n);
     },
     /**
      * Creates precompute table for an arbitrary EC point. Makes point "cached".
@@ -1169,85 +1169,85 @@ function Zi(e) {
   function K(b, v = !0) {
     return l.fromPrivateKey(b).toRawBytes(v);
   }
-  function k(b) {
-    const v = b instanceof Uint8Array, S = typeof b == "string", I = (v || S) && b.length;
-    return v ? I === i || I === o : S ? I === 2 * i || I === 2 * o : b instanceof l;
+  function I(b) {
+    const v = b instanceof Uint8Array, A = typeof b == "string", k = (v || A) && b.length;
+    return v ? k === i || k === o : A ? k === 2 * i || k === 2 * o : b instanceof l;
   }
-  function C(b, v, S = !0) {
-    if (k(b))
+  function B(b, v, A = !0) {
+    if (I(b))
       throw new Error("first arg must be private key");
-    if (!k(v))
+    if (!I(v))
       throw new Error("second arg must be public key");
-    return l.fromHex(v).multiply(f(b)).toRawBytes(S);
+    return l.fromHex(v).multiply(f(b)).toRawBytes(A);
   }
   const m = t.bits2int || function(b) {
-    const v = G(b), S = b.length * 8 - t.nBitLength;
-    return S > 0 ? v >> BigInt(S) : v;
+    const v = G(b), A = b.length * 8 - t.nBitLength;
+    return A > 0 ? v >> BigInt(A) : v;
   }, x = t.bits2int_modN || function(b) {
-    return c(m(b));
-  }, A = Gt(t.nBitLength);
-  function O(b) {
+    return a(m(b));
+  }, S = Jt(t.nBitLength);
+  function P(b) {
     if (typeof b != "bigint")
       throw new Error("bigint expected");
-    if (!(ce <= b && b < A))
+    if (!(ce <= b && b < S))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
     return xe(b, t.nByteLength);
   }
-  function U(b, v, S = B) {
-    if (["recovered", "canonical"].some((Ke) => Ke in S))
+  function U(b, v, A = N) {
+    if (["recovered", "canonical"].some((Ke) => Ke in A))
       throw new Error("sign() legacy options not supported");
-    const { hash: I, randomBytes: N } = t;
-    let { lowS: _, prehash: P, extraEntropy: $ } = S;
-    _ == null && (_ = !0), b = Z("msgHash", b), P && (b = Z("prehashed msgHash", I(b)));
-    const X = x(b), ye = f(v), ke = [O(ye), O(X)];
+    const { hash: k, randomBytes: C } = t;
+    let { lowS: _, prehash: O, extraEntropy: $ } = A;
+    _ == 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 ($ != null) {
-      const Ke = $ === !0 ? N(n.BYTES) : $;
-      ke.push(Z("extraEntropy", Ke));
+      const Ke = $ === !0 ? C(n.BYTES) : $;
+      Ie.push(Z("extraEntropy", Ke));
     }
-    const ze = Ie(...ke), pe = X;
+    const ze = ke(...Ie), pe = X;
     function xt(Ke) {
       const _e = m(Ke);
       if (!d(_e))
         return;
-      const wn = a(_e), Le = l.BASE.multiply(_e).toAffine(), Q = c(Le.x);
+      const bn = c(_e), Le = l.BASE.multiply(_e).toAffine(), Q = a(Le.x);
       if (Q === ce)
         return;
-      const $e = c(wn * c(pe + Q * ye));
+      const $e = a(bn * a(pe + Q * ye));
       if ($e === ce)
         return;
-      let bn = (Le.x === Q ? 0 : 2) | Number(Le.y & Y), vn = $e;
-      return _ && g($e) && (vn = h($e), bn ^= 1), new w(Q, vn, bn);
+      let vn = (Le.x === Q ? 0 : 2) | Number(Le.y & Y), mn = $e;
+      return _ && g($e) && (mn = h($e), vn ^= 1), new w(Q, mn, vn);
     }
     return { seed: ze, k2sig: xt };
   }
-  const B = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
-  function R(b, v, S = B) {
-    const { seed: I, k2sig: N } = U(b, v, S), _ = t;
-    return jn(_.hash.outputLen, _.nByteLength, _.hmac)(I, N);
+  const N = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
+  function R(b, v, A = N) {
+    const { seed: k, k2sig: C } = U(b, v, A), _ = t;
+    return jn(_.hash.outputLen, _.nByteLength, _.hmac)(k, C);
   }
   l.BASE._setWindowSize(8);
-  function H(b, v, S, I = T) {
+  function H(b, v, A, k = T) {
     var Le;
-    const N = b;
-    if (v = Z("msgHash", v), S = Z("publicKey", S), "strict" in I)
+    const C = 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: P } = I;
+    const { lowS: _, prehash: O } = k;
     let $, X;
     try {
-      if (typeof N == "string" || N instanceof Uint8Array)
+      if (typeof C == "string" || C instanceof Uint8Array)
         try {
-          $ = w.fromDER(N);
+          $ = w.fromDER(C);
         } catch (Q) {
-          if (!(Q instanceof Ne.Err))
+          if (!(Q instanceof Ce.Err))
             throw Q;
-          $ = w.fromCompact(N);
+          $ = w.fromCompact(C);
         }
-      else if (typeof N == "object" && typeof N.r == "bigint" && typeof N.s == "bigint") {
-        const { r: Q, s: $e } = N;
+      else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
+        const { r: Q, s: $e } = C;
         $ = new w(Q, $e);
       } else
         throw new Error("PARSE");
-      X = l.fromHex(S);
+      X = l.fromHex(A);
     } catch (Q) {
       if (Q.message === "PARSE")
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
@@ -1255,14 +1255,14 @@ function Zi(e) {
     }
     if (_ && $.hasHighS())
       return !1;
-    P && (v = t.hash(v));
-    const { r: ye, s: ke } = $, ze = x(v), pe = a(ke), xt = c(ze * pe), Ke = c(ye * pe), _e = (Le = l.BASE.multiplyAndAddUnsafe(X, xt, Ke)) == null ? void 0 : Le.toAffine();
-    return _e ? c(_e.x) === ye : !1;
+    O && (v = t.hash(v));
+    const { r: ye, s: Ie } = $, 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: C,
+    getSharedSecret: B,
     sign: R,
     verify: H,
     ProjectivePoint: l,
@@ -1273,7 +1273,7 @@ function Zi(e) {
 let Wn = class extends Mn {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, ai(t);
-    const r = Vt(n);
+    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;
@@ -1290,7 +1290,7 @@ let Wn = class extends Mn {
     return rt(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();
+    rt(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,8 +1298,8 @@ let Wn = class extends Mn {
   }
   _cloneInto(t) {
     t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: n, iHash: r, finished: i, destroyed: o, blockLen: s, outputLen: c } = this;
-    return t = t, t.finished = i, t.destroyed = o, t.blockLen = s, t.outputLen = c, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
+    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;
   }
   destroy() {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
@@ -1320,17 +1320,17 @@ function Wi(e, t) {
   return Object.freeze({ ...n(t), create: n });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const ft = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), it = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), ot = BigInt(2), Kn = (e, t) => (e + t / ot) / t;
+const ft = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), it = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), ot = BigInt(2), Nn = (e, t) => (e + t / ot) / t;
 function Yn(e) {
-  const t = ft, n = BigInt(3), r = BigInt(6), i = BigInt(11), o = BigInt(22), s = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, 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, c, t) * h % t, w = J(y, a, t) * y % t, E = J(w, c, t) * h % t, K = J(E, n, t) * f % t, k = J(K, s, t) * g % t, C = J(k, r, t) * l % t, m = J(C, ot, t);
-  if (!Rt.eql(Rt.sqr(m), 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, E = J(w, a, t) * h % t, K = J(E, n, t) * f % t, I = J(K, s, t) * g % t, B = J(I, r, t) * l % t, m = J(B, ot, t);
+  if (!Ot.eql(Ot.sqr(m), e))
     throw new Error("Cannot find square root");
   return m;
 }
-const Rt = Pi(ft, void 0, void 0, { sqrt: Yn }), Ue = Wi({
+const Ot = Oi(ft, void 0, void 0, { sqrt: Yn }), Ue = Wi({
   a: BigInt(0),
   b: BigInt(7),
-  Fp: Rt,
+  Fp: Ot,
   n: it,
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
@@ -1346,48 +1346,48 @@ const Rt = Pi(ft, void 0, void 0, { sqrt: Yn }), Ue = Wi({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
-      const t = it, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Jn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), o = n, s = BigInt("0x100000000000000000000000000000000"), c = Kn(o * e, t), a = Kn(-r * e, t);
-      let l = V(e - c * n - a * i, t), f = V(-c * r - a * o, t);
+      const t = it, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Jn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), o = n, s = BigInt("0x100000000000000000000000000000000"), a = Nn(o * e, t), c = Nn(-r * e, t);
+      let l = V(e - a * n - c * i, t), f = V(-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)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
       return { k1neg: u, k1: l, k2neg: d, k2: f };
     }
   }
-}, Lt), ht = BigInt(0), Xn = (e) => typeof e == "bigint" && ht < e && e < ft, Gi = (e) => typeof e == "bigint" && ht < e && e < it, Bn = {};
+}, $t), ht = BigInt(0), Xn = (e) => typeof e == "bigint" && ht < e && e < ft, Gi = (e) => typeof e == "bigint" && ht < e && e < it, Cn = {};
 function st(e, ...t) {
-  let n = Bn[e];
+  let n = Cn[e];
   if (n === void 0) {
-    const r = Lt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = Ie(r, r), Bn[e] = n;
+    const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    n = ke(r, r), Cn[e] = n;
   }
-  return Lt(Ie(n, ...t));
+  return $t(ke(n, ...t));
 }
-const Jt = (e) => e.toRawBytes(!0).slice(1), Pt = (e) => xe(e, 32), Nt = (e) => V(e, ft), We = (e) => V(e, it), Yt = Ue.ProjectivePoint, Ji = (e, t, n) => Yt.BASE.multiplyAndAddUnsafe(e, t, n);
-function Ot(e) {
-  let t = Ue.utils.normPrivateKeyToScalar(e), n = Yt.fromPrivateKey(t);
-  return { scalar: n.hasEvenY() ? t : We(-t), bytes: Jt(n) };
+const Yt = (e) => e.toRawBytes(!0).slice(1), Pt = (e) => xe(e, 32), Ct = (e) => V(e, ft), We = (e) => V(e, it), 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 Qn(e) {
   if (!Xn(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = Nt(e * e), n = Nt(t * e + BigInt(7));
+  const t = Ct(e * e), n = Ct(t * e + BigInt(7));
   let r = Yn(n);
-  r % ot !== ht && (r = Nt(-r));
-  const i = new Yt(e, r, Jn);
+  r % ot !== ht && (r = Ct(-r));
+  const i = new Xt(e, r, Jn);
   return i.assertValidity(), i;
 }
 function er(...e) {
   return We(G(st("BIP0340/challenge", ...e)));
 }
 function Yi(e) {
-  return Ot(e).bytes;
+  return Mt(e).bytes;
 }
 function Xi(e, t, n = Hn(32)) {
-  const r = Z("message", e), { bytes: i, scalar: o } = Ot(t), s = Z("auxRand", n, 32), c = Pt(o ^ G(st("BIP0340/aux", s))), a = st("BIP0340/nonce", c, i, r), l = We(G(a));
+  const r = Z("message", e), { bytes: i, scalar: o } = Mt(t), s = Z("auxRand", n, 32), a = Pt(o ^ G(st("BIP0340/aux", s))), c = st("BIP0340/nonce", a, i, r), l = We(G(c));
   if (l === ht)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Ot(l), d = er(f, i, r), p = new Uint8Array(64);
+  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 * o)), 32), !tr(p, r, i))
     throw new Error("sign: Invalid signature produced");
   return p;
@@ -1395,14 +1395,14 @@ function Xi(e, t, n = Hn(32)) {
 function tr(e, t, n) {
   const r = Z("signature", e, 64), i = Z("message", t), o = Z("publicKey", n, 32);
   try {
-    const s = Qn(G(o)), c = G(r.subarray(0, 32));
-    if (!Xn(c))
+    const s = Qn(G(o)), a = G(r.subarray(0, 32));
+    if (!Xn(a))
       return !1;
-    const a = G(r.subarray(32, 64));
-    if (!Gi(a))
+    const c = G(r.subarray(32, 64));
+    if (!Gi(c))
       return !1;
-    const l = er(Pt(c), Jt(s), i), f = Ji(s, a, We(-l));
-    return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
+    const l = er(Pt(a), Yt(s), i), f = Ji(s, c, We(-l));
+    return !(!f || !f.hasEvenY() || f.toAffine().x !== a);
   } catch {
     return !1;
   }
@@ -1414,20 +1414,20 @@ const Ve = {
   utils: {
     randomPrivateKey: Ue.utils.randomPrivateKey,
     lift_x: Qn,
-    pointToBytes: Jt,
+    pointToBytes: Yt,
     numberToBytesBE: xe,
     bytesToNumberBE: G,
     taggedHash: st,
     mod: V
   }
-}, Ct = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+}, Bt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Xt = (e) => e instanceof Uint8Array, It = (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;
+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 eo = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function M(e) {
-  if (!Xt(e))
+  if (!Qt(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
@@ -1455,7 +1455,7 @@ function to(e) {
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Ge(e) {
-  if (typeof e == "string" && (e = to(e)), !Xt(e))
+  if (typeof e == "string" && (e = to(e)), !Qt(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -1463,7 +1463,7 @@ function dt(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!Xt(r))
+    if (!Qt(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
@@ -1479,11 +1479,11 @@ function rr(e) {
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function ir(e = 32) {
-  if (Ct && typeof Ct.getRandomValues == "function")
-    return Ct.getRandomValues(new Uint8Array(e));
+  if (Bt && typeof Bt.getRandomValues == "function")
+    return Bt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Mt(e) {
+function Ht(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -1500,7 +1500,7 @@ function or(e, ...t) {
 function ro(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Mt(e.outputLen), Mt(e.blockLen);
+  Ht(e.outputLen), Ht(e.blockLen);
 }
 function io(e, t = !0) {
   if (e.destroyed)
@@ -1515,7 +1515,7 @@ function oo(e, t) {
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const oe = {
-  number: Mt,
+  number: Ht,
   bool: no,
   bytes: or,
   hash: ro,
@@ -1525,12 +1525,12 @@ const oe = {
 function so(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), c = Number(n & o), a = r ? 4 : 0, l = r ? 0 : 4;
-  e.setUint32(t + a, s, r), e.setUint32(t + l, c, 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);
 }
 class ao 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 = It(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);
@@ -1538,14 +1538,14 @@ class ao extends nr {
     t = Ge(t);
     const o = t.length;
     for (let s = 0; s < o; ) {
-      const c = Math.min(i - this.pos, o - s);
-      if (c === i) {
-        const a = It(t);
+      const a = Math.min(i - this.pos, o - s);
+      if (a === i) {
+        const c = kt(t);
         for (; i <= o - s; s += i)
-          this.process(a, s);
+          this.process(c, s);
         continue;
       }
-      r.set(t.subarray(s, s + c), this.pos), this.pos += c, s += c, this.pos === i && (this.process(n, 0), this.pos = 0);
+      r.set(t.subarray(s, s + a), this.pos), this.pos += a, s += a, this.pos === i && (this.process(n, 0), this.pos = 0);
     }
     return this.length += t.length, this.roundClean(), this;
   }
@@ -1557,14 +1557,14 @@ class ao extends nr {
     for (let u = s; u < i; u++)
       n[u] = 0;
     so(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const c = It(t), a = this.outputLen;
-    if (a % 4)
+    const a = kt(t), c = this.outputLen;
+    if (c % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const l = a / 4, f = this.get();
+    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++)
-      c.setUint32(4 * u, f[u], o);
+      a.setUint32(4 * u, f[u], o);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -1574,8 +1574,8 @@ class ao extends nr {
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: r, length: i, finished: o, destroyed: s, pos: c } = this;
-    return t.length = i, t.pos = c, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
+    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 co = (e, t, n) => e & t ^ ~e & n, lo = (e, t, n) => e & t ^ e & n ^ t & n, uo = new Uint32Array([
@@ -1658,12 +1658,12 @@ class sr extends ao {
     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: c, H: a } = this;
-    return [t, n, r, i, o, s, c, a];
+    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];
   }
   // prettier-ignore
-  set(t, n, r, i, o, s, c, a) {
-    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 = c | 0, this.H = a | 0;
+  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;
   }
   process(t, n) {
     for (let u = 0; u < 16; u++, n += 4)
@@ -1672,12 +1672,12 @@ class sr extends ao {
       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: c, F: a, G: l, H: f } = this;
+    let { A: r, B: i, C: o, D: s, E: a, F: c, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const d = re(c, 6) ^ re(c, 11) ^ re(c, 25), p = f + d + co(c, a, l) + uo[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + lo(r, i, o) | 0;
-      f = l, l = a, a = c, c = 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 + co(a, c, l) + uo[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + lo(r, i, o) | 0;
+      f = l, l = c, c = a, a = s + p | 0, s = o, o = 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, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, c, a, l, f);
+    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);
   }
   roundClean() {
     ve.fill(0);
@@ -1691,7 +1691,7 @@ class fo extends sr {
     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 Ae = rr(() => new sr());
+const Se = rr(() => new sr());
 rr(() => new fo());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function je(e) {
@@ -1781,7 +1781,7 @@ function ar(e) {
     throw new Error("normalize fn should be function");
   return { encode: (t) => t, decode: (t) => e(t) };
 }
-function Nn(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)
@@ -1796,18 +1796,18 @@ function Nn(e, t, n) {
     if (je(s), s < 0 || s >= t)
       throw new Error(`Wrong integer: ${s}`);
   }); ; ) {
-    let s = 0, c = !0;
-    for (let a = r; a < o.length; a++) {
-      const l = o[a], f = t * s + l;
+    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)
         throw new Error("convertRadix: carry overflow");
-      if (s = f % n, o[a] = Math.floor(f / n), !Number.isSafeInteger(o[a]) || o[a] * n + s !== f)
+      if (s = f % n, o[c] = Math.floor(f / n), !Number.isSafeInteger(o[c]) || o[c] * n + s !== f)
         throw new Error("convertRadix: carry overflow");
-      if (c)
-        o[a] ? c = !1 : r = a;
+      if (a)
+        o[c] ? a = !1 : r = c;
       else continue;
     }
-    if (i.push(s), c)
+    if (i.push(s), a)
       break;
   }
   for (let s = 0; s < e.length - 1 && e[s] === 0; s++)
@@ -1815,7 +1815,7 @@ function Nn(e, t, n) {
   return i.reverse();
 }
 const cr = (e, t) => t ? cr(t, e % t) : e, at = (e, t) => e + (t - cr(e, t));
-function Ht(e, t, n, r) {
+function qt(e, t, n, r) {
   if (!Array.isArray(e))
     throw new Error("convertRadix2: data should be array");
   if (t <= 0 || t > 32)
@@ -1825,37 +1825,37 @@ function Ht(e, t, n, r) {
   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, c = [];
-  for (const a of e) {
-    if (je(a), a >= 2 ** t)
-      throw new Error(`convertRadix2: invalid data word=${a} from=${t}`);
-    if (i = i << t | a, o + t > 32)
+  const s = 2 ** n - 1, a = [];
+  for (const c of e) {
+    if (je(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)
-      c.push((i >> o - n & s) >>> 0);
+      a.push((i >> o - n & s) >>> 0);
     i &= 2 ** o - 1;
   }
   if (i = i << n - o & s, !r && o >= t)
     throw new Error("Excess padding");
   if (!r && i)
     throw new Error(`Non-zero padding: ${i}`);
-  return r && o > 0 && c.push(i >>> 0), c;
+  return r && o > 0 && a.push(i >>> 0), a;
 }
 function ho(e) {
   return je(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
-      return Nn(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(Nn(t, e, 2 ** 8));
+      return Uint8Array.from(Bn(t, e, 2 ** 8));
     }
   };
 }
-function Se(e, t = !1) {
+function Ae(e, t = !1) {
   if (je(e), e <= 0 || e > 32)
     throw new Error("radix2: bits should be in (0..32]");
   if (at(8, e) > 32 || at(e, 8) > 32)
@@ -1864,16 +1864,16 @@ function Se(e, t = !1) {
     encode: (n) => {
       if (!(n instanceof Uint8Array))
         throw new Error("radix2.encode input should be Uint8Array");
-      return Ht(Array.from(n), 8, e, !t);
+      return qt(Array.from(n), 8, e, !t);
     },
     decode: (n) => {
       if (!Array.isArray(n) || n.length && typeof n[0] != "number")
         throw new Error("radix2.decode input should be array of strings");
-      return Uint8Array.from(Ht(n, e, 8, t));
+      return Uint8Array.from(qt(n, e, 8, t));
     }
   };
 }
-function Cn(e) {
+function kn(e) {
   if (typeof e != "function")
     throw new Error("unsafeWrapper fn should be function");
   return function(...t) {
@@ -1883,25 +1883,25 @@ function Cn(e) {
     }
   };
 }
-const yo = fe(Se(4), he("0123456789ABCDEF"), de("")), po = fe(Se(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), yt(5), de(""));
-fe(Se(5), he("0123456789ABCDEFGHIJKLMNOPQRSTUV"), yt(5), de(""));
-fe(Se(5), he("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), de(""), ar((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const ue = fe(Se(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), yt(6), de("")), go = fe(Se(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), yt(6), de("")), Qt = (e) => fe(ho(58), he(e), de("")), qt = Qt("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-Qt("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
-Qt("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
-const In = [0, 2, 3, 5, 6, 7, 9, 10, 11], wo = {
+const yo = fe(Ae(4), he("0123456789ABCDEF"), de("")), po = fe(Ae(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), yt(5), de(""));
+fe(Ae(5), he("0123456789ABCDEFGHIJKLMNOPQRSTUV"), yt(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+/"), yt(6), de("")), go = fe(Ae(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), yt(6), de("")), en = (e) => fe(ho(58), he(e), de("")), Dt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
+en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
+const Un = [0, 2, 3, 5, 6, 7, 9, 10, 11], wo = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
       const r = e.subarray(n, n + 8);
-      t += qt.encode(r).padStart(In[r.length], "1");
+      t += Dt.encode(r).padStart(Un[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 = In.indexOf(r.length), o = qt.decode(r);
+      const r = e.slice(n, n + 11), i = Un.indexOf(r.length), o = Dt.decode(r);
       for (let s = 0; s < o.length - i; s++)
         if (o[s] !== 0)
           throw new Error("base58xmr: wrong padding");
@@ -1909,15 +1909,15 @@ const In = [0, 2, 3, 5, 6, 7, 9, 10, 11], wo = {
     }
     return Uint8Array.from(t);
   }
-}, Dt = fe(he("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), de("")), Un = [996825010, 642813549, 513874426, 1027748829, 705979059];
+}, jt = fe(he("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), de("")), In = [996825010, 642813549, 513874426, 1027748829, 705979059];
 function Ze(e) {
   const t = e >> 25;
   let n = (e & 33554431) << 5;
-  for (let r = 0; r < Un.length; r++)
-    (t >> r & 1) === 1 && (n ^= Un[r]);
+  for (let r = 0; r < In.length; r++)
+    (t >> r & 1) === 1 && (n ^= In[r]);
   return n;
 }
-function kn(e, t, n = 1) {
+function _n(e, t, n = 1) {
   const r = e.length;
   let i = 1;
   for (let o = 0; o < r; o++) {
@@ -1933,10 +1933,10 @@ function kn(e, t, n = 1) {
     i = Ze(i) ^ o;
   for (let o = 0; o < 6; o++)
     i = Ze(i);
-  return i ^= n, Dt.encode(Ht([i % 2 ** 30], 30, 5, !1));
+  return i ^= n, jt.encode(qt([i % 2 ** 30], 30, 5, !1));
 }
 function lr(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, o = Cn(r);
+  const t = e === "bech32" ? 1 : 734539939, n = Ae(5), r = n.decode, i = n.encode, o = kn(r);
   function s(f, u, d = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
@@ -1945,9 +1945,9 @@ function lr(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${Dt.encode(u)}${kn(f, u, t)}`;
+    return f = f.toLowerCase(), `${f}1${jt.encode(u)}${_n(f, u, t)}`;
   }
-  function c(f, u = 90) {
+  function a(f, u = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.decode input should be string, not ${typeof f}`);
     if (f.length < 8 || u !== !1 && f.length > u)
@@ -1962,24 +1962,24 @@ function lr(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 = Dt.decode(h).slice(0, -6), w = kn(g, y, t);
+    const y = jt.decode(h).slice(0, -6), w = _n(g, y, t);
     if (!h.endsWith(w))
       throw new Error(`Invalid checksum in ${f}: expected "${w}"`);
     return { prefix: g, words: y };
   }
-  const a = Cn(c);
+  const c = kn(a);
   function l(f) {
-    const { prefix: u, words: d } = c(f, !1);
+    const { prefix: u, words: d } = a(f, !1);
     return { prefix: u, words: d, bytes: r(d) };
   }
-  return { encode: s, decode: c, decodeToBytes: l, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: o, toWords: i };
+  return { encode: s, decode: a, decodeToBytes: l, decodeUnsafe: c, fromWords: r, fromWordsUnsafe: o, toWords: i };
 }
 const De = lr("bech32");
 lr("bech32m");
 const bo = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, vo = fe(Se(4), he("0123456789abcdef"), de(""), ar((e) => {
+}, vo = 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();
@@ -1990,7 +1990,7 @@ const bo = {
   base32: po,
   base64: ue,
   base64url: go,
-  base58: qt,
+  base58: Dt,
   base58xmr: wo
 };
 `${Object.keys(mo).join(", ")}`;
@@ -1998,7 +1998,7 @@ function Ut(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
-function _n(e) {
+function Ln(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
@@ -2015,12 +2015,12 @@ function le(e, ...t) {
 const F = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), xo = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!xo)
   throw new Error("Non little-endian hardware is not supported");
-function Ao(e, t) {
+function So(e, t) {
   if (t == null || typeof t != "object")
     throw new Error("options must be defined");
   return Object.assign(e, t);
 }
-function So(e, t) {
+function Ao(e, t) {
   if (e.length !== t.length)
     return !1;
   let n = 0;
@@ -2028,19 +2028,19 @@ function So(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Ko = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ee = 16, Bo = 283;
-function en(e) {
-  return e << 1 ^ Bo & -(e >> 7);
+const Ko = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ee = 16, No = 283;
+function tn(e) {
+  return e << 1 ^ No & -(e >> 7);
 }
-function Pe(e, t) {
+function Oe(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
-    n ^= e & -(t & 1), e = en(e);
+    n ^= e & -(t & 1), e = tn(e);
   return n;
 }
-const jt = /* @__PURE__ */ (() => {
+const zt = /* @__PURE__ */ (() => {
   let e = new Uint8Array(256);
-  for (let n = 0, r = 1; n < 256; n++, r ^= en(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,21 +2049,21 @@ const jt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), No = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Co = (e) => e << 24 | e >>> 8, kt = (e) => e << 8 | e >>> 24;
+})(), Co = /* @__PURE__ */ zt.map((e, t) => zt.indexOf(t)), Bo = (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(kt), i = r.map(kt), o = i.map(kt), s = new Uint32Array(256 * 256), c = new Uint32Array(256 * 256), a = new Uint16Array(256 * 256);
+  const n = new Uint32Array(256).map((l, f) => t(e[f])), r = n.map(It), i = r.map(It), o = i.map(It), s = 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], c[u] = i[l] ^ o[f], a[u] = e[l] << 8 | e[f];
+      s[u] = n[l] ^ r[f], a[u] = i[l] ^ o[f], c[u] = e[l] << 8 | e[f];
     }
-  return { sbox: e, sbox2: a, T0: n, T1: r, T2: i, T3: o, T01: s, T23: c };
+  return { sbox: e, sbox2: c, T0: n, T1: r, T2: i, T3: o, T01: s, T23: a };
 }
-const tn = /* @__PURE__ */ ur(jt, (e) => Pe(e, 3) << 24 | e << 16 | e << 8 | Pe(e, 2)), fr = /* @__PURE__ */ ur(No, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), Io = /* @__PURE__ */ (() => {
+const nn = /* @__PURE__ */ ur(zt, (e) => Oe(e, 3) << 24 | e << 16 | e << 8 | Oe(e, 2)), fr = /* @__PURE__ */ ur(Co, (e) => Oe(e, 11) << 24 | Oe(e, 13) << 16 | Oe(e, 9) << 8 | Oe(e, 14)), ko = /* @__PURE__ */ (() => {
   const e = new Uint8Array(16);
-  for (let t = 0, n = 1; t < 16; t++, n = en(n))
+  for (let t = 0, n = 1; t < 16; t++, n = tn(n))
     e[t] = n;
   return e;
 })();
@@ -2072,23 +2072,23 @@ function hr(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 } = tn, r = F(e), i = r.length, o = (c) => se(n, c, c, c, c), s = new Uint32Array(t + 28);
+  const { sbox2: n } = nn, r = F(e), i = r.length, o = (a) => se(n, a, a, a, a), s = new Uint32Array(t + 28);
   s.set(r);
-  for (let c = i; c < s.length; c++) {
-    let a = s[c - 1];
-    c % i === 0 ? a = o(Co(a)) ^ Io[c / i - 1] : i > 6 && c % i === 4 && (a = o(a)), s[c] = s[c - i] ^ a;
+  for (let a = i; a < s.length; a++) {
+    let c = s[a - 1];
+    a % i === 0 ? c = o(Bo(c)) ^ ko[a / i - 1] : i > 6 && a % i === 4 && (c = o(c)), s[a] = s[a - i] ^ c;
   }
   return s;
 }
 function Uo(e) {
-  const t = hr(e), n = t.slice(), r = t.length, { sbox2: i } = tn, { T0: o, T1: s, T2: c, T3: a } = fr;
+  const t = hr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: o, T1: s, 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] ^ c[u >>> 16 & 255] ^ a[u >>> 24];
+    n[l] = o[u & 255] ^ s[u >>> 8 & 255] ^ a[u >>> 16 & 255] ^ c[u >>> 24];
   }
   return n;
 }
@@ -2098,28 +2098,28 @@ function me(e, t, n, r, i, o) {
 function se(e, t, n, r, i) {
   return e[t & 255 | n & 65280] | e[r >>> 16 & 255 | i >>> 16 & 65280] << 16;
 }
-function Ln(e, t, n, r, i) {
-  const { sbox2: o, T01: s, T23: c } = tn;
-  let a = 0;
-  t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
+function $n(e, t, n, r, i) {
+  const { sbox2: o, T01: s, 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[a++] ^ me(s, c, t, n, r, i), y = e[a++] ^ me(s, c, n, r, i, t), w = e[a++] ^ me(s, c, r, i, t, n), E = e[a++] ^ me(s, c, i, t, n, r);
+    const h = e[c++] ^ me(s, a, t, n, r, i), y = e[c++] ^ me(s, a, n, r, i, t), w = e[c++] ^ me(s, a, r, i, t, n), E = e[c++] ^ me(s, a, i, t, n, r);
     t = h, n = y, r = w, i = E;
   }
-  const f = e[a++] ^ se(o, t, n, r, i), u = e[a++] ^ se(o, n, r, i, t), d = e[a++] ^ se(o, r, i, t, n), p = e[a++] ^ se(o, i, t, n, r);
+  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);
   return { s0: f, s1: u, s2: d, s3: p };
 }
-function ko(e, t, n, r, i) {
-  const { sbox2: o, T01: s, T23: c } = fr;
-  let a = 0;
-  t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
+function Io(e, t, n, r, i) {
+  const { sbox2: o, T01: s, 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[a++] ^ me(s, c, t, i, r, n), y = e[a++] ^ me(s, c, n, t, i, r), w = e[a++] ^ me(s, c, r, n, t, i), E = e[a++] ^ me(s, c, i, r, n, t);
+    const h = e[c++] ^ me(s, a, t, i, r, n), y = e[c++] ^ me(s, a, n, t, i, r), w = e[c++] ^ me(s, a, r, n, t, i), E = e[c++] ^ me(s, a, i, r, n, t);
     t = h, n = y, r = w, i = E;
   }
-  const f = e[a++] ^ se(o, t, i, r, n), u = e[a++] ^ se(o, n, t, i, r), d = e[a++] ^ se(o, r, n, t, i), p = e[a++] ^ se(o, i, r, n, t);
+  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);
   return { s0: f, s1: u, s2: d, s3: p };
 }
 function dr(e, t) {
@@ -2140,11 +2140,11 @@ function Lo(e, t, n) {
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
   const o = F(e);
   if (t) {
-    let a = Ee - i;
-    a || (a = Ee), r = r + a;
+    let c = Ee - i;
+    c || (c = Ee), r = r + c;
   }
-  const s = dr(r, n), c = F(s);
-  return { b: o, o: c, out: s };
+  const s = dr(r, n), a = F(s);
+  return { b: o, o: a, out: s };
 }
 function $o(e, t) {
   if (!t)
@@ -2174,44 +2174,44 @@ const yr = /* @__PURE__ */ Ko({ blockSize: 16, nonceLength: 16 }, function(t, n,
   const i = !r.disablePadding;
   return {
     encrypt: (o, s) => {
-      const c = hr(t), { b: a, o: l, out: f } = Lo(o, i, s), u = F(n);
+      const a = hr(t), { b: c, o: l, out: f } = Lo(o, i, s), u = F(n);
       let d = u[0], p = u[1], g = u[2], h = u[3], y = 0;
-      for (; y + 4 <= a.length; )
-        d ^= a[y + 0], p ^= a[y + 1], g ^= a[y + 2], h ^= a[y + 3], { s0: d, s1: p, s2: g, s3: h } = Ln(c, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
+      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 } = $n(a, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
       if (i) {
         const w = To(o.subarray(y * 4));
-        d ^= w[0], p ^= w[1], g ^= w[2], h ^= w[3], { s0: d, s1: p, s2: g, s3: h } = Ln(c, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
+        d ^= w[0], p ^= w[1], g ^= w[2], h ^= w[3], { s0: d, s1: p, s2: g, s3: h } = $n(a, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
       }
-      return c.fill(0), f;
+      return a.fill(0), f;
     },
     decrypt: (o, s) => {
       _o(o);
-      const c = Uo(t), a = F(n), l = dr(o.length, s), f = F(o), u = F(l);
-      let d = a[0], p = a[1], g = a[2], h = a[3];
+      const a = Uo(t), c = F(n), l = dr(o.length, s), f = F(o), u = F(l);
+      let d = c[0], p = c[1], g = c[2], h = c[3];
       for (let y = 0; y + 4 <= f.length; ) {
-        const w = d, E = p, K = g, k = 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: C, s1: m, s2: x, s3: A } = ko(c, d, p, g, h);
-        u[y++] = C ^ w, u[y++] = m ^ E, u[y++] = x ^ K, u[y++] = A ^ k;
+        const { s0: B, s1: m, s2: x, s3: S } = Io(a, d, p, g, h);
+        u[y++] = B ^ w, u[y++] = m ^ E, u[y++] = x ^ K, u[y++] = S ^ I;
       }
-      return c.fill(0), $o(l, i);
+      return a.fill(0), $o(l, i);
     }
   };
-}), pr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Ro = pr("expand 16-byte k"), Po = pr("expand 32-byte k"), Oo = F(Ro), gr = F(Po);
+}), pr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Ro = pr("expand 16-byte k"), Oo = pr("expand 32-byte k"), Po = F(Ro), gr = F(Oo);
 gr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
 }
-function zt(e) {
+function Vt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Xe = 64, Mo = 16, wr = 2 ** 32 - 1, $n = new Uint32Array();
-function Ho(e, t, n, r, i, o, s, c) {
-  const a = i.length, l = new Uint8Array(Xe), f = F(l), u = zt(i) && zt(o), d = u ? F(i) : $n, p = u ? F(o) : $n;
-  for (let g = 0; g < a; s++) {
-    if (e(t, n, r, f, s, c), s >= wr)
+const Xe = 64, Mo = 16, wr = 2 ** 32 - 1, Tn = new Uint32Array();
+function Ho(e, t, n, r, i, o, s, a) {
+  const c = i.length, l = new Uint8Array(Xe), f = F(l), u = Vt(i) && Vt(o), d = u ? F(i) : Tn, p = u ? F(o) : Tn;
+  for (let g = 0; g < c; s++) {
+    if (e(t, n, r, f, s, a), s >= wr)
       throw new Error("arx: counter overflow");
-    const h = Math.min(Xe, a - g);
+    const h = Math.min(Xe, c - g);
     if (u && h === Xe) {
       const y = g / 4;
       if (g % 4 !== 0)
@@ -2227,50 +2227,50 @@ function Ho(e, t, n, r, i, o, s, c) {
   }
 }
 function qo(e, t) {
-  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: o, rounds: s } = Ao({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
+  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: o, rounds: s } = So({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return Ut(i), Ut(s), _n(o), _n(n), (c, a, l, f, u = 0) => {
-    le(c), le(a), le(l);
+  return Ut(i), Ut(s), Ln(o), Ln(n), (a, c, l, f, u = 0) => {
+    le(a), le(c), le(l);
     const d = l.length;
     if (f || (f = new Uint8Array(d)), le(f), 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 = c.length, h, y;
+    let g = a.length, h, y;
     if (g === 32)
-      h = c.slice(), p.push(h), y = gr;
+      h = a.slice(), p.push(h), y = gr;
     else if (g === 16 && n)
-      h = new Uint8Array(32), h.set(c), h.set(c, 16), y = Oo, p.push(h);
+      h = new Uint8Array(32), h.set(a), h.set(a, 16), y = Po, p.push(h);
     else
       throw new Error(`arx: invalid 32-byte key, got length=${g}`);
-    zt(a) || (a = a.slice(), p.push(a));
+    Vt(c) || (c = c.slice(), p.push(c));
     const w = F(h);
     if (r) {
-      if (a.length !== 24)
+      if (c.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(y, w, F(a.subarray(0, 16)), w), a = a.subarray(16);
+      r(y, w, F(c.subarray(0, 16)), w), c = c.subarray(16);
     }
     const E = 16 - i;
-    if (E !== a.length)
+    if (E !== c.length)
       throw new Error(`arx: nonce must be ${E} or 16 bytes`);
     if (E !== 12) {
-      const k = new Uint8Array(12);
-      k.set(a, o ? 0 : 12 - a.length), a = k, p.push(a);
+      const I = new Uint8Array(12);
+      I.set(c, o ? 0 : 12 - c.length), c = I, p.push(c);
     }
-    const K = F(a);
+    const K = F(c);
     for (Ho(e, y, w, K, l, f, u, s); p.length > 0; )
       p.pop().fill(0);
     return f;
   };
 }
 function Do(e, t, n, r, i, o = 20) {
-  let s = e[0], c = e[1], a = 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], k = n[1], C = n[2], m = s, x = c, A = a, O = l, U = f, B = u, T = d, R = p, H = g, b = h, v = y, S = w, I = E, N = K, _ = k, P = C;
+  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], E = i, K = n[0], I = n[1], B = n[2], m = s, x = a, S = c, P = l, U = f, N = u, T = d, R = p, H = g, b = h, v = y, A = w, k = E, C = K, _ = I, O = B;
   for (let X = 0; X < o; X += 2)
-    m = m + U | 0, I = L(I ^ m, 16), H = H + I | 0, U = L(U ^ H, 12), m = m + U | 0, I = L(I ^ m, 8), H = H + I | 0, U = L(U ^ H, 7), x = x + B | 0, N = L(N ^ x, 16), b = b + N | 0, B = L(B ^ b, 12), x = x + B | 0, N = L(N ^ x, 8), b = b + N | 0, B = L(B ^ b, 7), A = A + T | 0, _ = L(_ ^ A, 16), v = v + _ | 0, T = L(T ^ v, 12), A = A + T | 0, _ = L(_ ^ A, 8), v = v + _ | 0, T = L(T ^ v, 7), O = O + R | 0, P = L(P ^ O, 16), S = S + P | 0, R = L(R ^ S, 12), O = O + R | 0, P = L(P ^ O, 8), S = S + P | 0, R = L(R ^ S, 7), m = m + B | 0, P = L(P ^ m, 16), v = v + P | 0, B = L(B ^ v, 12), m = m + B | 0, P = L(P ^ m, 8), v = v + P | 0, B = L(B ^ v, 7), x = x + T | 0, I = L(I ^ x, 16), S = S + I | 0, T = L(T ^ S, 12), x = x + T | 0, I = L(I ^ x, 8), S = S + I | 0, T = L(T ^ S, 7), A = A + R | 0, N = L(N ^ A, 16), H = H + N | 0, R = L(R ^ H, 12), A = A + R | 0, N = L(N ^ A, 8), H = H + N | 0, R = L(R ^ H, 7), O = O + U | 0, _ = L(_ ^ O, 16), b = b + _ | 0, U = L(U ^ b, 12), O = O + U | 0, _ = L(_ ^ O, 8), b = b + _ | 0, U = L(U ^ b, 7);
+    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, 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 + T | 0, _ = L(_ ^ S, 16), v = v + _ | 0, T = L(T ^ v, 12), S = S + T | 0, _ = L(_ ^ S, 8), v = v + _ | 0, T = L(T ^ 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 + T | 0, k = L(k ^ x, 16), A = A + k | 0, T = L(T ^ A, 12), x = x + T | 0, k = L(k ^ x, 8), A = A + k | 0, T = L(T ^ 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);
   let $ = 0;
-  r[$++] = s + m | 0, r[$++] = c + x | 0, r[$++] = a + A | 0, r[$++] = l + O | 0, r[$++] = f + U | 0, r[$++] = u + B | 0, r[$++] = d + T | 0, r[$++] = p + R | 0, r[$++] = g + H | 0, r[$++] = h + b | 0, r[$++] = y + v | 0, r[$++] = w + S | 0, r[$++] = E + I | 0, r[$++] = K + N | 0, r[$++] = k + _ | 0, r[$++] = C + P | 0;
+  r[$++] = s + m | 0, r[$++] = a + x | 0, r[$++] = c + S | 0, r[$++] = l + P | 0, r[$++] = f + U | 0, r[$++] = u + N | 0, r[$++] = d + T | 0, r[$++] = p + R | 0, r[$++] = g + H | 0, r[$++] = h + b | 0, r[$++] = y + v | 0, r[$++] = w + A | 0, r[$++] = E + k | 0, r[$++] = K + C | 0, r[$++] = I + _ | 0, r[$++] = B + O | 0;
 }
 const br = /* @__PURE__ */ qo(Do, {
   counterRight: !1,
@@ -2305,8 +2305,8 @@ class vr extends nr {
   }
   _cloneInto(t) {
     t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: n, iHash: r, finished: i, destroyed: o, blockLen: s, outputLen: c } = this;
-    return t = t, t.finished = i, t.destroyed = o, t.blockLen = s, t.outputLen = c, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
+    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;
   }
   destroy() {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
@@ -2314,19 +2314,19 @@ class vr extends nr {
 }
 const pt = (e, t, n) => new vr(e, t).update(n).digest();
 pt.create = (e, t) => new vr(e, t);
-function nn(e, t, n) {
+function rn(e, t, n) {
   return oe.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), pt(e, Ge(n), Ge(t));
 }
-const _t = new Uint8Array([0]), Tn = new Uint8Array();
+const _t = new Uint8Array([0]), Rn = new Uint8Array();
 function mr(e, t, n, r = 32) {
   if (oe.hash(e), oe.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 = Tn);
-  const o = new Uint8Array(i * e.outputLen), s = pt.create(e, t), c = s._cloneInto(), a = new Uint8Array(s.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);
   for (let l = 0; l < i; l++)
-    _t[0] = l + 1, c.update(l === 0 ? Tn : a).update(n).update(_t).digestInto(a), o.set(a, e.outputLen * l), s._cloneInto(c);
-  return s.destroy(), c.destroy(), a.fill(0), _t.fill(0), o.slice(0, r);
+    _t[0] = l + 1, a.update(l === 0 ? Rn : c).update(n).update(_t).digestInto(c), o.set(c, e.outputLen * l), s._cloneInto(a);
+  return s.destroy(), a.destroy(), c.fill(0), _t.fill(0), o.slice(0, r);
 }
 var jo = Object.defineProperty, D = (e, t) => {
   for (var n in t)
@@ -2349,7 +2349,7 @@ var Vo = {};
 D(Vo, {
   Queue: () => Go,
   QueueNode: () => xr,
-  binarySearch: () => rn,
+  binarySearch: () => on,
   insertEventIntoAscendingList: () => Wo,
   insertEventIntoDescendingList: () => Fo,
   normalizeURL: () => Zo,
@@ -2363,14 +2363,14 @@ function Zo(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 Fo(e, t) {
-  const [n, r] = rn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
+  const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
   return r || e.splice(n, 0, t), e;
 }
 function Wo(e, t) {
-  const [n, r] = rn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
+  const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
   return r || e.splice(n, 0, t), e;
 }
-function rn(e, t) {
+function on(e, t) {
   let n = 0, r = e.length - 1;
   for (; n <= r; ) {
     const i = Math.floor((n + r) / 2), o = t(e[i]);
@@ -2438,27 +2438,27 @@ function Yo(e) {
   return JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content]);
 }
 function tt(e) {
-  let t = Ae(te.encode(Yo(e)));
+  let t = Se(te.encode(Yo(e)));
   return M(t);
 }
-var gt = new Jo(), Oe = gt.generateSecretKey, Ce = gt.getPublicKey, ae = gt.finalizeEvent, on = gt.verifyEvent, Xo = {};
+var gt = new Jo(), Pe = gt.generateSecretKey, Be = gt.getPublicKey, ae = gt.finalizeEvent, sn = gt.verifyEvent, Xo = {};
 D(Xo, {
   Application: () => Xs,
   BadgeAward: () => as,
   BadgeDefinition: () => Vs,
   BlockedRelaysList: () => Us,
-  BookmarkList: () => Ns,
+  BookmarkList: () => Cs,
   Bookmarksets: () => Ds,
   Calendar: () => oa,
   CalendarEventRSVP: () => sa,
-  ChannelCreation: () => Nr,
+  ChannelCreation: () => Cr,
   ChannelHideMessage: () => Ur,
-  ChannelMessage: () => Ir,
-  ChannelMetadata: () => Cr,
-  ChannelMuteUser: () => kr,
+  ChannelMessage: () => kr,
+  ChannelMetadata: () => Br,
+  ChannelMuteUser: () => Ir,
   ClassifiedListing: () => ta,
   ClientAuth: () => _r,
-  CommunitiesList: () => Cs,
+  CommunitiesList: () => Bs,
   CommunityDefinition: () => la,
   CommunityPostApproval: () => gs,
   Contacts: () => rs,
@@ -2477,10 +2477,10 @@ D(Xo, {
   Followsets: () => Ms,
   GenericRepost: () => cs,
   Genericlists: () => Hs,
-  HTTPAuth: () => cn,
+  HTTPAuth: () => ln,
   Handlerinformation: () => ca,
   Handlerrecommendation: () => aa,
-  Highlights: () => As,
+  Highlights: () => Ss,
   InterestsList: () => _s,
   Interestsets: () => Zs,
   JobFeedback: () => vs,
@@ -2492,24 +2492,24 @@ D(Xo, {
   LiveEvent: () => Qs,
   LongFormArticle: () => Gs,
   Metadata: () => es,
-  Mutelist: () => Ss,
+  Mutelist: () => As,
   NWCWalletInfo: () => Ts,
   NWCWalletRequest: () => Lr,
-  NWCWalletResponse: () => Ps,
-  NostrConnect: () => Os,
+  NWCWalletResponse: () => Os,
+  NostrConnect: () => Ps,
   OpenTimestamps: () => ls,
   Pinlist: () => Ks,
   ProblemTracker: () => hs,
   ProfileBadges: () => zs,
-  PublicChatsList: () => Is,
-  Reaction: () => an,
+  PublicChatsList: () => ks,
+  Reaction: () => cn,
   RecommendRelay: () => ns,
-  RelayList: () => Bs,
+  RelayList: () => Ns,
   Relaysets: () => qs,
   Report: () => ds,
   Reporting: () => ys,
-  Repost: () => sn,
-  SearchRelaysList: () => ks,
+  Repost: () => an,
+  SearchRelaysList: () => Is,
   ShortTextNote: () => ts,
   Time: () => ia,
   UserEmojiList: () => Ls,
@@ -2519,35 +2519,35 @@ D(Xo, {
   ZapRequest: () => Es,
   classifyKind: () => Qo,
   isEphemeralKind: () => Kr,
-  isParameterizedReplaceableKind: () => Br,
-  isRegularKind: () => Ar,
-  isReplaceableKind: () => Sr
+  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 Sr(e) {
+function Ar(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
 function Kr(e) {
   return 2e4 <= e && e < 3e4;
 }
-function Br(e) {
+function Nr(e) {
   return 3e4 <= e && e < 4e4;
 }
 function Qo(e) {
-  return Ar(e) ? "regular" : Sr(e) ? "replaceable" : Kr(e) ? "ephemeral" : Br(e) ? "parameterized" : "unknown";
+  return Sr(e) ? "regular" : Ar(e) ? "replaceable" : Kr(e) ? "ephemeral" : Nr(e) ? "parameterized" : "unknown";
 }
-var es = 0, ts = 1, ns = 2, rs = 3, is = 4, os = 4, ss = 5, sn = 6, an = 7, as = 8, cs = 16, Nr = 40, Cr = 41, Ir = 42, Ur = 43, kr = 44, ls = 1040, us = 1063, fs = 1311, hs = 1971, ds = 1984, ys = 1984, ps = 1985, gs = 4550, ws = 5999, bs = 6999, vs = 7e3, ms = 9041, Es = 9734, xs = 9735, As = 9802, Ss = 1e4, Ks = 10001, Bs = 10002, Ns = 10003, Cs = 10004, Is = 10005, Us = 10006, ks = 10007, _s = 10015, Ls = 10030, $s = 10096, Ts = 13194, Rs = 21e3, _r = 22242, Lr = 23194, Ps = 23195, Os = 24133, cn = 27235, Ms = 3e4, Hs = 30001, qs = 30002, Ds = 30003, js = 30004, zs = 30008, Vs = 30009, Zs = 30015, Fs = 30017, Ws = 30018, Gs = 30023, Js = 30024, Ys = 30030, Xs = 30078, Qs = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, oa = 31924, sa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
+var es = 0, ts = 1, ns = 2, rs = 3, is = 4, os = 4, ss = 5, an = 6, cn = 7, as = 8, cs = 16, Cr = 40, Br = 41, kr = 42, Ur = 43, Ir = 44, ls = 1040, us = 1063, fs = 1311, hs = 1971, ds = 1984, ys = 1984, ps = 1985, gs = 4550, ws = 5999, bs = 6999, vs = 7e3, ms = 9041, Es = 9734, xs = 9735, Ss = 9802, As = 1e4, Ks = 10001, Ns = 10002, Cs = 10003, Bs = 10004, ks = 10005, Us = 10006, Is = 10007, _s = 10015, Ls = 10030, $s = 10096, Ts = 13194, Rs = 21e3, _r = 22242, Lr = 23194, Os = 23195, Ps = 24133, ln = 27235, Ms = 3e4, Hs = 30001, qs = 30002, Ds = 30003, js = 30004, zs = 30008, Vs = 30009, Zs = 30015, Fs = 30017, Ws = 30018, Gs = 30023, Js = 30024, Ys = 30030, Xs = 30078, Qs = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, oa = 31924, sa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
 D(ua, {
-  getHex64: () => ln,
+  getHex64: () => un,
   getInt: () => $r,
   getSubscriptionId: () => fa,
   matchEventId: () => ha,
   matchEventKind: () => ya,
   matchEventPubkey: () => da
 });
-function ln(e, t) {
+function un(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);
 }
@@ -2569,10 +2569,10 @@ function fa(e) {
   return e.slice(r + 1, o);
 }
 function ha(e, t) {
-  return t === ln(e, "id");
+  return t === un(e, "id");
 }
 function da(e, t) {
-  return t === ln(e, "pubkey");
+  return t === un(e, "pubkey");
 }
 function ya(e, t) {
   return t === $r(e, "kind");
@@ -2605,25 +2605,25 @@ try {
 var Fe = {};
 D(Fe, {
   BECH32_REGEX: () => Tr,
-  Bech32MaxSize: () => un,
+  Bech32MaxSize: () => fn,
   decode: () => wt,
   encodeBytes: () => bt,
   naddrEncode: () => Ka,
-  neventEncode: () => Sa,
+  neventEncode: () => Aa,
   noteEncode: () => xa,
-  nprofileEncode: () => Aa,
+  nprofileEncode: () => Sa,
   npubEncode: () => Ea,
-  nrelayEncode: () => Ba,
+  nrelayEncode: () => Na,
   nsecEncode: () => ma
 });
-var un = 5e3, Tr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
+var fn = 5e3, Tr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
 function va(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 wt(e) {
-  var i, o, s, c, a, l, f, u;
-  let { prefix: t, words: n } = De.decode(e, un), r = new Uint8Array(De.fromWords(n));
+  var i, o, s, a, c, l, f, u;
+  let { prefix: t, words: n } = De.decode(e, fn), r = new Uint8Array(De.fromWords(n));
   switch (t) {
     case "nprofile": {
       let d = Qe(r);
@@ -2655,13 +2655,13 @@ function wt(e) {
           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,
-          kind: (c = d[3]) != null && c[0] ? parseInt(M(d[3][0]), 16) : void 0
+          kind: (a = d[3]) != null && a[0] ? parseInt(M(d[3][0]), 16) : void 0
         }
       };
     }
     case "naddr": {
       let d = Qe(r);
-      if (!((a = d[0]) != null && a[0]))
+      if (!((c = d[0]) != null && c[0]))
         throw new Error("missing TLV 0 for naddr");
       if (!((l = d[2]) != null && l[0]))
         throw new Error("missing TLV 2 for naddr");
@@ -2720,19 +2720,19 @@ function xa(e) {
 }
 function Ye(e, t) {
   let n = De.toWords(t);
-  return De.encode(e, n, un);
+  return De.encode(e, n, fn);
 }
 function bt(e, t) {
   return Ye(e, t);
 }
-function Aa(e) {
+function Sa(e) {
   let t = vt({
     0: [W(e.pubkey)],
     1: (e.relays || []).map((n) => te.encode(n))
   });
   return Ye("nprofile", t);
 }
-function Sa(e) {
+function Aa(e) {
   let t;
   e.kind !== void 0 && (t = va(e.kind));
   let n = vt({
@@ -2754,7 +2754,7 @@ function Ka(e) {
   });
   return Ye("naddr", n);
 }
-function Ba(e) {
+function Na(e) {
   let t = vt({
     0: [te.encode(e)]
   });
@@ -2769,33 +2769,33 @@ function vt(e) {
     });
   }), dt(...t);
 }
-var Na = {};
-D(Na, {
-  decrypt: () => Ca,
+var Ca = {};
+D(Ca, {
+  decrypt: () => Ba,
   encrypt: () => Rr
 });
 async function Rr(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e, i = Ue.getSharedSecret(r, "02" + t), o = Pr(i);
-  let s = Uint8Array.from(ir(16)), c = te.encode(n), a = yr(o, s).encrypt(c), l = ue.encode(new Uint8Array(a)), f = ue.encode(new Uint8Array(s.buffer));
+  const r = e instanceof Uint8Array ? M(e) : e, i = Ue.getSharedSecret(r, "02" + t), o = Or(i);
+  let s = Uint8Array.from(ir(16)), a = te.encode(n), c = yr(o, s).encrypt(a), l = ue.encode(new Uint8Array(c)), f = ue.encode(new Uint8Array(s.buffer));
   return `${l}?iv=${f}`;
 }
-async function Ca(e, t, n) {
+async function Ba(e, t, n) {
   const r = e instanceof Uint8Array ? M(e) : e;
-  let [i, o] = n.split("?iv="), s = Ue.getSharedSecret(r, "02" + t), c = Pr(s), a = ue.decode(o), l = ue.decode(i), f = yr(c, a).decrypt(l);
+  let [i, o] = n.split("?iv="), s = Ue.getSharedSecret(r, "02" + t), a = Or(s), c = ue.decode(o), 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 Ia = {};
-D(Ia, {
-  NIP05_REGEX: () => Or,
+var ka = {};
+D(ka, {
+  NIP05_REGEX: () => Pr,
   isValid: () => _a,
   queryProfile: () => Mr,
-  searchDomain: () => ka,
+  searchDomain: () => Ia,
   useFetchImplementation: () => Ua
 });
-var Or = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, mt;
+var Pr = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, mt;
 try {
   mt = fetch;
 } catch {
@@ -2803,7 +2803,7 @@ try {
 function Ua(e) {
   mt = e;
 }
-async function ka(e, t = "") {
+async function Ia(e, t = "") {
   try {
     const n = `https://${e}/.well-known/nostr.json?name=${t}`;
     return (await (await mt(n, { redirect: "error" })).json()).names;
@@ -2813,14 +2813,14 @@ async function ka(e, t = "") {
 }
 async function Mr(e) {
   var o;
-  const t = e.match(Or);
+  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}`, c = await (await mt(s, { redirect: "error" })).json();
-    let a = c.names[r];
-    return a ? { pubkey: a, relays: (o = c.relays) == null ? void 0 : o[a] } : null;
+    const s = `https://${i}/.well-known/nostr.json?name=${r}`, a = await (await mt(s, { redirect: "error" })).json();
+    let c = a.names[r];
+    return c ? { pubkey: c, relays: (o = a.relays) == null ? void 0 : o[c] } : null;
   } catch {
     return null;
   }
@@ -2846,19 +2846,19 @@ function $a(e) {
       relays: r[2] ? [r[2]] : []
     });
   for (let r = 0; r < n.length; r++) {
-    const i = n[r], [o, s, c, a] = i, l = {
+    const i = n[r], [o, s, a, c] = i, l = {
       id: s,
-      relays: c ? [c] : []
+      relays: a ? [a] : []
     }, f = r === 0, u = r === n.length - 1;
-    if (a === "root") {
+    if (c === "root") {
       t.root = l;
       continue;
     }
-    if (a === "reply") {
+    if (c === "reply") {
       t.reply = l;
       continue;
     }
-    if (a === "mention") {
+    if (c === "mention") {
       t.mentions.push(l);
       continue;
     }
@@ -2876,7 +2876,7 @@ function $a(e) {
 }
 var Ta = {};
 D(Ta, {
-  fetchRelayInformation: () => Pa,
+  fetchRelayInformation: () => Oa,
   useFetchImplementation: () => Ra
 });
 var Hr;
@@ -2887,13 +2887,13 @@ try {
 function Ra(e) {
   Hr = e;
 }
-async function Pa(e) {
+async function Oa(e) {
   return await (await fetch(e.replace("ws://", "http://").replace("wss://", "https://"), {
     headers: { Accept: "application/nostr+json" }
   })).json();
 }
-var Oa = {};
-D(Oa, {
+var Pa = {};
+D(Pa, {
   getPow: () => qr,
   minePow: () => Ma
 });
@@ -2929,7 +2929,7 @@ D(Ha, {
 function qa(e, t, n, r) {
   return ae(
     {
-      kind: sn,
+      kind: an,
       tags: [...e.tags ?? [], ["e", t.id, n], ["p", t.pubkey]],
       content: e.content === "" ? "" : JSON.stringify(t),
       created_at: e.created_at
@@ -2938,7 +2938,7 @@ function qa(e, t, n, r) {
   );
 }
 function Dr(e) {
-  if (e.kind !== sn)
+  if (e.kind !== an)
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -2962,7 +2962,7 @@ function Da(e, { skipVerification: t } = {}) {
   } catch {
     return;
   }
-  if (r.id === n.id && !(!t && !on(r)))
+  if (r.id === n.id && !(!t && !sn(r)))
     return r;
 }
 var ja = {};
@@ -2995,7 +2995,7 @@ function Fa(e, t, n) {
   return ae(
     {
       ...e,
-      kind: an,
+      kind: cn,
       tags: [...e.tags ?? [], ...r, ["e", t.id], ["p", t.pubkey]],
       content: e.content ?? "+"
     },
@@ -3003,7 +3003,7 @@ function Fa(e, t, n) {
   );
 }
 function Wa(e) {
-  if (e.kind !== an)
+  if (e.kind !== cn)
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -3020,12 +3020,12 @@ function Wa(e) {
 var Ga = {};
 D(Ga, {
   matchAll: () => Ja,
-  regex: () => fn,
+  regex: () => hn,
   replaceAll: () => Ya
 });
-var fn = () => new RegExp(`\\b${Et.source}\\b`, "g");
+var hn = () => new RegExp(`\\b${Et.source}\\b`, "g");
 function* Ja(e) {
-  const t = e.matchAll(fn());
+  const t = e.matchAll(hn());
   for (const n of t)
     try {
       const [r, i] = n;
@@ -3040,7 +3040,7 @@ function* Ja(e) {
     }
 }
 function Ya(e, t) {
-  return e.replaceAll(fn(), (n, r) => t({
+  return e.replaceAll(hn(), (n, r) => t({
     uri: n,
     value: r,
     decoded: wt(r)
@@ -3064,7 +3064,7 @@ var Qa = (e, t) => {
     return;
   return ae(
     {
-      kind: Nr,
+      kind: Cr,
       tags: [...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3081,7 +3081,7 @@ var Qa = (e, t) => {
     return;
   return ae(
     {
-      kind: Cr,
+      kind: Br,
       tags: [["e", e.channel_create_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3092,7 +3092,7 @@ var Qa = (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: Ir,
+      kind: kr,
       tags: [...n, ...e.tags ?? []],
       content: e.content,
       created_at: e.created_at
@@ -3126,7 +3126,7 @@ var Qa = (e, t) => {
     return;
   return ae(
     {
-      kind: kr,
+      kind: Ir,
       tags: [["p", e.pubkey_to_mute], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3137,12 +3137,12 @@ var Qa = (e, t) => {
 D(ic, {
   EMOJI_SHORTCODE_REGEX: () => jr,
   matchAll: () => oc,
-  regex: () => hn,
+  regex: () => dn,
   replaceAll: () => sc
 });
-var jr = /:(\w+):/, hn = () => new RegExp(`\\B${jr.source}\\B`, "g");
+var jr = /:(\w+):/, dn = () => new RegExp(`\\B${jr.source}\\B`, "g");
 function* oc(e) {
-  const t = e.matchAll(hn());
+  const t = e.matchAll(dn());
   for (const n of t)
     try {
       const [r, i] = n;
@@ -3156,7 +3156,7 @@ function* oc(e) {
     }
 }
 function sc(e, t) {
-  return e.replaceAll(hn(), (n, r) => t({
+  return e.replaceAll(dn(), (n, r) => t({
     shortcode: n,
     name: r
   }));
@@ -3166,23 +3166,23 @@ D(ac, {
   useFetchImplementation: () => cc,
   validateGithub: () => lc
 });
-var dn;
+var yn;
 try {
-  dn = fetch;
+  yn = fetch;
 } catch {
 }
 function cc(e) {
-  dn = e;
+  yn = e;
 }
 async function lc(e, t, n) {
   try {
-    return await (await dn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
+    return await (await yn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
   } catch {
     return !1;
   }
 }
-var z = {};
-D(z, {
+var j = {};
+D(j, {
   decrypt: () => Jr,
   encrypt: () => Gr,
   getConversationKey: () => Zr,
@@ -3191,17 +3191,17 @@ D(z, {
 var zr = 1, Vr = 65535;
 function Zr(e, t) {
   const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return nn(Ae, n, "nip44-v2");
+  return rn(Se, n, "nip44-v2");
 }
 function Fr(e, t) {
-  const n = mr(Ae, e, t, 76);
+  const n = mr(Se, e, t, 76);
   return {
     chacha_key: n.subarray(0, 32),
     chacha_nonce: n.subarray(32, 44),
     hmac_key: n.subarray(44, 76)
   };
 }
-function yn(e) {
+function pn(e) {
   if (!Number.isSafeInteger(e) || e < 1)
     throw new Error("expected positive integer");
   if (e <= 32)
@@ -3216,12 +3216,12 @@ function uc(e) {
   return new DataView(t.buffer).setUint16(0, e, !1), t;
 }
 function fc(e) {
-  const t = te.encode(e), n = t.length, r = uc(n), i = new Uint8Array(yn(n) - n);
+  const t = te.encode(e), n = t.length, r = uc(n), i = new Uint8Array(pn(n) - n);
   return dt(r, t, i);
 }
 function hc(e) {
   const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
-  if (t < zr || t > Vr || n.length !== t || e.length !== 2 + yn(t))
+  if (t < zr || t > Vr || n.length !== t || e.length !== 2 + pn(t))
     throw new Error("invalid padding");
   return ie.decode(n);
 }
@@ -3229,7 +3229,7 @@ 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(Ae, e, r);
+  return pt(Se, e, r);
 }
 function dc(e) {
   if (typeof e != "string")
@@ -3258,12 +3258,12 @@ function dc(e) {
   };
 }
 function Gr(e, t, n = ir(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: o } = Fr(t, n), s = fc(e), c = br(r, i, s), a = Wr(o, c, n);
-  return ue.encode(dt(new Uint8Array([2]), n, c, a));
+  const { chacha_key: r, chacha_nonce: i, hmac_key: o } = Fr(t, n), s = fc(e), a = br(r, i, s), c = Wr(o, a, n);
+  return ue.encode(dt(new Uint8Array([2]), n, a, c));
 }
 function Jr(e, t) {
-  const { nonce: n, ciphertext: r, mac: i } = dc(e), { chacha_key: o, chacha_nonce: s, hmac_key: c } = Fr(t, n), a = Wr(c, r, n);
-  if (!So(a, i))
+  const { nonce: n, ciphertext: r, mac: i } = dc(e), { chacha_key: o, chacha_nonce: s, hmac_key: a } = Fr(t, n), c = Wr(a, r, n);
+  if (!Ao(c, i))
     throw new Error("invalid MAC");
   const l = br(o, s, r);
   return hc(l);
@@ -3271,7 +3271,7 @@ function Jr(e, t) {
 var yc = {
   utils: {
     getConversationKey: Zr,
-    calcPaddedLen: yn
+    calcPaddedLen: pn
   },
   encrypt: Gr,
   decrypt: Jr
@@ -3303,31 +3303,31 @@ async function wc(e, t, n) {
 var bc = {};
 D(bc, {
   getZapEndpoint: () => mc,
-  makeZapReceipt: () => Ac,
+  makeZapReceipt: () => Sc,
   makeZapRequest: () => Ec,
   useFetchImplementation: () => vc,
   validateZapRequest: () => xc
 });
-var pn;
+var gn;
 try {
-  pn = fetch;
+  gn = fetch;
 } catch {
 }
 function vc(e) {
-  pn = e;
+  gn = e;
 }
 async function mc(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
-      let { words: s } = De.decode(n, 1e3), c = De.fromWords(s);
-      t = ie.decode(c);
+      let { words: s } = De.decode(n, 1e3), a = De.fromWords(s);
+      t = ie.decode(a);
     } else if (r) {
-      let [s, c] = r.split("@");
-      t = new URL(`/.well-known/lnurlp/${s}`, `https://${c}`).toString();
+      let [s, a] = r.split("@");
+      t = new URL(`/.well-known/lnurlp/${s}`, `https://${a}`).toString();
     } else
       return null;
-    let o = await (await pn(t)).json();
+    let o = await (await gn(t)).json();
     if (o.allowsNostr && o.nostrPubkey)
       return o.callback;
   } catch {
@@ -3366,7 +3366,7 @@ function xc(e) {
   }
   if (!Er(t))
     return "Zap request is not a valid Nostr event.";
-  if (!on(t))
+  if (!sn(t))
     return "Invalid signature on zap request.";
   let n = t.tags.find(([o, s]) => o === "p" && s);
   if (!n)
@@ -3376,13 +3376,13 @@ function xc(e) {
   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.";
 }
-function Ac({
+function Sc({
   zapRequest: e,
   preimage: t,
   bolt11: n,
   paidAt: r
 }) {
-  let i = JSON.parse(e), o = i.tags.filter(([c]) => c === "e" || c === "p" || c === "a"), s = {
+  let i = JSON.parse(e), o = i.tags.filter(([a]) => a === "e" || a === "p" || a === "a"), s = {
     kind: 9735,
     created_at: Math.round(r.getTime() / 1e3),
     content: "",
@@ -3390,10 +3390,10 @@ function Ac({
   };
   return t && s.tags.push(["preimage", t]), s;
 }
-var Sc = {};
-D(Sc, {
+var Ac = {};
+D(Ac, {
   getToken: () => Kc,
-  hashPayload: () => gn,
+  hashPayload: () => wn,
   unpackEventFromToken: () => Xr,
   validateEvent: () => ii,
   validateEventKind: () => ei,
@@ -3401,12 +3401,12 @@ D(Sc, {
   validateEventPayloadTag: () => ri,
   validateEventTimestamp: () => Qr,
   validateEventUrlTag: () => ti,
-  validateToken: () => Bc
+  validateToken: () => Nc
 });
 var Yr = "Nostr ";
 async function Kc(e, t, n, r = !1, i) {
   const o = {
-    kind: cn,
+    kind: ln,
     tags: [
       ["u", e],
       ["method", t]
@@ -3414,11 +3414,11 @@ async function Kc(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && o.tags.push(["payload", gn(i)]);
+  i && o.tags.push(["payload", wn(i)]);
   const s = await n(o);
   return (r ? Yr : "") + ue.encode(te.encode(JSON.stringify(s)));
 }
-async function Bc(e, t, n) {
+async function Nc(e, t, n) {
   const r = await Xr(e).catch((o) => {
     throw o;
   });
@@ -3439,7 +3439,7 @@ function Qr(e) {
   return e.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - e.created_at < 60 : !1;
 }
 function ei(e) {
-  return e.kind === cn;
+  return e.kind === ln;
 }
 function ti(e, t) {
   const n = e.tags.find((r) => r[0] === "u");
@@ -3449,19 +3449,19 @@ 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 gn(e) {
-  const t = Ae(te.encode(JSON.stringify(e)));
+function wn(e) {
+  const t = Se(te.encode(JSON.stringify(e)));
   return M(t);
 }
 function ri(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
   if (!n)
     return !1;
-  const r = gn(t);
+  const r = wn(t);
   return n.length > 0 && n[1] === r;
 }
 async function ii(e, t, n, r) {
-  if (!on(e))
+  if (!sn(e))
     throw new Error("Invalid nostr event, signature invalid");
   if (!ei(e))
     throw new Error("Invalid nostr event, kind invalid");
@@ -3476,7 +3476,7 @@ async function ii(e, t, n, r) {
   return !0;
 }
 const Me = 4, Tc = 100;
-var Nc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Nc || {});
+var Cc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Cc || {});
 function Rc(e) {
   return JSON.stringify({
     rootKey: M(e.rootKey),
@@ -3499,10 +3499,16 @@ function Rc(e) {
         t,
         M(n)
       ])
+    ),
+    skippedHeaderKeys: Object.fromEntries(
+      Object.entries(e.skippedHeaderKeys).map(([t, n]) => [
+        t,
+        n.map((r) => M(r))
+      ])
     )
   });
 }
-function Pc(e) {
+function Oc(e) {
   const t = JSON.parse(e);
   return {
     rootKey: W(t.rootKey),
@@ -3525,10 +3531,16 @@ function Pc(e) {
         n,
         W(r)
       ])
+    ),
+    skippedHeaderKeys: Object.fromEntries(
+      Object.entries(t.skippedHeaderKeys || {}).map(([n, r]) => [
+        n,
+        r.map((i) => W(i))
+      ])
     )
   };
 }
-async function* Oc(e) {
+async function* Pc(e) {
   const t = [];
   let n = null;
   const r = e.onMessage((i) => {
@@ -3544,15 +3556,15 @@ async function* Oc(e) {
   }
 }
 function Re(e, t = new Uint8Array(32), n = 1) {
-  const r = nn(Ae, e, t), i = [];
+  const r = rn(Se, e, t), i = [];
   for (let o = 1; o <= n; o++)
-    i.push(mr(Ae, r, new Uint8Array([o]), 32));
+    i.push(mr(Se, r, new Uint8Array([o]), 32));
   return i;
 }
-function Rn(e, t) {
+function Lt(e, t) {
   return `${e}:${t}`;
 }
-const Cc = 1e3;
+const Bc = 1e3;
 class ct {
   // 1. CHANNEL PUBLIC INTERFACE
   constructor(t, n) {
@@ -3574,11 +3586,11 @@ class ct {
    * @returns A new Channel instance
    */
   static init(t, n, r, i, o, s) {
-    const c = Oe(), [a, l] = Re(o, z.getConversationKey(c, n), 2);
+    const a = Pe(), [c, l] = Re(o, j.getConversationKey(a, n), 2);
     let f, u;
-    i ? (f = { publicKey: Ce(r), privateKey: r }, u = { publicKey: Ce(c), privateKey: c }) : u = { publicKey: Ce(r), privateKey: r };
+    i ? (f = { publicKey: Be(r), privateKey: r }, u = { publicKey: Be(a), privateKey: a }) : u = { publicKey: Be(r), privateKey: r };
     const d = {
-      rootKey: i ? a : o,
+      rootKey: i ? c : o,
       theirNostrPublicKey: n,
       ourCurrentNostrKey: f,
       ourNextNostrKey: u,
@@ -3587,7 +3599,8 @@ class ct {
       sendingChainMessageNumber: 0,
       receivingChainMessageNumber: 0,
       previousSendingChainMessageCount: 0,
-      skippedMessageKeys: {}
+      skippedMessageKeys: {},
+      skippedHeaderKeys: {}
     }, p = new ct(t, d);
     return s && (p.name = s), p;
   }
@@ -3600,7 +3613,7 @@ 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 = z.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNostrPublicKey), o = z.encrypt(JSON.stringify(n), i);
+    const [n, r] = this.ratchetEncrypt(t), i = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNostrPublicKey), o = j.encrypt(JSON.stringify(n), i);
     return ae({
       content: r,
       kind: Me,
@@ -3617,6 +3630,13 @@ class ct {
     const n = this.currentInternalSubscriptionId++;
     return this.internalSubscriptions.set(n, t), this.subscribeToNostrEvents(), () => this.internalSubscriptions.delete(n);
   }
+  /**
+   * Stop listening to incoming messages
+   */
+  close() {
+    var t, n;
+    (t = this.nostrUnsubscribe) == null || t.call(this), (n = this.nostrNextUnsubscribe) == null || n.call(this);
+  }
   // 2. RATCHET FUNCTIONS
   ratchetEncrypt(t) {
     const [n, r] = Re(this.state.sendingChainKey, new Uint8Array([1]), 2);
@@ -3625,7 +3645,7 @@ class ct {
       nextPublicKey: this.state.ourNextNostrKey.publicKey,
       time: Date.now(),
       previousChainLength: this.state.previousSendingChainMessageCount
-    }, z.encrypt(t, r)];
+    }, j.encrypt(t, r)];
   }
   ratchetDecrypt(t, n, r) {
     const i = this.trySkippedMessageKeys(t, n, r);
@@ -3634,44 +3654,54 @@ class ct {
     const [o, s] = Re(this.state.receivingChainKey, new Uint8Array([1]), 2);
     this.state.receivingChainKey = o, this.state.receivingChainMessageNumber++;
     try {
-      return z.decrypt(n, s);
-    } catch (c) {
-      throw console.error(this.name, "Decryption failed:", c, {
+      return j.decrypt(n, s);
+    } catch (a) {
+      throw console.error(this.name, "Decryption failed:", a, {
         messageKey: M(s).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)
-      }), c;
+      }), a;
     }
   }
   ratchetStep(t) {
     this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.theirNostrPublicKey = t;
-    const n = z.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [r, i] = Re(this.state.rootKey, n, 2);
+    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 = Oe();
+    const o = Pe();
     this.state.ourNextNostrKey = {
-      publicKey: Ce(o),
+      publicKey: Be(o),
       privateKey: o
     };
-    const s = z.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [c, a] = Re(r, s, 2);
-    this.state.rootKey = c, this.state.sendingChainKey = a;
+    const s = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [a, c] = Re(r, s, 2);
+    this.state.rootKey = a, this.state.sendingChainKey = c;
   }
   // 3. MESSAGE KEY FUNCTIONS
   skipMessageKeys(t, n) {
-    if (this.state.receivingChainMessageNumber + Cc < t)
+    if (this.state.receivingChainMessageNumber + Bc < 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 = Rn(n, this.state.receivingChainMessageNumber);
-      this.state.skippedMessageKeys[o] = i, this.state.receivingChainMessageNumber++;
+      const o = Lt(n, this.state.receivingChainMessageNumber);
+      if (this.state.skippedMessageKeys[o] = i, !this.state.skippedHeaderKeys[n]) {
+        const s = [];
+        if (this.state.ourCurrentNostrKey) {
+          const c = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
+          s.push(c);
+        }
+        const a = j.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
+        s.push(a), this.state.skippedHeaderKeys[n] = s;
+      }
+      this.state.receivingChainMessageNumber++;
     }
   }
   trySkippedMessageKeys(t, n, r) {
-    const i = Rn(r, t.number);
+    var o;
+    const i = Lt(r, t.number);
     if (i in this.state.skippedMessageKeys) {
-      const o = this.state.skippedMessageKeys[i];
-      return delete this.state.skippedMessageKeys[i], z.decrypt(n, o);
+      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);
     }
     return null;
   }
@@ -3679,28 +3709,38 @@ class ct {
   decryptHeader(t) {
     const n = t.tags[0][1];
     if (this.state.ourCurrentNostrKey) {
-      const i = z.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
+      const o = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
       try {
-        return [JSON.parse(z.decrypt(n, i)), !1];
+        return [JSON.parse(j.decrypt(n, o)), !1, !1];
       } catch {
       }
     }
-    const r = z.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
+    const r = j.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
     try {
-      return [JSON.parse(z.decrypt(n, r)), !0];
+      return [JSON.parse(j.decrypt(n, r)), !0, !1];
     } catch {
     }
-    throw new Error("Failed to decrypt header with both current and next secrets");
+    const i = this.state.skippedHeaderKeys[t.pubkey];
+    if (i)
+      for (const o of i)
+        try {
+          return [JSON.parse(j.decrypt(n, o)), !1, !0];
+        } catch {
+        }
+    throw new Error("Failed to decrypt header with current and skipped header keys");
   }
   handleNostrEvent(t) {
-    var o;
-    const [n, r] = this.decryptHeader(t);
-    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: [Me] },
-      (s) => this.handleNostrEvent(s)
-    )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey));
-    const i = this.ratchetDecrypt(n, t.content, t.pubkey);
-    this.internalSubscriptions.forEach((s) => s({ id: t.id, data: i, pubkey: n.nextPublicKey, time: n.time }));
+    var s;
+    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(
+        { authors: [this.state.theirNostrPublicKey], kinds: [Me] },
+        (a) => this.handleNostrEvent(a)
+      )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey));
+    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 }));
   }
   subscribeToNostrEvents() {
     if (this.nostrNextUnsubscribe) return;
@@ -3723,14 +3763,14 @@ new TextDecoder("utf-8");
 new TextEncoder();
 function et(e, t) {
   const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return nn(Ae, n, "nip44-v2");
+  return rn(Se, n, "nip44-v2");
 }
 class nt {
-  constructor(t, n, r, i, o, s, c = []) {
-    this.inviterSessionPublicKey = t, this.linkSecret = n, this.inviter = r, this.inviterSessionPrivateKey = i, this.label = o, this.maxUses = s, this.usedBy = c;
+  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;
   }
   static createNew(t, n, r) {
-    const i = Oe(), o = Ce(i), s = M(Oe());
+    const i = Pe(), o = Be(i), s = M(Pe());
     return new nt(
       o,
       s,
@@ -3741,18 +3781,29 @@ class nt {
     );
   }
   static fromUrl(t) {
-    const n = new URL(t), r = n.pathname.slice(1), i = n.searchParams.get("s"), o = n.hash.slice(1);
+    const r = new URL(t).hash.slice(1);
     if (!r)
-      throw new Error("Inviter not found in the URL");
-    if (!i)
-      throw new Error("Session key not found in the URL");
-    const s = Fe.decode(r), c = Fe.decode(i);
-    if (typeof s.data != "string")
+      throw new Error("No invite data found in the URL hash.");
+    const i = decodeURIComponent(r);
+    let o;
+    try {
+      o = JSON.parse(i);
+    } catch (u) {
+      throw new Error("Invite data in URL hash is not valid JSON: " + u);
+    }
+    const { inviter: s, sessionKey: a, linkSecret: c } = o;
+    if (!s || !a || !c)
+      throw new Error("Missing required fields (inviter, sessionKey, linkSecret) in invite data.");
+    const l = Fe.decode(s), f = Fe.decode(a);
+    if (typeof l.data != "string")
       throw new Error("Decoded inviter is not a string");
-    if (typeof c.data != "string")
+    if (typeof f.data != "string")
       throw new Error("Decoded session key is not a string");
-    const a = s.data, l = c.data;
-    return new nt(l, o, a);
+    return new nt(
+      f.data,
+      c,
+      l.data
+    );
   }
   static deserialize(t) {
     const n = JSON.parse(t);
@@ -3778,8 +3829,12 @@ class nt {
     });
   }
   getUrl(t = "https://iris.to") {
-    const n = new URL(`${t}/${Fe.npubEncode(this.inviter)}`);
-    return n.searchParams.set("s", Fe.npubEncode(this.inviterSessionPublicKey)), n.hash = this.linkSecret, n.toString();
+    const n = {
+      inviter: Fe.npubEncode(this.inviter),
+      sessionKey: Fe.npubEncode(this.inviterSessionPublicKey),
+      linkSecret: this.linkSecret
+    }, r = new URL(t);
+    return r.hash = encodeURIComponent(JSON.stringify(n)), console.log("url", r.toString()), r.toString();
   }
   /**
        * Accepts the invite and creates a new channel with the inviter.
@@ -3797,7 +3852,7 @@ class nt {
        * so the inviter can create the channel on their side.
        */
   async acceptInvite(t, n, r) {
-    const i = Oe(), o = Ce(i), s = this.inviter || this.inviterSessionPublicKey, c = W(this.linkSecret), a = ct.init(t, this.inviterSessionPublicKey, i, !0, c, void 0), l = Oe(), f = Ce(l), u = typeof r == "function" ? r : (g, h) => Promise.resolve(z.encrypt(g, et(r, h))), d = {
+    const i = Pe(), o = Be(i), s = this.inviter || this.inviterSessionPublicKey, a = W(this.linkSecret), c = ct.init(t, this.inviterSessionPublicKey, i, !0, a, void 0), l = Pe(), f = Be(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),
@@ -3805,11 +3860,11 @@ class nt {
     }, p = {
       kind: Me,
       pubkey: f,
-      content: z.encrypt(JSON.stringify(d), et(l, this.inviterSessionPublicKey)),
+      content: j.encrypt(JSON.stringify(d), et(l, this.inviterSessionPublicKey)),
       created_at: Math.floor(Date.now() / 1e3),
       tags: [["p", this.inviterSessionPublicKey]]
     };
-    return { channel: a, event: ae(p, l) };
+    return { channel: c, event: ae(p, l) };
   }
   listen(t, n, r) {
     if (!this.inviterSessionPrivateKey)
@@ -3820,13 +3875,13 @@ class nt {
     };
     return n(i, async (o) => {
       try {
-        const s = await z.decrypt(o.content, et(this.inviterSessionPrivateKey, o.pubkey)), c = JSON.parse(s);
-        if (!c.tags || !c.tags.some(([p, g]) => p === "secret" && g === this.linkSecret)) {
+        const s = await j.decrypt(o.content, et(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);
           return;
         }
-        const l = await (typeof t == "function" ? t : (p, g) => Promise.resolve(z.decrypt(p, et(t, g))))(c.content, c.pubkey), f = W(this.linkSecret), u = o.id, d = ct.init(n, l, this.inviterSessionPrivateKey, !1, f, u);
-        r(d, c.pubkey);
+        const l = await (typeof t == "function" ? t : (p, g) => Promise.resolve(j.decrypt(p, et(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);
       }
@@ -3838,10 +3893,10 @@ export {
   Me as EVENT_KIND,
   nt as InviteLink,
   Tc as MAX_SKIP,
-  Nc as Sender,
-  Oc as createMessageStream,
-  Pc as deserializeChannelState,
+  Cc as Sender,
+  Pc as createMessageStream,
+  Oc as deserializeChannelState,
   Re as kdf,
   Rc as serializeChannelState,
-  Rn as skippedMessageIndexKey
+  Lt as skippedMessageIndexKey
 };