nostr-double-ratchet 0.0.19 → 0.0.21

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

@@ -1,17 +1,17 @@
-var bi = Object.defineProperty;
-var vi = (e, t, n) => t in e ? bi(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var te = (e, t, n) => vi(e, typeof t != "symbol" ? t + "" : t, n);
+var vi = Object.defineProperty;
+var Ei = (e, t, n) => t in e ? vi(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var te = (e, t, n) => Ei(e, typeof t != "symbol" ? t + "" : t, n);
 function Kn(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function zn(e, ...t) {
+function Vn(e, ...t) {
   if (!(e instanceof Uint8Array))
     throw new Error("Expected Uint8Array");
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
 }
-function Ei(e) {
+function mi(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
   Kn(e.outputLen), Kn(e.blockLen);
@@ -22,16 +22,16 @@ function et(e, t = !0) {
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function mi(e, t) {
-  zn(e);
+function xi(e, t) {
+  Vn(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const xt = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Vn = (e) => e instanceof Uint8Array, St = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, xi = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!xi)
+const Wn = (e) => e instanceof Uint8Array, Nt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), re = (e, t) => e << 32 - t | e >>> t, Ni = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!Ni)
   throw new Error("Non little-endian hardware is not supported");
 function Si(e) {
   if (typeof e != "string")
@@ -39,43 +39,43 @@ function Si(e) {
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Zt(e) {
-  if (typeof e == "string" && (e = Si(e)), !Vn(e))
+  if (typeof e == "string" && (e = Si(e)), !Wn(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
-function Ni(...e) {
+function Ai(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
-    if (!Vn(r))
+    if (!Wn(r))
       throw new Error("Uint8Array expected");
     t.set(r, n), n += r.length;
   }), t;
 }
-let Wn = class {
+let Zn = class {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 };
-function Ai(e) {
+function Ki(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 Zn(e = 32) {
+function Gn(e = 32) {
   if (xt && typeof xt.getRandomValues == "function")
     return xt.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
 }
-function Ki(e, t, n, r) {
+function Ci(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
   const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), c = Number(n & s), a = r ? 4 : 0, l = r ? 0 : 4;
   e.setUint32(t + a, o, r), e.setUint32(t + l, c, r);
 }
-let Ci = class extends Wn {
+let Bi = class extends Zn {
   constructor(t, n, r, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = St(this.buffer);
+    super(), this.blockLen = t, this.outputLen = n, this.padOffset = r, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = Nt(this.buffer);
   }
   update(t) {
     et(this);
@@ -85,7 +85,7 @@ let Ci = class extends Wn {
     for (let o = 0; o < s; ) {
       const c = Math.min(i - this.pos, s - o);
       if (c === i) {
-        const a = St(t);
+        const a = Nt(t);
         for (; i <= s - o; o += i)
           this.process(a, o);
         continue;
@@ -95,14 +95,14 @@ let Ci = class extends Wn {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    et(this), mi(t, this), this.finished = !0;
+    et(this), xi(t, this), this.finished = !0;
     const { buffer: n, view: r, blockLen: i, isLE: s } = this;
     let { pos: o } = this;
     n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(r, 0), o = 0);
     for (let u = o; u < i; u++)
       n[u] = 0;
-    Ki(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
-    const c = St(t), a = this.outputLen;
+    Ci(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    const c = Nt(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
     const l = a / 4, f = this.get();
@@ -123,7 +123,7 @@ let Ci = class extends Wn {
     return t.length = i, t.pos = c, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 };
-const Bi = (e, t, n) => e & t ^ ~e & n, ki = (e, t, n) => e & t ^ e & n ^ t & n, _i = /* @__PURE__ */ new Uint32Array([
+const ki = (e, t, n) => e & t ^ ~e & n, _i = (e, t, n) => e & t ^ e & n ^ t & n, Ii = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -198,7 +198,7 @@ const Bi = (e, t, n) => e & t ^ ~e & n, ki = (e, t, n) => e & t ^ e & n ^ t & n,
   528734635,
   1541459225
 ]), ve = /* @__PURE__ */ new Uint32Array(64);
-let Ii = class extends Ci {
+let Ui = class extends Bi {
   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;
   }
@@ -214,12 +214,12 @@ let Ii = class extends Ci {
     for (let u = 0; u < 16; u++, n += 4)
       ve[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const g = ve[u - 15], b = ve[u - 2], p = re(g, 7) ^ re(g, 18) ^ g >>> 3, h = re(b, 17) ^ re(b, 19) ^ b >>> 10;
-      ve[u] = h + ve[u - 7] + p + ve[u - 16] | 0;
+      const p = ve[u - 15], b = ve[u - 2], y = re(p, 7) ^ re(p, 18) ^ p >>> 3, h = re(b, 17) ^ re(b, 19) ^ b >>> 10;
+      ve[u] = h + ve[u - 7] + y + ve[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const g = re(c, 6) ^ re(c, 11) ^ re(c, 25), b = f + g + Bi(c, a, l) + _i[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + ki(r, i, s) | 0;
+      const p = re(c, 6) ^ re(c, 11) ^ re(c, 25), b = f + p + ki(c, a, l) + Ii[u] + ve[u] | 0, h = (re(r, 2) ^ re(r, 13) ^ re(r, 22)) + _i(r, i, s) | 0;
       f = l, l = a, a = c, c = o + b | 0, o = s, s = i, i = r, r = b + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
@@ -231,18 +231,18 @@ let Ii = class extends Ci {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 };
-const $t = /* @__PURE__ */ Ai(() => new Ii());
+const $t = /* @__PURE__ */ Ki(() => new Ui());
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Gn = BigInt(0), ot = BigInt(1), Ui = BigInt(2), at = (e) => e instanceof Uint8Array, Li = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function De(e) {
+const Fn = BigInt(0), ot = BigInt(1), Li = BigInt(2), at = (e) => e instanceof Uint8Array, $i = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+function qe(e) {
   if (!at(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += Li[e[n]];
+    t += $i[e[n]];
   return t;
 }
-function Fn(e) {
+function Jn(e) {
   const t = e.toString(16);
   return t.length & 1 ? `0${t}` : t;
 }
@@ -251,7 +251,7 @@ function Gt(e) {
     throw new Error("hex string expected, got " + typeof e);
   return BigInt(e === "" ? "0" : `0x${e}`);
 }
-function je(e) {
+function De(e) {
   if (typeof e != "string")
     throw new Error("hex string expected, got " + typeof e);
   const t = e.length;
@@ -267,27 +267,27 @@ function je(e) {
   return n;
 }
 function F(e) {
-  return Gt(De(e));
+  return Gt(qe(e));
 }
 function Ft(e) {
   if (!at(e))
     throw new Error("Uint8Array expected");
-  return Gt(De(Uint8Array.from(e).reverse()));
+  return Gt(qe(Uint8Array.from(e).reverse()));
 }
-function Ne(e, t) {
-  return je(e.toString(16).padStart(t * 2, "0"));
+function Se(e, t) {
+  return De(e.toString(16).padStart(t * 2, "0"));
 }
 function Jt(e, t) {
-  return Ne(e, t).reverse();
+  return Se(e, t).reverse();
 }
-function $i(e) {
-  return je(Fn(e));
+function Ti(e) {
+  return De(Jn(e));
 }
 function W(e, t, n) {
   let r;
   if (typeof t == "string")
     try {
-      r = je(t);
+      r = De(t);
     } catch (s) {
       throw new Error(`${e} must be valid hex string, got "${t}". Cause: ${s}`);
     }
@@ -300,7 +300,7 @@ function W(e, t, n) {
     throw new Error(`${e} expected ${n} bytes, got ${i}`);
   return r;
 }
-function Ie(...e) {
+function _e(...e) {
   const t = new Uint8Array(e.reduce((r, i) => r + i.length, 0));
   let n = 0;
   return e.forEach((r) => {
@@ -309,7 +309,7 @@ function Ie(...e) {
     t.set(r, n), n += r.length;
   }), t;
 }
-function Ti(e, t) {
+function Ri(e, t) {
   if (e.length !== t.length)
     return !1;
   for (let n = 0; n < e.length; n++)
@@ -317,54 +317,54 @@ function Ti(e, t) {
       return !1;
   return !0;
 }
-function Ri(e) {
+function Oi(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
-function Oi(e) {
+function Mi(e) {
   let t;
-  for (t = 0; e > Gn; e >>= ot, t += 1)
+  for (t = 0; e > Fn; e >>= ot, t += 1)
     ;
   return t;
 }
-function Mi(e, t) {
+function Pi(e, t) {
   return e >> BigInt(t) & ot;
 }
-const Pi = (e, t, n) => e | (n ? ot : Gn) << BigInt(t), Yt = (e) => (Ui << BigInt(e - 1)) - ot, Nt = (e) => new Uint8Array(e), Cn = (e) => Uint8Array.from(e);
-function Jn(e, t, n) {
+const Hi = (e, t, n) => e | (n ? ot : Fn) << BigInt(t), Yt = (e) => (Li << BigInt(e - 1)) - ot, St = (e) => new Uint8Array(e), Cn = (e) => Uint8Array.from(e);
+function Yn(e, t, n) {
   if (typeof e != "number" || e < 2)
     throw new Error("hashLen must be a number");
   if (typeof t != "number" || t < 2)
     throw new Error("qByteLen must be a number");
   if (typeof n != "function")
     throw new Error("hmacFn must be a function");
-  let r = Nt(e), i = Nt(e), s = 0;
+  let r = St(e), i = St(e), s = 0;
   const o = () => {
     r.fill(1), i.fill(0), s = 0;
-  }, c = (...u) => n(i, r, ...u), a = (u = Nt()) => {
+  }, c = (...u) => n(i, r, ...u), a = (u = St()) => {
     i = c(Cn([0]), u), r = c(), u.length !== 0 && (i = c(Cn([1]), u), r = c());
   }, l = () => {
     if (s++ >= 1e3)
       throw new Error("drbg: tried 1000 values");
     let u = 0;
-    const g = [];
+    const p = [];
     for (; u < t; ) {
       r = c();
       const b = r.slice();
-      g.push(b), u += r.length;
+      p.push(b), u += r.length;
     }
-    return Ie(...g);
+    return _e(...p);
   };
-  return (u, g) => {
+  return (u, p) => {
     o(), a(u);
     let b;
-    for (; !(b = g(l())); )
+    for (; !(b = p(l())); )
       a();
     return o(), b;
   };
 }
-const Hi = {
+const qi = {
   bigint: (e) => typeof e == "bigint",
   function: (e) => typeof e == "function",
   boolean: (e) => typeof e == "boolean",
@@ -377,7 +377,7 @@ const Hi = {
 };
 function Ye(e, t, n = {}) {
   const r = (i, s, o) => {
-    const c = Hi[s];
+    const c = qi[s];
     if (typeof c != "function")
       throw new Error(`Invalid validator "${s}", expected function`);
     const a = e[i];
@@ -390,37 +390,37 @@ function Ye(e, t, n = {}) {
     r(i, s, !0);
   return e;
 }
-const qi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Di = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  bitGet: Mi,
-  bitLen: Oi,
+  bitGet: Pi,
+  bitLen: Mi,
   bitMask: Yt,
-  bitSet: Pi,
-  bytesToHex: De,
+  bitSet: Hi,
+  bytesToHex: qe,
   bytesToNumberBE: F,
   bytesToNumberLE: Ft,
-  concatBytes: Ie,
-  createHmacDrbg: Jn,
+  concatBytes: _e,
+  createHmacDrbg: Yn,
   ensureBytes: W,
-  equalBytes: Ti,
-  hexToBytes: je,
+  equalBytes: Ri,
+  hexToBytes: De,
   hexToNumber: Gt,
-  numberToBytesBE: Ne,
+  numberToBytesBE: Se,
   numberToBytesLE: Jt,
-  numberToHexUnpadded: Fn,
-  numberToVarBytesBE: $i,
-  utf8ToBytes: Ri,
+  numberToHexUnpadded: Jn,
+  numberToVarBytesBE: Ti,
+  utf8ToBytes: Oi,
   validateObject: Ye
 }, Symbol.toStringTag, { value: "Module" }));
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const z = BigInt(0), j = BigInt(1), Ce = BigInt(2), Di = BigInt(3), Tt = BigInt(4), Bn = BigInt(5), kn = BigInt(8);
+const z = BigInt(0), j = BigInt(1), Ce = BigInt(2), ji = BigInt(3), Tt = BigInt(4), Bn = BigInt(5), kn = BigInt(8);
 BigInt(9);
 BigInt(16);
 function V(e, t) {
   const n = e % t;
   return n >= z ? n : t + n;
 }
-function ji(e, t, n) {
+function zi(e, t, n) {
   if (n <= z || t < z)
     throw new Error("Expected power/modulo > 0");
   if (n === j)
@@ -448,12 +448,12 @@ function Rt(e, t) {
     throw new Error("invert: does not exist");
   return V(i, t);
 }
-function zi(e) {
+function Vi(e) {
   const t = (e - j) / Ce;
   let n, r, i;
   for (n = e - j, r = 0; n % Ce === z; n /= Ce, r++)
     ;
-  for (i = Ce; i < e && ji(i, t, e) !== e - j; i++)
+  for (i = Ce; i < e && zi(i, t, e) !== e - j; i++)
     ;
   if (r === 1) {
     const o = (e + j) / Tt;
@@ -468,21 +468,21 @@ function zi(e) {
   return function(c, a) {
     if (c.pow(a, t) === c.neg(c.ONE))
       throw new Error("Cannot find square root");
-    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, s), g = c.pow(a, n);
-    for (; !c.eql(g, c.ONE); ) {
-      if (c.eql(g, c.ZERO))
+    let l = r, f = c.pow(c.mul(c.ONE, i), n), u = c.pow(a, s), p = c.pow(a, n);
+    for (; !c.eql(p, c.ONE); ) {
+      if (c.eql(p, c.ZERO))
         return c.ZERO;
       let b = 1;
-      for (let h = c.sqr(g); b < l && !c.eql(h, c.ONE); b++)
+      for (let h = c.sqr(p); b < l && !c.eql(h, c.ONE); b++)
         h = c.sqr(h);
-      const p = c.pow(f, j << BigInt(l - b - 1));
-      f = c.sqr(p), u = c.mul(u, p), g = c.mul(g, f), l = b;
+      const y = c.pow(f, j << BigInt(l - b - 1));
+      f = c.sqr(y), u = c.mul(u, y), p = c.mul(p, f), l = b;
     }
     return u;
   };
 }
-function Vi(e) {
-  if (e % Tt === Di) {
+function Wi(e) {
+  if (e % Tt === ji) {
     const t = (e + j) / Tt;
     return function(r, i) {
       const s = r.pow(i, t);
@@ -500,9 +500,9 @@ function Vi(e) {
       return l;
     };
   }
-  return zi(e);
+  return Vi(e);
 }
-const Wi = [
+const Zi = [
   "create",
   "isValid",
   "is0",
@@ -521,16 +521,16 @@ const Wi = [
   "mulN",
   "sqrN"
 ];
-function Zi(e) {
+function Gi(e) {
   const t = {
     ORDER: "bigint",
     MASK: "bigint",
     BYTES: "isSafeInteger",
     BITS: "isSafeInteger"
-  }, n = Wi.reduce((r, i) => (r[i] = "function", r), t);
+  }, n = Zi.reduce((r, i) => (r[i] = "function", r), t);
   return Ye(e, n);
 }
-function Gi(e, t, n) {
+function Fi(e, t, n) {
   if (n < z)
     throw new Error("Expected power > 0");
   if (n === z)
@@ -542,21 +542,21 @@ function Gi(e, t, n) {
     n & j && (r = e.mul(r, i)), i = e.sqr(i), n >>= j;
   return r;
 }
-function Fi(e, t) {
+function Ji(e, t) {
   const n = new Array(t.length), r = t.reduce((s, o, c) => e.is0(o) ? s : (n[c] = s, e.mul(s, o)), e.ONE), i = e.inv(r);
   return t.reduceRight((s, o, c) => e.is0(o) ? s : (n[c] = e.mul(s, n[c]), e.mul(s, o)), i), n;
 }
-function Yn(e, t) {
+function Xn(e, t) {
   const n = t !== void 0 ? t : e.toString(2).length, r = Math.ceil(n / 8);
   return { nBitLength: n, nByteLength: r };
 }
-function Ji(e, t, n = !1, r = {}) {
+function Yi(e, t, n = !1, r = {}) {
   if (e <= z)
     throw new Error(`Expected Field ORDER > 0, got ${e}`);
-  const { nBitLength: i, nByteLength: s } = Yn(e, t);
+  const { nBitLength: i, nByteLength: s } = Xn(e, t);
   if (s > 2048)
     throw new Error("Field lengths over 2048 bytes are not supported");
-  const o = Vi(e), c = Object.freeze({
+  const o = Wi(e), c = Object.freeze({
     ORDER: e,
     BITS: i,
     BYTES: s,
@@ -577,7 +577,7 @@ function Ji(e, t, n = !1, r = {}) {
     add: (a, l) => V(a + l, e),
     sub: (a, l) => V(a - l, e),
     mul: (a, l) => V(a * l, e),
-    pow: (a, l) => Gi(c, a, l),
+    pow: (a, l) => Fi(c, a, l),
     div: (a, l) => V(a * Rt(l, e), e),
     // Same as above, but doesn't normalize
     sqrN: (a) => a * a,
@@ -586,11 +586,11 @@ function Ji(e, t, n = !1, r = {}) {
     mulN: (a, l) => a * l,
     inv: (a) => Rt(a, e),
     sqrt: r.sqrt || ((a) => o(c, a)),
-    invertBatch: (a) => Fi(c, a),
+    invertBatch: (a) => Ji(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, l, f) => f ? l : a,
-    toBytes: (a) => n ? Jt(a, s) : Ne(a, s),
+    toBytes: (a) => n ? Jt(a, s) : Se(a, s),
     fromBytes: (a) => {
       if (a.length !== s)
         throw new Error(`Fp.fromBytes: expected ${s}, got ${a.length}`);
@@ -599,26 +599,26 @@ function Ji(e, t, n = !1, r = {}) {
   });
   return Object.freeze(c);
 }
-function Xn(e) {
+function Qn(e) {
   if (typeof e != "bigint")
     throw new Error("field order must be bigint");
   const t = e.toString(2).length;
   return Math.ceil(t / 8);
 }
-function Qn(e) {
-  const t = Xn(e);
+function er(e) {
+  const t = Qn(e);
   return t + Math.ceil(t / 2);
 }
-function Yi(e, t, n = !1) {
-  const r = e.length, i = Xn(t), s = Qn(t);
+function Xi(e, t, n = !1) {
+  const r = e.length, i = Qn(t), s = er(t);
   if (r < 16 || r < s || r > 1024)
     throw new Error(`expected ${s}-1024 bytes of input, got ${r}`);
   const o = n ? F(e) : Ft(e), c = V(o, t - j) + j;
-  return n ? Jt(c, i) : Ne(c, i);
+  return n ? Jt(c, i) : Se(c, i);
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const Xi = BigInt(0), At = BigInt(1);
-function Qi(e, t) {
+const Qi = BigInt(0), At = BigInt(1);
+function es(e, t) {
   const n = (i, s) => {
     const o = s.negate();
     return i ? o : s;
@@ -631,7 +631,7 @@ function Qi(e, t) {
     // non-const time multiplication ladder
     unsafeLadder(i, s) {
       let o = e.ZERO, c = i;
-      for (; s > Xi; )
+      for (; s > Qi; )
         s & At && (o = o.add(c)), c = c.double(), s >>= At;
       return o;
     },
@@ -650,7 +650,7 @@ function Qi(e, t) {
       let l = i, f = l;
       for (let u = 0; u < o; u++) {
         f = l, a.push(f);
-        for (let g = 1; g < c; g++)
+        for (let p = 1; p < c; p++)
           f = f.add(l), a.push(f);
         l = f.double();
       }
@@ -666,13 +666,13 @@ function Qi(e, t) {
     wNAF(i, s, o) {
       const { windows: c, windowSize: a } = r(i);
       let l = e.ZERO, f = e.BASE;
-      const u = BigInt(2 ** i - 1), g = 2 ** i, b = BigInt(i);
-      for (let p = 0; p < c; p++) {
-        const h = p * a;
+      const u = BigInt(2 ** i - 1), p = 2 ** i, b = BigInt(i);
+      for (let y = 0; y < c; y++) {
+        const h = y * a;
         let d = Number(o & u);
-        o >>= b, d > a && (d -= g, o += At);
-        const y = h, m = h + Math.abs(d) - 1, A = p % 2 !== 0, I = d < 0;
-        d === 0 ? f = f.add(n(A, s[y])) : l = l.add(n(I, s[m]));
+        o >>= b, d > a && (d -= p, o += At);
+        const g = h, m = h + Math.abs(d) - 1, A = y % 2 !== 0, I = d < 0;
+        d === 0 ? f = f.add(n(A, s[g])) : l = l.add(n(I, s[m]));
       }
       return { p: l, f };
     },
@@ -683,8 +683,8 @@ function Qi(e, t) {
     }
   };
 }
-function er(e) {
-  return Zi(e.Fp), Ye(e, {
+function tr(e) {
+  return Gi(e.Fp), Ye(e, {
     n: "bigint",
     h: "bigint",
     Gx: "field",
@@ -693,14 +693,14 @@ function er(e) {
     nBitLength: "isSafeInteger",
     nByteLength: "isSafeInteger"
   }), Object.freeze({
-    ...Yn(e.n, e.nBitLength),
+    ...Xn(e.n, e.nBitLength),
     ...e,
     p: e.Fp.ORDER
   });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function es(e) {
-  const t = er(e);
+function ts(e) {
+  const t = tr(e);
   Ye(t, {
     a: "field",
     b: "field"
@@ -722,7 +722,7 @@ function es(e) {
   }
   return Object.freeze({ ...t });
 }
-const { bytesToNumberBE: ts, hexToBytes: ns } = qi, ke = {
+const { bytesToNumberBE: ns, hexToBytes: rs } = Di, Be = {
   // asn.1 DER encoding utils
   Err: class extends Error {
     constructor(t = "") {
@@ -730,7 +730,7 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, ke = {
     }
   },
   _parseInt(e) {
-    const { Err: t } = ke;
+    const { Err: t } = Be;
     if (e.length < 2 || e[0] !== 2)
       throw new t("Invalid signature integer tag");
     const n = e[1], r = e.subarray(2, n + 2);
@@ -740,10 +740,10 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, ke = {
       throw new t("Invalid signature integer: negative");
     if (r[0] === 0 && !(r[1] & 128))
       throw new t("Invalid signature integer: unnecessary leading zero");
-    return { d: ts(r), l: e.subarray(n + 2) };
+    return { d: ns(r), l: e.subarray(n + 2) };
   },
   toSig(e) {
-    const { Err: t } = ke, n = typeof e == "string" ? ns(e) : e;
+    const { Err: t } = Be, n = typeof e == "string" ? rs(e) : e;
     if (!(n instanceof Uint8Array))
       throw new Error("ui8a expected");
     let r = n.length;
@@ -751,7 +751,7 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, ke = {
       throw new t("Invalid signature tag");
     if (n[1] !== r - 2)
       throw new t("Invalid signature: incorrect length");
-    const { d: i, l: s } = ke._parseInt(n.subarray(2)), { d: o, l: c } = ke._parseInt(s);
+    const { d: i, l: s } = Be._parseInt(n.subarray(2)), { d: o, l: c } = Be._parseInt(s);
     if (c.length)
       throw new t("Invalid signature: left bytes after parsing");
     return { r: i, s: o };
@@ -767,66 +767,66 @@ const { bytesToNumberBE: ts, hexToBytes: ns } = qi, ke = {
 BigInt(2);
 const _n = BigInt(3);
 BigInt(4);
-function rs(e) {
-  const t = es(e), { Fp: n } = t, r = t.toBytes || ((p, h, d) => {
-    const y = h.toAffine();
-    return Ie(Uint8Array.from([4]), n.toBytes(y.x), n.toBytes(y.y));
-  }), i = t.fromBytes || ((p) => {
-    const h = p.subarray(1), d = n.fromBytes(h.subarray(0, n.BYTES)), y = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
-    return { x: d, y };
+function is(e) {
+  const t = ts(e), { Fp: n } = t, r = t.toBytes || ((y, h, d) => {
+    const g = h.toAffine();
+    return _e(Uint8Array.from([4]), n.toBytes(g.x), n.toBytes(g.y));
+  }), i = t.fromBytes || ((y) => {
+    const h = y.subarray(1), d = n.fromBytes(h.subarray(0, n.BYTES)), g = n.fromBytes(h.subarray(n.BYTES, 2 * n.BYTES));
+    return { x: d, y: g };
   });
-  function s(p) {
-    const { a: h, b: d } = t, y = n.sqr(p), m = n.mul(y, p);
-    return n.add(n.add(m, n.mul(p, h)), d);
+  function s(y) {
+    const { a: h, b: d } = t, g = n.sqr(y), m = n.mul(g, y);
+    return n.add(n.add(m, n.mul(y, h)), d);
   }
   if (!n.eql(n.sqr(t.Gy), s(t.Gx)))
     throw new Error("bad generator point: equation left != right");
-  function o(p) {
-    return typeof p == "bigint" && ae < p && p < t.n;
+  function o(y) {
+    return typeof y == "bigint" && ae < y && y < t.n;
   }
-  function c(p) {
-    if (!o(p))
+  function c(y) {
+    if (!o(y))
       throw new Error("Expected valid bigint: 0 < bigint < curve.n");
   }
-  function a(p) {
-    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: y, n: m } = t;
-    if (h && typeof p != "bigint") {
-      if (p instanceof Uint8Array && (p = De(p)), typeof p != "string" || !h.includes(p.length))
+  function a(y) {
+    const { allowedPrivateKeyLengths: h, nByteLength: d, wrapPrivateKey: g, n: m } = t;
+    if (h && typeof y != "bigint") {
+      if (y instanceof Uint8Array && (y = qe(y)), typeof y != "string" || !h.includes(y.length))
         throw new Error("Invalid key");
-      p = p.padStart(d * 2, "0");
+      y = y.padStart(d * 2, "0");
     }
     let A;
     try {
-      A = typeof p == "bigint" ? p : F(W("private key", p, d));
+      A = typeof y == "bigint" ? y : F(W("private key", y, d));
     } catch {
-      throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof p}`);
+      throw new Error(`private key must be ${d} bytes, hex or bigint, not ${typeof y}`);
     }
-    return y && (A = V(A, m)), c(A), A;
+    return g && (A = V(A, m)), c(A), A;
   }
   const l = /* @__PURE__ */ new Map();
-  function f(p) {
-    if (!(p instanceof u))
+  function f(y) {
+    if (!(y instanceof u))
       throw new Error("ProjectivePoint expected");
   }
   class u {
-    constructor(h, d, y) {
-      if (this.px = h, this.py = d, this.pz = y, h == null || !n.isValid(h))
+    constructor(h, d, g) {
+      if (this.px = h, this.py = d, this.pz = g, h == null || !n.isValid(h))
         throw new Error("x required");
       if (d == null || !n.isValid(d))
         throw new Error("y required");
-      if (y == null || !n.isValid(y))
+      if (g == null || !n.isValid(g))
         throw new Error("z required");
     }
     // Does not validate if the point is on-curve.
     // Use fromHex instead, or call assertValidity() later.
     static fromAffine(h) {
-      const { x: d, y } = h || {};
-      if (!h || !n.isValid(d) || !n.isValid(y))
+      const { x: d, y: g } = h || {};
+      if (!h || !n.isValid(d) || !n.isValid(g))
         throw new Error("invalid affine point");
       if (h instanceof u)
         throw new Error("projective point not allowed");
       const m = (A) => n.eql(A, n.ZERO);
-      return m(d) && m(y) ? u.ZERO : new u(d, y, n.ONE);
+      return m(d) && m(g) ? u.ZERO : new u(d, g, n.ONE);
     }
     get x() {
       return this.toAffine().x;
@@ -841,8 +841,8 @@ function rs(e) {
      * Optimization: converts a list of projective points to a list of identical points with Z=1.
      */
     static normalizeZ(h) {
-      const d = n.invertBatch(h.map((y) => y.pz));
-      return h.map((y, m) => y.toAffine(d[m])).map(u.fromAffine);
+      const d = n.invertBatch(h.map((g) => g.pz));
+      return h.map((g, m) => g.toAffine(d[m])).map(u.fromAffine);
     }
     /**
      * Converts hash string or Uint8Array to Point.
@@ -870,8 +870,8 @@ function rs(e) {
       const { x: h, y: d } = this.toAffine();
       if (!n.isValid(h) || !n.isValid(d))
         throw new Error("bad point: x or y not FE");
-      const y = n.sqr(d), m = s(h);
-      if (!n.eql(y, m))
+      const g = n.sqr(d), m = s(h);
+      if (!n.eql(g, m))
         throw new Error("bad point: equation left != right");
       if (!this.isTorsionFree())
         throw new Error("bad point: not in prime-order subgroup");
@@ -887,7 +887,7 @@ function rs(e) {
      */
     equals(h) {
       f(h);
-      const { px: d, py: y, pz: m } = this, { px: A, py: I, pz: B } = h, E = n.eql(n.mul(d, B), n.mul(A, m)), x = n.eql(n.mul(y, B), n.mul(I, m));
+      const { px: d, py: g, pz: m } = this, { px: A, py: I, pz: B } = h, E = n.eql(n.mul(d, B), n.mul(A, m)), x = n.eql(n.mul(g, B), n.mul(I, m));
       return E && x;
     }
     /**
@@ -901,9 +901,9 @@ function rs(e) {
     // https://eprint.iacr.org/2015/1060, algorithm 3
     // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
     double() {
-      const { a: h, b: d } = t, y = n.mul(d, _n), { px: m, py: A, pz: I } = this;
-      let B = n.ZERO, E = n.ZERO, x = n.ZERO, S = n.mul(m, m), P = n.mul(A, A), _ = n.mul(I, I), K = n.mul(m, A);
-      return K = n.add(K, K), x = n.mul(m, I), x = n.add(x, x), B = n.mul(h, x), E = n.mul(y, _), E = n.add(B, E), B = n.sub(P, E), E = n.add(P, E), E = n.mul(B, E), B = n.mul(K, B), x = n.mul(y, x), _ = n.mul(h, _), K = n.sub(S, _), K = n.mul(h, K), K = n.add(K, x), x = n.add(S, S), S = n.add(x, S), S = n.add(S, _), S = n.mul(S, K), E = n.add(E, S), _ = n.mul(A, I), _ = n.add(_, _), S = n.mul(_, K), B = n.sub(B, S), x = n.mul(_, P), x = n.add(x, x), x = n.add(x, x), new u(B, E, x);
+      const { a: h, b: d } = t, g = n.mul(d, _n), { px: m, py: A, pz: I } = this;
+      let B = n.ZERO, E = n.ZERO, x = n.ZERO, N = n.mul(m, m), P = n.mul(A, A), _ = n.mul(I, I), K = n.mul(m, A);
+      return K = n.add(K, K), x = n.mul(m, I), x = n.add(x, x), B = n.mul(h, x), E = n.mul(g, _), E = n.add(B, E), B = n.sub(P, E), E = n.add(P, E), E = n.mul(B, E), B = n.mul(K, B), x = n.mul(g, x), _ = n.mul(h, _), K = n.sub(N, _), K = n.mul(h, K), K = n.add(K, x), x = n.add(N, N), N = n.add(x, N), N = n.add(N, _), N = n.mul(N, K), E = n.add(E, N), _ = n.mul(A, I), _ = n.add(_, _), N = n.mul(_, K), B = n.sub(B, N), x = n.mul(_, P), x = n.add(x, x), x = n.add(x, x), new u(B, E, x);
     }
     // Renes-Costello-Batina exception-free addition formula.
     // There is 30% faster Jacobian formula, but it is not complete.
@@ -911,13 +911,13 @@ function rs(e) {
     // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
     add(h) {
       f(h);
-      const { px: d, py: y, pz: m } = this, { px: A, py: I, pz: B } = h;
-      let E = n.ZERO, x = n.ZERO, S = n.ZERO;
+      const { px: d, py: g, pz: m } = this, { px: A, py: I, pz: B } = h;
+      let E = n.ZERO, x = n.ZERO, N = n.ZERO;
       const P = t.a, _ = n.mul(t.b, _n);
-      let K = n.mul(d, A), T = n.mul(y, I), R = n.mul(m, B), H = n.add(d, y), w = n.add(A, I);
+      let K = n.mul(d, A), T = n.mul(g, I), R = n.mul(m, B), H = n.add(d, g), w = n.add(A, I);
       H = n.mul(H, w), w = n.add(K, T), H = n.sub(H, w), w = n.add(d, m);
       let v = n.add(A, B);
-      return w = n.mul(w, v), v = n.add(K, R), w = n.sub(w, v), v = n.add(y, m), E = n.add(I, B), v = n.mul(v, E), E = n.add(T, R), v = n.sub(v, E), S = n.mul(P, w), E = n.mul(_, R), S = n.add(E, S), E = n.sub(T, S), S = n.add(T, S), x = n.mul(E, S), T = n.add(K, K), T = n.add(T, K), R = n.mul(P, R), w = n.mul(_, w), T = n.add(T, R), R = n.sub(K, R), R = n.mul(P, R), w = n.add(w, R), K = n.mul(T, w), x = n.add(x, K), K = n.mul(v, w), E = n.mul(H, E), E = n.sub(E, K), K = n.mul(H, T), S = n.mul(v, S), S = n.add(S, K), new u(E, x, S);
+      return w = n.mul(w, v), v = n.add(K, R), w = n.sub(w, v), v = n.add(g, m), E = n.add(I, B), v = n.mul(v, E), E = n.add(T, R), v = n.sub(v, E), N = n.mul(P, w), E = n.mul(_, R), N = n.add(E, N), E = n.sub(T, N), N = n.add(T, N), x = n.mul(E, N), T = n.add(K, K), T = n.add(T, K), R = n.mul(P, R), w = n.mul(_, w), T = n.add(T, R), R = n.sub(K, R), R = n.mul(P, R), w = n.add(w, R), K = n.mul(T, w), x = n.add(x, K), K = n.mul(v, w), E = n.mul(H, E), E = n.sub(E, K), K = n.mul(H, T), N = n.mul(v, N), N = n.add(N, K), new u(E, x, N);
     }
     subtract(h) {
       return this.add(h.negate());
@@ -927,8 +927,8 @@ function rs(e) {
     }
     wNAF(h) {
       return b.wNAFCached(this, l, h, (d) => {
-        const y = n.invertBatch(d.map((m) => m.pz));
-        return d.map((m, A) => m.toAffine(y[A])).map(u.fromAffine);
+        const g = n.invertBatch(d.map((m) => m.pz));
+        return d.map((m, A) => m.toAffine(g[A])).map(u.fromAffine);
       });
     }
     /**
@@ -942,13 +942,13 @@ function rs(e) {
         return d;
       if (c(h), h === Y)
         return this;
-      const { endo: y } = t;
-      if (!y)
+      const { endo: g } = t;
+      if (!g)
         return b.unsafeLadder(this, h);
-      let { k1neg: m, k1: A, k2neg: I, k2: B } = y.splitScalar(h), E = d, x = d, S = this;
+      let { k1neg: m, k1: A, k2neg: I, k2: B } = g.splitScalar(h), E = d, x = d, N = this;
       for (; A > ae || B > ae; )
-        A & Y && (E = E.add(S)), B & Y && (x = x.add(S)), S = S.double(), A >>= Y, B >>= Y;
-      return m && (E = E.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, y.beta), x.py, x.pz), E.add(x);
+        A & Y && (E = E.add(N)), B & Y && (x = x.add(N)), N = N.double(), A >>= Y, B >>= Y;
+      return m && (E = E.negate()), I && (x = x.negate()), x = new u(n.mul(x.px, g.beta), x.py, x.pz), E.add(x);
     }
     /**
      * Constant time multiplication.
@@ -961,17 +961,17 @@ function rs(e) {
      */
     multiply(h) {
       c(h);
-      let d = h, y, m;
+      let d = h, g, m;
       const { endo: A } = t;
       if (A) {
         const { k1neg: I, k1: B, k2neg: E, k2: x } = A.splitScalar(d);
-        let { p: S, f: P } = this.wNAF(B), { p: _, f: K } = this.wNAF(x);
-        S = b.constTimeNegate(I, S), _ = b.constTimeNegate(E, _), _ = new u(n.mul(_.px, A.beta), _.py, _.pz), y = S.add(_), m = P.add(K);
+        let { p: N, f: P } = this.wNAF(B), { p: _, f: K } = this.wNAF(x);
+        N = b.constTimeNegate(I, N), _ = b.constTimeNegate(E, _), _ = new u(n.mul(_.px, A.beta), _.py, _.pz), g = N.add(_), m = P.add(K);
       } else {
         const { p: I, f: B } = this.wNAF(d);
-        y = I, m = B;
+        g = I, m = B;
       }
-      return u.normalizeZ([y, m])[0];
+      return u.normalizeZ([g, m])[0];
     }
     /**
      * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -979,17 +979,17 @@ function rs(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, d, y) {
-      const m = u.BASE, A = (B, E) => E === ae || E === Y || !B.equals(m) ? B.multiplyUnsafe(E) : B.multiply(E), I = A(this, d).add(A(h, y));
+    multiplyAndAddUnsafe(h, d, g) {
+      const m = u.BASE, A = (B, E) => E === ae || E === Y || !B.equals(m) ? B.multiplyUnsafe(E) : B.multiply(E), I = A(this, d).add(A(h, g));
       return I.is0() ? void 0 : I;
     }
     // Converts Projective point to affine (x, y) coordinates.
     // Can accept precomputed Z^-1 - for example, from invertBatch.
     // (x, y, z) ∋ (x=x/z, y=y/z)
     toAffine(h) {
-      const { px: d, py: y, pz: m } = this, A = this.is0();
+      const { px: d, py: g, pz: m } = this, A = this.is0();
       h == null && (h = A ? n.ONE : n.inv(m));
-      const I = n.mul(d, h), B = n.mul(y, h), E = n.mul(m, h);
+      const I = n.mul(d, h), B = n.mul(g, h), E = n.mul(m, h);
       if (A)
         return { x: n.ZERO, y: n.ZERO };
       if (!n.eql(E, n.ONE))
@@ -1012,11 +1012,11 @@ function rs(e) {
       return this.assertValidity(), r(u, this, h);
     }
     toHex(h = !0) {
-      return De(this.toRawBytes(h));
+      return qe(this.toRawBytes(h));
     }
   }
   u.BASE = new u(t.Gx, t.Gy, n.ONE), u.ZERO = new u(n.ZERO, n.ONE, n.ZERO);
-  const g = t.nBitLength, b = Qi(u, t.endo ? Math.ceil(g / 2) : g);
+  const p = t.nBitLength, b = es(u, t.endo ? Math.ceil(p / 2) : p);
   return {
     CURVE: t,
     ProjectivePoint: u,
@@ -1025,8 +1025,8 @@ function rs(e) {
     isWithinCurveOrder: o
   };
 }
-function is(e) {
-  const t = er(e);
+function ss(e) {
+  const t = tr(e);
   return Ye(t, {
     hash: "hash",
     hmac: "function",
@@ -1037,8 +1037,8 @@ function is(e) {
     lowS: "boolean"
   }), Object.freeze({ lowS: !0, ...t });
 }
-function ss(e) {
-  const t = is(e), { Fp: n, n: r } = t, i = n.BYTES + 1, s = 2 * n.BYTES + 1;
+function os(e) {
+  const t = ss(e), { Fp: n, n: r } = t, i = n.BYTES + 1, s = 2 * n.BYTES + 1;
   function o(w) {
     return ae < w && w < n.ORDER;
   }
@@ -1048,90 +1048,90 @@ function ss(e) {
   function a(w) {
     return Rt(w, r);
   }
-  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: g } = rs({
+  const { ProjectivePoint: l, normPrivateKeyToScalar: f, weierstrassEquation: u, isWithinCurveOrder: p } = is({
     ...t,
-    toBytes(w, v, N) {
-      const k = v.toAffine(), C = n.toBytes(k.x), U = Ie;
-      return N ? U(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : U(Uint8Array.from([4]), C, n.toBytes(k.y));
+    toBytes(w, v, S) {
+      const k = v.toAffine(), C = n.toBytes(k.x), U = _e;
+      return S ? U(Uint8Array.from([v.hasEvenY() ? 2 : 3]), C) : U(Uint8Array.from([4]), C, n.toBytes(k.y));
     },
     fromBytes(w) {
-      const v = w.length, N = w[0], k = w.subarray(1);
-      if (v === i && (N === 2 || N === 3)) {
+      const v = w.length, S = w[0], k = w.subarray(1);
+      if (v === i && (S === 2 || S === 3)) {
         const C = F(k);
         if (!o(C))
           throw new Error("Point is not on curve");
         const U = u(C);
         let O = n.sqrt(U);
         const $ = (O & Y) === Y;
-        return (N & 1) === 1 !== $ && (O = n.neg(O)), { x: C, y: O };
-      } else if (v === s && N === 4) {
+        return (S & 1) === 1 !== $ && (O = n.neg(O)), { x: C, y: O };
+      } else if (v === s && S === 4) {
         const C = n.fromBytes(k.subarray(0, n.BYTES)), U = n.fromBytes(k.subarray(n.BYTES, 2 * n.BYTES));
         return { x: C, y: U };
       } else
         throw new Error(`Point of length ${v} was invalid. Expected ${i} compressed bytes or ${s} uncompressed bytes`);
     }
-  }), b = (w) => De(Ne(w, t.nByteLength));
-  function p(w) {
+  }), b = (w) => qe(Se(w, t.nByteLength));
+  function y(w) {
     const v = r >> Y;
     return w > v;
   }
   function h(w) {
-    return p(w) ? c(-w) : w;
+    return y(w) ? c(-w) : w;
   }
-  const d = (w, v, N) => F(w.slice(v, N));
-  class y {
-    constructor(v, N, k) {
-      this.r = v, this.s = N, this.recovery = k, this.assertValidity();
+  const d = (w, v, S) => F(w.slice(v, S));
+  class g {
+    constructor(v, S, k) {
+      this.r = v, this.s = S, this.recovery = k, this.assertValidity();
     }
     // pair (bytes of r, bytes of s)
     static fromCompact(v) {
-      const N = t.nByteLength;
-      return v = W("compactSignature", v, N * 2), new y(d(v, 0, N), d(v, N, 2 * N));
+      const S = t.nByteLength;
+      return v = W("compactSignature", v, S * 2), new g(d(v, 0, S), d(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: N, s: k } = ke.toSig(W("DER", v));
-      return new y(N, k);
+      const { r: S, s: k } = Be.toSig(W("DER", v));
+      return new g(S, k);
     }
     assertValidity() {
-      if (!g(this.r))
+      if (!p(this.r))
         throw new Error("r must be 0 < r < CURVE.n");
-      if (!g(this.s))
+      if (!p(this.s))
         throw new Error("s must be 0 < s < CURVE.n");
     }
     addRecoveryBit(v) {
-      return new y(this.r, this.s, v);
+      return new g(this.r, this.s, v);
     }
     recoverPublicKey(v) {
-      const { r: N, s: k, recovery: C } = this, U = x(W("msgHash", v));
+      const { r: S, s: k, recovery: C } = this, U = x(W("msgHash", v));
       if (C == null || ![0, 1, 2, 3].includes(C))
         throw new Error("recovery id invalid");
-      const O = C === 2 || C === 3 ? N + t.n : N;
+      const O = C === 2 || C === 3 ? S + t.n : S;
       if (O >= n.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
-      const $ = C & 1 ? "03" : "02", Q = l.fromHex($ + b(O)), ge = a(O), Le = c(-U * ge), We = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(Q, Le, We);
+      const $ = C & 1 ? "03" : "02", Q = l.fromHex($ + b(O)), ge = a(O), Ue = c(-U * ge), Ve = c(k * ge), we = l.BASE.multiplyAndAddUnsafe(Q, Ue, Ve);
       if (!we)
         throw new Error("point at infinify");
       return we.assertValidity(), we;
     }
     // Signatures should be low-s, to prevent malleability.
     hasHighS() {
-      return p(this.s);
+      return y(this.s);
     }
     normalizeS() {
-      return this.hasHighS() ? new y(this.r, c(-this.s), this.recovery) : this;
+      return this.hasHighS() ? new g(this.r, c(-this.s), this.recovery) : this;
     }
     // DER-encoded
     toDERRawBytes() {
-      return je(this.toDERHex());
+      return De(this.toDERHex());
     }
     toDERHex() {
-      return ke.hexFromSig({ r: this.r, s: this.s });
+      return Be.hexFromSig({ r: this.r, s: this.s });
     }
     // padded bytes of r, then padded bytes of s
     toCompactRawBytes() {
-      return je(this.toCompactHex());
+      return De(this.toCompactHex());
     }
     toCompactHex() {
       return b(this.r) + b(this.s);
@@ -1151,8 +1151,8 @@ function ss(e) {
      * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.
      */
     randomPrivateKey: () => {
-      const w = Qn(t.n);
-      return Yi(t.randomBytes(w), t.n);
+      const w = er(t.n);
+      return Xi(t.randomBytes(w), t.n);
     },
     /**
      * Creates precompute table for an arbitrary EC point. Makes point "cached".
@@ -1170,84 +1170,84 @@ function ss(e) {
     return l.fromPrivateKey(w).toRawBytes(v);
   }
   function I(w) {
-    const v = w instanceof Uint8Array, N = typeof w == "string", k = (v || N) && w.length;
-    return v ? k === i || k === s : N ? k === 2 * i || k === 2 * s : w instanceof l;
+    const v = w instanceof Uint8Array, S = typeof w == "string", k = (v || S) && w.length;
+    return v ? k === i || k === s : S ? k === 2 * i || k === 2 * s : w instanceof l;
   }
-  function B(w, v, N = !0) {
+  function B(w, v, S = !0) {
     if (I(w))
       throw new Error("first arg must be private key");
     if (!I(v))
       throw new Error("second arg must be public key");
-    return l.fromHex(v).multiply(f(w)).toRawBytes(N);
+    return l.fromHex(v).multiply(f(w)).toRawBytes(S);
   }
   const E = t.bits2int || function(w) {
-    const v = F(w), N = w.length * 8 - t.nBitLength;
-    return N > 0 ? v >> BigInt(N) : v;
+    const v = F(w), S = w.length * 8 - t.nBitLength;
+    return S > 0 ? v >> BigInt(S) : v;
   }, x = t.bits2int_modN || function(w) {
     return c(E(w));
-  }, S = Yt(t.nBitLength);
+  }, N = Yt(t.nBitLength);
   function P(w) {
     if (typeof w != "bigint")
       throw new Error("bigint expected");
-    if (!(ae <= w && w < S))
+    if (!(ae <= w && w < N))
       throw new Error(`bigint expected < 2^${t.nBitLength}`);
-    return Ne(w, t.nByteLength);
+    return Se(w, t.nByteLength);
   }
-  function _(w, v, N = K) {
-    if (["recovered", "canonical"].some((Ke) => Ke in N))
+  function _(w, v, S = K) {
+    if (["recovered", "canonical"].some((Ke) => Ke in S))
       throw new Error("sign() legacy options not supported");
     const { hash: k, randomBytes: C } = t;
-    let { lowS: U, prehash: O, extraEntropy: $ } = N;
+    let { lowS: U, prehash: O, extraEntropy: $ } = S;
     U == null && (U = !0), w = W("msgHash", w), O && (w = W("prehashed msgHash", k(w)));
-    const Q = x(w), ge = f(v), Le = [P(ge), P(Q)];
+    const Q = x(w), ge = f(v), Ue = [P(ge), P(Q)];
     if ($ != null) {
       const Ke = $ === !0 ? C(n.BYTES) : $;
-      Le.push(W("extraEntropy", Ke));
+      Ue.push(W("extraEntropy", Ke));
     }
-    const We = Ie(...Le), we = Q;
+    const Ve = _e(...Ue), we = Q;
     function mt(Ke) {
-      const $e = E(Ke);
-      if (!g($e))
+      const Le = E(Ke);
+      if (!p(Le))
         return;
-      const Sn = a($e), Te = l.BASE.multiply($e).toAffine(), ee = c(Te.x);
+      const Nn = a(Le), $e = l.BASE.multiply(Le).toAffine(), ee = c($e.x);
       if (ee === ae)
         return;
-      const Re = c(Sn * c(we + ee * ge));
-      if (Re === ae)
+      const Te = c(Nn * c(we + ee * ge));
+      if (Te === ae)
         return;
-      let Nn = (Te.x === ee ? 0 : 2) | Number(Te.y & Y), An = Re;
-      return U && p(Re) && (An = h(Re), Nn ^= 1), new y(ee, An, Nn);
+      let Sn = ($e.x === ee ? 0 : 2) | Number($e.y & Y), An = Te;
+      return U && y(Te) && (An = h(Te), Sn ^= 1), new g(ee, An, Sn);
     }
-    return { seed: We, k2sig: mt };
+    return { seed: Ve, k2sig: mt };
   }
   const K = { lowS: t.lowS, prehash: !1 }, T = { lowS: t.lowS, prehash: !1 };
-  function R(w, v, N = K) {
-    const { seed: k, k2sig: C } = _(w, v, N), U = t;
-    return Jn(U.hash.outputLen, U.nByteLength, U.hmac)(k, C);
+  function R(w, v, S = K) {
+    const { seed: k, k2sig: C } = _(w, v, S), U = t;
+    return Yn(U.hash.outputLen, U.nByteLength, U.hmac)(k, C);
   }
   l.BASE._setWindowSize(8);
-  function H(w, v, N, k = T) {
-    var Te;
+  function H(w, v, S, k = T) {
+    var $e;
     const C = w;
-    if (v = W("msgHash", v), N = W("publicKey", N), "strict" in k)
+    if (v = W("msgHash", v), S = W("publicKey", S), "strict" in k)
       throw new Error("options.strict was renamed to lowS");
     const { lowS: U, prehash: O } = k;
     let $, Q;
     try {
       if (typeof C == "string" || C instanceof Uint8Array)
         try {
-          $ = y.fromDER(C);
+          $ = g.fromDER(C);
         } catch (ee) {
-          if (!(ee instanceof ke.Err))
+          if (!(ee instanceof Be.Err))
             throw ee;
-          $ = y.fromCompact(C);
+          $ = g.fromCompact(C);
         }
       else if (typeof C == "object" && typeof C.r == "bigint" && typeof C.s == "bigint") {
-        const { r: ee, s: Re } = C;
-        $ = new y(ee, Re);
+        const { r: ee, s: Te } = C;
+        $ = new g(ee, Te);
       } else
         throw new Error("PARSE");
-      Q = l.fromHex(N);
+      Q = l.fromHex(S);
     } catch (ee) {
       if (ee.message === "PARSE")
         throw new Error("signature must be Signature instance, Uint8Array or hex string");
@@ -1256,8 +1256,8 @@ function ss(e) {
     if (U && $.hasHighS())
       return !1;
     O && (v = t.hash(v));
-    const { r: ge, s: Le } = $, We = x(v), we = a(Le), mt = c(We * we), Ke = c(ge * we), $e = (Te = l.BASE.multiplyAndAddUnsafe(Q, mt, Ke)) == null ? void 0 : Te.toAffine();
-    return $e ? c($e.x) === ge : !1;
+    const { r: ge, s: Ue } = $, Ve = x(v), we = a(Ue), mt = c(Ve * we), Ke = c(ge * we), Le = ($e = l.BASE.multiplyAndAddUnsafe(Q, mt, Ke)) == null ? void 0 : $e.toAffine();
+    return Le ? c(Le.x) === ge : !1;
   }
   return {
     CURVE: t,
@@ -1266,13 +1266,13 @@ function ss(e) {
     sign: R,
     verify: H,
     ProjectivePoint: l,
-    Signature: y,
+    Signature: g,
     utils: m
   };
 }
-let tr = class extends Wn {
+let nr = class extends Zn {
   constructor(t, n) {
-    super(), this.finished = !1, this.destroyed = !1, Ei(t);
+    super(), this.finished = !1, this.destroyed = !1, mi(t);
     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");
@@ -1290,7 +1290,7 @@ let tr = class extends Wn {
     return et(this), this.iHash.update(t), this;
   }
   digestInto(t) {
-    et(this), zn(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+    et(this), Vn(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);
@@ -1305,29 +1305,29 @@ let tr = class extends Wn {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 };
-const nr = (e, t, n) => new tr(e, t).update(n).digest();
-nr.create = (e, t) => new tr(e, t);
+const rr = (e, t, n) => new nr(e, t).update(n).digest();
+rr.create = (e, t) => new nr(e, t);
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function os(e) {
+function as(e) {
   return {
     hash: e,
-    hmac: (t, ...n) => nr(e, t, Ni(...n)),
-    randomBytes: Zn
+    hmac: (t, ...n) => rr(e, t, Ai(...n)),
+    randomBytes: Gn
   };
 }
-function as(e, t) {
-  const n = (r) => ss({ ...e, ...os(r) });
+function cs(e, t) {
+  const n = (r) => os({ ...e, ...as(r) });
   return Object.freeze({ ...n(t), create: n });
 }
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const ct = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), rr = BigInt(1), nt = BigInt(2), In = (e, t) => (e + t / nt) / t;
-function ir(e) {
-  const t = ct, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, g = J(u, n, t) * f % t, b = J(g, nt, t) * l % t, p = J(b, i, t) * b % t, h = J(p, s, t) * p % t, d = J(h, c, t) * h % t, y = J(d, a, t) * d % t, m = J(y, c, t) * h % t, A = J(m, n, t) * f % t, I = J(A, o, t) * p % t, B = J(I, r, t) * l % t, E = J(B, nt, t);
+const ct = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), tt = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), ir = BigInt(1), nt = BigInt(2), In = (e, t) => (e + t / nt) / t;
+function sr(e) {
+  const t = ct, n = BigInt(3), r = BigInt(6), i = BigInt(11), s = BigInt(22), o = BigInt(23), c = BigInt(44), a = BigInt(88), l = e * e * e % t, f = l * l * e % t, u = J(f, n, t) * f % t, p = J(u, n, t) * f % t, b = J(p, nt, t) * l % t, y = J(b, i, t) * b % t, h = J(y, s, t) * y % t, d = J(h, c, t) * h % t, g = J(d, a, t) * d % t, m = J(g, c, t) * h % t, A = J(m, n, t) * f % t, I = J(A, o, t) * y % t, B = J(I, r, t) * l % t, E = J(B, nt, t);
   if (!Ot.eql(Ot.sqr(E), e))
     throw new Error("Cannot find square root");
   return E;
 }
-const Ot = Ji(ct, void 0, void 0, { sqrt: ir }), Ue = as({
+const Ot = Yi(ct, void 0, void 0, { sqrt: sr }), Ie = cs({
   a: BigInt(0),
   b: BigInt(7),
   Fp: Ot,
@@ -1346,92 +1346,92 @@ const Ot = Ji(ct, void 0, void 0, { sqrt: ir }), Ue = as({
   endo: {
     beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),
     splitScalar: (e) => {
-      const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -rr * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = In(s * e, t), a = In(-r * e, t);
+      const t = tt, n = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -ir * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = n, o = BigInt("0x100000000000000000000000000000000"), c = In(s * e, t), a = In(-r * e, t);
       let l = V(e - c * n - a * i, t), f = V(-c * r - a * s, t);
-      const u = l > o, g = f > o;
-      if (u && (l = t - l), g && (f = t - f), l > o || f > o)
+      const u = l > o, p = f > o;
+      if (u && (l = t - l), p && (f = t - f), l > o || f > o)
         throw new Error("splitScalar: Endomorphism failed, k=" + e);
-      return { k1neg: u, k1: l, k2neg: g, k2: f };
+      return { k1neg: u, k1: l, k2neg: p, k2: f };
     }
   }
-}, $t), ut = BigInt(0), sr = (e) => typeof e == "bigint" && ut < e && e < ct, cs = (e) => typeof e == "bigint" && ut < e && e < tt, Un = {};
+}, $t), ut = BigInt(0), or = (e) => typeof e == "bigint" && ut < e && e < ct, us = (e) => typeof e == "bigint" && ut < e && e < tt, Un = {};
 function rt(e, ...t) {
   let n = Un[e];
   if (n === void 0) {
     const r = $t(Uint8Array.from(e, (i) => i.charCodeAt(0)));
-    n = Ie(r, r), Un[e] = n;
+    n = _e(r, r), Un[e] = n;
   }
-  return $t(Ie(n, ...t));
+  return $t(_e(n, ...t));
 }
-const Xt = (e) => e.toRawBytes(!0).slice(1), Mt = (e) => Ne(e, 32), Kt = (e) => V(e, ct), Fe = (e) => V(e, tt), Qt = Ue.ProjectivePoint, us = (e, t, n) => Qt.BASE.multiplyAndAddUnsafe(e, t, n);
+const Xt = (e) => e.toRawBytes(!0).slice(1), Mt = (e) => Se(e, 32), Kt = (e) => V(e, ct), Fe = (e) => V(e, tt), Qt = Ie.ProjectivePoint, ls = (e, t, n) => Qt.BASE.multiplyAndAddUnsafe(e, t, n);
 function Pt(e) {
-  let t = Ue.utils.normPrivateKeyToScalar(e), n = Qt.fromPrivateKey(t);
+  let t = Ie.utils.normPrivateKeyToScalar(e), n = Qt.fromPrivateKey(t);
   return { scalar: n.hasEvenY() ? t : Fe(-t), bytes: Xt(n) };
 }
-function or(e) {
-  if (!sr(e))
+function ar(e) {
+  if (!or(e))
     throw new Error("bad x: need 0 < x < p");
   const t = Kt(e * e), n = Kt(t * e + BigInt(7));
-  let r = ir(n);
+  let r = sr(n);
   r % nt !== ut && (r = Kt(-r));
-  const i = new Qt(e, r, rr);
+  const i = new Qt(e, r, ir);
   return i.assertValidity(), i;
 }
-function ar(...e) {
+function cr(...e) {
   return Fe(F(rt("BIP0340/challenge", ...e)));
 }
-function ls(e) {
+function fs(e) {
   return Pt(e).bytes;
 }
-function fs(e, t, n = Zn(32)) {
+function hs(e, t, n = Gn(32)) {
   const r = W("message", e), { bytes: i, scalar: s } = Pt(t), o = W("auxRand", n, 32), c = Mt(s ^ F(rt("BIP0340/aux", o))), a = rt("BIP0340/nonce", c, i, r), l = Fe(F(a));
   if (l === ut)
     throw new Error("sign failed: k is zero");
-  const { bytes: f, scalar: u } = Pt(l), g = ar(f, i, r), b = new Uint8Array(64);
-  if (b.set(f, 0), b.set(Mt(Fe(u + g * s)), 32), !cr(b, r, i))
+  const { bytes: f, scalar: u } = Pt(l), p = cr(f, i, r), b = new Uint8Array(64);
+  if (b.set(f, 0), b.set(Mt(Fe(u + p * s)), 32), !ur(b, r, i))
     throw new Error("sign: Invalid signature produced");
   return b;
 }
-function cr(e, t, n) {
+function ur(e, t, n) {
   const r = W("signature", e, 64), i = W("message", t), s = W("publicKey", n, 32);
   try {
-    const o = or(F(s)), c = F(r.subarray(0, 32));
-    if (!sr(c))
+    const o = ar(F(s)), c = F(r.subarray(0, 32));
+    if (!or(c))
       return !1;
     const a = F(r.subarray(32, 64));
-    if (!cs(a))
+    if (!us(a))
       return !1;
-    const l = ar(Mt(c), Xt(o), i), f = us(o, a, Fe(-l));
+    const l = cr(Mt(c), Xt(o), i), f = ls(o, a, Fe(-l));
     return !(!f || !f.hasEvenY() || f.toAffine().x !== c);
   } catch {
     return !1;
   }
 }
-const Ze = {
-  getPublicKey: ls,
-  sign: fs,
-  verify: cr,
+const We = {
+  getPublicKey: fs,
+  sign: hs,
+  verify: ur,
   utils: {
-    randomPrivateKey: Ue.utils.randomPrivateKey,
-    lift_x: or,
+    randomPrivateKey: Ie.utils.randomPrivateKey,
+    lift_x: ar,
     pointToBytes: Xt,
-    numberToBytesBE: Ne,
+    numberToBytesBE: Se,
     bytesToNumberBE: F,
     taggedHash: rt,
     mod: V
   }
 }, Ct = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const en = (e) => e instanceof Uint8Array, Bt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, hs = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!hs)
+const en = (e) => e instanceof Uint8Array, Bt = (e) => new DataView(e.buffer, e.byteOffset, e.byteLength), ie = (e, t) => e << 32 - t | e >>> t, ds = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!ds)
   throw new Error("Non little-endian hardware is not supported");
-const ds = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+const ps = Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
 function M(e) {
   if (!en(e))
     throw new Error("Uint8Array expected");
   let t = "";
   for (let n = 0; n < e.length; n++)
-    t += ds[e[n]];
+    t += ps[e[n]];
   return t;
 }
 function G(e) {
@@ -1449,13 +1449,13 @@ function G(e) {
   }
   return n;
 }
-function ps(e) {
+function ys(e) {
   if (typeof e != "string")
     throw new Error(`utf8ToBytes expected string, got ${typeof e}`);
   return new Uint8Array(new TextEncoder().encode(e));
 }
 function Je(e) {
-  if (typeof e == "string" && (e = ps(e)), !en(e))
+  if (typeof e == "string" && (e = ys(e)), !en(e))
     throw new Error(`expected Uint8Array, got ${typeof e}`);
   return e;
 }
@@ -1468,17 +1468,17 @@ function lt(...e) {
     t.set(r, n), n += r.length;
   }), t;
 }
-class ur {
+class lr {
   // Safe version that clones internal state
   clone() {
     return this._cloneInto();
   }
 }
-function lr(e) {
+function fr(e) {
   const t = (r) => e().update(Je(r)).digest(), n = e();
   return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
 }
-function fr(e = 32) {
+function hr(e = 32) {
   if (Ct && typeof Ct.getRandomValues == "function")
     return Ct.getRandomValues(new Uint8Array(e));
   throw new Error("crypto.getRandomValues must be defined");
@@ -1487,48 +1487,48 @@ function Ht(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`Wrong positive integer: ${e}`);
 }
-function ys(e) {
+function gs(e) {
   if (typeof e != "boolean")
     throw new Error(`Expected boolean, not ${e}`);
 }
-function hr(e, ...t) {
+function dr(e, ...t) {
   if (!(e instanceof Uint8Array))
     throw new Error("Expected Uint8Array");
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
 }
-function gs(e) {
+function ws(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
   Ht(e.outputLen), Ht(e.blockLen);
 }
-function ws(e, t = !0) {
+function bs(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-function bs(e, t) {
-  hr(e);
+function vs(e, t) {
+  dr(e);
   const n = t.outputLen;
   if (e.length < n)
     throw new Error(`digestInto() expects output buffer of length at least ${n}`);
 }
 const se = {
   number: Ht,
-  bool: ys,
-  bytes: hr,
-  hash: gs,
-  exists: ws,
-  output: bs
+  bool: gs,
+  bytes: dr,
+  hash: ws,
+  exists: bs,
+  output: vs
 };
-function vs(e, t, n, r) {
+function Es(e, t, n, r) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, n, r);
   const i = BigInt(32), s = BigInt(4294967295), o = Number(n >> i & s), c = Number(n & s), a = r ? 4 : 0, l = r ? 0 : 4;
   e.setUint32(t + a, o, r), e.setUint32(t + l, c, r);
 }
-class Es extends ur {
+class ms extends lr {
   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 = Bt(this.buffer);
   }
@@ -1556,7 +1556,7 @@ class Es extends ur {
     n[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > i - o && (this.process(r, 0), o = 0);
     for (let u = o; u < i; u++)
       n[u] = 0;
-    vs(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
+    Es(r, i - 8, BigInt(this.length * 8), s), this.process(r, 0);
     const c = Bt(t), a = this.outputLen;
     if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
@@ -1578,7 +1578,7 @@ class Es extends ur {
     return t.length = i, t.pos = c, t.finished = s, t.destroyed = o, i % n && t.buffer.set(r), t;
   }
 }
-const ms = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n, Ss = new Uint32Array([
+const xs = (e, t, n) => e & t ^ ~e & n, Ns = (e, t, n) => e & t ^ e & n ^ t & n, Ss = new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1653,7 +1653,7 @@ const ms = (e, t, n) => e & t ^ ~e & n, xs = (e, t, n) => e & t ^ e & n ^ t & n,
   528734635,
   1541459225
 ]), me = new Uint32Array(64);
-class dr extends Es {
+class pr extends ms {
   constructor() {
     super(64, 32, 8, !1), this.A = Ee[0] | 0, this.B = Ee[1] | 0, this.C = Ee[2] | 0, this.D = Ee[3] | 0, this.E = Ee[4] | 0, this.F = Ee[5] | 0, this.G = Ee[6] | 0, this.H = Ee[7] | 0;
   }
@@ -1669,12 +1669,12 @@ class dr extends Es {
     for (let u = 0; u < 16; u++, n += 4)
       me[u] = t.getUint32(n, !1);
     for (let u = 16; u < 64; u++) {
-      const g = me[u - 15], b = me[u - 2], p = ie(g, 7) ^ ie(g, 18) ^ g >>> 3, h = ie(b, 17) ^ ie(b, 19) ^ b >>> 10;
-      me[u] = h + me[u - 7] + p + me[u - 16] | 0;
+      const p = me[u - 15], b = me[u - 2], y = ie(p, 7) ^ ie(p, 18) ^ p >>> 3, h = ie(b, 17) ^ ie(b, 19) ^ b >>> 10;
+      me[u] = h + me[u - 7] + y + me[u - 16] | 0;
     }
     let { A: r, B: i, C: s, D: o, E: c, F: a, G: l, H: f } = this;
     for (let u = 0; u < 64; u++) {
-      const g = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), b = f + g + ms(c, a, l) + Ss[u] + me[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + xs(r, i, s) | 0;
+      const p = ie(c, 6) ^ ie(c, 11) ^ ie(c, 25), b = f + p + xs(c, a, l) + Ss[u] + me[u] | 0, h = (ie(r, 2) ^ ie(r, 13) ^ ie(r, 22)) + Ns(r, i, s) | 0;
       f = l, l = a, a = c, c = o + b | 0, o = s, s = i, i = r, r = b + h | 0;
     }
     r = r + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, l = l + this.G | 0, f = f + this.H | 0, this.set(r, i, s, o, c, a, l, f);
@@ -1686,15 +1686,15 @@ class dr extends Es {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 }
-class Ns extends dr {
+class As extends pr {
   constructor() {
     super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28;
   }
 }
-const fe = lr(() => new dr());
-lr(() => new Ns());
+const fe = fr(() => new pr());
+fr(() => new As());
 /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function Ve(e) {
+function ze(e) {
   if (!Number.isSafeInteger(e))
     throw new Error(`Wrong integer: ${e}`);
 }
@@ -1708,7 +1708,7 @@ function pe(e) {
       if (!Array.isArray(t) || t.length && typeof t[0] != "number")
         throw new Error("alphabet.encode input should be an array of numbers");
       return t.map((n) => {
-        if (Ve(n), n < 0 || n >= e.length)
+        if (ze(n), n < 0 || n >= e.length)
           throw new Error(`Digit index outside alphabet: ${n} (alphabet: ${e.length})`);
         return e[n];
       });
@@ -1747,7 +1747,7 @@ function ye(e = "") {
   };
 }
 function ft(e, t = "=") {
-  if (Ve(e), typeof t != "string")
+  if (ze(e), typeof t != "string")
     throw new Error("padding chr should be string");
   return {
     encode(n) {
@@ -1776,7 +1776,7 @@ function ft(e, t = "=") {
     }
   };
 }
-function pr(e) {
+function yr(e) {
   if (typeof e != "function")
     throw new Error("normalize fn should be function");
   return { encode: (t) => t, decode: (t) => e(t) };
@@ -1793,7 +1793,7 @@ function Ln(e, t, n) {
   let r = 0;
   const i = [], s = Array.from(e);
   for (s.forEach((o) => {
-    if (Ve(o), o < 0 || o >= t)
+    if (ze(o), o < 0 || o >= t)
       throw new Error(`Wrong integer: ${o}`);
   }); ; ) {
     let o = 0, c = !0;
@@ -1814,7 +1814,7 @@ function Ln(e, t, n) {
     i.push(0);
   return i.reverse();
 }
-const yr = (e, t) => t ? yr(t, e % t) : e, it = (e, t) => e + (t - yr(e, t));
+const gr = (e, t) => t ? gr(t, e % t) : e, it = (e, t) => e + (t - gr(e, t));
 function qt(e, t, n, r) {
   if (!Array.isArray(e))
     throw new Error("convertRadix2: data should be array");
@@ -1827,7 +1827,7 @@ function qt(e, t, n, r) {
   let i = 0, s = 0;
   const o = 2 ** n - 1, c = [];
   for (const a of e) {
-    if (Ve(a), a >= 2 ** t)
+    if (ze(a), a >= 2 ** t)
       throw new Error(`convertRadix2: invalid data word=${a} from=${t}`);
     if (i = i << t | a, s + t > 32)
       throw new Error(`convertRadix2: carry overflow pos=${s} from=${t}`);
@@ -1841,8 +1841,8 @@ function qt(e, t, n, r) {
     throw new Error(`Non-zero padding: ${i}`);
   return r && s > 0 && c.push(i >>> 0), c;
 }
-function As(e) {
-  return Ve(e), {
+function Ks(e) {
+  return ze(e), {
     encode: (t) => {
       if (!(t instanceof Uint8Array))
         throw new Error("radix.encode input should be Uint8Array");
@@ -1856,7 +1856,7 @@ function As(e) {
   };
 }
 function Ae(e, t = !1) {
-  if (Ve(e), e <= 0 || e > 32)
+  if (ze(e), e <= 0 || e > 32)
     throw new Error("radix2: bits should be in (0..32]");
   if (it(8, e) > 32 || it(e, 8) > 32)
     throw new Error("radix2: carry overflow");
@@ -1883,13 +1883,13 @@ function $n(e) {
     }
   };
 }
-const Ks = de(Ae(4), pe("0123456789ABCDEF"), ye("")), Cs = de(Ae(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ft(5), ye(""));
+const Cs = de(Ae(4), pe("0123456789ABCDEF"), ye("")), Bs = de(Ae(5), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ft(5), ye(""));
 de(Ae(5), pe("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ft(5), ye(""));
-de(Ae(5), pe("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), ye(""), pr((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
-const he = de(Ae(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ft(6), ye("")), Bs = de(Ae(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ft(6), ye("")), tn = (e) => de(As(58), pe(e), ye("")), Dt = tn("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
+de(Ae(5), pe("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), ye(""), yr((e) => e.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1")));
+const he = de(Ae(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ft(6), ye("")), ks = de(Ae(6), pe("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ft(6), ye("")), tn = (e) => de(Ks(58), pe(e), ye("")), Dt = tn("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
 tn("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ");
 tn("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");
-const Tn = [0, 2, 3, 5, 6, 7, 9, 10, 11], ks = {
+const Tn = [0, 2, 3, 5, 6, 7, 9, 10, 11], _s = {
   encode(e) {
     let t = "";
     for (let n = 0; n < e.length; n += 8) {
@@ -1910,7 +1910,7 @@ const Tn = [0, 2, 3, 5, 6, 7, 9, 10, 11], ks = {
     return Uint8Array.from(t);
   }
 }, jt = de(pe("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), ye("")), Rn = [996825010, 642813549, 513874426, 1027748829, 705979059];
-function Ge(e) {
+function Ze(e) {
   const t = e >> 25;
   let n = (e & 33554431) << 5;
   for (let r = 0; r < Rn.length; r++)
@@ -1924,27 +1924,27 @@ function On(e, t, n = 1) {
     const o = e.charCodeAt(s);
     if (o < 33 || o > 126)
       throw new Error(`Invalid prefix (${e})`);
-    i = Ge(i) ^ o >> 5;
+    i = Ze(i) ^ o >> 5;
   }
-  i = Ge(i);
+  i = Ze(i);
   for (let s = 0; s < r; s++)
-    i = Ge(i) ^ e.charCodeAt(s) & 31;
+    i = Ze(i) ^ e.charCodeAt(s) & 31;
   for (let s of t)
-    i = Ge(i) ^ s;
+    i = Ze(i) ^ s;
   for (let s = 0; s < 6; s++)
-    i = Ge(i);
+    i = Ze(i);
   return i ^= n, jt.encode(qt([i % 2 ** 30], 30, 5, !1));
 }
-function gr(e) {
+function wr(e) {
   const t = e === "bech32" ? 1 : 734539939, n = Ae(5), r = n.decode, i = n.encode, s = $n(r);
-  function o(f, u, g = 90) {
+  function o(f, u, p = 90) {
     if (typeof f != "string")
       throw new Error(`bech32.encode prefix should be string, not ${typeof f}`);
     if (!Array.isArray(u) || u.length && typeof u[0] != "number")
       throw new Error(`bech32.encode words should be array of numbers, not ${typeof u}`);
     const b = f.length + 7 + u.length;
-    if (g !== !1 && b > g)
-      throw new TypeError(`Length ${b} exceeds limit ${g}`);
+    if (p !== !1 && b > p)
+      throw new TypeError(`Length ${b} exceeds limit ${p}`);
     return f = f.toLowerCase(), `${f}1${jt.encode(u)}${On(f, u, t)}`;
   }
   function c(f, u = 90) {
@@ -1952,48 +1952,48 @@ function gr(e) {
       throw new Error(`bech32.decode input should be string, not ${typeof f}`);
     if (f.length < 8 || u !== !1 && f.length > u)
       throw new TypeError(`Wrong string length: ${f.length} (${f}). Expected (8..${u})`);
-    const g = f.toLowerCase();
-    if (f !== g && f !== f.toUpperCase())
+    const p = f.toLowerCase();
+    if (f !== p && f !== f.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
-    f = g;
+    f = p;
     const b = f.lastIndexOf("1");
     if (b === 0 || b === -1)
       throw new Error('Letter "1" must be present between prefix and data only');
-    const p = f.slice(0, b), h = f.slice(b + 1);
+    const y = f.slice(0, b), h = f.slice(b + 1);
     if (h.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const d = jt.decode(h).slice(0, -6), y = On(p, d, t);
-    if (!h.endsWith(y))
-      throw new Error(`Invalid checksum in ${f}: expected "${y}"`);
-    return { prefix: p, words: d };
+    const d = jt.decode(h).slice(0, -6), g = On(y, d, t);
+    if (!h.endsWith(g))
+      throw new Error(`Invalid checksum in ${f}: expected "${g}"`);
+    return { prefix: y, words: d };
   }
   const a = $n(c);
   function l(f) {
-    const { prefix: u, words: g } = c(f, !1);
-    return { prefix: u, words: g, bytes: r(g) };
+    const { prefix: u, words: p } = c(f, !1);
+    return { prefix: u, words: p, bytes: r(p) };
   }
   return { encode: o, decode: c, decodeToBytes: l, decodeUnsafe: a, fromWords: r, fromWordsUnsafe: s, toWords: i };
 }
-const ze = gr("bech32");
-gr("bech32m");
-const _s = {
+const je = wr("bech32");
+wr("bech32m");
+const Is = {
   encode: (e) => new TextDecoder().decode(e),
   decode: (e) => new TextEncoder().encode(e)
-}, Is = de(Ae(4), pe("0123456789abcdef"), ye(""), pr((e) => {
+}, Us = de(Ae(4), pe("0123456789abcdef"), ye(""), yr((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();
-})), Us = {
-  utf8: _s,
-  hex: Is,
-  base16: Ks,
-  base32: Cs,
+})), Ls = {
+  utf8: Is,
+  hex: Us,
+  base16: Cs,
+  base32: Bs,
   base64: he,
-  base64url: Bs,
+  base64url: ks,
   base58: Dt,
-  base58xmr: ks
+  base58xmr: _s
 };
-`${Object.keys(Us).join(", ")}`;
+`${Object.keys(Ls).join(", ")}`;
 function kt(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
@@ -2002,25 +2002,25 @@ function Mn(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
-function Ls(e) {
+function $s(e) {
   return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
 }
 function ce(e, ...t) {
-  if (!Ls(e))
+  if (!$s(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)), $s = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!$s)
+const Z = (e) => new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4)), Ts = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+if (!Ts)
   throw new Error("Non little-endian hardware is not supported");
-function Ts(e, t) {
+function Rs(e, t) {
   if (t == null || typeof t != "object")
     throw new Error("options must be defined");
   return Object.assign(e, t);
 }
-function Rs(e, t) {
+function Os(e, t) {
   if (e.length !== t.length)
     return !1;
   let n = 0;
@@ -2028,11 +2028,11 @@ function Rs(e, t) {
     n |= e[r] ^ t[r];
   return n === 0;
 }
-const Os = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Se = 16, Ms = 283;
+const Ms = /* @__NO_SIDE_EFFECTS__ */ (e, t) => (Object.assign(t, e), t), Ne = 16, Ps = 283;
 function nn(e) {
-  return e << 1 ^ Ms & -(e >> 7);
+  return e << 1 ^ Ps & -(e >> 7);
 }
-function He(e, t) {
+function Pe(e, t) {
   let n = 0;
   for (; t > 0; t >>= 1)
     n ^= e & -(t & 1), e = nn(e);
@@ -2049,8 +2049,8 @@ const zt = /* @__PURE__ */ (() => {
     r |= r << 8, t[e[n]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255;
   }
   return t;
-})(), Ps = /* @__PURE__ */ zt.map((e, t) => zt.indexOf(t)), Hs = (e) => e << 24 | e >>> 8, _t = (e) => e << 8 | e >>> 24;
-function wr(e, t) {
+})(), Hs = /* @__PURE__ */ zt.map((e, t) => zt.indexOf(t)), qs = (e) => e << 24 | e >>> 8, _t = (e) => e << 8 | e >>> 24;
+function br(e, t) {
   if (e.length !== 256)
     throw new Error("Wrong sbox length");
   const n = new Uint32Array(256).map((l, f) => t(e[f])), r = n.map(_t), i = r.map(_t), s = i.map(_t), o = new Uint32Array(256 * 256), c = new Uint32Array(256 * 256), a = new Uint16Array(256 * 256);
@@ -2061,13 +2061,13 @@ function wr(e, t) {
     }
   return { sbox: e, sbox2: a, T0: n, T1: r, T2: i, T3: s, T01: o, T23: c };
 }
-const rn = /* @__PURE__ */ wr(zt, (e) => He(e, 3) << 24 | e << 16 | e << 8 | He(e, 2)), br = /* @__PURE__ */ wr(Ps, (e) => He(e, 11) << 24 | He(e, 13) << 16 | He(e, 9) << 8 | He(e, 14)), qs = /* @__PURE__ */ (() => {
+const rn = /* @__PURE__ */ br(zt, (e) => Pe(e, 3) << 24 | e << 16 | e << 8 | Pe(e, 2)), vr = /* @__PURE__ */ br(Hs, (e) => Pe(e, 11) << 24 | Pe(e, 13) << 16 | Pe(e, 9) << 8 | Pe(e, 14)), Ds = /* @__PURE__ */ (() => {
   const e = new Uint8Array(16);
   for (let t = 0, n = 1; t < 16; t++, n = nn(n))
     e[t] = n;
   return e;
 })();
-function vr(e) {
+function Er(e) {
   ce(e);
   const t = e.length;
   if (![16, 24, 32].includes(t))
@@ -2076,12 +2076,12 @@ function vr(e) {
   o.set(r);
   for (let c = i; c < o.length; c++) {
     let a = o[c - 1];
-    c % i === 0 ? a = s(Hs(a)) ^ qs[c / i - 1] : i > 6 && c % i === 4 && (a = s(a)), o[c] = o[c - i] ^ a;
+    c % i === 0 ? a = s(qs(a)) ^ Ds[c / i - 1] : i > 6 && c % i === 4 && (a = s(a)), o[c] = o[c - i] ^ a;
   }
   return o;
 }
-function Ds(e) {
-  const t = vr(e), n = t.slice(), r = t.length, { sbox2: i } = rn, { T0: s, T1: o, T2: c, T3: a } = br;
+function js(e) {
+  const t = Er(e), n = t.slice(), r = t.length, { sbox2: i } = rn, { T0: s, T1: o, T2: c, T3: a } = vr;
   for (let l = 0; l < r; l += 4)
     for (let f = 0; f < 4; f++)
       n[l + f] = t[r - l - 4 + f];
@@ -2103,50 +2103,50 @@ function Pn(e, t, n, r, i) {
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
-  for (let p = 0; p < l; p++) {
-    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), y = e[a++] ^ xe(o, c, r, i, t, n), m = e[a++] ^ xe(o, c, i, t, n, r);
-    t = h, n = d, r = y, i = m;
+  for (let y = 0; y < l; y++) {
+    const h = e[a++] ^ xe(o, c, t, n, r, i), d = e[a++] ^ xe(o, c, n, r, i, t), g = e[a++] ^ xe(o, c, r, i, t, n), m = e[a++] ^ xe(o, c, i, t, n, r);
+    t = h, n = d, r = g, i = m;
   }
-  const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), g = e[a++] ^ oe(s, r, i, t, n), b = e[a++] ^ oe(s, i, t, n, r);
-  return { s0: f, s1: u, s2: g, s3: b };
+  const f = e[a++] ^ oe(s, t, n, r, i), u = e[a++] ^ oe(s, n, r, i, t), p = e[a++] ^ oe(s, r, i, t, n), b = e[a++] ^ oe(s, i, t, n, r);
+  return { s0: f, s1: u, s2: p, s3: b };
 }
-function js(e, t, n, r, i) {
-  const { sbox2: s, T01: o, T23: c } = br;
+function zs(e, t, n, r, i) {
+  const { sbox2: s, T01: o, T23: c } = vr;
   let a = 0;
   t ^= e[a++], n ^= e[a++], r ^= e[a++], i ^= e[a++];
   const l = e.length / 4 - 2;
-  for (let p = 0; p < l; p++) {
-    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), y = e[a++] ^ xe(o, c, r, n, t, i), m = e[a++] ^ xe(o, c, i, r, n, t);
-    t = h, n = d, r = y, i = m;
+  for (let y = 0; y < l; y++) {
+    const h = e[a++] ^ xe(o, c, t, i, r, n), d = e[a++] ^ xe(o, c, n, t, i, r), g = e[a++] ^ xe(o, c, r, n, t, i), m = e[a++] ^ xe(o, c, i, r, n, t);
+    t = h, n = d, r = g, i = m;
   }
-  const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), g = e[a++] ^ oe(s, r, n, t, i), b = e[a++] ^ oe(s, i, r, n, t);
-  return { s0: f, s1: u, s2: g, s3: b };
+  const f = e[a++] ^ oe(s, t, i, r, n), u = e[a++] ^ oe(s, n, t, i, r), p = e[a++] ^ oe(s, r, n, t, i), b = e[a++] ^ oe(s, i, r, n, t);
+  return { s0: f, s1: u, s2: p, s3: b };
 }
-function Er(e, t) {
+function mr(e, t) {
   if (!t)
     return new Uint8Array(e);
   if (ce(t), t.length < e)
     throw new Error(`aes: wrong destination length, expected at least ${e}, got: ${t.length}`);
   return t;
 }
-function zs(e) {
-  if (ce(e), e.length % Se !== 0)
-    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Se}`);
+function Vs(e) {
+  if (ce(e), e.length % Ne !== 0)
+    throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Ne}`);
 }
-function Vs(e, t, n) {
+function Ws(e, t, n) {
   let r = e.length;
-  const i = r % Se;
+  const i = r % Ne;
   if (!t && i !== 0)
     throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding");
   const s = Z(e);
   if (t) {
-    let a = Se - i;
-    a || (a = Se), r = r + a;
+    let a = Ne - i;
+    a || (a = Ne), r = r + a;
   }
-  const o = Er(r, n), c = Z(o);
+  const o = mr(r, n), c = Z(o);
   return { b: s, o: c, out: o };
 }
-function Ws(e, t) {
+function Zs(e, t) {
   if (!t)
     return e;
   const n = e.length;
@@ -2161,43 +2161,43 @@ function Ws(e, t) {
       throw new Error("aes/pcks5: wrong padding");
   return i;
 }
-function Zs(e) {
+function Gs(e) {
   const t = new Uint8Array(16), n = Z(t);
   t.set(e);
-  const r = Se - e.length;
-  for (let i = Se - r; i < Se; i++)
+  const r = Ne - e.length;
+  for (let i = Ne - r; i < Ne; i++)
     t[i] = r;
   return n;
 }
-const mr = /* @__PURE__ */ Os({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
+const xr = /* @__PURE__ */ Ms({ blockSize: 16, nonceLength: 16 }, function(t, n, r = {}) {
   ce(t), ce(n, 16);
   const i = !r.disablePadding;
   return {
     encrypt: (s, o) => {
-      const c = vr(t), { b: a, o: l, out: f } = Vs(s, i, o), u = Z(n);
-      let g = u[0], b = u[1], p = u[2], h = u[3], d = 0;
+      const c = Er(t), { b: a, o: l, out: f } = Ws(s, i, o), u = Z(n);
+      let p = u[0], b = u[1], y = u[2], h = u[3], d = 0;
       for (; d + 4 <= a.length; )
-        g ^= a[d + 0], b ^= a[d + 1], p ^= a[d + 2], h ^= a[d + 3], { s0: g, s1: b, s2: p, s3: h } = Pn(c, g, b, p, h), l[d++] = g, l[d++] = b, l[d++] = p, l[d++] = h;
+        p ^= a[d + 0], b ^= a[d + 1], y ^= a[d + 2], h ^= a[d + 3], { s0: p, s1: b, s2: y, s3: h } = Pn(c, p, b, y, h), l[d++] = p, l[d++] = b, l[d++] = y, l[d++] = h;
       if (i) {
-        const y = Zs(s.subarray(d * 4));
-        g ^= y[0], b ^= y[1], p ^= y[2], h ^= y[3], { s0: g, s1: b, s2: p, s3: h } = Pn(c, g, b, p, h), l[d++] = g, l[d++] = b, l[d++] = p, l[d++] = h;
+        const g = Gs(s.subarray(d * 4));
+        p ^= g[0], b ^= g[1], y ^= g[2], h ^= g[3], { s0: p, s1: b, s2: y, s3: h } = Pn(c, p, b, y, h), l[d++] = p, l[d++] = b, l[d++] = y, l[d++] = h;
       }
       return c.fill(0), f;
     },
     decrypt: (s, o) => {
-      zs(s);
-      const c = Ds(t), a = Z(n), l = Er(s.length, o), f = Z(s), u = Z(l);
-      let g = a[0], b = a[1], p = a[2], h = a[3];
+      Vs(s);
+      const c = js(t), a = Z(n), l = mr(s.length, o), f = Z(s), u = Z(l);
+      let p = a[0], b = a[1], y = a[2], h = a[3];
       for (let d = 0; d + 4 <= f.length; ) {
-        const y = g, m = b, A = p, I = h;
-        g = f[d + 0], b = f[d + 1], p = f[d + 2], h = f[d + 3];
-        const { s0: B, s1: E, s2: x, s3: S } = js(c, g, b, p, h);
-        u[d++] = B ^ y, u[d++] = E ^ m, u[d++] = x ^ A, u[d++] = S ^ I;
+        const g = p, m = b, A = y, I = h;
+        p = f[d + 0], b = f[d + 1], y = f[d + 2], h = f[d + 3];
+        const { s0: B, s1: E, s2: x, s3: N } = zs(c, p, b, y, h);
+        u[d++] = B ^ g, u[d++] = E ^ m, u[d++] = x ^ A, u[d++] = N ^ I;
       }
-      return c.fill(0), Ws(l, i);
+      return c.fill(0), Zs(l, i);
     }
   };
-}), xr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Gs = xr("expand 16-byte k"), Fs = xr("expand 32-byte k"), Js = Z(Gs), Sr = Z(Fs);
+}), Nr = (e) => Uint8Array.from(e.split("").map((t) => t.charCodeAt(0))), Fs = Nr("expand 16-byte k"), Js = Nr("expand 32-byte k"), Ys = Z(Fs), Sr = Z(Js);
 Sr.slice();
 function L(e, t) {
   return e << t | e >>> 32 - t;
@@ -2205,52 +2205,52 @@ function L(e, t) {
 function Vt(e) {
   return e.byteOffset % 4 === 0;
 }
-const Xe = 64, Ys = 16, Nr = 2 ** 32 - 1, Hn = new Uint32Array();
-function Xs(e, t, n, r, i, s, o, c) {
-  const a = i.length, l = new Uint8Array(Xe), f = Z(l), u = Vt(i) && Vt(s), g = u ? Z(i) : Hn, b = u ? Z(s) : Hn;
-  for (let p = 0; p < a; o++) {
-    if (e(t, n, r, f, o, c), o >= Nr)
+const Xe = 64, Xs = 16, Ar = 2 ** 32 - 1, Hn = new Uint32Array();
+function Qs(e, t, n, r, i, s, o, c) {
+  const a = i.length, l = new Uint8Array(Xe), f = Z(l), u = Vt(i) && Vt(s), p = u ? Z(i) : Hn, b = u ? Z(s) : Hn;
+  for (let y = 0; y < a; o++) {
+    if (e(t, n, r, f, o, c), o >= Ar)
       throw new Error("arx: counter overflow");
-    const h = Math.min(Xe, a - p);
+    const h = Math.min(Xe, a - y);
     if (u && h === Xe) {
-      const d = p / 4;
-      if (p % 4 !== 0)
+      const d = y / 4;
+      if (y % 4 !== 0)
         throw new Error("arx: invalid block position");
-      for (let y = 0, m; y < Ys; y++)
-        m = d + y, b[m] = g[m] ^ f[y];
-      p += Xe;
+      for (let g = 0, m; g < Xs; g++)
+        m = d + g, b[m] = p[m] ^ f[g];
+      y += Xe;
       continue;
     }
-    for (let d = 0, y; d < h; d++)
-      y = p + d, s[y] = i[y] ^ l[d];
-    p += h;
+    for (let d = 0, g; d < h; d++)
+      g = y + d, s[g] = i[g] ^ l[d];
+    y += h;
   }
 }
-function Qs(e, t) {
-  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = Ts({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
+function eo(e, t) {
+  const { allowShortKeys: n, extendNonceFn: r, counterLength: i, counterRight: s, rounds: o } = Rs({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, t);
   if (typeof e != "function")
     throw new Error("core must be a function");
   return kt(i), kt(o), Mn(s), Mn(n), (c, a, l, f, u = 0) => {
     ce(c), ce(a), ce(l);
-    const g = l.length;
-    if (f || (f = new Uint8Array(g)), ce(f), kt(u), u < 0 || u >= Nr)
+    const p = l.length;
+    if (f || (f = new Uint8Array(p)), ce(f), kt(u), u < 0 || u >= Ar)
       throw new Error("arx: counter overflow");
-    if (f.length < g)
-      throw new Error(`arx: output (${f.length}) is shorter than data (${g})`);
+    if (f.length < p)
+      throw new Error(`arx: output (${f.length}) is shorter than data (${p})`);
     const b = [];
-    let p = c.length, h, d;
-    if (p === 32)
+    let y = c.length, h, d;
+    if (y === 32)
       h = c.slice(), b.push(h), d = Sr;
-    else if (p === 16 && n)
-      h = new Uint8Array(32), h.set(c), h.set(c, 16), d = Js, b.push(h);
+    else if (y === 16 && n)
+      h = new Uint8Array(32), h.set(c), h.set(c, 16), d = Ys, b.push(h);
     else
-      throw new Error(`arx: invalid 32-byte key, got length=${p}`);
+      throw new Error(`arx: invalid 32-byte key, got length=${y}`);
     Vt(a) || (a = a.slice(), b.push(a));
-    const y = Z(h);
+    const g = Z(h);
     if (r) {
       if (a.length !== 24)
         throw new Error("arx: extended nonce must be 24 bytes");
-      r(d, y, Z(a.subarray(0, 16)), y), a = a.subarray(16);
+      r(d, g, Z(a.subarray(0, 16)), g), a = a.subarray(16);
     }
     const m = 16 - i;
     if (m !== a.length)
@@ -2260,24 +2260,24 @@ function Qs(e, t) {
       I.set(a, s ? 0 : 12 - a.length), a = I, b.push(a);
     }
     const A = Z(a);
-    for (Xs(e, d, y, A, l, f, u, o); b.length > 0; )
+    for (Qs(e, d, g, A, l, f, u, o); b.length > 0; )
       b.pop().fill(0);
     return f;
   };
 }
-function eo(e, t, n, r, i, s = 20) {
-  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], g = t[2], b = t[3], p = t[4], h = t[5], d = t[6], y = t[7], m = i, A = n[0], I = n[1], B = n[2], E = o, x = c, S = a, P = l, _ = f, K = u, T = g, R = b, H = p, w = h, v = d, N = y, k = m, C = A, U = I, O = B;
+function to(e, t, n, r, i, s = 20) {
+  let o = e[0], c = e[1], a = e[2], l = e[3], f = t[0], u = t[1], p = t[2], b = t[3], y = t[4], h = t[5], d = t[6], g = t[7], m = i, A = n[0], I = n[1], B = n[2], E = o, x = c, N = a, P = l, _ = f, K = u, T = p, R = b, H = y, w = h, v = d, S = g, k = m, C = A, U = I, O = B;
   for (let Q = 0; Q < s; Q += 2)
-    E = E + _ | 0, k = L(k ^ E, 16), H = H + k | 0, _ = L(_ ^ H, 12), E = E + _ | 0, k = L(k ^ E, 8), H = H + k | 0, _ = L(_ ^ H, 7), x = x + K | 0, C = L(C ^ x, 16), w = w + C | 0, K = L(K ^ w, 12), x = x + K | 0, C = L(C ^ x, 8), w = w + C | 0, K = L(K ^ w, 7), S = S + T | 0, U = L(U ^ S, 16), v = v + U | 0, T = L(T ^ v, 12), S = S + T | 0, U = L(U ^ S, 8), v = v + U | 0, T = L(T ^ v, 7), P = P + R | 0, O = L(O ^ P, 16), N = N + O | 0, R = L(R ^ N, 12), P = P + R | 0, O = L(O ^ P, 8), N = N + O | 0, R = L(R ^ N, 7), E = E + K | 0, O = L(O ^ E, 16), v = v + O | 0, K = L(K ^ v, 12), E = E + K | 0, O = L(O ^ E, 8), v = v + O | 0, K = L(K ^ v, 7), x = x + T | 0, k = L(k ^ x, 16), N = N + k | 0, T = L(T ^ N, 12), x = x + T | 0, k = L(k ^ x, 8), N = N + k | 0, T = L(T ^ N, 7), S = S + R | 0, C = L(C ^ S, 16), H = H + C | 0, R = L(R ^ H, 12), S = S + R | 0, C = L(C ^ S, 8), H = H + C | 0, R = L(R ^ H, 7), P = P + _ | 0, U = L(U ^ P, 16), w = w + U | 0, _ = L(_ ^ w, 12), P = P + _ | 0, U = L(U ^ P, 8), w = w + U | 0, _ = L(_ ^ w, 7);
+    E = E + _ | 0, k = L(k ^ E, 16), H = H + k | 0, _ = L(_ ^ H, 12), E = E + _ | 0, k = L(k ^ E, 8), H = H + k | 0, _ = L(_ ^ H, 7), x = x + K | 0, C = L(C ^ x, 16), w = w + C | 0, K = L(K ^ w, 12), x = x + K | 0, C = L(C ^ x, 8), w = w + C | 0, K = L(K ^ w, 7), N = N + T | 0, U = L(U ^ N, 16), v = v + U | 0, T = L(T ^ v, 12), N = N + T | 0, U = L(U ^ N, 8), v = v + U | 0, T = L(T ^ v, 7), P = P + R | 0, O = L(O ^ P, 16), S = S + O | 0, R = L(R ^ S, 12), P = P + R | 0, O = L(O ^ P, 8), S = S + O | 0, R = L(R ^ S, 7), E = E + K | 0, O = L(O ^ E, 16), v = v + O | 0, K = L(K ^ v, 12), E = E + K | 0, O = L(O ^ E, 8), v = v + O | 0, K = L(K ^ v, 7), x = x + T | 0, k = L(k ^ x, 16), S = S + k | 0, T = L(T ^ S, 12), x = x + T | 0, k = L(k ^ x, 8), S = S + k | 0, T = L(T ^ S, 7), N = N + R | 0, C = L(C ^ N, 16), H = H + C | 0, R = L(R ^ H, 12), N = N + R | 0, C = L(C ^ N, 8), H = H + C | 0, R = L(R ^ H, 7), P = P + _ | 0, U = L(U ^ P, 16), w = w + U | 0, _ = L(_ ^ w, 12), P = P + _ | 0, U = L(U ^ P, 8), w = w + U | 0, _ = L(_ ^ w, 7);
   let $ = 0;
-  r[$++] = o + E | 0, r[$++] = c + x | 0, r[$++] = a + S | 0, r[$++] = l + P | 0, r[$++] = f + _ | 0, r[$++] = u + K | 0, r[$++] = g + T | 0, r[$++] = b + R | 0, r[$++] = p + H | 0, r[$++] = h + w | 0, r[$++] = d + v | 0, r[$++] = y + N | 0, r[$++] = m + k | 0, r[$++] = A + C | 0, r[$++] = I + U | 0, r[$++] = B + O | 0;
+  r[$++] = o + E | 0, r[$++] = c + x | 0, r[$++] = a + N | 0, r[$++] = l + P | 0, r[$++] = f + _ | 0, r[$++] = u + K | 0, r[$++] = p + T | 0, r[$++] = b + R | 0, r[$++] = y + H | 0, r[$++] = h + w | 0, r[$++] = d + v | 0, r[$++] = g + S | 0, r[$++] = m + k | 0, r[$++] = A + C | 0, r[$++] = I + U | 0, r[$++] = B + O | 0;
 }
-const Ar = /* @__PURE__ */ Qs(eo, {
+const Kr = /* @__PURE__ */ eo(to, {
   counterRight: !1,
   counterLength: 4,
   allowShortKeys: !1
 });
-class Kr extends ur {
+class Cr extends lr {
   constructor(t, n) {
     super(), this.finished = !1, this.destroyed = !1, se.hash(t);
     const r = Je(n);
@@ -2312,13 +2312,13 @@ class Kr extends ur {
     this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
 }
-const ht = (e, t, n) => new Kr(e, t).update(n).digest();
-ht.create = (e, t) => new Kr(e, t);
+const ht = (e, t, n) => new Cr(e, t).update(n).digest();
+ht.create = (e, t) => new Cr(e, t);
 function sn(e, t, n) {
   return se.hash(e), n === void 0 && (n = new Uint8Array(e.outputLen)), ht(e, Je(n), Je(t));
 }
 const It = new Uint8Array([0]), qn = new Uint8Array();
-function Cr(e, t, n, r = 32) {
+function Br(e, t, n, r = 32) {
   if (se.hash(e), se.number(r), r > 255 * e.outputLen)
     throw new Error("Length should be <= 255*HashLen");
   const i = Math.ceil(r / e.outputLen);
@@ -2328,12 +2328,12 @@ function Cr(e, t, n, r = 32) {
     It[0] = l + 1, c.update(l === 0 ? qn : a).update(n).update(It).digestInto(a), s.set(a, e.outputLen * l), o._cloneInto(c);
   return o.destroy(), c.destroy(), a.fill(0), It.fill(0), s.slice(0, r);
 }
-var to = Object.defineProperty, D = (e, t) => {
+var no = Object.defineProperty, D = (e, t) => {
   for (var n in t)
-    to(e, n, { get: t[n], enumerable: !0 });
-}, Oe = Symbol("verified"), no = (e) => e instanceof Object;
+    no(e, n, { get: t[n], enumerable: !0 });
+}, Re = Symbol("verified"), ro = (e) => e instanceof Object;
 function dt(e) {
-  if (!no(e) || typeof e.kind != "number" || typeof e.content != "string" || typeof e.created_at != "number" || typeof e.pubkey != "string" || !e.pubkey.match(/^[a-f0-9]{64}$/) || !Array.isArray(e.tags))
+  if (!ro(e) || typeof e.kind != "number" || typeof e.content != "string" || typeof e.created_at != "number" || typeof e.pubkey != "string" || !e.pubkey.match(/^[a-f0-9]{64}$/) || !Array.isArray(e.tags))
     return !1;
   for (let t = 0; t < e.tags.length; t++) {
     let n = e.tags[t];
@@ -2345,28 +2345,28 @@ function dt(e) {
   }
   return !0;
 }
-var ro = {};
-D(ro, {
-  Queue: () => ao,
-  QueueNode: () => Br,
+var io = {};
+D(io, {
+  Queue: () => co,
+  QueueNode: () => kr,
   binarySearch: () => on,
-  insertEventIntoAscendingList: () => oo,
-  insertEventIntoDescendingList: () => so,
-  normalizeURL: () => io,
+  insertEventIntoAscendingList: () => ao,
+  insertEventIntoDescendingList: () => oo,
+  normalizeURL: () => so,
   utf8Decoder: () => ue,
   utf8Encoder: () => ne
 });
 var ue = new TextDecoder("utf-8"), ne = new TextEncoder();
-function io(e) {
+function so(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 so(e, t) {
+function oo(e, t) {
   const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : i.created_at - t.created_at);
   return r || e.splice(n, 0, t), e;
 }
-function oo(e, t) {
+function ao(e, t) {
   const [n, r] = on(e, (i) => t.id === i.id ? 0 : t.created_at === i.created_at ? -1 : t.created_at - i.created_at);
   return r || e.splice(n, 0, t), e;
 }
@@ -2380,21 +2380,21 @@ function on(e, t) {
   }
   return [n, !1];
 }
-var Br = class {
+var kr = class {
   constructor(e) {
     te(this, "value");
     te(this, "next", null);
     te(this, "prev", null);
     this.value = e;
   }
-}, ao = class {
+}, co = class {
   constructor() {
     te(this, "first");
     te(this, "last");
     this.first = null, this.last = null;
   }
   enqueue(e) {
-    const t = new Br(e);
+    const t = new kr(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() {
@@ -2407,163 +2407,163 @@ var Br = class {
     const e = this.first;
     return this.first = e.next, e.value;
   }
-}, co = class {
+}, uo = class {
   generateSecretKey() {
-    return Ze.utils.randomPrivateKey();
+    return We.utils.randomPrivateKey();
   }
   getPublicKey(e) {
-    return M(Ze.getPublicKey(e));
+    return M(We.getPublicKey(e));
   }
   finalizeEvent(e, t) {
     const n = e;
-    return n.pubkey = M(Ze.getPublicKey(t)), n.id = qe(n), n.sig = M(Ze.sign(qe(n), t)), n[Oe] = !0, n;
+    return n.pubkey = M(We.getPublicKey(t)), n.id = He(n), n.sig = M(We.sign(He(n), t)), n[Re] = !0, n;
   }
   verifyEvent(e) {
-    if (typeof e[Oe] == "boolean")
-      return e[Oe];
-    const t = qe(e);
+    if (typeof e[Re] == "boolean")
+      return e[Re];
+    const t = He(e);
     if (t !== e.id)
-      return e[Oe] = !1, !1;
+      return e[Re] = !1, !1;
     try {
-      const n = Ze.verify(e.sig, t, e.pubkey);
-      return e[Oe] = n, n;
+      const n = We.verify(e.sig, t, e.pubkey);
+      return e[Re] = n, n;
     } catch {
-      return e[Oe] = !1, !1;
+      return e[Re] = !1, !1;
     }
   }
 };
-function uo(e) {
+function lo(e) {
   if (!dt(e))
     throw new Error("can't serialize event with wrong or missing properties");
   return JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content]);
 }
-function qe(e) {
-  let t = fe(ne.encode(uo(e)));
+function He(e) {
+  let t = fe(ne.encode(lo(e)));
   return M(t);
 }
-var pt = new co(), _e = pt.generateSecretKey, le = pt.getPublicKey, X = pt.finalizeEvent, yt = pt.verifyEvent, lo = {};
-D(lo, {
-  Application: () => da,
-  BadgeAward: () => Eo,
-  BadgeDefinition: () => oa,
-  BlockedRelaysList: () => zo,
-  BookmarkList: () => qo,
-  Bookmarksets: () => ra,
-  Calendar: () => Ea,
-  CalendarEventRSVP: () => ma,
-  ChannelCreation: () => $r,
-  ChannelHideMessage: () => Or,
-  ChannelMessage: () => Rr,
-  ChannelMetadata: () => Tr,
-  ChannelMuteUser: () => Mr,
-  ClassifiedListing: () => ga,
-  ClientAuth: () => Hr,
-  CommunitiesList: () => Do,
-  CommunityDefinition: () => Na,
-  CommunityPostApproval: () => _o,
-  Contacts: () => wo,
-  CreateOrUpdateProduct: () => ua,
-  CreateOrUpdateStall: () => ca,
-  Curationsets: () => ia,
-  Date: () => ba,
-  DirectMessageRelaysList: () => Go,
-  DraftClassifiedListing: () => wa,
-  DraftLong: () => fa,
-  Emojisets: () => ha,
-  EncryptedDirectMessage: () => bo,
-  EventDeletion: () => vo,
-  FileMetadata: () => No,
-  FileServerPreference: () => Fo,
-  Followsets: () => ea,
-  GenericRepost: () => xo,
-  Genericlists: () => ta,
-  GiftWrap: () => Pr,
+var pt = new uo(), ke = pt.generateSecretKey, le = pt.getPublicKey, X = pt.finalizeEvent, yt = pt.verifyEvent, fo = {};
+D(fo, {
+  Application: () => pa,
+  BadgeAward: () => mo,
+  BadgeDefinition: () => aa,
+  BlockedRelaysList: () => Vo,
+  BookmarkList: () => Do,
+  Bookmarksets: () => ia,
+  Calendar: () => ma,
+  CalendarEventRSVP: () => xa,
+  ChannelCreation: () => Tr,
+  ChannelHideMessage: () => Mr,
+  ChannelMessage: () => Or,
+  ChannelMetadata: () => Rr,
+  ChannelMuteUser: () => Pr,
+  ClassifiedListing: () => wa,
+  ClientAuth: () => qr,
+  CommunitiesList: () => jo,
+  CommunityDefinition: () => Aa,
+  CommunityPostApproval: () => Io,
+  Contacts: () => bo,
+  CreateOrUpdateProduct: () => la,
+  CreateOrUpdateStall: () => ua,
+  Curationsets: () => sa,
+  Date: () => va,
+  DirectMessageRelaysList: () => Fo,
+  DraftClassifiedListing: () => ba,
+  DraftLong: () => ha,
+  Emojisets: () => da,
+  EncryptedDirectMessage: () => vo,
+  EventDeletion: () => Eo,
+  FileMetadata: () => Ao,
+  FileServerPreference: () => Jo,
+  Followsets: () => ta,
+  GenericRepost: () => No,
+  Genericlists: () => na,
+  GiftWrap: () => Hr,
   HTTPAuth: () => un,
   Handlerinformation: () => Sa,
-  Handlerrecommendation: () => xa,
-  Highlights: () => Oo,
-  InterestsList: () => Wo,
-  Interestsets: () => aa,
-  JobFeedback: () => Lo,
-  JobRequest: () => Io,
-  JobResult: () => Uo,
-  Label: () => ko,
-  LightningPubRPC: () => Yo,
-  LiveChatMessage: () => Ao,
-  LiveEvent: () => pa,
-  LongFormArticle: () => la,
-  Metadata: () => po,
-  Mutelist: () => Mo,
-  NWCWalletInfo: () => Jo,
-  NWCWalletRequest: () => qr,
-  NWCWalletResponse: () => Xo,
-  NostrConnect: () => Qo,
+  Handlerrecommendation: () => Na,
+  Highlights: () => Mo,
+  InterestsList: () => Zo,
+  Interestsets: () => ca,
+  JobFeedback: () => $o,
+  JobRequest: () => Uo,
+  JobResult: () => Lo,
+  Label: () => _o,
+  LightningPubRPC: () => Xo,
+  LiveChatMessage: () => Ko,
+  LiveEvent: () => ya,
+  LongFormArticle: () => fa,
+  Metadata: () => yo,
+  Mutelist: () => Po,
+  NWCWalletInfo: () => Yo,
+  NWCWalletRequest: () => Dr,
+  NWCWalletResponse: () => Qo,
+  NostrConnect: () => ea,
   OpenTimestamps: () => So,
-  Pinlist: () => Po,
-  PrivateDirectMessage: () => mo,
-  ProblemTracker: () => Ko,
-  ProfileBadges: () => sa,
-  PublicChatsList: () => jo,
+  Pinlist: () => Ho,
+  PrivateDirectMessage: () => xo,
+  ProblemTracker: () => Co,
+  ProfileBadges: () => oa,
+  PublicChatsList: () => zo,
   Reaction: () => cn,
-  RecommendRelay: () => go,
-  RelayList: () => Ho,
-  Relaysets: () => na,
-  Report: () => Co,
-  Reporting: () => Bo,
+  RecommendRelay: () => wo,
+  RelayList: () => qo,
+  Relaysets: () => ra,
+  Report: () => Bo,
+  Reporting: () => ko,
   Repost: () => an,
-  Seal: () => Lr,
-  SearchRelaysList: () => Vo,
-  ShortTextNote: () => yo,
-  Time: () => va,
-  UserEmojiList: () => Zo,
-  UserStatuses: () => ya,
-  Zap: () => Ro,
-  ZapGoal: () => $o,
-  ZapRequest: () => To,
-  classifyKind: () => fo,
-  isEphemeralKind: () => Ir,
-  isKind: () => ho,
-  isParameterizedReplaceableKind: () => Ur,
-  isRegularKind: () => kr,
-  isReplaceableKind: () => _r
+  Seal: () => $r,
+  SearchRelaysList: () => Wo,
+  ShortTextNote: () => go,
+  Time: () => Ea,
+  UserEmojiList: () => Go,
+  UserStatuses: () => ga,
+  Zap: () => Oo,
+  ZapGoal: () => To,
+  ZapRequest: () => Ro,
+  classifyKind: () => ho,
+  isEphemeralKind: () => Ur,
+  isKind: () => po,
+  isParameterizedReplaceableKind: () => Lr,
+  isRegularKind: () => _r,
+  isReplaceableKind: () => Ir
 });
-function kr(e) {
+function _r(e) {
   return 1e3 <= e && e < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(e);
 }
-function _r(e) {
+function Ir(e) {
   return [0, 3].includes(e) || 1e4 <= e && e < 2e4;
 }
-function Ir(e) {
+function Ur(e) {
   return 2e4 <= e && e < 3e4;
 }
-function Ur(e) {
+function Lr(e) {
   return 3e4 <= e && e < 4e4;
 }
-function fo(e) {
-  return kr(e) ? "regular" : _r(e) ? "replaceable" : Ir(e) ? "ephemeral" : Ur(e) ? "parameterized" : "unknown";
+function ho(e) {
+  return _r(e) ? "regular" : Ir(e) ? "replaceable" : Ur(e) ? "ephemeral" : Lr(e) ? "parameterized" : "unknown";
 }
-function ho(e, t) {
+function po(e, t) {
   const n = t instanceof Array ? t : [t];
   return dt(e) && n.includes(e.kind) || !1;
 }
-var po = 0, yo = 1, go = 2, wo = 3, bo = 4, vo = 5, an = 6, cn = 7, Eo = 8, Lr = 13, mo = 14, xo = 16, $r = 40, Tr = 41, Rr = 42, Or = 43, Mr = 44, So = 1040, Pr = 1059, No = 1063, Ao = 1311, Ko = 1971, Co = 1984, Bo = 1984, ko = 1985, _o = 4550, Io = 5999, Uo = 6999, Lo = 7e3, $o = 9041, To = 9734, Ro = 9735, Oo = 9802, Mo = 1e4, Po = 10001, Ho = 10002, qo = 10003, Do = 10004, jo = 10005, zo = 10006, Vo = 10007, Wo = 10015, Zo = 10030, Go = 10050, Fo = 10096, Jo = 13194, Yo = 21e3, Hr = 22242, qr = 23194, Xo = 23195, Qo = 24133, un = 27235, ea = 3e4, ta = 30001, na = 30002, ra = 30003, ia = 30004, sa = 30008, oa = 30009, aa = 30015, ca = 30017, ua = 30018, la = 30023, fa = 30024, ha = 30030, da = 30078, pa = 30311, ya = 30315, ga = 30402, wa = 30403, ba = 31922, va = 31923, Ea = 31924, ma = 31925, xa = 31989, Sa = 31990, Na = 34550, Aa = {};
-D(Aa, {
+var yo = 0, go = 1, wo = 2, bo = 3, vo = 4, Eo = 5, an = 6, cn = 7, mo = 8, $r = 13, xo = 14, No = 16, Tr = 40, Rr = 41, Or = 42, Mr = 43, Pr = 44, So = 1040, Hr = 1059, Ao = 1063, Ko = 1311, Co = 1971, Bo = 1984, ko = 1984, _o = 1985, Io = 4550, Uo = 5999, Lo = 6999, $o = 7e3, To = 9041, Ro = 9734, Oo = 9735, Mo = 9802, Po = 1e4, Ho = 10001, qo = 10002, Do = 10003, jo = 10004, zo = 10005, Vo = 10006, Wo = 10007, Zo = 10015, Go = 10030, Fo = 10050, Jo = 10096, Yo = 13194, Xo = 21e3, qr = 22242, Dr = 23194, Qo = 23195, ea = 24133, un = 27235, ta = 3e4, na = 30001, ra = 30002, ia = 30003, sa = 30004, oa = 30008, aa = 30009, ca = 30015, ua = 30017, la = 30018, fa = 30023, ha = 30024, da = 30030, pa = 30078, ya = 30311, ga = 30315, wa = 30402, ba = 30403, va = 31922, Ea = 31923, ma = 31924, xa = 31925, Na = 31989, Sa = 31990, Aa = 34550, Ka = {};
+D(Ka, {
   getHex64: () => ln,
-  getInt: () => Dr,
-  getSubscriptionId: () => Ka,
-  matchEventId: () => Ca,
-  matchEventKind: () => ka,
-  matchEventPubkey: () => Ba
+  getInt: () => jr,
+  getSubscriptionId: () => Ca,
+  matchEventId: () => Ba,
+  matchEventKind: () => _a,
+  matchEventPubkey: () => ka
 });
 function ln(e, t) {
   let n = t.length + 3, r = e.indexOf(`"${t}":`) + n, i = e.slice(r).indexOf('"') + r + 1;
   return e.slice(i, i + 64);
 }
-function Dr(e, t) {
+function jr(e, t) {
   let n = t.length, r = e.indexOf(`"${t}":`) + n + 3, i = e.slice(r), s = Math.min(i.indexOf(","), i.indexOf("}"));
   return parseInt(i.slice(0, s), 10);
 }
-function Ka(e) {
+function Ca(e) {
   let t = e.slice(0, 22).indexOf('"EVENT"');
   if (t === -1)
     return null;
@@ -2576,22 +2576,22 @@ function Ka(e) {
   let s = r + 1 + i;
   return e.slice(r + 1, s);
 }
-function Ca(e, t) {
+function Ba(e, t) {
   return t === ln(e, "id");
 }
-function Ba(e, t) {
+function ka(e, t) {
   return t === ln(e, "pubkey");
 }
-function ka(e, t) {
-  return t === Dr(e, "kind");
+function _a(e, t) {
+  return t === jr(e, "kind");
 }
-var _a = {};
-D(_a, {
-  makeAuthEvent: () => Ia
+var Ia = {};
+D(Ia, {
+  makeAuthEvent: () => Ua
 });
-function Ia(e, t) {
+function Ua(e, t) {
   return {
-    kind: Hr,
+    kind: qr,
     created_at: Math.floor(Date.now() / 1e3),
     tags: [
       ["relay", e],
@@ -2600,31 +2600,31 @@ function Ia(e, t) {
     content: ""
   };
 }
-var Ua;
+var La;
 try {
-  Ua = WebSocket;
+  La = WebSocket;
 } catch {
 }
-var La;
+var $a;
 try {
-  La = WebSocket;
+  $a = WebSocket;
 } catch {
 }
-var $a = {};
-D($a, {
-  BECH32_REGEX: () => jr,
+var Ta = {};
+D(Ta, {
+  BECH32_REGEX: () => zr,
   Bech32MaxSize: () => fn,
-  NostrTypeGuard: () => Ta,
+  NostrTypeGuard: () => Ra,
   decode: () => gt,
   encodeBytes: () => bt,
-  naddrEncode: () => Da,
-  neventEncode: () => qa,
-  noteEncode: () => Pa,
-  nprofileEncode: () => Ha,
-  npubEncode: () => Ma,
-  nsecEncode: () => Oa
+  naddrEncode: () => ja,
+  neventEncode: () => Da,
+  noteEncode: () => Ha,
+  nprofileEncode: () => qa,
+  npubEncode: () => Pa,
+  nsecEncode: () => Ma
 });
-var Ta = {
+var Ra = {
   isNProfile: (e) => /^nprofile1[a-z\d]+$/.test(e || ""),
   isNEvent: (e) => /^nevent1[a-z\d]+$/.test(e || ""),
   isNAddr: (e) => /^naddr1[a-z\d]+$/.test(e || ""),
@@ -2632,14 +2632,14 @@ var Ta = {
   isNPub: (e) => /^npub1[a-z\d]{58}$/.test(e || ""),
   isNote: (e) => /^note1[a-z\d]+$/.test(e || ""),
   isNcryptsec: (e) => /^ncryptsec1[a-z\d]+$/.test(e || "")
-}, fn = 5e3, jr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
-function Ra(e) {
+}, fn = 5e3, zr = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;
+function Oa(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 gt(e) {
   var i, s, o, c, a, l, f;
-  let { prefix: t, words: n } = ze.decode(e, fn), r = new Uint8Array(ze.fromWords(n));
+  let { prefix: t, words: n } = je.decode(e, fn), r = new Uint8Array(je.fromWords(n));
   switch (t) {
     case "nprofile": {
       let u = Ut(r);
@@ -2651,7 +2651,7 @@ function gt(e) {
         type: "nprofile",
         data: {
           pubkey: M(u[0][0]),
-          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
+          relays: u[1] ? u[1].map((p) => ue.decode(p)) : []
         }
       };
     }
@@ -2669,7 +2669,7 @@ function gt(e) {
         type: "nevent",
         data: {
           id: M(u[0][0]),
-          relays: u[1] ? u[1].map((g) => ue.decode(g)) : [],
+          relays: u[1] ? u[1].map((p) => ue.decode(p)) : [],
           author: (o = u[2]) != null && o[0] ? M(u[2][0]) : void 0,
           kind: (c = u[3]) != null && c[0] ? parseInt(M(u[3][0]), 16) : void 0
         }
@@ -2693,7 +2693,7 @@ function gt(e) {
           identifier: ue.decode(u[0][0]),
           pubkey: M(u[2][0]),
           kind: parseInt(M(u[3][0]), 16),
-          relays: u[1] ? u[1].map((g) => ue.decode(g)) : []
+          relays: u[1] ? u[1].map((p) => ue.decode(p)) : []
         }
       };
     }
@@ -2716,32 +2716,32 @@ function Ut(e) {
   }
   return t;
 }
-function Oa(e) {
+function Ma(e) {
   return bt("nsec", e);
 }
-function Ma(e) {
+function Pa(e) {
   return bt("npub", G(e));
 }
-function Pa(e) {
+function Ha(e) {
   return bt("note", G(e));
 }
 function wt(e, t) {
-  let n = ze.toWords(t);
-  return ze.encode(e, n, fn);
+  let n = je.toWords(t);
+  return je.encode(e, n, fn);
 }
 function bt(e, t) {
   return wt(e, t);
 }
-function Ha(e) {
+function qa(e) {
   let t = hn({
     0: [G(e.pubkey)],
     1: (e.relays || []).map((n) => ne.encode(n))
   });
   return wt("nprofile", t);
 }
-function qa(e) {
+function Da(e) {
   let t;
-  e.kind !== void 0 && (t = Ra(e.kind));
+  e.kind !== void 0 && (t = Oa(e.kind));
   let n = hn({
     0: [G(e.id)],
     1: (e.relays || []).map((r) => ne.encode(r)),
@@ -2750,7 +2750,7 @@ function qa(e) {
   });
   return wt("nevent", n);
 }
-function Da(e) {
+function ja(e) {
   let t = new ArrayBuffer(4);
   new DataView(t).setUint32(0, e.kind, !1);
   let n = hn({
@@ -2770,42 +2770,42 @@ function hn(e) {
     });
   }), lt(...t);
 }
-var ja = {};
-D(ja, {
-  decrypt: () => za,
-  encrypt: () => zr
+var za = {};
+D(za, {
+  decrypt: () => Va,
+  encrypt: () => Vr
 });
-async function zr(e, t, n) {
-  const r = e instanceof Uint8Array ? M(e) : e, i = Ue.getSharedSecret(r, "02" + t), s = Vr(i);
-  let o = Uint8Array.from(fr(16)), c = ne.encode(n), a = mr(s, o).encrypt(c), l = he.encode(new Uint8Array(a)), f = he.encode(new Uint8Array(o.buffer));
+async function Vr(e, t, n) {
+  const r = e instanceof Uint8Array ? M(e) : e, i = Ie.getSharedSecret(r, "02" + t), s = Wr(i);
+  let o = Uint8Array.from(hr(16)), c = ne.encode(n), a = xr(s, o).encrypt(c), l = he.encode(new Uint8Array(a)), f = he.encode(new Uint8Array(o.buffer));
   return `${l}?iv=${f}`;
 }
-async function za(e, t, n) {
+async function Va(e, t, n) {
   const r = e instanceof Uint8Array ? M(e) : e;
-  let [i, s] = n.split("?iv="), o = Ue.getSharedSecret(r, "02" + t), c = Vr(o), a = he.decode(s), l = he.decode(i), f = mr(c, a).decrypt(l);
+  let [i, s] = n.split("?iv="), o = Ie.getSharedSecret(r, "02" + t), c = Wr(o), a = he.decode(s), l = he.decode(i), f = xr(c, a).decrypt(l);
   return ue.decode(f);
 }
-function Vr(e) {
+function Wr(e) {
   return e.slice(1, 33);
 }
-var Va = {};
-D(Va, {
+var Wa = {};
+D(Wa, {
   NIP05_REGEX: () => dn,
-  isNip05: () => Wa,
-  isValid: () => Fa,
-  queryProfile: () => Wr,
-  searchDomain: () => Ga,
-  useFetchImplementation: () => Za
+  isNip05: () => Za,
+  isValid: () => Ja,
+  queryProfile: () => Zr,
+  searchDomain: () => Fa,
+  useFetchImplementation: () => Ga
 });
-var dn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Wa = (e) => dn.test(e || ""), vt;
+var dn = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Za = (e) => dn.test(e || ""), vt;
 try {
   vt = fetch;
 } catch {
 }
-function Za(e) {
+function Ga(e) {
   vt = e;
 }
-async function Ga(e, t = "") {
+async function Fa(e, t = "") {
   try {
     const n = `https://${e}/.well-known/nostr.json?name=${t}`, r = await vt(n, { redirect: "manual" });
     if (r.status !== 200)
@@ -2815,7 +2815,7 @@ async function Ga(e, t = "") {
     return {};
   }
 }
-async function Wr(e) {
+async function Zr(e) {
   var i;
   const t = e.match(dn);
   if (!t)
@@ -2831,15 +2831,15 @@ async function Wr(e) {
     return null;
   }
 }
-async function Fa(e, t) {
-  const n = await Wr(t);
+async function Ja(e, t) {
+  const n = await Zr(t);
   return n ? n.pubkey === e : !1;
 }
-var Ja = {};
-D(Ja, {
-  parse: () => Ya
+var Ya = {};
+D(Ya, {
+  parse: () => Xa
 });
-function Ya(e) {
+function Xa(e) {
   const t = {
     reply: void 0,
     root: void 0,
@@ -2906,31 +2906,31 @@ function Ya(e) {
     }
   }), t;
 }
-var Xa = {};
-D(Xa, {
-  fetchRelayInformation: () => ec,
-  useFetchImplementation: () => Qa
+var Qa = {};
+D(Qa, {
+  fetchRelayInformation: () => tc,
+  useFetchImplementation: () => ec
 });
-var Zr;
+var Gr;
 try {
-  Zr = fetch;
+  Gr = fetch;
 } catch {
 }
-function Qa(e) {
-  Zr = e;
+function ec(e) {
+  Gr = e;
 }
-async function ec(e) {
+async function tc(e) {
   return await (await fetch(e.replace("ws://", "http://").replace("wss://", "https://"), {
     headers: { Accept: "application/nostr+json" }
   })).json();
 }
-var tc = {};
-D(tc, {
-  fastEventHash: () => Fr,
-  getPow: () => Gr,
-  minePow: () => nc
+var nc = {};
+D(nc, {
+  fastEventHash: () => Jr,
+  getPow: () => Fr,
+  minePow: () => rc
 });
-function Gr(e) {
+function Fr(e) {
   let t = 0;
   for (let n = 0; n < 64; n += 8) {
     const r = parseInt(e.substring(n, n + 8), 16);
@@ -2943,28 +2943,28 @@ function Gr(e) {
   }
   return t;
 }
-function nc(e, t) {
+function rc(e, t) {
   let n = 0;
   const r = e, i = ["nonce", n.toString(), t.toString()];
   for (r.tags.push(i); ; ) {
     const s = Math.floor((/* @__PURE__ */ new Date()).getTime() / 1e3);
-    if (s !== r.created_at && (n = 0, r.created_at = s), i[1] = (++n).toString(), r.id = Fr(r), Gr(r.id) >= t)
+    if (s !== r.created_at && (n = 0, r.created_at = s), i[1] = (++n).toString(), r.id = Jr(r), Fr(r.id) >= t)
       break;
   }
   return r;
 }
-function Fr(e) {
+function Jr(e) {
   return M(
     fe(ne.encode(JSON.stringify([0, e.pubkey, e.created_at, e.kind, e.tags, e.content])))
   );
 }
-var rc = {};
-D(rc, {
-  finishRepostEvent: () => ic,
-  getRepostedEvent: () => sc,
-  getRepostedEventPointer: () => Jr
+var ic = {};
+D(ic, {
+  finishRepostEvent: () => sc,
+  getRepostedEvent: () => oc,
+  getRepostedEventPointer: () => Yr
 });
-function ic(e, t, n, r) {
+function sc(e, t, n, r) {
   return X(
     {
       kind: an,
@@ -2975,7 +2975,7 @@ function ic(e, t, n, r) {
     r
   );
 }
-function Jr(e) {
+function Yr(e) {
   if (e.kind !== an)
     return;
   let t, n;
@@ -2990,8 +2990,8 @@ function Jr(e) {
       author: n == null ? void 0 : n[1]
     };
 }
-function sc(e, { skipVerification: t } = {}) {
-  const n = Jr(e);
+function oc(e, { skipVerification: t } = {}) {
+  const n = Yr(e);
   if (n === void 0 || e.content === "")
     return;
   let r;
@@ -3003,17 +3003,17 @@ function sc(e, { skipVerification: t } = {}) {
   if (r.id === n.id && !(!t && !yt(r)))
     return r;
 }
-var oc = {};
-D(oc, {
+var ac = {};
+D(ac, {
   NOSTR_URI_REGEX: () => Et,
-  parse: () => cc,
-  test: () => ac
+  parse: () => uc,
+  test: () => cc
 });
-var Et = new RegExp(`nostr:(${jr.source})`);
-function ac(e) {
+var Et = new RegExp(`nostr:(${zr.source})`);
+function cc(e) {
   return typeof e == "string" && new RegExp(`^${Et.source}$`).test(e);
 }
-function cc(e) {
+function uc(e) {
   const t = e.match(new RegExp(`^${Et.source}$`));
   if (!t)
     throw new Error(`Invalid Nostr URI: ${e}`);
@@ -3023,12 +3023,12 @@ function cc(e) {
     decoded: gt(t[1])
   };
 }
-var uc = {};
-D(uc, {
-  finishReactionEvent: () => lc,
-  getReactedEventPointer: () => fc
+var lc = {};
+D(lc, {
+  finishReactionEvent: () => fc,
+  getReactedEventPointer: () => hc
 });
-function lc(e, t, n) {
+function fc(e, t, n) {
   const r = t.tags.filter((i) => i.length >= 2 && (i[0] === "e" || i[0] === "p"));
   return X(
     {
@@ -3040,7 +3040,7 @@ function lc(e, t, n) {
     n
   );
 }
-function fc(e) {
+function hc(e) {
   if (e.kind !== cn)
     return;
   let t, n;
@@ -3055,14 +3055,14 @@ function fc(e) {
       author: n[1]
     };
 }
-var hc = {};
-D(hc, {
-  matchAll: () => dc,
+var dc = {};
+D(dc, {
+  matchAll: () => pc,
   regex: () => pn,
-  replaceAll: () => pc
+  replaceAll: () => yc
 });
 var pn = () => new RegExp(`\\b${Et.source}\\b`, "g");
-function* dc(e) {
+function* pc(e) {
   const t = e.matchAll(pn());
   for (const n of t)
     try {
@@ -3077,22 +3077,22 @@ function* dc(e) {
     } catch {
     }
 }
-function pc(e, t) {
+function yc(e, t) {
   return e.replaceAll(pn(), (n, r) => t({
     uri: n,
     value: r,
     decoded: gt(r)
   }));
 }
-var yc = {};
-D(yc, {
-  channelCreateEvent: () => gc,
-  channelHideMessageEvent: () => vc,
-  channelMessageEvent: () => bc,
-  channelMetadataEvent: () => wc,
-  channelMuteUserEvent: () => Ec
+var gc = {};
+D(gc, {
+  channelCreateEvent: () => wc,
+  channelHideMessageEvent: () => Ec,
+  channelMessageEvent: () => vc,
+  channelMetadataEvent: () => bc,
+  channelMuteUserEvent: () => mc
 });
-var gc = (e, t) => {
+var wc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3102,14 +3102,14 @@ var gc = (e, t) => {
     return;
   return X(
     {
-      kind: $r,
+      kind: Tr,
       tags: [...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, wc = (e, t) => {
+}, bc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3119,25 +3119,25 @@ var gc = (e, t) => {
     return;
   return X(
     {
-      kind: Tr,
+      kind: Rr,
       tags: [["e", e.channel_create_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, bc = (e, t) => {
+}, vc = (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"]), X(
     {
-      kind: Rr,
+      kind: Or,
       tags: [...n, ...e.tags ?? []],
       content: e.content,
       created_at: e.created_at
     },
     t
   );
-}, vc = (e, t) => {
+}, Ec = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3147,14 +3147,14 @@ var gc = (e, t) => {
     return;
   return X(
     {
-      kind: Or,
+      kind: Mr,
       tags: [["e", e.channel_message_event_id], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, Ec = (e, t) => {
+}, mc = (e, t) => {
   let n;
   if (typeof e.content == "object")
     n = JSON.stringify(e.content);
@@ -3164,22 +3164,22 @@ var gc = (e, t) => {
     return;
   return X(
     {
-      kind: Mr,
+      kind: Pr,
       tags: [["p", e.pubkey_to_mute], ...e.tags ?? []],
       content: n,
       created_at: e.created_at
     },
     t
   );
-}, mc = {};
-D(mc, {
-  EMOJI_SHORTCODE_REGEX: () => Yr,
-  matchAll: () => xc,
+}, xc = {};
+D(xc, {
+  EMOJI_SHORTCODE_REGEX: () => Xr,
+  matchAll: () => Nc,
   regex: () => yn,
   replaceAll: () => Sc
 });
-var Yr = /:(\w+):/, yn = () => new RegExp(`\\B${Yr.source}\\B`, "g");
-function* xc(e) {
+var Xr = /:(\w+):/, yn = () => new RegExp(`\\B${Xr.source}\\B`, "g");
+function* Nc(e) {
   const t = e.matchAll(yn());
   for (const n of t)
     try {
@@ -3199,20 +3199,20 @@ function Sc(e, t) {
     name: r
   }));
 }
-var Nc = {};
-D(Nc, {
-  useFetchImplementation: () => Ac,
-  validateGithub: () => Kc
+var Ac = {};
+D(Ac, {
+  useFetchImplementation: () => Kc,
+  validateGithub: () => Cc
 });
 var gn;
 try {
   gn = fetch;
 } catch {
 }
-function Ac(e) {
+function Kc(e) {
   gn = e;
 }
-async function Kc(e, t, n) {
+async function Cc(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}`;
   } catch {
@@ -3224,15 +3224,15 @@ D(q, {
   decrypt: () => En,
   encrypt: () => vn,
   getConversationKey: () => wn,
-  v2: () => Ic
+  v2: () => Uc
 });
-var Xr = 1, Qr = 65535;
+var Qr = 1, ei = 65535;
 function wn(e, t) {
-  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
+  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
   return sn(fe, n, "nip44-v2");
 }
-function ei(e, t) {
-  const n = Cr(fe, e, t, 76);
+function ti(e, t) {
+  const n = Br(fe, e, t, 76);
   return {
     chacha_key: n.subarray(0, 32),
     chacha_nonce: n.subarray(32, 44),
@@ -3247,29 +3247,29 @@ function bn(e) {
   const t = 1 << Math.floor(Math.log2(e - 1)) + 1, n = t <= 256 ? 32 : t / 8;
   return n * (Math.floor((e - 1) / n) + 1);
 }
-function Cc(e) {
-  if (!Number.isSafeInteger(e) || e < Xr || e > Qr)
+function Bc(e) {
+  if (!Number.isSafeInteger(e) || e < Qr || e > ei)
     throw new Error("invalid plaintext size: must be between 1 and 65535 bytes");
   const t = new Uint8Array(2);
   return new DataView(t.buffer).setUint16(0, e, !1), t;
 }
-function Bc(e) {
-  const t = ne.encode(e), n = t.length, r = Cc(n), i = new Uint8Array(bn(n) - n);
+function kc(e) {
+  const t = ne.encode(e), n = t.length, r = Bc(n), i = new Uint8Array(bn(n) - n);
   return lt(r, t, i);
 }
-function kc(e) {
+function _c(e) {
   const t = new DataView(e.buffer).getUint16(0), n = e.subarray(2, 2 + t);
-  if (t < Xr || t > Qr || n.length !== t || e.length !== 2 + bn(t))
+  if (t < Qr || t > ei || n.length !== t || e.length !== 2 + bn(t))
     throw new Error("invalid padding");
   return ue.decode(n);
 }
-function ti(e, t, n) {
+function ni(e, t, n) {
   if (n.length !== 32)
     throw new Error("AAD associated data must be 32 bytes");
   const r = lt(n, t);
   return ht(fe, e, r);
 }
-function _c(e) {
+function Ic(e) {
   if (typeof e != "string")
     throw new Error("payload must be a valid string");
   const t = e.length;
@@ -3295,70 +3295,70 @@ function _c(e) {
     mac: n.subarray(-32)
   };
 }
-function vn(e, t, n = fr(32)) {
-  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ei(t, n), o = Bc(e), c = Ar(r, i, o), a = ti(s, c, n);
+function vn(e, t, n = hr(32)) {
+  const { chacha_key: r, chacha_nonce: i, hmac_key: s } = ti(t, n), o = kc(e), c = Kr(r, i, o), a = ni(s, c, n);
   return he.encode(lt(new Uint8Array([2]), n, c, a));
 }
 function En(e, t) {
-  const { nonce: n, ciphertext: r, mac: i } = _c(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = ei(t, n), a = ti(c, r, n);
-  if (!Rs(a, i))
+  const { nonce: n, ciphertext: r, mac: i } = Ic(e), { chacha_key: s, chacha_nonce: o, hmac_key: c } = ti(t, n), a = ni(c, r, n);
+  if (!Os(a, i))
     throw new Error("invalid MAC");
-  const l = Ar(s, o, r);
-  return kc(l);
+  const l = Kr(s, o, r);
+  return _c(l);
 }
-var Ic = {
+var Uc = {
   utils: {
     getConversationKey: wn,
     calcPaddedLen: bn
   },
   encrypt: vn,
   decrypt: En
-}, Uc = {};
-D(Uc, {
-  makeNwcRequestEvent: () => $c,
-  parseConnectionString: () => Lc
+}, Lc = {};
+D(Lc, {
+  makeNwcRequestEvent: () => Tc,
+  parseConnectionString: () => $c
 });
-function Lc(e) {
+function $c(e) {
   const { pathname: t, searchParams: n } = new URL(e), r = t, i = n.get("relay"), s = n.get("secret");
   if (!r || !i || !s)
     throw new Error("invalid connection string");
   return { pubkey: r, relay: i, secret: s };
 }
-async function $c(e, t, n) {
-  const i = await zr(t, e, JSON.stringify({
+async function Tc(e, t, n) {
+  const i = await Vr(t, e, JSON.stringify({
     method: "pay_invoice",
     params: {
       invoice: n
     }
   })), s = {
-    kind: qr,
+    kind: Dr,
     created_at: Math.round(Date.now() / 1e3),
     content: i,
     tags: [["p", e]]
   };
   return X(s, t);
 }
-var Tc = {};
-D(Tc, {
-  getZapEndpoint: () => Oc,
-  makeZapReceipt: () => Hc,
-  makeZapRequest: () => Mc,
-  useFetchImplementation: () => Rc,
-  validateZapRequest: () => Pc
+var Rc = {};
+D(Rc, {
+  getZapEndpoint: () => Mc,
+  makeZapReceipt: () => qc,
+  makeZapRequest: () => Pc,
+  useFetchImplementation: () => Oc,
+  validateZapRequest: () => Hc
 });
 var mn;
 try {
   mn = fetch;
 } catch {
 }
-function Rc(e) {
+function Oc(e) {
   mn = e;
 }
-async function Oc(e) {
+async function Mc(e) {
   try {
     let t = "", { lud06: n, lud16: r } = JSON.parse(e.content);
     if (n) {
-      let { words: o } = ze.decode(n, 1e3), c = ze.fromWords(o);
+      let { words: o } = je.decode(n, 1e3), c = je.fromWords(o);
       t = ue.decode(c);
     } else if (r) {
       let [o, c] = r.split("@");
@@ -3372,7 +3372,7 @@ async function Oc(e) {
   }
   return null;
 }
-function Mc({
+function Pc({
   profile: e,
   event: t,
   amount: n,
@@ -3395,7 +3395,7 @@ function Mc({
   };
   return t && s.tags.push(["e", t]), s;
 }
-function Pc(e) {
+function Hc(e) {
   let t;
   try {
     t = JSON.parse(e);
@@ -3414,7 +3414,7 @@ function Pc(e) {
   let r = t.tags.find(([s, o]) => s === "e" && o);
   return r && !r[1].match(/^[a-f0-9]{64}$/) ? "Zap request 'e' tag is not valid hex." : t.tags.find(([s, o]) => s === "relays" && o) ? null : "Zap request doesn't have a 'relays' tag.";
 }
-function Hc({
+function qc({
   zapRequest: e,
   preimage: t,
   bolt11: n,
@@ -3428,55 +3428,55 @@ function Hc({
   };
   return t && o.tags.push(["preimage", t]), o;
 }
-var qc = {};
-D(qc, {
-  createRumor: () => oi,
-  createSeal: () => ai,
-  createWrap: () => ci,
-  unwrapEvent: () => ui,
-  unwrapManyEvents: () => zc,
+var Dc = {};
+D(Dc, {
+  createRumor: () => ai,
+  createSeal: () => ci,
+  createWrap: () => ui,
+  unwrapEvent: () => li,
+  unwrapManyEvents: () => Vc,
   wrapEvent: () => Wt,
-  wrapManyEvents: () => jc
+  wrapManyEvents: () => zc
 });
-var Dc = 2 * 24 * 60 * 60, ni = () => Math.round(Date.now() / 1e3), ri = () => Math.round(ni() - Math.random() * Dc), ii = (e, t) => wn(e, t), si = (e, t, n) => vn(JSON.stringify(e), ii(t, n)), Dn = (e, t) => JSON.parse(En(e.content, ii(t, e.pubkey)));
-function oi(e, t) {
+var jc = 2 * 24 * 60 * 60, ri = () => Math.round(Date.now() / 1e3), ii = () => Math.round(ri() - Math.random() * jc), si = (e, t) => wn(e, t), oi = (e, t, n) => vn(JSON.stringify(e), si(t, n)), Dn = (e, t) => JSON.parse(En(e.content, si(t, e.pubkey)));
+function ai(e, t) {
   const n = {
-    created_at: ni(),
+    created_at: ri(),
     content: "",
     tags: [],
     ...e,
     pubkey: le(t)
   };
-  return n.id = qe(n), n;
+  return n.id = He(n), n;
 }
-function ai(e, t, n) {
+function ci(e, t, n) {
   return X(
     {
-      kind: Lr,
-      content: si(e, t, n),
-      created_at: ri(),
+      kind: $r,
+      content: oi(e, t, n),
+      created_at: ii(),
       tags: []
     },
     t
   );
 }
-function ci(e, t) {
-  const n = _e();
+function ui(e, t) {
+  const n = ke();
   return X(
     {
-      kind: Pr,
-      content: si(e, n, t),
-      created_at: ri(),
+      kind: Hr,
+      content: oi(e, n, t),
+      created_at: ii(),
       tags: [["p", t]]
     },
     n
   );
 }
 function Wt(e, t, n) {
-  const r = oi(e, t), i = ai(r, t, n);
-  return ci(i, n);
+  const r = ai(e, t), i = ci(r, t, n);
+  return ui(i, n);
 }
-function jc(e, t, n) {
+function zc(e, t, n) {
   if (!n || n.length === 0)
     throw new Error("At least one recipient is required.");
   const r = le(t), i = [Wt(e, t, r)];
@@ -3484,31 +3484,31 @@ function jc(e, t, n) {
     i.push(Wt(e, t, s));
   }), i;
 }
-function ui(e, t) {
+function li(e, t) {
   const n = Dn(e, t);
   return Dn(n, t);
 }
-function zc(e, t) {
+function Vc(e, t) {
   let n = [];
   return e.forEach((r) => {
-    n.push(ui(r, t));
+    n.push(li(r, t));
   }), n.sort((r, i) => r.created_at - i.created_at), n;
 }
-var Vc = {};
-D(Vc, {
-  getToken: () => Wc,
+var Wc = {};
+D(Wc, {
+  getToken: () => Zc,
   hashPayload: () => xn,
-  unpackEventFromToken: () => fi,
-  validateEvent: () => wi,
-  validateEventKind: () => di,
-  validateEventMethodTag: () => yi,
-  validateEventPayloadTag: () => gi,
-  validateEventTimestamp: () => hi,
-  validateEventUrlTag: () => pi,
-  validateToken: () => Zc
+  unpackEventFromToken: () => hi,
+  validateEvent: () => bi,
+  validateEventKind: () => pi,
+  validateEventMethodTag: () => gi,
+  validateEventPayloadTag: () => wi,
+  validateEventTimestamp: () => di,
+  validateEventUrlTag: () => yi,
+  validateToken: () => Gc
 });
-var li = "Nostr ";
-async function Wc(e, t, n, r = !1, i) {
+var fi = "Nostr ";
+async function Zc(e, t, n, r = !1, i) {
   const s = {
     kind: un,
     tags: [
@@ -3520,36 +3520,36 @@ async function Wc(e, t, n, r = !1, i) {
   };
   i && s.tags.push(["payload", xn(i)]);
   const o = await n(s);
-  return (r ? li : "") + he.encode(ne.encode(JSON.stringify(o)));
+  return (r ? fi : "") + he.encode(ne.encode(JSON.stringify(o)));
 }
-async function Zc(e, t, n) {
-  const r = await fi(e).catch((s) => {
+async function Gc(e, t, n) {
+  const r = await hi(e).catch((s) => {
     throw s;
   });
-  return await wi(r, t, n).catch((s) => {
+  return await bi(r, t, n).catch((s) => {
     throw s;
   });
 }
-async function fi(e) {
+async function hi(e) {
   if (!e)
     throw new Error("Missing token");
-  e = e.replace(li, "");
+  e = e.replace(fi, "");
   const t = ue.decode(he.decode(e));
   if (!t || t.length === 0 || !t.startsWith("{"))
     throw new Error("Invalid token");
   return JSON.parse(t);
 }
-function hi(e) {
+function di(e) {
   return e.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - e.created_at < 60 : !1;
 }
-function di(e) {
+function pi(e) {
   return e.kind === un;
 }
-function pi(e, t) {
+function yi(e, t) {
   const n = e.tags.find((r) => r[0] === "u");
   return n ? n.length > 0 && n[1] === t : !1;
 }
-function yi(e, t) {
+function gi(e, t) {
   const n = e.tags.find((r) => r[0] === "method");
   return n ? n.length > 0 && n[1].toLowerCase() === t.toLowerCase() : !1;
 }
@@ -3557,30 +3557,30 @@ function xn(e) {
   const t = fe(ne.encode(JSON.stringify(e)));
   return M(t);
 }
-function gi(e, t) {
+function wi(e, t) {
   const n = e.tags.find((i) => i[0] === "payload");
   if (!n)
     return !1;
   const r = xn(t);
   return n.length > 0 && n[1] === r;
 }
-async function wi(e, t, n, r) {
+async function bi(e, t, n, r) {
   if (!yt(e))
     throw new Error("Invalid nostr event, signature invalid");
-  if (!di(e))
+  if (!pi(e))
     throw new Error("Invalid nostr event, kind invalid");
-  if (!hi(e))
+  if (!di(e))
     throw new Error("Invalid nostr event, created_at timestamp invalid");
-  if (!pi(e, t))
+  if (!yi(e, t))
     throw new Error("Invalid nostr event, url tag invalid");
-  if (!yi(e, n))
+  if (!gi(e, n))
     throw new Error("Invalid nostr event, method tag invalid");
-  if (r && typeof r == "object" && Object.keys(r).length > 0 && !gi(e, r))
+  if (r && typeof r == "object" && Object.keys(r).length > 0 && !wi(e, r))
     throw new Error("Invalid nostr event, payload tag does not match request body hash");
   return !0;
 }
-const Be = 30078, jn = 30078, Gc = 14, ru = 100;
-function iu(e) {
+const Ge = 30078, jn = 30078, zn = 1059, Fc = 14, au = 100;
+function cu(e) {
   return JSON.stringify({
     rootKey: M(e.rootKey),
     theirCurrentNostrPublicKey: e.theirCurrentNostrPublicKey,
@@ -3612,7 +3612,7 @@ function iu(e) {
     )
   });
 }
-function su(e) {
+function uu(e) {
   const t = JSON.parse(e);
   return {
     rootKey: G(t.rootKey),
@@ -3645,7 +3645,7 @@ function su(e) {
     )
   };
 }
-async function* ou(e) {
+async function* lu(e) {
   const t = [];
   let n = null;
   const r = e.onEvent((i) => {
@@ -3660,21 +3660,21 @@ async function* ou(e) {
     r();
   }
 }
-function Me(e, t = new Uint8Array(32), n = 1) {
+function Oe(e, t = new Uint8Array(32), n = 1) {
   const r = sn(fe, e, t), i = [];
   for (let s = 1; s <= n; s++)
-    i.push(Cr(fe, r, new Uint8Array([s]), 32));
+    i.push(Br(fe, r, new Uint8Array([s]), 32));
   return i;
 }
 function Lt(e, t) {
   return `${e}:${t}`;
 }
-function au(e) {
+function fu(e) {
   var n;
   const t = (n = e.tags) == null ? void 0 : n.find((r) => r[0] === "ms");
   return t ? parseInt(t[1]) : e.created_at * 1e3;
 }
-const Fc = 1e3, Jc = "0000000000000000000000000000000000000000000000000000000000000000";
+const Jc = 1e3, Yc = "0000000000000000000000000000000000000000000000000000000000000000";
 class st {
   // 1. CHANNEL PUBLIC INTERFACE
   constructor(t, n) {
@@ -3696,10 +3696,10 @@ class st {
    * @returns A new Session instance
    */
   static init(t, n, r, i, s, o) {
-    const c = _e(), [a, l] = Me(s, q.getConversationKey(c, n), 2);
+    const c = ke(), [a, l] = Oe(s, q.getConversationKey(c, n), 2);
     let f, u;
     i ? (f = { publicKey: le(r), privateKey: r }, u = { publicKey: le(c), privateKey: c }) : u = { publicKey: le(r), privateKey: r };
-    const g = {
+    const p = {
       rootKey: i ? a : s,
       theirNextNostrPublicKey: n,
       ourCurrentNostrKey: f,
@@ -3711,7 +3711,7 @@ class st {
       previousSendingChainMessageCount: 0,
       skippedMessageKeys: {},
       skippedHeaderKeys: {}
-    }, b = new st(t, g);
+    }, b = new st(t, p);
     return o && (b.name = o), b;
   }
   /**
@@ -3724,7 +3724,7 @@ class st {
   send(t) {
     return this.sendEvent({
       content: t,
-      kind: Gc
+      kind: Fc
     });
   }
   /**
@@ -3742,18 +3742,18 @@ class st {
     const n = Date.now(), r = {
       ...t,
       content: t.content || "",
-      kind: t.kind || Be,
+      kind: t.kind || Ge,
       created_at: t.created_at || Math.floor(n / 1e3),
       tags: t.tags || [],
-      pubkey: t.pubkey || Jc
+      pubkey: t.pubkey || Yc
     };
-    r.tags.some(([l]) => l === "ms") || r.tags.push(["ms", String(n)]), r.id = qe(r);
+    r.tags.some(([l]) => l === "ms") || r.tags.push(["ms", String(n)]), r.id = He(r);
     const [i, s] = this.ratchetEncrypt(JSON.stringify(r)), o = q.getConversationKey(this.state.ourCurrentNostrKey.privateKey, this.state.theirNextNostrPublicKey), c = q.encrypt(JSON.stringify(i), o);
     return { event: X({
       content: s,
-      kind: Be,
+      kind: Ge,
       tags: [["header", c]],
-      created_at: Math.floor(Date.now() / 1e3)
+      created_at: Math.floor(n / 1e3)
     }, this.state.ourCurrentNostrKey.privateKey), innerEvent: r };
   }
   /**
@@ -3774,7 +3774,7 @@ class st {
   }
   // 2. RATCHET FUNCTIONS
   ratchetEncrypt(t) {
-    const [n, r] = Me(this.state.sendingChainKey, new Uint8Array([1]), 2);
+    const [n, r] = Oe(this.state.sendingChainKey, new Uint8Array([1]), 2);
     return this.state.sendingChainKey = n, [{
       number: this.state.sendingChainMessageNumber++,
       nextPublicKey: this.state.ourNextNostrKey.publicKey,
@@ -3785,7 +3785,7 @@ class st {
     const i = this.trySkippedMessageKeys(t, n, r);
     if (i) return i;
     this.skipMessageKeys(t.number, r);
-    const [s, o] = Me(this.state.receivingChainKey, new Uint8Array([1]), 2);
+    const [s, o] = Oe(this.state.receivingChainKey, new Uint8Array([1]), 2);
     this.state.receivingChainKey = s, this.state.receivingChainMessageNumber++;
     try {
       return q.decrypt(n, o);
@@ -3800,22 +3800,22 @@ class st {
   }
   ratchetStep(t) {
     this.state.previousSendingChainMessageCount = this.state.sendingChainMessageNumber, this.state.sendingChainMessageNumber = 0, this.state.receivingChainMessageNumber = 0, this.state.theirNextNostrPublicKey = t;
-    const n = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [r, i] = Me(this.state.rootKey, n, 2);
+    const n = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [r, i] = Oe(this.state.rootKey, n, 2);
     this.state.receivingChainKey = i, this.state.ourCurrentNostrKey = this.state.ourNextNostrKey;
-    const s = _e();
+    const s = ke();
     this.state.ourNextNostrKey = {
       publicKey: le(s),
       privateKey: s
     };
-    const o = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [c, a] = Me(r, o, 2);
+    const o = q.getConversationKey(this.state.ourNextNostrKey.privateKey, this.state.theirNextNostrPublicKey), [c, a] = Oe(r, o, 2);
     this.state.rootKey = c, this.state.sendingChainKey = a;
   }
   // 3. MESSAGE KEY FUNCTIONS
   skipMessageKeys(t, n) {
-    if (this.state.receivingChainMessageNumber + Fc < t)
+    if (this.state.receivingChainMessageNumber + Jc < t)
       throw new Error("Too many skipped messages");
     for (; this.state.receivingChainMessageNumber < t; ) {
-      const [r, i] = Me(this.state.receivingChainKey, new Uint8Array([1]), 2);
+      const [r, i] = Oe(this.state.receivingChainKey, new Uint8Array([1]), 2);
       this.state.receivingChainKey = r;
       const s = Lt(n, this.state.receivingChainMessageNumber);
       if (this.state.skippedMessageKeys[s] = i, !this.state.skippedHeaderKeys[n]) {
@@ -3831,11 +3831,10 @@ class st {
     }
   }
   trySkippedMessageKeys(t, n, r) {
-    var s;
     const i = Lt(r, t.number);
     if (i in this.state.skippedMessageKeys) {
-      const o = this.state.skippedMessageKeys[i];
-      return delete this.state.skippedMessageKeys[i], Object.keys(this.state.skippedMessageKeys).some((a) => a.startsWith(`${r}:`)) || (delete this.state.skippedHeaderKeys[r], (s = this.nostrUnsubscribe) == null || s.call(this), this.nostrUnsubscribe = void 0), q.decrypt(n, o);
+      const s = this.state.skippedMessageKeys[i];
+      return delete this.state.skippedMessageKeys[i], Object.keys(this.state.skippedMessageKeys).some((c) => c.startsWith(`${r}:`)) || delete this.state.skippedHeaderKeys[r], q.decrypt(n, s);
     }
     return null;
   }
@@ -3868,7 +3867,7 @@ class st {
     const [n, r, i] = this.decryptHeader(t);
     if (!i)
       this.state.theirNextNostrPublicKey !== n.nextPublicKey && (this.state.theirCurrentNostrPublicKey = this.state.theirNextNostrPublicKey, this.state.theirNextNostrPublicKey = n.nextPublicKey, (c = this.nostrUnsubscribe) == null || c.call(this), this.nostrUnsubscribe = this.nostrNextUnsubscribe, this.nostrNextUnsubscribe = this.nostrSubscribe(
-        { authors: [this.state.theirNextNostrPublicKey], kinds: [Be] },
+        { authors: [this.state.theirNextNostrPublicKey], kinds: [Ge] },
         (a) => this.handleNostrEvent(a)
       )), r && (this.skipMessageKeys(n.previousChainLength, t.pubkey), this.ratchetStep(n.nextPublicKey));
     else if (!(Lt(t.pubkey, n.number) in this.state.skippedMessageKeys))
@@ -3878,7 +3877,7 @@ class st {
       console.error("Invalid event received", o);
       return;
     }
-    if (o.id !== qe(o)) {
+    if (o.id !== He(o)) {
       console.error("Event hash does not match", o);
       return;
     }
@@ -3887,12 +3886,12 @@ class st {
   subscribeToNostrEvents() {
     if (this.nostrNextUnsubscribe) return;
     this.nostrNextUnsubscribe = this.nostrSubscribe(
-      { authors: [this.state.theirNextNostrPublicKey], kinds: [Be] },
+      { authors: [this.state.theirNextNostrPublicKey], kinds: [Ge] },
       (n) => this.handleNostrEvent(n)
     );
     const t = Object.keys(this.state.skippedHeaderKeys);
     this.state.theirCurrentNostrPublicKey && !t.includes(this.state.theirCurrentNostrPublicKey) && t.push(this.state.theirCurrentNostrPublicKey), this.nostrUnsubscribe = this.nostrSubscribe(
-      { authors: t, kinds: [Be] },
+      { authors: t, kinds: [Ge] },
       (n) => this.handleNostrEvent(n)
     );
   }
@@ -3900,18 +3899,19 @@ class st {
 new TextDecoder("utf-8");
 new TextEncoder();
 function Qe(e, t) {
-  const n = Ue.getSharedSecret(e, "02" + t).subarray(1, 33);
+  const n = Ie.getSharedSecret(e, "02" + t).subarray(1, 33);
   return sn(fe, n, "nip44-v2");
 }
-class Pe {
+const Xc = 2 * 24 * 60 * 60, Qc = () => Math.round(Date.now() / 1e3), eu = () => Math.round(Qc() - Math.random() * Xc);
+class Me {
   constructor(t, n, r, i, s, o, c = []) {
     this.inviterEphemeralPublicKey = t, this.sharedSecret = n, this.inviter = r, this.inviterEphemeralPrivateKey = i, this.label = s, this.maxUses = o, this.usedBy = c;
   }
   static createNew(t, n, r) {
     if (!t)
       throw new Error("Inviter public key is required");
-    const i = _e(), s = le(i), o = M(_e());
-    return new Pe(
+    const i = ke(), s = le(i), o = M(ke());
+    return new Me(
       s,
       o,
       t,
@@ -3934,7 +3934,7 @@ class Pe {
     const { inviter: o, ephemeralKey: c, sharedSecret: a } = s;
     if (!o || !c || !a)
       throw new Error("Missing required fields (inviter, ephemeralKey, sharedSecret) in invite data.");
-    return new Pe(
+    return new Me(
       c,
       a,
       o
@@ -3942,7 +3942,7 @@ class Pe {
   }
   static deserialize(t) {
     const n = JSON.parse(t);
-    return new Pe(
+    return new Me(
       n.inviterEphemeralPublicKey,
       n.sharedSecret,
       n.inviter,
@@ -3964,7 +3964,7 @@ class Pe {
     const r = (o = n.find(([a]) => a === "ephemeralKey")) == null ? void 0 : o[1], i = (c = n.find(([a]) => a === "sharedSecret")) == null ? void 0 : c[1], s = t.pubkey;
     if (!r || !i)
       throw new Error("Invalid invite event: missing session key or sharedSecret");
-    return new Pe(
+    return new Me(
       r,
       i,
       s
@@ -3975,14 +3975,14 @@ class Pe {
       kinds: [jn],
       authors: [t],
       limit: 1,
-      "#d": ["nostr-double-ratchet/invites/public"]
+      "#d": ["double-ratchet/invites/public"]
     };
     let s = 0;
     return n(i, (c) => {
       if (!(!c.created_at || c.created_at <= s)) {
         s = c.created_at;
         try {
-          const a = Pe.fromEvent(c);
+          const a = Me.fromEvent(c);
           r(a);
         } catch (a) {
           console.error("Error processing invite:", a, "event:", c);
@@ -4024,8 +4024,8 @@ class Pe {
       tags: [
         ["ephemeralKey", this.inviterEphemeralPublicKey],
         ["sharedSecret", this.sharedSecret],
-        ["d", "nostr-double-ratchet/invites/public"],
-        ["l", "nostr-double-ratchet/invites"]
+        ["d", "double-ratchet/invites/public"],
+        ["l", "double-ratchet/invites"]
       ]
     };
   }
@@ -4045,25 +4045,24 @@ class Pe {
        * so the inviter can create the session on their side.
        */
   async accept(t, n, r) {
-    const i = _e(), s = le(i), o = this.inviter || this.inviterEphemeralPublicKey, c = G(this.sharedSecret), a = st.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), l = _e(), f = le(l), g = await (typeof r == "function" ? r : (h, d) => Promise.resolve(q.encrypt(h, Qe(r, d))))(s, o), b = {
+    const i = ke(), s = le(i), o = this.inviter || this.inviterEphemeralPublicKey, c = G(this.sharedSecret), a = st.init(t, this.inviterEphemeralPublicKey, i, !0, c, void 0), f = await (typeof r == "function" ? r : (h, d) => Promise.resolve(q.encrypt(h, Qe(r, d))))(s, o), u = {
       pubkey: n,
-      tags: [["sharedSecret", this.sharedSecret]],
-      content: await q.encrypt(g, c),
+      content: await q.encrypt(f, c),
       created_at: Math.floor(Date.now() / 1e3)
-    }, p = {
-      kind: Be,
-      pubkey: f,
-      content: q.encrypt(JSON.stringify(b), Qe(l, this.inviterEphemeralPublicKey)),
-      created_at: Math.floor(Date.now() / 1e3),
+    }, p = ke(), b = le(p), y = {
+      kind: zn,
+      pubkey: b,
+      content: q.encrypt(JSON.stringify(u), Qe(p, this.inviterEphemeralPublicKey)),
+      created_at: eu(),
       tags: [["p", this.inviterEphemeralPublicKey]]
     };
-    return { session: a, event: X(p, l) };
+    return { session: a, event: X(y, p) };
   }
   listen(t, n, r) {
     if (!this.inviterEphemeralPrivateKey)
       throw new Error("Inviter session key is not available");
     const i = {
-      kinds: [Be],
+      kinds: [zn],
       "#p": [this.inviterEphemeralPublicKey]
     };
     return n(i, async (s) => {
@@ -4072,15 +4071,10 @@ class Pe {
           console.error("Invite has reached maximum number of uses");
           return;
         }
-        const o = await q.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o);
-        if (!c.tags || !c.tags.some(([h, d]) => h === "sharedSecret" && d === this.sharedSecret)) {
-          console.error("Invalid secret from event", s);
-          return;
-        }
-        const a = G(this.sharedSecret), l = c.pubkey;
+        const o = await q.decrypt(s.content, Qe(this.inviterEphemeralPrivateKey, s.pubkey)), c = JSON.parse(o), a = G(this.sharedSecret), l = c.pubkey;
         this.usedBy.push(l);
-        const f = await q.decrypt(c.content, a), g = await (typeof t == "function" ? t : (h, d) => Promise.resolve(q.decrypt(h, Qe(t, d))))(f, l), b = s.id, p = st.init(n, g, this.inviterEphemeralPrivateKey, !1, a, b);
-        r(p, l);
+        const f = await q.decrypt(c.content, a), p = await (typeof t == "function" ? t : (h, d) => Promise.resolve(q.decrypt(h, Qe(t, d))))(f, l), b = s.id, y = st.init(n, p, this.inviterEphemeralPrivateKey, !1, a, b);
+        r(y, l);
       } catch (o) {
         console.error("Error processing invite message:", o, "event", s);
       }
@@ -4088,16 +4082,17 @@ class Pe {
   }
 }
 export {
-  Gc as CHAT_MESSAGE_KIND,
+  Fc as CHAT_MESSAGE_KIND,
   jn as INVITE_EVENT_KIND,
-  Pe as Invite,
-  ru as MAX_SKIP,
-  Be as MESSAGE_EVENT_KIND,
+  zn as INVITE_RESPONSE_KIND,
+  Me as Invite,
+  au as MAX_SKIP,
+  Ge as MESSAGE_EVENT_KIND,
   st as Session,
-  ou as createEventStream,
-  su as deserializeSessionState,
-  au as getMillisecondTimestamp,
-  Me as kdf,
-  iu as serializeSessionState,
+  lu as createEventStream,
+  uu as deserializeSessionState,
+  fu as getMillisecondTimestamp,
+  Oe as kdf,
+  cu as serializeSessionState,
   Lt as skippedMessageIndexKey
 };