nostr-double-ratchet 0.0.10 → 0.0.11

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

@@ -30,7 +30,7 @@ function ci(e, t) {
 }
 const St = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-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;
+const Mn = (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) {
@@ -39,7 +39,7 @@ function ui(e) {
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Zt(e) {
-  if (typeof e == "string" && (e = ui(e)), !Pn(e))
+  if (typeof e == "string" && (e = ui(e)), !Mn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -47,12 +47,12 @@ function fi(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!Pn(r))
+    if (!Mn(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
 }
-let Mn = class {
+let Pn = class {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
@@ -70,10 +70,10 @@ function Hn(e = 32) {
 function di(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
-  const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), a = Number(n & s), c = r ? 4 : 0, l = r ? 0 : 4;
-  e.setUint32(t + c, o, r), e.setUint32(t + l, a, r);
+  const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), c = Number(n & s), a = r ? 4 : 0, l = r ? 0 : 4;
+  e.setUint32(t + a, o, r), e.setUint32(t + l, c, r);
 }
-let yi = class extends Mn {
+let yi = class extends Pn {
   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 = At(this.buffer);
   }
@@ -83,14 +83,14 @@ let yi = class extends Mn {
     t = Zt(t);
     const s = t.length;
     for (let o = 0; o < s; ) {
-      const a = Math.min(i - this.pos, s - o);
-      if (a === i) {
-        const c = At(t);
+      const c = Math.min(i - this.pos, s - o);
+      if (c === i) {
+        const a = At(t);
         for (; i <= s - o; o += i)
-          this.process(c, o);
+          this.process(a, o);
         continue;
       }
-      r.set(t.subarray(o, o + a), this.pos), this.pos += a, o += a, this.pos === i && (this.process(n, 0), this.pos = 0);
+      r.set(t.subarray(o, o + c), this.pos), this.pos += c, o += c, 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 = o; u < i; u++)
       n[u] = 0;
     di(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const a = At(t), c = this.outputLen;
-    if (c % 4)
+    const c = At(t), a = this.outputLen;
+    if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const l = c / 4, f = this.get();
+    const l = a / 4, f = this.get();
     if (l > f.length)
       throw new Error("_sha2: outputLen bigger than state");
     for (let u = 0; u < l; u++)
-      a.setUint32(4 * u, f[u], s);
+      c.setUint32(4 * u, f[u], s);
   }
   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: s, destroyed: o, pos: a } = this;
-    return t.length = i, t.pos = a, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
+    const { blockLen: n, buffer: r, length: i, finished: s, destroyed: o, pos: c } = this;
+    return t.length = i, t.pos = c, t.finished = s, t.destroyed = o, 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: s, F: o, G: a, H: c } = this;
-    return [t, n, r, i, s, o, a, c];
+    const { A: t, B: n, C: r, D: i, E: s, F: o, G: c, H: a } = this;
+    return [t, n, r, i, s, o, c, a];
   }
   // prettier-ignore
-  set(t, n, r, i, s, o, a, c) {
-    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = s | 0, this.F = o | 0, this.G = a | 0, this.H = c | 0;
+  set(t, n, r, i, s, o, c, a) {
+    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = s | 0, this.F = o | 0, this.G = c | 0, this.H = a | 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: s, D: o, E: a, F: c, G: l, H: f } = this;
+    let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const d = ne(a, 6) ^ ne(a, 11) ^ ne(a, 25), p = f + d + pi(a, c, l) + wi[u] + we[u] | 0, h = (ne(r, 2) ^ ne(r, 13) ^ ne(r, 22)) + gi(r, i, s) | 0;
-      f = l, l = c, c = a, a = o + p | 0, o = s, s = i, i = r, r = p + h | 0;
+      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, s) | 0;
+      f = l, l = a, a = c, c = o + p | 0, o = s, s = i, i = r, r = p + h | 0;
     }
-    r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, a, c, l, f);
+    r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
   }
   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 Tt = /* @__PURE__ */ hi(() => new bi());
+const $t = /* @__PURE__ */ hi(() => new bi());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const qn = BigInt(0), ct = BigInt(1), vi = BigInt(2), lt = (e) => e instanceof Uint8Array, mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function qe(e) {
@@ -342,25 +342,25 @@ function jn(e, t, n) {
   let r = Kt(e), i = Kt(e), s = 0;
   const o = () => {
     r.fill(1), i.fill(0), s = 0;
-  }, a = (...u) => n(i, r, ...u), c = (u = Kt()) => {
-    i = a(En([0]), u), r = a(), u.length !== 0 && (i = a(En([1]), u), r = a());
+  }, 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());
   }, l = () => {
     if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
     const d = [];
     for (; u < t; ) {
-      r = a();
+      r = c();
       const p = r.slice();
       d.push(p), u += r.length;
     }
     return ke(...d);
   };
   return (u, d) => {
-    o(), c(u);
+    o(), a(u);
     let p;
     for (; !(p = d(l())); )
-      c();
+      a();
     return o(), p;
   };
 }
@@ -377,12 +377,12 @@ const Bi = {
 };
 function Je(e, t, n = {}) {
   const r = (i, s, o) => {
-    const a = Bi[s];
-    if (typeof a != "function")
+    const c = Bi[s];
+    if (typeof c != "function")
       throw new Error(`Invalid validator "${s}", expected function`);
-    const c = e[i];
-    if (!(o && c === void 0) && !a(c, e))
-      throw new Error(`Invalid param ${String(i)}=${c} (${typeof c}), expected ${s}`);
+    const a = e[i];
+    if (!(o && a === void 0) && !c(a, e))
+      throw new Error(`Invalid param ${String(i)}=${a} (${typeof a}), expected ${s}`);
   };
   for (const [i, s] of Object.entries(t))
     r(i, s, !1);
@@ -413,7 +413,7 @@ const Ci = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   validateObject: Je
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const V = BigInt(0), q = BigInt(1), Ne = BigInt(2), ki = BigInt(3), $t = BigInt(4), xn = BigInt(5), Sn = BigInt(8);
+const V = BigInt(0), q = BigInt(1), Ne = BigInt(2), ki = BigInt(3), Tt = BigInt(4), xn = BigInt(5), Sn = BigInt(8);
 BigInt(9);
 BigInt(16);
 function z(e, t) {
@@ -441,8 +441,8 @@ function Rt(e, t) {
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
   let n = z(e, t), r = t, i = V, s = q;
   for (; n !== V; ) {
-    const a = r / n, c = r % n, l = i - s * a;
-    r = n, n = c, i = s, s = l;
+    const c = r / n, a = r % n, l = i - s * c;
+    r = n, n = a, i = s, s = l;
   }
   if (r !== q)
     throw new Error("invert: does not exist");
@@ -456,34 +456,34 @@ function Ii(e) {
   for (i = Ne; i < e && Ui(i, t, e) !== e - q; i++)
     ;
   if (r === 1) {
-    const o = (e + q) / $t;
-    return function(c, l) {
-      const f = c.pow(l, o);
-      if (!c.eql(c.sqr(f), l))
+    const o = (e + q) / Tt;
+    return function(a, l) {
+      const f = a.pow(l, o);
+      if (!a.eql(a.sqr(f), l))
         throw new Error("Cannot find square root");
       return f;
     };
   }
   const s = (n + q) / Ne;
-  return function(a, c) {
-    if (a.pow(c, t) === a.neg(a.ONE))
+  return function(c, a) {
+    if (c.pow(a, t) === c.neg(c.ONE))
       throw new Error("Cannot find square root");
-    let l = r, f = a.pow(a.mul(a.ONE, i), n), u = a.pow(c, s), d = a.pow(c, n);
-    for (; !a.eql(d, a.ONE); ) {
-      if (a.eql(d, a.ZERO))
-        return a.ZERO;
+    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, s), d = c.pow(a, n);
+    for (; !c.eql(d, c.ONE); ) {
+      if (c.eql(d, c.ZERO))
+        return c.ZERO;
       let p = 1;
-      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;
+      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;
     }
     return u;
   };
 }
 function _i(e) {
-  if (e % $t === ki) {
-    const t = (e + q) / $t;
+  if (e % Tt === ki) {
+    const t = (e + q) / Tt;
     return function(r, i) {
       const s = r.pow(i, t);
       if (!r.eql(r.sqr(s), i))
@@ -494,7 +494,7 @@ function _i(e) {
   if (e % Sn === xn) {
     const t = (e - xn) / Sn;
     return function(r, i) {
-      const s = r.mul(i, Ne), o = r.pow(s, t), a = r.mul(i, o), c = r.mul(r.mul(a, Ne), o), l = r.mul(a, r.sub(c, r.ONE));
+      const s = r.mul(i, Ne), o = r.pow(s, t), c = r.mul(i, o), a = r.mul(r.mul(c, Ne), o), l = r.mul(c, r.sub(a, r.ONE));
       if (!r.eql(r.sqr(l), i))
         throw new Error("Cannot find square root");
       return l;
@@ -521,7 +521,7 @@ const Li = [
   "mulN",
   "sqrN"
 ];
-function Ti(e) {
+function $i(e) {
   const t = {
     ORDER: "bigint",
     MASK: "bigint",
@@ -530,7 +530,7 @@ function Ti(e) {
   }, n = Li.reduce((r, i) => (r[i] = "function", r), t);
   return Je(e, n);
 }
-function $i(e, t, n) {
+function Ti(e, t, n) {
   if (n < V)
     throw new Error("Expected power > 0");
   if (n === V)
@@ -543,8 +543,8 @@ function $i(e, t, n) {
   return r;
 }
 function Ri(e, t) {
-  const n = new Array(t.length), r = t.reduce((s, o, a) => e.is0(o) ? s : (n[a] = s, e.mul(s, o)), e.ONE), i = e.inv(r);
-  return t.reduceRight((s, o, a) => e.is0(o) ? s : (n[a] = e.mul(s, n[a]), e.mul(s, o)), i), n;
+  const n = new Array(t.length), r = t.reduce((s, o, c) => e.is0(o) ? s : (n[c] = s, e.mul(s, o)), e.ONE), i = e.inv(r);
+  return t.reduceRight((s, o, c) => e.is0(o) ? s : (n[c] = e.mul(s, n[c]), e.mul(s, o)), i), n;
 }
 function Vn(e, t) {
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
@@ -556,48 +556,48 @@ function Oi(e, t, n = !1, r = {}) {
   const { nBitLength: i, nByteLength: s } = Vn(e, t);
   if (s > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const o = _i(e), a = Object.freeze({
+  const o = _i(e), c = Object.freeze({
     ORDER: e,
     BITS: i,
     BYTES: s,
     MASK: Jt(i),
     ZERO: V,
     ONE: q,
-    create: (c) => z(c, e),
-    isValid: (c) => {
-      if (typeof c != "bigint")
-        throw new Error(`Invalid field element: expected bigint, got ${typeof c}`);
-      return V <= c && c < e;
+    create: (a) => z(a, e),
+    isValid: (a) => {
+      if (typeof a != "bigint")
+        throw new Error(`Invalid field element: expected bigint, got ${typeof a}`);
+      return V <= a && a < e;
     },
-    is0: (c) => c === V,
-    isOdd: (c) => (c & q) === q,
-    neg: (c) => z(-c, e),
-    eql: (c, l) => c === l,
-    sqr: (c) => z(c * c, e),
-    add: (c, l) => z(c + l, e),
-    sub: (c, l) => z(c - l, e),
-    mul: (c, l) => z(c * l, e),
-    pow: (c, l) => $i(a, c, l),
-    div: (c, l) => z(c * Rt(l, e), e),
+    is0: (a) => a === V,
+    isOdd: (a) => (a & q) === q,
+    neg: (a) => z(-a, e),
+    eql: (a, l) => a === l,
+    sqr: (a) => z(a * a, e),
+    add: (a, l) => z(a + l, e),
+    sub: (a, l) => z(a - l, e),
+    mul: (a, l) => z(a * l, e),
+    pow: (a, l) => Ti(c, a, l),
+    div: (a, l) => z(a * Rt(l, e), e),
     // Same as above, but doesn't normalize
-    sqrN: (c) => c * c,
-    addN: (c, l) => c + l,
-    subN: (c, l) => c - l,
-    mulN: (c, l) => c * l,
-    inv: (c) => Rt(c, e),
-    sqrt: r.sqrt || ((c) => o(a, c)),
-    invertBatch: (c) => Ri(a, c),
+    sqrN: (a) => a * a,
+    addN: (a, l) => a + l,
+    subN: (a, l) => a - l,
+    mulN: (a, l) => a * l,
+    inv: (a) => Rt(a, e),
+    sqrt: r.sqrt || ((a) => o(c, a)),
+    invertBatch: (a) => Ri(c, a),
     // TODO: do we really need constant cmov?
     // We don't have const-time bigints anyway, so probably will be not very useful
-    cmov: (c, l, f) => f ? l : c,
-    toBytes: (c) => n ? Gt(c, s) : xe(c, s),
-    fromBytes: (c) => {
-      if (c.length !== s)
-        throw new Error(`Fp.fromBytes: expected ${s}, got ${c.length}`);
-      return n ? Wt(c) : G(c);
+    cmov: (a, l, f) => f ? l : a,
+    toBytes: (a) => n ? Gt(a, s) : xe(a, s),
+    fromBytes: (a) => {
+      if (a.length !== s)
+        throw new Error(`Fp.fromBytes: expected ${s}, got ${a.length}`);
+      return n ? Wt(a) : G(a);
     }
   });
-  return Object.freeze(a);
+  return Object.freeze(c);
 }
 function zn(e) {
   if (typeof e != "bigint")
@@ -609,15 +609,15 @@ function Zn(e) {
   const t = zn(e);
   return t + Math.ceil(t / 2);
 }
-function Pi(e, t, n = !1) {
+function Mi(e, t, n = !1) {
   const r = e.length, i = zn(t), s = Zn(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error(`expected ${s}-1024 bytes of input, got ${r}`);
-  const o = n ? G(e) : Wt(e), a = z(o, t - q) + q;
-  return n ? Gt(a, i) : xe(a, i);
+  const o = n ? G(e) : Wt(e), c = z(o, t - q) + q;
+  return n ? Gt(c, i) : xe(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Mi = BigInt(0), Nt = BigInt(1);
+const Pi = BigInt(0), Nt = BigInt(1);
 function Hi(e, t) {
   const n = (i, s) => {
     const o = s.negate();
@@ -630,9 +630,9 @@ function Hi(e, t) {
     constTimeNegate: n,
     // non-const time multiplication ladder
     unsafeLadder(i, s) {
-      let o = e.ZERO, a = i;
-      for (; s > Mi; )
-        s & Nt && (o = o.add(a)), a = a.double(), s >>= Nt;
+      let o = e.ZERO, c = i;
+      for (; s > Pi; )
+        s & Nt && (o = o.add(c)), c = c.double(), s >>= Nt;
       return o;
     },
     /**
@@ -646,15 +646,15 @@ function Hi(e, t) {
      * @returns precomputed point tables flattened to a single array
      */
     precomputeWindow(i, s) {
-      const { windows: o, windowSize: a } = r(s), c = [];
+      const { windows: o, windowSize: c } = r(s), a = [];
       let l = i, f = l;
       for (let u = 0; u < o; u++) {
-        f = l, c.push(f);
-        for (let d = 1; d < a; d++)
-          f = f.add(l), c.push(f);
+        f = l, a.push(f);
+        for (let d = 1; d < c; d++)
+          f = f.add(l), a.push(f);
         l = f.double();
       }
-      return c;
+      return a;
     },
     /**
      * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
@@ -664,27 +664,27 @@ function Hi(e, t) {
      * @returns real and fake (for const-time) points
      */
     wNAF(i, s, o) {
-      const { windows: a, windowSize: c } = r(i);
+      const { windows: c, windowSize: a } = r(i);
       let l = e.ZERO, f = e.BASE;
       const u = BigInt(2 ** i - 1), d = 2 ** i, p = BigInt(i);
-      for (let g = 0; g < a; g++) {
-        const h = g * c;
+      for (let g = 0; g < c; g++) {
+        const h = g * a;
         let y = Number(o & u);
-        o >>= p, y > c && (y -= d, o += Nt);
+        o >>= p, y > a && (y -= d, o += Nt);
         const w = h, E = h + Math.abs(y) - 1, K = g % 2 !== 0, I = y < 0;
         y === 0 ? f = f.add(n(K, s[w])) : l = l.add(n(I, s[E]));
       }
       return { p: l, f };
     },
-    wNAFCached(i, s, o, a) {
-      const c = i._WINDOW_SIZE || 1;
+    wNAFCached(i, s, o, c) {
+      const a = i._WINDOW_SIZE || 1;
       let l = s.get(i);
-      return l || (l = this.precomputeWindow(i, c), c !== 1 && s.set(i, a(l))), this.wNAF(c, l, o);
+      return l || (l = this.precomputeWindow(i, a), a !== 1 && s.set(i, c(l))), this.wNAF(a, l, o);
     }
   };
 }
 function Fn(e) {
-  return Ti(e.Fp), Je(e, {
+  return $i(e.Fp), Je(e, {
     n: "bigint",
     h: "bigint",
     Gx: "field",
@@ -751,8 +751,8 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Be = {
       throw new t("Invalid signature tag");
     if (n[1] !== r - 2)
       throw new t("Invalid signature: incorrect length");
-    const { d: i, l: s } = Be._parseInt(n.subarray(2)), { d: o, l: a } = Be._parseInt(s);
-    if (a.length)
+    const { d: i, l: s } = Be._parseInt(n.subarray(2)), { d: o, l: c } = Be._parseInt(s);
+    if (c.length)
       throw new t("Invalid signature: left bytes after parsing");
     return { r: i, s: o };
   },
@@ -760,8 +760,8 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Be = {
     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)), s = r.length / 2, o = i.length / 2, a = n(s), c = n(o);
-    return `30${n(o + s + 4)}02${c}${i}02${a}${r}`;
+    }, r = t(n(e.s)), i = t(n(e.r)), s = r.length / 2, o = i.length / 2, c = n(s), a = n(o);
+    return `30${n(o + s + 4)}02${a}${i}02${c}${r}`;
   }
 }, ce = BigInt(0), Y = BigInt(1);
 BigInt(2);
@@ -784,11 +784,11 @@ function Vi(e) {
   function o(g) {
     return typeof g == "bigint" && ce < g && g < t.n;
   }
-  function a(g) {
+  function c(g) {
     if (!o(g))
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
-  function c(g) {
+  function a(g) {
     const { allowedPrivateKeyLengths: h, nByteLength: y, wrapPrivateKey: w, n: E } = t;
     if (h && typeof g != "bigint") {
       if (g instanceof Uint8Array && (g = qe(g)), typeof g != "string" || !h.includes(g.length))
@@ -801,7 +801,7 @@ function Vi(e) {
     } catch {
       throw new Error(`private key must be ${y} bytes, hex or bigint, not ${typeof g}`);
     }
-    return w && (K = z(K, E)), a(K), K;
+    return w && (K = z(K, E)), c(K), K;
   }
   const l = /* @__PURE__ */ new Map();
   function f(g) {
@@ -854,7 +854,7 @@ function Vi(e) {
     }
     // Multiplies generator point by privateKey.
     static fromPrivateKey(h) {
-      return u.BASE.multiply(c(h));
+      return u.BASE.multiply(a(h));
     }
     // "Private method", don't use it directly
     _setWindowSize(h) {
@@ -902,8 +902,8 @@ function Vi(e) {
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
       const { a: h, b: y } = t, w = n.mul(y, An), { px: E, py: K, pz: I } = this;
-      let C = n.ZERO, m = n.ZERO, x = n.ZERO, S = n.mul(E, E), P = n.mul(K, K), U = n.mul(I, I), N = n.mul(E, K);
-      return N = n.add(N, N), x = n.mul(E, I), x = n.add(x, x), C = n.mul(h, x), m = n.mul(w, U), m = n.add(C, m), C = n.sub(P, m), m = n.add(P, m), m = n.mul(C, m), C = n.mul(N, C), x = n.mul(w, x), U = n.mul(h, U), N = n.sub(S, U), N = n.mul(h, N), N = n.add(N, x), x = n.add(S, S), S = n.add(x, S), S = n.add(S, U), S = n.mul(S, N), m = n.add(m, S), U = n.mul(K, I), U = n.add(U, U), S = n.mul(U, N), C = n.sub(C, S), x = n.mul(U, P), x = n.add(x, x), x = n.add(x, x), new u(C, m, x);
+      let C = n.ZERO, m = n.ZERO, x = n.ZERO, S = n.mul(E, E), M = n.mul(K, K), U = n.mul(I, I), N = n.mul(E, K);
+      return N = n.add(N, N), x = n.mul(E, I), x = n.add(x, x), C = n.mul(h, x), m = n.mul(w, U), m = n.add(C, m), C = n.sub(M, m), m = n.add(M, m), m = n.mul(C, m), C = n.mul(N, C), x = n.mul(w, x), U = n.mul(h, U), N = n.sub(S, U), N = n.mul(h, N), N = n.add(N, x), x = n.add(S, S), S = n.add(x, S), S = n.add(S, U), S = n.mul(S, N), m = n.add(m, S), U = n.mul(K, I), U = n.add(U, U), S = n.mul(U, N), C = n.sub(C, S), x = n.mul(U, M), x = n.add(x, x), x = n.add(x, x), new u(C, m, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -913,11 +913,11 @@ function Vi(e) {
       f(h);
       const { px: y, py: w, pz: E } = this, { px: K, py: I, pz: C } = h;
       let m = n.ZERO, x = n.ZERO, S = n.ZERO;
-      const P = t.a, U = n.mul(t.b, An);
-      let N = n.mul(y, K), $ = n.mul(w, I), R = n.mul(E, C), H = n.add(y, w), b = n.add(K, I);
-      H = n.mul(H, b), b = n.add(N, $), H = n.sub(H, b), b = n.add(y, E);
+      const M = t.a, U = n.mul(t.b, An);
+      let N = n.mul(y, K), T = n.mul(w, I), R = n.mul(E, C), H = n.add(y, w), b = n.add(K, I);
+      H = n.mul(H, b), b = n.add(N, 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(N, R), b = n.sub(b, v), v = n.add(w, E), m = n.add(I, C), v = n.mul(v, m), m = n.add($, R), v = n.sub(v, m), S = n.mul(P, b), m = n.mul(U, R), S = n.add(m, S), m = n.sub($, S), S = n.add($, S), x = n.mul(m, S), $ = n.add(N, N), $ = n.add($, N), R = n.mul(P, R), b = n.mul(U, b), $ = n.add($, R), R = n.sub(N, R), R = n.mul(P, R), b = n.add(b, R), N = n.mul($, b), x = n.add(x, N), N = n.mul(v, b), m = n.mul(H, m), m = n.sub(m, N), N = n.mul(H, $), S = n.mul(v, S), S = n.add(S, N), new u(m, x, S);
+      return b = n.mul(b, v), v = n.add(N, R), b = n.sub(b, v), v = n.add(w, E), m = n.add(I, C), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), S = n.mul(M, 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(M, R), b = n.mul(U, b), T = n.add(T, R), R = n.sub(N, R), R = n.mul(M, 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,7 +940,7 @@ function Vi(e) {
       const y = u.ZERO;
       if (h === ce)
         return y;
-      if (a(h), h === Y)
+      if (c(h), h === Y)
         return this;
       const { endo: w } = t;
       if (!w)
@@ -960,13 +960,13 @@ function Vi(e) {
      * @returns New point
      */
     multiply(h) {
-      a(h);
+      c(h);
       let y = h, w, E;
       const { endo: K } = t;
       if (K) {
         const { k1neg: I, k1: C, k2neg: m, k2: x } = K.splitScalar(y);
-        let { p: S, f: P } = this.wNAF(C), { p: U, f: N } = this.wNAF(x);
-        S = p.constTimeNegate(I, S), U = p.constTimeNegate(m, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), w = S.add(U), E = P.add(N);
+        let { p: S, f: M } = this.wNAF(C), { p: U, f: N } = this.wNAF(x);
+        S = p.constTimeNegate(I, S), U = p.constTimeNegate(m, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), w = S.add(U), E = M.add(N);
       } else {
         const { p: I, f: C } = this.wNAF(y);
         w = I, E = C;
@@ -1020,7 +1020,7 @@ function Vi(e) {
   return {
     CURVE: t,
     ProjectivePoint: u,
-    normPrivateKeyToScalar: c,
+    normPrivateKeyToScalar: a,
     weierstrassEquation: s,
     isWithinCurveOrder: o
   };
@@ -1042,10 +1042,10 @@ function Zi(e) {
   function o(b) {
     return ce < b && b < n.ORDER;
   }
-  function a(b) {
+  function c(b) {
     return z(b, r);
   }
-  function c(b) {
+  function a(b) {
     return Rt(b, r);
   }
   const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: d } = Vi({
@@ -1062,8 +1062,8 @@ function Zi(e) {
           throw new Error("Point is not on curve");
         const _ = u(B);
         let O = n.sqrt(_);
-        const T = (O & Y) === Y;
-        return (A & 1) === 1 !== T && (O = n.neg(O)), { x: B, y: O };
+        const $ = (O & Y) === Y;
+        return (A & 1) === 1 !== $ && (O = n.neg(O)), { x: B, y: O };
       } else if (v === s && A === 4) {
         const B = n.fromBytes(k.subarray(0, n.BYTES)), _ = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
         return { x: B, y: _ };
@@ -1076,7 +1076,7 @@ function Zi(e) {
     return b > v;
   }
   function h(b) {
-    return g(b) ? a(-b) : b;
+    return g(b) ? c(-b) : b;
   }
   const y = (b, v, A) => G(b.slice(v, A));
   class w {
@@ -1110,7 +1110,7 @@ function Zi(e) {
       const O = B === 2 || B === 3 ? A + t.n : A;
       if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const T = B & 1 ? "03" : "02", X = l.fromHex(T + p(O)), ye = c(O), Ie = a(-_ * ye), ze = a(k * ye), pe = l.BASE.multiplyAndAddUnsafe(X, Ie, ze);
+      const $ = B & 1 ? "03" : "02", X = l.fromHex($ + p(O)), ye = a(O), Ie = c(-_ * ye), ze = c(k * ye), pe = l.BASE.multiplyAndAddUnsafe(X, Ie, ze);
       if (!pe)
         throw new Error("point at infinify");
       return pe.assertValidity(), pe;
@@ -1120,7 +1120,7 @@ function Zi(e) {
       return g(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new w(this.r, a(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new w(this.r, c(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
@@ -1152,7 +1152,7 @@ function Zi(e) {
      */
     randomPrivateKey: () => {
       const b = Zn(t.n);
-      return Pi(t.randomBytes(b), t.n);
+      return Mi(t.randomBytes(b), t.n);
     },
     /**
      * Creates precompute table for an arbitrary EC point. Makes point "cached".
@@ -1184,9 +1184,9 @@ function Zi(e) {
     const v = G(b), A = b.length * 8 - t.nBitLength;
     return A > 0 ? v >> BigInt(A) : v;
   }, x = t.bits2int_modN || function(b) {
-    return a(m(b));
+    return c(m(b));
   }, S = Jt(t.nBitLength);
-  function P(b) {
+  function M(b) {
     if (typeof b != "bigint")
       throw new Error("bigint expected");
     if (!(ce <= b && b < S))
@@ -1197,11 +1197,11 @@ function Zi(e) {
     if (["recovered", "canonical"].some((Ke) => Ke in A))
       throw new Error("sign() legacy options not supported");
     const { hash: k, randomBytes: B } = t;
-    let { lowS: _, prehash: O, extraEntropy: T } = A;
+    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 (T != null) {
-      const Ke = T === !0 ? B(n.BYTES) : T;
+    const X = x(b), ye = f(v), Ie = [M(ye), M(X)];
+    if ($ != null) {
+      const Ke = $ === !0 ? B(n.BYTES) : $;
       Ie.push(Z("extraEntropy", Ke));
     }
     const ze = ke(...Ie), pe = X;
@@ -1209,42 +1209,42 @@ function Zi(e) {
       const _e = m(Ke);
       if (!d(_e))
         return;
-      const wn = c(_e), Le = l.BASE.multiply(_e).toAffine(), Q = a(Le.x);
+      const wn = a(_e), Le = l.BASE.multiply(_e).toAffine(), Q = c(Le.x);
       if (Q === ce)
         return;
-      const Te = a(wn * a(pe + Q * ye));
-      if (Te === ce)
+      const $e = c(wn * c(pe + Q * ye));
+      if ($e === ce)
         return;
-      let bn = (Le.x === Q ? 0 : 2) | Number(Le.y & Y), vn = Te;
-      return _ && g(Te) && (vn = h(Te), bn ^= 1), new w(Q, vn, bn);
+      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);
     }
     return { seed: ze, k2sig: xt };
   }
-  const N = { lowS: t.lowS, prehash: !1 }, $ = { lowS: t.lowS, prehash: !1 };
+  const N = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
   function R(b, v, A = N) {
     const { seed: k, k2sig: B } = U(b, v, A), _ = t;
     return jn(_.hash.outputLen, _.nByteLength, _.hmac)(k, B);
   }
   l.BASE._setWindowSize(8);
-  function H(b, v, A, k = $) {
+  function H(b, v, A, k = T) {
     var Le;
     const B = b;
     if (v = Z("msgHash", v), A = Z("publicKey", A), "strict" in k)
       throw new Error("options.strict was renamed to lowS");
     const { lowS: _, prehash: O } = k;
-    let T, X;
+    let $, X;
     try {
       if (typeof B == "string" || B instanceof Uint8Array)
         try {
-          T = w.fromDER(B);
+          $ = w.fromDER(B);
         } catch (Q) {
           if (!(Q instanceof Be.Err))
             throw Q;
-          T = w.fromCompact(B);
+          $ = w.fromCompact(B);
         }
       else if (typeof B == "object" && typeof B.r == "bigint" && typeof B.s == "bigint") {
-        const { r: Q, s: Te } = B;
-        T = new w(Q, Te);
+        const { r: Q, s: $e } = B;
+        $ = new w(Q, $e);
       } else
         throw new Error("PARSE");
       X = l.fromHex(A);
@@ -1253,11 +1253,11 @@ function Zi(e) {
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
       return !1;
     }
-    if (_ && T.hasHighS())
+    if (_ && $.hasHighS())
       return !1;
     O && (v = t.hash(v));
-    const { r: ye, s: Ie } = T, ze = x(v), pe = c(Ie), xt = a(ze * pe), Ke = a(ye * pe), _e = (Le = l.BASE.multiplyAndAddUnsafe(X, xt, Ke)) == null ? void 0 : Le.toAffine();
-    return _e ? a(_e.x) === ye : !1;
+    const { r: ye, s: Ie } = $, ze = x(v), pe = a(Ie), 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;
   }
   return {
     CURVE: t,
@@ -1270,7 +1270,7 @@ function Zi(e) {
     utils: E
   };
 }
-let Wn = class extends Mn {
+let Wn = class extends Pn {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, ai(t);
     const r = Zt(n);
@@ -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: s, blockLen: o, outputLen: a } = this;
-    return t = t, t.finished = i, t.destroyed = s, t.blockLen = o, t.outputLen = a, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
+    const { oHash: n, iHash: r, finished: i, destroyed: s, blockLen: o, outputLen: c } = this;
+    return t = t, t.finished = i, t.destroyed = s, t.blockLen = o, t.outputLen = c, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
   }
   destroy() {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
@@ -1322,7 +1322,7 @@ function Wi(e, t) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const ut = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), rt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), it = BigInt(2), Kn = (e, t) => (e + t / it) / t;
 function Yn(e) {
-  const t = ut, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, d = J(u, n, t) * f % t, p = J(d, it, t) * l % t, g = J(p, i, t) * p % t, h = J(g, s, t) * g % t, y = J(h, a, t) * h % t, w = J(y, c, t) * y % t, E = J(w, a, t) * h % t, K = J(E, n, t) * f % t, I = J(K, o, t) * g % t, C = J(I, r, t) * l % t, m = J(C, it, t);
+  const t = ut, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, d = J(u, n, t) * f % t, p = J(d, it, t) * l % t, g = J(p, i, t) * p % t, h = J(g, s, t) * g % t, y = J(h, 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, I = J(K, o, t) * g % t, C = J(I, r, t) * l % t, m = J(C, it, t);
   if (!Ot.eql(Ot.sqr(m), e))
     throw new Error("Cannot find square root");
   return m;
@@ -1346,25 +1346,25 @@ const Ot = Oi(ut, void 0, void 0, { sqrt: Yn }), Ue = Wi({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
-      const t = rt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Jn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), a = Kn(s * e, t), c = Kn(-r * e, t);
-      let l = z(e - a * n - c * i, t), f = z(-a * r - c * s, t);
+      const t = rt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Jn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = Kn(s * e, t), a = Kn(-r * e, t);
+      let l = z(e - c * n - a * i, t), f = z(-c * r - a * s, t);
       const u = l > o, d = f > o;
       if (u && (l = t - l), d && (f = t - f), l > o || f > o)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
       return { k1neg: u, k1: l, k2neg: d, k2: f };
     }
   }
-}, Tt), ft = BigInt(0), Xn = (e) => typeof e == "bigint" && ft < e && e < ut, Gi = (e) => typeof e == "bigint" && ft < e && e < rt, Nn = {};
+}, $t), ft = BigInt(0), Xn = (e) => typeof e == "bigint" && ft < e && e < ut, Gi = (e) => typeof e == "bigint" && ft < e && e < rt, Nn = {};
 function st(e, ...t) {
   let n = Nn[e];
   if (n === void 0) {
-    const r = Tt(Uint8Array.from(e, (i) => i.charCodeAt(0)));
+    const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
     n = ke(r, r), Nn[e] = n;
   }
-  return Tt(ke(n, ...t));
+  return $t(ke(n, ...t));
 }
-const Yt = (e) => e.toRawBytes(!0).slice(1), Pt = (e) => xe(e, 32), Bt = (e) => z(e, ut), We = (e) => z(e, rt), Xt = Ue.ProjectivePoint, Ji = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
-function Mt(e) {
+const Yt = (e) => e.toRawBytes(!0).slice(1), Mt = (e) => xe(e, 32), Bt = (e) => z(e, ut), We = (e) => z(e, rt), Xt = Ue.ProjectivePoint, Ji = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
+function Pt(e) {
   let t = Ue.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
   return { scalar: n.hasEvenY() ? t : We(-t), bytes: Yt(n) };
 }
@@ -1381,28 +1381,28 @@ function er(...e) {
   return We(G(st("BIP0340/challenge", ...e)));
 }
 function Yi(e) {
-  return Mt(e).bytes;
+  return Pt(e).bytes;
 }
 function Xi(e, t, n = Hn(32)) {
-  const r = Z("message", e), { bytes: i, scalar: s } = Mt(t), o = Z("auxRand", n, 32), a = Pt(s ^ G(st("BIP0340/aux", o))), c = st("BIP0340/nonce", a, i, r), l = We(G(c));
+  const r = Z("message", e), { bytes: i, scalar: s } = Pt(t), o = Z("auxRand", n, 32), c = Mt(s ^ G(st("BIP0340/aux", o))), a = st("BIP0340/nonce", c, i, r), l = We(G(a));
   if (l === ft)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Mt(l), d = er(f, i, r), p = new Uint8Array(64);
-  if (p.set(f, 0), p.set(Pt(We(u + d * s)), 32), !tr(p, r, i))
+  const { bytes: f, scalar: u } = Pt(l), d = er(f, i, r), p = new Uint8Array(64);
+  if (p.set(f, 0), p.set(Mt(We(u + d * s)), 32), !tr(p, r, i))
     throw new Error("sign: Invalid signature produced");
   return p;
 }
 function tr(e, t, n) {
   const r = Z("signature", e, 64), i = Z("message", t), s = Z("publicKey", n, 32);
   try {
-    const o = Qn(G(s)), a = G(r.subarray(0, 32));
-    if (!Xn(a))
+    const o = Qn(G(s)), c = G(r.subarray(0, 32));
+    if (!Xn(c))
       return !1;
-    const c = G(r.subarray(32, 64));
-    if (!Gi(c))
+    const a = G(r.subarray(32, 64));
+    if (!Gi(a))
       return !1;
-    const l = er(Pt(a), Yt(o), i), f = Ji(o, c, We(-l));
-    return !(!f || !f.hasEvenY() || f.toAffine().x !== a);
+    const l = er(Mt(c), Yt(o), i), f = Ji(o, a, We(-l));
+    return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
   } catch {
     return !1;
   }
@@ -1426,7 +1426,7 @@ const Qt = (e) => e instanceof Uint8Array, kt = (e) => new DataView(e.buffer, e.
 if (!Qi)
   throw new Error("Non little-endian hardware is not supported");
 const es = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function M(e) {
+function P(e) {
   if (!Qt(e))
     throw new Error("Uint8Array expected");
   let t = "";
@@ -1525,8 +1525,8 @@ const se = {
 function os(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
-  const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), a = Number(n & s), c = r ? 4 : 0, l = r ? 0 : 4;
-  e.setUint32(t + c, o, r), e.setUint32(t + l, a, r);
+  const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), c = Number(n & s), a = r ? 4 : 0, l = r ? 0 : 4;
+  e.setUint32(t + a, o, r), e.setUint32(t + l, c, r);
 }
 class as extends nr {
   constructor(t, n, r, i) {
@@ -1538,14 +1538,14 @@ class as extends nr {
     t = Ge(t);
     const s = t.length;
     for (let o = 0; o < s; ) {
-      const a = Math.min(i - this.pos, s - o);
-      if (a === i) {
-        const c = kt(t);
+      const c = Math.min(i - this.pos, s - o);
+      if (c === i) {
+        const a = kt(t);
         for (; i <= s - o; o += i)
-          this.process(c, o);
+          this.process(a, o);
         continue;
       }
-      r.set(t.subarray(o, o + a), this.pos), this.pos += a, o += a, this.pos === i && (this.process(n, 0), this.pos = 0);
+      r.set(t.subarray(o, o + c), this.pos), this.pos += c, o += c, this.pos === i && (this.process(n, 0), this.pos = 0);
     }
     return this.length += t.length, this.roundClean(), this;
   }
@@ -1557,14 +1557,14 @@ class as extends nr {
     for (let u = o; u < i; u++)
       n[u] = 0;
     os(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const a = kt(t), c = this.outputLen;
-    if (c % 4)
+    const c = kt(t), a = this.outputLen;
+    if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const l = c / 4, f = this.get();
+    const l = a / 4, f = this.get();
     if (l > f.length)
       throw new Error("_sha2: outputLen bigger than state");
     for (let u = 0; u < l; u++)
-      a.setUint32(4 * u, f[u], s);
+      c.setUint32(4 * u, f[u], s);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -1574,8 +1574,8 @@ class as extends nr {
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: r, length: i, finished: s, destroyed: o, pos: a } = this;
-    return t.length = i, t.pos = a, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
+    const { blockLen: n, buffer: r, length: i, finished: s, destroyed: o, pos: c } = this;
+    return t.length = i, t.pos = c, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 }
 const cs = (e, t, n) => e & t ^ ~e & n, ls = (e, t, n) => e & t ^ e & n ^ t & n, us = new Uint32Array([
@@ -1658,12 +1658,12 @@ class or extends as {
     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: s, F: o, G: a, H: c } = this;
-    return [t, n, r, i, s, o, a, c];
+    const { A: t, B: n, C: r, D: i, E: s, F: o, G: c, H: a } = this;
+    return [t, n, r, i, s, o, c, a];
   }
   // prettier-ignore
-  set(t, n, r, i, s, o, a, c) {
-    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = s | 0, this.F = o | 0, this.G = a | 0, this.H = c | 0;
+  set(t, n, r, i, s, o, c, a) {
+    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = s | 0, this.F = o | 0, this.G = c | 0, this.H = a | 0;
   }
   process(t, n) {
     for (let u = 0; u < 16; u++, n += 4)
@@ -1672,12 +1672,12 @@ class or extends as {
       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: s, D: o, E: a, F: c, G: l, H: f } = this;
+    let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const d = re(a, 6) ^ re(a, 11) ^ re(a, 25), p = f + d + cs(a, c, l) + us[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ls(r, i, s) | 0;
-      f = l, l = c, c = a, a = o + p | 0, o = s, s = i, i = r, r = p + h | 0;
+      const d = re(c, 6) ^ re(c, 11) ^ re(c, 25), p = f + d + cs(c, a, l) + us[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ls(r, i, s) | 0;
+      f = l, l = a, a = c, c = o + p | 0, o = s, s = i, i = r, r = p + h | 0;
     }
-    r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, a, c, l, f);
+    r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
   }
   roundClean() {
     ve.fill(0);
@@ -1796,18 +1796,18 @@ function Bn(e, t, n) {
     if (Ve(o), o < 0 || o >= t)
       throw new Error(`Wrong integer: ${o}`);
   }); ; ) {
-    let o = 0, a = !0;
-    for (let c = r; c < s.length; c++) {
-      const l = s[c], f = t * o + l;
+    let o = 0, c = !0;
+    for (let a = r; a < s.length; a++) {
+      const l = s[a], f = t * o + l;
       if (!Number.isSafeInteger(f) || t * o / t !== o || f - l !== t * o)
         throw new Error("convertRadix: carry overflow");
-      if (o = f % n, s[c] = Math.floor(f / n), !Number.isSafeInteger(s[c]) || s[c] * n + o !== f)
+      if (o = f % n, s[a] = Math.floor(f / n), !Number.isSafeInteger(s[a]) || s[a] * n + o !== f)
         throw new Error("convertRadix: carry overflow");
-      if (a)
-        s[c] ? a = !1 : r = c;
+      if (c)
+        s[a] ? c = !1 : r = a;
       else continue;
     }
-    if (i.push(o), a)
+    if (i.push(o), c)
       break;
   }
   for (let o = 0; o < e.length - 1 && e[o] === 0; o++)
@@ -1825,21 +1825,21 @@ function qt(e, t, n, r) {
   if (ot(t, n) > 32)
     throw new Error(`convertRadix2: carry overflow from=${t} to=${n} carryBits=${ot(t, n)}`);
   let i = 0, s = 0;
-  const o = 2 ** n - 1, a = [];
-  for (const c of e) {
-    if (Ve(c), c >= 2 ** t)
-      throw new Error(`convertRadix2: invalid data word=${c} from=${t}`);
-    if (i = i << t | c, s + t > 32)
+  const o = 2 ** n - 1, c = [];
+  for (const a of e) {
+    if (Ve(a), a >= 2 ** t)
+      throw new Error(`convertRadix2: invalid data word=${a} from=${t}`);
+    if (i = i << t | a, s + t > 32)
       throw new Error(`convertRadix2: carry overflow pos=${s} from=${t}`);
     for (s += t; s >= n; s -= n)
-      a.push((i >> s - n & o) >>> 0);
+      c.push((i >> s - n & o) >>> 0);
     i &= 2 ** s - 1;
   }
   if (i = i << n - s & o, !r && s >= t)
     throw new Error("Excess padding");
   if (!r && i)
     throw new Error(`Non-zero padding: ${i}`);
-  return r && s > 0 && a.push(i >>> 0), a;
+  return r && s > 0 && c.push(i >>> 0), c;
 }
 function hs(e) {
   return Ve(e), {
@@ -1947,7 +1947,7 @@ function lr(e) {
       throw new TypeError(`Length ${p} exceeds limit ${d}`);
     return f = f.toLowerCase(), `${f}1${jt.encode(u)}${In(f, u, t)}`;
   }
-  function a(f, u = 90) {
+  function c(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)
@@ -1967,12 +1967,12 @@ function lr(e) {
       throw new Error(`Invalid checksum in ${f}: expected "${w}"`);
     return { prefix: g, words: y };
   }
-  const c = Cn(a);
+  const a = Cn(c);
   function l(f) {
-    const { prefix: u, words: d } = a(f, !1);
+    const { prefix: u, words: d } = c(f, !1);
     return { prefix: u, words: d, bytes: r(d) };
   }
-  return { encode: o, decode: a, decodeToBytes: l, decodeUnsafe: c, fromWords: r, fromWordsUnsafe: s, toWords: i };
+  return { encode: o, decode: c, decodeToBytes: l, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
 const je = lr("bech32");
 lr("bech32m");
@@ -2032,7 +2032,7 @@ const As = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ee = 1
 function tn(e) {
   return e << 1 ^ Ks & -(e >> 7);
 }
-function Pe(e, t) {
+function Me(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
     n ^= e & -(t & 1), e = tn(e);
@@ -2053,15 +2053,15 @@ const Vt = /* @__PURE__ */ (() => {
 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(It), i = r.map(It), s = i.map(It), o = new Uint32Array(256 * 256), a = new Uint32Array(256 * 256), c = new Uint16Array(256 * 256);
+  const n = new Uint32Array(256).map((l, f) => t(e[f])), r = n.map(It), i = r.map(It), s = i.map(It), o = new Uint32Array(256 * 256), c = new Uint32Array(256 * 256), a = new Uint16Array(256 * 256);
   for (let l = 0; l < 256; l++)
     for (let f = 0; f < 256; f++) {
       const u = l * 256 + f;
-      o[u] = n[l] ^ r[f], a[u] = i[l] ^ s[f], c[u] = e[l] << 8 | e[f];
+      o[u] = n[l] ^ r[f], c[u] = i[l] ^ s[f], a[u] = e[l] << 8 | e[f];
     }
-  return { sbox: e, sbox2: c, T0: n, T1: r, T2: i, T3: s, T01: o, T23: a };
+  return { sbox: e, sbox2: a, T0: n, T1: r, T2: i, T3: s, T01: o, T23: c };
 }
-const nn = /* @__PURE__ */ ur(Vt, (e) => Pe(e, 3) << 24 | e << 16 | e << 8 | Pe(e, 2)), fr = /* @__PURE__ */ ur(Ns, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), Cs = /* @__PURE__ */ (() => {
+const nn = /* @__PURE__ */ ur(Vt, (e) => Me(e, 3) << 24 | e << 16 | e << 8 | Me(e, 2)), fr = /* @__PURE__ */ ur(Ns, (e) => Me(e, 11) << 24 | Me(e, 13) << 16 | Me(e, 9) << 8 | Me(e, 14)), Cs = /* @__PURE__ */ (() => {
   const e = new Uint8Array(16);
   for (let t = 0, n = 1; t < 16; t++, n = tn(n))
     e[t] = n;
@@ -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 } = nn, r = F(e), i = r.length, s = (a) => oe(n, a, a, a, a), o = new Uint32Array(t + 28);
+  const { sbox2: n } = nn, r = F(e), i = r.length, s = (c) => oe(n, c, c, c, c), o = new Uint32Array(t + 28);
   o.set(r);
-  for (let a = i; a < o.length; a++) {
-    let c = o[a - 1];
-    a % i === 0 ? c = s(Bs(c)) ^ Cs[a / i - 1] : i > 6 && a % i === 4 && (c = s(c)), o[a] = o[a - i] ^ c;
+  for (let c = i; c < o.length; c++) {
+    let a = o[c - 1];
+    c % i === 0 ? a = s(Bs(a)) ^ Cs[c / i - 1] : i > 6 && c % i === 4 && (a = s(a)), o[c] = o[c - i] ^ a;
   }
   return o;
 }
 function ks(e) {
-  const t = hr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: a, T3: c } = fr;
+  const t = hr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: c, T3: a } = 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 = oe(i, f, f, f, f);
-    n[l] = s[u & 255] ^ o[u >>> 8 & 255] ^ a[u >>> 16 & 255] ^ c[u >>> 24];
+    n[l] = s[u & 255] ^ o[u >>> 8 & 255] ^ c[u >>> 16 & 255] ^ a[u >>> 24];
   }
   return n;
 }
@@ -2099,27 +2099,27 @@ function oe(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: s, T01: o, T23: a } = nn;
-  let c = 0;
-  t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
+  const { sbox2: s, T01: o, T23: c } = nn;
+  let a = 0;
+  t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
   for (let g = 0; g < l; g++) {
-    const h = e[c++] ^ me(o, a, t, n, r, i), y = e[c++] ^ me(o, a, n, r, i, t), w = e[c++] ^ me(o, a, r, i, t, n), E = e[c++] ^ me(o, a, i, t, n, r);
+    const h = e[a++] ^ me(o, c, t, n, r, i), y = e[a++] ^ me(o, c, n, r, i, t), w = e[a++] ^ me(o, c, r, i, t, n), E = e[a++] ^ me(o, c, i, t, n, r);
     t = h, n = y, r = w, i = E;
   }
-  const f = e[c++] ^ oe(s, t, n, r, i), u = e[c++] ^ oe(s, n, r, i, t), d = e[c++] ^ oe(s, r, i, t, n), p = e[c++] ^ oe(s, i, t, n, r);
+  const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), d = e[a++] ^ oe(s, r, i, t, n), p = e[a++] ^ oe(s, i, t, n, r);
   return { s0: f, s1: u, s2: d, s3: p };
 }
 function Us(e, t, n, r, i) {
-  const { sbox2: s, T01: o, T23: a } = fr;
-  let c = 0;
-  t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
+  const { sbox2: s, T01: o, T23: c } = fr;
+  let a = 0;
+  t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
   for (let g = 0; g < l; g++) {
-    const h = e[c++] ^ me(o, a, t, i, r, n), y = e[c++] ^ me(o, a, n, t, i, r), w = e[c++] ^ me(o, a, r, n, t, i), E = e[c++] ^ me(o, a, i, r, n, t);
+    const h = e[a++] ^ me(o, c, t, i, r, n), y = e[a++] ^ me(o, c, n, t, i, r), w = e[a++] ^ me(o, c, r, n, t, i), E = e[a++] ^ me(o, c, i, r, n, t);
     t = h, n = y, r = w, i = E;
   }
-  const f = e[c++] ^ oe(s, t, i, r, n), u = e[c++] ^ oe(s, n, t, i, r), d = e[c++] ^ oe(s, r, n, t, i), p = e[c++] ^ oe(s, i, r, n, t);
+  const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), d = e[a++] ^ oe(s, r, n, t, i), p = e[a++] ^ oe(s, i, r, n, t);
   return { s0: f, s1: u, s2: d, s3: p };
 }
 function dr(e, t) {
@@ -2140,11 +2140,11 @@ function _s(e, t, n) {
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
   const s = F(e);
   if (t) {
-    let c = Ee - i;
-    c || (c = Ee), r = r + c;
+    let a = Ee - i;
+    a || (a = Ee), r = r + a;
   }
-  const o = dr(r, n), a = F(o);
-  return { b: s, o: a, out: o };
+  const o = dr(r, n), c = F(o);
+  return { b: s, o: c, out: o };
 }
 function Ls(e, t) {
   if (!t)
@@ -2161,7 +2161,7 @@ function Ls(e, t) {
       throw new Error("aes/pcks5: wrong padding");
   return i;
 }
-function Ts(e) {
+function $s(e) {
   const t = new Uint8Array(16), n = F(t);
   t.set(e);
   const r = Ee - e.length;
@@ -2174,30 +2174,30 @@ const yr = /* @__PURE__ */ As({ blockSize: 16, nonceLength: 16 }, function(t, n,
   const i = !r.disablePadding;
   return {
     encrypt: (s, o) => {
-      const a = hr(t), { b: c, o: l, out: f } = _s(s, i, o), u = F(n);
+      const c = hr(t), { b: a, o: l, out: f } = _s(s, i, o), u = F(n);
       let d = u[0], p = u[1], g = u[2], h = u[3], y = 0;
-      for (; y + 4 <= c.length; )
-        d ^= c[y + 0], p ^= c[y + 1], g ^= c[y + 2], h ^= c[y + 3], { s0: d, s1: p, s2: g, s3: h } = Ln(a, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
+      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;
       if (i) {
-        const w = Ts(s.subarray(y * 4));
-        d ^= w[0], p ^= w[1], g ^= w[2], h ^= w[3], { s0: d, s1: p, s2: g, s3: h } = Ln(a, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
+        const w = $s(s.subarray(y * 4));
+        d ^= w[0], p ^= w[1], g ^= w[2], h ^= w[3], { s0: d, s1: p, s2: g, s3: h } = Ln(c, d, p, g, h), l[y++] = d, l[y++] = p, l[y++] = g, l[y++] = h;
       }
-      return a.fill(0), f;
+      return c.fill(0), f;
     },
     decrypt: (s, o) => {
       Is(s);
-      const a = ks(t), c = F(n), l = dr(s.length, o), f = F(s), u = F(l);
-      let d = c[0], p = c[1], g = c[2], h = c[3];
+      const c = ks(t), a = F(n), l = dr(s.length, o), f = F(s), u = F(l);
+      let d = a[0], p = a[1], g = a[2], h = a[3];
       for (let y = 0; y + 4 <= f.length; ) {
         const w = d, E = p, K = g, I = h;
         d = f[y + 0], p = f[y + 1], g = f[y + 2], h = f[y + 3];
-        const { s0: C, s1: m, s2: x, s3: S } = Us(a, d, p, g, h);
+        const { s0: C, s1: m, s2: x, s3: S } = Us(c, d, p, g, h);
         u[y++] = C ^ w, u[y++] = m ^ E, u[y++] = x ^ K, u[y++] = S ^ I;
       }
-      return a.fill(0), Ls(l, i);
+      return c.fill(0), Ls(l, i);
     }
   };
-}), pr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), $s = pr("expand 16-byte k"), Rs = pr("expand 32-byte k"), Os = F($s), gr = F(Rs);
+}), pr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Ts = pr("expand 16-byte k"), Rs = pr("expand 32-byte k"), Os = F(Ts), gr = F(Rs);
 gr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
@@ -2205,18 +2205,18 @@ function L(e, t) {
 function zt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Xe = 64, Ps = 16, wr = 2 ** 32 - 1, Tn = new Uint32Array();
-function Ms(e, t, n, r, i, s, o, a) {
-  const c = i.length, l = new Uint8Array(Xe), f = F(l), u = zt(i) && zt(s), d = u ? F(i) : Tn, p = u ? F(s) : Tn;
-  for (let g = 0; g < c; o++) {
-    if (e(t, n, r, f, o, a), o >= wr)
+const Xe = 64, Ms = 16, wr = 2 ** 32 - 1, $n = new Uint32Array();
+function Ps(e, t, n, r, i, s, o, c) {
+  const a = i.length, l = new Uint8Array(Xe), f = F(l), u = zt(i) && zt(s), d = u ? F(i) : $n, p = u ? F(s) : $n;
+  for (let g = 0; g < a; o++) {
+    if (e(t, n, r, f, o, c), o >= wr)
       throw new Error("arx: counter overflow");
-    const h = Math.min(Xe, c - g);
+    const h = Math.min(Xe, a - g);
     if (u && h === Xe) {
       const y = g / 4;
       if (g % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let w = 0, E; w < Ps; w++)
+      for (let w = 0, E; w < Ms; w++)
         E = y + w, p[E] = d[E] ^ f[w];
       g += Xe;
       continue;
@@ -2230,47 +2230,47 @@ function Hs(e, t) {
   const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = xs({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return Ut(i), Ut(o), _n(s), _n(n), (a, c, l, f, u = 0) => {
-    le(a), le(c), le(l);
+  return Ut(i), Ut(o), _n(s), _n(n), (c, a, l, f, u = 0) => {
+    le(c), le(a), 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 = a.length, h, y;
+    let g = c.length, h, y;
     if (g === 32)
-      h = a.slice(), p.push(h), y = gr;
+      h = c.slice(), p.push(h), y = gr;
     else if (g === 16 && n)
-      h = new Uint8Array(32), h.set(a), h.set(a, 16), y = Os, p.push(h);
+      h = new Uint8Array(32), h.set(c), h.set(c, 16), y = Os, p.push(h);
     else
       throw new Error(`arx: invalid 32-byte key, got length=${g}`);
-    zt(c) || (c = c.slice(), p.push(c));
+    zt(a) || (a = a.slice(), p.push(a));
     const w = F(h);
     if (r) {
-      if (c.length !== 24)
+      if (a.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(y, w, F(c.subarray(0, 16)), w), c = c.subarray(16);
+      r(y, w, F(a.subarray(0, 16)), w), a = a.subarray(16);
     }
     const E = 16 - i;
-    if (E !== c.length)
+    if (E !== a.length)
       throw new Error(`arx: nonce must be ${E} or 16 bytes`);
     if (E !== 12) {
       const I = new Uint8Array(12);
-      I.set(c, s ? 0 : 12 - c.length), c = I, p.push(c);
+      I.set(a, s ? 0 : 12 - a.length), a = I, p.push(a);
     }
-    const K = F(c);
-    for (Ms(e, y, w, K, l, f, u, o); p.length > 0; )
+    const K = F(a);
+    for (Ps(e, y, w, K, l, f, u, o); p.length > 0; )
       p.pop().fill(0);
     return f;
   };
 }
 function qs(e, t, n, r, i, s = 20) {
-  let o = e[0], a = e[1], c = e[2], l = e[3], f = t[0], u = t[1], d = t[2], p = t[3], g = t[4], h = t[5], y = t[6], w = t[7], E = i, K = n[0], I = n[1], C = n[2], m = o, x = a, S = c, P = l, U = f, N = u, $ = d, R = p, H = g, b = h, v = y, A = w, k = E, B = K, _ = I, O = C;
+  let o = 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], I = n[1], C = n[2], m = o, x = c, S = a, M = l, U = f, N = u, T = d, R = p, H = g, b = h, v = y, A = w, k = E, B = K, _ = I, O = C;
   for (let X = 0; X < s; X += 2)
-    m = m + U | 0, k = L(k ^ m, 16), H = H + k | 0, U = L(U ^ H, 12), m = m + U | 0, k = L(k ^ m, 8), H = H + k | 0, U = L(U ^ H, 7), x = x + N | 0, B = L(B ^ x, 16), b = b + B | 0, N = L(N ^ b, 12), x = x + N | 0, B = L(B ^ x, 8), b = b + B | 0, N = L(N ^ b, 7), S = S + $ | 0, _ = L(_ ^ S, 16), v = v + _ | 0, $ = L($ ^ v, 12), S = S + $ | 0, _ = L(_ ^ S, 8), v = v + _ | 0, $ = L($ ^ v, 7), P = P + R | 0, O = L(O ^ P, 16), A = A + O | 0, R = L(R ^ A, 12), P = P + R | 0, O = L(O ^ P, 8), A = A + O | 0, R = L(R ^ A, 7), m = m + N | 0, O = L(O ^ m, 16), v = v + O | 0, N = L(N ^ v, 12), m = m + N | 0, O = L(O ^ m, 8), v = v + O | 0, N = L(N ^ v, 7), x = x + $ | 0, k = L(k ^ x, 16), A = A + k | 0, $ = L($ ^ A, 12), x = x + $ | 0, k = L(k ^ x, 8), A = A + k | 0, $ = L($ ^ A, 7), S = S + R | 0, B = L(B ^ S, 16), H = H + B | 0, R = L(R ^ H, 12), S = S + R | 0, B = L(B ^ S, 8), H = H + B | 0, R = L(R ^ H, 7), P = P + U | 0, _ = L(_ ^ P, 16), b = b + _ | 0, U = L(U ^ b, 12), P = P + U | 0, _ = L(_ ^ P, 8), b = b + _ | 0, U = L(U ^ b, 7);
-  let T = 0;
-  r[T++] = o + m | 0, r[T++] = a + x | 0, r[T++] = c + S | 0, r[T++] = l + P | 0, r[T++] = f + U | 0, r[T++] = u + N | 0, r[T++] = d + $ | 0, r[T++] = p + R | 0, r[T++] = g + H | 0, r[T++] = h + b | 0, r[T++] = y + v | 0, r[T++] = w + A | 0, r[T++] = E + k | 0, r[T++] = K + B | 0, r[T++] = I + _ | 0, r[T++] = C + O | 0;
+    m = m + U | 0, k = L(k ^ m, 16), H = H + k | 0, U = L(U ^ H, 12), m = m + U | 0, k = L(k ^ m, 8), H = H + k | 0, U = L(U ^ H, 7), x = x + N | 0, B = L(B ^ x, 16), b = b + B | 0, N = L(N ^ b, 12), x = x + N | 0, B = L(B ^ x, 8), b = b + B | 0, N = L(N ^ b, 7), S = S + 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), M = M + R | 0, O = L(O ^ M, 16), A = A + O | 0, R = L(R ^ A, 12), M = M + R | 0, O = L(O ^ M, 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, B = L(B ^ S, 16), H = H + B | 0, R = L(R ^ H, 12), S = S + R | 0, B = L(B ^ S, 8), H = H + B | 0, R = L(R ^ H, 7), M = M + U | 0, _ = L(_ ^ M, 16), b = b + _ | 0, U = L(U ^ b, 12), M = M + U | 0, _ = L(_ ^ M, 8), b = b + _ | 0, U = L(U ^ b, 7);
+  let $ = 0;
+  r[$++] = o + m | 0, r[$++] = c + x | 0, r[$++] = a + S | 0, r[$++] = l + M | 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 + B | 0, r[$++] = I + _ | 0, r[$++] = C + O | 0;
 }
 const br = /* @__PURE__ */ Hs(qs, {
   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: s, blockLen: o, outputLen: a } = this;
-    return t = t, t.finished = i, t.destroyed = s, t.blockLen = o, t.outputLen = a, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
+    const { oHash: n, iHash: r, finished: i, destroyed: s, blockLen: o, outputLen: c } = this;
+    return t = t, t.finished = i, t.destroyed = s, t.blockLen = o, t.outputLen = c, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
   }
   destroy() {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
@@ -2317,21 +2317,21 @@ yt.create = (e, t) => new vr(e, t);
 function rn(e, t, n) {
   return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), yt(e, Ge(n), Ge(t));
 }
-const _t = new Uint8Array([0]), $n = new Uint8Array();
+const _t = new Uint8Array([0]), Tn = new Uint8Array();
 function mr(e, t, n, r = 32) {
   if (se.hash(e), se.number(r), r > 255 * e.outputLen)
     throw new Error("Length should be <= 255*HashLen");
   const i = Math.ceil(r / e.outputLen);
-  n === void 0 && (n = $n);
-  const s = new Uint8Array(i * e.outputLen), o = yt.create(e, t), a = o._cloneInto(), c = new Uint8Array(o.outputLen);
+  n === void 0 && (n = Tn);
+  const s = new Uint8Array(i * e.outputLen), o = yt.create(e, t), c = o._cloneInto(), a = new Uint8Array(o.outputLen);
   for (let l = 0; l < i; l++)
-    _t[0] = l + 1, a.update(l === 0 ? $n : c).update(n).update(_t).digestInto(c), s.set(c, e.outputLen * l), o._cloneInto(a);
-  return o.destroy(), a.destroy(), c.fill(0), _t.fill(0), s.slice(0, r);
+    _t[0] = l + 1, c.update(l === 0 ? Tn : a).update(n).update(_t).digestInto(a), s.set(a, e.outputLen * l), o._cloneInto(c);
+  return o.destroy(), c.destroy(), a.fill(0), _t.fill(0), s.slice(0, r);
 }
 var Ds = Object.defineProperty, D = (e, t) => {
   for (var n in t)
     Ds(e, n, { get: t[n], enumerable: !0 });
-}, $e = Symbol("verified"), js = (e) => e instanceof Object;
+}, Te = Symbol("verified"), js = (e) => e instanceof Object;
 function Er(e) {
   if (!js(e) || typeof e.kind != "number" || typeof e.content != "string" || typeof e.created_at != "number" || typeof e.pubkey != "string" || !e.pubkey.match(/^[a-f0-9]{64}$/) || !Array.isArray(e.tags))
     return !1;
@@ -2412,23 +2412,23 @@ var xr = class {
     return Ze.utils.randomPrivateKey();
   }
   getPublicKey(e) {
-    return M(Ze.getPublicKey(e));
+    return P(Ze.getPublicKey(e));
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = M(Ze.getPublicKey(t)), n.id = tt(n), n.sig = M(Ze.sign(tt(n), t)), n[$e] = !0, n;
+    return n.pubkey = P(Ze.getPublicKey(t)), n.id = tt(n), n.sig = P(Ze.sign(tt(n), t)), n[Te] = !0, n;
   }
   verifyEvent(e) {
-    if (typeof e[$e] == "boolean")
-      return e[$e];
+    if (typeof e[Te] == "boolean")
+      return e[Te];
     const t = tt(e);
     if (t !== e.id)
-      return e[$e] = !1, !1;
+      return e[Te] = !1, !1;
     try {
       const n = Ze.verify(e.sig, t, e.pubkey);
-      return e[$e] = n, n;
+      return e[Te] = n, n;
     } catch {
-      return e[$e] = !1, !1;
+      return e[Te] = !1, !1;
     }
   }
 };
@@ -2439,9 +2439,9 @@ function Js(e) {
 }
 function tt(e) {
   let t = Se(te.encode(Js(e)));
-  return M(t);
+  return P(t);
 }
-var pt = new Gs(), Me = pt.generateSecretKey, Ce = pt.getPublicKey, ae = pt.finalizeEvent, gt = pt.verifyEvent, Ys = {};
+var pt = new Gs(), Pe = pt.generateSecretKey, Ce = pt.getPublicKey, ae = pt.finalizeEvent, gt = pt.verifyEvent, Ys = {};
 D(Ys, {
   Application: () => Xo,
   BadgeAward: () => oo,
@@ -2473,8 +2473,8 @@ D(Ys, {
   EncryptedDirectMessages: () => io,
   EventDeletion: () => so,
   FileMetadata: () => lo,
-  FileServerPreference: () => To,
-  Followsets: () => Mo,
+  FileServerPreference: () => $o,
+  Followsets: () => Po,
   GenericRepost: () => ao,
   Genericlists: () => Ho,
   HTTPAuth: () => cn,
@@ -2493,10 +2493,10 @@ D(Ys, {
   LongFormArticle: () => Go,
   Metadata: () => Qs,
   Mutelist: () => Ao,
-  NWCWalletInfo: () => $o,
+  NWCWalletInfo: () => To,
   NWCWalletRequest: () => Lr,
   NWCWalletResponse: () => Oo,
-  NostrConnect: () => Po,
+  NostrConnect: () => Mo,
   OpenTimestamps: () => co,
   Pinlist: () => Ko,
   ProblemTracker: () => fo,
@@ -2538,10 +2538,10 @@ function Nr(e) {
 function Xs(e) {
   return Sr(e) ? "regular" : Ar(e) ? "replaceable" : Kr(e) ? "ephemeral" : Nr(e) ? "parameterized" : "unknown";
 }
-var Qs = 0, eo = 1, to = 2, no = 3, ro = 4, io = 4, so = 5, on = 6, an = 7, oo = 8, ao = 16, Br = 40, Cr = 41, kr = 42, Ur = 43, Ir = 44, co = 1040, lo = 1063, uo = 1311, fo = 1971, ho = 1984, yo = 1984, po = 1985, go = 4550, wo = 5999, bo = 6999, vo = 7e3, mo = 9041, Eo = 9734, xo = 9735, So = 9802, Ao = 1e4, Ko = 10001, No = 10002, Bo = 10003, Co = 10004, ko = 10005, Uo = 10006, Io = 10007, _o = 10015, Lo = 10030, To = 10096, $o = 13194, Ro = 21e3, _r = 22242, Lr = 23194, Oo = 23195, Po = 24133, cn = 27235, Mo = 3e4, Ho = 30001, qo = 30002, Do = 30003, jo = 30004, Vo = 30008, zo = 30009, Zo = 30015, Fo = 30017, Wo = 30018, Go = 30023, Jo = 30024, Yo = 30030, Xo = 30078, Qo = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, sa = 31924, oa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
+var Qs = 0, eo = 1, to = 2, no = 3, ro = 4, io = 4, so = 5, on = 6, an = 7, oo = 8, ao = 16, Br = 40, Cr = 41, kr = 42, Ur = 43, Ir = 44, co = 1040, lo = 1063, uo = 1311, fo = 1971, ho = 1984, yo = 1984, po = 1985, go = 4550, wo = 5999, bo = 6999, vo = 7e3, mo = 9041, Eo = 9734, xo = 9735, So = 9802, Ao = 1e4, Ko = 10001, No = 10002, Bo = 10003, Co = 10004, ko = 10005, Uo = 10006, Io = 10007, _o = 10015, Lo = 10030, $o = 10096, To = 13194, Ro = 21e3, _r = 22242, Lr = 23194, Oo = 23195, Mo = 24133, cn = 27235, Po = 3e4, Ho = 30001, qo = 30002, Do = 30003, jo = 30004, Vo = 30008, zo = 30009, Zo = 30015, Fo = 30017, Wo = 30018, Go = 30023, Jo = 30024, Yo = 30030, Xo = 30078, Qo = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, sa = 31924, oa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
 D(ua, {
   getHex64: () => ln,
-  getInt: () => Tr,
+  getInt: () => $r,
   getSubscriptionId: () => fa,
   matchEventId: () => ha,
   matchEventKind: () => ya,
@@ -2551,7 +2551,7 @@ function ln(e, t) {
   let n = t.length + 3, r = e.indexOf(`"${t}":`) + n, i = e.slice(r).indexOf('"') + r + 1;
   return e.slice(i, i + 64);
 }
-function Tr(e, t) {
+function $r(e, t) {
   let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), s = Math.min(i.indexOf(","), i.indexOf("}"));
   return parseInt(i.slice(0, s), 10);
 }
@@ -2575,7 +2575,7 @@ function da(e, t) {
   return t === ln(e, "pubkey");
 }
 function ya(e, t) {
-  return t === Tr(e, "kind");
+  return t === $r(e, "kind");
 }
 var pa = {};
 D(pa, {
@@ -2604,7 +2604,7 @@ try {
 }
 var va = {};
 D(va, {
-  BECH32_REGEX: () => $r,
+  BECH32_REGEX: () => Tr,
   Bech32MaxSize: () => un,
   decode: () => wt,
   encodeBytes: () => bt,
@@ -2616,13 +2616,13 @@ D(va, {
   nrelayEncode: () => Ba,
   nsecEncode: () => Ea
 });
-var un = 5e3, $r = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
+var un = 5e3, Tr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
 function ma(e) {
   const t = new Uint8Array(4);
   return t[0] = e >> 24 & 255, t[1] = e >> 16 & 255, t[2] = e >> 8 & 255, t[3] = e & 255, t;
 }
 function wt(e) {
-  var i, s, o, a, c, l, f, u;
+  var i, s, o, c, a, l, f, u;
   let { prefix: t, words: n } = je.decode(e, un), r = new Uint8Array(je.fromWords(n));
   switch (t) {
     case "nprofile": {
@@ -2634,7 +2634,7 @@ function wt(e) {
       return {
         type: "nprofile",
         data: {
-          pubkey: M(d[0][0]),
+          pubkey: P(d[0][0]),
           relays: d[1] ? d[1].map((p) => ie.decode(p)) : []
         }
       };
@@ -2652,16 +2652,16 @@ function wt(e) {
       return {
         type: "nevent",
         data: {
-          id: M(d[0][0]),
+          id: P(d[0][0]),
           relays: d[1] ? d[1].map((p) => ie.decode(p)) : [],
-          author: (o = d[2]) != null && o[0] ? M(d[2][0]) : void 0,
-          kind: (a = d[3]) != null && a[0] ? parseInt(M(d[3][0]), 16) : void 0
+          author: (o = d[2]) != null && o[0] ? P(d[2][0]) : void 0,
+          kind: (c = d[3]) != null && c[0] ? parseInt(P(d[3][0]), 16) : void 0
         }
       };
     }
     case "naddr": {
       let d = Qe(r);
-      if (!((c = d[0]) != null && c[0]))
+      if (!((a = d[0]) != null && a[0]))
         throw new Error("missing TLV 0 for naddr");
       if (!((l = d[2]) != null && l[0]))
         throw new Error("missing TLV 2 for naddr");
@@ -2675,8 +2675,8 @@ function wt(e) {
         type: "naddr",
         data: {
           identifier: ie.decode(d[0][0]),
-          pubkey: M(d[2][0]),
-          kind: parseInt(M(d[3][0]), 16),
+          pubkey: P(d[2][0]),
+          kind: parseInt(P(d[3][0]), 16),
           relays: d[1] ? d[1].map((p) => ie.decode(p)) : []
         }
       };
@@ -2694,7 +2694,7 @@ function wt(e) {
       return { type: t, data: r };
     case "npub":
     case "note":
-      return { type: t, data: M(r) };
+      return { type: t, data: P(r) };
     default:
       throw new Error(`unknown prefix ${t}`);
   }
@@ -2775,13 +2775,13 @@ D(Ca, {
   encrypt: () => Rr
 });
 async function Rr(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e, i = Ue.getSharedSecret(r, "02" + t), s = Or(i);
-  let o = Uint8Array.from(ir(16)), a = te.encode(n), c = yr(s, o).encrypt(a), l = ue.encode(new Uint8Array(c)), f = ue.encode(new Uint8Array(o.buffer));
+  const r = e instanceof Uint8Array ? P(e) : e, i = Ue.getSharedSecret(r, "02" + t), s = Or(i);
+  let o = Uint8Array.from(ir(16)), c = te.encode(n), a = yr(s, o).encrypt(c), l = ue.encode(new Uint8Array(a)), f = ue.encode(new Uint8Array(o.buffer));
   return `${l}?iv=${f}`;
 }
 async function ka(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e;
-  let [i, s] = n.split("?iv="), o = Ue.getSharedSecret(r, "02" + t), a = Or(o), c = ue.decode(s), l = ue.decode(i), f = yr(a, c).decrypt(l);
+  const r = e instanceof Uint8Array ? P(e) : e;
+  let [i, s] = n.split("?iv="), o = Ue.getSharedSecret(r, "02" + t), c = Or(o), a = ue.decode(s), l = ue.decode(i), f = yr(c, a).decrypt(l);
   return ie.decode(f);
 }
 function Or(e) {
@@ -2789,13 +2789,13 @@ function Or(e) {
 }
 var Ua = {};
 D(Ua, {
-  NIP05_REGEX: () => Pr,
+  NIP05_REGEX: () => Mr,
   isValid: () => La,
-  queryProfile: () => Mr,
+  queryProfile: () => Pr,
   searchDomain: () => _a,
   useFetchImplementation: () => Ia
 });
-var Pr = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, mt;
+var Mr = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, mt;
 try {
   mt = fetch;
 } catch {
@@ -2811,29 +2811,29 @@ async function _a(e, t = "") {
     return {};
   }
 }
-async function Mr(e) {
+async function Pr(e) {
   var s;
-  const t = e.match(Pr);
+  const t = e.match(Mr);
   if (!t)
     return null;
   const [n, r = "_", i] = t;
   try {
-    const o = `https://${i}/.well-known/nostr.json?name=${r}`, a = await (await mt(o, { redirect: "error" })).json();
-    let c = a.names[r];
-    return c ? { pubkey: c, relays: (s = a.relays) == null ? void 0 : s[c] } : null;
+    const o = `https://${i}/.well-known/nostr.json?name=${r}`, c = await (await mt(o, { redirect: "error" })).json();
+    let a = c.names[r];
+    return a ? { pubkey: a, relays: (s = c.relays) == null ? void 0 : s[a] } : null;
   } catch {
     return null;
   }
 }
 async function La(e, t) {
-  let n = await Mr(t);
+  let n = await Pr(t);
   return n ? n.pubkey === e : !1;
 }
-var Ta = {};
-D(Ta, {
-  parse: () => $a
+var $a = {};
+D($a, {
+  parse: () => Ta
 });
-function $a(e) {
+function Ta(e) {
   const t = {
     reply: void 0,
     root: void 0,
@@ -2846,19 +2846,19 @@ function $a(e) {
       relays: r[2] ? [r[2]] : []
     });
   for (let r = 0; r < n.length; r++) {
-    const i = n[r], [s, o, a, c] = i, l = {
+    const i = n[r], [s, o, c, a] = i, l = {
       id: o,
-      relays: a ? [a] : []
+      relays: c ? [c] : []
     }, f = r === 0, u = r === n.length - 1;
-    if (c === "root") {
+    if (a === "root") {
       t.root = l;
       continue;
     }
-    if (c === "reply") {
+    if (a === "reply") {
       t.reply = l;
       continue;
     }
-    if (c === "mention") {
+    if (a === "mention") {
       t.mentions.push(l);
       continue;
     }
@@ -2876,7 +2876,7 @@ function $a(e) {
 }
 var Ra = {};
 D(Ra, {
-  fetchRelayInformation: () => Pa,
+  fetchRelayInformation: () => Ma,
   useFetchImplementation: () => Oa
 });
 var Hr;
@@ -2887,13 +2887,13 @@ try {
 function Oa(e) {
   Hr = e;
 }
-async function Pa(e) {
+async function Ma(e) {
   return await (await fetch(e.replace("ws://", "http://").replace("wss://", "https://"), {
     headers: { Accept: "application/nostr+json" }
   })).json();
 }
-var Ma = {};
-D(Ma, {
+var Pa = {};
+D(Pa, {
   getPow: () => qr,
   minePow: () => Ha
 });
@@ -2971,7 +2971,7 @@ D(Va, {
   parse: () => Za,
   test: () => za
 });
-var Et = new RegExp(`nostr:(${$r.source})`);
+var Et = new RegExp(`nostr:(${Tr.source})`);
 function za(e) {
   return typeof e == "string" && new RegExp(`^${Et.source}$`).test(e);
 }
@@ -3258,12 +3258,12 @@ function yc(e) {
   };
 }
 function Gr(e, t, n = ir(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = Fr(t, n), o = hc(e), a = br(r, i, o), c = Wr(s, a, n);
-  return ue.encode(ht(new Uint8Array([2]), n, a, c));
+  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = Fr(t, n), o = hc(e), c = br(r, i, o), a = Wr(s, c, n);
+  return ue.encode(ht(new Uint8Array([2]), n, c, a));
 }
 function Jr(e, t) {
-  const { nonce: n, ciphertext: r, mac: i } = yc(e), { chacha_key: s, chacha_nonce: o, hmac_key: a } = Fr(t, n), c = Wr(a, r, n);
-  if (!Ss(c, i))
+  const { nonce: n, ciphertext: r, mac: i } = yc(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = Fr(t, n), a = Wr(c, r, n);
+  if (!Ss(a, i))
     throw new Error("invalid MAC");
   const l = br(s, o, r);
   return dc(l);
@@ -3320,11 +3320,11 @@ async function Ec(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
-      let { words: o } = je.decode(n, 1e3), a = je.fromWords(o);
-      t = ie.decode(a);
+      let { words: o } = je.decode(n, 1e3), c = je.fromWords(o);
+      t = ie.decode(c);
     } else if (r) {
-      let [o, a] = r.split("@");
-      t = new URL(`/.well-known/lnurlp/${o}`, `https://${a}`).toString();
+      let [o, c] = r.split("@");
+      t = new URL(`/.well-known/lnurlp/${o}`, `https://${c}`).toString();
     } else
       return null;
     let s = await (await pn(t)).json();
@@ -3382,7 +3382,7 @@ function Ac({
   bolt11: n,
   paidAt: r
 }) {
-  let i = JSON.parse(e), s = i.tags.filter(([a]) => a === "e" || a === "p" || a === "a"), o = {
+  let i = JSON.parse(e), s = i.tags.filter(([c]) => c === "e" || c === "p" || c === "a"), o = {
     kind: 9735,
     created_at: Math.round(r.getTime() / 1e3),
     content: "",
@@ -3451,7 +3451,7 @@ function ni(e, t) {
 }
 function gn(e) {
   const t = Se(te.encode(JSON.stringify(e)));
-  return M(t);
+  return P(t);
 }
 function ri(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
@@ -3479,36 +3479,36 @@ const He = 4, Rn = 30078, Rc = 100;
 var Cc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Cc || {});
 function Oc(e) {
   return JSON.stringify({
-    rootKey: M(e.rootKey),
+    rootKey: P(e.rootKey),
     theirNostrPublicKey: e.theirNostrPublicKey,
     ourCurrentNostrKey: e.ourCurrentNostrKey ? {
       publicKey: e.ourCurrentNostrKey.publicKey,
-      privateKey: M(e.ourCurrentNostrKey.privateKey)
+      privateKey: P(e.ourCurrentNostrKey.privateKey)
     } : void 0,
     ourNextNostrKey: {
       publicKey: e.ourNextNostrKey.publicKey,
-      privateKey: M(e.ourNextNostrKey.privateKey)
+      privateKey: P(e.ourNextNostrKey.privateKey)
     },
-    receivingChainKey: e.receivingChainKey ? M(e.receivingChainKey) : void 0,
-    sendingChainKey: e.sendingChainKey ? M(e.sendingChainKey) : void 0,
+    receivingChainKey: e.receivingChainKey ? P(e.receivingChainKey) : void 0,
+    sendingChainKey: e.sendingChainKey ? P(e.sendingChainKey) : void 0,
     sendingChainMessageNumber: e.sendingChainMessageNumber,
     receivingChainMessageNumber: e.receivingChainMessageNumber,
     previousSendingChainMessageCount: e.previousSendingChainMessageCount,
     skippedMessageKeys: Object.fromEntries(
       Object.entries(e.skippedMessageKeys).map(([t, n]) => [
         t,
-        M(n)
+        P(n)
       ])
     ),
     skippedHeaderKeys: Object.fromEntries(
       Object.entries(e.skippedHeaderKeys).map(([t, n]) => [
         t,
-        n.map((r) => M(r))
+        n.map((r) => P(r))
       ])
     )
   });
 }
-function Pc(e) {
+function Mc(e) {
   const t = JSON.parse(e);
   return {
     rootKey: W(t.rootKey),
@@ -3540,7 +3540,7 @@ function Pc(e) {
     )
   };
 }
-async function* Mc(e) {
+async function* Pc(e) {
   const t = [];
   let n = null;
   const r = e.onMessage((i) => {
@@ -3586,11 +3586,11 @@ class at {
    * @returns A new Channel instance
    */
   static init(t, n, r, i, s, o) {
-    const a = Me(), [c, l] = Re(s, j.getConversationKey(a, n), 2);
+    const c = Pe(), [a, l] = Re(s, j.getConversationKey(c, n), 2);
     let f, u;
-    i ? (f = { publicKey: Ce(r), privateKey: r }, u = { publicKey: Ce(a), privateKey: a }) : u = { publicKey: Ce(r), privateKey: r };
+    i ? (f = { publicKey: Ce(r), privateKey: r }, u = { publicKey: Ce(c), privateKey: c }) : u = { publicKey: Ce(r), privateKey: r };
     const d = {
-      rootKey: i ? c : s,
+      rootKey: i ? a : s,
       theirNostrPublicKey: n,
       ourCurrentNostrKey: f,
       ourNextNostrKey: u,
@@ -3655,26 +3655,26 @@ class at {
     this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++;
     try {
       return j.decrypt(n, o);
-    } catch (a) {
-      throw console.error(this.name, "Decryption failed:", a, {
-        messageKey: M(o).slice(0, 4),
-        receivingChainKey: M(this.state.receivingChainKey).slice(0, 4),
-        sendingChainKey: this.state.sendingChainKey && M(this.state.sendingChainKey).slice(0, 4),
-        rootKey: M(this.state.rootKey).slice(0, 4)
-      }), a;
+    } catch (c) {
+      throw console.error(this.name, "Decryption failed:", c, {
+        messageKey: P(o).slice(0, 4),
+        receivingChainKey: P(this.state.receivingChainKey).slice(0, 4),
+        sendingChainKey: this.state.sendingChainKey && P(this.state.sendingChainKey).slice(0, 4),
+        rootKey: P(this.state.rootKey).slice(0, 4)
+      }), c;
     }
   }
   ratchetStep(t) {
     this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.theirNostrPublicKey = t;
     const n = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [r, i] = Re(this.state.rootKey, n, 2);
     this.state.receivingChainKey = i, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
-    const s = Me();
+    const s = Pe();
     this.state.ourNextNostrKey = {
       publicKey: Ce(s),
       privateKey: s
     };
-    const o = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [a, c] = Re(r, o, 2);
-    this.state.rootKey = a, this.state.sendingChainKey = c;
+    const o = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [c, a] = Re(r, o, 2);
+    this.state.rootKey = c, this.state.sendingChainKey = a;
   }
   // 3. MESSAGE KEY FUNCTIONS
   skipMessageKeys(t, n) {
@@ -3687,11 +3687,11 @@ class at {
       if (this.state.skippedMessageKeys[s] = i, !this.state.skippedHeaderKeys[n]) {
         const o = [];
         if (this.state.ourCurrentNostrKey) {
-          const c = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
-          o.push(c);
+          const a = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
+          o.push(a);
         }
-        const a = j.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
-        o.push(a), this.state.skippedHeaderKeys[n] = o;
+        const c = j.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
+        o.push(c), this.state.skippedHeaderKeys[n] = o;
       }
       this.state.receivingChainMessageNumber++;
     }
@@ -3701,7 +3701,7 @@ class at {
     const i = Lt(r, t.number);
     if (i in this.state.skippedMessageKeys) {
       const o = this.state.skippedMessageKeys[i];
-      return delete this.state.skippedMessageKeys[i], Object.keys(this.state.skippedMessageKeys).some((c) => c.startsWith(`${r}:`)) || (delete this.state.skippedHeaderKeys[r], (s = this.nostrUnsubscribe) == null || s.call(this), this.nostrUnsubscribe = void 0), j.decrypt(n, o);
+      return delete this.state.skippedMessageKeys[i], Object.keys(this.state.skippedMessageKeys).some((a) => a.startsWith(`${r}:`)) || (delete this.state.skippedHeaderKeys[r], (s = this.nostrUnsubscribe) == null || s.call(this), this.nostrUnsubscribe = void 0), j.decrypt(n, o);
     }
     return null;
   }
@@ -3735,12 +3735,12 @@ class at {
     if (!i)
       this.state.theirNostrPublicKey !== n.nextPublicKey && (this.state.theirNostrPublicKey = n.nextPublicKey, (o = this.nostrUnsubscribe) == null || o.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
         { authors: [this.state.theirNostrPublicKey], kinds: [He] },
-        (a) => this.handleNostrEvent(a)
+        (c) => this.handleNostrEvent(c)
       )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey));
     else if (!(Lt(t.pubkey, n.number) in this.state.skippedMessageKeys))
       return;
     const s = this.ratchetDecrypt(n, t.content, t.pubkey);
-    this.internalSubscriptions.forEach((a) => a({ id: t.id, data: s, pubkey: n.nextPublicKey, time: n.time }));
+    this.internalSubscriptions.forEach((c) => c({ id: t.id, data: s, pubkey: n.nextPublicKey, time: n.time }));
   }
   subscribeToNostrEvents() {
     if (this.nostrNextUnsubscribe) return;
@@ -3762,11 +3762,13 @@ function et(e, t) {
   return rn(Se, n, "nip44-v2");
 }
 class Oe {
-  constructor(t, n, r, i, s, o, a = []) {
-    this.inviterSessionPublicKey = t, this.linkSecret = n, this.inviter = r, this.inviterSessionPrivateKey = i, this.label = s, this.maxUses = o, this.usedBy = a;
+  constructor(t, n, r, i, s, o, c = []) {
+    this.inviterSessionPublicKey = t, this.linkSecret = n, this.inviter = r, this.inviterSessionPrivateKey = i, this.label = s, this.maxUses = o, this.usedBy = c;
   }
   static createNew(t, n, r) {
-    const i = Me(), s = Ce(i), o = M(Me());
+    if (!t)
+      throw new Error("Inviter public key is required");
+    const i = Pe(), s = Ce(i), o = P(Pe());
     return new Oe(
       s,
       o,
@@ -3787,12 +3789,12 @@ class Oe {
     } catch (l) {
       throw new Error("Invite data in URL hash is not valid JSON: " + l);
     }
-    const { inviter: o, sessionKey: a, linkSecret: c } = s;
-    if (!o || !a || !c)
+    const { inviter: o, sessionKey: c, linkSecret: a } = s;
+    if (!o || !c || !a)
       throw new Error("Missing required fields (inviter, sessionKey, linkSecret) in invite data.");
     return new Oe(
-      a,
       c,
+      a,
       o
     );
   }
@@ -3809,12 +3811,12 @@ class Oe {
     );
   }
   static fromEvent(t) {
-    var o, a;
+    var o, c;
     if (!t.sig)
       throw new Error("Event is not signed");
     if (!gt(t))
       throw new Error("Event signature is invalid");
-    const { tags: n } = t, r = (o = n.find(([c]) => c === "sessionKey")) == null ? void 0 : o[1], i = (a = n.find(([c]) => c === "linkSecret")) == null ? void 0 : a[1], s = t.pubkey;
+    const { tags: n } = t, r = (o = n.find(([a]) => a === "sessionKey")) == null ? void 0 : o[1], i = (c = n.find(([a]) => a === "linkSecret")) == null ? void 0 : c[1], s = t.pubkey;
     if (!r || !i)
       throw new Error("Invalid invite event: missing session key or link secret");
     return new Oe(
@@ -3823,25 +3825,24 @@ class Oe {
       s
     );
   }
-  static fromUser(t, n) {
-    const r = {
+  static fromUser(t, n, r) {
+    const i = {
       kinds: [Rn],
       authors: [t],
       limit: 1,
       "#d": ["nostr-double-ratchet/invite"]
     };
-    return new Promise((i) => {
-      const s = n(r, (o) => {
+    let s = 0;
+    return n(i, (c) => {
+      if (!(!c.created_at || c.created_at <= s)) {
+        s = c.created_at;
         try {
-          const a = Oe.fromEvent(o);
-          s(), i(a);
-        } catch {
-          s(), i(void 0);
+          const a = Oe.fromEvent(c);
+          r(a);
+        } catch (a) {
+          console.error("Error processing invite:", a);
         }
-      });
-      setTimeout(() => {
-        s(), i(void 0);
-      }, 1e4);
+      }
     });
   }
   /**
@@ -3894,7 +3895,7 @@ class Oe {
        * so the inviter can create the channel on their side.
        */
   async accept(t, n, r) {
-    const i = Me(), s = Ce(i), o = this.inviter || this.inviterSessionPublicKey, a = W(this.linkSecret), c = at.init(t, this.inviterSessionPublicKey, i, !0, a, void 0), l = Me(), f = Ce(l), u = typeof r == "function" ? r : (g, h) => Promise.resolve(j.encrypt(g, et(r, h))), d = {
+    const i = Pe(), s = Ce(i), o = this.inviter || this.inviterSessionPublicKey, c = W(this.linkSecret), a = at.init(t, this.inviterSessionPublicKey, i, !0, c, void 0), l = Pe(), f = Ce(l), u = typeof r == "function" ? r : (g, h) => Promise.resolve(j.encrypt(g, et(r, h))), d = {
       pubkey: n,
       tags: [["secret", this.linkSecret]],
       content: await u(s, o),
@@ -3906,7 +3907,7 @@ class Oe {
       created_at: Math.floor(Date.now() / 1e3),
       tags: [["p", this.inviterSessionPublicKey]]
     };
-    return { channel: c, event: ae(p, l) };
+    return { channel: a, event: ae(p, l) };
   }
   listen(t, n, r) {
     if (!this.inviterSessionPrivateKey)
@@ -3921,14 +3922,14 @@ class Oe {
           console.error("Invite has reached maximum number of uses");
           return;
         }
-        const o = await j.decrypt(s.content, et(this.inviterSessionPrivateKey, s.pubkey)), a = JSON.parse(o);
-        if (!a.tags || !a.tags.some(([g, h]) => g === "secret" && h === this.linkSecret)) {
+        const o = await j.decrypt(s.content, et(this.inviterSessionPrivateKey, s.pubkey)), c = JSON.parse(o);
+        if (!c.tags || !c.tags.some(([g, h]) => g === "secret" && h === this.linkSecret)) {
           console.error("Invalid secret from event", s);
           return;
         }
-        const c = typeof t == "function" ? t : (g, h) => Promise.resolve(j.decrypt(g, et(t, h))), l = a.pubkey;
+        const a = typeof t == "function" ? t : (g, h) => Promise.resolve(j.decrypt(g, et(t, h))), l = c.pubkey;
         this.usedBy.push(l);
-        const f = await c(a.content, l), u = W(this.linkSecret), d = s.id, p = at.init(n, f, this.inviterSessionPrivateKey, !1, u, d);
+        const f = await a(c.content, l), u = W(this.linkSecret), d = s.id, p = at.init(n, f, this.inviterSessionPrivateKey, !1, u, d);
         r(p, l);
       } catch (o) {
         console.error("Error processing invite message:", o);
@@ -3943,8 +3944,8 @@ export {
   Rc as MAX_SKIP,
   He as MESSAGE_EVENT_KIND,
   Cc as Sender,
-  Mc as createMessageStream,
-  Pc as deserializeChannelState,
+  Pc as createMessageStream,
+  Mc as deserializeChannelState,
   Re as kdf,
   Oc as serializeChannelState,
   Lt as skippedMessageIndexKey