nostr-double-ratchet 0.0.1 → 0.0.3

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

@@ -1,6 +1,6 @@
 var oi = Object.defineProperty;
 var si = (e, t, n) => t in e ? oi(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var Q = (e, t, n) => si(e, typeof t != "symbol" ? t + "" : t, n);
+var ee = (e, t, n) => si(e, typeof t != "symbol" ? t + "" : t, n);
 function mn(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
@@ -16,7 +16,7 @@ function ai(e) {
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
   mn(e.outputLen), mn(e.blockLen);
 }
-function it(e, t = !0) {
+function rt(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
@@ -28,18 +28,18 @@ function ci(e, t) {
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const Bt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+const St = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const On = (e) => e instanceof Uint8Array, Nt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), te = (e, t) => e << 32 - t | e >>> t, ui = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!ui)
+const On = (e) => e instanceof Uint8Array, Kt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ne = (e, t) => e << 32 - t | e >>> t, li = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!li)
   throw new Error("Non little-endian hardware is not supported");
-function li(e) {
+function ui(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Zt(e) {
-  if (typeof e == "string" && (e = li(e)), !On(e))
+function zt(e) {
+  if (typeof e == "string" && (e = ui(e)), !On(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -52,40 +52,40 @@ function fi(...e) {
     t.set(r, n), n += r.length;
   }), t;
 }
-let Hn = class {
+let Mn = class {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 };
 function hi(e) {
-  const t = (r) => e().update(Zt(r)).digest(), n = e();
+  const t = (r) => e().update(zt(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-function Mn(e = 32) {
-  if (Bt && typeof Bt.getRandomValues == "function")
-    return Bt.getRandomValues(new Uint8Array(e));
+function Hn(e = 32) {
+  if (St && typeof St.getRandomValues == "function")
+    return St.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
 function di(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
-  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), c = Number(n & o), a = r ? 4 : 0, u = r ? 0 : 4;
-  e.setUint32(t + a, s, r), e.setUint32(t + u, c, r);
+  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), c = Number(n & o), a = r ? 4 : 0, l = r ? 0 : 4;
+  e.setUint32(t + a, s, r), e.setUint32(t + l, c, r);
 }
-let gi = class extends Hn {
+let yi = class extends Mn {
   constructor(t, n, r, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Nt(this.buffer);
+    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Kt(this.buffer);
   }
   update(t) {
-    it(this);
+    rt(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Zt(t);
+    t = zt(t);
     const o = t.length;
     for (let s = 0; s < o; ) {
       const c = Math.min(i - this.pos, o - s);
       if (c === i) {
-        const a = Nt(t);
+        const a = Kt(t);
         for (; i <= o - s; s += i)
           this.process(a, s);
         continue;
@@ -95,21 +95,21 @@ let gi = class extends Hn {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    it(this), ci(t, this), this.finished = !0;
+    rt(this), ci(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;
+    for (let u = s; u < i; u++)
+      n[u] = 0;
     di(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const c = Nt(t), a = this.outputLen;
+    const c = Kt(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const u = a / 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++)
-      c.setUint32(4 * l, f[l], o);
+    for (let u = 0; u < l; u++)
+      c.setUint32(4 * u, f[u], o);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -123,7 +123,7 @@ let gi = class extends Hn {
     return t.length = i, t.pos = c, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
   }
 };
-const pi = (e, t, n) => e & t ^ ~e & n, yi = (e, t, n) => e & t ^ e & n ^ t & n, wi = /* @__PURE__ */ new Uint32Array([
+const gi = (e, t, n) => e & t ^ ~e & n, pi = (e, t, n) => e & t ^ e & n ^ t & n, wi = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -188,7 +188,7 @@ const pi = (e, t, n) => e & t ^ ~e & n, yi = (e, t, n) => e & t ^ e & n ^ t & n,
   2756734187,
   3204031479,
   3329325298
-]), be = /* @__PURE__ */ new Uint32Array([
+]), pe = /* @__PURE__ */ new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -197,10 +197,10 @@ const pi = (e, t, n) => e & t ^ ~e & n, yi = (e, t, n) => e & t ^ e & n ^ t & n,
   2600822924,
   528734635,
   1541459225
-]), ve = /* @__PURE__ */ new Uint32Array(64);
-let bi = class extends gi {
+]), we = /* @__PURE__ */ new Uint32Array(64);
+let bi = class extends yi {
   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;
+    super(64, 32, 8, !1), this.A = pe[0] | 0, this.B = pe[1] | 0, this.C = pe[2] | 0, this.D = pe[3] | 0, this.E = pe[4] | 0, this.F = pe[5] | 0, this.G = pe[6] | 0, this.H = pe[7] | 0;
   }
   get() {
     const { A: t, B: n, C: r, D: i, E: o, F: s, G: c, H: a } = this;
@@ -211,21 +211,21 @@ let bi = class extends gi {
     this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = o | 0, this.F = s | 0, this.G = c | 0, this.H = a | 0;
   }
   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 d = ve[l - 15], w = ve[l - 2], y = te(d, 7) ^ te(d, 18) ^ d >>> 3, h = te(w, 17) ^ te(w, 19) ^ w >>> 10;
-      ve[l] = h + ve[l - 7] + y + ve[l - 16] | 0;
+    for (let u = 0; u < 16; u++, n += 4)
+      we[u] = t.getUint32(n, !1);
+    for (let u = 16; u < 64; u++) {
+      const d = we[u - 15], g = we[u - 2], w = ne(d, 7) ^ ne(d, 18) ^ d >>> 3, h = ne(g, 17) ^ ne(g, 19) ^ g >>> 10;
+      we[u] = h + we[u - 7] + w + we[u - 16] | 0;
     }
-    let { A: r, B: i, C: o, D: s, E: c, F: a, G: u, H: f } = this;
-    for (let l = 0; l < 64; l++) {
-      const d = te(c, 6) ^ te(c, 11) ^ te(c, 25), w = f + d + pi(c, a, u) + wi[l] + ve[l] | 0, h = (te(r, 2) ^ te(r, 13) ^ te(r, 22)) + yi(r, i, o) | 0;
-      f = u, u = a, a = c, c = s + w | 0, s = o, o = i, i = r, r = w + h | 0;
+    let { A: r, B: i, C: o, D: s, E: c, F: a, G: l, H: f } = this;
+    for (let u = 0; u < 64; u++) {
+      const d = ne(c, 6) ^ ne(c, 11) ^ ne(c, 25), g = f + d + gi(c, a, l) + wi[u] + we[u] | 0, h = (ne(r, 2) ^ ne(r, 13) ^ ne(r, 22)) + pi(r, i, o) | 0;
+      f = l, l = a, a = c, c = s + g | 0, s = o, o = i, i = r, r = g + h | 0;
     }
-    r = r + this.A | 0, i = i + this.B | 0, o = o + this.C | 0, s = s + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, u = u + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, c, a, u, f);
+    r = r + this.A | 0, i = i + this.B | 0, o = o + this.C | 0, s = s + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, c, a, l, f);
   }
   roundClean() {
-    ve.fill(0);
+    we.fill(0);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
@@ -233,20 +233,20 @@ let bi = class extends gi {
 };
 const $t = /* @__PURE__ */ hi(() => new bi());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const qn = BigInt(0), ft = BigInt(1), vi = BigInt(2), ht = (e) => e instanceof Uint8Array, xi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function Me(e) {
-  if (!ht(e))
+const qn = BigInt(0), ut = BigInt(1), vi = BigInt(2), ft = (e) => e instanceof Uint8Array, mi = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+function He(e) {
+  if (!ft(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += xi[e[n]];
+    t += mi[e[n]];
   return t;
 }
 function Dn(e) {
   const t = e.toString(16);
   return t.length & 1 ? `0${t}` : t;
 }
-function Ft(e) {
+function Zt(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   return BigInt(e === "" ? "0" : `0x${e}`);
@@ -266,24 +266,24 @@ function qe(e) {
   }
   return n;
 }
-function F(e) {
-  return Ft(Me(e));
+function W(e) {
+  return Zt(He(e));
 }
-function Wt(e) {
-  if (!ht(e))
+function Ft(e) {
+  if (!ft(e))
     throw new Error("Uint8Array expected");
-  return Ft(Me(Uint8Array.from(e).reverse()));
+  return Zt(He(Uint8Array.from(e).reverse()));
 }
-function Be(e, t) {
+function xe(e, t) {
   return qe(e.toString(16).padStart(t * 2, "0"));
 }
-function Gt(e, t) {
-  return Be(e, t).reverse();
+function Wt(e, t) {
+  return xe(e, t).reverse();
 }
-function mi(e) {
+function Ei(e) {
   return qe(Dn(e));
 }
-function z(e, t, n) {
+function Z(e, t, n) {
   let r;
   if (typeof t == "string")
     try {
@@ -291,7 +291,7 @@ function z(e, t, n) {
     } catch (o) {
       throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${o}`);
     }
-  else if (ht(t))
+  else if (ft(t))
     r = Uint8Array.from(t);
   else
     throw new Error(`${e} must be hex string or Uint8Array`);
@@ -300,16 +300,16 @@ function z(e, t, n) {
     throw new Error(`${e} expected ${n} bytes, got ${i}`);
   return r;
 }
-function _e(...e) {
+function Ie(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!ht(r))
+    if (!ft(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
 }
-function Ei(e, t) {
+function xi(e, t) {
   if (e.length !== t.length)
     return !1;
   for (let n = 0; n < e.length; n++)
@@ -324,14 +324,14 @@ function Ai(e) {
 }
 function Si(e) {
   let t;
-  for (t = 0; e > qn; e >>= ft, t += 1)
+  for (t = 0; e > qn; e >>= ut, t += 1)
     ;
   return t;
 }
-function Bi(e, t) {
-  return e >> BigInt(t) & ft;
+function Ki(e, t) {
+  return e >> BigInt(t) & ut;
 }
-const Ni = (e, t, n) => e | (n ? ft : qn) << BigInt(t), Jt = (e) => (vi << BigInt(e - 1)) - ft, Ct = (e) => new Uint8Array(e), En = (e) => Uint8Array.from(e);
+const Bi = (e, t, n) => e | (n ? ut : qn) << BigInt(t), Gt = (e) => (vi << BigInt(e - 1)) - ut, Bt = (e) => new Uint8Array(e), En = (e) => Uint8Array.from(e);
 function jn(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
@@ -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 = Ct(e), i = Ct(e), o = 0;
+  let r = Bt(e), i = Bt(e), o = 0;
   const s = () => {
     r.fill(1), i.fill(0), o = 0;
-  }, c = (...l) => n(i, r, ...l), a = (l = Ct()) => {
-    i = c(En([0]), l), r = c(), l.length !== 0 && (i = c(En([1]), l), r = c());
-  }, u = () => {
+  }, c = (...u) => n(i, r, ...u), a = (u = Bt()) => {
+    i = c(En([0]), u), r = c(), u.length !== 0 && (i = c(En([1]), u), r = c());
+  }, l = () => {
     if (o++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
-    let l = 0;
+    let u = 0;
     const d = [];
-    for (; l < t; ) {
+    for (; u < t; ) {
       r = c();
-      const w = r.slice();
-      d.push(w), l += r.length;
+      const g = r.slice();
+      d.push(g), u += r.length;
     }
-    return _e(...d);
+    return Ie(...d);
   };
-  return (l, d) => {
-    s(), a(l);
-    let w;
-    for (; !(w = d(u())); )
+  return (u, d) => {
+    s(), a(u);
+    let g;
+    for (; !(g = d(l())); )
       a();
-    return s(), w;
+    return s(), g;
   };
 }
-const Ci = {
+const Ni = {
   bigint: (e) => typeof e == "bigint",
   function: (e) => typeof e == "function",
   boolean: (e) => typeof e == "boolean",
@@ -375,9 +375,9 @@ const Ci = {
   field: (e, t) => t.Fp.isValid(e),
   hash: (e) => typeof e == "function" && Number.isSafeInteger(e.outputLen)
 };
-function Ye(e, t, n = {}) {
+function Je(e, t, n = {}) {
   const r = (i, o, s) => {
-    const c = Ci[o];
+    const c = Ni[o];
     if (typeof c != "function")
       throw new Error(`Invalid validator "${o}", expected function`);
     const a = e[i];
@@ -390,44 +390,44 @@ function Ye(e, t, n = {}) {
     r(i, o, !0);
   return e;
 }
-const Ui = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Ci = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  bitGet: Bi,
+  bitGet: Ki,
   bitLen: Si,
-  bitMask: Jt,
-  bitSet: Ni,
-  bytesToHex: Me,
-  bytesToNumberBE: F,
-  bytesToNumberLE: Wt,
-  concatBytes: _e,
+  bitMask: Gt,
+  bitSet: Bi,
+  bytesToHex: He,
+  bytesToNumberBE: W,
+  bytesToNumberLE: Ft,
+  concatBytes: Ie,
   createHmacDrbg: jn,
-  ensureBytes: z,
-  equalBytes: Ei,
+  ensureBytes: Z,
+  equalBytes: xi,
   hexToBytes: qe,
-  hexToNumber: Ft,
-  numberToBytesBE: Be,
-  numberToBytesLE: Gt,
+  hexToNumber: Zt,
+  numberToBytesBE: xe,
+  numberToBytesLE: Wt,
   numberToHexUnpadded: Dn,
-  numberToVarBytesBE: mi,
+  numberToVarBytesBE: Ei,
   utf8ToBytes: Ai,
-  validateObject: Ye
+  validateObject: Je
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const j = BigInt(0), M = BigInt(1), Ie = BigInt(2), Ii = BigInt(3), Rt = BigInt(4), An = BigInt(5), Sn = BigInt(8);
+const j = BigInt(0), q = BigInt(1), Be = BigInt(2), Ii = BigInt(3), Tt = BigInt(4), xn = BigInt(5), An = BigInt(8);
 BigInt(9);
 BigInt(16);
-function V(e, t) {
+function z(e, t) {
   const n = e % t;
   return n >= j ? n : t + n;
 }
-function Ki(e, t, n) {
+function Ui(e, t, n) {
   if (n <= j || t < j)
     throw new Error("Expected power/modulo > 0");
-  if (n === M)
+  if (n === q)
     return j;
-  let r = M;
+  let r = q;
   for (; t > j; )
-    t & M && (r = r * e % n), e = e * e % n, t >>= M;
+    t & q && (r = r * e % n), e = e * e % n, t >>= q;
   return r;
 }
 function G(e, t, n) {
@@ -436,54 +436,54 @@ function G(e, t, n) {
     r *= r, r %= n;
   return r;
 }
-function Pt(e, t) {
+function Rt(e, t) {
   if (e === j || t <= j)
     throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);
-  let n = V(e, t), r = t, i = j, o = M;
+  let n = z(e, t), r = t, i = j, o = q;
   for (; n !== j; ) {
-    const c = r / n, a = r % n, u = i - o * c;
-    r = n, n = a, i = o, o = u;
+    const c = r / n, a = r % n, l = i - o * c;
+    r = n, n = a, i = o, o = l;
   }
-  if (r !== M)
+  if (r !== q)
     throw new Error("invert: does not exist");
-  return V(i, t);
+  return z(i, t);
 }
 function _i(e) {
-  const t = (e - M) / Ie;
+  const t = (e - q) / Be;
   let n, r, i;
-  for (n = e - M, r = 0; n % Ie === j; n /= Ie, r++)
+  for (n = e - q, r = 0; n % Be === j; n /= Be, r++)
     ;
-  for (i = Ie; i < e && Ki(i, t, e) !== e - M; i++)
+  for (i = Be; i < e && Ui(i, t, e) !== e - q; i++)
     ;
   if (r === 1) {
-    const s = (e + M) / Rt;
-    return function(a, u) {
-      const f = a.pow(u, s);
-      if (!a.eql(a.sqr(f), u))
+    const s = (e + q) / Tt;
+    return function(a, l) {
+      const f = a.pow(l, s);
+      if (!a.eql(a.sqr(f), l))
         throw new Error("Cannot find square root");
       return f;
     };
   }
-  const o = (n + M) / Ie;
+  const o = (n + q) / Be;
   return function(c, a) {
     if (c.pow(a, t) === c.neg(c.ONE))
       throw new Error("Cannot find square root");
-    let u = r, f = c.pow(c.mul(c.ONE, i), n), l = c.pow(a, o), d = c.pow(a, n);
+    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, o), d = c.pow(a, n);
     for (; !c.eql(d, c.ONE); ) {
       if (c.eql(d, c.ZERO))
         return c.ZERO;
-      let w = 1;
-      for (let h = c.sqr(d); w < u && !c.eql(h, c.ONE); w++)
+      let g = 1;
+      for (let h = c.sqr(d); g < l && !c.eql(h, c.ONE); g++)
         h = c.sqr(h);
-      const y = c.pow(f, M << BigInt(u - w - 1));
-      f = c.sqr(y), l = c.mul(l, y), d = c.mul(d, f), u = w;
+      const w = c.pow(f, q << BigInt(l - g - 1));
+      f = c.sqr(w), u = c.mul(u, w), d = c.mul(d, f), l = g;
     }
-    return l;
+    return u;
   };
 }
-function Li(e) {
-  if (e % Rt === Ii) {
-    const t = (e + M) / Rt;
+function ki(e) {
+  if (e % Tt === Ii) {
+    const t = (e + q) / Tt;
     return function(r, i) {
       const o = r.pow(i, t);
       if (!r.eql(r.sqr(o), i))
@@ -491,18 +491,18 @@ function Li(e) {
       return o;
     };
   }
-  if (e % Sn === An) {
-    const t = (e - An) / Sn;
+  if (e % An === xn) {
+    const t = (e - xn) / An;
     return function(r, i) {
-      const o = r.mul(i, Ie), s = r.pow(o, t), c = r.mul(i, s), a = r.mul(r.mul(c, Ie), s), u = r.mul(c, r.sub(a, r.ONE));
-      if (!r.eql(r.sqr(u), i))
+      const o = r.mul(i, Be), s = r.pow(o, t), c = r.mul(i, s), a = r.mul(r.mul(c, Be), s), l = r.mul(c, r.sub(a, r.ONE));
+      if (!r.eql(r.sqr(l), i))
         throw new Error("Cannot find square root");
-      return u;
+      return l;
     };
   }
   return _i(e);
 }
-const ki = [
+const Li = [
   "create",
   "isValid",
   "is0",
@@ -521,25 +521,25 @@ const ki = [
   "mulN",
   "sqrN"
 ];
-function Ti(e) {
+function $i(e) {
   const t = {
     ORDER: "bigint",
     MASK: "bigint",
     BYTES: "isSafeInteger",
     BITS: "isSafeInteger"
-  }, n = ki.reduce((r, i) => (r[i] = "function", r), t);
-  return Ye(e, n);
+  }, n = Li.reduce((r, i) => (r[i] = "function", r), t);
+  return Je(e, n);
 }
-function $i(e, t, n) {
+function Ti(e, t, n) {
   if (n < j)
     throw new Error("Expected power > 0");
   if (n === j)
     return e.ONE;
-  if (n === M)
+  if (n === q)
     return t;
   let r = e.ONE, i = t;
   for (; n > j; )
-    n & M && (r = e.mul(r, i)), i = e.sqr(i), n >>= M;
+    n & q && (r = e.mul(r, i)), i = e.sqr(i), n >>= q;
   return r;
 }
 function Ri(e, t) {
@@ -556,45 +556,45 @@ function Pi(e, t, n = !1, r = {}) {
   const { nBitLength: i, nByteLength: o } = Vn(e, t);
   if (o > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const s = Li(e), c = Object.freeze({
+  const s = ki(e), c = Object.freeze({
     ORDER: e,
     BITS: i,
     BYTES: o,
-    MASK: Jt(i),
+    MASK: Gt(i),
     ZERO: j,
-    ONE: M,
-    create: (a) => V(a, e),
+    ONE: q,
+    create: (a) => z(a, e),
     isValid: (a) => {
       if (typeof a != "bigint")
         throw new Error(`Invalid field element: expected bigint, got ${typeof a}`);
       return j <= a && a < e;
     },
     is0: (a) => a === j,
-    isOdd: (a) => (a & M) === M,
-    neg: (a) => V(-a, e),
-    eql: (a, u) => a === u,
-    sqr: (a) => V(a * a, e),
-    add: (a, u) => V(a + u, e),
-    sub: (a, u) => V(a - u, e),
-    mul: (a, u) => V(a * u, e),
-    pow: (a, u) => $i(c, a, u),
-    div: (a, u) => V(a * Pt(u, e), e),
+    isOdd: (a) => (a & q) === q,
+    neg: (a) => z(-a, e),
+    eql: (a, l) => a === l,
+    sqr: (a) => z(a * a, e),
+    add: (a, l) => z(a + l, e),
+    sub: (a, l) => z(a - l, e),
+    mul: (a, l) => z(a * l, e),
+    pow: (a, l) => Ti(c, a, l),
+    div: (a, l) => z(a * Rt(l, e), e),
     // Same as above, but doesn't normalize
     sqrN: (a) => a * a,
-    addN: (a, u) => a + u,
-    subN: (a, u) => a - u,
-    mulN: (a, u) => a * u,
-    inv: (a) => Pt(a, e),
+    addN: (a, l) => a + l,
+    subN: (a, l) => a - l,
+    mulN: (a, l) => a * l,
+    inv: (a) => Rt(a, e),
     sqrt: r.sqrt || ((a) => s(c, a)),
     invertBatch: (a) => Ri(c, a),
     // TODO: do we really need constant cmov?
     // We don't have const-time bigints anyway, so probably will be not very useful
-    cmov: (a, u, f) => f ? u : a,
-    toBytes: (a) => n ? Gt(a, o) : Be(a, o),
+    cmov: (a, l, f) => f ? l : a,
+    toBytes: (a) => n ? Wt(a, o) : xe(a, o),
     fromBytes: (a) => {
       if (a.length !== o)
         throw new Error(`Fp.fromBytes: expected ${o}, got ${a.length}`);
-      return n ? Wt(a) : F(a);
+      return n ? Ft(a) : W(a);
     }
   });
   return Object.freeze(c);
@@ -613,12 +613,12 @@ function Oi(e, t, n = !1) {
   const r = e.length, i = zn(t), o = Zn(t);
   if (r < 16 || r < o || r > 1024)
     throw new Error(`expected ${o}-1024 bytes of input, got ${r}`);
-  const s = n ? F(e) : Wt(e), c = V(s, t - M) + M;
-  return n ? Gt(c, i) : Be(c, i);
+  const s = n ? W(e) : Ft(e), c = z(s, t - q) + q;
+  return n ? Wt(c, i) : xe(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Hi = BigInt(0), Ut = BigInt(1);
-function Mi(e, t) {
+const Mi = BigInt(0), Nt = BigInt(1);
+function Hi(e, t) {
   const n = (i, o) => {
     const s = o.negate();
     return i ? s : o;
@@ -631,8 +631,8 @@ function Mi(e, t) {
     // non-const time multiplication ladder
     unsafeLadder(i, o) {
       let s = e.ZERO, c = i;
-      for (; o > Hi; )
-        o & Ut && (s = s.add(c)), c = c.double(), o >>= Ut;
+      for (; o > Mi; )
+        o & Nt && (s = s.add(c)), c = c.double(), o >>= Nt;
       return s;
     },
     /**
@@ -647,12 +647,12 @@ function Mi(e, t) {
      */
     precomputeWindow(i, o) {
       const { windows: s, windowSize: c } = r(o), a = [];
-      let u = i, f = u;
-      for (let l = 0; l < s; l++) {
-        f = u, a.push(f);
+      let l = i, f = l;
+      for (let u = 0; u < s; u++) {
+        f = l, a.push(f);
         for (let d = 1; d < c; d++)
-          f = f.add(u), a.push(f);
-        u = f.double();
+          f = f.add(l), a.push(f);
+        l = f.double();
       }
       return a;
     },
@@ -665,26 +665,26 @@ function Mi(e, t) {
      */
     wNAF(i, o, s) {
       const { windows: c, windowSize: a } = r(i);
-      let u = e.ZERO, f = e.BASE;
-      const l = BigInt(2 ** i - 1), d = 2 ** i, w = BigInt(i);
-      for (let y = 0; y < c; y++) {
-        const h = y * a;
-        let g = Number(s & l);
-        s >>= w, g > a && (g -= d, s += Ut);
-        const p = h, m = h + Math.abs(g) - 1, B = y % 2 !== 0, _ = g < 0;
-        g === 0 ? f = f.add(n(B, o[p])) : u = u.add(n(_, o[m]));
+      let l = e.ZERO, f = e.BASE;
+      const u = BigInt(2 ** i - 1), d = 2 ** i, g = BigInt(i);
+      for (let w = 0; w < c; w++) {
+        const h = w * a;
+        let y = Number(s & u);
+        s >>= g, y > a && (y -= d, s += Nt);
+        const p = h, E = h + Math.abs(y) - 1, K = w % 2 !== 0, _ = y < 0;
+        y === 0 ? f = f.add(n(K, o[p])) : l = l.add(n(_, o[E]));
       }
-      return { p: u, f };
+      return { p: l, f };
     },
     wNAFCached(i, o, s, c) {
       const a = i._WINDOW_SIZE || 1;
-      let u = o.get(i);
-      return u || (u = this.precomputeWindow(i, a), a !== 1 && o.set(i, c(u))), this.wNAF(a, u, s);
+      let l = o.get(i);
+      return l || (l = this.precomputeWindow(i, a), a !== 1 && o.set(i, c(l))), this.wNAF(a, l, s);
     }
   };
 }
 function Fn(e) {
-  return Ti(e.Fp), Ye(e, {
+  return $i(e.Fp), Je(e, {
     n: "bigint",
     h: "bigint",
     Gx: "field",
@@ -701,7 +701,7 @@ function Fn(e) {
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function qi(e) {
   const t = Fn(e);
-  Ye(t, {
+  Je(t, {
     a: "field",
     b: "field"
   }, {
@@ -722,7 +722,7 @@ function qi(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: Di, hexToBytes: ji } = Ui, Ke = {
+const { bytesToNumberBE: Di, hexToBytes: ji } = Ci, Ne = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -730,7 +730,7 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ui, Ke = {
     }
   },
   _parseInt(e) {
-    const { Err: t } = Ke;
+    const { Err: t } = Ne;
     if (e.length < 2 || e[0] !== 2)
       throw new t("Invalid signature integer tag");
     const n = e[1], r = e.subarray(2, n + 2);
@@ -743,7 +743,7 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ui, Ke = {
     return { d: Di(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = Ke, n = typeof e == "string" ? ji(e) : e;
+    const { Err: t } = Ne, n = typeof e == "string" ? ji(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -751,68 +751,68 @@ const { bytesToNumberBE: Di, hexToBytes: ji } = Ui, Ke = {
       throw new t("Invalid signature tag");
     if (n[1] !== r - 2)
       throw new t("Invalid signature: incorrect length");
-    const { d: i, l: o } = Ke._parseInt(n.subarray(2)), { d: s, l: c } = Ke._parseInt(o);
+    const { d: i, l: o } = Ne._parseInt(n.subarray(2)), { d: s, l: c } = Ne._parseInt(o);
     if (c.length)
       throw new t("Invalid signature: left bytes after parsing");
     return { r: i, s };
   },
   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, c = n(o), a = n(s);
     return `30${n(s + o + 4)}02${a}${i}02${c}${r}`;
   }
-}, ue = BigInt(0), J = BigInt(1);
+}, ce = BigInt(0), J = BigInt(1);
 BigInt(2);
-const Bn = BigInt(3);
+const Sn = BigInt(3);
 BigInt(4);
 function Vi(e) {
-  const t = qi(e), { Fp: n } = t, r = t.toBytes || ((y, h, g) => {
+  const t = qi(e), { Fp: n } = t, r = t.toBytes || ((w, h, y) => {
     const p = h.toAffine();
-    return _e(Uint8Array.from([4]), n.toBytes(p.x), n.toBytes(p.y));
-  }), i = t.fromBytes || ((y) => {
-    const h = y.subarray(1), g = n.fromBytes(h.subarray(0, n.BYTES)), p = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
-    return { x: g, y: p };
+    return Ie(Uint8Array.from([4]), n.toBytes(p.x), n.toBytes(p.y));
+  }), i = t.fromBytes || ((w) => {
+    const h = w.subarray(1), y = n.fromBytes(h.subarray(0, n.BYTES)), p = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
+    return { x: y, y: p };
   });
-  function o(y) {
-    const { a: h, b: g } = t, p = n.sqr(y), m = n.mul(p, y);
-    return n.add(n.add(m, n.mul(y, h)), g);
+  function o(w) {
+    const { a: h, b: y } = t, p = n.sqr(w), E = n.mul(p, w);
+    return n.add(n.add(E, n.mul(w, h)), y);
   }
   if (!n.eql(n.sqr(t.Gy), o(t.Gx)))
     throw new Error("bad generator point: equation left != right");
-  function s(y) {
-    return typeof y == "bigint" && ue < y && y < t.n;
+  function s(w) {
+    return typeof w == "bigint" && ce < w && w < t.n;
   }
-  function c(y) {
-    if (!s(y))
+  function c(w) {
+    if (!s(w))
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
-  function a(y) {
-    const { allowedPrivateKeyLengths: h, nByteLength: g, wrapPrivateKey: p, n: m } = t;
-    if (h && typeof y != "bigint") {
-      if (y instanceof Uint8Array && (y = Me(y)), typeof y != "string" || !h.includes(y.length))
+  function a(w) {
+    const { allowedPrivateKeyLengths: h, nByteLength: y, wrapPrivateKey: p, n: E } = t;
+    if (h && typeof w != "bigint") {
+      if (w instanceof Uint8Array && (w = He(w)), typeof w != "string" || !h.includes(w.length))
         throw new Error("Invalid key");
-      y = y.padStart(g * 2, "0");
+      w = w.padStart(y * 2, "0");
     }
-    let B;
+    let K;
     try {
-      B = typeof y == "bigint" ? y : F(z("private key", y, g));
+      K = typeof w == "bigint" ? w : W(Z("private key", w, y));
     } catch {
-      throw new Error(`private key must be ${g} bytes, hex or bigint, not ${typeof y}`);
+      throw new Error(`private key must be ${y} bytes, hex or bigint, not ${typeof w}`);
     }
-    return p && (B = V(B, m)), c(B), B;
+    return p && (K = z(K, E)), c(K), K;
   }
-  const u = /* @__PURE__ */ new Map();
-  function f(y) {
-    if (!(y instanceof l))
+  const l = /* @__PURE__ */ new Map();
+  function f(w) {
+    if (!(w instanceof u))
       throw new Error("ProjectivePoint expected");
   }
-  class l {
-    constructor(h, g, p) {
-      if (this.px = h, this.py = g, this.pz = p, h == null || !n.isValid(h))
+  class u {
+    constructor(h, y, p) {
+      if (this.px = h, this.py = y, this.pz = p, h == null || !n.isValid(h))
         throw new Error("x required");
-      if (g == null || !n.isValid(g))
+      if (y == null || !n.isValid(y))
         throw new Error("y required");
       if (p == null || !n.isValid(p))
         throw new Error("z required");
@@ -820,13 +820,13 @@ function Vi(e) {
     // Does not validate if the point is on-curve.
     // Use fromHex instead, or call assertValidity() later.
     static fromAffine(h) {
-      const { x: g, y: p } = h || {};
-      if (!h || !n.isValid(g) || !n.isValid(p))
+      const { x: y, y: p } = h || {};
+      if (!h || !n.isValid(y) || !n.isValid(p))
         throw new Error("invalid affine point");
-      if (h instanceof l)
+      if (h instanceof u)
         throw new Error("projective point not allowed");
-      const m = (B) => n.eql(B, n.ZERO);
-      return m(g) && m(p) ? l.ZERO : new l(g, p, n.ONE);
+      const E = (K) => n.eql(K, n.ZERO);
+      return E(y) && E(p) ? u.ZERO : new u(y, p, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -841,24 +841,24 @@ function Vi(e) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(h) {
-      const g = n.invertBatch(h.map((p) => p.pz));
-      return h.map((p, m) => p.toAffine(g[m])).map(l.fromAffine);
+      const y = n.invertBatch(h.map((p) => p.pz));
+      return h.map((p, E) => p.toAffine(y[E])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
      * @param hex short/long ECDSA hex
      */
     static fromHex(h) {
-      const g = l.fromAffine(i(z("pointHex", h)));
-      return g.assertValidity(), g;
+      const y = u.fromAffine(i(Z("pointHex", h)));
+      return y.assertValidity(), y;
     }
     // Multiplies generator point by privateKey.
     static fromPrivateKey(h) {
-      return l.BASE.multiply(a(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() {
@@ -867,11 +867,11 @@ function Vi(e) {
           return;
         throw new Error("bad point: ZERO");
       }
-      const { x: h, y: g } = this.toAffine();
-      if (!n.isValid(h) || !n.isValid(g))
+      const { x: h, y } = this.toAffine();
+      if (!n.isValid(h) || !n.isValid(y))
         throw new Error("bad point: x or y not FE");
-      const p = n.sqr(g), m = o(h);
-      if (!n.eql(p, m))
+      const p = n.sqr(y), E = o(h);
+      if (!n.eql(p, E))
         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 Vi(e) {
      */
     equals(h) {
       f(h);
-      const { px: g, py: p, pz: m } = this, { px: B, py: _, pz: U } = h, x = n.eql(n.mul(g, U), n.mul(B, m)), E = n.eql(n.mul(p, U), n.mul(_, m));
-      return x && E;
+      const { px: y, py: p, pz: E } = this, { px: K, py: _, pz: C } = h, m = n.eql(n.mul(y, C), n.mul(K, E)), x = n.eql(n.mul(p, C), n.mul(_, E));
+      return m && 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: g } = t, p = n.mul(g, Bn), { px: m, py: B, pz: _ } = this;
-      let U = n.ZERO, x = n.ZERO, E = n.ZERO, A = n.mul(m, m), O = n.mul(B, B), K = n.mul(_, _), N = n.mul(m, B);
-      return N = n.add(N, N), E = n.mul(m, _), E = n.add(E, E), U = n.mul(h, E), x = n.mul(p, K), x = n.add(U, x), U = n.sub(O, x), x = n.add(O, x), x = n.mul(U, x), U = n.mul(N, U), E = n.mul(p, E), K = n.mul(h, K), N = n.sub(A, K), N = n.mul(h, N), N = n.add(N, E), E = n.add(A, A), A = n.add(E, A), A = n.add(A, K), A = n.mul(A, N), x = n.add(x, A), K = n.mul(B, _), K = n.add(K, K), A = n.mul(K, N), U = n.sub(U, A), E = n.mul(K, O), E = n.add(E, E), E = n.add(E, E), new l(U, x, E);
+      const { a: h, b: y } = t, p = n.mul(y, Sn), { px: E, py: K, pz: _ } = this;
+      let C = n.ZERO, m = n.ZERO, x = n.ZERO, A = n.mul(E, E), O = n.mul(K, K), U = n.mul(_, _), B = n.mul(E, K);
+      return B = n.add(B, B), x = n.mul(E, _), x = n.add(x, x), C = n.mul(h, x), m = n.mul(p, U), m = n.add(C, m), C = n.sub(O, m), m = n.add(O, m), m = n.mul(C, m), C = n.mul(B, C), x = n.mul(p, x), U = n.mul(h, U), B = n.sub(A, U), B = n.mul(h, B), B = n.add(B, x), x = n.add(A, A), A = n.add(x, A), A = n.add(A, U), A = n.mul(A, B), m = n.add(m, A), U = n.mul(K, _), U = n.add(U, U), A = n.mul(U, B), C = n.sub(C, A), x = n.mul(U, O), x = n.add(x, x), x = n.add(x, x), new u(C, m, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,24 +911,24 @@ function Vi(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: g, py: p, pz: m } = this, { px: B, py: _, pz: U } = h;
-      let x = n.ZERO, E = n.ZERO, A = n.ZERO;
-      const O = t.a, K = n.mul(t.b, Bn);
-      let N = n.mul(g, B), $ = n.mul(p, _), R = n.mul(m, U), H = n.add(g, p), b = n.add(B, _);
-      H = n.mul(H, b), b = n.add(N, $), H = n.sub(H, b), b = n.add(g, m);
-      let v = n.add(B, U);
-      return b = n.mul(b, v), v = n.add(N, R), b = n.sub(b, v), v = n.add(p, m), x = n.add(_, U), v = n.mul(v, x), x = n.add($, R), v = n.sub(v, x), A = n.mul(O, b), x = n.mul(K, R), A = n.add(x, A), x = n.sub($, A), A = n.add($, A), E = n.mul(x, A), $ = n.add(N, N), $ = n.add($, N), R = n.mul(O, R), b = n.mul(K, b), $ = n.add($, R), R = n.sub(N, R), R = n.mul(O, R), b = n.add(b, R), N = n.mul($, b), E = n.add(E, N), N = n.mul(v, b), x = n.mul(H, x), x = n.sub(x, N), N = n.mul(H, $), A = n.mul(v, A), A = n.add(A, N), new l(x, E, A);
+      const { px: y, py: p, pz: E } = this, { px: K, py: _, pz: C } = h;
+      let m = n.ZERO, x = n.ZERO, A = n.ZERO;
+      const O = t.a, U = n.mul(t.b, Sn);
+      let B = n.mul(y, K), T = n.mul(p, _), R = n.mul(E, C), H = n.add(y, p), b = n.add(K, _);
+      H = n.mul(H, b), b = n.add(B, T), H = n.sub(H, b), b = n.add(y, E);
+      let v = n.add(K, C);
+      return b = n.mul(b, v), v = n.add(B, R), b = n.sub(b, v), v = n.add(p, E), m = n.add(_, C), v = n.mul(v, m), m = n.add(T, R), v = n.sub(v, m), A = n.mul(O, b), m = n.mul(U, R), A = n.add(m, A), m = n.sub(T, A), A = n.add(T, A), x = n.mul(m, A), T = n.add(B, B), T = n.add(T, B), R = n.mul(O, R), b = n.mul(U, b), T = n.add(T, R), R = n.sub(B, R), R = n.mul(O, R), b = n.add(b, R), B = n.mul(T, b), x = n.add(x, B), B = n.mul(v, b), m = n.mul(H, m), m = n.sub(m, B), B = n.mul(H, T), A = n.mul(v, A), A = n.add(A, B), new u(m, x, A);
     }
     subtract(h) {
       return this.add(h.negate());
     }
     is0() {
-      return this.equals(l.ZERO);
+      return this.equals(u.ZERO);
     }
     wNAF(h) {
-      return w.wNAFCached(this, u, h, (g) => {
-        const p = n.invertBatch(g.map((m) => m.pz));
-        return g.map((m, B) => m.toAffine(p[B])).map(l.fromAffine);
+      return g.wNAFCached(this, l, h, (y) => {
+        const p = n.invertBatch(y.map((E) => E.pz));
+        return y.map((E, K) => E.toAffine(p[K])).map(u.fromAffine);
       });
     }
     /**
@@ -937,18 +937,18 @@ function Vi(e) {
      * an exposed private key e.g. sig verification, which works over *public* keys.
      */
     multiplyUnsafe(h) {
-      const g = l.ZERO;
-      if (h === ue)
-        return g;
+      const y = u.ZERO;
+      if (h === ce)
+        return y;
       if (c(h), h === J)
         return this;
       const { endo: p } = t;
       if (!p)
-        return w.unsafeLadder(this, h);
-      let { k1neg: m, k1: B, k2neg: _, k2: U } = p.splitScalar(h), x = g, E = g, A = this;
-      for (; B > ue || U > ue; )
-        B & J && (x = x.add(A)), U & J && (E = E.add(A)), A = A.double(), B >>= J, U >>= J;
-      return m && (x = x.negate()), _ && (E = E.negate()), E = new l(n.mul(E.px, p.beta), E.py, E.pz), x.add(E);
+        return g.unsafeLadder(this, h);
+      let { k1neg: E, k1: K, k2neg: _, k2: C } = p.splitScalar(h), m = y, x = y, A = this;
+      for (; K > ce || C > ce; )
+        K & J && (m = m.add(A)), C & J && (x = x.add(A)), A = A.double(), K >>= J, C >>= J;
+      return E && (m = m.negate()), _ && (x = x.negate()), x = new u(n.mul(x.px, p.beta), x.py, x.pz), m.add(x);
     }
     /**
      * Constant time multiplication.
@@ -961,17 +961,17 @@ function Vi(e) {
      */
     multiply(h) {
       c(h);
-      let g = h, p, m;
-      const { endo: B } = t;
-      if (B) {
-        const { k1neg: _, k1: U, k2neg: x, k2: E } = B.splitScalar(g);
-        let { p: A, f: O } = this.wNAF(U), { p: K, f: N } = this.wNAF(E);
-        A = w.constTimeNegate(_, A), K = w.constTimeNegate(x, K), K = new l(n.mul(K.px, B.beta), K.py, K.pz), p = A.add(K), m = O.add(N);
+      let y = h, p, E;
+      const { endo: K } = t;
+      if (K) {
+        const { k1neg: _, k1: C, k2neg: m, k2: x } = K.splitScalar(y);
+        let { p: A, f: O } = this.wNAF(C), { p: U, f: B } = this.wNAF(x);
+        A = g.constTimeNegate(_, A), U = g.constTimeNegate(m, U), U = new u(n.mul(U.px, K.beta), U.py, U.pz), p = A.add(U), E = O.add(B);
       } else {
-        const { p: _, f: U } = this.wNAF(g);
-        p = _, m = U;
+        const { p: _, f: C } = this.wNAF(y);
+        p = _, E = C;
       }
-      return l.normalizeZ([p, m])[0];
+      return u.normalizeZ([p, E])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -979,47 +979,47 @@ function Vi(e) {
      * The trick could be useful if both P and Q are not G (not in our case).
      * @returns non-zero affine point
      */
-    multiplyAndAddUnsafe(h, g, p) {
-      const m = l.BASE, B = (U, x) => x === ue || x === J || !U.equals(m) ? U.multiplyUnsafe(x) : U.multiply(x), _ = B(this, g).add(B(h, p));
+    multiplyAndAddUnsafe(h, y, p) {
+      const E = u.BASE, K = (C, m) => m === ce || m === J || !C.equals(E) ? C.multiplyUnsafe(m) : C.multiply(m), _ = K(this, y).add(K(h, p));
       return _.is0() ? void 0 : _;
     }
     // 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: g, py: p, pz: m } = this, B = this.is0();
-      h == null && (h = B ? n.ONE : n.inv(m));
-      const _ = n.mul(g, h), U = n.mul(p, h), x = n.mul(m, h);
-      if (B)
+      const { px: y, py: p, pz: E } = this, K = this.is0();
+      h == null && (h = K ? n.ONE : n.inv(E));
+      const _ = n.mul(y, h), C = n.mul(p, h), m = n.mul(E, h);
+      if (K)
         return { x: n.ZERO, y: n.ZERO };
-      if (!n.eql(x, n.ONE))
+      if (!n.eql(m, n.ONE))
         throw new Error("invZ was invalid");
-      return { x: _, y: U };
+      return { x: _, y: C };
     }
     isTorsionFree() {
-      const { h, isTorsionFree: g } = t;
+      const { h, isTorsionFree: y } = t;
       if (h === J)
         return !0;
-      if (g)
-        return g(l, this);
+      if (y)
+        return y(u, this);
       throw new Error("isTorsionFree() has not been declared for the elliptic curve");
     }
     clearCofactor() {
-      const { h, clearCofactor: g } = t;
-      return h === J ? this : g ? g(l, this) : this.multiplyUnsafe(t.h);
+      const { h, clearCofactor: y } = t;
+      return h === J ? this : y ? y(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 Me(this.toRawBytes(h));
+      return He(this.toRawBytes(h));
     }
   }
-  l.BASE = new l(t.Gx, t.Gy, n.ONE), l.ZERO = new l(n.ZERO, n.ONE, n.ZERO);
-  const d = t.nBitLength, w = Mi(l, t.endo ? Math.ceil(d / 2) : d);
+  u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
+  const d = t.nBitLength, g = Hi(u, t.endo ? Math.ceil(d / 2) : d);
   return {
     CURVE: t,
-    ProjectivePoint: l,
+    ProjectivePoint: u,
     normPrivateKeyToScalar: a,
     weierstrassEquation: o,
     isWithinCurveOrder: s
@@ -1027,7 +1027,7 @@ function Vi(e) {
 }
 function zi(e) {
   const t = Fn(e);
-  return Ye(t, {
+  return Je(t, {
     hash: "hash",
     hmac: "function",
     randomBytes: "function"
@@ -1040,45 +1040,45 @@ function zi(e) {
 function Zi(e) {
   const t = zi(e), { Fp: n, n: r } = t, i = n.BYTES + 1, o = 2 * n.BYTES + 1;
   function s(b) {
-    return ue < b && b < n.ORDER;
+    return ce < b && b < n.ORDER;
   }
   function c(b) {
-    return V(b, r);
+    return z(b, r);
   }
   function a(b) {
-    return Pt(b, r);
+    return Rt(b, r);
   }
-  const { ProjectivePoint: u, normPrivateKeyToScalar: f, weierstrassEquation: l, isWithinCurveOrder: d } = Vi({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: d } = Vi({
     ...t,
     toBytes(b, v, S) {
-      const I = v.toAffine(), C = n.toBytes(I.x), L = _e;
-      return S ? L(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : L(Uint8Array.from([4]), C, n.toBytes(I.y));
+      const I = v.toAffine(), N = n.toBytes(I.x), k = Ie;
+      return S ? k(Uint8Array.from([v.hasEvenY() ? 2 : 3]), N) : k(Uint8Array.from([4]), N, n.toBytes(I.y));
     },
     fromBytes(b) {
       const v = b.length, S = b[0], I = b.subarray(1);
       if (v === i && (S === 2 || S === 3)) {
-        const C = F(I);
-        if (!s(C))
+        const N = W(I);
+        if (!s(N))
           throw new Error("Point is not on curve");
-        const L = l(C);
-        let P = n.sqrt(L);
-        const T = (P & J) === J;
-        return (S & 1) === 1 !== T && (P = n.neg(P)), { x: C, y: P };
+        const k = u(N);
+        let P = n.sqrt(k);
+        const $ = (P & J) === J;
+        return (S & 1) === 1 !== $ && (P = n.neg(P)), { x: N, y: P };
       } else if (v === o && S === 4) {
-        const C = n.fromBytes(I.subarray(0, n.BYTES)), L = n.fromBytes(I.subarray(n.BYTES, 2 * n.BYTES));
-        return { x: C, y: L };
+        const N = n.fromBytes(I.subarray(0, n.BYTES)), k = n.fromBytes(I.subarray(n.BYTES, 2 * n.BYTES));
+        return { x: N, y: k };
       } else
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${o} uncompressed bytes`);
     }
-  }), w = (b) => Me(Be(b, t.nByteLength));
-  function y(b) {
+  }), g = (b) => He(xe(b, t.nByteLength));
+  function w(b) {
     const v = r >> J;
     return b > v;
   }
   function h(b) {
-    return y(b) ? c(-b) : b;
+    return w(b) ? c(-b) : b;
   }
-  const g = (b, v, S) => F(b.slice(v, S));
+  const y = (b, v, S) => W(b.slice(v, S));
   class p {
     constructor(v, S, I) {
       this.r = v, this.s = S, this.recovery = I, this.assertValidity();
@@ -1086,12 +1086,12 @@ function Zi(e) {
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
       const S = t.nByteLength;
-      return v = z("compactSignature", v, S * 2), new p(g(v, 0, S), g(v, S, 2 * S));
+      return v = Z("compactSignature", v, S * 2), new p(y(v, 0, S), y(v, S, 2 * S));
     }
     // DER encoded ECDSA signature
     // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
     static fromDER(v) {
-      const { r: S, s: I } = Ke.toSig(z("DER", v));
+      const { r: S, s: I } = Ne.toSig(Z("DER", v));
       return new p(S, I);
     }
     assertValidity() {
@@ -1104,20 +1104,20 @@ function Zi(e) {
       return new p(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: S, s: I, recovery: C } = this, L = E(z("msgHash", v));
-      if (C == null || ![0, 1, 2, 3].includes(C))
+      const { r: S, s: I, recovery: N } = this, k = x(Z("msgHash", v));
+      if (N == null || ![0, 1, 2, 3].includes(N))
         throw new Error("recovery id invalid");
-      const P = C === 2 || C === 3 ? S + t.n : S;
+      const P = N === 2 || N === 3 ? S + t.n : S;
       if (P >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const T = C & 1 ? "03" : "02", Y = u.fromHex(T + w(P)), ye = a(P), ke = c(-L * ye), Ve = c(I * ye), we = u.BASE.multiplyAndAddUnsafe(Y, ke, Ve);
-      if (!we)
+      const $ = N & 1 ? "03" : "02", X = l.fromHex($ + g(P)), ye = a(P), _e = c(-k * ye), Ve = c(I * ye), ge = l.BASE.multiplyAndAddUnsafe(X, _e, Ve);
+      if (!ge)
         throw new Error("point at infinify");
-      return we.assertValidity(), we;
+      return ge.assertValidity(), ge;
     }
     // Signatures should be low-s, to prevent malleability.
     hasHighS() {
-      return y(this.s);
+      return w(this.s);
     }
     normalizeS() {
       return this.hasHighS() ? new p(this.r, c(-this.s), this.recovery) : this;
@@ -1127,17 +1127,17 @@ function Zi(e) {
       return qe(this.toDERHex());
     }
     toDERHex() {
-      return Ke.hexFromSig({ r: this.r, s: this.s });
+      return Ne.hexFromSig({ r: this.r, s: this.s });
     }
     // padded bytes of r, then padded bytes of s
     toCompactRawBytes() {
       return qe(this.toCompactHex());
     }
     toCompactHex() {
-      return w(this.r) + w(this.s);
+      return g(this.r) + g(this.s);
     }
   }
-  const m = {
+  const E = {
     isValidPrivateKey(b) {
       try {
         return f(b), !0;
@@ -1162,118 +1162,118 @@ function Zi(e) {
      * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
      * fast.multiply(privKey); // much faster ECDH now
      */
-    precompute(b = 8, v = u.BASE) {
+    precompute(b = 8, v = l.BASE) {
       return v._setWindowSize(b), v.multiply(BigInt(3)), v;
     }
   };
-  function B(b, v = !0) {
-    return u.fromPrivateKey(b).toRawBytes(v);
+  function K(b, v = !0) {
+    return l.fromPrivateKey(b).toRawBytes(v);
   }
   function _(b) {
     const v = b instanceof Uint8Array, S = typeof b == "string", I = (v || S) && b.length;
-    return v ? I === i || I === o : S ? I === 2 * i || I === 2 * o : b instanceof u;
+    return v ? I === i || I === o : S ? I === 2 * i || I === 2 * o : b instanceof l;
   }
-  function U(b, v, S = !0) {
+  function C(b, v, S = !0) {
     if (_(b))
       throw new Error("first arg must be private key");
     if (!_(v))
       throw new Error("second arg must be public key");
-    return u.fromHex(v).multiply(f(b)).toRawBytes(S);
+    return l.fromHex(v).multiply(f(b)).toRawBytes(S);
   }
-  const x = t.bits2int || function(b) {
-    const v = F(b), S = b.length * 8 - t.nBitLength;
+  const m = t.bits2int || function(b) {
+    const v = W(b), S = b.length * 8 - t.nBitLength;
     return S > 0 ? v >> BigInt(S) : v;
-  }, E = t.bits2int_modN || function(b) {
-    return c(x(b));
-  }, A = Jt(t.nBitLength);
+  }, x = t.bits2int_modN || function(b) {
+    return c(m(b));
+  }, A = Gt(t.nBitLength);
   function O(b) {
     if (typeof b != "bigint")
       throw new Error("bigint expected");
-    if (!(ue <= b && b < A))
+    if (!(ce <= b && b < A))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
-    return Be(b, t.nByteLength);
+    return xe(b, t.nByteLength);
   }
-  function K(b, v, S = N) {
-    if (["recovered", "canonical"].some((Ue) => Ue in S))
+  function U(b, v, S = B) {
+    if (["recovered", "canonical"].some((Ke) => Ke in S))
       throw new Error("sign() legacy options not supported");
-    const { hash: I, randomBytes: C } = t;
-    let { lowS: L, prehash: P, extraEntropy: T } = S;
-    L == null && (L = !0), b = z("msgHash", b), P && (b = z("prehashed msgHash", I(b)));
-    const Y = E(b), ye = f(v), ke = [O(ye), O(Y)];
-    if (T != null) {
-      const Ue = T === !0 ? C(n.BYTES) : T;
-      ke.push(z("extraEntropy", Ue));
-    }
-    const Ve = _e(...ke), we = Y;
-    function St(Ue) {
-      const Te = x(Ue);
-      if (!d(Te))
+    const { hash: I, randomBytes: N } = t;
+    let { lowS: k, prehash: P, extraEntropy: $ } = S;
+    k == null && (k = !0), b = Z("msgHash", b), P && (b = Z("prehashed msgHash", I(b)));
+    const X = x(b), ye = f(v), _e = [O(ye), O(X)];
+    if ($ != null) {
+      const Ke = $ === !0 ? N(n.BYTES) : $;
+      _e.push(Z("extraEntropy", Ke));
+    }
+    const Ve = Ie(..._e), ge = X;
+    function At(Ke) {
+      const ke = m(Ke);
+      if (!d(ke))
         return;
-      const bn = a(Te), $e = u.BASE.multiply(Te).toAffine(), X = c($e.x);
-      if (X === ue)
+      const wn = a(ke), Le = l.BASE.multiply(ke).toAffine(), Q = c(Le.x);
+      if (Q === ce)
         return;
-      const Re = c(bn * c(we + X * ye));
-      if (Re === ue)
+      const $e = c(wn * c(ge + Q * ye));
+      if ($e === ce)
         return;
-      let vn = ($e.x === X ? 0 : 2) | Number($e.y & J), xn = Re;
-      return L && y(Re) && (xn = h(Re), vn ^= 1), new p(X, xn, vn);
+      let bn = (Le.x === Q ? 0 : 2) | Number(Le.y & J), vn = $e;
+      return k && w($e) && (vn = h($e), bn ^= 1), new p(Q, vn, bn);
     }
-    return { seed: Ve, k2sig: St };
+    return { seed: Ve, k2sig: At };
   }
-  const N = { lowS: t.lowS, prehash: !1 }, $ = { lowS: t.lowS, prehash: !1 };
-  function R(b, v, S = N) {
-    const { seed: I, k2sig: C } = K(b, v, S), L = t;
-    return jn(L.hash.outputLen, L.nByteLength, L.hmac)(I, C);
+  const B = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
+  function R(b, v, S = B) {
+    const { seed: I, k2sig: N } = U(b, v, S), k = t;
+    return jn(k.hash.outputLen, k.nByteLength, k.hmac)(I, N);
   }
-  u.BASE._setWindowSize(8);
-  function H(b, v, S, I = $) {
-    var $e;
-    const C = b;
-    if (v = z("msgHash", v), S = z("publicKey", S), "strict" in I)
+  l.BASE._setWindowSize(8);
+  function H(b, v, S, I = T) {
+    var Le;
+    const N = b;
+    if (v = Z("msgHash", v), S = Z("publicKey", S), "strict" in I)
       throw new Error("options.strict was renamed to lowS");
-    const { lowS: L, prehash: P } = I;
-    let T, Y;
+    const { lowS: k, prehash: P } = I;
+    let $, X;
     try {
-      if (typeof C == "string" || C instanceof Uint8Array)
+      if (typeof N == "string" || N instanceof Uint8Array)
         try {
-          T = p.fromDER(C);
-        } catch (X) {
-          if (!(X instanceof Ke.Err))
-            throw X;
-          T = p.fromCompact(C);
+          $ = p.fromDER(N);
+        } catch (Q) {
+          if (!(Q instanceof Ne.Err))
+            throw Q;
+          $ = p.fromCompact(N);
         }
-      else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
-        const { r: X, s: Re } = C;
-        T = new p(X, Re);
+      else if (typeof N == "object" && typeof N.r == "bigint" && typeof N.s == "bigint") {
+        const { r: Q, s: $e } = N;
+        $ = new p(Q, $e);
       } else
         throw new Error("PARSE");
-      Y = u.fromHex(S);
-    } catch (X) {
-      if (X.message === "PARSE")
+      X = l.fromHex(S);
+    } catch (Q) {
+      if (Q.message === "PARSE")
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
       return !1;
     }
-    if (L && T.hasHighS())
+    if (k && $.hasHighS())
       return !1;
     P && (v = t.hash(v));
-    const { r: ye, s: ke } = T, Ve = E(v), we = a(ke), St = c(Ve * we), Ue = c(ye * we), Te = ($e = u.BASE.multiplyAndAddUnsafe(Y, St, Ue)) == null ? void 0 : $e.toAffine();
-    return Te ? c(Te.x) === ye : !1;
+    const { r: ye, s: _e } = $, Ve = x(v), ge = a(_e), At = c(Ve * ge), Ke = c(ye * ge), ke = (Le = l.BASE.multiplyAndAddUnsafe(X, At, Ke)) == null ? void 0 : Le.toAffine();
+    return ke ? c(ke.x) === ye : !1;
   }
   return {
     CURVE: t,
-    getPublicKey: B,
-    getSharedSecret: U,
+    getPublicKey: K,
+    getSharedSecret: C,
     sign: R,
     verify: H,
-    ProjectivePoint: u,
+    ProjectivePoint: l,
     Signature: p,
-    utils: m
+    utils: E
   };
 }
-let Wn = class extends Hn {
+let Wn = class extends Mn {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, ai(t);
-    const r = Zt(n);
+    const r = zt(n);
     if (this.iHash = t.create(), typeof this.iHash.update != "function")
       throw new Error("Expected instance of class which extends utils.Hash");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
@@ -1287,10 +1287,10 @@ let Wn = class extends Hn {
     this.oHash.update(o), o.fill(0);
   }
   update(t) {
-    return it(this), this.iHash.update(t), this;
+    return rt(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    it(this), Pn(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    rt(this), Pn(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);
@@ -1312,7 +1312,7 @@ function Fi(e) {
   return {
     hash: e,
     hmac: (t, ...n) => Gn(e, t, fi(...n)),
-    randomBytes: Mn
+    randomBytes: Hn
   };
 }
 function Wi(e, t) {
@@ -1320,18 +1320,18 @@ function Wi(e, t) {
   return Object.freeze({ ...n(t), create: n });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const dt = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), ot = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), st = BigInt(2), Nn = (e, t) => (e + t / st) / t;
+const ht = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), it = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), Jn = BigInt(1), ot = BigInt(2), Kn = (e, t) => (e + t / ot) / t;
 function Yn(e) {
-  const t = dt, n = BigInt(3), r = BigInt(6), i = BigInt(11), o = BigInt(22), s = BigInt(23), c = BigInt(44), a = BigInt(88), u = e * e * e % t, f = u * u * e % t, l = G(f, n, t) * f % t, d = G(l, n, t) * f % t, w = G(d, st, t) * u % t, y = G(w, i, t) * w % t, h = G(y, o, t) * y % t, g = G(h, c, t) * h % t, p = G(g, a, t) * g % t, m = G(p, c, t) * h % t, B = G(m, n, t) * f % t, _ = G(B, s, t) * y % t, U = G(_, r, t) * u % t, x = G(U, st, t);
-  if (!Ot.eql(Ot.sqr(x), e))
+  const t = ht, n = BigInt(3), r = BigInt(6), i = BigInt(11), o = BigInt(22), s = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = G(f, n, t) * f % t, d = G(u, n, t) * f % t, g = G(d, ot, t) * l % t, w = G(g, i, t) * g % t, h = G(w, o, t) * w % t, y = G(h, c, t) * h % t, p = G(y, a, t) * y % t, E = G(p, c, t) * h % t, K = G(E, n, t) * f % t, _ = G(K, s, t) * w % t, C = G(_, r, t) * l % t, m = G(C, ot, t);
+  if (!Pt.eql(Pt.sqr(m), e))
     throw new Error("Cannot find square root");
-  return x;
+  return m;
 }
-const Ot = Pi(dt, void 0, void 0, { sqrt: Yn }), Le = Wi({
+const Pt = Pi(ht, void 0, void 0, { sqrt: Yn }), Ue = Wi({
   a: BigInt(0),
   b: BigInt(7),
-  Fp: Ot,
-  n: ot,
+  Fp: Pt,
+  n: it,
   // Base point (x, y) aka generator point
   Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),
   Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),
@@ -1346,62 +1346,62 @@ const Ot = Pi(dt, void 0, void 0, { sqrt: Yn }), Le = Wi({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
-      const t = ot, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Jn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), o = n, s = BigInt("0x100000000000000000000000000000000"), c = Nn(o * e, t), a = Nn(-r * e, t);
-      let u = V(e - c * n - a * i, t), f = V(-c * r - a * o, t);
-      const l = u > s, d = f > s;
-      if (l && (u = t - u), d && (f = t - f), u > s || f > s)
+      const t = it, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -Jn * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), o = n, s = BigInt("0x100000000000000000000000000000000"), c = Kn(o * e, t), a = Kn(-r * e, t);
+      let l = z(e - c * n - a * i, t), f = z(-c * r - a * o, t);
+      const u = l > s, d = f > s;
+      if (u && (l = t - l), d && (f = t - f), l > s || f > s)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
-      return { k1neg: l, k1: u, k2neg: d, k2: f };
+      return { k1neg: u, k1: l, k2neg: d, k2: f };
     }
   }
-}, $t), gt = BigInt(0), Xn = (e) => typeof e == "bigint" && gt < e && e < dt, Gi = (e) => typeof e == "bigint" && gt < e && e < ot, Cn = {};
-function at(e, ...t) {
-  let n = Cn[e];
+}, $t), dt = BigInt(0), Xn = (e) => typeof e == "bigint" && dt < e && e < ht, Gi = (e) => typeof e == "bigint" && dt < e && e < it, Bn = {};
+function st(e, ...t) {
+  let n = Bn[e];
   if (n === void 0) {
     const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = _e(r, r), Cn[e] = n;
+    n = Ie(r, r), Bn[e] = n;
   }
-  return $t(_e(n, ...t));
+  return $t(Ie(n, ...t));
 }
-const Yt = (e) => e.toRawBytes(!0).slice(1), Ht = (e) => Be(e, 32), It = (e) => V(e, dt), Ge = (e) => V(e, ot), Xt = Le.ProjectivePoint, Ji = (e, t, n) => Xt.BASE.multiplyAndAddUnsafe(e, t, n);
+const Jt = (e) => e.toRawBytes(!0).slice(1), Ot = (e) => xe(e, 32), Ct = (e) => z(e, ht), We = (e) => z(e, it), Yt = Ue.ProjectivePoint, Ji = (e, t, n) => Yt.BASE.multiplyAndAddUnsafe(e, t, n);
 function Mt(e) {
-  let t = Le.utils.normPrivateKeyToScalar(e), n = Xt.fromPrivateKey(t);
-  return { scalar: n.hasEvenY() ? t : Ge(-t), bytes: Yt(n) };
+  let t = Ue.utils.normPrivateKeyToScalar(e), n = Yt.fromPrivateKey(t);
+  return { scalar: n.hasEvenY() ? t : We(-t), bytes: Jt(n) };
 }
 function Qn(e) {
   if (!Xn(e))
     throw new Error("bad x: need 0 < x < p");
-  const t = It(e * e), n = It(t * e + BigInt(7));
+  const t = Ct(e * e), n = Ct(t * e + BigInt(7));
   let r = Yn(n);
-  r % st !== gt && (r = It(-r));
-  const i = new Xt(e, r, Jn);
+  r % ot !== dt && (r = Ct(-r));
+  const i = new Yt(e, r, Jn);
   return i.assertValidity(), i;
 }
 function er(...e) {
-  return Ge(F(at("BIP0340/challenge", ...e)));
+  return We(W(st("BIP0340/challenge", ...e)));
 }
 function Yi(e) {
   return Mt(e).bytes;
 }
-function Xi(e, t, n = Mn(32)) {
-  const r = z("message", e), { bytes: i, scalar: o } = Mt(t), s = z("auxRand", n, 32), c = Ht(o ^ F(at("BIP0340/aux", s))), a = at("BIP0340/nonce", c, i, r), u = Ge(F(a));
-  if (u === gt)
+function Xi(e, t, n = Hn(32)) {
+  const r = Z("message", e), { bytes: i, scalar: o } = Mt(t), s = Z("auxRand", n, 32), c = Ot(o ^ W(st("BIP0340/aux", s))), a = st("BIP0340/nonce", c, i, r), l = We(W(a));
+  if (l === dt)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: l } = Mt(u), d = er(f, i, r), w = new Uint8Array(64);
-  if (w.set(f, 0), w.set(Ht(Ge(l + d * o)), 32), !tr(w, r, i))
+  const { bytes: f, scalar: u } = Mt(l), d = er(f, i, r), g = new Uint8Array(64);
+  if (g.set(f, 0), g.set(Ot(We(u + d * o)), 32), !tr(g, r, i))
     throw new Error("sign: Invalid signature produced");
-  return w;
+  return g;
 }
 function tr(e, t, n) {
-  const r = z("signature", e, 64), i = z("message", t), o = z("publicKey", n, 32);
+  const r = Z("signature", e, 64), i = Z("message", t), o = Z("publicKey", n, 32);
   try {
-    const s = Qn(F(o)), c = F(r.subarray(0, 32));
+    const s = Qn(W(o)), c = W(r.subarray(0, 32));
     if (!Xn(c))
       return !1;
-    const a = F(r.subarray(32, 64));
+    const a = W(r.subarray(32, 64));
     if (!Gi(a))
       return !1;
-    const u = er(Ht(c), Yt(s), i), f = Ji(s, a, Ge(-u));
+    const l = er(Ot(c), Jt(s), i), f = Ji(s, a, We(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
   } catch {
     return !1;
@@ -1412,29 +1412,29 @@ const ze = {
   sign: Xi,
   verify: tr,
   utils: {
-    randomPrivateKey: Le.utils.randomPrivateKey,
+    randomPrivateKey: Ue.utils.randomPrivateKey,
     lift_x: Qn,
-    pointToBytes: Yt,
-    numberToBytesBE: Be,
-    bytesToNumberBE: F,
-    taggedHash: at,
-    mod: V
+    pointToBytes: Jt,
+    numberToBytesBE: xe,
+    bytesToNumberBE: W,
+    taggedHash: st,
+    mod: z
   }
-}, Kt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+}, It = 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, _t = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ne = (e, t) => e << 32 - t | e >>> t, Qi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+const Xt = (e) => e instanceof Uint8Array, Ut = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Qi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
 if (!Qi)
   throw new Error("Non little-endian hardware is not supported");
 const eo = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function D(e) {
-  if (!Qt(e))
+function M(e) {
+  if (!Xt(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
     t += eo[e[n]];
   return t;
 }
-function W(e) {
+function Y(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   const t = e.length;
@@ -1454,16 +1454,16 @@ function to(e) {
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Je(e) {
-  if (typeof e == "string" && (e = to(e)), !Qt(e))
+function Ge(e) {
+  if (typeof e == "string" && (e = to(e)), !Xt(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function pt(...e) {
+function yt(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!Qt(r))
+    if (!Xt(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
@@ -1475,15 +1475,15 @@ class nr {
   }
 }
 function rr(e) {
-  const t = (r) => e().update(Je(r)).digest(), n = e();
+  const t = (r) => e().update(Ge(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
 function ir(e = 32) {
-  if (Kt && typeof Kt.getRandomValues == "function")
-    return Kt.getRandomValues(new Uint8Array(e));
+  if (It && typeof It.getRandomValues == "function")
+    return It.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function qt(e) {
+function Ht(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
@@ -1500,7 +1500,7 @@ function or(e, ...t) {
 function ro(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  qt(e.outputLen), qt(e.blockLen);
+  Ht(e.outputLen), Ht(e.blockLen);
 }
 function io(e, t = !0) {
   if (e.destroyed)
@@ -1514,8 +1514,8 @@ function oo(e, t) {
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
-const ie = {
-  number: qt,
+const oe = {
+  number: Ht,
   bool: no,
   bytes: or,
   hash: ro,
@@ -1525,22 +1525,22 @@ const ie = {
 function so(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
-  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), c = Number(n & o), a = r ? 4 : 0, u = r ? 0 : 4;
-  e.setUint32(t + a, s, r), e.setUint32(t + u, c, r);
+  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), c = Number(n & o), a = r ? 4 : 0, l = r ? 0 : 4;
+  e.setUint32(t + a, s, r), e.setUint32(t + l, c, r);
 }
 class ao extends nr {
   constructor(t, n, r, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = _t(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 = Ut(this.buffer);
   }
   update(t) {
-    ie.exists(this);
+    oe.exists(this);
     const { view: n, buffer: r, blockLen: i } = this;
-    t = Je(t);
+    t = Ge(t);
     const o = t.length;
     for (let s = 0; s < o; ) {
       const c = Math.min(i - this.pos, o - s);
       if (c === i) {
-        const a = _t(t);
+        const a = Ut(t);
         for (; i <= o - s; s += i)
           this.process(a, s);
         continue;
@@ -1550,21 +1550,21 @@ class ao extends nr {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    ie.exists(this), ie.output(t, this), this.finished = !0;
+    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;
+    for (let u = s; u < i; u++)
+      n[u] = 0;
     so(r, i - 8, BigInt(this.length * 8), o), this.process(r, 0);
-    const c = _t(t), a = this.outputLen;
+    const c = Ut(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const u = a / 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++)
-      c.setUint32(4 * l, f[l], o);
+    for (let u = 0; u < l; u++)
+      c.setUint32(4 * u, f[u], o);
   }
   digest() {
     const { buffer: t, outputLen: n } = this;
@@ -1578,7 +1578,7 @@ class ao extends nr {
     return t.length = i, t.pos = c, t.finished = o, t.destroyed = s, i % n && t.buffer.set(r), t;
   }
 }
-const co = (e, t, n) => e & t ^ ~e & n, uo = (e, t, n) => e & t ^ e & n ^ t & n, lo = new Uint32Array([
+const co = (e, t, n) => e & t ^ ~e & n, lo = (e, t, n) => e & t ^ e & n ^ t & n, uo = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1643,7 +1643,7 @@ const co = (e, t, n) => e & t ^ ~e & n, uo = (e, t, n) => e & t ^ e & n ^ t & n,
   2756734187,
   3204031479,
   3329325298
-]), xe = new Uint32Array([
+]), be = new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -1652,10 +1652,10 @@ const co = (e, t, n) => e & t ^ ~e & n, uo = (e, t, n) => e & t ^ e & n ^ t & n,
   2600822924,
   528734635,
   1541459225
-]), me = new Uint32Array(64);
+]), ve = new Uint32Array(64);
 class sr extends ao {
   constructor() {
-    super(64, 32, 8, !1), this.A = xe[0] | 0, this.B = xe[1] | 0, this.C = xe[2] | 0, this.D = xe[3] | 0, this.E = xe[4] | 0, this.F = xe[5] | 0, this.G = xe[6] | 0, this.H = xe[7] | 0;
+    super(64, 32, 8, !1), this.A = be[0] | 0, this.B = be[1] | 0, this.C = be[2] | 0, this.D = be[3] | 0, this.E = be[4] | 0, this.F = be[5] | 0, this.G = be[6] | 0, this.H = be[7] | 0;
   }
   get() {
     const { A: t, B: n, C: r, D: i, E: o, F: s, G: c, H: a } = this;
@@ -1666,21 +1666,21 @@ class sr extends ao {
     this.A = t | 0, this.B = n | 0, this.C = r | 0, this.D = i | 0, this.E = o | 0, this.F = s | 0, this.G = c | 0, this.H = a | 0;
   }
   process(t, n) {
-    for (let l = 0; l < 16; l++, n += 4)
-      me[l] = t.getUint32(n, !1);
-    for (let l = 16; l < 64; l++) {
-      const d = me[l - 15], w = me[l - 2], y = ne(d, 7) ^ ne(d, 18) ^ d >>> 3, h = ne(w, 17) ^ ne(w, 19) ^ w >>> 10;
-      me[l] = h + me[l - 7] + y + me[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 d = ve[u - 15], g = ve[u - 2], w = re(d, 7) ^ re(d, 18) ^ d >>> 3, h = re(g, 17) ^ re(g, 19) ^ g >>> 10;
+      ve[u] = h + ve[u - 7] + w + ve[u - 16] | 0;
     }
-    let { A: r, B: i, C: o, D: s, E: c, F: a, G: u, H: f } = this;
-    for (let l = 0; l < 64; l++) {
-      const d = ne(c, 6) ^ ne(c, 11) ^ ne(c, 25), w = f + d + co(c, a, u) + lo[l] + me[l] | 0, h = (ne(r, 2) ^ ne(r, 13) ^ ne(r, 22)) + uo(r, i, o) | 0;
-      f = u, u = a, a = c, c = s + w | 0, s = o, o = i, i = r, r = w + h | 0;
+    let { A: r, B: i, C: o, D: s, E: c, F: a, G: l, H: f } = this;
+    for (let u = 0; u < 64; u++) {
+      const d = re(c, 6) ^ re(c, 11) ^ re(c, 25), g = f + d + co(c, a, l) + uo[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + lo(r, i, o) | 0;
+      f = l, l = a, a = c, c = s + g | 0, s = o, o = i, i = r, r = g + h | 0;
     }
-    r = r + this.A | 0, i = i + this.B | 0, o = o + this.C | 0, s = s + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, u = u + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, c, a, u, f);
+    r = r + this.A | 0, i = i + this.B | 0, o = o + this.C | 0, s = s + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, o, s, c, a, l, f);
   }
   roundClean() {
-    me.fill(0);
+    ve.fill(0);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
@@ -1691,18 +1691,18 @@ class fo extends sr {
     super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28;
   }
 }
-const Ne = rr(() => new sr());
+const Ae = rr(() => new sr());
 rr(() => new fo());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 function je(e) {
   if (!Number.isSafeInteger(e))
     throw new Error(`Wrong integer: ${e}`);
 }
-function de(...e) {
+function fe(...e) {
   const t = (i, o) => (s) => i(o(s)), n = Array.from(e).reverse().reduce((i, o) => i ? t(i, o.encode) : o.encode, void 0), r = e.reduce((i, o) => i ? t(i, o.decode) : o.decode, void 0);
   return { encode: n, decode: r };
 }
-function ge(e) {
+function he(e) {
   return {
     encode: (t) => {
       if (!Array.isArray(t) || t.length && typeof t[0] != "number")
@@ -1727,7 +1727,7 @@ function ge(e) {
     }
   };
 }
-function pe(e = "") {
+function de(e = "") {
   if (typeof e != "string")
     throw new Error("join separator should be string");
   return {
@@ -1746,7 +1746,7 @@ function pe(e = "") {
     }
   };
 }
-function yt(e, t = "=") {
+function gt(e, t = "=") {
   if (je(e), typeof t != "string")
     throw new Error("padding chr should be string");
   return {
@@ -1781,7 +1781,7 @@ function ar(e) {
     throw new Error("normalize fn should be function");
   return { encode: (t) => t, decode: (t) => e(t) };
 }
-function Un(e, t, n) {
+function Nn(e, t, n) {
   if (t < 2)
     throw new Error(`convertRadix: wrong from=${t}, base cannot be less than 2`);
   if (n < 2)
@@ -1798,8 +1798,8 @@ function Un(e, t, n) {
   }); ; ) {
     let s = 0, c = !0;
     for (let a = r; a < o.length; a++) {
-      const u = o[a], f = t * s + u;
-      if (!Number.isSafeInteger(f) || t * s / t !== s || f - u !== t * s)
+      const l = o[a], f = t * s + l;
+      if (!Number.isSafeInteger(f) || t * s / t !== s || f - l !== t * s)
         throw new Error("convertRadix: carry overflow");
       if (s = f % n, o[a] = Math.floor(f / n), !Number.isSafeInteger(o[a]) || o[a] * n + s !== f)
         throw new Error("convertRadix: carry overflow");
@@ -1814,16 +1814,16 @@ function Un(e, t, n) {
     i.push(0);
   return i.reverse();
 }
-const cr = (e, t) => t ? cr(t, e % t) : e, ct = (e, t) => e + (t - cr(e, t));
-function Dt(e, t, n, r) {
+const cr = (e, t) => t ? cr(t, e % t) : e, at = (e, t) => e + (t - cr(e, t));
+function qt(e, t, n, r) {
   if (!Array.isArray(e))
     throw new Error("convertRadix2: data should be array");
   if (t <= 0 || t > 32)
     throw new Error(`convertRadix2: wrong from=${t}`);
   if (n <= 0 || n > 32)
     throw new Error(`convertRadix2: wrong to=${n}`);
-  if (ct(t, n) > 32)
-    throw new Error(`convertRadix2: carry overflow from=${t} to=${n} carryBits=${ct(t, n)}`);
+  if (at(t, n) > 32)
+    throw new Error(`convertRadix2: carry overflow from=${t} to=${n} carryBits=${at(t, n)}`);
   let i = 0, o = 0;
   const s = 2 ** n - 1, c = [];
   for (const a of e) {
@@ -1846,34 +1846,34 @@ function ho(e) {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
-      return Un(Array.from(t), 2 ** 8, e);
+      return Nn(Array.from(t), 2 ** 8, e);
     },
     decode: (t) => {
       if (!Array.isArray(t) || t.length && typeof t[0] != "number")
         throw new Error("radix.decode input should be array of strings");
-      return Uint8Array.from(Un(t, e, 2 ** 8));
+      return Uint8Array.from(Nn(t, e, 2 ** 8));
     }
   };
 }
-function Ce(e, t = !1) {
+function Se(e, t = !1) {
   if (je(e), e <= 0 || e > 32)
     throw new Error("radix2: bits should be in (0..32]");
-  if (ct(8, e) > 32 || ct(e, 8) > 32)
+  if (at(8, e) > 32 || at(e, 8) > 32)
     throw new Error("radix2: carry overflow");
   return {
     encode: (n) => {
       if (!(n instanceof Uint8Array))
         throw new Error("radix2.encode input should be Uint8Array");
-      return Dt(Array.from(n), 8, e, !t);
+      return qt(Array.from(n), 8, e, !t);
     },
     decode: (n) => {
       if (!Array.isArray(n) || n.length && typeof n[0] != "number")
         throw new Error("radix2.decode input should be array of strings");
-      return Uint8Array.from(Dt(n, e, 8, t));
+      return Uint8Array.from(qt(n, e, 8, t));
     }
   };
 }
-function In(e) {
+function Cn(e) {
   if (typeof e != "function")
     throw new Error("unsafeWrapper fn should be function");
   return function(...t) {
@@ -1883,25 +1883,25 @@ function In(e) {
     }
   };
 }
-const go = de(Ce(4), ge("0123456789ABCDEF"), pe("")), po = de(Ce(5), ge("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), yt(5), pe(""));
-de(Ce(5), ge("0123456789ABCDEFGHIJKLMNOPQRSTUV"), yt(5), pe(""));
-de(Ce(5), ge("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), pe(""), ar((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const he = de(Ce(6), ge("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), yt(6), pe("")), yo = de(Ce(6), ge("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), yt(6), pe("")), en = (e) => de(ho(58), ge(e), pe("")), ut = en("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
-en("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
-en("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
-const Kn = [0, 2, 3, 5, 6, 7, 9, 10, 11], wo = {
+const yo = fe(Se(4), he("0123456789ABCDEF"), de("")), go = fe(Se(5), he("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), gt(5), de(""));
+fe(Se(5), he("0123456789ABCDEFGHIJKLMNOPQRSTUV"), gt(5), de(""));
+fe(Se(5), he("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), de(""), ar((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
+const ue = fe(Se(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), gt(6), de("")), po = fe(Se(6), he("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), gt(6), de("")), Qt = (e) => fe(ho(58), he(e), de("")), ct = Qt("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+Qt("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
+Qt("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
+const In = [0, 2, 3, 5, 6, 7, 9, 10, 11], wo = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
       const r = e.subarray(n, n + 8);
-      t += ut.encode(r).padStart(Kn[r.length], "1");
+      t += ct.encode(r).padStart(In[r.length], "1");
     }
     return t;
   },
   decode(e) {
     let t = [];
     for (let n = 0; n < e.length; n += 11) {
-      const r = e.slice(n, n + 11), i = Kn.indexOf(r.length), o = ut.decode(r);
+      const r = e.slice(n, n + 11), i = In.indexOf(r.length), o = ct.decode(r);
       for (let s = 0; s < o.length - i; s++)
         if (o[s] !== 0)
           throw new Error("base58xmr: wrong padding");
@@ -1909,15 +1909,15 @@ const Kn = [0, 2, 3, 5, 6, 7, 9, 10, 11], wo = {
     }
     return Uint8Array.from(t);
   }
-}, jt = de(ge("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), pe("")), _n = [996825010, 642813549, 513874426, 1027748829, 705979059];
+}, Dt = fe(he("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), de("")), Un = [996825010, 642813549, 513874426, 1027748829, 705979059];
 function Ze(e) {
   const t = e >> 25;
   let n = (e & 33554431) << 5;
-  for (let r = 0; r < _n.length; r++)
-    (t >> r & 1) === 1 && (n ^= _n[r]);
+  for (let r = 0; r < Un.length; r++)
+    (t >> r & 1) === 1 && (n ^= Un[r]);
   return n;
 }
-function Ln(e, t, n = 1) {
+function _n(e, t, n = 1) {
   const r = e.length;
   let i = 1;
   for (let o = 0; o < r; o++) {
@@ -1933,68 +1933,68 @@ function Ln(e, t, n = 1) {
     i = Ze(i) ^ o;
   for (let o = 0; o < 6; o++)
     i = Ze(i);
-  return i ^= n, jt.encode(Dt([i % 2 ** 30], 30, 5, !1));
+  return i ^= n, Dt.encode(qt([i % 2 ** 30], 30, 5, !1));
 }
-function ur(e) {
-  const t = e === "bech32" ? 1 : 734539939, n = Ce(5), r = n.decode, i = n.encode, o = In(r);
-  function s(f, l, d = 90) {
+function lr(e) {
+  const t = e === "bech32" ? 1 : 734539939, n = Se(5), r = n.decode, i = n.encode, o = Cn(r);
+  function s(f, u, d = 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 w = f.length + 7 + l.length;
-    if (d !== !1 && w > d)
-      throw new TypeError(`Length ${w} exceeds limit ${d}`);
-    return f = f.toLowerCase(), `${f}1${jt.encode(l)}${Ln(f, l, t)}`;
-  }
-  function c(f, l = 90) {
+    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 g = f.length + 7 + u.length;
+    if (d !== !1 && g > d)
+      throw new TypeError(`Length ${g} exceeds limit ${d}`);
+    return f = f.toLowerCase(), `${f}1${Dt.encode(u)}${_n(f, u, t)}`;
+  }
+  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 d = f.toLowerCase();
     if (f !== d && f !== f.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
     f = d;
-    const w = f.lastIndexOf("1");
-    if (w === 0 || w === -1)
+    const g = f.lastIndexOf("1");
+    if (g === 0 || g === -1)
       throw new Error('Letter "1" must be present between prefix and data only');
-    const y = f.slice(0, w), h = f.slice(w + 1);
+    const w = f.slice(0, g), h = f.slice(g + 1);
     if (h.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const g = jt.decode(h).slice(0, -6), p = Ln(y, g, t);
+    const y = Dt.decode(h).slice(0, -6), p = _n(w, y, t);
     if (!h.endsWith(p))
       throw new Error(`Invalid checksum in ${f}: expected "${p}"`);
-    return { prefix: y, words: g };
+    return { prefix: w, words: y };
   }
-  const a = In(c);
-  function u(f) {
-    const { prefix: l, words: d } = c(f, !1);
-    return { prefix: l, words: d, bytes: r(d) };
+  const a = Cn(c);
+  function l(f) {
+    const { prefix: u, words: d } = c(f, !1);
+    return { prefix: u, words: d, bytes: r(d) };
   }
-  return { encode: s, decode: c, decodeToBytes: u, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: o, toWords: i };
+  return { encode: s, decode: c, decodeToBytes: l, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: o, toWords: i };
 }
-const De = ur("bech32");
-ur("bech32m");
+const De = lr("bech32");
+lr("bech32m");
 const bo = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, vo = de(Ce(4), ge("0123456789abcdef"), pe(""), ar((e) => {
+}, vo = fe(Se(4), he("0123456789abcdef"), de(""), ar((e) => {
   if (typeof e != "string" || e.length % 2)
     throw new TypeError(`hex.decode: expected string, got ${typeof e} with length ${e.length}`);
   return e.toLowerCase();
-})), xo = {
+})), mo = {
   utf8: bo,
   hex: vo,
-  base16: go,
-  base32: po,
-  base64: he,
-  base64url: yo,
-  base58: ut,
+  base16: yo,
+  base32: go,
+  base64: ue,
+  base64url: po,
+  base58: ct,
   base58xmr: wo
 };
-`${Object.keys(xo).join(", ")}`;
-function Lt(e) {
+`${Object.keys(mo).join(", ")}`;
+function _t(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
@@ -2002,18 +2002,18 @@ function kn(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
-function mo(e) {
+function Eo(e) {
   return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
 }
 function le(e, ...t) {
-  if (!mo(e))
+  if (!Eo(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)), Eo = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!Eo)
+const F = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), xo = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!xo)
   throw new Error("Non little-endian hardware is not supported");
 function Ao(e, t) {
   if (t == null || typeof t != "object")
@@ -2028,19 +2028,19 @@ function So(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Bo = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Se = 16, No = 283;
-function tn(e) {
-  return e << 1 ^ No & -(e >> 7);
+const Ko = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ee = 16, Bo = 283;
+function en(e) {
+  return e << 1 ^ Bo & -(e >> 7);
 }
-function Oe(e, t) {
+function Pe(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
-    n ^= e & -(t & 1), e = tn(e);
+    n ^= e & -(t & 1), e = en(e);
   return n;
 }
-const Vt = /* @__PURE__ */ (() => {
+const jt = /* @__PURE__ */ (() => {
   let e = new Uint8Array(256);
-  for (let n = 0, r = 1; n < 256; n++, r ^= tn(r))
+  for (let n = 0, r = 1; n < 256; n++, r ^= en(r))
     e[n] = r;
   const t = new Uint8Array(256);
   t[0] = 99;
@@ -2049,21 +2049,21 @@ const Vt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), Co = /* @__PURE__ */ Vt.map((e, t) => Vt.indexOf(t)), Uo = (e) => e << 24 | e >>> 8, kt = (e) => e << 8 | e >>> 24;
-function lr(e, t) {
+})(), No = /* @__PURE__ */ jt.map((e, t) => jt.indexOf(t)), Co = (e) => e << 24 | e >>> 8, kt = (e) => e << 8 | e >>> 24;
+function ur(e, t) {
   if (e.length !== 256)
     throw new Error("Wrong sbox length");
-  const n = new Uint32Array(256).map((u, f) => t(e[f])), r = n.map(kt), i = r.map(kt), o = i.map(kt), s = new Uint32Array(256 * 256), c = new Uint32Array(256 * 256), a = new Uint16Array(256 * 256);
-  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), o = i.map(kt), s = 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], c[l] = i[u] ^ o[f], a[l] = e[u] << 8 | e[f];
+      const u = l * 256 + f;
+      s[u] = n[l] ^ r[f], c[u] = i[l] ^ o[f], a[u] = e[l] << 8 | e[f];
     }
   return { sbox: e, sbox2: a, T0: n, T1: r, T2: i, T3: o, T01: s, T23: c };
 }
-const nn = /* @__PURE__ */ lr(Vt, (e) => Oe(e, 3) << 24 | e << 16 | e << 8 | Oe(e, 2)), fr = /* @__PURE__ */ lr(Co, (e) => Oe(e, 11) << 24 | Oe(e, 13) << 16 | Oe(e, 9) << 8 | Oe(e, 14)), Io = /* @__PURE__ */ (() => {
+const tn = /* @__PURE__ */ ur(jt, (e) => Pe(e, 3) << 24 | e << 16 | e << 8 | Pe(e, 2)), fr = /* @__PURE__ */ ur(No, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), Io = /* @__PURE__ */ (() => {
   const e = new Uint8Array(16);
-  for (let t = 0, n = 1; t < 16; t++, n = tn(n))
+  for (let t = 0, n = 1; t < 16; t++, n = en(n))
     e[t] = n;
   return e;
 })();
@@ -2072,55 +2072,55 @@ function hr(e) {
   const t = e.length;
   if (![16, 24, 32].includes(t))
     throw new Error(`aes: wrong key size: should be 16, 24 or 32, got: ${t}`);
-  const { sbox2: n } = nn, r = Z(e), i = r.length, o = (c) => oe(n, c, c, c, c), s = new Uint32Array(t + 28);
+  const { sbox2: n } = tn, r = F(e), i = r.length, o = (c) => se(n, c, c, c, c), s = new Uint32Array(t + 28);
   s.set(r);
   for (let c = i; c < s.length; c++) {
     let a = s[c - 1];
-    c % i === 0 ? a = o(Uo(a)) ^ Io[c / i - 1] : i > 6 && c % i === 4 && (a = o(a)), s[c] = s[c - i] ^ a;
+    c % i === 0 ? a = o(Co(a)) ^ Io[c / i - 1] : i > 6 && c % i === 4 && (a = o(a)), s[c] = s[c - i] ^ a;
   }
   return s;
 }
-function Ko(e) {
-  const t = hr(e), n = t.slice(), r = t.length, { sbox2: i } = nn, { T0: o, T1: s, T2: c, T3: a } = fr;
-  for (let u = 0; u < r; u += 4)
+function Uo(e) {
+  const t = hr(e), n = t.slice(), r = t.length, { sbox2: i } = tn, { T0: o, T1: s, T2: c, T3: a } = fr;
+  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 = oe(i, f, f, f, f);
-    n[u] = o[l & 255] ^ s[l >>> 8 & 255] ^ c[l >>> 16 & 255] ^ a[l >>> 24];
+  for (let l = 4; l < r - 4; l++) {
+    const f = n[l], u = se(i, f, f, f, f);
+    n[l] = o[u & 255] ^ s[u >>> 8 & 255] ^ c[u >>> 16 & 255] ^ a[u >>> 24];
   }
   return n;
 }
-function Ae(e, t, n, r, i, o) {
+function me(e, t, n, r, i, o) {
   return e[n << 8 & 65280 | r >>> 8 & 255] ^ t[i >>> 8 & 65280 | o >>> 24 & 255];
 }
-function oe(e, t, n, r, i) {
+function se(e, t, n, r, i) {
   return e[t & 255 | n & 65280] | e[r >>> 16 & 255 | i >>> 16 & 65280] << 16;
 }
-function Tn(e, t, n, r, i) {
-  const { sbox2: o, T01: s, T23: c } = nn;
+function Ln(e, t, n, r, i) {
+  const { sbox2: o, T01: s, T23: c } = tn;
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
-  const u = e.length / 4 - 2;
-  for (let y = 0; y < u; y++) {
-    const h = e[a++] ^ Ae(s, c, t, n, r, i), g = e[a++] ^ Ae(s, c, n, r, i, t), p = e[a++] ^ Ae(s, c, r, i, t, n), m = e[a++] ^ Ae(s, c, i, t, n, r);
-    t = h, n = g, r = p, i = m;
+  const l = e.length / 4 - 2;
+  for (let w = 0; w < l; w++) {
+    const h = e[a++] ^ me(s, c, t, n, r, i), y = e[a++] ^ me(s, c, n, r, i, t), p = e[a++] ^ me(s, c, r, i, t, n), E = e[a++] ^ me(s, c, i, t, n, r);
+    t = h, n = y, r = p, i = E;
   }
-  const f = e[a++] ^ oe(o, t, n, r, i), l = e[a++] ^ oe(o, n, r, i, t), d = e[a++] ^ oe(o, r, i, t, n), w = e[a++] ^ oe(o, i, t, n, r);
-  return { s0: f, s1: l, s2: d, s3: w };
+  const f = e[a++] ^ se(o, t, n, r, i), u = e[a++] ^ se(o, n, r, i, t), d = e[a++] ^ se(o, r, i, t, n), g = e[a++] ^ se(o, i, t, n, r);
+  return { s0: f, s1: u, s2: d, s3: g };
 }
 function _o(e, t, n, r, i) {
   const { sbox2: o, T01: s, T23: c } = fr;
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
-  const u = e.length / 4 - 2;
-  for (let y = 0; y < u; y++) {
-    const h = e[a++] ^ Ae(s, c, t, i, r, n), g = e[a++] ^ Ae(s, c, n, t, i, r), p = e[a++] ^ Ae(s, c, r, n, t, i), m = e[a++] ^ Ae(s, c, i, r, n, t);
-    t = h, n = g, r = p, i = m;
+  const l = e.length / 4 - 2;
+  for (let w = 0; w < l; w++) {
+    const h = e[a++] ^ me(s, c, t, i, r, n), y = e[a++] ^ me(s, c, n, t, i, r), p = e[a++] ^ me(s, c, r, n, t, i), E = e[a++] ^ me(s, c, i, r, n, t);
+    t = h, n = y, r = p, i = E;
   }
-  const f = e[a++] ^ oe(o, t, i, r, n), l = e[a++] ^ oe(o, n, t, i, r), d = e[a++] ^ oe(o, r, n, t, i), w = e[a++] ^ oe(o, i, r, n, t);
-  return { s0: f, s1: l, s2: d, s3: w };
+  const f = e[a++] ^ se(o, t, i, r, n), u = e[a++] ^ se(o, n, t, i, r), d = e[a++] ^ se(o, r, n, t, i), g = e[a++] ^ se(o, i, r, n, t);
+  return { s0: f, s1: u, s2: d, s3: g };
 }
 function dr(e, t) {
   if (!t)
@@ -2129,24 +2129,24 @@ function dr(e, t) {
     throw new Error(`aes: wrong destination length, expected at least ${e}, got: ${t.length}`);
   return t;
 }
-function Lo(e) {
-  if (le(e), e.length % Se !== 0)
-    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Se}`);
+function ko(e) {
+  if (le(e), e.length % Ee !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ee}`);
 }
-function ko(e, t, n) {
+function Lo(e, t, n) {
   let r = e.length;
-  const i = r % Se;
+  const i = r % Ee;
   if (!t && i !== 0)
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
-  const o = Z(e);
+  const o = F(e);
   if (t) {
-    let a = Se - i;
-    a || (a = Se), r = r + a;
+    let a = Ee - i;
+    a || (a = Ee), r = r + a;
   }
-  const s = dr(r, n), c = Z(s);
+  const s = dr(r, n), c = F(s);
   return { b: o, o: c, out: s };
 }
-function To(e, t) {
+function $o(e, t) {
   if (!t)
     return e;
   const n = e.length;
@@ -2161,116 +2161,116 @@ function To(e, t) {
       throw new Error("aes/pcks5: wrong padding");
   return i;
 }
-function $o(e) {
-  const t = new Uint8Array(16), n = Z(t);
+function To(e) {
+  const t = new Uint8Array(16), n = F(t);
   t.set(e);
-  const r = Se - e.length;
-  for (let i = Se - r; i < Se; i++)
+  const r = Ee - e.length;
+  for (let i = Ee - r; i < Ee; i++)
     t[i] = r;
   return n;
 }
-const gr = /* @__PURE__ */ Bo({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
+const yr = /* @__PURE__ */ Ko({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
   le(t), le(n, 16);
   const i = !r.disablePadding;
   return {
     encrypt: (o, s) => {
-      const c = hr(t), { b: a, o: u, out: f } = ko(o, i, s), l = Z(n);
-      let d = l[0], w = l[1], y = l[2], h = l[3], g = 0;
-      for (; g + 4 <= a.length; )
-        d ^= a[g + 0], w ^= a[g + 1], y ^= a[g + 2], h ^= a[g + 3], { s0: d, s1: w, s2: y, s3: h } = Tn(c, d, w, y, h), u[g++] = d, u[g++] = w, u[g++] = y, u[g++] = h;
+      const c = hr(t), { b: a, o: l, out: f } = Lo(o, i, s), u = F(n);
+      let d = u[0], g = u[1], w = u[2], h = u[3], y = 0;
+      for (; y + 4 <= a.length; )
+        d ^= a[y + 0], g ^= a[y + 1], w ^= a[y + 2], h ^= a[y + 3], { s0: d, s1: g, s2: w, s3: h } = Ln(c, d, g, w, h), l[y++] = d, l[y++] = g, l[y++] = w, l[y++] = h;
       if (i) {
-        const p = $o(o.subarray(g * 4));
-        d ^= p[0], w ^= p[1], y ^= p[2], h ^= p[3], { s0: d, s1: w, s2: y, s3: h } = Tn(c, d, w, y, h), u[g++] = d, u[g++] = w, u[g++] = y, u[g++] = h;
+        const p = To(o.subarray(y * 4));
+        d ^= p[0], g ^= p[1], w ^= p[2], h ^= p[3], { s0: d, s1: g, s2: w, s3: h } = Ln(c, d, g, w, h), l[y++] = d, l[y++] = g, l[y++] = w, l[y++] = h;
       }
       return c.fill(0), f;
     },
     decrypt: (o, s) => {
-      Lo(o);
-      const c = Ko(t), a = Z(n), u = dr(o.length, s), f = Z(o), l = Z(u);
-      let d = a[0], w = a[1], y = a[2], h = a[3];
-      for (let g = 0; g + 4 <= f.length; ) {
-        const p = d, m = w, B = y, _ = h;
-        d = f[g + 0], w = f[g + 1], y = f[g + 2], h = f[g + 3];
-        const { s0: U, s1: x, s2: E, s3: A } = _o(c, d, w, y, h);
-        l[g++] = U ^ p, l[g++] = x ^ m, l[g++] = E ^ B, l[g++] = A ^ _;
+      ko(o);
+      const c = Uo(t), a = F(n), l = dr(o.length, s), f = F(o), u = F(l);
+      let d = a[0], g = a[1], w = a[2], h = a[3];
+      for (let y = 0; y + 4 <= f.length; ) {
+        const p = d, E = g, K = w, _ = h;
+        d = f[y + 0], g = f[y + 1], w = f[y + 2], h = f[y + 3];
+        const { s0: C, s1: m, s2: x, s3: A } = _o(c, d, g, w, h);
+        u[y++] = C ^ p, u[y++] = m ^ E, u[y++] = x ^ K, u[y++] = A ^ _;
       }
-      return c.fill(0), To(u, i);
+      return c.fill(0), $o(l, i);
     }
   };
-}), pr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Ro = pr("expand 16-byte k"), Po = pr("expand 32-byte k"), Oo = Z(Ro), yr = Z(Po);
-yr.slice();
-function k(e, t) {
+}), gr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Ro = gr("expand 16-byte k"), Po = gr("expand 32-byte k"), Oo = F(Ro), pr = F(Po);
+pr.slice();
+function L(e, t) {
   return e << t | e >>> 32 - t;
 }
-function zt(e) {
+function Vt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Qe = 64, Ho = 16, wr = 2 ** 32 - 1, $n = new Uint32Array();
-function Mo(e, t, n, r, i, o, s, c) {
-  const a = i.length, u = new Uint8Array(Qe), f = Z(u), l = zt(i) && zt(o), d = l ? Z(i) : $n, w = l ? Z(o) : $n;
-  for (let y = 0; y < a; s++) {
+const Xe = 64, Mo = 16, wr = 2 ** 32 - 1, $n = new Uint32Array();
+function Ho(e, t, n, r, i, o, s, c) {
+  const a = i.length, l = new Uint8Array(Xe), f = F(l), u = Vt(i) && Vt(o), d = u ? F(i) : $n, g = u ? F(o) : $n;
+  for (let w = 0; w < a; s++) {
     if (e(t, n, r, f, s, c), s >= wr)
       throw new Error("arx: counter overflow");
-    const h = Math.min(Qe, a - y);
-    if (l && h === Qe) {
-      const g = y / 4;
-      if (y % 4 !== 0)
+    const h = Math.min(Xe, a - w);
+    if (u && h === Xe) {
+      const y = w / 4;
+      if (w % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let p = 0, m; p < Ho; p++)
-        m = g + p, w[m] = d[m] ^ f[p];
-      y += Qe;
+      for (let p = 0, E; p < Mo; p++)
+        E = y + p, g[E] = d[E] ^ f[p];
+      w += Xe;
       continue;
     }
-    for (let g = 0, p; g < h; g++)
-      p = y + g, o[p] = i[p] ^ u[g];
-    y += h;
+    for (let y = 0, p; y < h; y++)
+      p = w + y, o[p] = i[p] ^ l[y];
+    w += h;
   }
 }
 function qo(e, t) {
   const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: o, rounds: s } = Ao({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
-  return Lt(i), Lt(s), kn(o), kn(n), (c, a, u, f, l = 0) => {
-    le(c), le(a), le(u);
-    const d = u.length;
-    if (f || (f = new Uint8Array(d)), le(f), Lt(l), l < 0 || l >= wr)
+  return _t(i), _t(s), kn(o), kn(n), (c, a, l, f, u = 0) => {
+    le(c), le(a), le(l);
+    const d = l.length;
+    if (f || (f = new Uint8Array(d)), le(f), _t(u), u < 0 || u >= wr)
       throw new Error("arx: counter overflow");
     if (f.length < d)
       throw new Error(`arx: output (${f.length}) is shorter than data (${d})`);
-    const w = [];
-    let y = c.length, h, g;
-    if (y === 32)
-      h = c.slice(), w.push(h), g = yr;
-    else if (y === 16 && n)
-      h = new Uint8Array(32), h.set(c), h.set(c, 16), g = Oo, w.push(h);
+    const g = [];
+    let w = c.length, h, y;
+    if (w === 32)
+      h = c.slice(), g.push(h), y = pr;
+    else if (w === 16 && n)
+      h = new Uint8Array(32), h.set(c), h.set(c, 16), y = Oo, g.push(h);
     else
-      throw new Error(`arx: invalid 32-byte key, got length=${y}`);
-    zt(a) || (a = a.slice(), w.push(a));
-    const p = Z(h);
+      throw new Error(`arx: invalid 32-byte key, got length=${w}`);
+    Vt(a) || (a = a.slice(), g.push(a));
+    const p = F(h);
     if (r) {
       if (a.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(g, p, Z(a.subarray(0, 16)), p), a = a.subarray(16);
+      r(y, p, F(a.subarray(0, 16)), p), a = a.subarray(16);
     }
-    const m = 16 - i;
-    if (m !== a.length)
-      throw new Error(`arx: nonce must be ${m} or 16 bytes`);
-    if (m !== 12) {
+    const E = 16 - i;
+    if (E !== a.length)
+      throw new Error(`arx: nonce must be ${E} or 16 bytes`);
+    if (E !== 12) {
       const _ = new Uint8Array(12);
-      _.set(a, o ? 0 : 12 - a.length), a = _, w.push(a);
+      _.set(a, o ? 0 : 12 - a.length), a = _, g.push(a);
     }
-    const B = Z(a);
-    for (Mo(e, g, p, B, u, f, l, s); w.length > 0; )
-      w.pop().fill(0);
+    const K = F(a);
+    for (Ho(e, y, p, K, l, f, u, s); g.length > 0; )
+      g.pop().fill(0);
     return f;
   };
 }
 function Do(e, t, n, r, i, o = 20) {
-  let s = e[0], c = e[1], a = e[2], u = e[3], f = t[0], l = t[1], d = t[2], w = t[3], y = t[4], h = t[5], g = t[6], p = t[7], m = i, B = n[0], _ = n[1], U = n[2], x = s, E = c, A = a, O = u, K = f, N = l, $ = d, R = w, H = y, b = h, v = g, S = p, I = m, C = B, L = _, P = U;
-  for (let Y = 0; Y < o; Y += 2)
-    x = x + K | 0, I = k(I ^ x, 16), H = H + I | 0, K = k(K ^ H, 12), x = x + K | 0, I = k(I ^ x, 8), H = H + I | 0, K = k(K ^ H, 7), E = E + N | 0, C = k(C ^ E, 16), b = b + C | 0, N = k(N ^ b, 12), E = E + N | 0, C = k(C ^ E, 8), b = b + C | 0, N = k(N ^ b, 7), A = A + $ | 0, L = k(L ^ A, 16), v = v + L | 0, $ = k($ ^ v, 12), A = A + $ | 0, L = k(L ^ A, 8), v = v + L | 0, $ = k($ ^ v, 7), O = O + R | 0, P = k(P ^ O, 16), S = S + P | 0, R = k(R ^ S, 12), O = O + R | 0, P = k(P ^ O, 8), S = S + P | 0, R = k(R ^ S, 7), x = x + N | 0, P = k(P ^ x, 16), v = v + P | 0, N = k(N ^ v, 12), x = x + N | 0, P = k(P ^ x, 8), v = v + P | 0, N = k(N ^ v, 7), E = E + $ | 0, I = k(I ^ E, 16), S = S + I | 0, $ = k($ ^ S, 12), E = E + $ | 0, I = k(I ^ E, 8), S = S + I | 0, $ = k($ ^ S, 7), A = A + R | 0, C = k(C ^ A, 16), H = H + C | 0, R = k(R ^ H, 12), A = A + R | 0, C = k(C ^ A, 8), H = H + C | 0, R = k(R ^ H, 7), O = O + K | 0, L = k(L ^ O, 16), b = b + L | 0, K = k(K ^ b, 12), O = O + K | 0, L = k(L ^ O, 8), b = b + L | 0, K = k(K ^ b, 7);
-  let T = 0;
-  r[T++] = s + x | 0, r[T++] = c + E | 0, r[T++] = a + A | 0, r[T++] = u + O | 0, r[T++] = f + K | 0, r[T++] = l + N | 0, r[T++] = d + $ | 0, r[T++] = w + R | 0, r[T++] = y + H | 0, r[T++] = h + b | 0, r[T++] = g + v | 0, r[T++] = p + S | 0, r[T++] = m + I | 0, r[T++] = B + C | 0, r[T++] = _ + L | 0, r[T++] = U + P | 0;
+  let s = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], d = t[2], g = t[3], w = t[4], h = t[5], y = t[6], p = t[7], E = i, K = n[0], _ = n[1], C = n[2], m = s, x = c, A = a, O = l, U = f, B = u, T = d, R = g, H = w, b = h, v = y, S = p, I = E, N = K, k = _, P = C;
+  for (let X = 0; X < o; X += 2)
+    m = m + U | 0, I = L(I ^ m, 16), H = H + I | 0, U = L(U ^ H, 12), m = m + U | 0, I = L(I ^ m, 8), H = H + I | 0, U = L(U ^ H, 7), x = x + B | 0, N = L(N ^ x, 16), b = b + N | 0, B = L(B ^ b, 12), x = x + B | 0, N = L(N ^ x, 8), b = b + N | 0, B = L(B ^ b, 7), A = A + T | 0, k = L(k ^ A, 16), v = v + k | 0, T = L(T ^ v, 12), A = A + T | 0, k = L(k ^ A, 8), v = v + k | 0, T = L(T ^ v, 7), O = O + R | 0, P = L(P ^ O, 16), S = S + P | 0, R = L(R ^ S, 12), O = O + R | 0, P = L(P ^ O, 8), S = S + P | 0, R = L(R ^ S, 7), m = m + B | 0, P = L(P ^ m, 16), v = v + P | 0, B = L(B ^ v, 12), m = m + B | 0, P = L(P ^ m, 8), v = v + P | 0, B = L(B ^ v, 7), x = x + T | 0, I = L(I ^ x, 16), S = S + I | 0, T = L(T ^ S, 12), x = x + T | 0, I = L(I ^ x, 8), S = S + I | 0, T = L(T ^ S, 7), A = A + R | 0, N = L(N ^ A, 16), H = H + N | 0, R = L(R ^ H, 12), A = A + R | 0, N = L(N ^ A, 8), H = H + N | 0, R = L(R ^ H, 7), O = O + U | 0, k = L(k ^ O, 16), b = b + k | 0, U = L(U ^ b, 12), O = O + U | 0, k = L(k ^ O, 8), b = b + k | 0, U = L(U ^ b, 7);
+  let $ = 0;
+  r[$++] = s + m | 0, r[$++] = c + x | 0, r[$++] = a + A | 0, r[$++] = l + O | 0, r[$++] = f + U | 0, r[$++] = u + B | 0, r[$++] = d + T | 0, r[$++] = g + R | 0, r[$++] = w + H | 0, r[$++] = h + b | 0, r[$++] = y + v | 0, r[$++] = p + S | 0, r[$++] = E + I | 0, r[$++] = K + N | 0, r[$++] = _ + k | 0, r[$++] = C + P | 0;
 }
 const br = /* @__PURE__ */ qo(Do, {
   counterRight: !1,
@@ -2279,8 +2279,8 @@ const br = /* @__PURE__ */ qo(Do, {
 });
 class vr extends nr {
   constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, ie.hash(t);
-    const r = Je(n);
+    super(), this.finished = !1, this.destroyed = !1, oe.hash(t);
+    const r = Ge(n);
     if (this.iHash = t.create(), typeof this.iHash.update != "function")
       throw new Error("Expected instance of class which extends utils.Hash");
     this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
@@ -2294,10 +2294,10 @@ class vr extends nr {
     this.oHash.update(o), o.fill(0);
   }
   update(t) {
-    return ie.exists(this), this.iHash.update(t), this;
+    return oe.exists(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    ie.exists(this), ie.bytes(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    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();
   }
   digest() {
     const t = new Uint8Array(this.oHash.outputLen);
@@ -2312,27 +2312,27 @@ class vr extends nr {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const wt = (e, t, n) => new vr(e, t).update(n).digest();
-wt.create = (e, t) => new vr(e, t);
-function rn(e, t, n) {
-  return ie.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), wt(e, Je(n), Je(t));
+const pt = (e, t, n) => new vr(e, t).update(n).digest();
+pt.create = (e, t) => new vr(e, t);
+function nn(e, t, n) {
+  return oe.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), pt(e, Ge(n), Ge(t));
 }
-const Tt = new Uint8Array([0]), Rn = new Uint8Array();
-function xr(e, t, n, r = 32) {
-  if (ie.hash(e), ie.number(r), r > 255 * e.outputLen)
+const Lt = new Uint8Array([0]), Tn = new Uint8Array();
+function mr(e, t, n, r = 32) {
+  if (oe.hash(e), oe.number(r), r > 255 * e.outputLen)
     throw new Error("Length should be <= 255*HashLen");
   const i = Math.ceil(r / e.outputLen);
-  n === void 0 && (n = Rn);
-  const o = new Uint8Array(i * e.outputLen), s = wt.create(e, t), c = s._cloneInto(), a = new Uint8Array(s.outputLen);
-  for (let u = 0; u < i; u++)
-    Tt[0] = u + 1, c.update(u === 0 ? Rn : a).update(n).update(Tt).digestInto(a), o.set(a, e.outputLen * u), s._cloneInto(c);
-  return s.destroy(), c.destroy(), a.fill(0), Tt.fill(0), o.slice(0, r);
+  n === void 0 && (n = Tn);
+  const o = new Uint8Array(i * e.outputLen), s = pt.create(e, t), c = s._cloneInto(), a = new Uint8Array(s.outputLen);
+  for (let l = 0; l < i; l++)
+    Lt[0] = l + 1, c.update(l === 0 ? Tn : a).update(n).update(Lt).digestInto(a), o.set(a, e.outputLen * l), s._cloneInto(c);
+  return s.destroy(), c.destroy(), a.fill(0), Lt.fill(0), o.slice(0, r);
 }
-var jo = Object.defineProperty, q = (e, t) => {
+var jo = Object.defineProperty, D = (e, t) => {
   for (var n in t)
     jo(e, n, { get: t[n], enumerable: !0 });
-}, Pe = Symbol("verified"), Vo = (e) => e instanceof Object;
-function mr(e) {
+}, Te = Symbol("verified"), Vo = (e) => e instanceof Object;
+function Er(e) {
   if (!Vo(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++) {
@@ -2346,31 +2346,31 @@ function mr(e) {
   return !0;
 }
 var zo = {};
-q(zo, {
+D(zo, {
   Queue: () => Go,
-  QueueNode: () => Er,
-  binarySearch: () => on,
+  QueueNode: () => xr,
+  binarySearch: () => rn,
   insertEventIntoAscendingList: () => Wo,
   insertEventIntoDescendingList: () => Fo,
   normalizeURL: () => Zo,
-  utf8Decoder: () => re,
-  utf8Encoder: () => ee
+  utf8Decoder: () => ie,
+  utf8Encoder: () => te
 });
-var re = new TextDecoder("utf-8"), ee = new TextEncoder();
+var ie = new TextDecoder("utf-8"), te = new TextEncoder();
 function Zo(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 Fo(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);
+  const [n, r] = rn(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
   return r || e.splice(n, 0, t), e;
 }
 function Wo(e, t) {
-  const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
+  const [n, r] = rn(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 on(e, t) {
+function rn(e, t) {
   let n = 0, r = e.length - 1;
   for (; n <= r; ) {
     const i = Math.floor((n + r) / 2), o = t(e[i]);
@@ -2380,21 +2380,21 @@ function on(e, t) {
   }
   return [n, !1];
 }
-var Er = class {
+var xr = class {
   constructor(e) {
-    Q(this, "value");
-    Q(this, "next", null);
-    Q(this, "prev", null);
+    ee(this, "value");
+    ee(this, "next", null);
+    ee(this, "prev", null);
     this.value = e;
   }
 }, Go = class {
   constructor() {
-    Q(this, "first");
-    Q(this, "last");
+    ee(this, "first");
+    ee(this, "last");
     this.first = null, this.last = null;
   }
   enqueue(e) {
-    const t = new Er(e);
+    const t = new xr(e);
     return this.last ? this.last === this.first ? (this.last = t, this.last.prev = this.first, this.first.next = t) : (t.prev = this.last, this.last.next = t, this.last = t) : (this.first = t, this.last = t), !0;
   }
   dequeue() {
@@ -2412,55 +2412,55 @@ var Er = class {
     return ze.utils.randomPrivateKey();
   }
   getPublicKey(e) {
-    return D(ze.getPublicKey(e));
+    return M(ze.getPublicKey(e));
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = D(ze.getPublicKey(t)), n.id = nt(n), n.sig = D(ze.sign(nt(n), t)), n[Pe] = !0, n;
+    return n.pubkey = M(ze.getPublicKey(t)), n.id = tt(n), n.sig = M(ze.sign(tt(n), t)), n[Te] = !0, n;
   }
   verifyEvent(e) {
-    if (typeof e[Pe] == "boolean")
-      return e[Pe];
-    const t = nt(e);
+    if (typeof e[Te] == "boolean")
+      return e[Te];
+    const t = tt(e);
     if (t !== e.id)
-      return e[Pe] = !1, !1;
+      return e[Te] = !1, !1;
     try {
       const n = ze.verify(e.sig, t, e.pubkey);
-      return e[Pe] = n, n;
+      return e[Te] = n, n;
     } catch {
-      return e[Pe] = !1, !1;
+      return e[Te] = !1, !1;
     }
   }
 };
 function Yo(e) {
-  if (!mr(e))
+  if (!Er(e))
     throw new Error("can't serialize event with wrong or missing properties");
   return JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content]);
 }
-function nt(e) {
-  let t = Ne(ee.encode(Yo(e)));
-  return D(t);
+function tt(e) {
+  let t = Ae(te.encode(Yo(e)));
+  return M(t);
 }
-var bt = new Jo(), He = bt.generateSecretKey, Ee = bt.getPublicKey, se = bt.finalizeEvent, sn = bt.verifyEvent, Xo = {};
-q(Xo, {
+var wt = new Jo(), Oe = wt.generateSecretKey, Ce = wt.getPublicKey, ae = wt.finalizeEvent, on = wt.verifyEvent, Xo = {};
+D(Xo, {
   Application: () => Xs,
   BadgeAward: () => as,
   BadgeDefinition: () => zs,
-  BlockedRelaysList: () => Ks,
-  BookmarkList: () => Cs,
+  BlockedRelaysList: () => Us,
+  BookmarkList: () => Ns,
   Bookmarksets: () => Ds,
   Calendar: () => oa,
   CalendarEventRSVP: () => sa,
-  ChannelCreation: () => Cr,
-  ChannelHideMessage: () => Kr,
+  ChannelCreation: () => Nr,
+  ChannelHideMessage: () => Ur,
   ChannelMessage: () => Ir,
-  ChannelMetadata: () => Ur,
+  ChannelMetadata: () => Cr,
   ChannelMuteUser: () => _r,
   ClassifiedListing: () => ta,
-  ClientAuth: () => Lr,
-  CommunitiesList: () => Us,
-  CommunityDefinition: () => ua,
-  CommunityPostApproval: () => ys,
+  ClientAuth: () => kr,
+  CommunitiesList: () => Cs,
+  CommunityDefinition: () => la,
+  CommunityPostApproval: () => ps,
   Contacts: () => rs,
   CreateOrUpdateProduct: () => Ws,
   CreateOrUpdateStall: () => Fs,
@@ -2472,54 +2472,54 @@ q(Xo, {
   EncryptedDirectMessage: () => is,
   EncryptedDirectMessages: () => os,
   EventDeletion: () => ss,
-  FileMetadata: () => ls,
-  FileServerPreference: () => Ts,
-  Followsets: () => Hs,
+  FileMetadata: () => us,
+  FileServerPreference: () => $s,
+  Followsets: () => Ms,
   GenericRepost: () => cs,
-  Genericlists: () => Ms,
-  HTTPAuth: () => un,
+  Genericlists: () => Hs,
+  HTTPAuth: () => cn,
   Handlerinformation: () => ca,
   Handlerrecommendation: () => aa,
   Highlights: () => As,
-  InterestsList: () => Ls,
+  InterestsList: () => ks,
   Interestsets: () => Zs,
   JobFeedback: () => vs,
   JobRequest: () => ws,
   JobResult: () => bs,
-  Label: () => ps,
+  Label: () => gs,
   LightningPubRPC: () => Rs,
   LiveChatMessage: () => fs,
   LiveEvent: () => Qs,
   LongFormArticle: () => Gs,
   Metadata: () => es,
   Mutelist: () => Ss,
-  NWCWalletInfo: () => $s,
-  NWCWalletRequest: () => kr,
+  NWCWalletInfo: () => Ts,
+  NWCWalletRequest: () => Lr,
   NWCWalletResponse: () => Ps,
   NostrConnect: () => Os,
-  OpenTimestamps: () => us,
-  Pinlist: () => Bs,
+  OpenTimestamps: () => ls,
+  Pinlist: () => Ks,
   ProblemTracker: () => hs,
   ProfileBadges: () => Vs,
   PublicChatsList: () => Is,
-  Reaction: () => cn,
+  Reaction: () => an,
   RecommendRelay: () => ns,
-  RelayList: () => Ns,
+  RelayList: () => Bs,
   Relaysets: () => qs,
   Report: () => ds,
-  Reporting: () => gs,
-  Repost: () => an,
+  Reporting: () => ys,
+  Repost: () => sn,
   SearchRelaysList: () => _s,
   ShortTextNote: () => ts,
   Time: () => ia,
-  UserEmojiList: () => ks,
+  UserEmojiList: () => Ls,
   UserStatuses: () => ea,
-  Zap: () => Es,
-  ZapGoal: () => xs,
-  ZapRequest: () => ms,
+  Zap: () => xs,
+  ZapGoal: () => ms,
+  ZapRequest: () => Es,
   classifyKind: () => Qo,
-  isEphemeralKind: () => Br,
-  isParameterizedReplaceableKind: () => Nr,
+  isEphemeralKind: () => Kr,
+  isParameterizedReplaceableKind: () => Br,
   isRegularKind: () => Ar,
   isReplaceableKind: () => Sr
 });
@@ -2529,29 +2529,29 @@ function Ar(e) {
 function Sr(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
-function Br(e) {
+function Kr(e) {
   return 2e4 <= e && e < 3e4;
 }
-function Nr(e) {
+function Br(e) {
   return 3e4 <= e && e < 4e4;
 }
 function Qo(e) {
-  return Ar(e) ? "regular" : Sr(e) ? "replaceable" : Br(e) ? "ephemeral" : Nr(e) ? "parameterized" : "unknown";
+  return Ar(e) ? "regular" : Sr(e) ? "replaceable" : Kr(e) ? "ephemeral" : Br(e) ? "parameterized" : "unknown";
 }
-var es = 0, ts = 1, ns = 2, rs = 3, is = 4, os = 4, ss = 5, an = 6, cn = 7, as = 8, cs = 16, Cr = 40, Ur = 41, Ir = 42, Kr = 43, _r = 44, us = 1040, ls = 1063, fs = 1311, hs = 1971, ds = 1984, gs = 1984, ps = 1985, ys = 4550, ws = 5999, bs = 6999, vs = 7e3, xs = 9041, ms = 9734, Es = 9735, As = 9802, Ss = 1e4, Bs = 10001, Ns = 10002, Cs = 10003, Us = 10004, Is = 10005, Ks = 10006, _s = 10007, Ls = 10015, ks = 10030, Ts = 10096, $s = 13194, Rs = 21e3, Lr = 22242, kr = 23194, Ps = 23195, Os = 24133, un = 27235, Hs = 3e4, Ms = 30001, qs = 30002, Ds = 30003, js = 30004, Vs = 30008, zs = 30009, Zs = 30015, Fs = 30017, Ws = 30018, Gs = 30023, Js = 30024, Ys = 30030, Xs = 30078, Qs = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, oa = 31924, sa = 31925, aa = 31989, ca = 31990, ua = 34550, la = {};
-q(la, {
+var es = 0, ts = 1, ns = 2, rs = 3, is = 4, os = 4, ss = 5, sn = 6, an = 7, as = 8, cs = 16, Nr = 40, Cr = 41, Ir = 42, Ur = 43, _r = 44, ls = 1040, us = 1063, fs = 1311, hs = 1971, ds = 1984, ys = 1984, gs = 1985, ps = 4550, ws = 5999, bs = 6999, vs = 7e3, ms = 9041, Es = 9734, xs = 9735, As = 9802, Ss = 1e4, Ks = 10001, Bs = 10002, Ns = 10003, Cs = 10004, Is = 10005, Us = 10006, _s = 10007, ks = 10015, Ls = 10030, $s = 10096, Ts = 13194, Rs = 21e3, kr = 22242, Lr = 23194, Ps = 23195, Os = 24133, cn = 27235, Ms = 3e4, Hs = 30001, qs = 30002, Ds = 30003, js = 30004, Vs = 30008, zs = 30009, Zs = 30015, Fs = 30017, Ws = 30018, Gs = 30023, Js = 30024, Ys = 30030, Xs = 30078, Qs = 30311, ea = 30315, ta = 30402, na = 30403, ra = 31922, ia = 31923, oa = 31924, sa = 31925, aa = 31989, ca = 31990, la = 34550, ua = {};
+D(ua, {
   getHex64: () => ln,
-  getInt: () => Tr,
+  getInt: () => $r,
   getSubscriptionId: () => fa,
   matchEventId: () => ha,
-  matchEventKind: () => ga,
+  matchEventKind: () => ya,
   matchEventPubkey: () => da
 });
 function ln(e, t) {
   let n = t.length + 3, r = e.indexOf(`"${t}":`) + n, i = e.slice(r).indexOf('"') + r + 1;
   return e.slice(i, i + 64);
 }
-function Tr(e, t) {
+function $r(e, t) {
   let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), o = Math.min(i.indexOf(","), i.indexOf("}"));
   return parseInt(i.slice(0, o), 10);
 }
@@ -2574,16 +2574,16 @@ function ha(e, t) {
 function da(e, t) {
   return t === ln(e, "pubkey");
 }
-function ga(e, t) {
-  return t === Tr(e, "kind");
+function ya(e, t) {
+  return t === $r(e, "kind");
 }
-var pa = {};
-q(pa, {
-  makeAuthEvent: () => ya
+var ga = {};
+D(ga, {
+  makeAuthEvent: () => pa
 });
-function ya(e, t) {
+function pa(e, t) {
   return {
-    kind: Lr,
+    kind: kr,
     created_at: Math.floor(Date.now() / 1e3),
     tags: [
       ["relay", e],
@@ -2603,30 +2603,30 @@ try {
 } catch {
 }
 var Fe = {};
-q(Fe, {
-  BECH32_REGEX: () => $r,
-  Bech32MaxSize: () => fn,
-  decode: () => vt,
-  encodeBytes: () => xt,
-  naddrEncode: () => Ba,
+D(Fe, {
+  BECH32_REGEX: () => Tr,
+  Bech32MaxSize: () => un,
+  decode: () => bt,
+  encodeBytes: () => vt,
+  naddrEncode: () => Ka,
   neventEncode: () => Sa,
-  noteEncode: () => Ea,
+  noteEncode: () => xa,
   nprofileEncode: () => Aa,
-  npubEncode: () => ma,
-  nrelayEncode: () => Na,
-  nsecEncode: () => xa
+  npubEncode: () => Ea,
+  nrelayEncode: () => Ba,
+  nsecEncode: () => ma
 });
-var fn = 5e3, $r = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
+var un = 5e3, Tr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
 function va(e) {
   const t = new Uint8Array(4);
   return t[0] = e >> 24 & 255, t[1] = e >> 16 & 255, t[2] = e >> 8 & 255, t[3] = e & 255, t;
 }
-function vt(e) {
-  var i, o, s, c, a, u, f, l;
-  let { prefix: t, words: n } = De.decode(e, fn), r = new Uint8Array(De.fromWords(n));
+function bt(e) {
+  var i, o, s, c, a, l, f, u;
+  let { prefix: t, words: n } = De.decode(e, un), r = new Uint8Array(De.fromWords(n));
   switch (t) {
     case "nprofile": {
-      let d = et(r);
+      let d = Qe(r);
       if (!((i = d[0]) != null && i[0]))
         throw new Error("missing TLV 0 for nprofile");
       if (d[0][0].length !== 32)
@@ -2634,13 +2634,13 @@ function vt(e) {
       return {
         type: "nprofile",
         data: {
-          pubkey: D(d[0][0]),
-          relays: d[1] ? d[1].map((w) => re.decode(w)) : []
+          pubkey: M(d[0][0]),
+          relays: d[1] ? d[1].map((g) => ie.decode(g)) : []
         }
       };
     }
     case "nevent": {
-      let d = et(r);
+      let d = Qe(r);
       if (!((o = d[0]) != null && o[0]))
         throw new Error("missing TLV 0 for nevent");
       if (d[0][0].length !== 32)
@@ -2652,18 +2652,18 @@ function vt(e) {
       return {
         type: "nevent",
         data: {
-          id: D(d[0][0]),
-          relays: d[1] ? d[1].map((w) => re.decode(w)) : [],
-          author: (s = d[2]) != null && s[0] ? D(d[2][0]) : void 0,
-          kind: (c = d[3]) != null && c[0] ? parseInt(D(d[3][0]), 16) : void 0
+          id: M(d[0][0]),
+          relays: d[1] ? d[1].map((g) => ie.decode(g)) : [],
+          author: (s = d[2]) != null && s[0] ? M(d[2][0]) : void 0,
+          kind: (c = d[3]) != null && c[0] ? parseInt(M(d[3][0]), 16) : void 0
         }
       };
     }
     case "naddr": {
-      let d = et(r);
+      let d = Qe(r);
       if (!((a = d[0]) != null && a[0]))
         throw new Error("missing TLV 0 for naddr");
-      if (!((u = d[2]) != null && u[0]))
+      if (!((l = d[2]) != null && l[0]))
         throw new Error("missing TLV 2 for naddr");
       if (d[2][0].length !== 32)
         throw new Error("TLV 2 should be 32 bytes");
@@ -2674,32 +2674,32 @@ function vt(e) {
       return {
         type: "naddr",
         data: {
-          identifier: re.decode(d[0][0]),
-          pubkey: D(d[2][0]),
-          kind: parseInt(D(d[3][0]), 16),
-          relays: d[1] ? d[1].map((w) => re.decode(w)) : []
+          identifier: ie.decode(d[0][0]),
+          pubkey: M(d[2][0]),
+          kind: parseInt(M(d[3][0]), 16),
+          relays: d[1] ? d[1].map((g) => ie.decode(g)) : []
         }
       };
     }
     case "nrelay": {
-      let d = et(r);
-      if (!((l = d[0]) != null && l[0]))
+      let d = Qe(r);
+      if (!((u = d[0]) != null && u[0]))
         throw new Error("missing TLV 0 for nrelay");
       return {
         type: "nrelay",
-        data: re.decode(d[0][0])
+        data: ie.decode(d[0][0])
       };
     }
     case "nsec":
       return { type: t, data: r };
     case "npub":
     case "note":
-      return { type: t, data: D(r) };
+      return { type: t, data: M(r) };
     default:
       throw new Error(`unknown prefix ${t}`);
   }
 }
-function et(e) {
+function Qe(e) {
   let t = {}, n = e;
   for (; n.length > 0; ) {
     let r = n[0], i = n[1], o = n.slice(2, 2 + i);
@@ -2709,56 +2709,56 @@ function et(e) {
   }
   return t;
 }
-function xa(e) {
-  return xt("nsec", e);
-}
 function ma(e) {
-  return xt("npub", W(e));
+  return vt("nsec", e);
 }
 function Ea(e) {
-  return xt("note", W(e));
+  return vt("npub", Y(e));
+}
+function xa(e) {
+  return vt("note", Y(e));
 }
-function Xe(e, t) {
+function Ye(e, t) {
   let n = De.toWords(t);
-  return De.encode(e, n, fn);
+  return De.encode(e, n, un);
 }
-function xt(e, t) {
-  return Xe(e, t);
+function vt(e, t) {
+  return Ye(e, t);
 }
 function Aa(e) {
   let t = mt({
-    0: [W(e.pubkey)],
-    1: (e.relays || []).map((n) => ee.encode(n))
+    0: [Y(e.pubkey)],
+    1: (e.relays || []).map((n) => te.encode(n))
   });
-  return Xe("nprofile", t);
+  return Ye("nprofile", t);
 }
 function Sa(e) {
   let t;
   e.kind !== void 0 && (t = va(e.kind));
   let n = mt({
-    0: [W(e.id)],
-    1: (e.relays || []).map((r) => ee.encode(r)),
-    2: e.author ? [W(e.author)] : [],
+    0: [Y(e.id)],
+    1: (e.relays || []).map((r) => te.encode(r)),
+    2: e.author ? [Y(e.author)] : [],
     3: t ? [new Uint8Array(t)] : []
   });
-  return Xe("nevent", n);
+  return Ye("nevent", n);
 }
-function Ba(e) {
+function Ka(e) {
   let t = new ArrayBuffer(4);
   new DataView(t).setUint32(0, e.kind, !1);
   let n = mt({
-    0: [ee.encode(e.identifier)],
-    1: (e.relays || []).map((r) => ee.encode(r)),
-    2: [W(e.pubkey)],
+    0: [te.encode(e.identifier)],
+    1: (e.relays || []).map((r) => te.encode(r)),
+    2: [Y(e.pubkey)],
     3: [new Uint8Array(t)]
   });
-  return Xe("naddr", n);
+  return Ye("naddr", n);
 }
-function Na(e) {
+function Ba(e) {
   let t = mt({
-    0: [ee.encode(e)]
+    0: [te.encode(e)]
   });
-  return Xe("nrelay", t);
+  return Ye("nrelay", t);
 }
 function mt(e) {
   let t = [];
@@ -2767,40 +2767,40 @@ function mt(e) {
       let o = new Uint8Array(i.length + 2);
       o.set([parseInt(n)], 0), o.set([i.length], 1), o.set(i, 2), t.push(o);
     });
-  }), pt(...t);
+  }), yt(...t);
 }
-var Ca = {};
-q(Ca, {
-  decrypt: () => Ua,
+var Na = {};
+D(Na, {
+  decrypt: () => Ca,
   encrypt: () => Rr
 });
 async function Rr(e, t, n) {
-  const r = e instanceof Uint8Array ? D(e) : e, i = Le.getSharedSecret(r, "02" + t), o = Pr(i);
-  let s = Uint8Array.from(ir(16)), c = ee.encode(n), a = gr(o, s).encrypt(c), u = he.encode(new Uint8Array(a)), f = he.encode(new Uint8Array(s.buffer));
-  return `${u}?iv=${f}`;
+  const r = e instanceof Uint8Array ? M(e) : e, i = Ue.getSharedSecret(r, "02" + t), o = Pr(i);
+  let s = Uint8Array.from(ir(16)), c = te.encode(n), a = yr(o, s).encrypt(c), l = ue.encode(new Uint8Array(a)), f = ue.encode(new Uint8Array(s.buffer));
+  return `${l}?iv=${f}`;
 }
-async function Ua(e, t, n) {
-  const r = e instanceof Uint8Array ? D(e) : e;
-  let [i, o] = n.split("?iv="), s = Le.getSharedSecret(r, "02" + t), c = Pr(s), a = he.decode(o), u = he.decode(i), f = gr(c, a).decrypt(u);
-  return re.decode(f);
+async function Ca(e, t, n) {
+  const r = e instanceof Uint8Array ? M(e) : e;
+  let [i, o] = n.split("?iv="), s = Ue.getSharedSecret(r, "02" + t), c = Pr(s), a = ue.decode(o), l = ue.decode(i), f = yr(c, a).decrypt(l);
+  return ie.decode(f);
 }
 function Pr(e) {
   return e.slice(1, 33);
 }
 var Ia = {};
-q(Ia, {
+D(Ia, {
   NIP05_REGEX: () => Or,
-  isValid: () => La,
-  queryProfile: () => Hr,
+  isValid: () => ka,
+  queryProfile: () => Mr,
   searchDomain: () => _a,
-  useFetchImplementation: () => Ka
+  useFetchImplementation: () => Ua
 });
 var Or = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Et;
 try {
   Et = fetch;
 } catch {
 }
-function Ka(e) {
+function Ua(e) {
   Et = e;
 }
 async function _a(e, t = "") {
@@ -2811,7 +2811,7 @@ async function _a(e, t = "") {
     return {};
   }
 }
-async function Hr(e) {
+async function Mr(e) {
   var o;
   const t = e.match(Or);
   if (!t)
@@ -2825,15 +2825,15 @@ async function Hr(e) {
     return null;
   }
 }
-async function La(e, t) {
-  let n = await Hr(t);
+async function ka(e, t) {
+  let n = await Mr(t);
   return n ? n.pubkey === e : !1;
 }
-var ka = {};
-q(ka, {
-  parse: () => Ta
+var La = {};
+D(La, {
+  parse: () => $a
 });
-function Ta(e) {
+function $a(e) {
   const t = {
     reply: void 0,
     root: void 0,
@@ -2846,46 +2846,46 @@ function Ta(e) {
       relays: r[2] ? [r[2]] : []
     });
   for (let r = 0; r < n.length; r++) {
-    const i = n[r], [o, s, c, a] = i, u = {
+    const i = n[r], [o, s, c, a] = i, l = {
       id: s,
       relays: c ? [c] : []
-    }, f = r === 0, l = r === n.length - 1;
+    }, f = r === 0, u = r === n.length - 1;
     if (a === "root") {
-      t.root = u;
+      t.root = l;
       continue;
     }
     if (a === "reply") {
-      t.reply = u;
+      t.reply = l;
       continue;
     }
     if (a === "mention") {
-      t.mentions.push(u);
+      t.mentions.push(l);
       continue;
     }
     if (f) {
-      t.root = u;
+      t.root = l;
       continue;
     }
-    if (l) {
-      t.reply = u;
+    if (u) {
+      t.reply = l;
       continue;
     }
-    t.mentions.push(u);
+    t.mentions.push(l);
   }
   return t;
 }
-var $a = {};
-q($a, {
+var Ta = {};
+D(Ta, {
   fetchRelayInformation: () => Pa,
   useFetchImplementation: () => Ra
 });
-var Mr;
+var Hr;
 try {
-  Mr = fetch;
+  Hr = fetch;
 } catch {
 }
 function Ra(e) {
-  Mr = e;
+  Hr = e;
 }
 async function Pa(e) {
   return await (await fetch(e.replace("ws://", "http://").replace("wss://", "https://"), {
@@ -2893,9 +2893,9 @@ async function Pa(e) {
   })).json();
 }
 var Oa = {};
-q(Oa, {
+D(Oa, {
   getPow: () => qr,
-  minePow: () => Ha
+  minePow: () => Ma
 });
 function qr(e) {
   let t = 0;
@@ -2910,26 +2910,26 @@ function qr(e) {
   }
   return t;
 }
-function Ha(e, t) {
+function Ma(e, t) {
   let n = 0;
   const r = e, i = ["nonce", n.toString(), t.toString()];
   for (r.tags.push(i); ; ) {
     const o = Math.floor((/* @__PURE__ */ new Date()).getTime() / 1e3);
-    if (o !== r.created_at && (n = 0, r.created_at = o), i[1] = (++n).toString(), r.id = nt(r), qr(r.id) >= t)
+    if (o !== r.created_at && (n = 0, r.created_at = o), i[1] = (++n).toString(), r.id = tt(r), qr(r.id) >= t)
       break;
   }
   return r;
 }
-var Ma = {};
-q(Ma, {
+var Ha = {};
+D(Ha, {
   finishRepostEvent: () => qa,
   getRepostedEvent: () => Da,
   getRepostedEventPointer: () => Dr
 });
 function qa(e, t, n, r) {
-  return se(
+  return ae(
     {
-      kind: an,
+      kind: sn,
       tags: [...e.tags ?? [], ["e", t.id, n], ["p", t.pubkey]],
       content: e.content === "" ? "" : JSON.stringify(t),
       created_at: e.created_at
@@ -2938,7 +2938,7 @@ function qa(e, t, n, r) {
   );
 }
 function Dr(e) {
-  if (e.kind !== an)
+  if (e.kind !== sn)
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -2962,40 +2962,40 @@ function Da(e, { skipVerification: t } = {}) {
   } catch {
     return;
   }
-  if (r.id === n.id && !(!t && !sn(r)))
+  if (r.id === n.id && !(!t && !on(r)))
     return r;
 }
 var ja = {};
-q(ja, {
-  NOSTR_URI_REGEX: () => At,
+D(ja, {
+  NOSTR_URI_REGEX: () => xt,
   parse: () => za,
   test: () => Va
 });
-var At = new RegExp(`nostr:(${$r.source})`);
+var xt = new RegExp(`nostr:(${Tr.source})`);
 function Va(e) {
-  return typeof e == "string" && new RegExp(`^${At.source}$`).test(e);
+  return typeof e == "string" && new RegExp(`^${xt.source}$`).test(e);
 }
 function za(e) {
-  const t = e.match(new RegExp(`^${At.source}$`));
+  const t = e.match(new RegExp(`^${xt.source}$`));
   if (!t)
     throw new Error(`Invalid Nostr URI: ${e}`);
   return {
     uri: t[0],
     value: t[1],
-    decoded: vt(t[1])
+    decoded: bt(t[1])
   };
 }
 var Za = {};
-q(Za, {
+D(Za, {
   finishReactionEvent: () => Fa,
   getReactedEventPointer: () => Wa
 });
 function Fa(e, t, n) {
   const r = t.tags.filter((i) => i.length >= 2 && (i[0] === "e" || i[0] === "p"));
-  return se(
+  return ae(
     {
       ...e,
-      kind: cn,
+      kind: an,
       tags: [...e.tags ?? [], ...r, ["e", t.id], ["p", t.pubkey]],
       content: e.content ?? "+"
     },
@@ -3003,7 +3003,7 @@ function Fa(e, t, n) {
   );
 }
 function Wa(e) {
-  if (e.kind !== cn)
+  if (e.kind !== an)
     return;
   let t, n;
   for (let r = e.tags.length - 1; r >= 0 && (t === void 0 || n === void 0); r--) {
@@ -3018,21 +3018,21 @@ function Wa(e) {
     };
 }
 var Ga = {};
-q(Ga, {
+D(Ga, {
   matchAll: () => Ja,
-  regex: () => hn,
+  regex: () => fn,
   replaceAll: () => Ya
 });
-var hn = () => new RegExp(`\\b${At.source}\\b`, "g");
+var fn = () => new RegExp(`\\b${xt.source}\\b`, "g");
 function* Ja(e) {
-  const t = e.matchAll(hn());
+  const t = e.matchAll(fn());
   for (const n of t)
     try {
       const [r, i] = n;
       yield {
         uri: r,
         value: i,
-        decoded: vt(i),
+        decoded: bt(i),
         start: n.index,
         end: n.index + r.length
       };
@@ -3040,14 +3040,14 @@ function* Ja(e) {
     }
 }
 function Ya(e, t) {
-  return e.replaceAll(hn(), (n, r) => t({
+  return e.replaceAll(fn(), (n, r) => t({
     uri: n,
     value: r,
-    decoded: vt(r)
+    decoded: bt(r)
   }));
 }
 var Xa = {};
-q(Xa, {
+D(Xa, {
   channelCreateEvent: () => Qa,
   channelHideMessageEvent: () => nc,
   channelMessageEvent: () => tc,
@@ -3062,9 +3062,9 @@ var Qa = (e, t) => {
     n = e.content;
   else
     return;
-  return se(
+  return ae(
     {
-      kind: Cr,
+      kind: Nr,
       tags: [...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3079,9 +3079,9 @@ var Qa = (e, t) => {
     n = e.content;
   else
     return;
-  return se(
+  return ae(
     {
-      kind: Ur,
+      kind: Cr,
       tags: [["e", e.channel_create_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3090,7 +3090,7 @@ var Qa = (e, t) => {
   );
 }, tc = (e, t) => {
   const n = [["e", e.channel_create_event_id, e.relay_url, "root"]];
-  return e.reply_to_channel_message_event_id && n.push(["e", e.reply_to_channel_message_event_id, e.relay_url, "reply"]), se(
+  return e.reply_to_channel_message_event_id && n.push(["e", e.reply_to_channel_message_event_id, e.relay_url, "reply"]), ae(
     {
       kind: Ir,
       tags: [...n, ...e.tags ?? []],
@@ -3107,9 +3107,9 @@ var Qa = (e, t) => {
     n = e.content;
   else
     return;
-  return se(
+  return ae(
     {
-      kind: Kr,
+      kind: Ur,
       tags: [["e", e.channel_message_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
@@ -3124,7 +3124,7 @@ var Qa = (e, t) => {
     n = e.content;
   else
     return;
-  return se(
+  return ae(
     {
       kind: _r,
       tags: [["p", e.pubkey_to_mute], ...e.tags ?? []],
@@ -3134,15 +3134,15 @@ var Qa = (e, t) => {
     t
   );
 }, ic = {};
-q(ic, {
+D(ic, {
   EMOJI_SHORTCODE_REGEX: () => jr,
   matchAll: () => oc,
-  regex: () => dn,
+  regex: () => hn,
   replaceAll: () => sc
 });
-var jr = /:(\w+):/, dn = () => new RegExp(`\\B${jr.source}\\B`, "g");
+var jr = /:(\w+):/, hn = () => new RegExp(`\\B${jr.source}\\B`, "g");
 function* oc(e) {
-  const t = e.matchAll(dn());
+  const t = e.matchAll(hn());
   for (const n of t)
     try {
       const [r, i] = n;
@@ -3156,52 +3156,52 @@ function* oc(e) {
     }
 }
 function sc(e, t) {
-  return e.replaceAll(dn(), (n, r) => t({
+  return e.replaceAll(hn(), (n, r) => t({
     shortcode: n,
     name: r
   }));
 }
 var ac = {};
-q(ac, {
+D(ac, {
   useFetchImplementation: () => cc,
-  validateGithub: () => uc
+  validateGithub: () => lc
 });
-var gn;
+var dn;
 try {
-  gn = fetch;
+  dn = fetch;
 } catch {
 }
 function cc(e) {
-  gn = e;
+  dn = e;
 }
-async function uc(e, t, n) {
+async function lc(e, t, n) {
   try {
-    return await (await gn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
+    return await (await dn(`https://gist.github.com/${t}/${n}/raw`)).text() === `Verifying that I control the following Nostr public key: ${e}`;
   } catch {
     return !1;
   }
 }
-var fe = {};
-q(fe, {
+var V = {};
+D(V, {
   decrypt: () => Jr,
   encrypt: () => Gr,
   getConversationKey: () => Zr,
-  v2: () => gc
+  v2: () => yc
 });
 var Vr = 1, zr = 65535;
 function Zr(e, t) {
-  const n = Le.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return rn(Ne, n, "nip44-v2");
+  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return nn(Ae, n, "nip44-v2");
 }
 function Fr(e, t) {
-  const n = xr(Ne, e, t, 76);
+  const n = mr(Ae, e, t, 76);
   return {
     chacha_key: n.subarray(0, 32),
     chacha_nonce: n.subarray(32, 44),
     hmac_key: n.subarray(44, 76)
   };
 }
-function pn(e) {
+function yn(e) {
   if (!Number.isSafeInteger(e) || e < 1)
     throw new Error("expected positive integer");
   if (e <= 32)
@@ -3209,27 +3209,27 @@ function pn(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 lc(e) {
+function uc(e) {
   if (!Number.isSafeInteger(e) || e < Vr || e > zr)
     throw new Error("invalid plaintext size: must be between 1 and 65535 bytes");
   const t = new Uint8Array(2);
   return new DataView(t.buffer).setUint16(0, e, !1), t;
 }
 function fc(e) {
-  const t = ee.encode(e), n = t.length, r = lc(n), i = new Uint8Array(pn(n) - n);
-  return pt(r, t, i);
+  const t = te.encode(e), n = t.length, r = uc(n), i = new Uint8Array(yn(n) - n);
+  return yt(r, t, i);
 }
 function hc(e) {
   const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
-  if (t < Vr || t > zr || n.length !== t || e.length !== 2 + pn(t))
+  if (t < Vr || t > zr || n.length !== t || e.length !== 2 + yn(t))
     throw new Error("invalid padding");
-  return re.decode(n);
+  return ie.decode(n);
 }
 function Wr(e, t, n) {
   if (n.length !== 32)
     throw new Error("AAD associated data must be 32 bytes");
-  const r = pt(n, t);
-  return wt(Ne, e, r);
+  const r = yt(n, t);
+  return pt(Ae, e, r);
 }
 function dc(e) {
   if (typeof e != "string")
@@ -3241,7 +3241,7 @@ function dc(e) {
     throw new Error("unknown encryption version");
   let n;
   try {
-    n = he.decode(e);
+    n = ue.decode(e);
   } catch (o) {
     throw new Error("invalid base64: " + o.message);
   }
@@ -3259,28 +3259,28 @@ function dc(e) {
 }
 function Gr(e, t, n = ir(32)) {
   const { chacha_key: r, chacha_nonce: i, hmac_key: o } = Fr(t, n), s = fc(e), c = br(r, i, s), a = Wr(o, c, n);
-  return he.encode(pt(new Uint8Array([2]), n, c, a));
+  return ue.encode(yt(new Uint8Array([2]), n, c, a));
 }
 function Jr(e, t) {
   const { nonce: n, ciphertext: r, mac: i } = dc(e), { chacha_key: o, chacha_nonce: s, hmac_key: c } = Fr(t, n), a = Wr(c, r, n);
   if (!So(a, i))
     throw new Error("invalid MAC");
-  const u = br(o, s, r);
-  return hc(u);
+  const l = br(o, s, r);
+  return hc(l);
 }
-var gc = {
+var yc = {
   utils: {
     getConversationKey: Zr,
-    calcPaddedLen: pn
+    calcPaddedLen: yn
   },
   encrypt: Gr,
   decrypt: Jr
-}, pc = {};
-q(pc, {
+}, gc = {};
+D(gc, {
   makeNwcRequestEvent: () => wc,
-  parseConnectionString: () => yc
+  parseConnectionString: () => pc
 });
-function yc(e) {
+function pc(e) {
   const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), o = n.get("secret");
   if (!r || !i || !o)
     throw new Error("invalid connection string");
@@ -3293,48 +3293,48 @@ async function wc(e, t, n) {
       invoice: n
     }
   })), o = {
-    kind: kr,
+    kind: Lr,
     created_at: Math.round(Date.now() / 1e3),
     content: i,
     tags: [["p", e]]
   };
-  return se(o, t);
+  return ae(o, t);
 }
 var bc = {};
-q(bc, {
-  getZapEndpoint: () => xc,
+D(bc, {
+  getZapEndpoint: () => mc,
   makeZapReceipt: () => Ac,
-  makeZapRequest: () => mc,
+  makeZapRequest: () => Ec,
   useFetchImplementation: () => vc,
-  validateZapRequest: () => Ec
+  validateZapRequest: () => xc
 });
-var yn;
+var gn;
 try {
-  yn = fetch;
+  gn = fetch;
 } catch {
 }
 function vc(e) {
-  yn = e;
+  gn = e;
 }
-async function xc(e) {
+async function mc(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
       let { words: s } = De.decode(n, 1e3), c = De.fromWords(s);
-      t = re.decode(c);
+      t = ie.decode(c);
     } else if (r) {
       let [s, c] = r.split("@");
       t = new URL(`/.well-known/lnurlp/${s}`, `https://${c}`).toString();
     } else
       return null;
-    let o = await (await yn(t)).json();
+    let o = await (await gn(t)).json();
     if (o.allowsNostr && o.nostrPubkey)
       return o.callback;
   } catch {
   }
   return null;
 }
-function mc({
+function Ec({
   profile: e,
   event: t,
   amount: n,
@@ -3357,16 +3357,16 @@ function mc({
   };
   return t && o.tags.push(["e", t]), o;
 }
-function Ec(e) {
+function xc(e) {
   let t;
   try {
     t = JSON.parse(e);
   } catch {
     return "Invalid zap request JSON.";
   }
-  if (!mr(t))
+  if (!Er(t))
     return "Zap request is not a valid Nostr event.";
-  if (!sn(t))
+  if (!on(t))
     return "Invalid signature on zap request.";
   let n = t.tags.find(([o, s]) => o === "p" && s);
   if (!n)
@@ -3391,9 +3391,9 @@ function Ac({
   return t && s.tags.push(["preimage", t]), s;
 }
 var Sc = {};
-q(Sc, {
-  getToken: () => Bc,
-  hashPayload: () => wn,
+D(Sc, {
+  getToken: () => Kc,
+  hashPayload: () => pn,
   unpackEventFromToken: () => Xr,
   validateEvent: () => ii,
   validateEventKind: () => ei,
@@ -3401,12 +3401,12 @@ q(Sc, {
   validateEventPayloadTag: () => ri,
   validateEventTimestamp: () => Qr,
   validateEventUrlTag: () => ti,
-  validateToken: () => Nc
+  validateToken: () => Bc
 });
 var Yr = "Nostr ";
-async function Bc(e, t, n, r = !1, i) {
+async function Kc(e, t, n, r = !1, i) {
   const o = {
-    kind: un,
+    kind: cn,
     tags: [
       ["u", e],
       ["method", t]
@@ -3414,11 +3414,11 @@ async function Bc(e, t, n, r = !1, i) {
     created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3),
     content: ""
   };
-  i && o.tags.push(["payload", wn(i)]);
+  i && o.tags.push(["payload", pn(i)]);
   const s = await n(o);
-  return (r ? Yr : "") + he.encode(ee.encode(JSON.stringify(s)));
+  return (r ? Yr : "") + ue.encode(te.encode(JSON.stringify(s)));
 }
-async function Nc(e, t, n) {
+async function Bc(e, t, n) {
   const r = await Xr(e).catch((o) => {
     throw o;
   });
@@ -3430,7 +3430,7 @@ async function Xr(e) {
   if (!e)
     throw new Error("Missing token");
   e = e.replace(Yr, "");
-  const t = re.decode(he.decode(e));
+  const t = ie.decode(ue.decode(e));
   if (!t || t.length === 0 || !t.startsWith("{"))
     throw new Error("Invalid token");
   return JSON.parse(t);
@@ -3439,7 +3439,7 @@ function Qr(e) {
   return e.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - e.created_at < 60 : !1;
 }
 function ei(e) {
-  return e.kind === un;
+  return e.kind === cn;
 }
 function ti(e, t) {
   const n = e.tags.find((r) => r[0] === "u");
@@ -3449,19 +3449,19 @@ function ni(e, t) {
   const n = e.tags.find((r) => r[0] === "method");
   return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
 }
-function wn(e) {
-  const t = Ne(ee.encode(JSON.stringify(e)));
-  return D(t);
+function pn(e) {
+  const t = Ae(te.encode(JSON.stringify(e)));
+  return M(t);
 }
 function ri(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
   if (!n)
     return !1;
-  const r = wn(t);
+  const r = pn(t);
   return n.length > 0 && n[1] === r;
 }
 async function ii(e, t, n, r) {
-  if (!sn(e))
+  if (!on(e))
     throw new Error("Invalid nostr event, signature invalid");
   if (!ei(e))
     throw new Error("Invalid nostr event, kind invalid");
@@ -3475,60 +3475,60 @@ async function ii(e, t, n, r) {
     throw new Error("Invalid nostr event, payload tag does not match request body hash");
   return !0;
 }
-const We = 4, Tc = 100;
-var ae = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(ae || {}), ce = /* @__PURE__ */ ((e) => (e[e.Current = 0] = "Current", e[e.Next = 1] = "Next", e))(ce || {});
-function $c(e) {
+const Me = 4, Tc = 100;
+var Nc = /* @__PURE__ */ ((e) => (e[e.Us = 0] = "Us", e[e.Them = 1] = "Them", e))(Nc || {});
+function Rc(e) {
   return JSON.stringify({
-    theirCurrentNostrPublicKey: e.theirCurrentNostrPublicKey,
-    ourCurrentNostrKey: {
+    rootKey: M(e.rootKey),
+    theirNostrPublicKey: e.theirNostrPublicKey,
+    ourCurrentNostrKey: e.ourCurrentNostrKey ? {
       publicKey: e.ourCurrentNostrKey.publicKey,
-      privateKey: D(e.ourCurrentNostrKey.privateKey)
-    },
+      privateKey: M(e.ourCurrentNostrKey.privateKey)
+    } : void 0,
     ourNextNostrKey: {
       publicKey: e.ourNextNostrKey.publicKey,
-      privateKey: D(e.ourNextNostrKey.privateKey)
+      privateKey: M(e.ourNextNostrKey.privateKey)
     },
-    receivingChainKey: D(e.receivingChainKey),
-    nextReceivingChainKey: D(e.nextReceivingChainKey),
-    sendingChainKey: D(e.sendingChainKey),
+    receivingChainKey: e.receivingChainKey ? M(e.receivingChainKey) : void 0,
+    sendingChainKey: e.sendingChainKey ? M(e.sendingChainKey) : void 0,
     sendingChainMessageNumber: e.sendingChainMessageNumber,
     receivingChainMessageNumber: e.receivingChainMessageNumber,
     previousSendingChainMessageCount: e.previousSendingChainMessageCount,
     skippedMessageKeys: Object.fromEntries(
       Object.entries(e.skippedMessageKeys).map(([t, n]) => [
         t,
-        D(n)
+        M(n)
       ])
     )
   });
 }
-function Rc(e) {
+function Pc(e) {
   const t = JSON.parse(e);
   return {
-    theirCurrentNostrPublicKey: t.theirCurrentNostrPublicKey,
-    ourCurrentNostrKey: {
+    rootKey: Y(t.rootKey),
+    theirNostrPublicKey: t.theirNostrPublicKey,
+    ourCurrentNostrKey: t.ourCurrentNostrKey ? {
       publicKey: t.ourCurrentNostrKey.publicKey,
-      privateKey: W(t.ourCurrentNostrKey.privateKey)
-    },
+      privateKey: Y(t.ourCurrentNostrKey.privateKey)
+    } : void 0,
     ourNextNostrKey: {
       publicKey: t.ourNextNostrKey.publicKey,
-      privateKey: W(t.ourNextNostrKey.privateKey)
+      privateKey: Y(t.ourNextNostrKey.privateKey)
     },
-    receivingChainKey: W(t.receivingChainKey),
-    nextReceivingChainKey: W(t.nextReceivingChainKey),
-    sendingChainKey: W(t.sendingChainKey),
+    receivingChainKey: t.receivingChainKey ? Y(t.receivingChainKey) : void 0,
+    sendingChainKey: t.sendingChainKey ? Y(t.sendingChainKey) : void 0,
     sendingChainMessageNumber: t.sendingChainMessageNumber,
     receivingChainMessageNumber: t.receivingChainMessageNumber,
     previousSendingChainMessageCount: t.previousSendingChainMessageCount,
     skippedMessageKeys: Object.fromEntries(
       Object.entries(t.skippedMessageKeys).map(([n, r]) => [
         n,
-        W(r)
+        Y(r)
       ])
     )
   };
 }
-async function* Pc(e) {
+async function* Oc(e) {
   const t = [];
   let n = null;
   const r = e.onMessage((i) => {
@@ -3543,108 +3543,167 @@ async function* Pc(e) {
     r();
   }
 }
-function Cc(e, t = new Uint8Array(32)) {
-  const n = rn(Ne, e, t);
-  return xr(Ne, n, new Uint8Array([1]), 32);
+function Re(e, t = new Uint8Array(32), n = 1) {
+  const r = nn(Ae, e, t), i = [];
+  for (let o = 1; o <= n; o++)
+    i.push(mr(Ae, r, new Uint8Array([o]), 32));
+  return i;
+}
+function Rn(e, t) {
+  return `${e}:${t}`;
 }
+const Cc = 1e3;
 class lt {
   constructor(t, n) {
-    Q(this, "nostrUnsubscribe");
-    Q(this, "nostrNextUnsubscribe");
-    Q(this, "currentInternalSubscriptionId", 0);
-    Q(this, "internalSubscriptions", /* @__PURE__ */ new Map());
-    Q(this, "name", Math.random().toString(36).substring(2, 6));
+    ee(this, "nostrUnsubscribe");
+    ee(this, "nostrNextUnsubscribe");
+    ee(this, "internalSubscriptions", /* @__PURE__ */ new Map());
+    ee(this, "currentInternalSubscriptionId", 0);
+    ee(this, "name");
     this.nostrSubscribe = t, this.state = n, this.name = Math.random().toString(36).substring(2, 6);
   }
   /**
-   * To preserve forward secrecy, do not use long-term keys for channel initialization. Use e.g. InviteLink to exchange session keys.
+   * @param sharedSecret optional, but useful to keep the first chain of messages secure. Unlike the Nostr keys, it can be forgotten after the 1st message in the chain.
+   * @param isInitiator determines which chain key is used for sending vs receiving
    */
-  static init(t, n, r, i) {
-    const o = He(), s = {
-      theirCurrentNostrPublicKey: n,
-      ourCurrentNostrKey: { publicKey: Ee(r), privateKey: r },
-      ourNextNostrKey: { publicKey: Ee(o), privateKey: o },
-      receivingChainKey: new Uint8Array(),
-      nextReceivingChainKey: new Uint8Array(),
-      sendingChainKey: new Uint8Array(),
+  static init(t, n, r, i = new Uint8Array(), o, s = !0) {
+    const c = Oe(), [a, l] = Re(i, V.getConversationKey(c, n), 2);
+    let f, u;
+    s ? (f = { publicKey: Ce(r), privateKey: r }, u = { publicKey: Ce(c), privateKey: c }) : u = { publicKey: Ce(r), privateKey: r };
+    const d = {
+      rootKey: s ? a : i,
+      theirNostrPublicKey: n,
+      ourCurrentNostrKey: f,
+      ourNextNostrKey: u,
+      receivingChainKey: void 0,
+      sendingChainKey: s ? l : void 0,
       sendingChainMessageNumber: 0,
       receivingChainMessageNumber: 0,
       previousSendingChainMessageCount: 0,
       skippedMessageKeys: {}
-    }, c = new lt(t, s);
-    return c.updateTheirCurrentNostrPublicKey(n), i && (c.name = i), c;
+    }, g = new lt(t, d);
+    return o && (g.name = o), console.log(g.name, "initial root key", M(d.rootKey).slice(0, 4)), g;
   }
-  updateTheirCurrentNostrPublicKey(t) {
-    this.state.theirCurrentNostrPublicKey = t, this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.receivingChainKey = this.getNostrSenderKeypair(ae.Them, ce.Current).privateKey, this.state.nextReceivingChainKey = this.getNostrSenderKeypair(ae.Them, ce.Next).privateKey, this.state.sendingChainKey = this.getNostrSenderKeypair(ae.Us, ce.Current).privateKey;
+  send(t) {
+    if (!this.state.theirNostrPublicKey || !this.state.ourCurrentNostrKey)
+      throw new Error("we are not the initiator, so we can't send the first message");
+    const [n, r] = this.ratchetEncrypt(t), i = V.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNostrPublicKey), o = V.encrypt(JSON.stringify(n), i);
+    return ae({
+      content: r,
+      kind: Me,
+      tags: [["header", o]],
+      created_at: Math.floor(Date.now() / 1e3)
+    }, this.state.ourCurrentNostrKey.privateKey);
   }
-  rotateOurCurrentNostrKey() {
-    this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
-    const t = He();
+  onMessage(t) {
+    const n = this.currentInternalSubscriptionId++;
+    return this.internalSubscriptions.set(n, t), this.subscribeToNostrEvents(), () => this.internalSubscriptions.delete(n);
+  }
+  ratchetEncrypt(t) {
+    const [n, r] = Re(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
+    }, V.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] = Re(this.state.receivingChainKey, new Uint8Array([1]), 2);
+    this.state.receivingChainKey = o, this.state.receivingChainMessageNumber++;
+    try {
+      return V.decrypt(n, s);
+    } catch (c) {
+      throw console.error(this.name, "Decryption failed:", c, {
+        messageKey: M(s).slice(0, 4),
+        receivingChainKey: M(this.state.receivingChainKey).slice(0, 4),
+        sendingChainKey: this.state.sendingChainKey && M(this.state.sendingChainKey).slice(0, 4),
+        rootKey: M(this.state.rootKey).slice(0, 4)
+      }), c;
+    }
+  }
+  ratchetStep(t) {
+    this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.theirNostrPublicKey = t;
+    const n = V.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [r, i] = Re(this.state.rootKey, n, 3);
+    this.state.receivingChainKey = i, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
+    const o = Oe();
     this.state.ourNextNostrKey = {
-      publicKey: Ee(t),
-      privateKey: t
+      publicKey: Ce(o),
+      privateKey: o
     };
+    const s = V.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNostrPublicKey), [c, a] = Re(r, s, 3);
+    this.state.rootKey = c, this.state.sendingChainKey = a;
   }
-  getNostrSenderKeypair(t, n) {
-    if (t === ae.Us && n === ce.Next)
-      throw new Error("We don't have their next key");
-    const r = n === ce.Current ? this.state.ourCurrentNostrKey.privateKey : this.state.ourNextNostrKey.privateKey, i = this.state.theirCurrentNostrPublicKey, o = t === ae.Us ? Ee(r) : i, s = Cc(fe.getConversationKey(r, i), W(o));
-    return {
-      publicKey: Ee(s),
-      privateKey: s
-    };
+  skipMessageKeys(t, n) {
+    if (this.state.receivingChainMessageNumber + Cc < t)
+      throw new Error("Too many skipped messages");
+    for (; this.state.receivingChainMessageNumber < t; ) {
+      const [r, i] = Re(this.state.receivingChainKey, new Uint8Array([1]), 2);
+      this.state.receivingChainKey = r;
+      const o = Rn(n, this.state.receivingChainMessageNumber);
+      this.state.skippedMessageKeys[o] = i, this.state.receivingChainMessageNumber++;
+    }
   }
-  nostrSubscribeNext() {
-    const t = this.getNostrSenderKeypair(ae.Them, ce.Next).publicKey, n = this.state.nextReceivingChainKey;
-    this.nostrNextUnsubscribe = this.nostrSubscribe({ authors: [t], kinds: [We] }, (r) => {
-      var o;
-      const i = JSON.parse(fe.decrypt(r.content, n));
-      i.nextPublicKey !== this.state.theirCurrentNostrPublicKey && (this.rotateOurCurrentNostrKey(), this.updateTheirCurrentNostrPublicKey(i.nextPublicKey), (o = this.nostrUnsubscribe) == null || o.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrSubscribeNext()), this.internalSubscriptions.forEach((s) => s({ id: r.id, data: i.data, pubkey: i.nextPublicKey, time: i.time }));
-    });
+  trySkippedMessageKeys(t, n, r) {
+    const i = Rn(r, t.number);
+    if (i in this.state.skippedMessageKeys) {
+      const o = this.state.skippedMessageKeys[i];
+      return delete this.state.skippedMessageKeys[i], V.decrypt(n, o);
+    }
+    return null;
   }
-  subscribeToNostrEvents() {
-    if (this.nostrUnsubscribe)
-      return;
-    const t = this.getNostrSenderKeypair(ae.Them, ce.Current).publicKey, n = this.state.receivingChainKey;
-    this.nostrUnsubscribe = this.nostrSubscribe({ authors: [t], kinds: [We] }, (r) => {
-      const i = JSON.parse(fe.decrypt(r.content, n));
-      i.nextPublicKey !== this.state.theirCurrentNostrPublicKey && this.updateTheirCurrentNostrPublicKey(i.nextPublicKey), this.internalSubscriptions.forEach((o) => o({ id: r.id, data: i.data, pubkey: i.nextPublicKey, time: i.time }));
-    }), this.nostrSubscribeNext();
+  decryptHeader(t) {
+    const n = t.tags[0][1];
+    if (this.state.ourCurrentNostrKey) {
+      const i = V.getConversationKey(this.state.ourCurrentNostrKey.privateKey, t.pubkey);
+      try {
+        return [JSON.parse(V.decrypt(n, i)), !1];
+      } catch {
+      }
+    }
+    const r = V.getConversationKey(this.state.ourNextNostrKey.privateKey, t.pubkey);
+    try {
+      return [JSON.parse(V.decrypt(n, r)), !0];
+    } catch {
+    }
+    throw new Error("Failed to decrypt header with both current and next secrets");
   }
-  onMessage(t) {
-    const n = this.currentInternalSubscriptionId++;
-    return this.internalSubscriptions.set(n, t), this.subscribeToNostrEvents(), () => this.internalSubscriptions.delete(n);
+  handleNostrEvent(t) {
+    var o;
+    const [n, r] = this.decryptHeader(t);
+    this.state.theirNostrPublicKey !== n.nextPublicKey && (this.state.theirNostrPublicKey = n.nextPublicKey, (o = this.nostrUnsubscribe) == null || o.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
+      { authors: [this.state.theirNostrPublicKey], kinds: [Me] },
+      (s) => this.handleNostrEvent(s)
+    )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey));
+    const i = this.ratchetDecrypt(n, t.content, t.pubkey);
+    this.internalSubscriptions.forEach((s) => s({ id: t.id, data: i, pubkey: n.nextPublicKey, time: n.time }));
   }
-  send(t) {
-    const n = {
-      number: this.state.sendingChainMessageNumber,
-      data: t,
-      nextPublicKey: this.state.ourNextNostrKey.publicKey,
-      time: Date.now()
-    };
-    this.state.sendingChainMessageNumber++;
-    const r = this.getNostrSenderKeypair(ae.Us, ce.Current).privateKey, i = fe.encrypt(JSON.stringify(n), this.state.sendingChainKey);
-    return se({
-      content: i,
-      kind: We,
-      tags: [],
-      created_at: Math.floor(Date.now() / 1e3)
-    }, r);
+  subscribeToNostrEvents() {
+    this.nostrNextUnsubscribe || (this.state.theirNostrPublicKey && (this.nostrUnsubscribe = this.nostrSubscribe(
+      { authors: [this.state.theirNostrPublicKey], kinds: [Me] },
+      (t) => this.handleNostrEvent(t)
+    )), this.nostrNextUnsubscribe = this.nostrSubscribe(
+      { authors: [this.state.theirNostrPublicKey], kinds: [Me] },
+      (t) => this.handleNostrEvent(t)
+    ));
   }
 }
 new TextDecoder("utf-8");
 new TextEncoder();
-function tt(e, t) {
-  const n = Le.getSharedSecret(e, "02" + t).subarray(1, 33);
-  return rn(Ne, n, "nip44-v2");
+function et(e, t) {
+  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
+  return nn(Ae, n, "nip44-v2");
 }
-class rt {
+class nt {
   constructor(t, n, r, i, o, s, c = []) {
     this.inviterSessionPublicKey = t, this.linkSecret = n, this.inviter = r, this.inviterSessionPrivateKey = i, this.label = o, this.maxUses = s, this.usedBy = c;
   }
   static createNew(t, n, r) {
-    const i = He(), o = Ee(i), s = ut.encode(He()).slice(8, 40);
-    return new rt(
+    const i = Oe(), o = Ce(i), s = ct.encode(Oe()).slice(8, 40);
+    return new nt(
       o,
       s,
       t,
@@ -3664,12 +3723,12 @@ class rt {
       throw new Error("Decoded inviter is not a string");
     if (typeof c.data != "string")
       throw new Error("Decoded session key is not a string");
-    const a = s.data, u = c.data;
-    return new rt(u, o, a);
+    const a = s.data, l = c.data;
+    return new nt(l, o, a);
   }
   static deserialize(t) {
     const n = JSON.parse(t);
-    return new rt(
+    return new nt(
       n.inviterSessionPublicKey,
       n.linkSecret,
       n.inviter,
@@ -3710,36 +3769,36 @@ class rt {
        * so the inviter can create the channel on their side.
        */
   async acceptInvite(t, n, r) {
-    const i = He(), o = Ee(i), s = this.inviter || this.inviterSessionPublicKey, c = lt.init(t, this.inviterSessionPublicKey, i), a = He(), u = Ee(a), f = typeof r == "function" ? r : (w, y) => Promise.resolve(fe.encrypt(w, tt(r, y))), l = {
+    const i = Oe(), o = Ce(i), s = this.inviter || this.inviterSessionPublicKey, c = lt.init(t, this.inviterSessionPublicKey, i, new Uint8Array(), void 0, !0), a = Oe(), l = Ce(a), f = typeof r == "function" ? r : (g, w) => Promise.resolve(V.encrypt(g, et(r, w))), u = {
       pubkey: n,
       tags: [["secret", this.linkSecret]],
       content: await f(o, s),
       created_at: Math.floor(Date.now() / 1e3)
     }, d = {
-      kind: We,
-      pubkey: u,
-      content: fe.encrypt(JSON.stringify(l), tt(a, this.inviterSessionPublicKey)),
+      kind: Me,
+      pubkey: l,
+      content: V.encrypt(JSON.stringify(u), et(a, this.inviterSessionPublicKey)),
       created_at: Math.floor(Date.now() / 1e3),
       tags: [["p", this.inviterSessionPublicKey]]
     };
-    return { channel: c, event: se(d, a) };
+    return { channel: c, event: ae(d, a) };
   }
   listen(t, n, r) {
     if (!this.inviterSessionPrivateKey)
       throw new Error("Inviter session key is not available");
     const i = {
-      kinds: [We],
+      kinds: [Me],
       "#p": [this.inviterSessionPublicKey]
     };
     return n(i, async (o) => {
       try {
-        const s = await fe.decrypt(o.content, tt(this.inviterSessionPrivateKey, o.pubkey)), c = JSON.parse(s);
-        if (!c.tags || !c.tags.some(([l, d]) => l === "secret" && d === this.linkSecret)) {
+        const s = await V.decrypt(o.content, et(this.inviterSessionPrivateKey, o.pubkey)), c = JSON.parse(s);
+        if (!c.tags || !c.tags.some(([d, g]) => d === "secret" && g === this.linkSecret)) {
           console.error("Invalid secret from event", o);
           return;
         }
-        const u = await (typeof t == "function" ? t : (l, d) => Promise.resolve(fe.decrypt(l, tt(t, d))))(c.content, c.pubkey), f = lt.init(n, u, this.inviterSessionPrivateKey);
-        r(f, c.pubkey);
+        const l = await (typeof t == "function" ? t : (d, g) => Promise.resolve(V.decrypt(d, et(t, g))))(c.content, c.pubkey), f = o.id, u = lt.init(n, l, this.inviterSessionPrivateKey, new Uint8Array(), f, !1);
+        r(u, c.pubkey);
       } catch (s) {
         console.error("Error processing invite message:", s);
       }
@@ -3748,13 +3807,13 @@ class rt {
 }
 export {
   lt as Channel,
-  We as EVENT_KIND,
-  rt as InviteLink,
-  ce as KeyType,
+  Me as EVENT_KIND,
+  nt as InviteLink,
   Tc as MAX_SKIP,
-  ae as Sender,
-  Pc as createMessageStream,
-  Rc as deserializeChannelState,
-  Cc as kdf,
-  $c as serializeChannelState
+  Nc as Sender,
+  Oc as createMessageStream,
+  Pc as deserializeChannelState,
+  Re as kdf,
+  Rc as serializeChannelState,
+  Rn as skippedMessageIndexKey
 };