nostr-double-ratchet 0.0.14 → 0.0.15

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

@@ -11,7 +11,7 @@ function zn(e, ...t) {
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
 }
-function mi(e) {
+function Ei(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
   Kn(e.outputLen), Kn(e.blockLen);
@@ -22,24 +22,24 @@ function et(e, t = !0) {
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function Ei(e, t) {
+function mi(e, t) {
   zn(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const Et = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const mt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Vn = (e) => e instanceof Uint8Array, xt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, xi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!xi)
   throw new Error("Non little-endian hardware is not supported");
-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 Wt(e) {
-  if (typeof e == "string" && (e = Ai(e)), !Vn(e))
+  if (typeof e == "string" && (e = Si(e)), !Vn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -58,20 +58,20 @@ let Wn = class {
     return this._cloneInto();
   }
 };
-function Si(e) {
+function Ai(e) {
   const t = (r) => e().update(Wt(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function Zn(e = 32) {
-  if (Et && typeof Et.getRandomValues == "function")
-    return Et.getRandomValues(new Uint8Array(e));
+  if (mt && typeof mt.getRandomValues == "function")
+    return mt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 function Ki(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 Ci = class extends Wn {
   constructor(t, n, r, i) {
@@ -83,33 +83,33 @@ let Ci = class extends Wn {
     t = Wt(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 = xt(t);
+      const c = Math.min(i - this.pos, s - o);
+      if (c === i) {
+        const a = xt(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;
   }
   digestInto(t) {
-    et(this), Ei(t, this), this.finished = !0;
+    et(this), mi(t, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: i, isLE: s } = this;
     let { pos: o } = this;
     n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(r, 0), o = 0);
     for (let u = o; u < i; u++)
       n[u] = 0;
     Ki(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const a = xt(t), c = this.outputLen;
-    if (c % 4)
+    const c = xt(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,11 +119,11 @@ let Ci = class extends Wn {
   }
   _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 Bi = (e, t, n) => e & t ^ ~e & n, ki = (e, t, n) => e & t ^ e & n ^ t & n, Ui = /* @__PURE__ */ new Uint32Array([
+const Bi = (e, t, n) => e & t ^ ~e & n, ki = (e, t, n) => e & t ^ e & n ^ t & n, _i = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -198,17 +198,17 @@ const Bi = (e, t, n) => e & t ^ ~e & n, ki = (e, t, n) => e & t ^ e & n ^ t & n,
   528734635,
   1541459225
 ]), ve = /* @__PURE__ */ new Uint32Array(64);
-let _i = class extends Ci {
+let Ui = class extends Ci {
   constructor() {
     super(64, 32, 8, !1), this.A = be[0] | 0, this.B = be[1] | 0, this.C = be[2] | 0, this.D = be[3] | 0, this.E = be[4] | 0, this.F = be[5] | 0, this.G = be[6] | 0, this.H = be[7] | 0;
   }
   get() {
-    const { A: t, B: n, C: r, D: i, E: 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 _i = class extends Ci {
       const g = ve[u - 15], b = ve[u - 2], p = re(g, 7) ^ re(g, 18) ^ g >>> 3, h = re(b, 17) ^ re(b, 19) ^ b >>> 10;
       ve[u] = h + ve[u - 7] + p + 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 g = re(a, 6) ^ re(a, 11) ^ re(a, 25), b = f + g + Bi(a, c, l) + Ui[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ki(r, i, s) | 0;
-      f = l, l = c, c = a, a = o + b | 0, o = s, s = i, i = r, r = b + h | 0;
+      const g = re(c, 6) ^ re(c, 11) ^ re(c, 25), b = f + g + Bi(c, a, l) + _i[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ki(r, i, s) | 0;
+      f = l, l = a, a = c, c = o + b | 0, o = s, s = i, i = r, r = b + 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);
@@ -231,7 +231,7 @@ let _i = class extends Ci {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const Lt = /* @__PURE__ */ Si(() => new _i());
+const Lt = /* @__PURE__ */ Ai(() => new Ui());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Gn = BigInt(0), ot = BigInt(1), Ii = BigInt(2), at = (e) => e instanceof Uint8Array, Li = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function qe(e) {
@@ -331,7 +331,7 @@ function Oi(e) {
 function Mi(e, t) {
   return e >> BigInt(t) & ot;
 }
-const Pi = (e, t, n) => e | (n ? ot : Gn) << BigInt(t), Jt = (e) => (Ii << BigInt(e - 1)) - ot, At = (e) => new Uint8Array(e), Cn = (e) => Uint8Array.from(e);
+const Pi = (e, t, n) => e | (n ? ot : Gn) << BigInt(t), Jt = (e) => (Ii << BigInt(e - 1)) - ot, St = (e) => new Uint8Array(e), Cn = (e) => Uint8Array.from(e);
 function Jn(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -339,28 +339,28 @@ function Jn(e, t, n) {
     throw new Error("qByteLen must be a number");
   if (typeof n != "function")
     throw new Error("hmacFn must be a function");
-  let r = At(e), i = At(e), s = 0;
+  let r = St(e), i = St(e), s = 0;
   const o = () => {
     r.fill(1), i.fill(0), s = 0;
-  }, a = (...u) => n(i, r, ...u), c = (u = At()) => {
-    i = a(Cn([0]), u), r = a(), u.length !== 0 && (i = a(Cn([1]), u), r = a());
+  }, c = (...u) => n(i, r, ...u), a = (u = St()) => {
+    i = c(Cn([0]), u), r = c(), u.length !== 0 && (i = c(Cn([1]), u), r = c());
   }, l = () => {
     if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
     const g = [];
     for (; u < t; ) {
-      r = a();
+      r = c();
       const b = r.slice();
       g.push(b), u += r.length;
     }
     return Ue(...g);
   };
   return (u, g) => {
-    o(), c(u);
+    o(), a(u);
     let b;
     for (; !(b = g(l())); )
-      c();
+      a();
     return o(), b;
   };
 }
@@ -375,14 +375,14 @@ const Hi = {
   field: (e, t) => t.Fp.isValid(e),
   hash: (e) => typeof e == "function" && Number.isSafeInteger(e.outputLen)
 };
-function Je(e, t, n = {}) {
+function Ye(e, t, n = {}) {
   const r = (i, s, o) => {
-    const a = Hi[s];
-    if (typeof a != "function")
+    const c = Hi[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);
@@ -410,7 +410,7 @@ const qi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   numberToHexUnpadded: Fn,
   numberToVarBytesBE: $i,
   utf8ToBytes: Ri,
-  validateObject: Je
+  validateObject: Ye
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const z = BigInt(0), j = BigInt(1), Ce = BigInt(2), Di = BigInt(3), $t = BigInt(4), Bn = BigInt(5), kn = BigInt(8);
@@ -441,8 +441,8 @@ function Tt(e, t) {
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
   let n = V(e, t), r = t, i = z, s = j;
   for (; n !== z; ) {
-    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 !== j)
     throw new Error("invert: does not exist");
@@ -457,26 +457,26 @@ function zi(e) {
     ;
   if (r === 1) {
     const o = (e + j) / $t;
-    return function(c, l) {
-      const f = c.pow(l, o);
-      if (!c.eql(c.sqr(f), l))
+    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 + j) / Ce;
-  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), g = a.pow(c, n);
-    for (; !a.eql(g, a.ONE); ) {
-      if (a.eql(g, a.ZERO))
-        return a.ZERO;
+    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, s), g = c.pow(a, n);
+    for (; !c.eql(g, c.ONE); ) {
+      if (c.eql(g, c.ZERO))
+        return c.ZERO;
       let b = 1;
-      for (let h = a.sqr(g); b < l && !a.eql(h, a.ONE); b++)
-        h = a.sqr(h);
-      const p = a.pow(f, j << BigInt(l - b - 1));
-      f = a.sqr(p), u = a.mul(u, p), g = a.mul(g, f), l = b;
+      for (let h = c.sqr(g); b < l && !c.eql(h, c.ONE); b++)
+        h = c.sqr(h);
+      const p = c.pow(f, j << BigInt(l - b - 1));
+      f = c.sqr(p), u = c.mul(u, p), g = c.mul(g, f), l = b;
     }
     return u;
   };
@@ -494,7 +494,7 @@ function Vi(e) {
   if (e % kn === Bn) {
     const t = (e - Bn) / kn;
     return function(r, i) {
-      const s = r.mul(i, Ce), o = r.pow(s, t), a = r.mul(i, o), c = r.mul(r.mul(a, Ce), o), l = r.mul(a, r.sub(c, r.ONE));
+      const s = r.mul(i, Ce), o = r.pow(s, t), c = r.mul(i, o), a = r.mul(r.mul(c, Ce), 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;
@@ -528,7 +528,7 @@ function Zi(e) {
     BYTES: "isSafeInteger",
     BITS: "isSafeInteger"
   }, n = Wi.reduce((r, i) => (r[i] = "function", r), t);
-  return Je(e, n);
+  return Ye(e, n);
 }
 function Gi(e, t, n) {
   if (n < z)
@@ -543,8 +543,8 @@ function Gi(e, t, n) {
   return r;
 }
 function Fi(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 Yn(e, t) {
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
@@ -556,48 +556,48 @@ function Ji(e, t, n = !1, r = {}) {
   const { nBitLength: i, nByteLength: s } = Yn(e, t);
   if (s > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const o = Vi(e), a = Object.freeze({
+  const o = Vi(e), c = Object.freeze({
     ORDER: e,
     BITS: i,
     BYTES: s,
     MASK: Jt(i),
     ZERO: z,
     ONE: j,
-    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;
+    create: (a) => V(a, e),
+    isValid: (a) => {
+      if (typeof a != "bigint")
+        throw new Error(`Invalid field element: expected bigint, got ${typeof a}`);
+      return z <= a && a < e;
     },
-    is0: (c) => c === z,
-    isOdd: (c) => (c & j) === j,
-    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) => Gi(a, c, l),
-    div: (c, l) => V(c * Tt(l, e), e),
+    is0: (a) => a === z,
+    isOdd: (a) => (a & j) === j,
+    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) => Gi(c, a, l),
+    div: (a, l) => V(a * Tt(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) => Tt(c, e),
-    sqrt: r.sqrt || ((c) => o(a, c)),
-    invertBatch: (c) => Fi(a, c),
+    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) => o(c, a)),
+    invertBatch: (a) => Fi(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 ? Ft(c, s) : Ne(c, s),
-    fromBytes: (c) => {
-      if (c.length !== s)
-        throw new Error(`Fp.fromBytes: expected ${s}, got ${c.length}`);
-      return n ? Gt(c) : F(c);
+    cmov: (a, l, f) => f ? l : a,
+    toBytes: (a) => n ? Ft(a, s) : Ne(a, s),
+    fromBytes: (a) => {
+      if (a.length !== s)
+        throw new Error(`Fp.fromBytes: expected ${s}, got ${a.length}`);
+      return n ? Gt(a) : F(a);
     }
   });
-  return Object.freeze(a);
+  return Object.freeze(c);
 }
 function Xn(e) {
   if (typeof e != "bigint")
@@ -613,8 +613,8 @@ function Yi(e, t, n = !1) {
   const r = e.length, i = Xn(t), s = Qn(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error(`expected ${s}-1024 bytes of input, got ${r}`);
-  const o = n ? F(e) : Gt(e), a = V(o, t - j) + j;
-  return n ? Ft(a, i) : Ne(a, i);
+  const o = n ? F(e) : Gt(e), c = V(o, t - j) + j;
+  return n ? Ft(c, i) : Ne(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const Xi = BigInt(0), Nt = BigInt(1);
@@ -630,9 +630,9 @@ function Qi(e, t) {
     constTimeNegate: n,
     // non-const time multiplication ladder
     unsafeLadder(i, s) {
-      let o = e.ZERO, a = i;
+      let o = e.ZERO, c = i;
       for (; s > Xi; )
-        s & Nt && (o = o.add(a)), a = a.double(), s >>= Nt;
+        s & Nt && (o = o.add(c)), c = c.double(), s >>= Nt;
       return o;
     },
     /**
@@ -646,15 +646,15 @@ function Qi(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 g = 1; g < a; g++)
-          f = f.add(l), c.push(f);
+        f = l, a.push(f);
+        for (let g = 1; g < c; g++)
+          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 Qi(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), g = 2 ** i, b = BigInt(i);
-      for (let p = 0; p < a; p++) {
-        const h = p * c;
+      for (let p = 0; p < c; p++) {
+        const h = p * a;
         let d = Number(o & u);
-        o >>= b, d > c && (d -= g, o += Nt);
-        const y = h, E = h + Math.abs(d) - 1, S = p % 2 !== 0, _ = d < 0;
-        d === 0 ? f = f.add(n(S, s[y])) : l = l.add(n(_, s[E]));
+        o >>= b, d > a && (d -= g, o += Nt);
+        const y = h, m = h + Math.abs(d) - 1, A = p % 2 !== 0, U = d < 0;
+        d === 0 ? f = f.add(n(A, s[y])) : l = l.add(n(U, s[m]));
       }
       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 er(e) {
-  return Zi(e.Fp), Je(e, {
+  return Zi(e.Fp), Ye(e, {
     n: "bigint",
     h: "bigint",
     Gx: "field",
@@ -701,7 +701,7 @@ function er(e) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function es(e) {
   const t = er(e);
-  Je(t, {
+  Ye(t, {
     a: "field",
     b: "field"
   }, {
@@ -722,7 +722,7 @@ function es(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: ts, hexToBytes: ns } = qi, Be = {
+const { bytesToNumberBE: ts, hexToBytes: ns } = qi, ke = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -730,7 +730,7 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, Be = {
     }
   },
   _parseInt(e) {
-    const { Err: t } = Be;
+    const { Err: t } = ke;
     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: ts, hexToBytes: ns } = qi, Be = {
     return { d: ts(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = Be, n = typeof e == "string" ? ns(e) : e;
+    const { Err: t } = ke, n = typeof e == "string" ? ns(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -751,8 +751,8 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, 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 } = ke._parseInt(n.subarray(2)), { d: o, l: c } = ke._parseInt(s);
+    if (c.length)
       throw new t("Invalid signature: left bytes after parsing");
     return { r: i, s: o };
   },
@@ -760,12 +760,12 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, 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}`;
   }
 }, ae = BigInt(0), Y = BigInt(1);
 BigInt(2);
-const Un = BigInt(3);
+const _n = BigInt(3);
 BigInt(4);
 function rs(e) {
   const t = es(e), { Fp: n } = t, r = t.toBytes || ((p, h, d) => {
@@ -776,32 +776,32 @@ function rs(e) {
     return { x: d, y };
   });
   function s(p) {
-    const { a: h, b: d } = t, y = n.sqr(p), E = n.mul(y, p);
-    return n.add(n.add(E, n.mul(p, h)), d);
+    const { a: h, b: d } = t, y = n.sqr(p), m = n.mul(y, p);
+    return n.add(n.add(m, n.mul(p, h)), d);
   }
   if (!n.eql(n.sqr(t.Gy), s(t.Gx)))
     throw new Error("bad generator point: equation left != right");
   function o(p) {
     return typeof p == "bigint" && ae < p && p < t.n;
   }
-  function a(p) {
+  function c(p) {
     if (!o(p))
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
-  function c(p) {
-    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: y, n: E } = t;
+  function a(p) {
+    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: y, n: m } = t;
     if (h && typeof p != "bigint") {
       if (p instanceof Uint8Array && (p = qe(p)), typeof p != "string" || !h.includes(p.length))
         throw new Error("Invalid key");
       p = p.padStart(d * 2, "0");
     }
-    let S;
+    let A;
     try {
-      S = typeof p == "bigint" ? p : F(W("private key", p, d));
+      A = typeof p == "bigint" ? p : F(W("private key", p, d));
     } catch {
       throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof p}`);
     }
-    return y && (S = V(S, E)), a(S), S;
+    return y && (A = V(A, m)), c(A), A;
   }
   const l = /* @__PURE__ */ new Map();
   function f(p) {
@@ -825,8 +825,8 @@ function rs(e) {
         throw new Error("invalid affine point");
       if (h instanceof u)
         throw new Error("projective point not allowed");
-      const E = (S) => n.eql(S, n.ZERO);
-      return E(d) && E(y) ? u.ZERO : new u(d, y, n.ONE);
+      const m = (A) => n.eql(A, n.ZERO);
+      return m(d) && m(y) ? u.ZERO : new u(d, y, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -842,7 +842,7 @@ function rs(e) {
      */
     static normalizeZ(h) {
       const d = n.invertBatch(h.map((y) => y.pz));
-      return h.map((y, E) => y.toAffine(d[E])).map(u.fromAffine);
+      return h.map((y, m) => y.toAffine(d[m])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
@@ -854,7 +854,7 @@ function rs(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) {
@@ -870,8 +870,8 @@ function rs(e) {
       const { x: h, y: d } = this.toAffine();
       if (!n.isValid(h) || !n.isValid(d))
         throw new Error("bad point: x or y not FE");
-      const y = n.sqr(d), E = s(h);
-      if (!n.eql(y, E))
+      const y = n.sqr(d), m = s(h);
+      if (!n.eql(y, m))
         throw new Error("bad point: equation left != right");
       if (!this.isTorsionFree())
         throw new Error("bad point: not in prime-order subgroup");
@@ -887,8 +887,8 @@ function rs(e) {
      */
     equals(h) {
       f(h);
-      const { px: d, py: y, pz: E } = this, { px: S, py: _, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(S, E)), x = n.eql(n.mul(y, B), n.mul(_, E));
-      return m && x;
+      const { px: d, py: y, pz: m } = this, { px: A, py: U, pz: B } = h, E = n.eql(n.mul(d, B), n.mul(A, m)), x = n.eql(n.mul(y, B), n.mul(U, m));
+      return E && x;
     }
     /**
      * Flips point to one corresponding to (x, -y) in Affine coordinates.
@@ -901,9 +901,9 @@ function rs(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: h, b: d } = t, y = n.mul(d, Un), { px: E, py: S, pz: _ } = this;
-      let B = n.ZERO, m = n.ZERO, x = n.ZERO, A = n.mul(E, E), P = n.mul(S, S), U = n.mul(_, _), K = n.mul(E, S);
-      return K = n.add(K, K), x = n.mul(E, _), x = n.add(x, x), B = n.mul(h, x), m = n.mul(y, U), m = n.add(B, m), B = n.sub(P, m), m = n.add(P, m), m = n.mul(B, m), B = n.mul(K, B), x = n.mul(y, x), U = n.mul(h, U), K = n.sub(A, U), K = n.mul(h, K), K = n.add(K, x), x = n.add(A, A), A = n.add(x, A), A = n.add(A, U), A = n.mul(A, K), m = n.add(m, A), U = n.mul(S, _), U = n.add(U, U), A = n.mul(U, K), B = n.sub(B, A), x = n.mul(U, P), x = n.add(x, x), x = n.add(x, x), new u(B, m, x);
+      const { a: h, b: d } = t, y = n.mul(d, _n), { px: m, py: A, pz: U } = this;
+      let B = n.ZERO, E = n.ZERO, x = n.ZERO, S = n.mul(m, m), P = n.mul(A, A), _ = n.mul(U, U), K = n.mul(m, A);
+      return K = n.add(K, K), x = n.mul(m, U), x = n.add(x, x), B = n.mul(h, x), E = n.mul(y, _), E = n.add(B, E), B = n.sub(P, E), E = n.add(P, E), E = n.mul(B, E), B = n.mul(K, B), x = n.mul(y, x), _ = n.mul(h, _), K = n.sub(S, _), K = n.mul(h, K), K = n.add(K, x), x = n.add(S, S), S = n.add(x, S), S = n.add(S, _), S = n.mul(S, K), E = n.add(E, S), _ = n.mul(A, U), _ = n.add(_, _), S = n.mul(_, K), B = n.sub(B, S), x = n.mul(_, P), x = n.add(x, x), x = n.add(x, x), new u(B, E, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function rs(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: d, py: y, pz: E } = this, { px: S, py: _, pz: B } = h;
-      let m = n.ZERO, x = n.ZERO, A = n.ZERO;
-      const P = t.a, U = n.mul(t.b, Un);
-      let K = n.mul(d, S), T = n.mul(y, _), R = n.mul(E, B), H = n.add(d, y), w = n.add(S, _);
-      H = n.mul(H, w), w = n.add(K, T), H = n.sub(H, w), w = n.add(d, E);
-      let v = n.add(S, B);
-      return w = n.mul(w, v), v = n.add(K, R), w = n.sub(w, v), v = n.add(y, E), m = n.add(_, B), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), A = n.mul(P, w), 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(K, K), T = n.add(T, K), R = n.mul(P, R), w = n.mul(U, w), T = n.add(T, R), R = n.sub(K, R), R = n.mul(P, R), w = n.add(w, R), K = n.mul(T, w), x = n.add(x, K), K = n.mul(v, w), m = n.mul(H, m), m = n.sub(m, K), K = n.mul(H, T), A = n.mul(v, A), A = n.add(A, K), new u(m, x, A);
+      const { px: d, py: y, pz: m } = this, { px: A, py: U, pz: B } = h;
+      let E = n.ZERO, x = n.ZERO, S = n.ZERO;
+      const P = t.a, _ = n.mul(t.b, _n);
+      let K = n.mul(d, A), T = n.mul(y, U), R = n.mul(m, B), H = n.add(d, y), w = n.add(A, U);
+      H = n.mul(H, w), w = n.add(K, T), H = n.sub(H, w), w = n.add(d, m);
+      let v = n.add(A, B);
+      return w = n.mul(w, v), v = n.add(K, R), w = n.sub(w, v), v = n.add(y, m), E = n.add(U, B), v = n.mul(v, E), E = n.add(T, R), v = n.sub(v, E), S = n.mul(P, w), E = n.mul(_, R), S = n.add(E, S), E = n.sub(T, S), S = n.add(T, S), x = n.mul(E, S), T = n.add(K, K), T = n.add(T, K), R = n.mul(P, R), w = n.mul(_, w), T = n.add(T, R), R = n.sub(K, R), R = n.mul(P, R), w = n.add(w, R), K = n.mul(T, w), x = n.add(x, K), K = n.mul(v, w), E = n.mul(H, E), E = n.sub(E, K), K = n.mul(H, T), S = n.mul(v, S), S = n.add(S, K), new u(E, x, S);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -927,8 +927,8 @@ function rs(e) {
     }
     wNAF(h) {
       return b.wNAFCached(this, l, h, (d) => {
-        const y = n.invertBatch(d.map((E) => E.pz));
-        return d.map((E, S) => E.toAffine(y[S])).map(u.fromAffine);
+        const y = n.invertBatch(d.map((m) => m.pz));
+        return d.map((m, A) => m.toAffine(y[A])).map(u.fromAffine);
       });
     }
     /**
@@ -940,15 +940,15 @@ function rs(e) {
       const d = u.ZERO;
       if (h === ae)
         return d;
-      if (a(h), h === Y)
+      if (c(h), h === Y)
         return this;
       const { endo: y } = t;
       if (!y)
         return b.unsafeLadder(this, h);
-      let { k1neg: E, k1: S, k2neg: _, k2: B } = y.splitScalar(h), m = d, x = d, A = this;
-      for (; S > ae || B > ae; )
-        S & Y && (m = m.add(A)), B & Y && (x = x.add(A)), A = A.double(), S >>= Y, B >>= Y;
-      return E && (m = m.negate()), _ && (x = x.negate()), x = new u(n.mul(x.px, y.beta), x.py, x.pz), m.add(x);
+      let { k1neg: m, k1: A, k2neg: U, k2: B } = y.splitScalar(h), E = d, x = d, S = this;
+      for (; A > ae || B > ae; )
+        A & Y && (E = E.add(S)), B & Y && (x = x.add(S)), S = S.double(), A >>= Y, B >>= Y;
+      return m && (E = E.negate()), U && (x = x.negate()), x = new u(n.mul(x.px, y.beta), x.py, x.pz), E.add(x);
     }
     /**
      * Constant time multiplication.
@@ -960,18 +960,18 @@ function rs(e) {
      * @returns New point
      */
     multiply(h) {
-      a(h);
-      let d = h, y, E;
-      const { endo: S } = t;
-      if (S) {
-        const { k1neg: _, k1: B, k2neg: m, k2: x } = S.splitScalar(d);
-        let { p: A, f: P } = this.wNAF(B), { p: U, f: K } = this.wNAF(x);
-        A = b.constTimeNegate(_, A), U = b.constTimeNegate(m, U), U = new u(n.mul(U.px, S.beta), U.py, U.pz), y = A.add(U), E = P.add(K);
+      c(h);
+      let d = h, y, m;
+      const { endo: A } = t;
+      if (A) {
+        const { k1neg: U, k1: B, k2neg: E, k2: x } = A.splitScalar(d);
+        let { p: S, f: P } = this.wNAF(B), { p: _, f: K } = this.wNAF(x);
+        S = b.constTimeNegate(U, S), _ = b.constTimeNegate(E, _), _ = new u(n.mul(_.px, A.beta), _.py, _.pz), y = S.add(_), m = P.add(K);
       } else {
-        const { p: _, f: B } = this.wNAF(d);
-        y = _, E = B;
+        const { p: U, f: B } = this.wNAF(d);
+        y = U, m = B;
       }
-      return u.normalizeZ([y, E])[0];
+      return u.normalizeZ([y, m])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -980,21 +980,21 @@ function rs(e) {
      * @returns non-zero affine point
      */
     multiplyAndAddUnsafe(h, d, y) {
-      const E = u.BASE, S = (B, m) => m === ae || m === Y || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), _ = S(this, d).add(S(h, y));
-      return _.is0() ? void 0 : _;
+      const m = u.BASE, A = (B, E) => E === ae || E === Y || !B.equals(m) ? B.multiplyUnsafe(E) : B.multiply(E), U = A(this, d).add(A(h, y));
+      return U.is0() ? void 0 : U;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
     // (x, y, z) ∋ (x=x/z, y=y/z)
     toAffine(h) {
-      const { px: d, py: y, pz: E } = this, S = this.is0();
-      h == null && (h = S ? n.ONE : n.inv(E));
-      const _ = n.mul(d, h), B = n.mul(y, h), m = n.mul(E, h);
-      if (S)
+      const { px: d, py: y, pz: m } = this, A = this.is0();
+      h == null && (h = A ? n.ONE : n.inv(m));
+      const U = n.mul(d, h), B = n.mul(y, h), E = n.mul(m, h);
+      if (A)
         return { x: n.ZERO, y: n.ZERO };
-      if (!n.eql(m, n.ONE))
+      if (!n.eql(E, n.ONE))
         throw new Error("invZ was invalid");
-      return { x: _, y: B };
+      return { x: U, y: B };
     }
     isTorsionFree() {
       const { h, isTorsionFree: d } = t;
@@ -1020,14 +1020,14 @@ function rs(e) {
   return {
     CURVE: t,
     ProjectivePoint: u,
-    normPrivateKeyToScalar: c,
+    normPrivateKeyToScalar: a,
     weierstrassEquation: s,
     isWithinCurveOrder: o
   };
 }
 function is(e) {
   const t = er(e);
-  return Je(t, {
+  return Ye(t, {
     hash: "hash",
     hmac: "function",
     randomBytes: "function"
@@ -1042,10 +1042,10 @@ function ss(e) {
   function o(w) {
     return ae < w && w < n.ORDER;
   }
-  function a(w) {
+  function c(w) {
     return V(w, r);
   }
-  function c(w) {
+  function a(w) {
     return Tt(w, r);
   }
   const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: g } = rs({
@@ -1076,7 +1076,7 @@ function ss(e) {
     return w > v;
   }
   function h(w) {
-    return p(w) ? a(-w) : w;
+    return p(w) ? c(-w) : w;
   }
   const d = (w, v, N) => F(w.slice(v, N));
   class y {
@@ -1091,7 +1091,7 @@ function ss(e) {
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
     static fromDER(v) {
-      const { r: N, s: k } = Be.toSig(W("DER", v));
+      const { r: N, s: k } = ke.toSig(W("DER", v));
       return new y(N, k);
     }
     assertValidity() {
@@ -1110,7 +1110,7 @@ function ss(e) {
       const O = C === 2 || C === 3 ? N + t.n : N;
       if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const $ = C & 1 ? "03" : "02", Q = l.fromHex($ + b(O)), ge = c(O), Ie = a(-I * ge), Ve = a(k * ge), we = l.BASE.multiplyAndAddUnsafe(Q, Ie, Ve);
+      const $ = C & 1 ? "03" : "02", Q = l.fromHex($ + b(O)), ge = a(O), Le = c(-I * ge), Ve = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(Q, Le, Ve);
       if (!we)
         throw new Error("point at infinify");
       return we.assertValidity(), we;
@@ -1120,14 +1120,14 @@ function ss(e) {
       return p(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new y(this.r, a(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new y(this.r, c(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
       return De(this.toDERHex());
     }
     toDERHex() {
-      return Be.hexFromSig({ r: this.r, s: this.s });
+      return ke.hexFromSig({ r: this.r, s: this.s });
     }
     // padded bytes of r, then padded bytes of s
     toCompactRawBytes() {
@@ -1137,7 +1137,7 @@ function ss(e) {
       return b(this.r) + b(this.s);
     }
   }
-  const E = {
+  const m = {
     isValidPrivateKey(w) {
       try {
         return f(w), !0;
@@ -1166,68 +1166,68 @@ function ss(e) {
       return v._setWindowSize(w), v.multiply(BigInt(3)), v;
     }
   };
-  function S(w, v = !0) {
+  function A(w, v = !0) {
     return l.fromPrivateKey(w).toRawBytes(v);
   }
-  function _(w) {
+  function U(w) {
     const v = w instanceof Uint8Array, N = typeof w == "string", k = (v || N) && w.length;
     return v ? k === i || k === s : N ? k === 2 * i || k === 2 * s : w instanceof l;
   }
   function B(w, v, N = !0) {
-    if (_(w))
+    if (U(w))
       throw new Error("first arg must be private key");
-    if (!_(v))
+    if (!U(v))
       throw new Error("second arg must be public key");
     return l.fromHex(v).multiply(f(w)).toRawBytes(N);
   }
-  const m = t.bits2int || function(w) {
+  const E = t.bits2int || function(w) {
     const v = F(w), N = w.length * 8 - t.nBitLength;
     return N > 0 ? v >> BigInt(N) : v;
   }, x = t.bits2int_modN || function(w) {
-    return a(m(w));
-  }, A = Jt(t.nBitLength);
+    return c(E(w));
+  }, S = Jt(t.nBitLength);
   function P(w) {
     if (typeof w != "bigint")
       throw new Error("bigint expected");
-    if (!(ae <= w && w < A))
+    if (!(ae <= w && w < S))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
     return Ne(w, t.nByteLength);
   }
-  function U(w, v, N = K) {
+  function _(w, v, N = K) {
     if (["recovered", "canonical"].some((Ke) => Ke in N))
       throw new Error("sign() legacy options not supported");
     const { hash: k, randomBytes: C } = t;
     let { lowS: I, prehash: O, extraEntropy: $ } = N;
     I == null && (I = !0), w = W("msgHash", w), O && (w = W("prehashed msgHash", k(w)));
-    const Q = x(w), ge = f(v), Ie = [P(ge), P(Q)];
+    const Q = x(w), ge = f(v), Le = [P(ge), P(Q)];
     if ($ != null) {
       const Ke = $ === !0 ? C(n.BYTES) : $;
-      Ie.push(W("extraEntropy", Ke));
+      Le.push(W("extraEntropy", Ke));
     }
-    const Ve = Ue(...Ie), we = Q;
-    function mt(Ke) {
-      const Le = m(Ke);
-      if (!g(Le))
+    const Ve = Ue(...Le), we = Q;
+    function Et(Ke) {
+      const $e = E(Ke);
+      if (!g($e))
         return;
-      const An = c(Le), $e = l.BASE.multiply(Le).toAffine(), ee = a($e.x);
+      const Sn = a($e), Te = l.BASE.multiply($e).toAffine(), ee = c(Te.x);
       if (ee === ae)
         return;
-      const Te = a(An * a(we + ee * ge));
-      if (Te === ae)
+      const Re = c(Sn * c(we + ee * ge));
+      if (Re === ae)
         return;
-      let Nn = ($e.x === ee ? 0 : 2) | Number($e.y & Y), Sn = Te;
-      return I && p(Te) && (Sn = h(Te), Nn ^= 1), new y(ee, Sn, Nn);
+      let Nn = (Te.x === ee ? 0 : 2) | Number(Te.y & Y), An = Re;
+      return I && p(Re) && (An = h(Re), Nn ^= 1), new y(ee, An, Nn);
     }
-    return { seed: Ve, k2sig: mt };
+    return { seed: Ve, k2sig: Et };
   }
   const K = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
   function R(w, v, N = K) {
-    const { seed: k, k2sig: C } = U(w, v, N), I = t;
+    const { seed: k, k2sig: C } = _(w, v, N), I = t;
     return Jn(I.hash.outputLen, I.nByteLength, I.hmac)(k, C);
   }
   l.BASE._setWindowSize(8);
   function H(w, v, N, k = T) {
-    var $e;
+    var Te;
     const C = w;
     if (v = W("msgHash", v), N = W("publicKey", N), "strict" in k)
       throw new Error("options.strict was renamed to lowS");
@@ -1238,13 +1238,13 @@ function ss(e) {
         try {
           $ = y.fromDER(C);
         } catch (ee) {
-          if (!(ee instanceof Be.Err))
+          if (!(ee instanceof ke.Err))
             throw ee;
           $ = y.fromCompact(C);
         }
       else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
-        const { r: ee, s: Te } = C;
-        $ = new y(ee, Te);
+        const { r: ee, s: Re } = C;
+        $ = new y(ee, Re);
       } else
         throw new Error("PARSE");
       Q = l.fromHex(N);
@@ -1256,23 +1256,23 @@ function ss(e) {
     if (I && $.hasHighS())
       return !1;
     O && (v = t.hash(v));
-    const { r: ge, s: Ie } = $, Ve = x(v), we = c(Ie), mt = a(Ve * we), Ke = a(ge * we), Le = ($e = l.BASE.multiplyAndAddUnsafe(Q, mt, Ke)) == null ? void 0 : $e.toAffine();
-    return Le ? a(Le.x) === ge : !1;
+    const { r: ge, s: Le } = $, Ve = x(v), we = a(Le), Et = c(Ve * we), Ke = c(ge * we), $e = (Te = l.BASE.multiplyAndAddUnsafe(Q, Et, Ke)) == null ? void 0 : Te.toAffine();
+    return $e ? c($e.x) === ge : !1;
   }
   return {
     CURVE: t,
-    getPublicKey: S,
+    getPublicKey: A,
     getSharedSecret: B,
     sign: R,
     verify: H,
     ProjectivePoint: l,
     Signature: y,
-    utils: E
+    utils: m
   };
 }
 let tr = class extends Wn {
   constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, mi(t);
+    super(), this.finished = !1, this.destroyed = !1, Ei(t);
     const r = Wt(n);
     if (this.iHash = t.create(), typeof this.iHash.update != "function")
       throw new Error("Expected instance of class which extends utils.Hash");
@@ -1298,8 +1298,8 @@ let tr = class extends Wn {
   }
   _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();
@@ -1320,14 +1320,14 @@ function as(e, t) {
   return Object.freeze({ ...n(t), create: n });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const ct = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), rr = BigInt(1), nt = BigInt(2), _n = (e, t) => (e + t / nt) / t;
+const ct = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), rr = BigInt(1), nt = BigInt(2), Un = (e, t) => (e + t / nt) / t;
 function ir(e) {
-  const t = ct, 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, g = J(u, n, t) * f % t, b = J(g, nt, t) * l % t, p = J(b, i, t) * b % t, h = J(p, s, t) * p % t, d = J(h, a, t) * h % t, y = J(d, c, t) * d % t, E = J(y, a, t) * h % t, S = J(E, n, t) * f % t, _ = J(S, o, t) * p % t, B = J(_, r, t) * l % t, m = J(B, nt, t);
-  if (!Rt.eql(Rt.sqr(m), e))
+  const t = ct, 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, g = J(u, n, t) * f % t, b = J(g, nt, t) * l % t, p = J(b, i, t) * b % t, h = J(p, s, t) * p % t, d = J(h, c, t) * h % t, y = J(d, a, t) * d % t, m = J(y, c, t) * h % t, A = J(m, n, t) * f % t, U = J(A, o, t) * p % t, B = J(U, r, t) * l % t, E = J(B, nt, t);
+  if (!Rt.eql(Rt.sqr(E), e))
     throw new Error("Cannot find square root");
-  return m;
+  return E;
 }
-const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), _e = as({
+const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), Ie = as({
   a: BigInt(0),
   b: BigInt(7),
   Fp: Rt,
@@ -1346,8 +1346,8 @@ const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), _e = as({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
-      const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -rr * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), a = _n(s * e, t), c = _n(-r * e, t);
-      let l = V(e - a * n - c * i, t), f = V(-a * r - c * s, t);
+      const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -rr * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = Un(s * e, t), a = Un(-r * e, t);
+      let l = V(e - c * n - a * i, t), f = V(-c * r - a * s, t);
       const u = l > o, g = f > o;
       if (u && (l = t - l), g && (f = t - f), l > o || f > o)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
@@ -1363,46 +1363,46 @@ function rt(e, ...t) {
   }
   return Lt(Ue(n, ...t));
 }
-const Yt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => Ne(e, 32), St = (e) => V(e, ct), Ge = (e) => V(e, tt), Xt = _e.ProjectivePoint, us = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
+const Yt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => Ne(e, 32), At = (e) => V(e, ct), Fe = (e) => V(e, tt), Xt = Ie.ProjectivePoint, us = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
 function Mt(e) {
-  let t = _e.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
-  return { scalar: n.hasEvenY() ? t : Ge(-t), bytes: Yt(n) };
+  let t = Ie.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
+  return { scalar: n.hasEvenY() ? t : Fe(-t), bytes: Yt(n) };
 }
 function or(e) {
   if (!sr(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = St(e * e), n = St(t * e + BigInt(7));
+  const t = At(e * e), n = At(t * e + BigInt(7));
   let r = ir(n);
-  r % nt !== ut && (r = St(-r));
+  r % nt !== ut && (r = At(-r));
   const i = new Xt(e, r, rr);
   return i.assertValidity(), i;
 }
 function ar(...e) {
-  return Ge(F(rt("BIP0340/challenge", ...e)));
+  return Fe(F(rt("BIP0340/challenge", ...e)));
 }
 function ls(e) {
   return Mt(e).bytes;
 }
 function fs(e, t, n = Zn(32)) {
-  const r = W("message", e), { bytes: i, scalar: s } = Mt(t), o = W("auxRand", n, 32), a = Ot(s ^ F(rt("BIP0340/aux", o))), c = rt("BIP0340/nonce", a, i, r), l = Ge(F(c));
+  const r = W("message", e), { bytes: i, scalar: s } = Mt(t), o = W("auxRand", n, 32), c = Ot(s ^ F(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Fe(F(a));
   if (l === ut)
     throw new Error("sign failed: k is zero");
   const { bytes: f, scalar: u } = Mt(l), g = ar(f, i, r), b = new Uint8Array(64);
-  if (b.set(f, 0), b.set(Ot(Ge(u + g * s)), 32), !cr(b, r, i))
+  if (b.set(f, 0), b.set(Ot(Fe(u + g * s)), 32), !cr(b, r, i))
     throw new Error("sign: Invalid signature produced");
   return b;
 }
 function cr(e, t, n) {
   const r = W("signature", e, 64), i = W("message", t), s = W("publicKey", n, 32);
   try {
-    const o = or(F(s)), a = F(r.subarray(0, 32));
-    if (!sr(a))
+    const o = or(F(s)), c = F(r.subarray(0, 32));
+    if (!sr(c))
       return !1;
-    const c = F(r.subarray(32, 64));
-    if (!cs(c))
+    const a = F(r.subarray(32, 64));
+    if (!cs(a))
       return !1;
-    const l = ar(Ot(a), Yt(o), i), f = us(o, c, Ge(-l));
-    return !(!f || !f.hasEvenY() || f.toAffine().x !== a);
+    const l = ar(Ot(c), Yt(o), i), f = us(o, a, Fe(-l));
+    return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
   } catch {
     return !1;
   }
@@ -1412,7 +1412,7 @@ const We = {
   sign: fs,
   verify: cr,
   utils: {
-    randomPrivateKey: _e.utils.randomPrivateKey,
+    randomPrivateKey: Ie.utils.randomPrivateKey,
     lift_x: or,
     pointToBytes: Yt,
     numberToBytesBE: Ne,
@@ -1454,7 +1454,7 @@ function ps(e) {
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Fe(e) {
+function Je(e) {
   if (typeof e == "string" && (e = ps(e)), !Qt(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
@@ -1475,7 +1475,7 @@ class ur {
   }
 }
 function lr(e) {
-  const t = (r) => e().update(Fe(r)).digest(), n = e();
+  const t = (r) => e().update(Je(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function fr(e = 32) {
@@ -1525,27 +1525,27 @@ const se = {
 function vs(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 ms extends ur {
+class Es extends ur {
   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 = Ct(this.buffer);
   }
   update(t) {
     se.exists(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Fe(t);
+    t = Je(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 = Ct(t);
+      const c = Math.min(i - this.pos, s - o);
+      if (c === i) {
+        const a = Ct(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 ms extends ur {
     for (let u = o; u < i; u++)
       n[u] = 0;
     vs(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const a = Ct(t), c = this.outputLen;
-    if (c % 4)
+    const c = Ct(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,11 +1574,11 @@ class ms extends ur {
   }
   _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 Es = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n, As = new Uint32Array([
+const ms = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n, Ss = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1643,7 +1643,7 @@ const Es = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n,
   2756734187,
   3204031479,
   3329325298
-]), me = new Uint32Array([
+]), Ee = new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -1652,35 +1652,35 @@ const Es = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n,
   2600822924,
   528734635,
   1541459225
-]), Ee = new Uint32Array(64);
-class dr extends ms {
+]), me = new Uint32Array(64);
+class dr extends Es {
   constructor() {
-    super(64, 32, 8, !1), this.A = me[0] | 0, this.B = me[1] | 0, this.C = me[2] | 0, this.D = me[3] | 0, this.E = me[4] | 0, this.F = me[5] | 0, this.G = me[6] | 0, this.H = me[7] | 0;
+    super(64, 32, 8, !1), this.A = Ee[0] | 0, this.B = Ee[1] | 0, this.C = Ee[2] | 0, this.D = Ee[3] | 0, this.E = Ee[4] | 0, this.F = Ee[5] | 0, this.G = Ee[6] | 0, this.H = Ee[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)
-      Ee[u] = t.getUint32(n, !1);
+      me[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const g = Ee[u - 15], b = Ee[u - 2], p = ie(g, 7) ^ ie(g, 18) ^ g >>> 3, h = ie(b, 17) ^ ie(b, 19) ^ b >>> 10;
-      Ee[u] = h + Ee[u - 7] + p + Ee[u - 16] | 0;
+      const g = me[u - 15], b = me[u - 2], p = ie(g, 7) ^ ie(g, 18) ^ g >>> 3, h = ie(b, 17) ^ ie(b, 19) ^ b >>> 10;
+      me[u] = h + me[u - 7] + p + me[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 g = ie(a, 6) ^ ie(a, 11) ^ ie(a, 25), b = f + g + Es(a, c, l) + As[u] + Ee[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + xs(r, i, s) | 0;
-      f = l, l = c, c = a, a = o + b | 0, o = s, s = i, i = r, r = b + h | 0;
+      const g = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), b = f + g + ms(c, a, l) + Ss[u] + me[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + xs(r, i, s) | 0;
+      f = l, l = a, a = c, c = o + b | 0, o = s, s = i, i = r, r = b + 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() {
-    Ee.fill(0);
+    me.fill(0);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
@@ -1796,18 +1796,18 @@ function Ln(e, t, n) {
     if (ze(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,23 +1825,23 @@ function Ht(e, t, n, r) {
   if (it(t, n) > 32)
     throw new Error(`convertRadix2: carry overflow from=${t} to=${n} carryBits=${it(t, n)}`);
   let i = 0, s = 0;
-  const o = 2 ** n - 1, a = [];
-  for (const c of e) {
-    if (ze(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 (ze(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 Ss(e) {
+function As(e) {
   return ze(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
@@ -1855,7 +1855,7 @@ function Ss(e) {
     }
   };
 }
-function Se(e, t = !1) {
+function Ae(e, t = !1) {
   if (ze(e), e <= 0 || e > 32)
     throw new Error("radix2: bits should be in (0..32]");
   if (it(8, e) > 32 || it(e, 8) > 32)
@@ -1883,10 +1883,10 @@ function $n(e) {
     }
   };
 }
-const Ks = de(Se(4), pe("0123456789ABCDEF"), ye("")), Cs = de(Se(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ft(5), ye(""));
-de(Se(5), pe("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ft(5), ye(""));
-de(Se(5), pe("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), ye(""), pr((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const he = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ft(6), ye("")), Bs = de(Se(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ft(6), ye("")), en = (e) => de(Ss(58), pe(e), ye("")), qt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+const Ks = de(Ae(4), pe("0123456789ABCDEF"), ye("")), Cs = de(Ae(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ft(5), ye(""));
+de(Ae(5), pe("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ft(5), ye(""));
+de(Ae(5), pe("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), ye(""), pr((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
+const he = de(Ae(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ft(6), ye("")), Bs = de(Ae(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ft(6), ye("")), en = (e) => de(As(58), pe(e), ye("")), qt = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
 en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
 en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
 const Tn = [0, 2, 3, 5, 6, 7, 9, 10, 11], ks = {
@@ -1936,7 +1936,7 @@ function On(e, t, n = 1) {
   return i ^= n, Dt.encode(Ht([i % 2 ** 30], 30, 5, !1));
 }
 function gr(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, s = $n(r);
+  const t = e === "bech32" ? 1 : 734539939, n = Ae(5), r = n.decode, i = n.encode, s = $n(r);
   function o(f, u, g = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
@@ -1947,7 +1947,7 @@ function gr(e) {
       throw new TypeError(`Length ${b} exceeds limit ${g}`);
     return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${On(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,25 +1967,25 @@ function gr(e) {
       throw new Error(`Invalid checksum in ${f}: expected "${y}"`);
     return { prefix: p, words: d };
   }
-  const c = $n(a);
+  const a = $n(c);
   function l(f) {
-    const { prefix: u, words: g } = a(f, !1);
+    const { prefix: u, words: g } = c(f, !1);
     return { prefix: u, words: g, bytes: r(g) };
   }
-  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 = gr("bech32");
 gr("bech32m");
-const Us = {
+const _s = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, _s = de(Se(4), pe("0123456789abcdef"), ye(""), pr((e) => {
+}, Us = de(Ae(4), pe("0123456789abcdef"), ye(""), pr((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();
 })), Is = {
-  utf8: Us,
-  hex: _s,
+  utf8: _s,
+  hex: Us,
   base16: Ks,
   base32: Cs,
   base64: he,
@@ -2028,11 +2028,11 @@ function Rs(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Os = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ae = 16, Ms = 283;
+const Os = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Se = 16, Ms = 283;
 function tn(e) {
   return e << 1 ^ Ms & -(e >> 7);
 }
-function Pe(e, t) {
+function He(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
     n ^= e & -(t & 1), e = tn(e);
@@ -2053,15 +2053,15 @@ const jt = /* @__PURE__ */ (() => {
 function wr(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), s = i.map(kt), 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(kt), i = r.map(kt), s = i.map(kt), 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__ */ wr(jt, (e) => Pe(e, 3) << 24 | e << 16 | e << 8 | Pe(e, 2)), br = /* @__PURE__ */ wr(Ps, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), qs = /* @__PURE__ */ (() => {
+const nn = /* @__PURE__ */ wr(jt, (e) => He(e, 3) << 24 | e << 16 | e << 8 | He(e, 2)), br = /* @__PURE__ */ wr(Ps, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), qs = /* @__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 vr(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 = Z(e), i = r.length, s = (a) => oe(n, a, a, a, a), o = new Uint32Array(t + 28);
+  const { sbox2: n } = nn, r = Z(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(Hs(c)) ^ qs[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(Hs(a)) ^ qs[c / i - 1] : i > 6 && c % i === 4 && (a = s(a)), o[c] = o[c - i] ^ a;
   }
   return o;
 }
 function Ds(e) {
-  const t = vr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: a, T3: c } = br;
+  const t = vr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: s, T1: o, T2: c, T3: a } = br;
   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,30 +2099,30 @@ function oe(e, t, n, r, i) {
   return e[t & 255 | n & 65280] | e[r >>> 16 & 255 | i >>> 16 & 65280] << 16;
 }
 function Pn(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 p = 0; p < l; p++) {
-    const h = e[c++] ^ xe(o, a, t, n, r, i), d = e[c++] ^ xe(o, a, n, r, i, t), y = e[c++] ^ xe(o, a, r, i, t, n), E = e[c++] ^ xe(o, a, i, t, n, r);
-    t = h, n = d, r = y, i = E;
+    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), y = e[a++] ^ xe(o, c, r, i, t, n), m = e[a++] ^ xe(o, c, i, t, n, r);
+    t = h, n = d, r = y, i = m;
   }
-  const f = e[c++] ^ oe(s, t, n, r, i), u = e[c++] ^ oe(s, n, r, i, t), g = e[c++] ^ oe(s, r, i, t, n), b = 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), g = e[a++] ^ oe(s, r, i, t, n), b = e[a++] ^ oe(s, i, t, n, r);
   return { s0: f, s1: u, s2: g, s3: b };
 }
 function js(e, t, n, r, i) {
-  const { sbox2: s, T01: o, T23: a } = br;
-  let c = 0;
-  t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
+  const { sbox2: s, T01: o, T23: c } = br;
+  let a = 0;
+  t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
   for (let p = 0; p < l; p++) {
-    const h = e[c++] ^ xe(o, a, t, i, r, n), d = e[c++] ^ xe(o, a, n, t, i, r), y = e[c++] ^ xe(o, a, r, n, t, i), E = e[c++] ^ xe(o, a, i, r, n, t);
-    t = h, n = d, r = y, i = E;
+    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), y = e[a++] ^ xe(o, c, r, n, t, i), m = e[a++] ^ xe(o, c, i, r, n, t);
+    t = h, n = d, r = y, i = m;
   }
-  const f = e[c++] ^ oe(s, t, i, r, n), u = e[c++] ^ oe(s, n, t, i, r), g = e[c++] ^ oe(s, r, n, t, i), b = 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), g = e[a++] ^ oe(s, r, n, t, i), b = e[a++] ^ oe(s, i, r, n, t);
   return { s0: f, s1: u, s2: g, s3: b };
 }
-function mr(e, t) {
+function Er(e, t) {
   if (!t)
     return new Uint8Array(e);
   if (ce(t), t.length < e)
@@ -2130,21 +2130,21 @@ function mr(e, t) {
   return t;
 }
 function zs(e) {
-  if (ce(e), e.length % Ae !== 0)
-    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ae}`);
+  if (ce(e), e.length % Se !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Se}`);
 }
 function Vs(e, t, n) {
   let r = e.length;
-  const i = r % Ae;
+  const i = r % Se;
   if (!t && i !== 0)
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
   const s = Z(e);
   if (t) {
-    let c = Ae - i;
-    c || (c = Ae), r = r + c;
+    let a = Se - i;
+    a || (a = Se), r = r + a;
   }
-  const o = mr(r, n), a = Z(o);
-  return { b: s, o: a, out: o };
+  const o = Er(r, n), c = Z(o);
+  return { b: s, o: c, out: o };
 }
 function Ws(e, t) {
   if (!t)
@@ -2164,61 +2164,61 @@ function Ws(e, t) {
 function Zs(e) {
   const t = new Uint8Array(16), n = Z(t);
   t.set(e);
-  const r = Ae - e.length;
-  for (let i = Ae - r; i < Ae; i++)
+  const r = Se - e.length;
+  for (let i = Se - r; i < Se; i++)
     t[i] = r;
   return n;
 }
-const Er = /* @__PURE__ */ Os({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
+const mr = /* @__PURE__ */ Os({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
   ce(t), ce(n, 16);
   const i = !r.disablePadding;
   return {
     encrypt: (s, o) => {
-      const a = vr(t), { b: c, o: l, out: f } = Vs(s, i, o), u = Z(n);
+      const c = vr(t), { b: a, o: l, out: f } = Vs(s, i, o), u = Z(n);
       let g = u[0], b = u[1], p = u[2], h = u[3], d = 0;
-      for (; d + 4 <= c.length; )
-        g ^= c[d + 0], b ^= c[d + 1], p ^= c[d + 2], h ^= c[d + 3], { s0: g, s1: b, s2: p, s3: h } = Pn(a, g, b, p, h), l[d++] = g, l[d++] = b, l[d++] = p, l[d++] = h;
+      for (; d + 4 <= a.length; )
+        g ^= a[d + 0], b ^= a[d + 1], p ^= a[d + 2], h ^= a[d + 3], { s0: g, s1: b, s2: p, s3: h } = Pn(c, g, b, p, h), l[d++] = g, l[d++] = b, l[d++] = p, l[d++] = h;
       if (i) {
         const y = Zs(s.subarray(d * 4));
-        g ^= y[0], b ^= y[1], p ^= y[2], h ^= y[3], { s0: g, s1: b, s2: p, s3: h } = Pn(a, g, b, p, h), l[d++] = g, l[d++] = b, l[d++] = p, l[d++] = h;
+        g ^= y[0], b ^= y[1], p ^= y[2], h ^= y[3], { s0: g, s1: b, s2: p, s3: h } = Pn(c, g, b, p, h), l[d++] = g, l[d++] = b, l[d++] = p, l[d++] = h;
       }
-      return a.fill(0), f;
+      return c.fill(0), f;
     },
     decrypt: (s, o) => {
       zs(s);
-      const a = Ds(t), c = Z(n), l = mr(s.length, o), f = Z(s), u = Z(l);
-      let g = c[0], b = c[1], p = c[2], h = c[3];
+      const c = Ds(t), a = Z(n), l = Er(s.length, o), f = Z(s), u = Z(l);
+      let g = a[0], b = a[1], p = a[2], h = a[3];
       for (let d = 0; d + 4 <= f.length; ) {
-        const y = g, E = b, S = p, _ = h;
+        const y = g, m = b, A = p, U = h;
         g = f[d + 0], b = f[d + 1], p = f[d + 2], h = f[d + 3];
-        const { s0: B, s1: m, s2: x, s3: A } = js(a, g, b, p, h);
-        u[d++] = B ^ y, u[d++] = m ^ E, u[d++] = x ^ S, u[d++] = A ^ _;
+        const { s0: B, s1: E, s2: x, s3: S } = js(c, g, b, p, h);
+        u[d++] = B ^ y, u[d++] = E ^ m, u[d++] = x ^ A, u[d++] = S ^ U;
       }
-      return a.fill(0), Ws(l, i);
+      return c.fill(0), Ws(l, i);
     }
   };
-}), xr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Gs = xr("expand 16-byte k"), Fs = xr("expand 32-byte k"), Js = Z(Gs), Ar = Z(Fs);
-Ar.slice();
+}), xr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Gs = xr("expand 16-byte k"), Fs = xr("expand 32-byte k"), Js = Z(Gs), Sr = Z(Fs);
+Sr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
 }
 function zt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Ye = 64, Ys = 16, Nr = 2 ** 32 - 1, Hn = new Uint32Array();
-function Xs(e, t, n, r, i, s, o, a) {
-  const c = i.length, l = new Uint8Array(Ye), f = Z(l), u = zt(i) && zt(s), g = u ? Z(i) : Hn, b = u ? Z(s) : Hn;
-  for (let p = 0; p < c; o++) {
-    if (e(t, n, r, f, o, a), o >= Nr)
+const Xe = 64, Ys = 16, Nr = 2 ** 32 - 1, Hn = new Uint32Array();
+function Xs(e, t, n, r, i, s, o, c) {
+  const a = i.length, l = new Uint8Array(Xe), f = Z(l), u = zt(i) && zt(s), g = u ? Z(i) : Hn, b = u ? Z(s) : Hn;
+  for (let p = 0; p < a; o++) {
+    if (e(t, n, r, f, o, c), o >= Nr)
       throw new Error("arx: counter overflow");
-    const h = Math.min(Ye, c - p);
-    if (u && h === Ye) {
+    const h = Math.min(Xe, a - p);
+    if (u && h === Xe) {
       const d = p / 4;
       if (p % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let y = 0, E; y < Ys; y++)
-        E = d + y, b[E] = g[E] ^ f[y];
-      p += Ye;
+      for (let y = 0, m; y < Ys; y++)
+        m = d + y, b[m] = g[m] ^ f[y];
+      p += Xe;
       continue;
     }
     for (let d = 0, y; d < h; d++)
@@ -2230,49 +2230,49 @@ function Qs(e, t) {
   const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = Ts({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return Bt(i), Bt(o), Mn(s), Mn(n), (a, c, l, f, u = 0) => {
-    ce(a), ce(c), ce(l);
+  return Bt(i), Bt(o), Mn(s), Mn(n), (c, a, l, f, u = 0) => {
+    ce(c), ce(a), ce(l);
     const g = l.length;
     if (f || (f = new Uint8Array(g)), ce(f), Bt(u), u < 0 || u >= Nr)
       throw new Error("arx: counter overflow");
     if (f.length < g)
       throw new Error(`arx: output (${f.length}) is shorter than data (${g})`);
     const b = [];
-    let p = a.length, h, d;
+    let p = c.length, h, d;
     if (p === 32)
-      h = a.slice(), b.push(h), d = Ar;
+      h = c.slice(), b.push(h), d = Sr;
     else if (p === 16 && n)
-      h = new Uint8Array(32), h.set(a), h.set(a, 16), d = Js, b.push(h);
+      h = new Uint8Array(32), h.set(c), h.set(c, 16), d = Js, b.push(h);
     else
       throw new Error(`arx: invalid 32-byte key, got length=${p}`);
-    zt(c) || (c = c.slice(), b.push(c));
+    zt(a) || (a = a.slice(), b.push(a));
     const y = Z(h);
     if (r) {
-      if (c.length !== 24)
+      if (a.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(d, y, Z(c.subarray(0, 16)), y), c = c.subarray(16);
+      r(d, y, Z(a.subarray(0, 16)), y), a = a.subarray(16);
     }
-    const E = 16 - i;
-    if (E !== c.length)
-      throw new Error(`arx: nonce must be ${E} or 16 bytes`);
-    if (E !== 12) {
-      const _ = new Uint8Array(12);
-      _.set(c, s ? 0 : 12 - c.length), c = _, b.push(c);
+    const m = 16 - i;
+    if (m !== a.length)
+      throw new Error(`arx: nonce must be ${m} or 16 bytes`);
+    if (m !== 12) {
+      const U = new Uint8Array(12);
+      U.set(a, s ? 0 : 12 - a.length), a = U, b.push(a);
     }
-    const S = Z(c);
-    for (Xs(e, d, y, S, l, f, u, o); b.length > 0; )
+    const A = Z(a);
+    for (Xs(e, d, y, A, l, f, u, o); b.length > 0; )
       b.pop().fill(0);
     return f;
   };
 }
 function eo(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], g = t[2], b = t[3], p = t[4], h = t[5], d = t[6], y = t[7], E = i, S = n[0], _ = n[1], B = n[2], m = o, x = a, A = c, P = l, U = f, K = u, T = g, R = b, H = p, w = h, v = d, N = y, k = E, C = S, I = _, O = B;
+  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], g = t[2], b = t[3], p = t[4], h = t[5], d = t[6], y = t[7], m = i, A = n[0], U = n[1], B = n[2], E = o, x = c, S = a, P = l, _ = f, K = u, T = g, R = b, H = p, w = h, v = d, N = y, k = m, C = A, I = U, O = B;
   for (let Q = 0; Q < s; Q += 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 + K | 0, C = L(C ^ x, 16), w = w + C | 0, K = L(K ^ w, 12), x = x + K | 0, C = L(C ^ x, 8), w = w + C | 0, K = L(K ^ w, 7), A = A + T | 0, I = L(I ^ A, 16), v = v + I | 0, T = L(T ^ v, 12), A = A + T | 0, I = L(I ^ A, 8), v = v + I | 0, T = L(T ^ v, 7), P = P + R | 0, O = L(O ^ P, 16), N = N + O | 0, R = L(R ^ N, 12), P = P + R | 0, O = L(O ^ P, 8), N = N + O | 0, R = L(R ^ N, 7), m = m + K | 0, O = L(O ^ m, 16), v = v + O | 0, K = L(K ^ v, 12), m = m + K | 0, O = L(O ^ m, 8), v = v + O | 0, K = L(K ^ v, 7), x = x + T | 0, k = L(k ^ x, 16), N = N + k | 0, T = L(T ^ N, 12), x = x + T | 0, k = L(k ^ x, 8), N = N + k | 0, T = L(T ^ N, 7), A = A + R | 0, C = L(C ^ A, 16), H = H + C | 0, R = L(R ^ H, 12), A = A + R | 0, C = L(C ^ A, 8), H = H + C | 0, R = L(R ^ H, 7), P = P + U | 0, I = L(I ^ P, 16), w = w + I | 0, U = L(U ^ w, 12), P = P + U | 0, I = L(I ^ P, 8), w = w + I | 0, U = L(U ^ w, 7);
+    E = E + _ | 0, k = L(k ^ E, 16), H = H + k | 0, _ = L(_ ^ H, 12), E = E + _ | 0, k = L(k ^ E, 8), H = H + k | 0, _ = L(_ ^ H, 7), x = x + K | 0, C = L(C ^ x, 16), w = w + C | 0, K = L(K ^ w, 12), x = x + K | 0, C = L(C ^ x, 8), w = w + C | 0, K = L(K ^ w, 7), S = S + T | 0, I = L(I ^ S, 16), v = v + I | 0, T = L(T ^ v, 12), S = S + T | 0, I = L(I ^ S, 8), v = v + I | 0, T = L(T ^ v, 7), P = P + R | 0, O = L(O ^ P, 16), N = N + O | 0, R = L(R ^ N, 12), P = P + R | 0, O = L(O ^ P, 8), N = N + O | 0, R = L(R ^ N, 7), E = E + K | 0, O = L(O ^ E, 16), v = v + O | 0, K = L(K ^ v, 12), E = E + K | 0, O = L(O ^ E, 8), v = v + O | 0, K = L(K ^ v, 7), x = x + T | 0, k = L(k ^ x, 16), N = N + k | 0, T = L(T ^ N, 12), x = x + T | 0, k = L(k ^ x, 8), N = N + k | 0, T = L(T ^ N, 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 + _ | 0, I = L(I ^ P, 16), w = w + I | 0, _ = L(_ ^ w, 12), P = P + _ | 0, I = L(I ^ P, 8), w = w + I | 0, _ = L(_ ^ w, 7);
   let $ = 0;
-  r[$++] = o + m | 0, r[$++] = a + x | 0, r[$++] = c + A | 0, r[$++] = l + P | 0, r[$++] = f + U | 0, r[$++] = u + K | 0, r[$++] = g + T | 0, r[$++] = b + R | 0, r[$++] = p + H | 0, r[$++] = h + w | 0, r[$++] = d + v | 0, r[$++] = y + N | 0, r[$++] = E + k | 0, r[$++] = S + C | 0, r[$++] = _ + I | 0, r[$++] = B + O | 0;
+  r[$++] = o + E | 0, r[$++] = c + x | 0, r[$++] = a + S | 0, r[$++] = l + P | 0, r[$++] = f + _ | 0, r[$++] = u + K | 0, r[$++] = g + T | 0, r[$++] = b + R | 0, r[$++] = p + H | 0, r[$++] = h + w | 0, r[$++] = d + v | 0, r[$++] = y + N | 0, r[$++] = m + k | 0, r[$++] = A + C | 0, r[$++] = U + I | 0, r[$++] = B + O | 0;
 }
-const Sr = /* @__PURE__ */ Qs(eo, {
+const Ar = /* @__PURE__ */ Qs(eo, {
   counterRight: !1,
   counterLength: 4,
   allowShortKeys: !1
@@ -2280,7 +2280,7 @@ const Sr = /* @__PURE__ */ Qs(eo, {
 class Kr extends ur {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, se.hash(t);
-    const r = Fe(n);
+    const r = Je(n);
     if (this.iHash = t.create(), typeof this.iHash.update != "function")
       throw new Error("Expected instance of class which extends utils.Hash");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
@@ -2305,8 +2305,8 @@ class Kr extends ur {
   }
   _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();
@@ -2315,23 +2315,23 @@ class Kr extends ur {
 const ht = (e, t, n) => new Kr(e, t).update(n).digest();
 ht.create = (e, t) => new Kr(e, t);
 function rn(e, t, n) {
-  return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), ht(e, Fe(n), Fe(t));
+  return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), ht(e, Je(n), Je(t));
 }
-const Ut = new Uint8Array([0]), qn = new Uint8Array();
+const _t = new Uint8Array([0]), qn = new Uint8Array();
 function Cr(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 = qn);
-  const s = new Uint8Array(i * e.outputLen), o = ht.create(e, t), a = o._cloneInto(), c = new Uint8Array(o.outputLen);
+  const s = new Uint8Array(i * e.outputLen), o = ht.create(e, t), c = o._cloneInto(), a = new Uint8Array(o.outputLen);
   for (let l = 0; l < i; l++)
-    Ut[0] = l + 1, a.update(l === 0 ? qn : c).update(n).update(Ut).digestInto(c), s.set(c, e.outputLen * l), o._cloneInto(a);
-  return o.destroy(), a.destroy(), c.fill(0), Ut.fill(0), s.slice(0, r);
+    _t[0] = l + 1, c.update(l === 0 ? qn : 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 to = Object.defineProperty, D = (e, t) => {
   for (var n in t)
     to(e, n, { get: t[n], enumerable: !0 });
-}, Re = Symbol("verified"), no = (e) => e instanceof Object;
+}, Oe = Symbol("verified"), no = (e) => e instanceof Object;
 function sn(e) {
   if (!no(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;
@@ -2416,19 +2416,19 @@ var Br = class {
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = M(We.getPublicKey(t)), n.id = Qe(n), n.sig = M(We.sign(Qe(n), t)), n[Re] = !0, n;
+    return n.pubkey = M(We.getPublicKey(t)), n.id = Ge(n), n.sig = M(We.sign(Ge(n), t)), n[Oe] = !0, n;
   }
   verifyEvent(e) {
-    if (typeof e[Re] == "boolean")
-      return e[Re];
-    const t = Qe(e);
+    if (typeof e[Oe] == "boolean")
+      return e[Oe];
+    const t = Ge(e);
     if (t !== e.id)
-      return e[Re] = !1, !1;
+      return e[Oe] = !1, !1;
     try {
       const n = We.verify(e.sig, t, e.pubkey);
-      return e[Re] = n, n;
+      return e[Oe] = n, n;
     } catch {
-      return e[Re] = !1, !1;
+      return e[Oe] = !1, !1;
     }
   }
 };
@@ -2437,20 +2437,20 @@ function uo(e) {
     throw new Error("can't serialize event with wrong or missing properties");
   return JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content]);
 }
-function Qe(e) {
+function Ge(e) {
   let t = fe(ne.encode(uo(e)));
   return M(t);
 }
-var dt = new co(), ke = dt.generateSecretKey, le = dt.getPublicKey, X = dt.finalizeEvent, pt = dt.verifyEvent, lo = {};
+var dt = new co(), _e = dt.generateSecretKey, le = dt.getPublicKey, X = dt.finalizeEvent, pt = dt.verifyEvent, lo = {};
 D(lo, {
   Application: () => da,
-  BadgeAward: () => mo,
+  BadgeAward: () => Eo,
   BadgeDefinition: () => oa,
   BlockedRelaysList: () => zo,
   BookmarkList: () => qo,
   Bookmarksets: () => ra,
-  Calendar: () => ma,
-  CalendarEventRSVP: () => Ea,
+  Calendar: () => Ea,
+  CalendarEventRSVP: () => ma,
   ChannelCreation: () => $r,
   ChannelHideMessage: () => Or,
   ChannelMessage: () => Rr,
@@ -2460,7 +2460,7 @@ D(lo, {
   ClientAuth: () => Hr,
   CommunitiesList: () => Do,
   CommunityDefinition: () => Na,
-  CommunityPostApproval: () => Uo,
+  CommunityPostApproval: () => _o,
   Contacts: () => wo,
   CreateOrUpdateProduct: () => ua,
   CreateOrUpdateStall: () => ca,
@@ -2479,17 +2479,17 @@ D(lo, {
   Genericlists: () => ta,
   GiftWrap: () => Pr,
   HTTPAuth: () => un,
-  Handlerinformation: () => Aa,
+  Handlerinformation: () => Sa,
   Handlerrecommendation: () => xa,
   Highlights: () => Oo,
   InterestsList: () => Wo,
   Interestsets: () => aa,
   JobFeedback: () => Lo,
-  JobRequest: () => _o,
+  JobRequest: () => Uo,
   JobResult: () => Io,
   Label: () => ko,
   LightningPubRPC: () => Yo,
-  LiveChatMessage: () => So,
+  LiveChatMessage: () => Ao,
   LiveEvent: () => pa,
   LongFormArticle: () => la,
   Metadata: () => po,
@@ -2498,9 +2498,9 @@ D(lo, {
   NWCWalletRequest: () => qr,
   NWCWalletResponse: () => Xo,
   NostrConnect: () => Qo,
-  OpenTimestamps: () => Ao,
+  OpenTimestamps: () => So,
   Pinlist: () => Po,
-  PrivateDirectMessage: () => Eo,
+  PrivateDirectMessage: () => mo,
   ProblemTracker: () => Ko,
   ProfileBadges: () => sa,
   PublicChatsList: () => jo,
@@ -2521,33 +2521,33 @@ D(lo, {
   ZapGoal: () => $o,
   ZapRequest: () => To,
   classifyKind: () => fo,
-  isEphemeralKind: () => _r,
+  isEphemeralKind: () => Ur,
   isKind: () => ho,
   isParameterizedReplaceableKind: () => Ir,
   isRegularKind: () => kr,
-  isReplaceableKind: () => Ur
+  isReplaceableKind: () => _r
 });
 function kr(e) {
   return 1e3 <= e && e < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(e);
 }
-function Ur(e) {
+function _r(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
-function _r(e) {
+function Ur(e) {
   return 2e4 <= e && e < 3e4;
 }
 function Ir(e) {
   return 3e4 <= e && e < 4e4;
 }
 function fo(e) {
-  return kr(e) ? "regular" : Ur(e) ? "replaceable" : _r(e) ? "ephemeral" : Ir(e) ? "parameterized" : "unknown";
+  return kr(e) ? "regular" : _r(e) ? "replaceable" : Ur(e) ? "ephemeral" : Ir(e) ? "parameterized" : "unknown";
 }
 function ho(e, t) {
   const n = t instanceof Array ? t : [t];
   return sn(e) && n.includes(e.kind) || !1;
 }
-var po = 0, yo = 1, go = 2, wo = 3, bo = 4, vo = 5, an = 6, cn = 7, mo = 8, Lr = 13, Eo = 14, xo = 16, $r = 40, Tr = 41, Rr = 42, Or = 43, Mr = 44, Ao = 1040, Pr = 1059, No = 1063, So = 1311, Ko = 1971, Co = 1984, Bo = 1984, ko = 1985, Uo = 4550, _o = 5999, Io = 6999, Lo = 7e3, $o = 9041, To = 9734, Ro = 9735, Oo = 9802, Mo = 1e4, Po = 10001, Ho = 10002, qo = 10003, Do = 10004, jo = 10005, zo = 10006, Vo = 10007, Wo = 10015, Zo = 10030, Go = 10050, Fo = 10096, Jo = 13194, Yo = 21e3, Hr = 22242, qr = 23194, Xo = 23195, Qo = 24133, un = 27235, ea = 3e4, ta = 30001, na = 30002, ra = 30003, ia = 30004, sa = 30008, oa = 30009, aa = 30015, ca = 30017, ua = 30018, la = 30023, fa = 30024, ha = 30030, da = 30078, pa = 30311, ya = 30315, ga = 30402, wa = 30403, ba = 31922, va = 31923, ma = 31924, Ea = 31925, xa = 31989, Aa = 31990, Na = 34550, Sa = {};
-D(Sa, {
+var po = 0, yo = 1, go = 2, wo = 3, bo = 4, vo = 5, an = 6, cn = 7, Eo = 8, Lr = 13, mo = 14, xo = 16, $r = 40, Tr = 41, Rr = 42, Or = 43, Mr = 44, So = 1040, Pr = 1059, No = 1063, Ao = 1311, Ko = 1971, Co = 1984, Bo = 1984, ko = 1985, _o = 4550, Uo = 5999, Io = 6999, Lo = 7e3, $o = 9041, To = 9734, Ro = 9735, Oo = 9802, Mo = 1e4, Po = 10001, Ho = 10002, qo = 10003, Do = 10004, jo = 10005, zo = 10006, Vo = 10007, Wo = 10015, Zo = 10030, Go = 10050, Fo = 10096, Jo = 13194, Yo = 21e3, Hr = 22242, qr = 23194, Xo = 23195, Qo = 24133, un = 27235, ea = 3e4, ta = 30001, na = 30002, ra = 30003, ia = 30004, sa = 30008, oa = 30009, aa = 30015, ca = 30017, ua = 30018, la = 30023, fa = 30024, ha = 30030, da = 30078, pa = 30311, ya = 30315, ga = 30402, wa = 30403, ba = 31922, va = 31923, Ea = 31924, ma = 31925, xa = 31989, Sa = 31990, Na = 34550, Aa = {};
+D(Aa, {
   getHex64: () => ln,
   getInt: () => Dr,
   getSubscriptionId: () => Ka,
@@ -2585,11 +2585,11 @@ function Ba(e, t) {
 function ka(e, t) {
   return t === Dr(e, "kind");
 }
-var Ua = {};
-D(Ua, {
-  makeAuthEvent: () => _a
+var _a = {};
+D(_a, {
+  makeAuthEvent: () => Ua
 });
-function _a(e, t) {
+function Ua(e, t) {
   return {
     kind: Hr,
     created_at: Math.floor(Date.now() / 1e3),
@@ -2638,11 +2638,11 @@ function Ra(e) {
   return t[0] = e >> 24 & 255, t[1] = e >> 16 & 255, t[2] = e >> 8 & 255, t[3] = e & 255, t;
 }
 function yt(e) {
-  var i, s, o, a, c, l, f;
+  var i, s, o, c, a, l, f;
   let { prefix: t, words: n } = je.decode(e, fn), r = new Uint8Array(je.fromWords(n));
   switch (t) {
     case "nprofile": {
-      let u = _t(r);
+      let u = Ut(r);
       if (!((i = u[0]) != null && i[0]))
         throw new Error("missing TLV 0 for nprofile");
       if (u[0][0].length !== 32)
@@ -2656,7 +2656,7 @@ function yt(e) {
       };
     }
     case "nevent": {
-      let u = _t(r);
+      let u = Ut(r);
       if (!((s = u[0]) != null && s[0]))
         throw new Error("missing TLV 0 for nevent");
       if (u[0][0].length !== 32)
@@ -2671,13 +2671,13 @@ function yt(e) {
           id: M(u[0][0]),
           relays: u[1] ? u[1].map((g) => ue.decode(g)) : [],
           author: (o = u[2]) != null && o[0] ? M(u[2][0]) : void 0,
-          kind: (a = u[3]) != null && a[0] ? parseInt(M(u[3][0]), 16) : void 0
+          kind: (c = u[3]) != null && c[0] ? parseInt(M(u[3][0]), 16) : void 0
         }
       };
     }
     case "naddr": {
-      let u = _t(r);
-      if (!((c = u[0]) != null && c[0]))
+      let u = Ut(r);
+      if (!((a = u[0]) != null && a[0]))
         throw new Error("missing TLV 0 for naddr");
       if (!((l = u[2]) != null && l[0]))
         throw new Error("missing TLV 2 for naddr");
@@ -2706,7 +2706,7 @@ function yt(e) {
       throw new Error(`unknown prefix ${t}`);
   }
 }
-function _t(e) {
+function Ut(e) {
   let t = {}, n = e;
   for (; n.length > 0; ) {
     let r = n[0], i = n[1], s = n.slice(2, 2 + i);
@@ -2776,13 +2776,13 @@ D(ja, {
   encrypt: () => zr
 });
 async function zr(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e, i = _e.getSharedSecret(r, "02" + t), s = Vr(i);
-  let o = Uint8Array.from(fr(16)), a = ne.encode(n), c = Er(s, o).encrypt(a), l = he.encode(new Uint8Array(c)), f = he.encode(new Uint8Array(o.buffer));
+  const r = e instanceof Uint8Array ? M(e) : e, i = Ie.getSharedSecret(r, "02" + t), s = Vr(i);
+  let o = Uint8Array.from(fr(16)), c = ne.encode(n), a = mr(s, o).encrypt(c), l = he.encode(new Uint8Array(a)), f = he.encode(new Uint8Array(o.buffer));
   return `${l}?iv=${f}`;
 }
 async function za(e, t, n) {
   const r = e instanceof Uint8Array ? M(e) : e;
-  let [i, s] = n.split("?iv="), o = _e.getSharedSecret(r, "02" + t), a = Vr(o), c = he.decode(s), l = he.decode(i), f = Er(a, c).decrypt(l);
+  let [i, s] = n.split("?iv="), o = Ie.getSharedSecret(r, "02" + t), c = Vr(o), a = he.decode(s), l = he.decode(i), f = mr(c, a).decrypt(l);
   return ue.decode(f);
 }
 function Vr(e) {
@@ -2825,8 +2825,8 @@ async function Wr(e) {
     const s = `https://${r}/.well-known/nostr.json?name=${n}`, o = await bt(s, { redirect: "manual" });
     if (o.status !== 200)
       throw Error("Wrong response code");
-    const a = await o.json(), c = a.names[n];
-    return c ? { pubkey: c, relays: (i = a.relays) == null ? void 0 : i[c] } : null;
+    const c = await o.json(), a = c.names[n];
+    return a ? { pubkey: a, relays: (i = c.relays) == null ? void 0 : i[a] } : null;
   } catch {
     return null;
   }
@@ -2851,9 +2851,9 @@ function Ya(e) {
   for (let i = e.tags.length - 1; i >= 0; i--) {
     const s = e.tags[i];
     if (s[0] === "e" && s[1]) {
-      const [o, a, c, l, f] = s, u = {
-        id: a,
-        relays: c ? [c] : [],
+      const [o, c, a, l, f] = s, u = {
+        id: c,
+        relays: a ? [a] : [],
         author: f
       };
       if (l === "root") {
@@ -2872,10 +2872,10 @@ function Ya(e) {
       continue;
     }
     if (s[0] === "q" && s[1]) {
-      const [o, a, c] = s;
+      const [o, c, a] = s;
       t.quotes.push({
-        id: a,
-        relays: c ? [c] : []
+        id: c,
+        relays: a ? [a] : []
       });
     }
     if (s[0] === "p" && s[1]) {
@@ -2891,10 +2891,10 @@ function Ya(e) {
       return;
     let s = t.mentions.indexOf(i);
     if (s !== -1 && t.mentions.splice(s, 1), i.author) {
-      let o = t.profiles.find((a) => a.pubkey === i.author);
-      o && o.relays && (i.relays || (i.relays = []), o.relays.forEach((a) => {
-        var c;
-        ((c = i.relays) == null ? void 0 : c.indexOf(a)) === -1 && i.relays.push(a);
+      let o = t.profiles.find((c) => c.pubkey === i.author);
+      o && o.relays && (i.relays || (i.relays = []), o.relays.forEach((c) => {
+        var a;
+        ((a = i.relays) == null ? void 0 : a.indexOf(c)) === -1 && i.relays.push(c);
       }), o.relays = i.relays);
     }
   }), t.mentions.forEach((i) => {
@@ -3090,7 +3090,7 @@ D(yc, {
   channelHideMessageEvent: () => vc,
   channelMessageEvent: () => bc,
   channelMetadataEvent: () => wc,
-  channelMuteUserEvent: () => mc
+  channelMuteUserEvent: () => Ec
 });
 var gc = (e, t) => {
   let n;
@@ -3154,7 +3154,7 @@ var gc = (e, t) => {
     },
     t
   );
-}, mc = (e, t) => {
+}, Ec = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3171,12 +3171,12 @@ var gc = (e, t) => {
     },
     t
   );
-}, Ec = {};
-D(Ec, {
+}, mc = {};
+D(mc, {
   EMOJI_SHORTCODE_REGEX: () => Yr,
   matchAll: () => xc,
   regex: () => yn,
-  replaceAll: () => Ac
+  replaceAll: () => Sc
 });
 var Yr = /:(\w+):/, yn = () => new RegExp(`\\B${Yr.source}\\B`, "g");
 function* xc(e) {
@@ -3193,7 +3193,7 @@ function* xc(e) {
     } catch {
     }
 }
-function Ac(e, t) {
+function Sc(e, t) {
   return e.replaceAll(yn(), (n, r) => t({
     shortcode: n,
     name: r
@@ -3201,7 +3201,7 @@ function Ac(e, t) {
 }
 var Nc = {};
 D(Nc, {
-  useFetchImplementation: () => Sc,
+  useFetchImplementation: () => Ac,
   validateGithub: () => Kc
 });
 var gn;
@@ -3209,7 +3209,7 @@ try {
   gn = fetch;
 } catch {
 }
-function Sc(e) {
+function Ac(e) {
   gn = e;
 }
 async function Kc(e, t, n) {
@@ -3221,14 +3221,14 @@ async function Kc(e, t, n) {
 }
 var q = {};
 D(q, {
-  decrypt: () => mn,
+  decrypt: () => En,
   encrypt: () => vn,
   getConversationKey: () => wn,
-  v2: () => _c
+  v2: () => Uc
 });
 var Xr = 1, Qr = 65535;
 function wn(e, t) {
-  const n = _e.getSharedSecret(e, "02" + t).subarray(1, 33);
+  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
   return rn(fe, n, "nip44-v2");
 }
 function ei(e, t) {
@@ -3269,7 +3269,7 @@ function ti(e, t, n) {
   const r = lt(n, t);
   return ht(fe, e, r);
 }
-function Uc(e) {
+function _c(e) {
   if (typeof e != "string")
     throw new Error("payload must be a valid string");
   const t = e.length;
@@ -3296,23 +3296,23 @@ function Uc(e) {
   };
 }
 function vn(e, t, n = fr(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ei(t, n), o = Bc(e), a = Sr(r, i, o), c = ti(s, a, n);
-  return he.encode(lt(new Uint8Array([2]), n, a, c));
+  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ei(t, n), o = Bc(e), c = Ar(r, i, o), a = ti(s, c, n);
+  return he.encode(lt(new Uint8Array([2]), n, c, a));
 }
-function mn(e, t) {
-  const { nonce: n, ciphertext: r, mac: i } = Uc(e), { chacha_key: s, chacha_nonce: o, hmac_key: a } = ei(t, n), c = ti(a, r, n);
-  if (!Rs(c, i))
+function En(e, t) {
+  const { nonce: n, ciphertext: r, mac: i } = _c(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = ei(t, n), a = ti(c, r, n);
+  if (!Rs(a, i))
     throw new Error("invalid MAC");
-  const l = Sr(s, o, r);
+  const l = Ar(s, o, r);
   return kc(l);
 }
-var _c = {
+var Uc = {
   utils: {
     getConversationKey: wn,
     calcPaddedLen: bn
   },
   encrypt: vn,
-  decrypt: mn
+  decrypt: En
 }, Ic = {};
 D(Ic, {
   makeNwcRequestEvent: () => $c,
@@ -3346,26 +3346,26 @@ D(Tc, {
   useFetchImplementation: () => Rc,
   validateZapRequest: () => Pc
 });
-var En;
+var mn;
 try {
-  En = fetch;
+  mn = fetch;
 } catch {
 }
 function Rc(e) {
-  En = e;
+  mn = e;
 }
 async function Oc(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 = ue.decode(a);
+      let { words: o } = je.decode(n, 1e3), c = je.fromWords(o);
+      t = ue.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 En(t)).json();
+    let s = await (await mn(t)).json();
     if (s.allowsNostr && s.nostrPubkey)
       return s.callback;
   } catch {
@@ -3420,7 +3420,7 @@ function Hc({
   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: "",
@@ -3438,7 +3438,7 @@ D(qc, {
   wrapEvent: () => Vt,
   wrapManyEvents: () => jc
 });
-var Dc = 2 * 24 * 60 * 60, ni = () => Math.round(Date.now() / 1e3), ri = () => Math.round(ni() - Math.random() * Dc), ii = (e, t) => wn(e, t), si = (e, t, n) => vn(JSON.stringify(e), ii(t, n)), Dn = (e, t) => JSON.parse(mn(e.content, ii(t, e.pubkey)));
+var Dc = 2 * 24 * 60 * 60, ni = () => Math.round(Date.now() / 1e3), ri = () => Math.round(ni() - Math.random() * Dc), ii = (e, t) => wn(e, t), si = (e, t, n) => vn(JSON.stringify(e), ii(t, n)), Dn = (e, t) => JSON.parse(En(e.content, ii(t, e.pubkey)));
 function oi(e, t) {
   const n = {
     created_at: ni(),
@@ -3447,7 +3447,7 @@ function oi(e, t) {
     ...e,
     pubkey: le(t)
   };
-  return n.id = Qe(n), n;
+  return n.id = Ge(n), n;
 }
 function ai(e, t, n) {
   return X(
@@ -3461,7 +3461,7 @@ function ai(e, t, n) {
   );
 }
 function ci(e, t) {
-  const n = ke();
+  const n = _e();
   return X(
     {
       kind: Pr,
@@ -3579,9 +3579,8 @@ async function wi(e, t, n, r) {
     throw new Error("Invalid nostr event, payload tag does not match request body hash");
   return !0;
 }
-const He = 4, jn = 30078, nu = 100;
-var Gc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Gc || {});
-function ru(e) {
+const Be = 30078, jn = 30078, Gc = 14, ru = 100;
+function iu(e) {
   return JSON.stringify({
     rootKey: M(e.rootKey),
     theirCurrentNostrPublicKey: e.theirCurrentNostrPublicKey,
@@ -3613,7 +3612,7 @@ function ru(e) {
     )
   });
 }
-function iu(e) {
+function su(e) {
   const t = JSON.parse(e);
   return {
     rootKey: G(t.rootKey),
@@ -3646,10 +3645,10 @@ function iu(e) {
     )
   };
 }
-async function* su(e) {
+async function* ou(e) {
   const t = [];
   let n = null;
-  const r = e.onMessage((i) => {
+  const r = e.onEvent((i) => {
     n ? (n(i), n = null) : t.push(i);
   });
   try {
@@ -3661,7 +3660,7 @@ async function* su(e) {
     r();
   }
 }
-function Oe(e, t = new Uint8Array(32), n = 1) {
+function Me(e, t = new Uint8Array(32), n = 1) {
   const r = rn(fe, e, t), i = [];
   for (let s = 1; s <= n; s++)
     i.push(Cr(fe, r, new Uint8Array([s]), 32));
@@ -3670,7 +3669,7 @@ function Oe(e, t = new Uint8Array(32), n = 1) {
 function It(e, t) {
   return `${e}:${t}`;
 }
-const Fc = 1e3;
+const Fc = 1e3, Jc = "0000000000000000000000000000000000000000000000000000000000000000";
 class st {
   // 1. CHANNEL PUBLIC INTERFACE
   constructor(t, n) {
@@ -3692,11 +3691,11 @@ class st {
    * @returns A new Session instance
    */
   static init(t, n, r, i, s, o) {
-    const a = ke(), [c, l] = Oe(s, q.getConversationKey(a, n), 2);
+    const c = _e(), [a, l] = Me(s, q.getConversationKey(c, n), 2);
     let f, u;
-    i ? (f = { publicKey: le(r), privateKey: r }, u = { publicKey: le(a), privateKey: a }) : u = { publicKey: le(r), privateKey: r };
+    i ? (f = { publicKey: le(r), privateKey: r }, u = { publicKey: le(c), privateKey: c }) : u = { publicKey: le(r), privateKey: r };
     const g = {
-      rootKey: i ? c : s,
+      rootKey: i ? a : s,
       theirNextNostrPublicKey: n,
       ourCurrentNostrKey: f,
       ourNextNostrKey: u,
@@ -3711,19 +3710,42 @@ class st {
     return o && (b.name = o), b;
   }
   /**
-   * Sends an encrypted message through the session
-   * @param data The plaintext message to send
+   * Sends a text message through the encrypted session
+   * @param text The plaintext message to send
    * @returns A verified Nostr event containing the encrypted message
    * @throws Error if we are not the initiator and trying to send the first message
    */
   send(t) {
+    return this.sendEvent({
+      content: t,
+      kind: Gc
+    });
+  }
+  /**
+   * Send a Nostr event through the encrypted session
+   * @param event Partial Nostr event to send. Must be unsigned. Id and will be generated if not provided.
+   * @returns A verified Nostr event containing the encrypted message
+   * @throws Error if we are not the initiator and trying to send the first message
+   */
+  sendEvent(t) {
     if (!this.state.theirNextNostrPublicKey || !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 = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNextNostrPublicKey), s = q.encrypt(JSON.stringify(n), i);
+    if ("sig" in t)
+      throw new Error("Event must be unsigned " + JSON.stringify(t));
+    const n = {
+      ...t,
+      content: t.content || "",
+      kind: t.kind || Be,
+      created_at: t.created_at || Math.floor(Date.now() / 1e3),
+      tags: t.tags || [],
+      pubkey: t.pubkey || Jc
+    };
+    n.tags.some(([a]) => a === "ms") || n.tags.push(["ms", Date.now().toString()]), n.id = Ge(n);
+    const [r, i] = this.ratchetEncrypt(JSON.stringify(t)), s = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNextNostrPublicKey), o = q.encrypt(JSON.stringify(r), s);
     return X({
-      content: r,
-      kind: He,
-      tags: [["header", s]],
+      content: i,
+      kind: Be,
+      tags: [["header", o]],
       created_at: Math.floor(Date.now() / 1e3)
     }, this.state.ourCurrentNostrKey.privateKey);
   }
@@ -3732,7 +3754,7 @@ class st {
    * @param callback Function to be called when a message is received
    * @returns Unsubscribe function to stop receiving messages
    */
-  onMessage(t) {
+  onEvent(t) {
     const n = this.currentInternalSubscriptionId++;
     return this.internalSubscriptions.set(n, t), this.subscribeToNostrEvents(), () => this.internalSubscriptions.delete(n);
   }
@@ -3745,11 +3767,10 @@ class st {
   }
   // 2. RATCHET FUNCTIONS
   ratchetEncrypt(t) {
-    const [n, r] = Oe(this.state.sendingChainKey, new Uint8Array([1]), 2);
+    const [n, r] = Me(this.state.sendingChainKey, new Uint8Array([1]), 2);
     return this.state.sendingChainKey = n, [{
       number: this.state.sendingChainMessageNumber++,
       nextPublicKey: this.state.ourNextNostrKey.publicKey,
-      time: Date.now(),
       previousChainLength: this.state.previousSendingChainMessageCount
     }, q.encrypt(t, r)];
   }
@@ -3757,47 +3778,47 @@ class st {
     const i = this.trySkippedMessageKeys(t, n, r);
     if (i) return i;
     this.skipMessageKeys(t.number, r);
-    const [s, o] = Oe(this.state.receivingChainKey, new Uint8Array([1]), 2);
+    const [s, o] = Me(this.state.receivingChainKey, new Uint8Array([1]), 2);
     this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++;
     try {
       return q.decrypt(n, o);
-    } catch (a) {
-      throw console.error(this.name, "Decryption failed:", a, {
+    } catch (c) {
+      throw console.error(this.name, "Decryption failed:", c, {
         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;
+      }), c;
     }
   }
   ratchetStep(t) {
     this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.theirNextNostrPublicKey = t;
-    const n = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [r, i] = Oe(this.state.rootKey, n, 2);
+    const n = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [r, i] = Me(this.state.rootKey, n, 2);
     this.state.receivingChainKey = i, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
-    const s = ke();
+    const s = _e();
     this.state.ourNextNostrKey = {
       publicKey: le(s),
       privateKey: s
     };
-    const o = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [a, c] = Oe(r, o, 2);
-    this.state.rootKey = a, this.state.sendingChainKey = c;
+    const o = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [c, a] = Me(r, o, 2);
+    this.state.rootKey = c, this.state.sendingChainKey = a;
   }
   // 3. MESSAGE KEY FUNCTIONS
   skipMessageKeys(t, n) {
     if (this.state.receivingChainMessageNumber + Fc < t)
       throw new Error("Too many skipped messages");
     for (; this.state.receivingChainMessageNumber < t; ) {
-      const [r, i] = Oe(this.state.receivingChainKey, new Uint8Array([1]), 2);
+      const [r, i] = Me(this.state.receivingChainKey, new Uint8Array([1]), 2);
       this.state.receivingChainKey = r;
       const s = It(n, this.state.receivingChainMessageNumber);
       if (this.state.skippedMessageKeys[s] = i, !this.state.skippedHeaderKeys[n]) {
         const o = [];
         if (this.state.ourCurrentNostrKey) {
-          const c = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
-          o.push(c);
+          const a = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
+          o.push(a);
         }
-        const a = q.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
-        o.push(a), this.state.skippedHeaderKeys[n] = o;
+        const c = q.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
+        o.push(c), this.state.skippedHeaderKeys[n] = o;
       }
       this.state.receivingChainMessageNumber++;
     }
@@ -3807,7 +3828,7 @@ class st {
     const i = It(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), q.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), q.decrypt(n, o);
     }
     return null;
   }
@@ -3836,46 +3857,46 @@ class st {
     throw new Error("Failed to decrypt header with current and skipped header keys");
   }
   handleNostrEvent(t) {
-    var o;
+    var c;
     const [n, r, i] = this.decryptHeader(t);
     if (!i)
-      this.state.theirNextNostrPublicKey !== n.nextPublicKey && (this.state.theirCurrentNostrPublicKey = this.state.theirNextNostrPublicKey, this.state.theirNextNostrPublicKey = n.nextPublicKey, (o = this.nostrUnsubscribe) == null || o.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
-        { authors: [this.state.theirNextNostrPublicKey], kinds: [He] },
+      this.state.theirNextNostrPublicKey !== n.nextPublicKey && (this.state.theirCurrentNostrPublicKey = this.state.theirNextNostrPublicKey, this.state.theirNextNostrPublicKey = n.nextPublicKey, (c = this.nostrUnsubscribe) == null || c.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
+        { authors: [this.state.theirNextNostrPublicKey], kinds: [Be] },
         (a) => this.handleNostrEvent(a)
       )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey));
     else if (!(It(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 }));
+    const s = this.ratchetDecrypt(n, t.content, t.pubkey), o = JSON.parse(s);
+    this.internalSubscriptions.forEach((a) => a(o, t));
   }
   subscribeToNostrEvents() {
     if (this.nostrNextUnsubscribe) return;
     this.nostrNextUnsubscribe = this.nostrSubscribe(
-      { authors: [this.state.theirNextNostrPublicKey], kinds: [He] },
+      { authors: [this.state.theirNextNostrPublicKey], kinds: [Be] },
       (n) => this.handleNostrEvent(n)
     );
     const t = Object.keys(this.state.skippedHeaderKeys);
     this.state.theirCurrentNostrPublicKey && !t.includes(this.state.theirCurrentNostrPublicKey) && t.push(this.state.theirCurrentNostrPublicKey), this.nostrUnsubscribe = this.nostrSubscribe(
-      { authors: t, kinds: [He] },
+      { authors: t, kinds: [Be] },
       (n) => this.handleNostrEvent(n)
     );
   }
 }
 new TextDecoder("utf-8");
 new TextEncoder();
-function Xe(e, t) {
-  const n = _e.getSharedSecret(e, "02" + t).subarray(1, 33);
+function Qe(e, t) {
+  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
   return rn(fe, n, "nip44-v2");
 }
-class Me {
-  constructor(t, n, r, i, s, o, a = []) {
-    this.inviterEphemeralPublicKey = t, this.sharedSecret = n, this.inviter = r, this.inviterEphemeralPrivateKey = i, this.label = s, this.maxUses = o, this.usedBy = a;
+class Pe {
+  constructor(t, n, r, i, s, o, c = []) {
+    this.inviterEphemeralPublicKey = t, this.sharedSecret = n, this.inviter = r, this.inviterEphemeralPrivateKey = i, this.label = s, this.maxUses = o, this.usedBy = c;
   }
   static createNew(t, n, r) {
     if (!t)
       throw new Error("Inviter public key is required");
-    const i = ke(), s = le(i), o = M(ke());
-    return new Me(
+    const i = _e(), s = le(i), o = M(_e());
+    return new Pe(
       s,
       o,
       t,
@@ -3895,18 +3916,18 @@ class Me {
     } catch (l) {
       throw new Error("Invite data in URL hash is not valid JSON: " + l);
     }
-    const { inviter: o, ephemeralKey: a, sharedSecret: c } = s;
-    if (!o || !a || !c)
+    const { inviter: o, ephemeralKey: c, sharedSecret: a } = s;
+    if (!o || !c || !a)
       throw new Error("Missing required fields (inviter, ephemeralKey, sharedSecret) in invite data.");
-    return new Me(
-      a,
+    return new Pe(
       c,
+      a,
       o
     );
   }
   static deserialize(t) {
     const n = JSON.parse(t);
-    return new Me(
+    return new Pe(
       n.inviterEphemeralPublicKey,
       n.sharedSecret,
       n.inviter,
@@ -3917,15 +3938,15 @@ class Me {
     );
   }
   static fromEvent(t) {
-    var o, a;
+    var o, c;
     if (!t.sig)
       throw new Error("Event is not signed");
     if (!pt(t))
       throw new Error("Event signature is invalid");
-    const { tags: n } = t, r = (o = n.find(([c]) => c === "ephemeralKey")) == null ? void 0 : o[1], i = (a = n.find(([c]) => c === "sharedSecret")) == null ? void 0 : a[1], s = t.pubkey;
+    const { tags: n } = t, r = (o = n.find(([a]) => a === "ephemeralKey")) == null ? void 0 : o[1], i = (c = n.find(([a]) => a === "sharedSecret")) == null ? void 0 : c[1], s = t.pubkey;
     if (!r || !i)
       throw new Error("Invalid invite event: missing session key or sharedSecret");
-    return new Me(
+    return new Pe(
       r,
       i,
       s
@@ -3939,14 +3960,14 @@ class Me {
       "#d": ["nostr-double-ratchet/invite"]
     };
     let s = 0;
-    return n(i, (a) => {
-      if (!(!a.created_at || a.created_at <= s)) {
-        s = a.created_at;
+    return n(i, (c) => {
+      if (!(!c.created_at || c.created_at <= s)) {
+        s = c.created_at;
         try {
-          const c = Me.fromEvent(a);
-          r(c);
-        } catch (c) {
-          console.error("Error processing invite:", c, "event:", a);
+          const a = Pe.fromEvent(c);
+          r(a);
+        } catch (a) {
+          console.error("Error processing invite:", a, "event:", c);
         }
       }
     });
@@ -4001,25 +4022,25 @@ class Me {
        * so the inviter can create the session on their side.
        */
   async accept(t, n, r) {
-    const i = ke(), s = le(i), o = this.inviter || this.inviterEphemeralPublicKey, a = G(this.sharedSecret), c = st.init(t, this.inviterEphemeralPublicKey, i, !0, a, void 0), l = ke(), f = le(l), g = await (typeof r == "function" ? r : (h, d) => Promise.resolve(q.encrypt(h, Xe(r, d))))(s, o), b = {
+    const i = _e(), s = le(i), o = this.inviter || this.inviterEphemeralPublicKey, c = G(this.sharedSecret), a = st.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), l = _e(), f = le(l), g = await (typeof r == "function" ? r : (h, d) => Promise.resolve(q.encrypt(h, Qe(r, d))))(s, o), b = {
       pubkey: n,
       tags: [["sharedSecret", this.sharedSecret]],
-      content: await q.encrypt(g, a),
+      content: await q.encrypt(g, c),
       created_at: Math.floor(Date.now() / 1e3)
     }, p = {
-      kind: He,
+      kind: Be,
       pubkey: f,
-      content: q.encrypt(JSON.stringify(b), Xe(l, this.inviterEphemeralPublicKey)),
+      content: q.encrypt(JSON.stringify(b), Qe(l, this.inviterEphemeralPublicKey)),
       created_at: Math.floor(Date.now() / 1e3),
       tags: [["p", this.inviterEphemeralPublicKey]]
     };
-    return { session: c, event: X(p, l) };
+    return { session: a, event: X(p, l) };
   }
   listen(t, n, r) {
     if (!this.inviterEphemeralPrivateKey)
       throw new Error("Inviter session key is not available");
     const i = {
-      kinds: [He],
+      kinds: [Be],
       "#p": [this.inviterEphemeralPublicKey]
     };
     return n(i, async (s) => {
@@ -4028,14 +4049,14 @@ class Me {
           console.error("Invite has reached maximum number of uses");
           return;
         }
-        const o = await q.decrypt(s.content, Xe(this.inviterEphemeralPrivateKey, s.pubkey)), a = JSON.parse(o);
-        if (!a.tags || !a.tags.some(([h, d]) => h === "sharedSecret" && d === this.sharedSecret)) {
+        const o = await q.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o);
+        if (!c.tags || !c.tags.some(([h, d]) => h === "sharedSecret" && d === this.sharedSecret)) {
           console.error("Invalid secret from event", s);
           return;
         }
-        const c = G(this.sharedSecret), l = a.pubkey;
+        const a = G(this.sharedSecret), l = c.pubkey;
         this.usedBy.push(l);
-        const f = await q.decrypt(a.content, c), g = await (typeof t == "function" ? t : (h, d) => Promise.resolve(q.decrypt(h, Xe(t, d))))(f, l), b = s.id, p = st.init(n, g, this.inviterEphemeralPrivateKey, !1, c, b);
+        const f = await q.decrypt(c.content, a), g = await (typeof t == "function" ? t : (h, d) => Promise.resolve(q.decrypt(h, Qe(t, d))))(f, l), b = s.id, p = st.init(n, g, this.inviterEphemeralPrivateKey, !1, a, b);
         r(p, l);
       } catch (o) {
         console.error("Error processing invite message:", o, "event", s);
@@ -4044,15 +4065,15 @@ class Me {
   }
 }
 export {
+  Gc as CHAT_MESSAGE_KIND,
   jn as INVITE_EVENT_KIND,
-  Me as Invite,
-  nu as MAX_SKIP,
-  He as MESSAGE_EVENT_KIND,
-  Gc as Sender,
+  Pe as Invite,
+  ru as MAX_SKIP,
+  Be as MESSAGE_EVENT_KIND,
   st as Session,
-  su as createMessageStream,
-  iu as deserializeSessionState,
-  Oe as kdf,
-  ru as serializeSessionState,
+  ou as createEventStream,
+  su as deserializeSessionState,
+  Me as kdf,
+  iu as serializeSessionState,
   It as skippedMessageIndexKey
 };