nostr-double-ratchet 0.0.13 → 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,28 +22,28 @@ 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;
 }
-function Si(...e) {
+function Ni(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -58,22 +58,22 @@ let Wn = class {
     return this._cloneInto();
   }
 };
-function Ni(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), o = BigInt(4294967295), s = Number(n >> i & o), a = Number(n & o), c = r ? 4 : 0, u = r ? 0 : 4;
-  e.setUint32(t + c, s, r), e.setUint32(t + u, 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 ki = class extends Wn {
+let Ci = class extends Wn {
   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 = xt(this.buffer);
   }
@@ -81,35 +81,35 @@ let ki = class extends Wn {
     et(this);
     const { view: n, buffer: r, blockLen: i } = this;
     t = Wt(t);
-    const o = t.length;
-    for (let s = 0; s < o; ) {
-      const a = Math.min(i - this.pos, o - s);
-      if (a === i) {
-        const c = xt(t);
-        for (; i <= o - s; s += i)
-          this.process(c, s);
+    const s = t.length;
+    for (let o = 0; o < s; ) {
+      const c = Math.min(i - this.pos, s - o);
+      if (c === i) {
+        const a = xt(t);
+        for (; i <= s - o; o += i)
+          this.process(a, o);
         continue;
       }
-      r.set(t.subarray(s, s + a), this.pos), this.pos += a, s += a, this.pos === i && (this.process(n, 0), this.pos = 0);
+      r.set(t.subarray(o, o + 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;
-    const { buffer: n, view: r, blockLen: i, isLE: o } = this;
-    let { pos: s } = this;
-    n[s++] = 128, this.buffer.subarray(s).fill(0), this.padOffset > i - s && (this.process(r, 0), s = 0);
-    for (let l = s; l < i; l++)
-      n[l] = 0;
-    Ki(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const a = xt(t), c = this.outputLen;
-    if (c % 4)
+    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 c = xt(t), a = this.outputLen;
+    if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const u = c / 4, f = this.get();
-    if (u > f.length)
+    const l = a / 4, f = this.get();
+    if (l > f.length)
       throw new Error("_sha2: outputLen bigger than state");
-    for (let l = 0; l < u; l++)
-      a.setUint32(4 * l, f[l], o);
+    for (let u = 0; u < l; u++)
+      c.setUint32(4 * u, f[u], s);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -119,11 +119,11 @@ let ki = class extends Wn {
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: r, length: i, finished: o, destroyed: s, pos: a } = this;
-    return t.length = i, t.pos = a, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
+    const { blockLen: n, buffer: r, length: i, finished: s, destroyed: o, pos: 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, Ci = (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,31 +198,31 @@ const Bi = (e, t, n) => e & t ^ ~e & n, Ci = (e, t, n) => e & t ^ e & n ^ t & n,
   528734635,
   1541459225
 ]), ve = /* @__PURE__ */ new Uint32Array(64);
-let _i = class extends ki {
+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: o, F: s, G: a, H: c } = this;
-    return [t, n, r, i, o, s, a, c];
+    const { A: t, B: n, C: r, D: i, E: s, F: o, G: c, H: a } = this;
+    return [t, n, r, i, s, o, c, a];
   }
   // prettier-ignore
-  set(t, n, r, i, o, s, a, c) {
-    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = o | 0, this.F = s | 0, this.G = a | 0, this.H = c | 0;
+  set(t, n, r, i, s, o, 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 l = 0; l < 16; l++, n += 4)
-      ve[l] = t.getUint32(n, !1);
-    for (let l = 16; l < 64; l++) {
-      const g = ve[l - 15], b = ve[l - 2], p = re(g, 7) ^ re(g, 18) ^ g >>> 3, h = re(b, 17) ^ re(b, 19) ^ b >>> 10;
-      ve[l] = h + ve[l - 7] + p + ve[l - 16] | 0;
+    for (let u = 0; u < 16; u++, n += 4)
+      ve[u] = t.getUint32(n, !1);
+    for (let u = 16; u < 64; u++) {
+      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: o, D: s, E: a, F: c, G: u, H: f } = this;
-    for (let l = 0; l < 64; l++) {
-      const g = re(a, 6) ^ re(a, 11) ^ re(a, 25), b = f + g + Bi(a, c, u) + Ui[l] + ve[l] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + Ci(r, i, o) | 0;
-      f = u, u = c, c = a, a = s + b | 0, s = o, o = i, i = r, r = b + h | 0;
+    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(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, o = o + this.C | 0, s = s + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, u = u + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, a, c, u, 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,9 +231,9 @@ let _i = class extends ki {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const Lt = /* @__PURE__ */ Ni(() => new _i());
+const Lt = /* @__PURE__ */ Ai(() => new Ui());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Gn = BigInt(0), st = BigInt(1), Ii = BigInt(2), at = (e) => e instanceof Uint8Array, Li = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+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) {
   if (!at(e))
     throw new Error("Uint8Array expected");
@@ -259,10 +259,10 @@ function De(e) {
     throw new Error("padded hex string expected, got unpadded hex of length " + t);
   const n = new Uint8Array(t / 2);
   for (let r = 0; r < n.length; r++) {
-    const i = r * 2, o = e.slice(i, i + 2), s = Number.parseInt(o, 16);
-    if (Number.isNaN(s) || s < 0)
+    const i = r * 2, s = e.slice(i, i + 2), o = Number.parseInt(s, 16);
+    if (Number.isNaN(o) || o < 0)
       throw new Error("Invalid byte sequence");
-    n[r] = s;
+    n[r] = o;
   }
   return n;
 }
@@ -274,11 +274,11 @@ function Gt(e) {
     throw new Error("Uint8Array expected");
   return Zt(qe(Uint8Array.from(e).reverse()));
 }
-function Se(e, t) {
+function Ne(e, t) {
   return De(e.toString(16).padStart(t * 2, "0"));
 }
 function Ft(e, t) {
-  return Se(e, t).reverse();
+  return Ne(e, t).reverse();
 }
 function $i(e) {
   return De(Fn(e));
@@ -288,8 +288,8 @@ function W(e, t, n) {
   if (typeof t == "string")
     try {
       r = De(t);
-    } catch (o) {
-      throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${o}`);
+    } catch (s) {
+      throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${s}`);
     }
   else if (at(t))
     r = Uint8Array.from(t);
@@ -324,14 +324,14 @@ function Ri(e) {
 }
 function Oi(e) {
   let t;
-  for (t = 0; e > Gn; e >>= st, t += 1)
+  for (t = 0; e > Gn; e >>= ot, t += 1)
     ;
   return t;
 }
 function Mi(e, t) {
-  return e >> BigInt(t) & st;
+  return e >> BigInt(t) & ot;
 }
-const Hi = (e, t, n) => e | (n ? st : Gn) << BigInt(t), Jt = (e) => (Ii << BigInt(e - 1)) - st, At = (e) => new Uint8Array(e), kn = (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,32 +339,32 @@ 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), o = 0;
-  const s = () => {
-    r.fill(1), i.fill(0), o = 0;
-  }, a = (...l) => n(i, r, ...l), c = (l = At()) => {
-    i = a(kn([0]), l), r = a(), l.length !== 0 && (i = a(kn([1]), l), r = a());
-  }, u = () => {
-    if (o++ >= 1e3)
+  let r = St(e), i = St(e), s = 0;
+  const o = () => {
+    r.fill(1), i.fill(0), s = 0;
+  }, 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 l = 0;
+    let u = 0;
     const g = [];
-    for (; l < t; ) {
-      r = a();
+    for (; u < t; ) {
+      r = c();
       const b = r.slice();
-      g.push(b), l += r.length;
+      g.push(b), u += r.length;
     }
     return Ue(...g);
   };
-  return (l, g) => {
-    s(), c(l);
+  return (u, g) => {
+    o(), a(u);
     let b;
-    for (; !(b = g(u())); )
-      c();
-    return s(), b;
+    for (; !(b = g(l())); )
+      a();
+    return o(), b;
   };
 }
-const Pi = {
+const Hi = {
   bigint: (e) => typeof e == "bigint",
   function: (e) => typeof e == "function",
   boolean: (e) => typeof e == "boolean",
@@ -375,19 +375,19 @@ const Pi = {
   field: (e, t) => t.Fp.isValid(e),
   hash: (e) => typeof e == "function" && Number.isSafeInteger(e.outputLen)
 };
-function Je(e, t, n = {}) {
-  const r = (i, o, s) => {
-    const a = Pi[o];
-    if (typeof a != "function")
-      throw new Error(`Invalid validator "${o}", expected function`);
-    const c = e[i];
-    if (!(s && c === void 0) && !a(c, e))
-      throw new Error(`Invalid param ${String(i)}=${c} (${typeof c}), expected ${o}`);
+function Ye(e, t, n = {}) {
+  const r = (i, s, o) => {
+    const c = Hi[s];
+    if (typeof c != "function")
+      throw new Error(`Invalid validator "${s}", expected function`);
+    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, o] of Object.entries(t))
-    r(i, o, !1);
-  for (const [i, o] of Object.entries(n))
-    r(i, o, !0);
+  for (const [i, s] of Object.entries(t))
+    r(i, s, !1);
+  for (const [i, s] of Object.entries(n))
+    r(i, s, !0);
   return e;
 }
 const qi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
@@ -395,7 +395,7 @@ const qi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   bitGet: Mi,
   bitLen: Oi,
   bitMask: Jt,
-  bitSet: Hi,
+  bitSet: Pi,
   bytesToHex: qe,
   bytesToNumberBE: F,
   bytesToNumberLE: Gt,
@@ -405,15 +405,15 @@ const qi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   equalBytes: Ti,
   hexToBytes: De,
   hexToNumber: Zt,
-  numberToBytesBE: Se,
+  numberToBytesBE: Ne,
   numberToBytesLE: Ft,
   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), D = BigInt(1), ke = BigInt(2), Di = BigInt(3), $t = BigInt(4), Bn = BigInt(5), Cn = BigInt(8);
+const z = BigInt(0), j = BigInt(1), Ce = BigInt(2), Di = BigInt(3), $t = BigInt(4), Bn = BigInt(5), kn = BigInt(8);
 BigInt(9);
 BigInt(16);
 function V(e, t) {
@@ -423,11 +423,11 @@ function V(e, t) {
 function ji(e, t, n) {
   if (n <= z || t < z)
     throw new Error("Expected power/modulo > 0");
-  if (n === D)
+  if (n === j)
     return z;
-  let r = D;
+  let r = j;
   for (; t > z; )
-    t & D && (r = r * e % n), e = e * e % n, t >>= D;
+    t & j && (r = r * e % n), e = e * e % n, t >>= j;
   return r;
 }
 function J(e, t, n) {
@@ -439,65 +439,65 @@ function J(e, t, n) {
 function Tt(e, t) {
   if (e === z || t <= z)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
-  let n = V(e, t), r = t, i = z, o = D;
+  let n = V(e, t), r = t, i = z, s = j;
   for (; n !== z; ) {
-    const a = r / n, c = r % n, u = i - o * a;
-    r = n, n = c, i = o, o = u;
+    const c = r / n, a = r % n, l = i - s * c;
+    r = n, n = a, i = s, s = l;
   }
-  if (r !== D)
+  if (r !== j)
     throw new Error("invert: does not exist");
   return V(i, t);
 }
 function zi(e) {
-  const t = (e - D) / ke;
+  const t = (e - j) / Ce;
   let n, r, i;
-  for (n = e - D, r = 0; n % ke === z; n /= ke, r++)
+  for (n = e - j, r = 0; n % Ce === z; n /= Ce, r++)
     ;
-  for (i = ke; i < e && ji(i, t, e) !== e - D; i++)
+  for (i = Ce; i < e && ji(i, t, e) !== e - j; i++)
     ;
   if (r === 1) {
-    const s = (e + D) / $t;
-    return function(c, u) {
-      const f = c.pow(u, s);
-      if (!c.eql(c.sqr(f), u))
+    const o = (e + j) / $t;
+    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 o = (n + D) / ke;
-  return function(a, c) {
-    if (a.pow(c, t) === a.neg(a.ONE))
+  const s = (n + j) / Ce;
+  return function(c, a) {
+    if (c.pow(a, t) === c.neg(c.ONE))
       throw new Error("Cannot find square root");
-    let u = r, f = a.pow(a.mul(a.ONE, i), n), l = a.pow(c, o), 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 < u && !a.eql(h, a.ONE); b++)
-        h = a.sqr(h);
-      const p = a.pow(f, D << BigInt(u - b - 1));
-      f = a.sqr(p), l = a.mul(l, p), g = a.mul(g, f), u = 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 l;
+    return u;
   };
 }
 function Vi(e) {
   if (e % $t === Di) {
-    const t = (e + D) / $t;
+    const t = (e + j) / $t;
     return function(r, i) {
-      const o = r.pow(i, t);
-      if (!r.eql(r.sqr(o), i))
+      const s = r.pow(i, t);
+      if (!r.eql(r.sqr(s), i))
         throw new Error("Cannot find square root");
-      return o;
+      return s;
     };
   }
-  if (e % Cn === Bn) {
-    const t = (e - Bn) / Cn;
+  if (e % kn === Bn) {
+    const t = (e - Bn) / kn;
     return function(r, i) {
-      const o = r.mul(i, ke), s = r.pow(o, t), a = r.mul(i, s), c = r.mul(r.mul(a, ke), s), u = r.mul(a, r.sub(c, r.ONE));
-      if (!r.eql(r.sqr(u), i))
+      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 u;
+      return l;
     };
   }
   return zi(e);
@@ -528,23 +528,23 @@ 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)
     throw new Error("Expected power > 0");
   if (n === z)
     return e.ONE;
-  if (n === D)
+  if (n === j)
     return t;
   let r = e.ONE, i = t;
   for (; n > z; )
-    n & D && (r = e.mul(r, i)), i = e.sqr(i), n >>= D;
+    n & j && (r = e.mul(r, i)), i = e.sqr(i), n >>= j;
   return r;
 }
 function Fi(e, t) {
-  const n = new Array(t.length), r = t.reduce((o, s, a) => e.is0(s) ? o : (n[a] = o, e.mul(o, s)), e.ONE), i = e.inv(r);
-  return t.reduceRight((o, s, a) => e.is0(s) ? o : (n[a] = e.mul(o, n[a]), e.mul(o, s)), i), n;
+  const n = new Array(t.length), r = t.reduce((s, o, 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);
@@ -553,51 +553,51 @@ function Yn(e, t) {
 function Ji(e, t, n = !1, r = {}) {
   if (e <= z)
     throw new Error(`Expected Field ORDER > 0, got ${e}`);
-  const { nBitLength: i, nByteLength: o } = Yn(e, t);
-  if (o > 2048)
+  const { nBitLength: i, nByteLength: s } = Yn(e, t);
+  if (s > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const s = Vi(e), a = Object.freeze({
+  const o = Vi(e), c = Object.freeze({
     ORDER: e,
     BITS: i,
-    BYTES: o,
+    BYTES: s,
     MASK: Jt(i),
     ZERO: z,
-    ONE: D,
-    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;
+    ONE: j,
+    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 & D) === D,
-    neg: (c) => V(-c, e),
-    eql: (c, u) => c === u,
-    sqr: (c) => V(c * c, e),
-    add: (c, u) => V(c + u, e),
-    sub: (c, u) => V(c - u, e),
-    mul: (c, u) => V(c * u, e),
-    pow: (c, u) => Gi(a, c, u),
-    div: (c, u) => V(c * Tt(u, 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, u) => c + u,
-    subN: (c, u) => c - u,
-    mulN: (c, u) => c * u,
-    inv: (c) => Tt(c, e),
-    sqrt: r.sqrt || ((c) => s(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, u, f) => f ? u : c,
-    toBytes: (c) => n ? Ft(c, o) : Se(c, o),
-    fromBytes: (c) => {
-      if (c.length !== o)
-        throw new Error(`Fp.fromBytes: expected ${o}, 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")
@@ -610,30 +610,30 @@ function Qn(e) {
   return t + Math.ceil(t / 2);
 }
 function Yi(e, t, n = !1) {
-  const r = e.length, i = Xn(t), o = Qn(t);
-  if (r < 16 || r < o || r > 1024)
-    throw new Error(`expected ${o}-1024 bytes of input, got ${r}`);
-  const s = n ? F(e) : Gt(e), a = V(s, t - D) + D;
-  return n ? Ft(a, i) : Se(a, i);
+  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), 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), St = BigInt(1);
+const Xi = BigInt(0), Nt = BigInt(1);
 function Qi(e, t) {
-  const n = (i, o) => {
-    const s = o.negate();
-    return i ? s : o;
+  const n = (i, s) => {
+    const o = s.negate();
+    return i ? o : s;
   }, r = (i) => {
-    const o = Math.ceil(t / i) + 1, s = 2 ** (i - 1);
-    return { windows: o, windowSize: s };
+    const s = Math.ceil(t / i) + 1, o = 2 ** (i - 1);
+    return { windows: s, windowSize: o };
   };
   return {
     constTimeNegate: n,
     // non-const time multiplication ladder
-    unsafeLadder(i, o) {
-      let s = e.ZERO, a = i;
-      for (; o > Xi; )
-        o & St && (s = s.add(a)), a = a.double(), o >>= St;
-      return s;
+    unsafeLadder(i, s) {
+      let o = e.ZERO, c = i;
+      for (; s > Xi; )
+        s & Nt && (o = o.add(c)), c = c.double(), s >>= Nt;
+      return o;
     },
     /**
      * Creates a wNAF precomputation window. Used for caching.
@@ -645,16 +645,16 @@ function Qi(e, t) {
      * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
      * @returns precomputed point tables flattened to a single array
      */
-    precomputeWindow(i, o) {
-      const { windows: s, windowSize: a } = r(o), c = [];
-      let u = i, f = u;
-      for (let l = 0; l < s; l++) {
-        f = u, c.push(f);
-        for (let g = 1; g < a; g++)
-          f = f.add(u), c.push(f);
-        u = f.double();
+    precomputeWindow(i, s) {
+      const { windows: o, windowSize: c } = r(s), a = [];
+      let l = i, f = l;
+      for (let u = 0; u < o; u++) {
+        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.
@@ -663,28 +663,28 @@ function Qi(e, t) {
      * @param n scalar (we don't check here, but should be less than curve order)
      * @returns real and fake (for const-time) points
      */
-    wNAF(i, o, s) {
-      const { windows: a, windowSize: c } = r(i);
-      let u = e.ZERO, f = e.BASE;
-      const l = BigInt(2 ** i - 1), g = 2 ** i, b = BigInt(i);
-      for (let p = 0; p < a; p++) {
-        const h = p * c;
-        let d = Number(s & l);
-        s >>= b, d > c && (d -= g, s += St);
-        const y = h, E = h + Math.abs(d) - 1, N = p % 2 !== 0, _ = d < 0;
-        d === 0 ? f = f.add(n(N, o[y])) : u = u.add(n(_, o[E]));
+    wNAF(i, s, o) {
+      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 < c; p++) {
+        const h = p * a;
+        let d = Number(o & u);
+        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: u, f };
+      return { p: l, f };
     },
-    wNAFCached(i, o, s, a) {
-      const c = i._WINDOW_SIZE || 1;
-      let u = o.get(i);
-      return u || (u = this.precomputeWindow(i, c), c !== 1 && o.set(i, a(u))), this.wNAF(c, u, s);
+    wNAFCached(i, s, o, c) {
+      const a = i._WINDOW_SIZE || 1;
+      let l = s.get(i);
+      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",
@@ -699,9 +699,9 @@ function er(e) {
   });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function eo(e) {
+function es(e) {
   const t = er(e);
-  Je(t, {
+  Ye(t, {
     a: "field",
     b: "field"
   }, {
@@ -722,7 +722,7 @@ function eo(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: to, hexToBytes: no } = 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: to, hexToBytes: no } = 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);
@@ -740,10 +740,10 @@ const { bytesToNumberBE: to, hexToBytes: no } = qi, Be = {
       throw new t("Invalid signature integer: negative");
     if (r[0] === 0 && !(r[1] & 128))
       throw new t("Invalid signature integer: unnecessary leading zero");
-    return { d: to(r), l: e.subarray(n + 2) };
+    return { d: ts(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = Be, n = typeof e == "string" ? no(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,64 +751,64 @@ const { bytesToNumberBE: to, hexToBytes: no } = qi, Be = {
       throw new t("Invalid signature tag");
     if (n[1] !== r - 2)
       throw new t("Invalid signature: incorrect length");
-    const { d: i, l: o } = Be._parseInt(n.subarray(2)), { d: s, l: a } = Be._parseInt(o);
-    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 };
+    return { r: i, s: o };
   },
   hexFromSig(e) {
-    const t = (u) => Number.parseInt(u[0], 16) & 8 ? "00" + u : u, n = (u) => {
-      const f = u.toString(16);
+    const t = (l) => Number.parseInt(l[0], 16) & 8 ? "00" + l : l, n = (l) => {
+      const f = l.toString(16);
       return f.length & 1 ? `0${f}` : f;
-    }, r = t(n(e.s)), i = t(n(e.r)), o = r.length / 2, s = i.length / 2, a = n(o), c = n(s);
-    return `30${n(s + o + 4)}02${c}${i}02${a}${r}`;
+    }, r = t(n(e.s)), i = t(n(e.r)), s = r.length / 2, o = i.length / 2, 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 ro(e) {
-  const t = eo(e), { Fp: n } = t, r = t.toBytes || ((p, h, d) => {
+function rs(e) {
+  const t = es(e), { Fp: n } = t, r = t.toBytes || ((p, h, d) => {
     const y = h.toAffine();
     return Ue(Uint8Array.from([4]), n.toBytes(y.x), n.toBytes(y.y));
   }), i = t.fromBytes || ((p) => {
     const h = p.subarray(1), d = n.fromBytes(h.subarray(0, n.BYTES)), y = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
     return { x: d, y };
   });
-  function o(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);
+  function s(p) {
+    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), o(t.Gx)))
+  if (!n.eql(n.sqr(t.Gy), s(t.Gx)))
     throw new Error("bad generator point: equation left != right");
-  function s(p) {
+  function o(p) {
     return typeof p == "bigint" && ae < p && p < t.n;
   }
-  function a(p) {
-    if (!s(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 N;
+    let A;
     try {
-      N = 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 && (N = V(N, E)), a(N), N;
+    return y && (A = V(A, m)), c(A), A;
   }
-  const u = /* @__PURE__ */ new Map();
+  const l = /* @__PURE__ */ new Map();
   function f(p) {
-    if (!(p instanceof l))
+    if (!(p instanceof u))
       throw new Error("ProjectivePoint expected");
   }
-  class l {
+  class u {
     constructor(h, d, y) {
       if (this.px = h, this.py = d, this.pz = y, h == null || !n.isValid(h))
         throw new Error("x required");
@@ -823,10 +823,10 @@ function ro(e) {
       const { x: d, y } = h || {};
       if (!h || !n.isValid(d) || !n.isValid(y))
         throw new Error("invalid affine point");
-      if (h instanceof l)
+      if (h instanceof u)
         throw new Error("projective point not allowed");
-      const E = (N) => n.eql(N, n.ZERO);
-      return E(d) && E(y) ? l.ZERO : new l(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,23 +842,23 @@ function ro(e) {
      */
     static normalizeZ(h) {
       const d = n.invertBatch(h.map((y) => y.pz));
-      return h.map((y, E) => y.toAffine(d[E])).map(l.fromAffine);
+      return h.map((y, m) => y.toAffine(d[m])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
      * @param hex short/long ECDSA hex
      */
     static fromHex(h) {
-      const d = l.fromAffine(i(W("pointHex", h)));
+      const d = u.fromAffine(i(W("pointHex", h)));
       return d.assertValidity(), d;
     }
     // Multiplies generator point by privateKey.
     static fromPrivateKey(h) {
-      return l.BASE.multiply(c(h));
+      return u.BASE.multiply(a(h));
     }
     // "Private method", don't use it directly
     _setWindowSize(h) {
-      this._WINDOW_SIZE = h, u.delete(this);
+      this._WINDOW_SIZE = h, l.delete(this);
     }
     // A point on curve is valid if it conforms to equation.
     assertValidity() {
@@ -870,8 +870,8 @@ function ro(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 = o(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,23 +887,23 @@ function ro(e) {
      */
     equals(h) {
       f(h);
-      const { px: d, py: y, pz: E } = this, { px: N, py: _, pz: B } = h, m = n.eql(n.mul(d, B), n.mul(N, 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.
      */
     negate() {
-      return new l(this.px, n.neg(this.py), this.pz);
+      return new u(this.px, n.neg(this.py), this.pz);
     }
     // Renes-Costello-Batina exception-free doubling formula.
     // There is 30% faster Jacobian formula, but it is not complete.
     // 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: N, pz: _ } = this;
-      let B = n.ZERO, m = n.ZERO, x = n.ZERO, A = n.mul(E, E), H = n.mul(N, N), U = n.mul(_, _), K = n.mul(E, N);
-      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(H, m), m = n.add(H, 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(N, _), U = n.add(U, U), A = n.mul(U, K), B = n.sub(B, A), x = n.mul(U, H), x = n.add(x, x), x = n.add(x, x), new l(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,24 +911,24 @@ function ro(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: d, py: y, pz: E } = this, { px: N, py: _, pz: B } = h;
-      let m = n.ZERO, x = n.ZERO, A = n.ZERO;
-      const H = t.a, U = n.mul(t.b, Un);
-      let K = n.mul(d, N), T = n.mul(y, _), R = n.mul(E, B), P = n.add(d, y), w = n.add(N, _);
-      P = n.mul(P, w), w = n.add(K, T), P = n.sub(P, w), w = n.add(d, E);
-      let v = n.add(N, 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(H, 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(H, R), w = n.mul(U, w), T = n.add(T, R), R = n.sub(K, R), R = n.mul(H, R), w = n.add(w, R), K = n.mul(T, w), x = n.add(x, K), K = n.mul(v, w), m = n.mul(P, m), m = n.sub(m, K), K = n.mul(P, T), A = n.mul(v, A), A = n.add(A, K), new l(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());
     }
     is0() {
-      return this.equals(l.ZERO);
+      return this.equals(u.ZERO);
     }
     wNAF(h) {
-      return b.wNAFCached(this, u, h, (d) => {
-        const y = n.invertBatch(d.map((E) => E.pz));
-        return d.map((E, N) => E.toAffine(y[N])).map(l.fromAffine);
+      return b.wNAFCached(this, l, h, (d) => {
+        const y = n.invertBatch(d.map((m) => m.pz));
+        return d.map((m, A) => m.toAffine(y[A])).map(u.fromAffine);
       });
     }
     /**
@@ -937,18 +937,18 @@ function ro(e) {
      * an exposed private key e.g. sig verification, which works over *public* keys.
      */
     multiplyUnsafe(h) {
-      const d = l.ZERO;
+      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: N, k2neg: _, k2: B } = y.splitScalar(h), m = d, x = d, A = this;
-      for (; N > ae || B > ae; )
-        N & Y && (m = m.add(A)), B & Y && (x = x.add(A)), A = A.double(), N >>= Y, B >>= Y;
-      return E && (m = m.negate()), _ && (x = x.negate()), x = new l(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 ro(e) {
      * @returns New point
      */
     multiply(h) {
-      a(h);
-      let d = h, y, E;
-      const { endo: N } = t;
-      if (N) {
-        const { k1neg: _, k1: B, k2neg: m, k2: x } = N.splitScalar(d);
-        let { p: A, f: H } = this.wNAF(B), { p: U, f: K } = this.wNAF(x);
-        A = b.constTimeNegate(_, A), U = b.constTimeNegate(m, U), U = new l(n.mul(U.px, N.beta), U.py, U.pz), y = A.add(U), E = H.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 l.normalizeZ([y, E])[0];
+      return u.normalizeZ([y, m])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -980,54 +980,54 @@ function ro(e) {
      * @returns non-zero affine point
      */
     multiplyAndAddUnsafe(h, d, y) {
-      const E = l.BASE, N = (B, m) => m === ae || m === Y || !B.equals(E) ? B.multiplyUnsafe(m) : B.multiply(m), _ = N(this, d).add(N(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, N = this.is0();
-      h == null && (h = N ? n.ONE : n.inv(E));
-      const _ = n.mul(d, h), B = n.mul(y, h), m = n.mul(E, h);
-      if (N)
+      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;
       if (h === Y)
         return !0;
       if (d)
-        return d(l, this);
+        return d(u, this);
       throw new Error("isTorsionFree() has not been declared for the elliptic curve");
     }
     clearCofactor() {
       const { h, clearCofactor: d } = t;
-      return h === Y ? this : d ? d(l, this) : this.multiplyUnsafe(t.h);
+      return h === Y ? this : d ? d(u, this) : this.multiplyUnsafe(t.h);
     }
     toRawBytes(h = !0) {
-      return this.assertValidity(), r(l, this, h);
+      return this.assertValidity(), r(u, this, h);
     }
     toHex(h = !0) {
       return qe(this.toRawBytes(h));
     }
   }
-  l.BASE = new l(t.Gx, t.Gy, n.ONE), l.ZERO = new l(n.ZERO, n.ONE, n.ZERO);
-  const g = t.nBitLength, b = Qi(l, t.endo ? Math.ceil(g / 2) : g);
+  u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
+  const g = t.nBitLength, b = Qi(u, t.endo ? Math.ceil(g / 2) : g);
   return {
     CURVE: t,
-    ProjectivePoint: l,
-    normPrivateKeyToScalar: c,
-    weierstrassEquation: o,
-    isWithinCurveOrder: s
+    ProjectivePoint: u,
+    normPrivateKeyToScalar: a,
+    weierstrassEquation: s,
+    isWithinCurveOrder: o
   };
 }
-function io(e) {
+function is(e) {
   const t = er(e);
-  return Je(t, {
+  return Ye(t, {
     hash: "hash",
     hmac: "function",
     randomBytes: "function"
@@ -1037,62 +1037,62 @@ function io(e) {
     lowS: "boolean"
   }), Object.freeze({ lowS: !0, ...t });
 }
-function oo(e) {
-  const t = io(e), { Fp: n, n: r } = t, i = n.BYTES + 1, o = 2 * n.BYTES + 1;
-  function s(w) {
+function ss(e) {
+  const t = is(e), { Fp: n, n: r } = t, i = n.BYTES + 1, s = 2 * n.BYTES + 1;
+  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: u, normPrivateKeyToScalar: f, weierstrassEquation: l, isWithinCurveOrder: g } = ro({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: g } = rs({
     ...t,
-    toBytes(w, v, S) {
-      const C = v.toAffine(), k = n.toBytes(C.x), I = Ue;
-      return S ? I(Uint8Array.from([v.hasEvenY() ? 2 : 3]), k) : I(Uint8Array.from([4]), k, n.toBytes(C.y));
+    toBytes(w, v, N) {
+      const k = v.toAffine(), C = n.toBytes(k.x), I = Ue;
+      return N ? I(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : I(Uint8Array.from([4]), C, n.toBytes(k.y));
     },
     fromBytes(w) {
-      const v = w.length, S = w[0], C = w.subarray(1);
-      if (v === i && (S === 2 || S === 3)) {
-        const k = F(C);
-        if (!s(k))
+      const v = w.length, N = w[0], k = w.subarray(1);
+      if (v === i && (N === 2 || N === 3)) {
+        const C = F(k);
+        if (!o(C))
           throw new Error("Point is not on curve");
-        const I = l(k);
+        const I = u(C);
         let O = n.sqrt(I);
         const $ = (O & Y) === Y;
-        return (S & 1) === 1 !== $ && (O = n.neg(O)), { x: k, y: O };
-      } else if (v === o && S === 4) {
-        const k = n.fromBytes(C.subarray(0, n.BYTES)), I = n.fromBytes(C.subarray(n.BYTES, 2 * n.BYTES));
-        return { x: k, y: I };
+        return (N & 1) === 1 !== $ && (O = n.neg(O)), { x: C, y: O };
+      } else if (v === s && N === 4) {
+        const C = n.fromBytes(k.subarray(0, n.BYTES)), I = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
+        return { x: C, y: I };
       } else
-        throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${o} uncompressed bytes`);
+        throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${s} uncompressed bytes`);
     }
-  }), b = (w) => qe(Se(w, t.nByteLength));
+  }), b = (w) => qe(Ne(w, t.nByteLength));
   function p(w) {
     const v = r >> Y;
     return w > v;
   }
   function h(w) {
-    return p(w) ? a(-w) : w;
+    return p(w) ? c(-w) : w;
   }
-  const d = (w, v, S) => F(w.slice(v, S));
+  const d = (w, v, N) => F(w.slice(v, N));
   class y {
-    constructor(v, S, C) {
-      this.r = v, this.s = S, this.recovery = C, this.assertValidity();
+    constructor(v, N, k) {
+      this.r = v, this.s = N, this.recovery = k, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
-      const S = t.nByteLength;
-      return v = W("compactSignature", v, S * 2), new y(d(v, 0, S), d(v, S, 2 * S));
+      const N = t.nByteLength;
+      return v = W("compactSignature", v, N * 2), new y(d(v, 0, N), d(v, N, 2 * N));
     }
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
     static fromDER(v) {
-      const { r: S, s: C } = Be.toSig(W("DER", v));
-      return new y(S, C);
+      const { r: N, s: k } = ke.toSig(W("DER", v));
+      return new y(N, k);
     }
     assertValidity() {
       if (!g(this.r))
@@ -1104,13 +1104,13 @@ function oo(e) {
       return new y(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: S, s: C, recovery: k } = this, I = x(W("msgHash", v));
-      if (k == null || ![0, 1, 2, 3].includes(k))
+      const { r: N, s: k, recovery: C } = this, I = x(W("msgHash", v));
+      if (C == null || ![0, 1, 2, 3].includes(C))
         throw new Error("recovery id invalid");
-      const O = k === 2 || k === 3 ? S + t.n : S;
+      const O = C === 2 || C === 3 ? N + t.n : N;
       if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const $ = k & 1 ? "03" : "02", Q = u.fromHex($ + b(O)), ge = c(O), Ie = a(-I * ge), Ve = a(C * ge), we = u.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 oo(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 oo(e) {
       return b(this.r) + b(this.s);
     }
   }
-  const E = {
+  const m = {
     isValidPrivateKey(w) {
       try {
         return f(w), !0;
@@ -1162,92 +1162,92 @@ function oo(e) {
      * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
      * fast.multiply(privKey); // much faster ECDH now
      */
-    precompute(w = 8, v = u.BASE) {
+    precompute(w = 8, v = l.BASE) {
       return v._setWindowSize(w), v.multiply(BigInt(3)), v;
     }
   };
-  function N(w, v = !0) {
-    return u.fromPrivateKey(w).toRawBytes(v);
+  function A(w, v = !0) {
+    return l.fromPrivateKey(w).toRawBytes(v);
   }
-  function _(w) {
-    const v = w instanceof Uint8Array, S = typeof w == "string", C = (v || S) && w.length;
-    return v ? C === i || C === o : S ? C === 2 * i || C === 2 * o : w instanceof u;
+  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, S = !0) {
-    if (_(w))
+  function B(w, v, N = !0) {
+    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 u.fromHex(v).multiply(f(w)).toRawBytes(S);
+    return l.fromHex(v).multiply(f(w)).toRawBytes(N);
   }
-  const m = t.bits2int || function(w) {
-    const v = F(w), S = w.length * 8 - t.nBitLength;
-    return S > 0 ? v >> BigInt(S) : v;
+  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);
-  function H(w) {
+    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 Se(w, t.nByteLength);
+    return Ne(w, t.nByteLength);
   }
-  function U(w, v, S = K) {
-    if (["recovered", "canonical"].some((Ke) => Ke in S))
+  function _(w, v, N = K) {
+    if (["recovered", "canonical"].some((Ke) => Ke in N))
       throw new Error("sign() legacy options not supported");
-    const { hash: C, randomBytes: k } = t;
-    let { lowS: I, prehash: O, extraEntropy: $ } = S;
-    I == null && (I = !0), w = W("msgHash", w), O && (w = W("prehashed msgHash", C(w)));
-    const Q = x(w), ge = f(v), Ie = [H(ge), H(Q)];
+    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), Le = [P(ge), P(Q)];
     if ($ != null) {
-      const Ke = $ === !0 ? k(n.BYTES) : $;
-      Ie.push(W("extraEntropy", Ke));
+      const Ke = $ === !0 ? C(n.BYTES) : $;
+      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 = u.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 Sn = ($e.x === ee ? 0 : 2) | Number($e.y & Y), Nn = Te;
-      return I && p(Te) && (Nn = h(Te), Sn ^= 1), new y(ee, Nn, Sn);
+      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, S = K) {
-    const { seed: C, k2sig: k } = U(w, v, S), I = t;
-    return Jn(I.hash.outputLen, I.nByteLength, I.hmac)(C, k);
-  }
-  u.BASE._setWindowSize(8);
-  function P(w, v, S, C = T) {
-    var $e;
-    const k = w;
-    if (v = W("msgHash", v), S = W("publicKey", S), "strict" in C)
+  function R(w, v, N = K) {
+    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 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");
-    const { lowS: I, prehash: O } = C;
+    const { lowS: I, prehash: O } = k;
     let $, Q;
     try {
-      if (typeof k == "string" || k instanceof Uint8Array)
+      if (typeof C == "string" || C instanceof Uint8Array)
         try {
-          $ = y.fromDER(k);
+          $ = y.fromDER(C);
         } catch (ee) {
-          if (!(ee instanceof Be.Err))
+          if (!(ee instanceof ke.Err))
             throw ee;
-          $ = y.fromCompact(k);
+          $ = y.fromCompact(C);
         }
-      else if (typeof k == "object" && typeof k.r == "bigint" && typeof k.s == "bigint") {
-        const { r: ee, s: Te } = k;
-        $ = new y(ee, Te);
+      else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
+        const { r: ee, s: Re } = C;
+        $ = new y(ee, Re);
       } else
         throw new Error("PARSE");
-      Q = u.fromHex(S);
+      Q = l.fromHex(N);
     } catch (ee) {
       if (ee.message === "PARSE")
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
@@ -1256,35 +1256,35 @@ function oo(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 = u.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: N,
+    getPublicKey: A,
     getSharedSecret: B,
     sign: R,
-    verify: P,
-    ProjectivePoint: u,
+    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");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const i = this.blockLen, o = new Uint8Array(i);
-    o.set(r.length > i ? t.create().update(r).digest() : r);
-    for (let s = 0; s < o.length; s++)
-      o[s] ^= 54;
-    this.iHash.update(o), this.oHash = t.create();
-    for (let s = 0; s < o.length; s++)
-      o[s] ^= 106;
-    this.oHash.update(o), o.fill(0);
+    const i = this.blockLen, s = new Uint8Array(i);
+    s.set(r.length > i ? t.create().update(r).digest() : r);
+    for (let o = 0; o < s.length; o++)
+      s[o] ^= 54;
+    this.iHash.update(s), this.oHash = t.create();
+    for (let o = 0; o < s.length; o++)
+      s[o] ^= 106;
+    this.oHash.update(s), s.fill(0);
   }
   update(t) {
     return et(this), this.iHash.update(t), this;
@@ -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: o, blockLen: s, outputLen: a } = this;
-    return t = t, t.finished = i, t.destroyed = o, t.blockLen = s, t.outputLen = a, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
+    const { oHash: n, iHash: r, finished: i, destroyed: s, blockLen: o, outputLen: 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();
@@ -1308,26 +1308,26 @@ let tr = class extends Wn {
 const nr = (e, t, n) => new tr(e, t).update(n).digest();
 nr.create = (e, t) => new tr(e, t);
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function so(e) {
+function os(e) {
   return {
     hash: e,
-    hmac: (t, ...n) => nr(e, t, Si(...n)),
+    hmac: (t, ...n) => nr(e, t, Ni(...n)),
     randomBytes: Zn
   };
 }
-function ao(e, t) {
-  const n = (r) => oo({ ...e, ...so(r) });
+function as(e, t) {
+  const n = (r) => ss({ ...e, ...os(r) });
   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), o = BigInt(22), s = BigInt(23), a = BigInt(44), c = BigInt(88), u = e * e * e % t, f = u * u * e % t, l = J(f, n, t) * f % t, g = J(l, n, t) * f % t, b = J(g, nt, t) * u % t, p = J(b, i, t) * b % t, h = J(p, o, t) * p % t, d = J(h, a, t) * h % t, y = J(d, c, t) * d % t, E = J(y, a, t) * h % t, N = J(E, n, t) * f % t, _ = J(N, s, t) * p % t, B = J(_, r, t) * u % 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 = ao({
+const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), Ie = as({
   a: BigInt(0),
   b: BigInt(7),
   Fp: Rt,
@@ -1346,15 +1346,15 @@ const Rt = Ji(ct, void 0, void 0, { sqrt: ir }), _e = ao({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
-      const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -rr * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), o = n, s = BigInt("0x100000000000000000000000000000000"), a = _n(o * e, t), c = _n(-r * e, t);
-      let u = V(e - a * n - c * i, t), f = V(-a * r - c * o, t);
-      const l = u > s, g = f > s;
-      if (l && (u = t - u), g && (f = t - f), u > s || f > s)
+      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);
-      return { k1neg: l, k1: u, k2neg: g, k2: f };
+      return { k1neg: u, k1: l, k2neg: g, k2: f };
     }
   }
-}, Lt), lt = BigInt(0), or = (e) => typeof e == "bigint" && lt < e && e < ct, co = (e) => typeof e == "bigint" && lt < e && e < tt, In = {};
+}, Lt), ut = BigInt(0), sr = (e) => typeof e == "bigint" && ut < e && e < ct, cs = (e) => typeof e == "bigint" && ut < e && e < tt, In = {};
 function rt(e, ...t) {
   let n = In[e];
   if (n === void 0) {
@@ -1363,75 +1363,75 @@ function rt(e, ...t) {
   }
   return Lt(Ue(n, ...t));
 }
-const Yt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => Se(e, 32), Nt = (e) => V(e, ct), Ge = (e) => V(e, tt), Xt = _e.ProjectivePoint, lo = (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 sr(e) {
-  if (!or(e))
+function or(e) {
+  if (!sr(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = Nt(e * e), n = Nt(t * e + BigInt(7));
+  const t = At(e * e), n = At(t * e + BigInt(7));
   let r = ir(n);
-  r % nt !== lt && (r = Nt(-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 uo(e) {
+function ls(e) {
   return Mt(e).bytes;
 }
-function fo(e, t, n = Zn(32)) {
-  const r = W("message", e), { bytes: i, scalar: o } = Mt(t), s = W("auxRand", n, 32), a = Ot(o ^ F(rt("BIP0340/aux", s))), c = rt("BIP0340/nonce", a, i, r), u = Ge(F(c));
-  if (u === lt)
+function fs(e, t, n = Zn(32)) {
+  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: l } = Mt(u), g = ar(f, i, r), b = new Uint8Array(64);
-  if (b.set(f, 0), b.set(Ot(Ge(l + g * o)), 32), !cr(b, r, i))
+  const { bytes: f, scalar: u } = Mt(l), g = ar(f, i, r), b = new Uint8Array(64);
+  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), o = W("publicKey", n, 32);
+  const r = W("signature", e, 64), i = W("message", t), s = W("publicKey", n, 32);
   try {
-    const s = sr(F(o)), a = F(r.subarray(0, 32));
-    if (!or(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 (!co(c))
+    const a = F(r.subarray(32, 64));
+    if (!cs(a))
       return !1;
-    const u = ar(Ot(a), Yt(s), i), f = lo(s, c, Ge(-u));
-    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;
   }
 }
 const We = {
-  getPublicKey: uo,
-  sign: fo,
+  getPublicKey: ls,
+  sign: fs,
   verify: cr,
   utils: {
-    randomPrivateKey: _e.utils.randomPrivateKey,
-    lift_x: sr,
+    randomPrivateKey: Ie.utils.randomPrivateKey,
+    lift_x: or,
     pointToBytes: Yt,
-    numberToBytesBE: Se,
+    numberToBytesBE: Ne,
     bytesToNumberBE: F,
     taggedHash: rt,
     mod: V
   }
 }, Kt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Qt = (e) => e instanceof Uint8Array, kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, ho = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!ho)
+const Qt = (e) => e instanceof Uint8Array, Ct = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, hs = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!hs)
   throw new Error("Non little-endian hardware is not supported");
-const po = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const ds = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function M(e) {
   if (!Qt(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += po[e[n]];
+    t += ds[e[n]];
   return t;
 }
 function G(e) {
@@ -1442,24 +1442,24 @@ function G(e) {
     throw new Error("padded hex string expected, got unpadded hex of length " + t);
   const n = new Uint8Array(t / 2);
   for (let r = 0; r < n.length; r++) {
-    const i = r * 2, o = e.slice(i, i + 2), s = Number.parseInt(o, 16);
-    if (Number.isNaN(s) || s < 0)
+    const i = r * 2, s = e.slice(i, i + 2), o = Number.parseInt(s, 16);
+    if (Number.isNaN(o) || o < 0)
       throw new Error("Invalid byte sequence");
-    n[r] = s;
+    n[r] = o;
   }
   return n;
 }
-function yo(e) {
+function ps(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Fe(e) {
-  if (typeof e == "string" && (e = yo(e)), !Qt(e))
+function Je(e) {
+  if (typeof e == "string" && (e = ps(e)), !Qt(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function ut(...e) {
+function lt(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -1468,14 +1468,14 @@ function ut(...e) {
     t.set(r, n), n += r.length;
   }), t;
 }
-class lr {
+class ur {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 }
-function ur(e) {
-  const t = (r) => e().update(Fe(r)).digest(), n = e();
+function lr(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) {
@@ -1483,11 +1483,11 @@ function fr(e = 32) {
     return Kt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Ht(e) {
+function Pt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function go(e) {
+function ys(e) {
   if (typeof e != "boolean")
     throw new Error(`Expected boolean, not ${e}`);
 }
@@ -1497,74 +1497,74 @@ function hr(e, ...t) {
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
 }
-function wo(e) {
+function gs(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Ht(e.outputLen), Ht(e.blockLen);
+  Pt(e.outputLen), Pt(e.blockLen);
 }
-function bo(e, t = !0) {
+function ws(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function vo(e, t) {
+function bs(e, t) {
   hr(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const oe = {
-  number: Ht,
-  bool: go,
+const se = {
+  number: Pt,
+  bool: ys,
   bytes: hr,
-  hash: wo,
-  exists: bo,
-  output: vo
+  hash: gs,
+  exists: ws,
+  output: bs
 };
-function mo(e, t, n, r) {
+function vs(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
-  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), a = Number(n & o), c = r ? 4 : 0, u = r ? 0 : 4;
-  e.setUint32(t + c, s, r), e.setUint32(t + u, 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 Eo extends lr {
+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 = kt(this.buffer);
+    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Ct(this.buffer);
   }
   update(t) {
-    oe.exists(this);
+    se.exists(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Fe(t);
-    const o = t.length;
-    for (let s = 0; s < o; ) {
-      const a = Math.min(i - this.pos, o - s);
-      if (a === i) {
-        const c = kt(t);
-        for (; i <= o - s; s += i)
-          this.process(c, s);
+    t = Je(t);
+    const s = t.length;
+    for (let o = 0; o < s; ) {
+      const c = Math.min(i - this.pos, s - o);
+      if (c === i) {
+        const a = Ct(t);
+        for (; i <= s - o; o += i)
+          this.process(a, o);
         continue;
       }
-      r.set(t.subarray(s, s + a), this.pos), this.pos += a, s += a, this.pos === i && (this.process(n, 0), this.pos = 0);
+      r.set(t.subarray(o, o + 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) {
-    oe.exists(this), oe.output(t, this), this.finished = !0;
-    const { buffer: n, view: r, blockLen: i, isLE: o } = this;
-    let { pos: s } = this;
-    n[s++] = 128, this.buffer.subarray(s).fill(0), this.padOffset > i - s && (this.process(r, 0), s = 0);
-    for (let l = s; l < i; l++)
-      n[l] = 0;
-    mo(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const a = kt(t), c = this.outputLen;
-    if (c % 4)
+    se.exists(this), se.output(t, this), this.finished = !0;
+    const { buffer: n, view: r, blockLen: i, isLE: s } = this;
+    let { pos: o } = this;
+    n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(r, 0), o = 0);
+    for (let u = o; u < i; u++)
+      n[u] = 0;
+    vs(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const c = Ct(t), a = this.outputLen;
+    if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const u = c / 4, f = this.get();
-    if (u > f.length)
+    const l = a / 4, f = this.get();
+    if (l > f.length)
       throw new Error("_sha2: outputLen bigger than state");
-    for (let l = 0; l < u; l++)
-      a.setUint32(4 * l, f[l], o);
+    for (let u = 0; u < l; u++)
+      c.setUint32(4 * u, f[u], s);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -1574,11 +1574,11 @@ class Eo extends lr {
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: r, length: i, finished: o, destroyed: s, pos: a } = this;
-    return t.length = i, t.pos = a, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
+    const { blockLen: n, buffer: r, length: i, finished: s, destroyed: o, pos: c } = this;
+    return t.length = i, t.pos = c, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 }
-const xo = (e, t, n) => e & t ^ ~e & n, Ao = (e, t, n) => e & t ^ e & n ^ t & n, So = 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 xo = (e, t, n) => e & t ^ ~e & n, Ao = (e, t, n) => e & t ^ e & n ^ t & n,
   2756734187,
   3204031479,
   3329325298
-]), me = new Uint32Array([
+]), Ee = new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -1652,54 +1652,54 @@ const xo = (e, t, n) => e & t ^ ~e & n, Ao = (e, t, n) => e & t ^ e & n ^ t & n,
   2600822924,
   528734635,
   1541459225
-]), Ee = new Uint32Array(64);
-class dr extends Eo {
+]), 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: o, F: s, G: a, H: c } = this;
-    return [t, n, r, i, o, s, a, c];
+    const { A: t, B: n, C: r, D: i, E: s, F: o, G: c, H: a } = this;
+    return [t, n, r, i, s, o, c, a];
   }
   // prettier-ignore
-  set(t, n, r, i, o, s, a, c) {
-    this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = o | 0, this.F = s | 0, this.G = a | 0, this.H = c | 0;
+  set(t, n, r, i, s, o, 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 l = 0; l < 16; l++, n += 4)
-      Ee[l] = t.getUint32(n, !1);
-    for (let l = 16; l < 64; l++) {
-      const g = Ee[l - 15], b = Ee[l - 2], p = ie(g, 7) ^ ie(g, 18) ^ g >>> 3, h = ie(b, 17) ^ ie(b, 19) ^ b >>> 10;
-      Ee[l] = h + Ee[l - 7] + p + Ee[l - 16] | 0;
+    for (let u = 0; u < 16; u++, n += 4)
+      me[u] = t.getUint32(n, !1);
+    for (let u = 16; u < 64; u++) {
+      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: o, D: s, E: a, F: c, G: u, H: f } = this;
-    for (let l = 0; l < 64; l++) {
-      const g = ie(a, 6) ^ ie(a, 11) ^ ie(a, 25), b = f + g + xo(a, c, u) + So[l] + Ee[l] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + Ao(r, i, o) | 0;
-      f = u, u = c, c = a, a = s + b | 0, s = o, o = i, i = r, r = b + h | 0;
+    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(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, o = o + this.C | 0, s = s + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, u = u + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, a, c, u, 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);
   }
 }
-class No extends dr {
+class Ns extends dr {
   constructor() {
     super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28;
   }
 }
-const fe = ur(() => new dr());
-ur(() => new No());
+const fe = lr(() => new dr());
+lr(() => new Ns());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function ze(e) {
   if (!Number.isSafeInteger(e))
     throw new Error(`Wrong integer: ${e}`);
 }
 function de(...e) {
-  const t = (i, o) => (s) => i(o(s)), n = Array.from(e).reverse().reduce((i, o) => i ? t(i, o.encode) : o.encode, void 0), r = e.reduce((i, o) => i ? t(i, o.decode) : o.decode, void 0);
+  const t = (i, s) => (o) => i(s(o)), n = Array.from(e).reverse().reduce((i, s) => i ? t(i, s.encode) : s.encode, void 0), r = e.reduce((i, s) => i ? t(i, s.decode) : s.decode, void 0);
   return { encode: n, decode: r };
 }
 function pe(e) {
@@ -1791,31 +1791,31 @@ function Ln(e, t, n) {
   if (!e.length)
     return [];
   let r = 0;
-  const i = [], o = Array.from(e);
-  for (o.forEach((s) => {
-    if (ze(s), s < 0 || s >= t)
-      throw new Error(`Wrong integer: ${s}`);
+  const i = [], s = Array.from(e);
+  for (s.forEach((o) => {
+    if (ze(o), o < 0 || o >= t)
+      throw new Error(`Wrong integer: ${o}`);
   }); ; ) {
-    let s = 0, a = !0;
-    for (let c = r; c < o.length; c++) {
-      const u = o[c], f = t * s + u;
-      if (!Number.isSafeInteger(f) || t * s / t !== s || f - u !== t * s)
+    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 (s = f % n, o[c] = Math.floor(f / n), !Number.isSafeInteger(o[c]) || o[c] * n + s !== 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)
-        o[c] ? a = !1 : r = c;
+      if (c)
+        s[a] ? c = !1 : r = a;
       else continue;
     }
-    if (i.push(s), a)
+    if (i.push(o), c)
       break;
   }
-  for (let s = 0; s < e.length - 1 && e[s] === 0; s++)
+  for (let o = 0; o < e.length - 1 && e[o] === 0; o++)
     i.push(0);
   return i.reverse();
 }
 const yr = (e, t) => t ? yr(t, e % t) : e, it = (e, t) => e + (t - yr(e, t));
-function Pt(e, t, n, r) {
+function Ht(e, t, n, r) {
   if (!Array.isArray(e))
     throw new Error("convertRadix2: data should be array");
   if (t <= 0 || t > 32)
@@ -1824,24 +1824,24 @@ function Pt(e, t, n, r) {
     throw new Error(`convertRadix2: wrong to=${n}`);
   if (it(t, n) > 32)
     throw new Error(`convertRadix2: carry overflow from=${t} to=${n} carryBits=${it(t, n)}`);
-  let i = 0, o = 0;
-  const s = 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, o + t > 32)
-      throw new Error(`convertRadix2: carry overflow pos=${o} from=${t}`);
-    for (o += t; o >= n; o -= n)
-      a.push((i >> o - n & s) >>> 0);
-    i &= 2 ** o - 1;
-  }
-  if (i = i << n - o & s, !r && o >= t)
+  let i = 0, s = 0;
+  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)
+      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 && o > 0 && a.push(i >>> 0), a;
+  return r && s > 0 && c.push(i >>> 0), c;
 }
-function Ko(e) {
+function As(e) {
   return ze(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
@@ -1855,7 +1855,7 @@ function Ko(e) {
     }
   };
 }
-function Ne(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)
@@ -1864,12 +1864,12 @@ function Ne(e, t = !1) {
     encode: (n) => {
       if (!(n instanceof Uint8Array))
         throw new Error("radix2.encode input should be Uint8Array");
-      return Pt(Array.from(n), 8, e, !t);
+      return Ht(Array.from(n), 8, e, !t);
     },
     decode: (n) => {
       if (!Array.isArray(n) || n.length && typeof n[0] != "number")
         throw new Error("radix2.decode input should be array of strings");
-      return Uint8Array.from(Pt(n, e, 8, t));
+      return Uint8Array.from(Ht(n, e, 8, t));
     }
   };
 }
@@ -1883,13 +1883,13 @@ function $n(e) {
     }
   };
 }
-const ko = de(Ne(4), pe("0123456789ABCDEF"), ye("")), Bo = de(Ne(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ft(5), ye(""));
-de(Ne(5), pe("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ft(5), ye(""));
-de(Ne(5), pe("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), ye(""), pr((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const he = de(Ne(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ft(6), ye("")), Co = de(Ne(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ft(6), ye("")), en = (e) => de(Ko(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], Uo = {
+const Tn = [0, 2, 3, 5, 6, 7, 9, 10, 11], ks = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
@@ -1901,11 +1901,11 @@ const Tn = [0, 2, 3, 5, 6, 7, 9, 10, 11], Uo = {
   decode(e) {
     let t = [];
     for (let n = 0; n < e.length; n += 11) {
-      const r = e.slice(n, n + 11), i = Tn.indexOf(r.length), o = qt.decode(r);
-      for (let s = 0; s < o.length - i; s++)
-        if (o[s] !== 0)
+      const r = e.slice(n, n + 11), i = Tn.indexOf(r.length), s = qt.decode(r);
+      for (let o = 0; o < s.length - i; o++)
+        if (s[o] !== 0)
           throw new Error("base58xmr: wrong padding");
-      t = t.concat(Array.from(o.slice(o.length - i)));
+      t = t.concat(Array.from(s.slice(s.length - i)));
     }
     return Uint8Array.from(t);
   }
@@ -1920,38 +1920,38 @@ function Ze(e) {
 function On(e, t, n = 1) {
   const r = e.length;
   let i = 1;
-  for (let o = 0; o < r; o++) {
-    const s = e.charCodeAt(o);
-    if (s < 33 || s > 126)
+  for (let s = 0; s < r; s++) {
+    const o = e.charCodeAt(s);
+    if (o < 33 || o > 126)
       throw new Error(`Invalid prefix (${e})`);
-    i = Ze(i) ^ s >> 5;
+    i = Ze(i) ^ o >> 5;
   }
   i = Ze(i);
-  for (let o = 0; o < r; o++)
-    i = Ze(i) ^ e.charCodeAt(o) & 31;
-  for (let o of t)
-    i = Ze(i) ^ o;
-  for (let o = 0; o < 6; o++)
+  for (let s = 0; s < r; s++)
+    i = Ze(i) ^ e.charCodeAt(s) & 31;
+  for (let s of t)
+    i = Ze(i) ^ s;
+  for (let s = 0; s < 6; s++)
     i = Ze(i);
-  return i ^= n, Dt.encode(Pt([i % 2 ** 30], 30, 5, !1));
+  return i ^= n, Dt.encode(Ht([i % 2 ** 30], 30, 5, !1));
 }
 function gr(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Ne(5), r = n.decode, i = n.encode, o = $n(r);
-  function s(f, l, g = 90) {
+  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}`);
-    if (!Array.isArray(l) || l.length && typeof l[0] != "number")
-      throw new Error(`bech32.encode words should be array of numbers, not ${typeof l}`);
-    const b = f.length + 7 + l.length;
+    if (!Array.isArray(u) || u.length && typeof u[0] != "number")
+      throw new Error(`bech32.encode words should be array of numbers, not ${typeof u}`);
+    const b = f.length + 7 + u.length;
     if (g !== !1 && b > g)
       throw new TypeError(`Length ${b} exceeds limit ${g}`);
-    return f = f.toLowerCase(), `${f}1${Dt.encode(l)}${On(f, l, t)}`;
+    return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${On(f, u, t)}`;
   }
-  function a(f, l = 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 || l !== !1 && f.length > l)
-      throw new TypeError(`Wrong string length: ${f.length} (${f}). Expected (8..${l})`);
+    if (f.length < 8 || u !== !1 && f.length > u)
+      throw new TypeError(`Wrong string length: ${f.length} (${f}). Expected (8..${u})`);
     const g = f.toLowerCase();
     if (f !== g && f !== f.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
@@ -1967,33 +1967,33 @@ function gr(e) {
       throw new Error(`Invalid checksum in ${f}: expected "${y}"`);
     return { prefix: p, words: d };
   }
-  const c = $n(a);
-  function u(f) {
-    const { prefix: l, words: g } = a(f, !1);
-    return { prefix: l, words: g, bytes: r(g) };
+  const a = $n(c);
+  function l(f) {
+    const { prefix: u, words: g } = c(f, !1);
+    return { prefix: u, words: g, bytes: r(g) };
   }
-  return { encode: s, decode: a, decodeToBytes: u, decodeUnsafe: c, fromWords: r, fromWordsUnsafe: o, toWords: i };
+  return { encode: o, decode: c, decodeToBytes: l, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
 const je = gr("bech32");
 gr("bech32m");
-const _o = {
+const _s = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, Io = de(Ne(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();
-})), Lo = {
-  utf8: _o,
-  hex: Io,
-  base16: ko,
-  base32: Bo,
+})), Is = {
+  utf8: _s,
+  hex: Us,
+  base16: Ks,
+  base32: Cs,
   base64: he,
-  base64url: Co,
+  base64url: Bs,
   base58: qt,
-  base58xmr: Uo
+  base58xmr: ks
 };
-`${Object.keys(Lo).join(", ")}`;
+`${Object.keys(Is).join(", ")}`;
 function Bt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
@@ -2002,25 +2002,25 @@ function Mn(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
-function $o(e) {
+function Ls(e) {
   return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
 }
 function ce(e, ...t) {
-  if (!$o(e))
+  if (!Ls(e))
     throw new Error("Uint8Array expected");
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
 }
 /*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */
-const Z = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), To = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!To)
+const Z = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), $s = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!$s)
   throw new Error("Non little-endian hardware is not supported");
-function Ro(e, t) {
+function Ts(e, t) {
   if (t == null || typeof t != "object")
     throw new Error("options must be defined");
   return Object.assign(e, t);
 }
-function Oo(e, t) {
+function Rs(e, t) {
   if (e.length !== t.length)
     return !1;
   let n = 0;
@@ -2028,9 +2028,9 @@ function Oo(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Mo = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ae = 16, Ho = 283;
+const Os = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Se = 16, Ms = 283;
 function tn(e) {
-  return e << 1 ^ Ho & -(e >> 7);
+  return e << 1 ^ Ms & -(e >> 7);
 }
 function He(e, t) {
   let n = 0;
@@ -2049,19 +2049,19 @@ const jt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), Po = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), qo = (e) => e << 24 | e >>> 8, Ct = (e) => e << 8 | e >>> 24;
+})(), Ps = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Hs = (e) => e << 24 | e >>> 8, kt = (e) => e << 8 | e >>> 24;
 function wr(e, t) {
   if (e.length !== 256)
     throw new Error("Wrong sbox length");
-  const n = new Uint32Array(256).map((u, f) => t(e[f])), r = n.map(Ct), i = r.map(Ct), o = i.map(Ct), s = new Uint32Array(256 * 256), a = new Uint32Array(256 * 256), c = new Uint16Array(256 * 256);
-  for (let u = 0; u < 256; u++)
+  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 l = u * 256 + f;
-      s[l] = n[u] ^ r[f], a[l] = i[u] ^ o[f], c[l] = e[u] << 8 | e[f];
+      const u = l * 256 + 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: o, T01: s, 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) => He(e, 3) << 24 | e << 16 | e << 8 | He(e, 2)), br = /* @__PURE__ */ wr(Po, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), Do = /* @__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,81 +2072,81 @@ 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, o = (a) => se(n, a, a, a, a), s = new Uint32Array(t + 28);
-  s.set(r);
-  for (let a = i; a < s.length; a++) {
-    let c = s[a - 1];
-    a % i === 0 ? c = o(qo(c)) ^ Do[a / i - 1] : i > 6 && a % i === 4 && (c = o(c)), s[a] = s[a - i] ^ c;
+  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 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 s;
+  return o;
 }
-function jo(e) {
-  const t = vr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: o, T1: s, T2: a, T3: c } = br;
-  for (let u = 0; u < r; u += 4)
+function Ds(e) {
+  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[u + f] = t[r - u - 4 + f];
+      n[l + f] = t[r - l - 4 + f];
   t.fill(0);
-  for (let u = 4; u < r - 4; u++) {
-    const f = n[u], l = se(i, f, f, f, f);
-    n[u] = o[l & 255] ^ s[l >>> 8 & 255] ^ a[l >>> 16 & 255] ^ c[l >>> 24];
+  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] ^ c[u >>> 16 & 255] ^ a[u >>> 24];
   }
   return n;
 }
-function xe(e, t, n, r, i, o) {
-  return e[n << 8 & 65280 | r >>> 8 & 255] ^ t[i >>> 8 & 65280 | o >>> 24 & 255];
+function xe(e, t, n, r, i, s) {
+  return e[n << 8 & 65280 | r >>> 8 & 255] ^ t[i >>> 8 & 65280 | s >>> 24 & 255];
 }
-function se(e, t, n, r, i) {
+function oe(e, t, n, r, i) {
   return e[t & 255 | n & 65280] | e[r >>> 16 & 255 | i >>> 16 & 65280] << 16;
 }
-function Hn(e, t, n, r, i) {
-  const { sbox2: o, T01: s, T23: a } = nn;
-  let c = 0;
-  t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
-  const u = e.length / 4 - 2;
-  for (let p = 0; p < u; p++) {
-    const h = e[c++] ^ xe(s, a, t, n, r, i), d = e[c++] ^ xe(s, a, n, r, i, t), y = e[c++] ^ xe(s, a, r, i, t, n), E = e[c++] ^ xe(s, a, i, t, n, r);
-    t = h, n = d, r = y, i = E;
-  }
-  const f = e[c++] ^ se(o, t, n, r, i), l = e[c++] ^ se(o, n, r, i, t), g = e[c++] ^ se(o, r, i, t, n), b = e[c++] ^ se(o, i, t, n, r);
-  return { s0: f, s1: l, s2: g, s3: b };
-}
-function zo(e, t, n, r, i) {
-  const { sbox2: o, T01: s, T23: a } = br;
-  let c = 0;
-  t ^= e[c++], n ^= e[c++], r ^= e[c++], i ^= e[c++];
-  const u = e.length / 4 - 2;
-  for (let p = 0; p < u; p++) {
-    const h = e[c++] ^ xe(s, a, t, i, r, n), d = e[c++] ^ xe(s, a, n, t, i, r), y = e[c++] ^ xe(s, a, r, n, t, i), E = e[c++] ^ xe(s, a, i, r, n, t);
-    t = h, n = d, r = y, i = E;
-  }
-  const f = e[c++] ^ se(o, t, i, r, n), l = e[c++] ^ se(o, n, t, i, r), g = e[c++] ^ se(o, r, n, t, i), b = e[c++] ^ se(o, i, r, n, t);
-  return { s0: f, s1: l, s2: g, s3: b };
-}
-function mr(e, t) {
+function Pn(e, t, n, r, i) {
+  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[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[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: 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[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[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 Er(e, t) {
   if (!t)
     return new Uint8Array(e);
   if (ce(t), t.length < e)
     throw new Error(`aes: wrong destination length, expected at least ${e}, got: ${t.length}`);
   return t;
 }
-function Vo(e) {
-  if (ce(e), e.length % Ae !== 0)
-    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ae}`);
+function zs(e) {
+  if (ce(e), e.length % Se !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Se}`);
 }
-function Wo(e, t, n) {
+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 o = Z(e);
+  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 s = mr(r, n), a = Z(s);
-  return { b: o, o: a, out: s };
+  const o = Er(r, n), c = Z(o);
+  return { b: s, o: c, out: o };
 }
-function Zo(e, t) {
+function Ws(e, t) {
   if (!t)
     return e;
   const n = e.length;
@@ -2156,148 +2156,148 @@ function Zo(e, t) {
   if (r <= 0 || r > 16)
     throw new Error(`aes/pcks5: wrong padding byte: ${r}`);
   const i = e.subarray(0, -r);
-  for (let o = 0; o < r; o++)
-    if (e[n - o - 1] !== r)
+  for (let s = 0; s < r; s++)
+    if (e[n - s - 1] !== r)
       throw new Error("aes/pcks5: wrong padding");
   return i;
 }
-function Go(e) {
+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__ */ Mo({ 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: (o, s) => {
-      const a = vr(t), { b: c, o: u, out: f } = Wo(o, i, s), l = Z(n);
-      let g = l[0], b = l[1], p = l[2], h = l[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 } = Hn(a, g, b, p, h), u[d++] = g, u[d++] = b, u[d++] = p, u[d++] = h;
+    encrypt: (s, o) => {
+      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 <= 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 = Go(o.subarray(d * 4));
-        g ^= y[0], b ^= y[1], p ^= y[2], h ^= y[3], { s0: g, s1: b, s2: p, s3: h } = Hn(a, g, b, p, h), u[d++] = g, u[d++] = b, u[d++] = p, u[d++] = h;
+        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(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: (o, s) => {
-      Vo(o);
-      const a = jo(t), c = Z(n), u = mr(o.length, s), f = Z(o), l = Z(u);
-      let g = c[0], b = c[1], p = c[2], h = c[3];
+    decrypt: (s, o) => {
+      zs(s);
+      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, N = 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 } = zo(a, g, b, p, h);
-        l[d++] = B ^ y, l[d++] = m ^ E, l[d++] = x ^ N, l[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), Zo(u, i);
+      return c.fill(0), Ws(l, i);
     }
   };
-}), xr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Fo = xr("expand 16-byte k"), Jo = xr("expand 32-byte k"), Yo = Z(Fo), Ar = Z(Jo);
-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, Xo = 16, Sr = 2 ** 32 - 1, Pn = new Uint32Array();
-function Qo(e, t, n, r, i, o, s, a) {
-  const c = i.length, u = new Uint8Array(Ye), f = Z(u), l = zt(i) && zt(o), g = l ? Z(i) : Pn, b = l ? Z(o) : Pn;
-  for (let p = 0; p < c; s++) {
-    if (e(t, n, r, f, s, a), s >= Sr)
+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 (l && 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 < Xo; 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++)
-      y = p + d, o[y] = i[y] ^ u[d];
+      y = p + d, s[y] = i[y] ^ l[d];
     p += h;
   }
 }
-function es(e, t) {
-  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: o, rounds: s } = Ro({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
+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(s), Mn(o), Mn(n), (a, c, u, f, l = 0) => {
-    ce(a), ce(c), ce(u);
-    const g = u.length;
-    if (f || (f = new Uint8Array(g)), ce(f), Bt(l), l < 0 || l >= Sr)
+  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 = Yo, 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, o ? 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 N = Z(c);
-    for (Qo(e, d, y, N, u, f, l, s); 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 ts(e, t, n, r, i, o = 20) {
-  let s = e[0], a = e[1], c = e[2], u = e[3], f = t[0], l = t[1], g = t[2], b = t[3], p = t[4], h = t[5], d = t[6], y = t[7], E = i, N = n[0], _ = n[1], B = n[2], m = s, x = a, A = c, H = u, U = f, K = l, T = g, R = b, P = p, w = h, v = d, S = y, C = E, k = N, I = _, O = B;
-  for (let Q = 0; Q < o; Q += 2)
-    m = m + U | 0, C = L(C ^ m, 16), P = P + C | 0, U = L(U ^ P, 12), m = m + U | 0, C = L(C ^ m, 8), P = P + C | 0, U = L(U ^ P, 7), x = x + K | 0, k = L(k ^ x, 16), w = w + k | 0, K = L(K ^ w, 12), x = x + K | 0, k = L(k ^ x, 8), w = w + k | 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), H = H + R | 0, O = L(O ^ H, 16), S = S + O | 0, R = L(R ^ S, 12), H = H + R | 0, O = L(O ^ H, 8), S = S + O | 0, R = L(R ^ S, 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, C = L(C ^ x, 16), S = S + C | 0, T = L(T ^ S, 12), x = x + T | 0, C = L(C ^ x, 8), S = S + C | 0, T = L(T ^ S, 7), A = A + R | 0, k = L(k ^ A, 16), P = P + k | 0, R = L(R ^ P, 12), A = A + R | 0, k = L(k ^ A, 8), P = P + k | 0, R = L(R ^ P, 7), H = H + U | 0, I = L(I ^ H, 16), w = w + I | 0, U = L(U ^ w, 12), H = H + U | 0, I = L(I ^ H, 8), w = w + I | 0, U = L(U ^ w, 7);
+function eo(e, t, n, r, i, s = 20) {
+  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)
+    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[$++] = s + m | 0, r[$++] = a + x | 0, r[$++] = c + A | 0, r[$++] = u + H | 0, r[$++] = f + U | 0, r[$++] = l + K | 0, r[$++] = g + T | 0, r[$++] = b + R | 0, r[$++] = p + P | 0, r[$++] = h + w | 0, r[$++] = d + v | 0, r[$++] = y + S | 0, r[$++] = E + C | 0, r[$++] = N + k | 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 Nr = /* @__PURE__ */ es(ts, {
+const Ar = /* @__PURE__ */ Qs(eo, {
   counterRight: !1,
   counterLength: 4,
   allowShortKeys: !1
 });
-class Kr extends lr {
+class Kr extends ur {
   constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, oe.hash(t);
-    const r = Fe(n);
+    super(), this.finished = !1, this.destroyed = !1, se.hash(t);
+    const r = Je(n);
     if (this.iHash = t.create(), typeof this.iHash.update != "function")
       throw new Error("Expected instance of class which extends utils.Hash");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const i = this.blockLen, o = new Uint8Array(i);
-    o.set(r.length > i ? t.create().update(r).digest() : r);
-    for (let s = 0; s < o.length; s++)
-      o[s] ^= 54;
-    this.iHash.update(o), this.oHash = t.create();
-    for (let s = 0; s < o.length; s++)
-      o[s] ^= 106;
-    this.oHash.update(o), o.fill(0);
+    const i = this.blockLen, s = new Uint8Array(i);
+    s.set(r.length > i ? t.create().update(r).digest() : r);
+    for (let o = 0; o < s.length; o++)
+      s[o] ^= 54;
+    this.iHash.update(s), this.oHash = t.create();
+    for (let o = 0; o < s.length; o++)
+      s[o] ^= 106;
+    this.oHash.update(s), s.fill(0);
   }
   update(t) {
-    return oe.exists(this), this.iHash.update(t), this;
+    return se.exists(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    oe.exists(this), oe.bytes(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    se.exists(this), se.bytes(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
   }
   digest() {
     const t = new Uint8Array(this.oHash.outputLen);
@@ -2305,8 +2305,8 @@ class Kr extends lr {
   }
   _cloneInto(t) {
     t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: n, iHash: r, finished: i, destroyed: o, blockLen: s, outputLen: a } = this;
-    return t = t, t.finished = i, t.destroyed = o, t.blockLen = s, t.outputLen = a, t.oHash = n._cloneInto(t.oHash), t.iHash = r._cloneInto(t.iHash), t;
+    const { oHash: n, iHash: r, finished: i, destroyed: s, blockLen: o, outputLen: 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,25 +2315,25 @@ class Kr extends lr {
 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 oe.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();
-function kr(e, t, n, r = 32) {
-  if (oe.hash(e), oe.number(r), r > 255 * e.outputLen)
+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 o = new Uint8Array(i * e.outputLen), s = ht.create(e, t), a = s._cloneInto(), c = new Uint8Array(s.outputLen);
-  for (let u = 0; u < i; u++)
-    Ut[0] = u + 1, a.update(u === 0 ? qn : c).update(n).update(Ut).digestInto(c), o.set(c, e.outputLen * u), s._cloneInto(a);
-  return s.destroy(), a.destroy(), c.fill(0), Ut.fill(0), o.slice(0, r);
+  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++)
+    _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 ns = Object.defineProperty, q = (e, t) => {
+var to = Object.defineProperty, D = (e, t) => {
   for (var n in t)
-    ns(e, n, { get: t[n], enumerable: !0 });
-}, Re = Symbol("verified"), rs = (e) => e instanceof Object;
-function on(e) {
-  if (!rs(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))
+    to(e, n, { get: t[n], enumerable: !0 });
+}, 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;
   for (let t = 0; t < e.tags.length; t++) {
     let n = e.tags[t];
@@ -2345,38 +2345,38 @@ function on(e) {
   }
   return !0;
 }
-var is = {};
-q(is, {
-  Queue: () => cs,
+var ro = {};
+D(ro, {
+  Queue: () => ao,
   QueueNode: () => Br,
-  binarySearch: () => sn,
-  insertEventIntoAscendingList: () => as,
-  insertEventIntoDescendingList: () => ss,
-  normalizeURL: () => os,
-  utf8Decoder: () => le,
+  binarySearch: () => on,
+  insertEventIntoAscendingList: () => oo,
+  insertEventIntoDescendingList: () => so,
+  normalizeURL: () => io,
+  utf8Decoder: () => ue,
   utf8Encoder: () => ne
 });
-var le = new TextDecoder("utf-8"), ne = new TextEncoder();
-function os(e) {
+var ue = new TextDecoder("utf-8"), ne = new TextEncoder();
+function io(e) {
   e.indexOf("://") === -1 && (e = "wss://" + e);
   let t = new URL(e);
   return t.pathname = t.pathname.replace(/\/+/g, "/"), t.pathname.endsWith("/") && (t.pathname = t.pathname.slice(0, -1)), (t.port === "80" && t.protocol === "ws:" || t.port === "443" && t.protocol === "wss:") && (t.port = ""), t.searchParams.sort(), t.hash = "", t.toString();
 }
-function ss(e, t) {
-  const [n, r] = sn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
+function so(e, t) {
+  const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
   return r || e.splice(n, 0, t), e;
 }
-function as(e, t) {
-  const [n, r] = sn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
+function oo(e, t) {
+  const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
   return r || e.splice(n, 0, t), e;
 }
-function sn(e, t) {
+function on(e, t) {
   let n = 0, r = e.length - 1;
   for (; n <= r; ) {
-    const i = Math.floor((n + r) / 2), o = t(e[i]);
-    if (o === 0)
+    const i = Math.floor((n + r) / 2), s = t(e[i]);
+    if (s === 0)
       return [i, !0];
-    o < 0 ? r = i - 1 : n = i + 1;
+    s < 0 ? r = i - 1 : n = i + 1;
   }
   return [n, !1];
 }
@@ -2387,7 +2387,7 @@ var Br = class {
     te(this, "prev", null);
     this.value = e;
   }
-}, cs = class {
+}, ao = class {
   constructor() {
     te(this, "first");
     te(this, "last");
@@ -2407,7 +2407,7 @@ var Br = class {
     const e = this.first;
     return this.first = e.next, e.value;
   }
-}, ls = class {
+}, co = class {
   generateSecretKey() {
     return We.utils.randomPrivateKey();
   }
@@ -2416,152 +2416,152 @@ 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;
     }
   }
 };
-function us(e) {
-  if (!on(e))
+function uo(e) {
+  if (!sn(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) {
-  let t = fe(ne.encode(us(e)));
+function Ge(e) {
+  let t = fe(ne.encode(uo(e)));
   return M(t);
 }
-var dt = new ls(), Ce = dt.generateSecretKey, ue = dt.getPublicKey, X = dt.finalizeEvent, pt = dt.verifyEvent, fs = {};
-q(fs, {
+var dt = new co(), _e = dt.generateSecretKey, le = dt.getPublicKey, X = dt.finalizeEvent, pt = dt.verifyEvent, lo = {};
+D(lo, {
   Application: () => da,
-  BadgeAward: () => ms,
-  BadgeDefinition: () => sa,
-  BlockedRelaysList: () => zs,
-  BookmarkList: () => qs,
+  BadgeAward: () => Eo,
+  BadgeDefinition: () => oa,
+  BlockedRelaysList: () => zo,
+  BookmarkList: () => qo,
   Bookmarksets: () => ra,
-  Calendar: () => ma,
-  CalendarEventRSVP: () => Ea,
+  Calendar: () => Ea,
+  CalendarEventRSVP: () => ma,
   ChannelCreation: () => $r,
   ChannelHideMessage: () => Or,
   ChannelMessage: () => Rr,
   ChannelMetadata: () => Tr,
   ChannelMuteUser: () => Mr,
   ClassifiedListing: () => ga,
-  ClientAuth: () => Pr,
-  CommunitiesList: () => Ds,
-  CommunityDefinition: () => Sa,
-  CommunityPostApproval: () => Us,
-  Contacts: () => ws,
-  CreateOrUpdateProduct: () => la,
+  ClientAuth: () => Hr,
+  CommunitiesList: () => Do,
+  CommunityDefinition: () => Na,
+  CommunityPostApproval: () => _o,
+  Contacts: () => wo,
+  CreateOrUpdateProduct: () => ua,
   CreateOrUpdateStall: () => ca,
   Curationsets: () => ia,
   Date: () => ba,
-  DirectMessageRelaysList: () => Gs,
+  DirectMessageRelaysList: () => Go,
   DraftClassifiedListing: () => wa,
   DraftLong: () => fa,
   Emojisets: () => ha,
-  EncryptedDirectMessage: () => bs,
-  EventDeletion: () => vs,
-  FileMetadata: () => Ss,
-  FileServerPreference: () => Fs,
+  EncryptedDirectMessage: () => bo,
+  EventDeletion: () => vo,
+  FileMetadata: () => No,
+  FileServerPreference: () => Fo,
   Followsets: () => ea,
-  GenericRepost: () => xs,
+  GenericRepost: () => xo,
   Genericlists: () => ta,
-  GiftWrap: () => Hr,
-  HTTPAuth: () => ln,
-  Handlerinformation: () => Aa,
+  GiftWrap: () => Pr,
+  HTTPAuth: () => un,
+  Handlerinformation: () => Sa,
   Handlerrecommendation: () => xa,
-  Highlights: () => Os,
-  InterestsList: () => Ws,
+  Highlights: () => Oo,
+  InterestsList: () => Wo,
   Interestsets: () => aa,
-  JobFeedback: () => Ls,
-  JobRequest: () => _s,
-  JobResult: () => Is,
-  Label: () => Cs,
-  LightningPubRPC: () => Ys,
-  LiveChatMessage: () => Ns,
+  JobFeedback: () => Lo,
+  JobRequest: () => Uo,
+  JobResult: () => Io,
+  Label: () => ko,
+  LightningPubRPC: () => Yo,
+  LiveChatMessage: () => Ao,
   LiveEvent: () => pa,
-  LongFormArticle: () => ua,
-  Metadata: () => ps,
-  Mutelist: () => Ms,
-  NWCWalletInfo: () => Js,
+  LongFormArticle: () => la,
+  Metadata: () => po,
+  Mutelist: () => Mo,
+  NWCWalletInfo: () => Jo,
   NWCWalletRequest: () => qr,
-  NWCWalletResponse: () => Xs,
-  NostrConnect: () => Qs,
-  OpenTimestamps: () => As,
-  Pinlist: () => Hs,
-  PrivateDirectMessage: () => Es,
-  ProblemTracker: () => Ks,
-  ProfileBadges: () => oa,
-  PublicChatsList: () => js,
+  NWCWalletResponse: () => Xo,
+  NostrConnect: () => Qo,
+  OpenTimestamps: () => So,
+  Pinlist: () => Po,
+  PrivateDirectMessage: () => mo,
+  ProblemTracker: () => Ko,
+  ProfileBadges: () => sa,
+  PublicChatsList: () => jo,
   Reaction: () => cn,
-  RecommendRelay: () => gs,
-  RelayList: () => Ps,
+  RecommendRelay: () => go,
+  RelayList: () => Ho,
   Relaysets: () => na,
-  Report: () => ks,
-  Reporting: () => Bs,
+  Report: () => Co,
+  Reporting: () => Bo,
   Repost: () => an,
   Seal: () => Lr,
-  SearchRelaysList: () => Vs,
-  ShortTextNote: () => ys,
+  SearchRelaysList: () => Vo,
+  ShortTextNote: () => yo,
   Time: () => va,
-  UserEmojiList: () => Zs,
+  UserEmojiList: () => Zo,
   UserStatuses: () => ya,
-  Zap: () => Rs,
-  ZapGoal: () => $s,
-  ZapRequest: () => Ts,
-  classifyKind: () => hs,
-  isEphemeralKind: () => _r,
-  isKind: () => ds,
+  Zap: () => Ro,
+  ZapGoal: () => $o,
+  ZapRequest: () => To,
+  classifyKind: () => fo,
+  isEphemeralKind: () => Ur,
+  isKind: () => ho,
   isParameterizedReplaceableKind: () => Ir,
-  isRegularKind: () => Cr,
-  isReplaceableKind: () => Ur
+  isRegularKind: () => kr,
+  isReplaceableKind: () => _r
 });
-function Cr(e) {
+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 hs(e) {
-  return Cr(e) ? "regular" : Ur(e) ? "replaceable" : _r(e) ? "ephemeral" : Ir(e) ? "parameterized" : "unknown";
+function fo(e) {
+  return kr(e) ? "regular" : _r(e) ? "replaceable" : Ur(e) ? "ephemeral" : Ir(e) ? "parameterized" : "unknown";
 }
-function ds(e, t) {
+function ho(e, t) {
   const n = t instanceof Array ? t : [t];
-  return on(e) && n.includes(e.kind) || !1;
+  return sn(e) && n.includes(e.kind) || !1;
 }
-var ps = 0, ys = 1, gs = 2, ws = 3, bs = 4, vs = 5, an = 6, cn = 7, ms = 8, Lr = 13, Es = 14, xs = 16, $r = 40, Tr = 41, Rr = 42, Or = 43, Mr = 44, As = 1040, Hr = 1059, Ss = 1063, Ns = 1311, Ks = 1971, ks = 1984, Bs = 1984, Cs = 1985, Us = 4550, _s = 5999, Is = 6999, Ls = 7e3, $s = 9041, Ts = 9734, Rs = 9735, Os = 9802, Ms = 1e4, Hs = 10001, Ps = 10002, qs = 10003, Ds = 10004, js = 10005, zs = 10006, Vs = 10007, Ws = 10015, Zs = 10030, Gs = 10050, Fs = 10096, Js = 13194, Ys = 21e3, Pr = 22242, qr = 23194, Xs = 23195, Qs = 24133, ln = 27235, ea = 3e4, ta = 30001, na = 30002, ra = 30003, ia = 30004, oa = 30008, sa = 30009, aa = 30015, ca = 30017, la = 30018, ua = 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, Sa = 34550, Na = {};
-q(Na, {
-  getHex64: () => un,
+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,
-  matchEventId: () => ka,
-  matchEventKind: () => Ca,
+  matchEventId: () => Ca,
+  matchEventKind: () => ka,
   matchEventPubkey: () => Ba
 });
-function un(e, t) {
+function ln(e, t) {
   let n = t.length + 3, r = e.indexOf(`"${t}":`) + n, i = e.slice(r).indexOf('"') + r + 1;
   return e.slice(i, i + 64);
 }
 function Dr(e, t) {
-  let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), o = Math.min(i.indexOf(","), i.indexOf("}"));
-  return parseInt(i.slice(0, o), 10);
+  let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), s = Math.min(i.indexOf(","), i.indexOf("}"));
+  return parseInt(i.slice(0, s), 10);
 }
 function Ka(e) {
   let t = e.slice(0, 22).indexOf('"EVENT"');
@@ -2573,25 +2573,25 @@ function Ka(e) {
   let r = t + 7 + 1 + n, i = e.slice(r + 1, 80).indexOf('"');
   if (i === -1)
     return null;
-  let o = r + 1 + i;
-  return e.slice(r + 1, o);
+  let s = r + 1 + i;
+  return e.slice(r + 1, s);
 }
-function ka(e, t) {
-  return t === un(e, "id");
+function Ca(e, t) {
+  return t === ln(e, "id");
 }
 function Ba(e, t) {
-  return t === un(e, "pubkey");
+  return t === ln(e, "pubkey");
 }
-function Ca(e, t) {
+function ka(e, t) {
   return t === Dr(e, "kind");
 }
-var Ua = {};
-q(Ua, {
-  makeAuthEvent: () => _a
+var _a = {};
+D(_a, {
+  makeAuthEvent: () => Ua
 });
-function _a(e, t) {
+function Ua(e, t) {
   return {
-    kind: Pr,
+    kind: Hr,
     created_at: Math.floor(Date.now() / 1e3),
     tags: [
       ["relay", e],
@@ -2611,7 +2611,7 @@ try {
 } catch {
 }
 var $a = {};
-q($a, {
+D($a, {
   BECH32_REGEX: () => jr,
   Bech32MaxSize: () => fn,
   NostrTypeGuard: () => Ta,
@@ -2619,8 +2619,8 @@ q($a, {
   encodeBytes: () => wt,
   naddrEncode: () => Da,
   neventEncode: () => qa,
-  noteEncode: () => Ha,
-  nprofileEncode: () => Pa,
+  noteEncode: () => Pa,
+  nprofileEncode: () => Ha,
   npubEncode: () => Ma,
   nsecEncode: () => Oa
 });
@@ -2638,62 +2638,62 @@ 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, o, s, a, c, u, 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 l = _t(r);
-      if (!((i = l[0]) != null && i[0]))
+      let u = Ut(r);
+      if (!((i = u[0]) != null && i[0]))
         throw new Error("missing TLV 0 for nprofile");
-      if (l[0][0].length !== 32)
+      if (u[0][0].length !== 32)
         throw new Error("TLV 0 should be 32 bytes");
       return {
         type: "nprofile",
         data: {
-          pubkey: M(l[0][0]),
-          relays: l[1] ? l[1].map((g) => le.decode(g)) : []
+          pubkey: M(u[0][0]),
+          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
         }
       };
     }
     case "nevent": {
-      let l = _t(r);
-      if (!((o = l[0]) != null && o[0]))
+      let u = Ut(r);
+      if (!((s = u[0]) != null && s[0]))
         throw new Error("missing TLV 0 for nevent");
-      if (l[0][0].length !== 32)
+      if (u[0][0].length !== 32)
         throw new Error("TLV 0 should be 32 bytes");
-      if (l[2] && l[2][0].length !== 32)
+      if (u[2] && u[2][0].length !== 32)
         throw new Error("TLV 2 should be 32 bytes");
-      if (l[3] && l[3][0].length !== 4)
+      if (u[3] && u[3][0].length !== 4)
         throw new Error("TLV 3 should be 4 bytes");
       return {
         type: "nevent",
         data: {
-          id: M(l[0][0]),
-          relays: l[1] ? l[1].map((g) => le.decode(g)) : [],
-          author: (s = l[2]) != null && s[0] ? M(l[2][0]) : void 0,
-          kind: (a = l[3]) != null && a[0] ? parseInt(M(l[3][0]), 16) : void 0
+          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: (c = u[3]) != null && c[0] ? parseInt(M(u[3][0]), 16) : void 0
         }
       };
     }
     case "naddr": {
-      let l = _t(r);
-      if (!((c = l[0]) != null && c[0]))
+      let u = Ut(r);
+      if (!((a = u[0]) != null && a[0]))
         throw new Error("missing TLV 0 for naddr");
-      if (!((u = l[2]) != null && u[0]))
+      if (!((l = u[2]) != null && l[0]))
         throw new Error("missing TLV 2 for naddr");
-      if (l[2][0].length !== 32)
+      if (u[2][0].length !== 32)
         throw new Error("TLV 2 should be 32 bytes");
-      if (!((f = l[3]) != null && f[0]))
+      if (!((f = u[3]) != null && f[0]))
         throw new Error("missing TLV 3 for naddr");
-      if (l[3][0].length !== 4)
+      if (u[3][0].length !== 4)
         throw new Error("TLV 3 should be 4 bytes");
       return {
         type: "naddr",
         data: {
-          identifier: le.decode(l[0][0]),
-          pubkey: M(l[2][0]),
-          kind: parseInt(M(l[3][0]), 16),
-          relays: l[1] ? l[1].map((g) => le.decode(g)) : []
+          identifier: ue.decode(u[0][0]),
+          pubkey: M(u[2][0]),
+          kind: parseInt(M(u[3][0]), 16),
+          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
         }
       };
     }
@@ -2706,13 +2706,13 @@ 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], o = n.slice(2, 2 + i);
-    if (n = n.slice(2 + i), o.length < i)
+    let r = n[0], i = n[1], s = n.slice(2, 2 + i);
+    if (n = n.slice(2 + i), s.length < i)
       throw new Error(`not enough data to read on TLV ${r}`);
-    t[r] = t[r] || [], t[r].push(o);
+    t[r] = t[r] || [], t[r].push(s);
   }
   return t;
 }
@@ -2722,7 +2722,7 @@ function Oa(e) {
 function Ma(e) {
   return wt("npub", G(e));
 }
-function Ha(e) {
+function Pa(e) {
   return wt("note", G(e));
 }
 function gt(e, t) {
@@ -2732,7 +2732,7 @@ function gt(e, t) {
 function wt(e, t) {
   return gt(e, t);
 }
-function Pa(e) {
+function Ha(e) {
   let t = hn({
     0: [G(e.pubkey)],
     1: (e.relays || []).map((n) => ne.encode(n))
@@ -2765,31 +2765,31 @@ function hn(e) {
   let t = [];
   return Object.entries(e).reverse().forEach(([n, r]) => {
     r.forEach((i) => {
-      let o = new Uint8Array(i.length + 2);
-      o.set([parseInt(n)], 0), o.set([i.length], 1), o.set(i, 2), t.push(o);
+      let s = new Uint8Array(i.length + 2);
+      s.set([parseInt(n)], 0), s.set([i.length], 1), s.set(i, 2), t.push(s);
     });
-  }), ut(...t);
+  }), lt(...t);
 }
 var ja = {};
-q(ja, {
+D(ja, {
   decrypt: () => za,
   encrypt: () => zr
 });
 async function zr(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e, i = _e.getSharedSecret(r, "02" + t), o = Vr(i);
-  let s = Uint8Array.from(fr(16)), a = ne.encode(n), c = Er(o, s).encrypt(a), u = he.encode(new Uint8Array(c)), f = he.encode(new Uint8Array(s.buffer));
-  return `${u}?iv=${f}`;
+  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, o] = n.split("?iv="), s = _e.getSharedSecret(r, "02" + t), a = Vr(s), c = he.decode(o), u = he.decode(i), f = Er(a, c).decrypt(u);
-  return le.decode(f);
+  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) {
   return e.slice(1, 33);
 }
 var Va = {};
-q(Va, {
+D(Va, {
   NIP05_REGEX: () => dn,
   isNip05: () => Wa,
   isValid: () => Fa,
@@ -2822,11 +2822,11 @@ async function Wr(e) {
     return null;
   const [, n = "_", r] = t;
   try {
-    const o = `https://${r}/.well-known/nostr.json?name=${n}`, s = await bt(o, { redirect: "manual" });
-    if (s.status !== 200)
+    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 s.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;
   }
@@ -2836,7 +2836,7 @@ async function Fa(e, t) {
   return n ? n.pubkey === e : !1;
 }
 var Ja = {};
-q(Ja, {
+D(Ja, {
   parse: () => Ya
 });
 function Ya(e) {
@@ -2849,39 +2849,39 @@ function Ya(e) {
   };
   let n, r;
   for (let i = e.tags.length - 1; i >= 0; i--) {
-    const o = e.tags[i];
-    if (o[0] === "e" && o[1]) {
-      const [s, a, c, u, f] = o, l = {
-        id: a,
-        relays: c ? [c] : [],
+    const s = e.tags[i];
+    if (s[0] === "e" && s[1]) {
+      const [o, c, a, l, f] = s, u = {
+        id: c,
+        relays: a ? [a] : [],
         author: f
       };
-      if (u === "root") {
-        t.root = l;
+      if (l === "root") {
+        t.root = u;
         continue;
       }
-      if (u === "reply") {
-        t.reply = l;
+      if (l === "reply") {
+        t.reply = u;
         continue;
       }
-      if (u === "mention") {
-        t.mentions.push(l);
+      if (l === "mention") {
+        t.mentions.push(u);
         continue;
       }
-      n ? r = l : n = l, t.mentions.push(l);
+      n ? r = u : n = u, t.mentions.push(u);
       continue;
     }
-    if (o[0] === "q" && o[1]) {
-      const [s, a, c] = o;
+    if (s[0] === "q" && s[1]) {
+      const [o, c, a] = s;
       t.quotes.push({
-        id: a,
-        relays: c ? [c] : []
+        id: c,
+        relays: a ? [a] : []
       });
     }
-    if (o[0] === "p" && o[1]) {
+    if (s[0] === "p" && s[1]) {
       t.profiles.push({
-        pubkey: o[1],
-        relays: o[2] ? [o[2]] : []
+        pubkey: s[1],
+        relays: s[2] ? [s[2]] : []
       });
       continue;
     }
@@ -2889,25 +2889,25 @@ function Ya(e) {
   return t.root || (t.root = r || n || t.reply), t.reply || (t.reply = n || t.root), [t.reply, t.root].forEach((i) => {
     if (!i)
       return;
-    let o = t.mentions.indexOf(i);
-    if (o !== -1 && t.mentions.splice(o, 1), i.author) {
-      let s = t.profiles.find((a) => a.pubkey === i.author);
-      s && s.relays && (i.relays || (i.relays = []), s.relays.forEach((a) => {
-        var c;
-        ((c = i.relays) == null ? void 0 : c.indexOf(a)) === -1 && i.relays.push(a);
-      }), s.relays = i.relays);
+    let s = t.mentions.indexOf(i);
+    if (s !== -1 && t.mentions.splice(s, 1), i.author) {
+      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) => {
     if (i.author) {
-      let o = t.profiles.find((s) => s.pubkey === i.author);
-      o && o.relays && (i.relays || (i.relays = []), o.relays.forEach((s) => {
-        i.relays.indexOf(s) === -1 && i.relays.push(s);
-      }), o.relays = i.relays);
+      let s = t.profiles.find((o) => o.pubkey === i.author);
+      s && s.relays && (i.relays || (i.relays = []), s.relays.forEach((o) => {
+        i.relays.indexOf(o) === -1 && i.relays.push(o);
+      }), s.relays = i.relays);
     }
   }), t;
 }
 var Xa = {};
-q(Xa, {
+D(Xa, {
   fetchRelayInformation: () => ec,
   useFetchImplementation: () => Qa
 });
@@ -2925,7 +2925,7 @@ async function ec(e) {
   })).json();
 }
 var tc = {};
-q(tc, {
+D(tc, {
   fastEventHash: () => Fr,
   getPow: () => Gr,
   minePow: () => nc
@@ -2947,8 +2947,8 @@ function nc(e, t) {
   let n = 0;
   const r = e, i = ["nonce", n.toString(), t.toString()];
   for (r.tags.push(i); ; ) {
-    const o = Math.floor((/* @__PURE__ */ new Date()).getTime() / 1e3);
-    if (o !== r.created_at && (n = 0, r.created_at = o), i[1] = (++n).toString(), r.id = Fr(r), Gr(r.id) >= t)
+    const s = Math.floor((/* @__PURE__ */ new Date()).getTime() / 1e3);
+    if (s !== r.created_at && (n = 0, r.created_at = s), i[1] = (++n).toString(), r.id = Fr(r), Gr(r.id) >= t)
       break;
   }
   return r;
@@ -2959,9 +2959,9 @@ function Fr(e) {
   );
 }
 var rc = {};
-q(rc, {
+D(rc, {
   finishRepostEvent: () => ic,
-  getRepostedEvent: () => oc,
+  getRepostedEvent: () => sc,
   getRepostedEventPointer: () => Jr
 });
 function ic(e, t, n, r) {
@@ -2990,7 +2990,7 @@ function Jr(e) {
       author: n == null ? void 0 : n[1]
     };
 }
-function oc(e, { skipVerification: t } = {}) {
+function sc(e, { skipVerification: t } = {}) {
   const n = Jr(e);
   if (n === void 0 || e.content === "")
     return;
@@ -3003,8 +3003,8 @@ function oc(e, { skipVerification: t } = {}) {
   if (r.id === n.id && !(!t && !pt(r)))
     return r;
 }
-var sc = {};
-q(sc, {
+var oc = {};
+D(oc, {
   NOSTR_URI_REGEX: () => vt,
   parse: () => cc,
   test: () => ac
@@ -3023,12 +3023,12 @@ function cc(e) {
     decoded: yt(t[1])
   };
 }
-var lc = {};
-q(lc, {
-  finishReactionEvent: () => uc,
+var uc = {};
+D(uc, {
+  finishReactionEvent: () => lc,
   getReactedEventPointer: () => fc
 });
-function uc(e, t, n) {
+function lc(e, t, n) {
   const r = t.tags.filter((i) => i.length >= 2 && (i[0] === "e" || i[0] === "p"));
   return X(
     {
@@ -3056,7 +3056,7 @@ function fc(e) {
     };
 }
 var hc = {};
-q(hc, {
+D(hc, {
   matchAll: () => dc,
   regex: () => pn,
   replaceAll: () => pc
@@ -3085,12 +3085,12 @@ function pc(e, t) {
   }));
 }
 var yc = {};
-q(yc, {
+D(yc, {
   channelCreateEvent: () => gc,
   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 = {};
-q(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,15 +3193,15 @@ function* xc(e) {
     } catch {
     }
 }
-function Ac(e, t) {
+function Sc(e, t) {
   return e.replaceAll(yn(), (n, r) => t({
     shortcode: n,
     name: r
   }));
 }
-var Sc = {};
-q(Sc, {
-  useFetchImplementation: () => Nc,
+var Nc = {};
+D(Nc, {
+  useFetchImplementation: () => Ac,
   validateGithub: () => Kc
 });
 var gn;
@@ -3209,7 +3209,7 @@ try {
   gn = fetch;
 } catch {
 }
-function Nc(e) {
+function Ac(e) {
   gn = e;
 }
 async function Kc(e, t, n) {
@@ -3219,20 +3219,20 @@ async function Kc(e, t, n) {
     return !1;
   }
 }
-var j = {};
-q(j, {
-  decrypt: () => mn,
+var q = {};
+D(q, {
+  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) {
-  const n = kr(fe, e, t, 76);
+  const n = Cr(fe, e, t, 76);
   return {
     chacha_key: n.subarray(0, 32),
     chacha_nonce: n.subarray(32, 44),
@@ -3247,29 +3247,29 @@ function bn(e) {
   const t = 1 << Math.floor(Math.log2(e - 1)) + 1, n = t <= 256 ? 32 : t / 8;
   return n * (Math.floor((e - 1) / n) + 1);
 }
-function kc(e) {
+function Cc(e) {
   if (!Number.isSafeInteger(e) || e < Xr || e > Qr)
     throw new Error("invalid plaintext size: must be between 1 and 65535 bytes");
   const t = new Uint8Array(2);
   return new DataView(t.buffer).setUint16(0, e, !1), t;
 }
 function Bc(e) {
-  const t = ne.encode(e), n = t.length, r = kc(n), i = new Uint8Array(bn(n) - n);
-  return ut(r, t, i);
+  const t = ne.encode(e), n = t.length, r = Cc(n), i = new Uint8Array(bn(n) - n);
+  return lt(r, t, i);
 }
-function Cc(e) {
+function kc(e) {
   const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
   if (t < Xr || t > Qr || n.length !== t || e.length !== 2 + bn(t))
     throw new Error("invalid padding");
-  return le.decode(n);
+  return ue.decode(n);
 }
 function ti(e, t, n) {
   if (n.length !== 32)
     throw new Error("AAD associated data must be 32 bytes");
-  const r = ut(n, t);
+  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;
@@ -3280,8 +3280,8 @@ function Uc(e) {
   let n;
   try {
     n = he.decode(e);
-  } catch (o) {
-    throw new Error("invalid base64: " + o.message);
+  } catch (s) {
+    throw new Error("invalid base64: " + s.message);
   }
   const r = n.length;
   if (r < 99 || r > 65603)
@@ -3296,33 +3296,33 @@ function Uc(e) {
   };
 }
 function vn(e, t, n = fr(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: o } = ei(t, n), s = Bc(e), a = Nr(r, i, s), c = ti(o, a, n);
-  return he.encode(ut(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: o, chacha_nonce: s, hmac_key: a } = ei(t, n), c = ti(a, r, n);
-  if (!Oo(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 u = Nr(o, s, r);
-  return Cc(u);
+  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 = {};
-q(Ic, {
+D(Ic, {
   makeNwcRequestEvent: () => $c,
   parseConnectionString: () => Lc
 });
 function Lc(e) {
-  const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), o = n.get("secret");
-  if (!r || !i || !o)
+  const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), s = n.get("secret");
+  if (!r || !i || !s)
     throw new Error("invalid connection string");
-  return { pubkey: r, relay: i, secret: o };
+  return { pubkey: r, relay: i, secret: s };
 }
 async function $c(e, t, n) {
   const i = await zr(t, e, JSON.stringify({
@@ -3330,44 +3330,44 @@ async function $c(e, t, n) {
     params: {
       invoice: n
     }
-  })), o = {
+  })), s = {
     kind: qr,
     created_at: Math.round(Date.now() / 1e3),
     content: i,
     tags: [["p", e]]
   };
-  return X(o, t);
+  return X(s, t);
 }
 var Tc = {};
-q(Tc, {
+D(Tc, {
   getZapEndpoint: () => Oc,
-  makeZapReceipt: () => Pc,
+  makeZapReceipt: () => Hc,
   makeZapRequest: () => Mc,
   useFetchImplementation: () => Rc,
-  validateZapRequest: () => Hc
+  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: s } = je.decode(n, 1e3), a = je.fromWords(s);
-      t = le.decode(a);
+      let { words: o } = je.decode(n, 1e3), c = je.fromWords(o);
+      t = ue.decode(c);
     } else if (r) {
-      let [s, a] = r.split("@");
-      t = new URL(`/.well-known/lnurlp/${s}`, `https://${a}`).toString();
+      let [o, c] = r.split("@");
+      t = new URL(`/.well-known/lnurlp/${o}`, `https://${c}`).toString();
     } else
       return null;
-    let o = await (await En(t)).json();
-    if (o.allowsNostr && o.nostrPubkey)
-      return o.callback;
+    let s = await (await mn(t)).json();
+    if (s.allowsNostr && s.nostrPubkey)
+      return s.callback;
   } catch {
   }
   return null;
@@ -3383,7 +3383,7 @@ function Mc({
     throw new Error("amount not given");
   if (!e)
     throw new Error("profile not given");
-  let o = {
+  let s = {
     kind: 9734,
     created_at: Math.round(Date.now() / 1e3),
     content: i,
@@ -3393,67 +3393,67 @@ function Mc({
       ["relays", ...r]
     ]
   };
-  return t && o.tags.push(["e", t]), o;
+  return t && s.tags.push(["e", t]), s;
 }
-function Hc(e) {
+function Pc(e) {
   let t;
   try {
     t = JSON.parse(e);
   } catch {
     return "Invalid zap request JSON.";
   }
-  if (!on(t))
+  if (!sn(t))
     return "Zap request is not a valid Nostr event.";
   if (!pt(t))
     return "Invalid signature on zap request.";
-  let n = t.tags.find(([o, s]) => o === "p" && s);
+  let n = t.tags.find(([s, o]) => s === "p" && o);
   if (!n)
     return "Zap request doesn't have a 'p' tag.";
   if (!n[1].match(/^[a-f0-9]{64}$/))
     return "Zap request 'p' tag is not valid hex.";
-  let r = t.tags.find(([o, s]) => o === "e" && s);
-  return r && !r[1].match(/^[a-f0-9]{64}$/) ? "Zap request 'e' tag is not valid hex." : t.tags.find(([o, s]) => o === "relays" && s) ? null : "Zap request doesn't have a 'relays' tag.";
+  let r = t.tags.find(([s, o]) => s === "e" && o);
+  return r && !r[1].match(/^[a-f0-9]{64}$/) ? "Zap request 'e' tag is not valid hex." : t.tags.find(([s, o]) => s === "relays" && o) ? null : "Zap request doesn't have a 'relays' tag.";
 }
-function Pc({
+function Hc({
   zapRequest: e,
   preimage: t,
   bolt11: n,
   paidAt: r
 }) {
-  let i = JSON.parse(e), o = i.tags.filter(([a]) => a === "e" || a === "p" || a === "a"), s = {
+  let i = JSON.parse(e), s = i.tags.filter(([c]) => c === "e" || c === "p" || c === "a"), o = {
     kind: 9735,
     created_at: Math.round(r.getTime() / 1e3),
     content: "",
-    tags: [...o, ["P", i.pubkey], ["bolt11", n], ["description", e]]
+    tags: [...s, ["P", i.pubkey], ["bolt11", n], ["description", e]]
   };
-  return t && s.tags.push(["preimage", t]), s;
+  return t && o.tags.push(["preimage", t]), o;
 }
 var qc = {};
-q(qc, {
-  createRumor: () => si,
+D(qc, {
+  createRumor: () => oi,
   createSeal: () => ai,
   createWrap: () => ci,
-  unwrapEvent: () => li,
+  unwrapEvent: () => ui,
   unwrapManyEvents: () => zc,
   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), oi = (e, t, n) => vn(JSON.stringify(e), ii(t, n)), Dn = (e, t) => JSON.parse(mn(e.content, ii(t, e.pubkey)));
-function si(e, t) {
+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(),
     content: "",
     tags: [],
     ...e,
-    pubkey: ue(t)
+    pubkey: le(t)
   };
-  return n.id = Qe(n), n;
+  return n.id = Ge(n), n;
 }
 function ai(e, t, n) {
   return X(
     {
       kind: Lr,
-      content: oi(e, t, n),
+      content: si(e, t, n),
       created_at: ri(),
       tags: []
     },
@@ -3461,11 +3461,11 @@ function ai(e, t, n) {
   );
 }
 function ci(e, t) {
-  const n = Ce();
+  const n = _e();
   return X(
     {
-      kind: Hr,
-      content: oi(e, n, t),
+      kind: Pr,
+      content: si(e, n, t),
       created_at: ri(),
       tags: [["p", t]]
     },
@@ -3473,29 +3473,29 @@ function ci(e, t) {
   );
 }
 function Vt(e, t, n) {
-  const r = si(e, t), i = ai(r, t, n);
+  const r = oi(e, t), i = ai(r, t, n);
   return ci(i, n);
 }
 function jc(e, t, n) {
   if (!n || n.length === 0)
     throw new Error("At least one recipient is required.");
-  const r = ue(t), i = [Vt(e, t, r)];
-  return n.forEach((o) => {
-    i.push(Vt(e, t, o));
+  const r = le(t), i = [Vt(e, t, r)];
+  return n.forEach((s) => {
+    i.push(Vt(e, t, s));
   }), i;
 }
-function li(e, t) {
+function ui(e, t) {
   const n = Dn(e, t);
   return Dn(n, t);
 }
 function zc(e, t) {
   let n = [];
   return e.forEach((r) => {
-    n.push(li(r, t));
+    n.push(ui(r, t));
   }), n.sort((r, i) => r.created_at - i.created_at), n;
 }
 var Vc = {};
-q(Vc, {
+D(Vc, {
   getToken: () => Wc,
   hashPayload: () => xn,
   unpackEventFromToken: () => fi,
@@ -3507,10 +3507,10 @@ q(Vc, {
   validateEventUrlTag: () => pi,
   validateToken: () => Zc
 });
-var ui = "Nostr ";
+var li = "Nostr ";
 async function Wc(e, t, n, r = !1, i) {
-  const o = {
-    kind: ln,
+  const s = {
+    kind: un,
     tags: [
       ["u", e],
       ["method", t]
@@ -3518,23 +3518,23 @@ async function Wc(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && o.tags.push(["payload", xn(i)]);
-  const s = await n(o);
-  return (r ? ui : "") + he.encode(ne.encode(JSON.stringify(s)));
+  i && s.tags.push(["payload", xn(i)]);
+  const o = await n(s);
+  return (r ? li : "") + he.encode(ne.encode(JSON.stringify(o)));
 }
 async function Zc(e, t, n) {
-  const r = await fi(e).catch((o) => {
-    throw o;
+  const r = await fi(e).catch((s) => {
+    throw s;
   });
-  return await wi(r, t, n).catch((o) => {
-    throw o;
+  return await wi(r, t, n).catch((s) => {
+    throw s;
   });
 }
 async function fi(e) {
   if (!e)
     throw new Error("Missing token");
-  e = e.replace(ui, "");
-  const t = le.decode(he.decode(e));
+  e = e.replace(li, "");
+  const t = ue.decode(he.decode(e));
   if (!t || t.length === 0 || !t.startsWith("{"))
     throw new Error("Invalid token");
   return JSON.parse(t);
@@ -3543,7 +3543,7 @@ function hi(e) {
   return e.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - e.created_at < 60 : !1;
 }
 function di(e) {
-  return e.kind === ln;
+  return e.kind === un;
 }
 function pi(e, t) {
   const n = e.tags.find((r) => r[0] === "u");
@@ -3579,12 +3579,12 @@ async function wi(e, t, n, r) {
     throw new Error("Invalid nostr event, payload tag does not match request body hash");
   return !0;
 }
-const Pe = 4, jn = 30078, nl = 100;
-var Gc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Gc || {});
-function rl(e) {
+const Be = 30078, jn = 30078, Gc = 14, ru = 100;
+function iu(e) {
   return JSON.stringify({
     rootKey: M(e.rootKey),
-    theirNostrPublicKey: e.theirNostrPublicKey,
+    theirCurrentNostrPublicKey: e.theirCurrentNostrPublicKey,
+    theirNextNostrPublicKey: e.theirNextNostrPublicKey,
     ourCurrentNostrKey: e.ourCurrentNostrKey ? {
       publicKey: e.ourCurrentNostrKey.publicKey,
       privateKey: M(e.ourCurrentNostrKey.privateKey)
@@ -3612,11 +3612,12 @@ function rl(e) {
     )
   });
 }
-function il(e) {
+function su(e) {
   const t = JSON.parse(e);
   return {
     rootKey: G(t.rootKey),
-    theirNostrPublicKey: t.theirNostrPublicKey,
+    theirCurrentNostrPublicKey: t.theirCurrentNostrPublicKey,
+    theirNextNostrPublicKey: t.theirNextNostrPublicKey,
     ourCurrentNostrKey: t.ourCurrentNostrKey ? {
       publicKey: t.ourCurrentNostrKey.publicKey,
       privateKey: G(t.ourCurrentNostrKey.privateKey)
@@ -3644,10 +3645,10 @@ function il(e) {
     )
   };
 }
-async function* ol(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 {
@@ -3659,17 +3660,17 @@ async function* ol(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 o = 1; o <= n; o++)
-    i.push(kr(fe, r, new Uint8Array([o]), 32));
+  for (let s = 1; s <= n; s++)
+    i.push(Cr(fe, r, new Uint8Array([s]), 32));
   return i;
 }
 function It(e, t) {
   return `${e}:${t}`;
 }
-const Fc = 1e3;
-class ot {
+const Fc = 1e3, Jc = "0000000000000000000000000000000000000000000000000000000000000000";
+class st {
   // 1. CHANNEL PUBLIC INTERFACE
   constructor(t, n) {
     te(this, "nostrUnsubscribe");
@@ -3682,45 +3683,68 @@ class ot {
   /**
    * Initializes a new secure communication session
    * @param nostrSubscribe Function to subscribe to Nostr events
-   * @param theirNostrPublicKey The public key of the other party
+   * @param theirNextNostrPublicKey The public key of the other party
    * @param ourCurrentPrivateKey Our current private key for Nostr
    * @param isInitiator Whether we are initiating the conversation (true) or responding (false)
    * @param sharedSecret Initial shared secret for securing the first message chain
    * @param name Optional name for the session (for debugging)
    * @returns A new Session instance
    */
-  static init(t, n, r, i, o, s) {
-    const a = Ce(), [c, u] = Oe(o, j.getConversationKey(a, n), 2);
-    let f, l;
-    i ? (f = { publicKey: ue(r), privateKey: r }, l = { publicKey: ue(a), privateKey: a }) : l = { publicKey: ue(r), privateKey: r };
+  static init(t, n, r, i, s, o) {
+    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(c), privateKey: c }) : u = { publicKey: le(r), privateKey: r };
     const g = {
-      rootKey: i ? c : o,
-      theirNostrPublicKey: n,
+      rootKey: i ? a : s,
+      theirNextNostrPublicKey: n,
       ourCurrentNostrKey: f,
-      ourNextNostrKey: l,
+      ourNextNostrKey: u,
       receivingChainKey: void 0,
-      sendingChainKey: i ? u : void 0,
+      sendingChainKey: i ? l : void 0,
       sendingChainMessageNumber: 0,
       receivingChainMessageNumber: 0,
       previousSendingChainMessageCount: 0,
       skippedMessageKeys: {},
       skippedHeaderKeys: {}
-    }, b = new ot(t, g);
-    return s && (b.name = s), b;
+    }, b = new st(t, g);
+    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) {
-    if (!this.state.theirNostrPublicKey || !this.state.ourCurrentNostrKey)
+    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 = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNostrPublicKey), o = j.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: Pe,
+      content: i,
+      kind: Be,
       tags: [["header", o]],
       created_at: Math.floor(Date.now() / 1e3)
     }, this.state.ourCurrentNostrKey.privateKey);
@@ -3730,7 +3754,7 @@ class ot {
    * @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);
   }
@@ -3743,69 +3767,68 @@ class ot {
   }
   // 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
-    }, j.encrypt(t, r)];
+    }, q.encrypt(t, r)];
   }
   ratchetDecrypt(t, n, r) {
     const i = this.trySkippedMessageKeys(t, n, r);
     if (i) return i;
     this.skipMessageKeys(t.number, r);
-    const [o, s] = Oe(this.state.receivingChainKey, new Uint8Array([1]), 2);
-    this.state.receivingChainKey = o, this.state.receivingChainMessageNumber++;
+    const [s, o] = Me(this.state.receivingChainKey, new Uint8Array([1]), 2);
+    this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++;
     try {
-      return j.decrypt(n, s);
-    } catch (a) {
-      throw console.error(this.name, "Decryption failed:", a, {
-        messageKey: M(s).slice(0, 4),
+      return q.decrypt(n, o);
+    } 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.theirNostrPublicKey = t;
-    const n = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [r, i] = Oe(this.state.rootKey, n, 2);
+    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] = Me(this.state.rootKey, n, 2);
     this.state.receivingChainKey = i, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
-    const o = Ce();
+    const s = _e();
     this.state.ourNextNostrKey = {
-      publicKey: ue(o),
-      privateKey: o
+      publicKey: le(s),
+      privateKey: s
     };
-    const s = j.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [a, c] = Oe(r, s, 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 o = It(n, this.state.receivingChainMessageNumber);
-      if (this.state.skippedMessageKeys[o] = i, !this.state.skippedHeaderKeys[n]) {
-        const s = [];
+      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 = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
-          s.push(c);
+          const a = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, n);
+          o.push(a);
         }
-        const a = j.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
-        s.push(a), this.state.skippedHeaderKeys[n] = s;
+        const c = q.getConversationKey(this.state.ourNextNostrKey.privateKey, n);
+        o.push(c), this.state.skippedHeaderKeys[n] = o;
       }
       this.state.receivingChainMessageNumber++;
     }
   }
   trySkippedMessageKeys(t, n, r) {
-    var o;
+    var s;
     const i = It(r, t.number);
     if (i in this.state.skippedMessageKeys) {
-      const s = this.state.skippedMessageKeys[i];
-      return delete this.state.skippedMessageKeys[i], Object.keys(this.state.skippedMessageKeys).some((c) => c.startsWith(`${r}:`)) || (delete this.state.skippedHeaderKeys[r], (o = this.nostrUnsubscribe) == null || o.call(this), this.nostrUnsubscribe = void 0), j.decrypt(n, s);
+      const o = this.state.skippedMessageKeys[i];
+      return delete this.state.skippedMessageKeys[i], Object.keys(this.state.skippedMessageKeys).some((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;
   }
@@ -3813,69 +3836,69 @@ class ot {
   decryptHeader(t) {
     const n = t.tags[0][1];
     if (this.state.ourCurrentNostrKey) {
-      const o = j.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
+      const s = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
       try {
-        return [JSON.parse(j.decrypt(n, o)), !1, !1];
+        return [JSON.parse(q.decrypt(n, s)), !1, !1];
       } catch {
       }
     }
-    const r = j.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
+    const r = q.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
     try {
-      return [JSON.parse(j.decrypt(n, r)), !0, !1];
+      return [JSON.parse(q.decrypt(n, r)), !0, !1];
     } catch {
     }
     const i = this.state.skippedHeaderKeys[t.pubkey];
     if (i)
-      for (const o of i)
+      for (const s of i)
         try {
-          return [JSON.parse(j.decrypt(n, o)), !1, !0];
+          return [JSON.parse(q.decrypt(n, s)), !1, !0];
         } catch {
         }
     throw new Error("Failed to decrypt header with current and skipped header keys");
   }
   handleNostrEvent(t) {
-    var s;
+    var c;
     const [n, r, i] = this.decryptHeader(t);
     if (!i)
-      this.state.theirNostrPublicKey !== n.nextPublicKey && (this.state.theirNostrPublicKey = n.nextPublicKey, (s = this.nostrUnsubscribe) == null || s.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
-        { authors: [this.state.theirNostrPublicKey], kinds: [Pe] },
+      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 o = this.ratchetDecrypt(n, t.content, t.pubkey);
-    this.internalSubscriptions.forEach((a) => a({ id: t.id, data: o, pubkey: n.nextPublicKey, time: n.time }));
+    const s = this.ratchetDecrypt(n, t.content, t.pubkey), o = JSON.parse(s);
+    this.internalSubscriptions.forEach((a) => a(o, t));
   }
   subscribeToNostrEvents() {
     if (this.nostrNextUnsubscribe) return;
     this.nostrNextUnsubscribe = this.nostrSubscribe(
-      { authors: [this.state.theirNostrPublicKey], kinds: [Pe] },
+      { authors: [this.state.theirNextNostrPublicKey], kinds: [Be] },
       (n) => this.handleNostrEvent(n)
     );
     const t = Object.keys(this.state.skippedHeaderKeys);
-    t.length > 0 && (this.nostrUnsubscribe = this.nostrSubscribe(
-      { authors: t, kinds: [Pe] },
+    this.state.theirCurrentNostrPublicKey && !t.includes(this.state.theirCurrentNostrPublicKey) && t.push(this.state.theirCurrentNostrPublicKey), this.nostrUnsubscribe = this.nostrSubscribe(
+      { 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, o, s, a = []) {
-    this.inviterEphemeralPublicKey = t, this.linkSecret = n, this.inviter = r, this.inviterEphemeralPrivateKey = i, this.label = o, this.maxUses = s, 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 = Ce(), o = ue(i), s = M(Ce());
-    return new Me(
-      o,
+    const i = _e(), s = le(i), o = M(_e());
+    return new Pe(
       s,
+      o,
       t,
       i,
       n,
@@ -3887,26 +3910,26 @@ class Me {
     if (!r)
       throw new Error("No invite data found in the URL hash.");
     const i = decodeURIComponent(r);
-    let o;
+    let s;
     try {
-      o = JSON.parse(i);
-    } catch (u) {
-      throw new Error("Invite data in URL hash is not valid JSON: " + u);
-    }
-    const { inviter: s, ephemeralKey: a, linkSecret: c } = o;
-    if (!s || !a || !c)
-      throw new Error("Missing required fields (inviter, ephemeralKey, linkSecret) in invite data.");
-    return new Me(
-      a,
+      s = JSON.parse(i);
+    } catch (l) {
+      throw new Error("Invite data in URL hash is not valid JSON: " + l);
+    }
+    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 Pe(
       c,
-      s
+      a,
+      o
     );
   }
   static deserialize(t) {
     const n = JSON.parse(t);
-    return new Me(
+    return new Pe(
       n.inviterEphemeralPublicKey,
-      n.linkSecret,
+      n.sharedSecret,
       n.inviter,
       n.inviterEphemeralPrivateKey ? new Uint8Array(n.inviterEphemeralPrivateKey) : void 0,
       n.label,
@@ -3915,18 +3938,18 @@ class Me {
     );
   }
   static fromEvent(t) {
-    var s, 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 = (s = n.find(([c]) => c === "ephemeralKey")) == null ? void 0 : s[1], i = (a = n.find(([c]) => c === "linkSecret")) == null ? void 0 : a[1], o = t.pubkey;
+    const { tags: n } = t, r = (o = n.find(([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 link secret");
-    return new Me(
+      throw new Error("Invalid invite event: missing session key or sharedSecret");
+    return new Pe(
       r,
       i,
-      o
+      s
     );
   }
   static fromUser(t, n, r) {
@@ -3936,15 +3959,15 @@ class Me {
       limit: 1,
       "#d": ["nostr-double-ratchet/invite"]
     };
-    let o = 0;
-    return n(i, (a) => {
-      if (!(!a.created_at || a.created_at <= o)) {
-        o = a.created_at;
+    let s = 0;
+    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);
         }
       }
     });
@@ -3955,7 +3978,7 @@ class Me {
   serialize() {
     return JSON.stringify({
       inviterEphemeralPublicKey: this.inviterEphemeralPublicKey,
-      linkSecret: this.linkSecret,
+      sharedSecret: this.sharedSecret,
       inviter: this.inviter,
       inviterEphemeralPrivateKey: this.inviterEphemeralPrivateKey ? Array.from(this.inviterEphemeralPrivateKey) : void 0,
       label: this.label,
@@ -3970,9 +3993,9 @@ class Me {
     const n = {
       inviter: this.inviter,
       ephemeralKey: this.inviterEphemeralPublicKey,
-      linkSecret: this.linkSecret
+      sharedSecret: this.sharedSecret
     }, r = new URL(t);
-    return r.hash = encodeURIComponent(JSON.stringify(n)), console.log("url", r.toString()), r.toString();
+    return r.hash = encodeURIComponent(JSON.stringify(n)), r.toString();
   }
   getEvent() {
     return {
@@ -3980,7 +4003,7 @@ class Me {
       pubkey: this.inviter,
       content: "",
       created_at: Math.floor(Date.now() / 1e3),
-      tags: [["ephemeralKey", this.inviterEphemeralPublicKey], ["linkSecret", this.linkSecret], ["d", "nostr-double-ratchet/invite"]]
+      tags: [["ephemeralKey", this.inviterEphemeralPublicKey], ["sharedSecret", this.sharedSecret], ["d", "nostr-double-ratchet/invite"]]
     };
   }
   /**
@@ -3999,58 +4022,58 @@ class Me {
        * so the inviter can create the session on their side.
        */
   async accept(t, n, r) {
-    const i = Ce(), o = ue(i), s = this.inviter || this.inviterEphemeralPublicKey, a = G(this.linkSecret), c = ot.init(t, this.inviterEphemeralPublicKey, i, !0, a, void 0), u = Ce(), f = ue(u), l = typeof r == "function" ? r : (p, h) => Promise.resolve(j.encrypt(p, Xe(r, h))), g = {
+    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: [["secret", this.linkSecret]],
-      content: await l(o, s),
+      tags: [["sharedSecret", this.sharedSecret]],
+      content: await q.encrypt(g, c),
       created_at: Math.floor(Date.now() / 1e3)
-    }, b = {
-      kind: Pe,
+    }, p = {
+      kind: Be,
       pubkey: f,
-      content: j.encrypt(JSON.stringify(g), Xe(u, 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(b, u) };
+    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: [Pe],
+      kinds: [Be],
       "#p": [this.inviterEphemeralPublicKey]
     };
-    return n(i, async (o) => {
+    return n(i, async (s) => {
       try {
         if (this.maxUses && this.usedBy.length >= this.maxUses) {
           console.error("Invite has reached maximum number of uses");
           return;
         }
-        const s = await j.decrypt(o.content, Xe(this.inviterEphemeralPrivateKey, o.pubkey)), a = JSON.parse(s);
-        if (!a.tags || !a.tags.some(([p, h]) => p === "secret" && h === this.linkSecret)) {
-          console.error("Invalid secret from event", o);
+        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 = typeof t == "function" ? t : (p, h) => Promise.resolve(j.decrypt(p, Xe(t, h))), u = a.pubkey;
-        this.usedBy.push(u);
-        const f = await c(a.content, u), l = G(this.linkSecret), g = o.id, b = ot.init(n, f, this.inviterEphemeralPrivateKey, !1, l, g);
-        r(b, u);
-      } catch (s) {
-        console.error("Error processing invite message:", s, "event", o);
+        const a = G(this.sharedSecret), l = c.pubkey;
+        this.usedBy.push(l);
+        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);
       }
     });
   }
 }
 export {
+  Gc as CHAT_MESSAGE_KIND,
   jn as INVITE_EVENT_KIND,
-  Me as Invite,
-  nl as MAX_SKIP,
-  Pe as MESSAGE_EVENT_KIND,
-  Gc as Sender,
-  ot as Session,
-  ol as createMessageStream,
-  il as deserializeSessionState,
-  Oe as kdf,
-  rl as serializeSessionState,
+  Pe as Invite,
+  ru as MAX_SKIP,
+  Be as MESSAGE_EVENT_KIND,
+  st as Session,
+  ou as createEventStream,
+  su as deserializeSessionState,
+  Me as kdf,
+  iu as serializeSessionState,
   It as skippedMessageIndexKey
 };