@btc-vision/transaction 1.7.31 → 1.8.0-alpha.1

package/browser/vendors.js

@@ -1,5 +1,5 @@
-import { l as fn, m as th, n as kn, a as nh, o as hf, p as ar, q as ah, t as ts, u as oh, v as ih, w as sr, x as ns, k as sh, y as ch, z as uh, r as lh } from "./noble-hashes.js";
-import { g as Ea, r as fh, a as dh, b as hh, c as En, F as js, d as ph, e as gh } from "./noble-curves.js";
+import { s as fn, r as th, a as kn, b as nh, c as hf, d as ar, e as ah, f as ts, i as oh, g as ih, h as sr, j as ns, k as sh, p as ch, l as uh, m as lh } from "./noble-hashes.js";
+import { r as fh, a as dh, b as hh, F as Rs, c as ph, d as gh } from "./noble-curves.js";
 import { r as as } from "./valibot.js";
 function bh(e, t) {
   for (var r = 0; r < t.length; r++) {
@@ -17,13 +17,13 @@ function bh(e, t) {
   }
   return Object.freeze(Object.defineProperty(e, Symbol.toStringTag, { value: "Module" }));
 }
-var os = {}, xa = {};
-xa.byteLength = vh;
-xa.toByteArray = _h;
-xa.fromByteArray = xh;
-var kr = [], cr = [], mh = typeof Uint8Array < "u" ? Uint8Array : Array, ja = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-for (var xt = 0, yh = ja.length; xt < yh; ++xt)
-  kr[xt] = ja[xt], cr[ja.charCodeAt(xt)] = xt;
+var os = {}, Ea = {};
+Ea.byteLength = vh;
+Ea.toByteArray = _h;
+Ea.fromByteArray = xh;
+var kr = [], cr = [], mh = typeof Uint8Array < "u" ? Uint8Array : Array, Ra = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+for (var xt = 0, yh = Ra.length; xt < yh; ++xt)
+  kr[xt] = Ra[xt], cr[Ra.charCodeAt(xt)] = xt;
 cr[45] = 62;
 cr[95] = 63;
 function pf(e) {
@@ -82,15 +82,15 @@ is.read = function(e, t, r, n, o) {
   return (v ? -1 : 1) * s * Math.pow(2, a - n);
 };
 is.write = function(e, t, r, n, o, a) {
-  var s, i, h, l = a * 8 - o - 1, c = (1 << l) - 1, w = c >> 1, g = o === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, v = n ? 0 : a - 1, k = n ? 1 : -1, y = t < 0 || t === 0 && 1 / t < 0 ? 1 : 0;
-  for (t = Math.abs(t), isNaN(t) || t === 1 / 0 ? (i = isNaN(t) ? 1 : 0, s = c) : (s = Math.floor(Math.log(t) / Math.LN2), t * (h = Math.pow(2, -s)) < 1 && (s--, h *= 2), s + w >= 1 ? t += g / h : t += g * Math.pow(2, 1 - w), t * h >= 2 && (s++, h /= 2), s + w >= c ? (i = 0, s = c) : s + w >= 1 ? (i = (t * h - 1) * Math.pow(2, o), s = s + w) : (i = t * Math.pow(2, w - 1) * Math.pow(2, o), s = 0)); o >= 8; e[r + v] = i & 255, v += k, i /= 256, o -= 8)
+  var s, i, h, l = a * 8 - o - 1, c = (1 << l) - 1, w = c >> 1, g = o === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, v = n ? 0 : a - 1, E = n ? 1 : -1, y = t < 0 || t === 0 && 1 / t < 0 ? 1 : 0;
+  for (t = Math.abs(t), isNaN(t) || t === 1 / 0 ? (i = isNaN(t) ? 1 : 0, s = c) : (s = Math.floor(Math.log(t) / Math.LN2), t * (h = Math.pow(2, -s)) < 1 && (s--, h *= 2), s + w >= 1 ? t += g / h : t += g * Math.pow(2, 1 - w), t * h >= 2 && (s++, h /= 2), s + w >= c ? (i = 0, s = c) : s + w >= 1 ? (i = (t * h - 1) * Math.pow(2, o), s = s + w) : (i = t * Math.pow(2, w - 1) * Math.pow(2, o), s = 0)); o >= 8; e[r + v] = i & 255, v += E, i /= 256, o -= 8)
     ;
-  for (s = s << o | i, l += o; l > 0; e[r + v] = s & 255, v += k, s /= 256, l -= 8)
+  for (s = s << o | i, l += o; l > 0; e[r + v] = s & 255, v += E, s /= 256, l -= 8)
     ;
-  e[r + v - k] |= y * 128;
+  e[r + v - E] |= y * 128;
 };
 (function(e) {
-  const t = xa, r = is, n = typeof Symbol == "function" && typeof Symbol.for == "function" ? /* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom") : null;
+  const t = Ea, r = is, n = typeof Symbol == "function" && typeof Symbol.for == "function" ? /* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom") : null;
   e.Buffer = c, e.SlowBuffer = F, e.INSPECT_MAX_BYTES = 50;
   const o = 2147483647;
   e.kMaxLength = o;
@@ -133,7 +133,7 @@ is.write = function(e, t, r, n, o, a) {
         throw new TypeError(
           'The "string" argument must be of type string. Received type number'
         );
-      return k(b);
+      return E(b);
     }
     return w(b, u, d);
   }
@@ -148,7 +148,7 @@ is.write = function(e, t, r, n, o, a) {
         "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof b
       );
     if (Be(b, s) || b && Be(b.buffer, s) || typeof i < "u" && (Be(b, i) || b && Be(b.buffer, i)))
-      return E(b, u, d);
+      return k(b, u, d);
     if (typeof b == "number")
       throw new TypeError(
         'The "value" argument must not be of type number. Received type number'
@@ -179,18 +179,18 @@ is.write = function(e, t, r, n, o, a) {
   c.alloc = function(b, u, d) {
     return v(b, u, d);
   };
-  function k(b) {
+  function E(b) {
     return g(b), l(b < 0 ? 0 : z(b) | 0);
   }
   c.allocUnsafe = function(b) {
-    return k(b);
+    return E(b);
   }, c.allocUnsafeSlow = function(b) {
-    return k(b);
+    return E(b);
   };
   function y(b, u) {
     if ((typeof u != "string" || u === "") && (u = "utf8"), !c.isEncoding(u))
       throw new TypeError("Unknown encoding: " + u);
-    const d = j(b, u) | 0;
+    const d = R(b, u) | 0;
     let S = l(d);
     const P = S.write(b, u);
     return P !== d && (S = S.slice(0, P)), S;
@@ -204,11 +204,11 @@ is.write = function(e, t, r, n, o, a) {
   function A(b) {
     if (Be(b, a)) {
       const u = new a(b);
-      return E(u.buffer, u.byteOffset, u.byteLength);
+      return k(u.buffer, u.byteOffset, u.byteLength);
     }
     return m(b);
   }
-  function E(b, u, d) {
+  function k(b, u, d) {
     if (u < 0 || b.byteLength < u)
       throw new RangeError('"offset" is outside of buffer bounds');
     if (b.byteLength < u + (d || 0))
@@ -293,7 +293,7 @@ is.write = function(e, t, r, n, o, a) {
     }
     return P;
   };
-  function j(b, u) {
+  function R(b, u) {
     if (c.isBuffer(b))
       return b.length;
     if (s.isView(b) || Be(b, s))
@@ -313,7 +313,7 @@ is.write = function(e, t, r, n, o, a) {
           return d;
         case "utf8":
         case "utf-8":
-          return Re(b).length;
+          return je(b).length;
         case "ucs2":
         case "ucs-2":
         case "utf16le":
@@ -325,11 +325,11 @@ is.write = function(e, t, r, n, o, a) {
           return ge(b).length;
         default:
           if (P)
-            return S ? -1 : Re(b).length;
+            return S ? -1 : je(b).length;
           u = ("" + u).toLowerCase(), P = !0;
       }
   }
-  c.byteLength = j;
+  c.byteLength = R;
   function I(b, u, d) {
     let S = !1;
     if ((u === void 0 || u < 0) && (u = 0), u > this.length || ((d === void 0 || d > this.length) && (d = this.length), d <= 0) || (d >>>= 0, u >>>= 0, d <= u))
@@ -426,12 +426,12 @@ is.write = function(e, t, r, n, o, a) {
       if (P) d = 0;
       else return -1;
     if (typeof u == "string" && (u = c.from(u, S)), c.isBuffer(u))
-      return u.length === 0 ? -1 : R(b, u, d, S, P);
+      return u.length === 0 ? -1 : j(b, u, d, S, P);
     if (typeof u == "number")
-      return u = u & 255, typeof a.prototype.indexOf == "function" ? P ? a.prototype.indexOf.call(b, u, d) : a.prototype.lastIndexOf.call(b, u, d) : R(b, [u], d, S, P);
+      return u = u & 255, typeof a.prototype.indexOf == "function" ? P ? a.prototype.indexOf.call(b, u, d) : a.prototype.lastIndexOf.call(b, u, d) : j(b, [u], d, S, P);
     throw new TypeError("val must be string, number or Buffer");
   }
-  function R(b, u, d, S, P) {
+  function j(b, u, d, S, P) {
     let D = 1, W = b.length, be = u.length;
     if (S !== void 0 && (S = String(S).toLowerCase(), S === "ucs2" || S === "ucs-2" || S === "utf16le" || S === "utf-16le")) {
       if (b.length < 2 || u.length < 2)
@@ -483,7 +483,7 @@ is.write = function(e, t, r, n, o, a) {
     return W;
   }
   function T(b, u, d, S) {
-    return xe(Re(u, b.length - d), b, d, S);
+    return xe(je(u, b.length - d), b, d, S);
   }
   function Z(b, u, d, S) {
     return xe(ae(u), b, d, S);
@@ -931,7 +931,7 @@ is.write = function(e, t, r, n, o, a) {
       b = b + "=";
     return b;
   }
-  function Re(b, u) {
+  function je(b, u) {
     u = u || 1 / 0;
     let d;
     const S = b.length;
@@ -1036,20 +1036,20 @@ function Dt(e) {
   for (; --t >= 0; )
     e[t] = 0;
 }
-const Ih = 0, gf = 1, Bh = 2, Th = 3, zh = 258, ss = 29, xn = 256, dn = xn + 1 + ss, Ut = 30, cs = 19, bf = 2 * dn + 1, dt = 15, Pa = 16, Oh = 7, us = 256, mf = 16, yf = 17, vf = 18, Bi = (
+const Ih = 0, gf = 1, Bh = 2, Th = 3, zh = 258, ss = 29, En = 256, dn = En + 1 + ss, Ut = 30, cs = 19, bf = 2 * dn + 1, dt = 15, Pa = 16, Oh = 7, us = 256, mf = 16, yf = 17, vf = 18, Bi = (
   /* extra bits for each length code */
   new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0])
 ), Jn = (
   /* extra bits for each distance code */
   new Uint8Array([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13])
-), Rh = (
+), jh = (
   /* extra bits for each bit length code */
   new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7])
-), wf = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), jh = 512, Pr = new Array((dn + 2) * 2);
+), wf = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Rh = 512, Pr = new Array((dn + 2) * 2);
 Dt(Pr);
 const cn = new Array(Ut * 2);
 Dt(cn);
-const hn = new Array(jh);
+const hn = new Array(Rh);
 Dt(hn);
 const pn = new Array(zh - Th + 1);
 Dt(pn);
@@ -1085,11 +1085,11 @@ const xf = (e) => e < 256 ? hn[e] : hn[256 + (e >>> 7)], gn = (e, t) => {
   e.bi_valid === 16 ? (gn(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
 }, Uh = (e, t) => {
   const r = t.dyn_tree, n = t.max_code, o = t.stat_desc.static_tree, a = t.stat_desc.has_stree, s = t.stat_desc.extra_bits, i = t.stat_desc.extra_base, h = t.stat_desc.max_length;
-  let l, c, w, g, v, k, y = 0;
+  let l, c, w, g, v, E, y = 0;
   for (g = 0; g <= dt; g++)
     e.bl_count[g] = 0;
   for (r[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < bf; l++)
-    c = e.heap[l], g = r[r[c * 2 + 1] * 2 + 1] + 1, g > h && (g = h, y++), r[c * 2 + 1] = g, !(c > n) && (e.bl_count[g]++, v = 0, c >= i && (v = s[c - i]), k = r[c * 2], e.opt_len += k * (g + v), a && (e.static_len += k * (o[c * 2 + 1] + v)));
+    c = e.heap[l], g = r[r[c * 2 + 1] * 2 + 1] + 1, g > h && (g = h, y++), r[c * 2 + 1] = g, !(c > n) && (e.bl_count[g]++, v = 0, c >= i && (v = s[c - i]), E = r[c * 2], e.opt_len += E * (g + v), a && (e.static_len += E * (o[c * 2 + 1] + v)));
   if (y !== 0) {
     do {
       for (g = h - 1; e.bl_count[g] === 0; )
@@ -1133,7 +1133,7 @@ const xf = (e) => e < 256 ? hn[e] : hn[256 + (e >>> 7)], gn = (e, t) => {
     Pr[e * 2 + 1] = 8, e++, a[8]++;
   for (Sf(Pr, dn + 1, a), e = 0; e < Ut; e++)
     cn[e * 2 + 1] = 5, cn[e * 2] = Af(e, 5);
-  _f = new Ua(Pr, Bi, xn + 1, dn, dt), kf = new Ua(cn, Jn, 0, Ut, dt), Ef = new Ua(new Array(0), Rh, 0, cs, Oh);
+  _f = new Ua(Pr, Bi, En + 1, dn, dt), kf = new Ua(cn, Jn, 0, Ut, dt), Ef = new Ua(new Array(0), jh, 0, cs, Oh);
 }, If = (e) => {
   let t;
   for (t = 0; t < dn; t++)
@@ -1158,7 +1158,7 @@ const xf = (e) => e < 256 ? hn[e] : hn[256 + (e >>> 7)], gn = (e, t) => {
   let n, o, a = 0, s, i;
   if (e.sym_next !== 0)
     do
-      n = e.pending_buf[e.sym_buf + a++] & 255, n += (e.pending_buf[e.sym_buf + a++] & 255) << 8, o = e.pending_buf[e.sym_buf + a++], n === 0 ? Er(e, o, t) : (s = pn[o], Er(e, s + xn + 1, t), i = Bi[s], i !== 0 && (o -= ls[s], Xe(e, o, i)), n--, s = xf(n), Er(e, s, r), i = Jn[s], i !== 0 && (n -= la[s], Xe(e, n, i)));
+      n = e.pending_buf[e.sym_buf + a++] & 255, n += (e.pending_buf[e.sym_buf + a++] & 255) << 8, o = e.pending_buf[e.sym_buf + a++], n === 0 ? Er(e, o, t) : (s = pn[o], Er(e, s + En + 1, t), i = Bi[s], i !== 0 && (o -= ls[s], Xe(e, o, i)), n--, s = xf(n), Er(e, s, r), i = Jn[s], i !== 0 && (n -= la[s], Xe(e, n, i)));
     while (a < e.sym_next);
   Er(e, us, t);
 }, Ti = (e, t) => {
@@ -1232,7 +1232,7 @@ const xf = (e) => e < 256 ? hn[e] : hn[256 + (e >>> 7)], gn = (e, t) => {
       return Ps;
   if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0)
     return Us;
-  for (r = 32; r < xn; r++)
+  for (r = 32; r < En; r++)
     if (e.dyn_ltree[r * 2] !== 0)
       return Us;
   return Ps;
@@ -1247,7 +1247,7 @@ const Mh = (e) => {
 }, Fh = (e, t, r, n) => {
   let o, a, s = 0;
   e.level > 0 ? (e.strm.data_type === Sh && (e.strm.data_type = qh(e)), Ti(e, e.l_desc), Ti(e, e.d_desc), s = Ch(e), o = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= o && (o = a)) : o = a = r + 5, r + 4 <= o && t !== -1 ? Tf(e, t, r, n) : e.strategy === Ah || a === o ? (Xe(e, (gf << 1) + (n ? 1 : 0), 3), Cs(e, Pr, cn)) : (Xe(e, (Bh << 1) + (n ? 1 : 0), 3), Lh(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, s + 1), Cs(e, e.dyn_ltree, e.dyn_dtree)), If(e), n && Bf(e);
-}, Kh = (e, t, r) => (e.pending_buf[e.sym_buf + e.sym_next++] = t, e.pending_buf[e.sym_buf + e.sym_next++] = t >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = r, t === 0 ? e.dyn_ltree[r * 2]++ : (e.matches++, t--, e.dyn_ltree[(pn[r] + xn + 1) * 2]++, e.dyn_dtree[xf(t) * 2]++), e.sym_next === e.sym_end);
+}, Kh = (e, t, r) => (e.pending_buf[e.sym_buf + e.sym_next++] = t, e.pending_buf[e.sym_buf + e.sym_next++] = t >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = r, t === 0 ? e.dyn_ltree[r * 2]++ : (e.matches++, t--, e.dyn_ltree[(pn[r] + En + 1) * 2]++, e.dyn_dtree[xf(t) * 2]++), e.sym_next === e.sym_end);
 var Hh = Mh, $h = Tf, Gh = Fh, Wh = Kh, Vh = Dh, Zh = {
   _tr_init: Hh,
   _tr_stored_block: $h,
@@ -1302,7 +1302,7 @@ var Ke = Qh, yt = {
   /* Z_BUF_ERROR     (-5) */
   "-6": "incompatible version"
   /* Z_VERSION_ERROR (-6) */
-}, An = {
+}, xn = {
   /* Allowed flush values; see deflate() and inflate() below for details */
   Z_NO_FLUSH: 0,
   Z_PARTIAL_FLUSH: 1,
@@ -1355,13 +1355,13 @@ const { _tr_init: ep, _tr_stored_block: zi, _tr_flush_block: rp, _tr_tally: at,
   Z_BUF_ERROR: La,
   Z_DEFAULT_COMPRESSION: ip,
   Z_FILTERED: sp,
-  Z_HUFFMAN_ONLY: jn,
+  Z_HUFFMAN_ONLY: Rn,
   Z_RLE: cp,
   Z_FIXED: up,
   Z_DEFAULT_STRATEGY: lp,
   Z_UNKNOWN: fp,
-  Z_DEFLATED: Aa
-} = An, dp = 9, hp = 15, pp = 8, gp = 29, bp = 256, Oi = bp + 1 + gp, mp = 30, yp = 19, vp = 2 * Oi + 1, wp = 15, ke = 3, tt = 258, Ar = tt + ke + 1, _p = 32, Ct = 42, fs = 57, Ri = 69, ji = 73, Pi = 91, Ui = 103, ht = 113, tn = 666, Ve = 1, Ft = 2, vt = 3, Kt = 4, kp = 3, pt = (e, t) => (e.msg = yt[t], t), Ks = (e) => e * 2 - (e > 4 ? 9 : 0), rt = (e) => {
+  Z_DEFLATED: xa
+} = xn, dp = 9, hp = 15, pp = 8, gp = 29, bp = 256, Oi = bp + 1 + gp, mp = 30, yp = 19, vp = 2 * Oi + 1, wp = 15, ke = 3, tt = 258, Ar = tt + ke + 1, _p = 32, Ct = 42, fs = 57, ji = 69, Ri = 73, Pi = 91, Ui = 103, ht = 113, tn = 666, Ve = 1, Ft = 2, vt = 3, Kt = 4, kp = 3, pt = (e, t) => (e.msg = yt[t], t), Ks = (e) => e * 2 - (e > 4 ? 9 : 0), rt = (e) => {
   let t = e.length;
   for (; --t >= 0; )
     e[t] = 0;
@@ -1393,10 +1393,10 @@ const rr = (e) => {
 }, zf = (e, t) => {
   let r = e.max_chain_length, n = e.strstart, o, a, s = e.prev_length, i = e.nice_match;
   const h = e.strstart > e.w_size - Ar ? e.strstart - (e.w_size - Ar) : 0, l = e.window, c = e.w_mask, w = e.prev, g = e.strstart + tt;
-  let v = l[n + s - 1], k = l[n + s];
+  let v = l[n + s - 1], E = l[n + s];
   e.prev_length >= e.good_match && (r >>= 2), i > e.lookahead && (i = e.lookahead);
   do
-    if (o = t, !(l[o + s] !== k || l[o + s - 1] !== v || l[o] !== l[n] || l[++o] !== l[n + 1])) {
+    if (o = t, !(l[o + s] !== E || l[o + s - 1] !== v || l[o] !== l[n] || l[++o] !== l[n + 1])) {
       n += 2, o++;
       do
         ;
@@ -1404,7 +1404,7 @@ const rr = (e) => {
       if (a = tt - (g - n), n = g - tt, a > s) {
         if (e.match_start = t, s = a, a >= i)
           break;
-        v = l[n + s - 1], k = l[n + s];
+        v = l[n + s - 1], E = l[n + s];
       }
     }
   while ((t = w[t & c]) > h && --r !== 0);
@@ -1537,17 +1537,17 @@ const nn = [
   e.window_size = 2 * e.w_size, rt(e.head), e.max_lazy_match = nn[e.level].max_lazy, e.good_match = nn[e.level].good_length, e.nice_match = nn[e.level].nice_length, e.max_chain_length = nn[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = ke - 1, e.match_available = 0, e.ins_h = 0;
 };
 function Bp() {
-  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = Aa, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(vp * 2), this.dyn_dtree = new Uint16Array((2 * mp + 1) * 2), this.bl_tree = new Uint16Array((2 * yp + 1) * 2), rt(this.dyn_ltree), rt(this.dyn_dtree), rt(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(wp + 1), this.heap = new Uint16Array(2 * Oi + 1), rt(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Oi + 1), rt(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = xa, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(vp * 2), this.dyn_dtree = new Uint16Array((2 * mp + 1) * 2), this.bl_tree = new Uint16Array((2 * yp + 1) * 2), rt(this.dyn_ltree), rt(this.dyn_dtree), rt(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(wp + 1), this.heap = new Uint16Array(2 * Oi + 1), rt(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Oi + 1), rt(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
 }
-const Sn = (e) => {
+const An = (e) => {
   if (!e)
     return 1;
   const t = e.state;
   return !t || t.strm !== e || t.status !== Ct && //#ifdef GZIP
   t.status !== fs && //#endif
-  t.status !== Ri && t.status !== ji && t.status !== Pi && t.status !== Ui && t.status !== ht && t.status !== tn ? 1 : 0;
-}, Rf = (e) => {
-  if (Sn(e))
+  t.status !== ji && t.status !== Ri && t.status !== Pi && t.status !== Ui && t.status !== ht && t.status !== tn ? 1 : 0;
+}, jf = (e) => {
+  if (An(e))
     return pt(e, xr);
   e.total_in = e.total_out = 0, e.data_type = fp;
   const t = e.state;
@@ -1556,20 +1556,20 @@ const Sn = (e) => {
     //#endif
     t.wrap ? Ct : ht
   ), e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = -2, ep(t), $e;
-}, jf = (e) => {
-  const t = Rf(e);
+}, Rf = (e) => {
+  const t = jf(e);
   return t === $e && Ip(e.state), t;
-}, Tp = (e, t) => Sn(e) || e.state.wrap !== 2 ? xr : (e.state.gzhead = t, $e), Pf = (e, t, r, n, o, a) => {
+}, Tp = (e, t) => An(e) || e.state.wrap !== 2 ? xr : (e.state.gzhead = t, $e), Pf = (e, t, r, n, o, a) => {
   if (!e)
     return xr;
   let s = 1;
-  if (t === ip && (t = 6), n < 0 ? (s = 0, n = -n) : n > 15 && (s = 2, n -= 16), o < 1 || o > dp || r !== Aa || n < 8 || n > 15 || t < 0 || t > 9 || a < 0 || a > up || n === 8 && s !== 1)
+  if (t === ip && (t = 6), n < 0 ? (s = 0, n = -n) : n > 15 && (s = 2, n -= 16), o < 1 || o > dp || r !== xa || n < 8 || n > 15 || t < 0 || t > 9 || a < 0 || a > up || n === 8 && s !== 1)
     return pt(e, xr);
   n === 8 && (n = 9);
   const i = new Bp();
-  return e.state = i, i.strm = e, i.status = Ct, i.wrap = s, i.gzhead = null, i.w_bits = n, i.w_size = 1 << i.w_bits, i.w_mask = i.w_size - 1, i.hash_bits = o + 7, i.hash_size = 1 << i.hash_bits, i.hash_mask = i.hash_size - 1, i.hash_shift = ~~((i.hash_bits + ke - 1) / ke), i.window = new Uint8Array(i.w_size * 2), i.head = new Uint16Array(i.hash_size), i.prev = new Uint16Array(i.w_size), i.lit_bufsize = 1 << o + 6, i.pending_buf_size = i.lit_bufsize * 4, i.pending_buf = new Uint8Array(i.pending_buf_size), i.sym_buf = i.lit_bufsize, i.sym_end = (i.lit_bufsize - 1) * 3, i.level = t, i.strategy = a, i.method = r, jf(e);
-}, zp = (e, t) => Pf(e, t, Aa, hp, pp, lp), Op = (e, t) => {
-  if (Sn(e) || t > Ds || t < 0)
+  return e.state = i, i.strm = e, i.status = Ct, i.wrap = s, i.gzhead = null, i.w_bits = n, i.w_size = 1 << i.w_bits, i.w_mask = i.w_size - 1, i.hash_bits = o + 7, i.hash_size = 1 << i.hash_bits, i.hash_mask = i.hash_size - 1, i.hash_shift = ~~((i.hash_bits + ke - 1) / ke), i.window = new Uint8Array(i.w_size * 2), i.head = new Uint16Array(i.hash_size), i.prev = new Uint16Array(i.w_size), i.lit_bufsize = 1 << o + 6, i.pending_buf_size = i.lit_bufsize * 4, i.pending_buf = new Uint8Array(i.pending_buf_size), i.sym_buf = i.lit_bufsize, i.sym_end = (i.lit_bufsize - 1) * 3, i.level = t, i.strategy = a, i.method = r, Rf(e);
+}, zp = (e, t) => Pf(e, t, xa, hp, pp, lp), Op = (e, t) => {
+  if (An(e) || t > Ds || t < 0)
     return e ? pt(e, xr) : xr;
   const r = e.state;
   if (!e.output || e.avail_in !== 0 && !e.input || r.status === tn && t !== ur)
@@ -1583,8 +1583,8 @@ const Sn = (e) => {
   if (r.status === tn && e.avail_in !== 0)
     return pt(e, La);
   if (r.status === Ct && r.wrap === 0 && (r.status = ht), r.status === Ct) {
-    let o = Aa + (r.w_bits - 8 << 4) << 8, a = -1;
-    if (r.strategy >= jn || r.level < 2 ? a = 0 : r.level < 6 ? a = 1 : r.level === 6 ? a = 2 : a = 3, o |= a << 6, r.strstart !== 0 && (o |= _p), o += 31 - o % 31, Yt(r, o), r.strstart !== 0 && (Yt(r, e.adler >>> 16), Yt(r, e.adler & 65535)), e.adler = 1, r.status = ht, rr(e), r.pending !== 0)
+    let o = xa + (r.w_bits - 8 << 4) << 8, a = -1;
+    if (r.strategy >= Rn || r.level < 2 ? a = 0 : r.level < 6 ? a = 1 : r.level === 6 ? a = 2 : a = 3, o |= a << 6, r.strstart !== 0 && (o |= _p), o += 31 - o % 31, Yt(r, o), r.strstart !== 0 && (Yt(r, e.adler >>> 16), Yt(r, e.adler & 65535)), e.adler = 1, r.status = ht, rr(e), r.pending !== 0)
       return r.last_flush = -1, $e;
   }
   if (r.status === fs) {
@@ -1592,11 +1592,11 @@ const Sn = (e) => {
       Ee(
         r,
         (r.gzhead.text ? 1 : 0) + (r.gzhead.hcrc ? 2 : 0) + (r.gzhead.extra ? 4 : 0) + (r.gzhead.name ? 8 : 0) + (r.gzhead.comment ? 16 : 0)
-      ), Ee(r, r.gzhead.time & 255), Ee(r, r.gzhead.time >> 8 & 255), Ee(r, r.gzhead.time >> 16 & 255), Ee(r, r.gzhead.time >> 24 & 255), Ee(r, r.level === 9 ? 2 : r.strategy >= jn || r.level < 2 ? 4 : 0), Ee(r, r.gzhead.os & 255), r.gzhead.extra && r.gzhead.extra.length && (Ee(r, r.gzhead.extra.length & 255), Ee(r, r.gzhead.extra.length >> 8 & 255)), r.gzhead.hcrc && (e.adler = Ke(e.adler, r.pending_buf, r.pending, 0)), r.gzindex = 0, r.status = Ri;
-    else if (Ee(r, 0), Ee(r, 0), Ee(r, 0), Ee(r, 0), Ee(r, 0), Ee(r, r.level === 9 ? 2 : r.strategy >= jn || r.level < 2 ? 4 : 0), Ee(r, kp), r.status = ht, rr(e), r.pending !== 0)
+      ), Ee(r, r.gzhead.time & 255), Ee(r, r.gzhead.time >> 8 & 255), Ee(r, r.gzhead.time >> 16 & 255), Ee(r, r.gzhead.time >> 24 & 255), Ee(r, r.level === 9 ? 2 : r.strategy >= Rn || r.level < 2 ? 4 : 0), Ee(r, r.gzhead.os & 255), r.gzhead.extra && r.gzhead.extra.length && (Ee(r, r.gzhead.extra.length & 255), Ee(r, r.gzhead.extra.length >> 8 & 255)), r.gzhead.hcrc && (e.adler = Ke(e.adler, r.pending_buf, r.pending, 0)), r.gzindex = 0, r.status = ji;
+    else if (Ee(r, 0), Ee(r, 0), Ee(r, 0), Ee(r, 0), Ee(r, 0), Ee(r, r.level === 9 ? 2 : r.strategy >= Rn || r.level < 2 ? 4 : 0), Ee(r, kp), r.status = ht, rr(e), r.pending !== 0)
       return r.last_flush = -1, $e;
   }
-  if (r.status === Ri) {
+  if (r.status === ji) {
     if (r.gzhead.extra) {
       let o = r.pending, a = (r.gzhead.extra.length & 65535) - r.gzindex;
       for (; r.pending + a > r.pending_buf_size; ) {
@@ -1608,9 +1608,9 @@ const Sn = (e) => {
       let s = new Uint8Array(r.gzhead.extra);
       r.pending_buf.set(s.subarray(r.gzindex, r.gzindex + a), r.pending), r.pending += a, r.gzhead.hcrc && r.pending > o && (e.adler = Ke(e.adler, r.pending_buf, r.pending - o, o)), r.gzindex = 0;
     }
-    r.status = ji;
+    r.status = Ri;
   }
-  if (r.status === ji) {
+  if (r.status === Ri) {
     if (r.gzhead.name) {
       let o = r.pending, a;
       do {
@@ -1650,21 +1650,21 @@ const Sn = (e) => {
       return r.last_flush = -1, $e;
   }
   if (e.avail_in !== 0 || r.lookahead !== 0 || t !== ot && r.status !== tn) {
-    let o = r.level === 0 ? Of(r, t) : r.strategy === jn ? Sp(r, t) : r.strategy === cp ? Ap(r, t) : nn[r.level].func(r, t);
+    let o = r.level === 0 ? Of(r, t) : r.strategy === Rn ? Sp(r, t) : r.strategy === cp ? Ap(r, t) : nn[r.level].func(r, t);
     if ((o === vt || o === Kt) && (r.status = tn), o === Ve || o === vt)
       return e.avail_out === 0 && (r.last_flush = -1), $e;
     if (o === Ft && (t === np ? tp(r) : t !== Ds && (zi(r, 0, 0, !1), t === ap && (rt(r.head), r.lookahead === 0 && (r.strstart = 0, r.block_start = 0, r.insert = 0))), rr(e), e.avail_out === 0))
       return r.last_flush = -1, $e;
   }
   return t !== ur ? $e : r.wrap <= 0 ? Fs : (r.wrap === 2 ? (Ee(r, e.adler & 255), Ee(r, e.adler >> 8 & 255), Ee(r, e.adler >> 16 & 255), Ee(r, e.adler >> 24 & 255), Ee(r, e.total_in & 255), Ee(r, e.total_in >> 8 & 255), Ee(r, e.total_in >> 16 & 255), Ee(r, e.total_in >> 24 & 255)) : (Yt(r, e.adler >>> 16), Yt(r, e.adler & 65535)), rr(e), r.wrap > 0 && (r.wrap = -r.wrap), r.pending !== 0 ? $e : Fs);
-}, Rp = (e) => {
-  if (Sn(e))
+}, jp = (e) => {
+  if (An(e))
     return xr;
   const t = e.state.status;
   return e.state = null, t === ht ? pt(e, op) : $e;
-}, jp = (e, t) => {
+}, Rp = (e, t) => {
   let r = t.length;
-  if (Sn(e))
+  if (An(e))
     return xr;
   const n = e.state, o = n.wrap;
   if (o === 2 || o === 1 && n.status !== Ct || n.lookahead)
@@ -1684,7 +1684,7 @@ const Sn = (e) => {
   }
   return n.strstart += n.lookahead, n.block_start = n.strstart, n.insert = n.lookahead, n.lookahead = 0, n.match_length = n.prev_length = ke - 1, n.match_available = 0, e.next_in = s, e.input = i, e.avail_in = a, n.wrap = o, $e;
 };
-var Pp = zp, Up = Pf, Np = jf, Cp = Rf, Lp = Tp, qp = Op, Mp = Rp, Dp = jp, Fp = "pako deflate (from Nodeca project)", un = {
+var Pp = zp, Up = Pf, Np = Rf, Cp = jf, Lp = Tp, qp = Op, Mp = jp, Dp = Rp, Fp = "pako deflate (from Nodeca project)", un = {
   deflateInit: Pp,
   deflateInit2: Up,
   deflateReset: Np,
@@ -1718,7 +1718,7 @@ var Hp = function(e) {
     r.set(s, o), o += s.length;
   }
   return r;
-}, Sa = {
+}, Aa = {
   assign: Hp,
   flattenChunks: $p
 };
@@ -1801,9 +1801,9 @@ const Cf = Object.prototype.toString, {
   Z_DEFAULT_COMPRESSION: t0,
   Z_DEFAULT_STRATEGY: n0,
   Z_DEFLATED: a0
-} = An;
-function In(e) {
-  this.options = Sa.assign({
+} = xn;
+function Sn(e) {
+  this.options = Aa.assign({
     level: t0,
     method: a0,
     chunkSize: 16384,
@@ -1830,7 +1830,7 @@ function In(e) {
     this._dict_set = !0;
   }
 }
-In.prototype.push = function(e, t) {
+Sn.prototype.push = function(e, t) {
   const r = this.strm, n = this.options.chunkSize;
   let o, a;
   if (this.ended)
@@ -1854,14 +1854,14 @@ In.prototype.push = function(e, t) {
   }
   return !0;
 };
-In.prototype.onData = function(e) {
+Sn.prototype.onData = function(e) {
   this.chunks.push(e);
 };
-In.prototype.onEnd = function(e) {
-  e === fa && (this.result = Sa.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+Sn.prototype.onEnd = function(e) {
+  e === fa && (this.result = Aa.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
 function ds(e, t) {
-  const r = new In(t);
+  const r = new Sn(t);
   if (r.push(e, !0), r.err)
     throw r.msg || yt[r.err];
   return r.result;
@@ -1872,7 +1872,7 @@ function o0(e, t) {
 function i0(e, t) {
   return t = t || {}, t.gzip = !0, ds(e, t);
 }
-var s0 = In, c0 = ds, u0 = o0, l0 = i0, f0 = {
+var s0 = Sn, c0 = ds, u0 = o0, l0 = i0, f0 = {
   Deflate: s0,
   deflate: c0,
   deflateRaw: u0,
@@ -1880,27 +1880,27 @@ var s0 = In, c0 = ds, u0 = o0, l0 = i0, f0 = {
 };
 const Pn = 16209, d0 = 16191;
 var h0 = function(t, r) {
-  let n, o, a, s, i, h, l, c, w, g, v, k, y, m, A, E, x, z, F, j, I, N, O, R;
+  let n, o, a, s, i, h, l, c, w, g, v, E, y, m, A, k, x, z, F, R, I, N, O, j;
   const U = t.state;
-  n = t.next_in, O = t.input, o = n + (t.avail_in - 5), a = t.next_out, R = t.output, s = a - (r - t.avail_out), i = a + (t.avail_out - 257), h = U.dmax, l = U.wsize, c = U.whave, w = U.wnext, g = U.window, v = U.hold, k = U.bits, y = U.lencode, m = U.distcode, A = (1 << U.lenbits) - 1, E = (1 << U.distbits) - 1;
+  n = t.next_in, O = t.input, o = n + (t.avail_in - 5), a = t.next_out, j = t.output, s = a - (r - t.avail_out), i = a + (t.avail_out - 257), h = U.dmax, l = U.wsize, c = U.whave, w = U.wnext, g = U.window, v = U.hold, E = U.bits, y = U.lencode, m = U.distcode, A = (1 << U.lenbits) - 1, k = (1 << U.distbits) - 1;
   e:
     do {
-      k < 15 && (v += O[n++] << k, k += 8, v += O[n++] << k, k += 8), x = y[v & A];
+      E < 15 && (v += O[n++] << E, E += 8, v += O[n++] << E, E += 8), x = y[v & A];
       r:
         for (; ; ) {
-          if (z = x >>> 24, v >>>= z, k -= z, z = x >>> 16 & 255, z === 0)
-            R[a++] = x & 65535;
+          if (z = x >>> 24, v >>>= z, E -= z, z = x >>> 16 & 255, z === 0)
+            j[a++] = x & 65535;
           else if (z & 16) {
-            F = x & 65535, z &= 15, z && (k < z && (v += O[n++] << k, k += 8), F += v & (1 << z) - 1, v >>>= z, k -= z), k < 15 && (v += O[n++] << k, k += 8, v += O[n++] << k, k += 8), x = m[v & E];
+            F = x & 65535, z &= 15, z && (E < z && (v += O[n++] << E, E += 8), F += v & (1 << z) - 1, v >>>= z, E -= z), E < 15 && (v += O[n++] << E, E += 8, v += O[n++] << E, E += 8), x = m[v & k];
             t:
               for (; ; ) {
-                if (z = x >>> 24, v >>>= z, k -= z, z = x >>> 16 & 255, z & 16) {
-                  if (j = x & 65535, z &= 15, k < z && (v += O[n++] << k, k += 8, k < z && (v += O[n++] << k, k += 8)), j += v & (1 << z) - 1, j > h) {
+                if (z = x >>> 24, v >>>= z, E -= z, z = x >>> 16 & 255, z & 16) {
+                  if (R = x & 65535, z &= 15, E < z && (v += O[n++] << E, E += 8, E < z && (v += O[n++] << E, E += 8)), R += v & (1 << z) - 1, R > h) {
                     t.msg = "invalid distance too far back", U.mode = Pn;
                     break e;
                   }
-                  if (v >>>= z, k -= z, z = a - s, j > z) {
-                    if (z = j - z, z > c && U.sane) {
+                  if (v >>>= z, E -= z, z = a - s, R > z) {
+                    if (z = R - z, z > c && U.sane) {
                       t.msg = "invalid distance too far back", U.mode = Pn;
                       break e;
                     }
@@ -1908,40 +1908,40 @@ var h0 = function(t, r) {
                       if (I += l - z, z < F) {
                         F -= z;
                         do
-                          R[a++] = g[I++];
+                          j[a++] = g[I++];
                         while (--z);
-                        I = a - j, N = R;
+                        I = a - R, N = j;
                       }
                     } else if (w < z) {
                       if (I += l + w - z, z -= w, z < F) {
                         F -= z;
                         do
-                          R[a++] = g[I++];
+                          j[a++] = g[I++];
                         while (--z);
                         if (I = 0, w < F) {
                           z = w, F -= z;
                           do
-                            R[a++] = g[I++];
+                            j[a++] = g[I++];
                           while (--z);
-                          I = a - j, N = R;
+                          I = a - R, N = j;
                         }
                       }
                     } else if (I += w - z, z < F) {
                       F -= z;
                       do
-                        R[a++] = g[I++];
+                        j[a++] = g[I++];
                       while (--z);
-                      I = a - j, N = R;
+                      I = a - R, N = j;
                     }
                     for (; F > 2; )
-                      R[a++] = N[I++], R[a++] = N[I++], R[a++] = N[I++], F -= 3;
-                    F && (R[a++] = N[I++], F > 1 && (R[a++] = N[I++]));
+                      j[a++] = N[I++], j[a++] = N[I++], j[a++] = N[I++], F -= 3;
+                    F && (j[a++] = N[I++], F > 1 && (j[a++] = N[I++]));
                   } else {
-                    I = a - j;
+                    I = a - R;
                     do
-                      R[a++] = R[I++], R[a++] = R[I++], R[a++] = R[I++], F -= 3;
+                      j[a++] = j[I++], j[a++] = j[I++], j[a++] = j[I++], F -= 3;
                     while (F > 2);
-                    F && (R[a++] = R[I++], F > 1 && (R[a++] = R[I++]));
+                    F && (j[a++] = j[I++], F > 1 && (j[a++] = j[I++]));
                   }
                 } else if ((z & 64) === 0) {
                   x = m[(x & 65535) + (v & (1 << z) - 1)];
@@ -1965,7 +1965,7 @@ var h0 = function(t, r) {
           break;
         }
     } while (n < o && a < i);
-  F = k >> 3, n -= F, k -= F << 3, v &= (1 << k) - 1, t.next_in = n, t.next_out = a, t.avail_in = n < o ? 5 + (o - n) : 5 - (n - o), t.avail_out = a < i ? 257 + (i - a) : 257 - (a - i), U.hold = v, U.bits = k;
+  F = E >> 3, n -= F, E -= F << 3, v &= (1 << E) - 1, t.next_in = n, t.next_out = a, t.avail_in = n < o ? 5 + (o - n) : 5 - (n - o), t.avail_out = a < i ? 257 + (i - a) : 257 - (a - i), U.hold = v, U.bits = E;
 };
 const St = 15, Hs = 852, $s = 592, Gs = 0, Ma = 1, Ws = 2, p0 = new Uint16Array([
   /* Length codes 257..285 base */
@@ -2103,51 +2103,51 @@ const St = 15, Hs = 852, $s = 592, Gs = 0, Ma = 1, Ws = 2, p0 = new Uint16Array(
   64
 ]), y0 = (e, t, r, n, o, a, s, i) => {
   const h = i.bits;
-  let l = 0, c = 0, w = 0, g = 0, v = 0, k = 0, y = 0, m = 0, A = 0, E = 0, x, z, F, j, I, N = null, O;
-  const R = new Uint16Array(St + 1), U = new Uint16Array(St + 1);
+  let l = 0, c = 0, w = 0, g = 0, v = 0, E = 0, y = 0, m = 0, A = 0, k = 0, x, z, F, R, I, N = null, O;
+  const j = new Uint16Array(St + 1), U = new Uint16Array(St + 1);
   let T = null, Z, re, oe;
   for (l = 0; l <= St; l++)
-    R[l] = 0;
+    j[l] = 0;
   for (c = 0; c < n; c++)
-    R[t[r + c]]++;
-  for (v = h, g = St; g >= 1 && R[g] === 0; g--)
+    j[t[r + c]]++;
+  for (v = h, g = St; g >= 1 && j[g] === 0; g--)
     ;
   if (v > g && (v = g), g === 0)
     return o[a++] = 1 << 24 | 64 << 16 | 0, o[a++] = 1 << 24 | 64 << 16 | 0, i.bits = 1, 0;
-  for (w = 1; w < g && R[w] === 0; w++)
+  for (w = 1; w < g && j[w] === 0; w++)
     ;
   for (v < w && (v = w), m = 1, l = 1; l <= St; l++)
-    if (m <<= 1, m -= R[l], m < 0)
+    if (m <<= 1, m -= j[l], m < 0)
       return -1;
   if (m > 0 && (e === Gs || g !== 1))
     return -1;
   for (U[1] = 0, l = 1; l < St; l++)
-    U[l + 1] = U[l] + R[l];
+    U[l + 1] = U[l] + j[l];
   for (c = 0; c < n; c++)
     t[r + c] !== 0 && (s[U[t[r + c]]++] = c);
-  if (e === Gs ? (N = T = s, O = 20) : e === Ma ? (N = p0, T = g0, O = 257) : (N = b0, T = m0, O = 0), E = 0, c = 0, l = w, I = a, k = v, y = 0, F = -1, A = 1 << v, j = A - 1, e === Ma && A > Hs || e === Ws && A > $s)
+  if (e === Gs ? (N = T = s, O = 20) : e === Ma ? (N = p0, T = g0, O = 257) : (N = b0, T = m0, O = 0), k = 0, c = 0, l = w, I = a, E = v, y = 0, F = -1, A = 1 << v, R = A - 1, e === Ma && A > Hs || e === Ws && A > $s)
     return 1;
   for (; ; ) {
-    Z = l - y, s[c] + 1 < O ? (re = 0, oe = s[c]) : s[c] >= O ? (re = T[s[c] - O], oe = N[s[c] - O]) : (re = 96, oe = 0), x = 1 << l - y, z = 1 << k, w = z;
+    Z = l - y, s[c] + 1 < O ? (re = 0, oe = s[c]) : s[c] >= O ? (re = T[s[c] - O], oe = N[s[c] - O]) : (re = 96, oe = 0), x = 1 << l - y, z = 1 << E, w = z;
     do
-      z -= x, o[I + (E >> y) + z] = Z << 24 | re << 16 | oe | 0;
+      z -= x, o[I + (k >> y) + z] = Z << 24 | re << 16 | oe | 0;
     while (z !== 0);
-    for (x = 1 << l - 1; E & x; )
+    for (x = 1 << l - 1; k & x; )
       x >>= 1;
-    if (x !== 0 ? (E &= x - 1, E += x) : E = 0, c++, --R[l] === 0) {
+    if (x !== 0 ? (k &= x - 1, k += x) : k = 0, c++, --j[l] === 0) {
       if (l === g)
         break;
       l = t[r + s[c]];
     }
-    if (l > v && (E & j) !== F) {
-      for (y === 0 && (y = v), I += w, k = l - y, m = 1 << k; k + y < g && (m -= R[k + y], !(m <= 0)); )
-        k++, m <<= 1;
-      if (A += 1 << k, e === Ma && A > Hs || e === Ws && A > $s)
+    if (l > v && (k & R) !== F) {
+      for (y === 0 && (y = v), I += w, E = l - y, m = 1 << E; E + y < g && (m -= j[E + y], !(m <= 0)); )
+        E++, m <<= 1;
+      if (A += 1 << E, e === Ma && A > Hs || e === Ws && A > $s)
         return 1;
-      F = E & j, o[F] = v << 24 | k << 16 | I - a | 0;
+      F = k & R, o[F] = v << 24 | E << 16 | I - a | 0;
     }
   }
-  return E !== 0 && (o[I + E] = l - y << 24 | 64 << 16 | 0), i.bits = v, 0;
+  return k !== 0 && (o[I + k] = l - y << 24 | 64 << 16 | 0), i.bits = v, 0;
 };
 var ln = y0;
 const v0 = 0, Lf = 1, qf = 2, {
@@ -2162,7 +2162,7 @@ const v0 = 0, Lf = 1, qf = 2, {
   Z_MEM_ERROR: Df,
   Z_BUF_ERROR: E0,
   Z_DEFLATED: Zs
-} = An, Ia = 16180, Ys = 16181, Xs = 16182, Js = 16183, Qs = 16184, ec = 16185, rc = 16186, tc = 16187, nc = 16188, ac = 16189, da = 16190, Ir = 16191, Da = 16192, oc = 16193, Fa = 16194, ic = 16195, sc = 16196, cc = 16197, uc = 16198, Nn = 16199, Cn = 16200, lc = 16201, fc = 16202, dc = 16203, hc = 16204, pc = 16205, Ka = 16206, gc = 16207, bc = 16208, Ne = 16209, Ff = 16210, Kf = 16211, x0 = 852, A0 = 592, S0 = 15, I0 = S0, mc = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
+} = xn, Sa = 16180, Ys = 16181, Xs = 16182, Js = 16183, Qs = 16184, ec = 16185, rc = 16186, tc = 16187, nc = 16188, ac = 16189, da = 16190, Ir = 16191, Da = 16192, oc = 16193, Fa = 16194, ic = 16195, sc = 16196, cc = 16197, uc = 16198, Nn = 16199, Cn = 16200, lc = 16201, fc = 16202, dc = 16203, hc = 16204, pc = 16205, Ka = 16206, gc = 16207, bc = 16208, Ne = 16209, Ff = 16210, Kf = 16211, x0 = 852, A0 = 592, S0 = 15, I0 = S0, mc = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
 function B0() {
   this.strm = null, this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
 }
@@ -2170,12 +2170,12 @@ const kt = (e) => {
   if (!e)
     return 1;
   const t = e.state;
-  return !t || t.strm !== e || t.mode < Ia || t.mode > Kf ? 1 : 0;
+  return !t || t.strm !== e || t.mode < Sa || t.mode > Kf ? 1 : 0;
 }, Hf = (e) => {
   if (kt(e))
     return lr;
   const t = e.state;
-  return e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = t.wrap & 1), t.mode = Ia, t.last = 0, t.havedict = 0, t.flags = -1, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new Int32Array(x0), t.distcode = t.distdyn = new Int32Array(A0), t.sane = 1, t.back = -1, wt;
+  return e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = t.wrap & 1), t.mode = Sa, t.last = 0, t.havedict = 0, t.flags = -1, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new Int32Array(x0), t.distcode = t.distdyn = new Int32Array(A0), t.sane = 1, t.back = -1, wt;
 }, $f = (e) => {
   if (kt(e))
     return lr;
@@ -2191,7 +2191,7 @@ const kt = (e) => {
   if (!e)
     return lr;
   const r = new B0();
-  e.state = r, r.strm = e, r.window = null, r.mode = Ia;
+  e.state = r, r.strm = e, r.window = null, r.mode = Sa;
   const n = Gf(e, t);
   return n !== wt && (e.state = null), n;
 }, T0 = (e) => Wf(e, I0);
@@ -2218,9 +2218,9 @@ const z0 = (e) => {
   const a = e.state;
   return a.window === null && (a.wsize = 1 << a.wbits, a.wnext = 0, a.whave = 0, a.window = new Uint8Array(a.wsize)), n >= a.wsize ? (a.window.set(t.subarray(r - a.wsize, r), 0), a.wnext = 0, a.whave = a.wsize) : (o = a.wsize - a.wnext, o > n && (o = n), a.window.set(t.subarray(r - n, r - n + o), a.wnext), n -= o, n ? (a.window.set(t.subarray(r - n, r), 0), a.wnext = n, a.whave = a.wsize) : (a.wnext += o, a.wnext === a.wsize && (a.wnext = 0), a.whave < a.wsize && (a.whave += o))), 0;
 }, O0 = (e, t) => {
-  let r, n, o, a, s, i, h, l, c, w, g, v, k, y, m = 0, A, E, x, z, F, j, I, N;
+  let r, n, o, a, s, i, h, l, c, w, g, v, E, y, m = 0, A, k, x, z, F, R, I, N;
   const O = new Uint8Array(4);
-  let R, U;
+  let j, U;
   const T = (
     /* permutation of code lengths */
     new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15])
@@ -2231,7 +2231,7 @@ const z0 = (e) => {
   e:
     for (; ; )
       switch (r.mode) {
-        case Ia:
+        case Sa:
           if (r.wrap === 0) {
             r.mode = Da;
             break;
@@ -2451,7 +2451,7 @@ const z0 = (e) => {
           }
           for (; r.have < 19; )
             r.lens[T[r.have++]] = 0;
-          if (r.lencode = r.lendyn, r.lenbits = 7, R = { bits: r.lenbits }, N = ln(v0, r.lens, 0, 19, r.lencode, 0, r.work, R), r.lenbits = R.bits, N) {
+          if (r.lencode = r.lendyn, r.lenbits = 7, j = { bits: r.lenbits }, N = ln(v0, r.lens, 0, 19, r.lencode, 0, r.work, j), r.lenbits = j.bits, N) {
             e.msg = "invalid code lengths set", r.mode = Ne;
             break;
           }
@@ -2459,7 +2459,7 @@ const z0 = (e) => {
         /* falls through */
         case uc:
           for (; r.have < r.nlen + r.ndist; ) {
-            for (; m = r.lencode[l & (1 << r.lenbits) - 1], A = m >>> 24, E = m >>> 16 & 255, x = m & 65535, !(A <= c); ) {
+            for (; m = r.lencode[l & (1 << r.lenbits) - 1], A = m >>> 24, k = m >>> 16 & 255, x = m & 65535, !(A <= c); ) {
               if (i === 0)
                 break e;
               i--, l += n[a++] << c, c += 8;
@@ -2507,11 +2507,11 @@ const z0 = (e) => {
             e.msg = "invalid code -- missing end-of-block", r.mode = Ne;
             break;
           }
-          if (r.lenbits = 9, R = { bits: r.lenbits }, N = ln(Lf, r.lens, 0, r.nlen, r.lencode, 0, r.work, R), r.lenbits = R.bits, N) {
+          if (r.lenbits = 9, j = { bits: r.lenbits }, N = ln(Lf, r.lens, 0, r.nlen, r.lencode, 0, r.work, j), r.lenbits = j.bits, N) {
             e.msg = "invalid literal/lengths set", r.mode = Ne;
             break;
           }
-          if (r.distbits = 6, r.distcode = r.distdyn, R = { bits: r.distbits }, N = ln(qf, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, R), r.distbits = R.bits, N) {
+          if (r.distbits = 6, r.distcode = r.distdyn, j = { bits: r.distbits }, N = ln(qf, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, j), r.distbits = j.bits, N) {
             e.msg = "invalid distances set", r.mode = Ne;
             break;
           }
@@ -2526,32 +2526,32 @@ const z0 = (e) => {
             e.next_out = s, e.avail_out = h, e.next_in = a, e.avail_in = i, r.hold = l, r.bits = c, h0(e, g), s = e.next_out, o = e.output, h = e.avail_out, a = e.next_in, n = e.input, i = e.avail_in, l = r.hold, c = r.bits, r.mode === Ir && (r.back = -1);
             break;
           }
-          for (r.back = 0; m = r.lencode[l & (1 << r.lenbits) - 1], A = m >>> 24, E = m >>> 16 & 255, x = m & 65535, !(A <= c); ) {
+          for (r.back = 0; m = r.lencode[l & (1 << r.lenbits) - 1], A = m >>> 24, k = m >>> 16 & 255, x = m & 65535, !(A <= c); ) {
             if (i === 0)
               break e;
             i--, l += n[a++] << c, c += 8;
           }
-          if (E && (E & 240) === 0) {
-            for (z = A, F = E, j = x; m = r.lencode[j + ((l & (1 << z + F) - 1) >> z)], A = m >>> 24, E = m >>> 16 & 255, x = m & 65535, !(z + A <= c); ) {
+          if (k && (k & 240) === 0) {
+            for (z = A, F = k, R = x; m = r.lencode[R + ((l & (1 << z + F) - 1) >> z)], A = m >>> 24, k = m >>> 16 & 255, x = m & 65535, !(z + A <= c); ) {
               if (i === 0)
                 break e;
               i--, l += n[a++] << c, c += 8;
             }
             l >>>= z, c -= z, r.back += z;
           }
-          if (l >>>= A, c -= A, r.back += A, r.length = x, E === 0) {
+          if (l >>>= A, c -= A, r.back += A, r.length = x, k === 0) {
             r.mode = pc;
             break;
           }
-          if (E & 32) {
+          if (k & 32) {
             r.back = -1, r.mode = Ir;
             break;
           }
-          if (E & 64) {
+          if (k & 64) {
             e.msg = "invalid literal/length code", r.mode = Ne;
             break;
           }
-          r.extra = E & 15, r.mode = lc;
+          r.extra = k & 15, r.mode = lc;
         /* falls through */
         case lc:
           if (r.extra) {
@@ -2565,24 +2565,24 @@ const z0 = (e) => {
           r.was = r.length, r.mode = fc;
         /* falls through */
         case fc:
-          for (; m = r.distcode[l & (1 << r.distbits) - 1], A = m >>> 24, E = m >>> 16 & 255, x = m & 65535, !(A <= c); ) {
+          for (; m = r.distcode[l & (1 << r.distbits) - 1], A = m >>> 24, k = m >>> 16 & 255, x = m & 65535, !(A <= c); ) {
             if (i === 0)
               break e;
             i--, l += n[a++] << c, c += 8;
           }
-          if ((E & 240) === 0) {
-            for (z = A, F = E, j = x; m = r.distcode[j + ((l & (1 << z + F) - 1) >> z)], A = m >>> 24, E = m >>> 16 & 255, x = m & 65535, !(z + A <= c); ) {
+          if ((k & 240) === 0) {
+            for (z = A, F = k, R = x; m = r.distcode[R + ((l & (1 << z + F) - 1) >> z)], A = m >>> 24, k = m >>> 16 & 255, x = m & 65535, !(z + A <= c); ) {
               if (i === 0)
                 break e;
               i--, l += n[a++] << c, c += 8;
             }
             l >>>= z, c -= z, r.back += z;
           }
-          if (l >>>= A, c -= A, r.back += A, E & 64) {
+          if (l >>>= A, c -= A, r.back += A, k & 64) {
             e.msg = "invalid distance code", r.mode = Ne;
             break;
           }
-          r.offset = x, r.extra = E & 15, r.mode = dc;
+          r.offset = x, r.extra = k & 15, r.mode = dc;
         /* falls through */
         case dc:
           if (r.extra) {
@@ -2607,12 +2607,12 @@ const z0 = (e) => {
               e.msg = "invalid distance too far back", r.mode = Ne;
               break;
             }
-            v > r.wnext ? (v -= r.wnext, k = r.wsize - v) : k = r.wnext - v, v > r.length && (v = r.length), y = r.window;
+            v > r.wnext ? (v -= r.wnext, E = r.wsize - v) : E = r.wnext - v, v > r.length && (v = r.length), y = r.window;
           } else
-            y = o, k = s - r.offset, v = r.length;
+            y = o, E = s - r.offset, v = r.length;
           v > h && (v = h), h -= v, r.length -= v;
           do
-            o[s++] = y[k++];
+            o[s++] = y[E++];
           while (--v);
           r.length === 0 && (r.mode = Cn);
           break;
@@ -2667,12 +2667,12 @@ const z0 = (e) => {
       }
   return e.next_out = s, e.avail_out = h, e.next_in = a, e.avail_in = i, r.hold = l, r.bits = c, (r.wsize || g !== e.avail_out && r.mode < Ne && (r.mode < Ka || t !== Vs)) && Vf(e, e.output, e.next_out, g - e.avail_out), w -= e.avail_in, g -= e.avail_out, e.total_in += w, e.total_out += g, r.total += g, r.wrap & 4 && g && (e.adler = r.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
   r.flags ? Ke(r.check, o, g, e.next_out - g) : bn(r.check, o, g, e.next_out - g)), e.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === Ir ? 128 : 0) + (r.mode === Nn || r.mode === Fa ? 256 : 0), (w === 0 && g === 0 || t === Vs) && N === wt && (N = E0), N;
-}, R0 = (e) => {
+}, j0 = (e) => {
   if (kt(e))
     return lr;
   let t = e.state;
   return t.window && (t.window = null), e.state = null, wt;
-}, j0 = (e, t) => {
+}, R0 = (e, t) => {
   if (kt(e))
     return lr;
   const r = e.state;
@@ -2682,7 +2682,7 @@ const z0 = (e) => {
   let n, o, a;
   return kt(e) || (n = e.state, n.wrap !== 0 && n.mode !== da) ? lr : n.mode === da && (o = 1, o = bn(o, t, r, 0), o !== n.check) ? Mf : (a = Vf(e, t, r, r), a ? (n.mode = Ff, Df) : (n.havedict = 1, wt));
 };
-var U0 = $f, N0 = Gf, C0 = Hf, L0 = T0, q0 = Wf, M0 = O0, D0 = R0, F0 = j0, K0 = P0, H0 = "pako inflate (from Nodeca project)", Ur = {
+var U0 = $f, N0 = Gf, C0 = Hf, L0 = T0, q0 = Wf, M0 = O0, D0 = j0, F0 = R0, K0 = P0, H0 = "pako inflate (from Nodeca project)", Ur = {
   inflateReset: U0,
   inflateReset2: N0,
   inflateResetKeep: C0,
@@ -2707,9 +2707,9 @@ const Zf = Object.prototype.toString, {
   Z_STREAM_ERROR: Z0,
   Z_DATA_ERROR: vc,
   Z_MEM_ERROR: Y0
-} = An;
-function Bn(e) {
-  this.options = Sa.assign({
+} = xn;
+function In(e) {
+  this.options = Aa.assign({
     chunkSize: 1024 * 64,
     windowBits: 15,
     to: ""
@@ -2725,7 +2725,7 @@ function Bn(e) {
   if (this.header = new G0(), Ur.inflateGetHeader(this.strm, this.header), t.dictionary && (typeof t.dictionary == "string" ? t.dictionary = yn.string2buf(t.dictionary) : Zf.call(t.dictionary) === "[object ArrayBuffer]" && (t.dictionary = new Uint8Array(t.dictionary)), t.raw && (r = Ur.inflateSetDictionary(this.strm, t.dictionary), r !== vn)))
     throw new Error(yt[r]);
 }
-Bn.prototype.push = function(e, t) {
+In.prototype.push = function(e, t) {
   const r = this.strm, n = this.options.chunkSize, o = this.options.dictionary;
   let a, s, i;
   if (this.ended) return !1;
@@ -2753,28 +2753,28 @@ Bn.prototype.push = function(e, t) {
   }
   return !0;
 };
-Bn.prototype.onData = function(e) {
+In.prototype.onData = function(e) {
   this.chunks.push(e);
 };
-Bn.prototype.onEnd = function(e) {
-  e === vn && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = Sa.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+In.prototype.onEnd = function(e) {
+  e === vn && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = Aa.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
 function hs(e, t) {
-  const r = new Bn(t);
+  const r = new In(t);
   if (r.push(e), r.err) throw r.msg || yt[r.err];
   return r.result;
 }
 function X0(e, t) {
   return t = t || {}, t.raw = !0, hs(e, t);
 }
-var J0 = Bn, Q0 = hs, eg = X0, rg = hs, tg = {
+var J0 = In, Q0 = hs, eg = X0, rg = hs, tg = {
   Inflate: J0,
   inflate: Q0,
   inflateRaw: eg,
   ungzip: rg
 };
 const { Deflate: ng, deflate: ag, deflateRaw: og, gzip: ig } = f0, { Inflate: sg, inflate: cg, inflateRaw: ug, ungzip: lg } = tg;
-var fg = ng, dg = ag, hg = og, pg = ig, gg = sg, bg = cg, mg = ug, yg = lg, vg = An, sv = {
+var fg = ng, dg = ag, hg = og, pg = ig, gg = sg, bg = cg, mg = ug, yg = lg, vg = xn, sv = {
   Deflate: fg,
   deflate: dg,
   deflateRaw: hg,
@@ -2784,7 +2784,35 @@ var fg = ng, dg = ag, hg = og, pg = ig, gg = sg, bg = cg, mg = ug, yg = lg, vg =
   inflateRaw: mg,
   ungzip: yg,
   constants: vg
-}, ct = {}, wc;
+};
+function Ia(e) {
+  return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
+}
+function Bn(e) {
+  if (Object.prototype.hasOwnProperty.call(e, "__esModule")) return e;
+  var t = e.default;
+  if (typeof t == "function") {
+    var r = function n() {
+      var o = !1;
+      try {
+        o = this instanceof n;
+      } catch {
+      }
+      return o ? Reflect.construct(t, arguments, this.constructor) : t.apply(this, arguments);
+    };
+    r.prototype = t.prototype;
+  } else r = {};
+  return Object.defineProperty(r, "__esModule", { value: !0 }), Object.keys(e).forEach(function(n) {
+    var o = Object.getOwnPropertyDescriptor(e, n);
+    Object.defineProperty(r, n, o.get ? o : {
+      enumerable: !0,
+      get: function() {
+        return e[n];
+      }
+    });
+  }), r;
+}
+var ct = {}, wc;
 function wg() {
   if (wc) return ct;
   wc = 1, Object.defineProperty(ct, "__esModule", { value: !0 }), ct.bech32m = ct.bech32 = void 0;
@@ -2813,17 +2841,17 @@ function wg() {
     return c;
   }
   function o(l, c, w, g) {
-    let v = 0, k = 0;
+    let v = 0, E = 0;
     const y = (1 << w) - 1, m = [];
     for (let A = 0; A < l.length; ++A)
-      for (v = v << c | l[A], k += c; k >= w; )
-        k -= w, m.push(v >> k & y);
+      for (v = v << c | l[A], E += c; E >= w; )
+        E -= w, m.push(v >> E & y);
     if (g)
-      k > 0 && m.push(v << w - k & y);
+      E > 0 && m.push(v << w - E & y);
     else {
-      if (k >= c)
+      if (E >= c)
         return "Excess padding";
-      if (v << w - k & y)
+      if (v << w - E & y)
         return "Non-zero padding";
     }
     return m;
@@ -2849,21 +2877,21 @@ function wg() {
       if (A = A || 90, y.length + 7 + m.length > A)
         throw new TypeError("Exceeds length limit");
       y = y.toLowerCase();
-      let E = n(y);
-      if (typeof E == "string")
-        throw new Error(E);
+      let k = n(y);
+      if (typeof k == "string")
+        throw new Error(k);
       let x = y + "1";
       for (let z = 0; z < m.length; ++z) {
         const F = m[z];
         if (F >> 5 !== 0)
           throw new Error("Non 5-bit word");
-        E = r(E) ^ F, x += e.charAt(F);
+        k = r(k) ^ F, x += e.charAt(F);
       }
       for (let z = 0; z < 6; ++z)
-        E = r(E);
-      E ^= c;
+        k = r(k);
+      k ^= c;
       for (let z = 0; z < 6; ++z) {
-        const F = E >> (5 - z) * 5 & 31;
+        const F = k >> (5 - z) * 5 & 31;
         x += e.charAt(F);
       }
       return x;
@@ -2873,8 +2901,8 @@ function wg() {
         return y + " too short";
       if (y.length > m)
         return "Exceeds length limit";
-      const A = y.toLowerCase(), E = y.toUpperCase();
-      if (y !== A && y !== E)
+      const A = y.toLowerCase(), k = y.toUpperCase();
+      if (y !== A && y !== k)
         return "Mixed-case string " + y;
       y = A;
       const x = y.lastIndexOf("1");
@@ -2885,24 +2913,24 @@ function wg() {
       const z = y.slice(0, x), F = y.slice(x + 1);
       if (F.length < 6)
         return "Data too short";
-      let j = n(z);
-      if (typeof j == "string")
-        return j;
+      let R = n(z);
+      if (typeof R == "string")
+        return R;
       const I = [];
       for (let N = 0; N < F.length; ++N) {
-        const O = F.charAt(N), R = t[O];
-        if (R === void 0)
+        const O = F.charAt(N), j = t[O];
+        if (j === void 0)
           return "Unknown character " + O;
-        j = r(j) ^ R, !(N + 6 >= F.length) && I.push(R);
+        R = r(R) ^ j, !(N + 6 >= F.length) && I.push(j);
       }
-      return j !== c ? "Invalid checksum for " + y : { prefix: z, words: I };
+      return R !== c ? "Invalid checksum for " + y : { prefix: z, words: I };
     }
     function v(y, m) {
       const A = g(y, m);
       if (typeof A == "object")
         return A;
     }
-    function k(y, m) {
+    function E(y, m) {
       const A = g(y, m);
       if (typeof A == "object")
         return A;
@@ -2910,7 +2938,7 @@ function wg() {
     }
     return {
       decodeUnsafe: v,
-      decode: k,
+      decode: E,
       encode: w,
       toWords: a,
       fromWordsUnsafe: s,
@@ -2942,20 +2970,20 @@ function _g(e) {
     const v = l.length;
     for (; g !== v && l[g] === 0; )
       g++, c++;
-    const k = (v - g) * a + 1 >>> 0, y = new Uint8Array(k);
+    const E = (v - g) * a + 1 >>> 0, y = new Uint8Array(E);
     for (; g !== v; ) {
-      let E = l[g], x = 0;
-      for (let z = k - 1; (E !== 0 || x < w) && z !== -1; z--, x++)
-        E += 256 * y[z] >>> 0, y[z] = E % r >>> 0, E = E / r >>> 0;
-      if (E !== 0)
+      let k = l[g], x = 0;
+      for (let z = E - 1; (k !== 0 || x < w) && z !== -1; z--, x++)
+        k += 256 * y[z] >>> 0, y[z] = k % r >>> 0, k = k / r >>> 0;
+      if (k !== 0)
         throw new Error("Non-zero carry");
       w = x, g++;
     }
-    let m = k - w;
-    for (; m !== k && y[m] === 0; )
+    let m = E - w;
+    for (; m !== E && y[m] === 0; )
       m++;
     let A = n.repeat(c);
-    for (; m < k; ++m)
+    for (; m < E; ++m)
       A += e.charAt(y[m]);
     return A;
   }
@@ -2967,28 +2995,28 @@ function _g(e) {
     let c = 0, w = 0, g = 0;
     for (; l[c] === n; )
       w++, c++;
-    const v = (l.length - c) * o + 1 >>> 0, k = new Uint8Array(v);
+    const v = (l.length - c) * o + 1 >>> 0, E = new Uint8Array(v);
     for (; c < l.length; ) {
-      const E = l.charCodeAt(c);
-      if (E > 255)
+      const k = l.charCodeAt(c);
+      if (k > 255)
         return;
-      let x = t[E];
+      let x = t[k];
       if (x === 255)
         return;
       let z = 0;
       for (let F = v - 1; (x !== 0 || z < g) && F !== -1; F--, z++)
-        x += r * k[F] >>> 0, k[F] = x % 256 >>> 0, x = x / 256 >>> 0;
+        x += r * E[F] >>> 0, E[F] = x % 256 >>> 0, x = x / 256 >>> 0;
       if (x !== 0)
         throw new Error("Non-zero carry");
       g = z, c++;
     }
     let y = v - g;
-    for (; y !== v && k[y] === 0; )
+    for (; y !== v && E[y] === 0; )
       y++;
     const m = new Uint8Array(w + (v - y));
     let A = w;
     for (; y !== v; )
-      m[A++] = k[y++];
+      m[A++] = E[y++];
     return m;
   }
   function h(l) {
@@ -3093,26 +3121,26 @@ function Yf() {
   function a(g) {
     return e.Function(g) ? g.toJSON ? g.toJSON() : t(g) : e.Array(g) ? "Array" : g && e.Object(g) ? "Object" : g !== void 0 ? g : "";
   }
-  function s(g, v, k) {
+  function s(g, v, E) {
     var y = n(v);
-    return "Expected " + a(g) + ", got" + (k !== "" ? " " + k : "") + (y !== "" ? " " + y : "");
+    return "Expected " + a(g) + ", got" + (E !== "" ? " " + E : "") + (y !== "" ? " " + y : "");
   }
-  function i(g, v, k) {
-    k = k || r(v), this.message = s(g, v, k), o(this, i), this.__type = g, this.__value = v, this.__valueTypeName = k;
+  function i(g, v, E) {
+    E = E || r(v), this.message = s(g, v, E), o(this, i), this.__type = g, this.__value = v, this.__valueTypeName = E;
   }
   i.prototype = Object.create(Error.prototype), i.prototype.constructor = i;
-  function h(g, v, k, y, m) {
+  function h(g, v, E, y, m) {
     var A = '" of type ';
-    return v === "key" && (A = '" with key type '), s('property "' + a(k) + A + a(g), y, m);
+    return v === "key" && (A = '" with key type '), s('property "' + a(E) + A + a(g), y, m);
   }
-  function l(g, v, k, y, m) {
-    g ? (m = m || r(y), this.message = h(g, k, v, y, m)) : this.message = 'Unexpected property "' + v + '"', o(this, i), this.__label = k, this.__property = v, this.__type = g, this.__value = y, this.__valueTypeName = m;
+  function l(g, v, E, y, m) {
+    g ? (m = m || r(y), this.message = h(g, E, v, y, m)) : this.message = 'Unexpected property "' + v + '"', o(this, i), this.__label = E, this.__property = v, this.__type = g, this.__value = y, this.__valueTypeName = m;
   }
   l.prototype = Object.create(Error.prototype), l.prototype.constructor = i;
   function c(g, v) {
     return new i(g, {}, v);
   }
-  function w(g, v, k) {
+  function w(g, v, E) {
     return g instanceof l ? (v = v + "." + g.__property, g = new l(
       g.__type,
       v,
@@ -3122,7 +3150,7 @@ function Yf() {
     )) : g instanceof i && (g = new l(
       g.__type,
       v,
-      k,
+      E,
       g.__value,
       g.__valueTypeName
     )), o(g), g;
@@ -3141,60 +3169,60 @@ function Ag() {
   if (Ec) return Xa;
   Ec = 1;
   var e = ps(), t = Yf();
-  function r(j) {
-    return J.isBuffer(j);
+  function r(R) {
+    return J.isBuffer(R);
   }
-  function n(j) {
-    return typeof j == "string" && /^([0-9a-f]{2})+$/i.test(j);
+  function n(R) {
+    return typeof R == "string" && /^([0-9a-f]{2})+$/i.test(R);
   }
-  function o(j, I) {
-    var N = j.toJSON();
-    function O(R) {
-      if (!j(R)) return !1;
-      if (R.length === I) return !0;
-      throw t.tfCustomError(N + "(Length: " + I + ")", N + "(Length: " + R.length + ")");
+  function o(R, I) {
+    var N = R.toJSON();
+    function O(j) {
+      if (!R(j)) return !1;
+      if (j.length === I) return !0;
+      throw t.tfCustomError(N + "(Length: " + I + ")", N + "(Length: " + j.length + ")");
     }
     return O.toJSON = function() {
       return N;
     }, O;
   }
   var a = o.bind(null, e.Array), s = o.bind(null, r), i = o.bind(null, n), h = o.bind(null, e.String);
-  function l(j, I, N) {
+  function l(R, I, N) {
     N = N || e.Number;
-    function O(R, U) {
-      return N(R, U) && R > j && R < I;
+    function O(j, U) {
+      return N(j, U) && j > R && j < I;
     }
     return O.toJSON = function() {
-      return `${N.toJSON()} between [${j}, ${I}]`;
+      return `${N.toJSON()} between [${R}, ${I}]`;
     }, O;
   }
   var c = Math.pow(2, 53) - 1;
-  function w(j) {
-    return typeof j == "number" && isFinite(j);
+  function w(R) {
+    return typeof R == "number" && isFinite(R);
   }
-  function g(j) {
-    return j << 24 >> 24 === j;
+  function g(R) {
+    return R << 24 >> 24 === R;
   }
-  function v(j) {
-    return j << 16 >> 16 === j;
+  function v(R) {
+    return R << 16 >> 16 === R;
   }
-  function k(j) {
-    return (j | 0) === j;
+  function E(R) {
+    return (R | 0) === R;
   }
-  function y(j) {
-    return typeof j == "number" && j >= -c && j <= c && Math.floor(j) === j;
+  function y(R) {
+    return typeof R == "number" && R >= -c && R <= c && Math.floor(R) === R;
   }
-  function m(j) {
-    return (j & 255) === j;
+  function m(R) {
+    return (R & 255) === R;
   }
-  function A(j) {
-    return (j & 65535) === j;
+  function A(R) {
+    return (R & 65535) === R;
   }
-  function E(j) {
-    return j >>> 0 === j;
+  function k(R) {
+    return R >>> 0 === R;
   }
-  function x(j) {
-    return typeof j == "number" && j >= 0 && j <= c && Math.floor(j) === j;
+  function x(R) {
+    return typeof R == "number" && R >= 0 && R <= c && Math.floor(R) === R;
   }
   var z = {
     ArrayN: a,
@@ -3205,18 +3233,18 @@ function Ag() {
     HexN: i,
     Int8: g,
     Int16: v,
-    Int32: k,
+    Int32: E,
     Int53: y,
     Range: l,
     StringN: h,
     UInt8: m,
     UInt16: A,
-    UInt32: E,
+    UInt32: k,
     UInt53: x
   };
   for (var F in z)
-    z[F].toJSON = function(j) {
-      return j;
+    z[F].toJSON = function(R) {
+      return R;
     }.bind(null, F);
   return Xa = z, Xa;
 }
@@ -3225,12 +3253,12 @@ function Xf() {
   if (xc) return Ja;
   xc = 1;
   var e = Yf(), t = ps(), r = e.tfJSON, n = e.TfTypeError, o = e.TfPropertyTypeError, a = e.tfSubError, s = e.getValueTypeName, i = {
-    arrayOf: function(v, k) {
-      v = h(v), k = k || {};
+    arrayOf: function(v, E) {
+      v = h(v), E = E || {};
       function y(m, A) {
-        return !t.Array(m) || t.Nil(m) || k.minLength !== void 0 && m.length < k.minLength || k.maxLength !== void 0 && m.length > k.maxLength || k.length !== void 0 && m.length !== k.length ? !1 : m.every(function(E, x) {
+        return !t.Array(m) || t.Nil(m) || E.minLength !== void 0 && m.length < E.minLength || E.maxLength !== void 0 && m.length > E.maxLength || E.length !== void 0 && m.length !== E.length ? !1 : m.every(function(k, x) {
           try {
-            return l(v, E, A);
+            return l(v, k, A);
           } catch (z) {
             throw a(z, x);
           }
@@ -3238,72 +3266,72 @@ function Xf() {
       }
       return y.toJSON = function() {
         var m = "[" + r(v) + "]";
-        return k.length !== void 0 ? m += "{" + k.length + "}" : (k.minLength !== void 0 || k.maxLength !== void 0) && (m += "{" + (k.minLength === void 0 ? 0 : k.minLength) + "," + (k.maxLength === void 0 ? 1 / 0 : k.maxLength) + "}"), m;
+        return E.length !== void 0 ? m += "{" + E.length + "}" : (E.minLength !== void 0 || E.maxLength !== void 0) && (m += "{" + (E.minLength === void 0 ? 0 : E.minLength) + "," + (E.maxLength === void 0 ? 1 / 0 : E.maxLength) + "}"), m;
       }, y;
     },
     maybe: function g(v) {
       v = h(v);
-      function k(y, m) {
+      function E(y, m) {
         return t.Nil(y) || v(y, m, g);
       }
-      return k.toJSON = function() {
+      return E.toJSON = function() {
         return "?" + r(v);
-      }, k;
+      }, E;
     },
-    map: function(v, k) {
-      v = h(v), k && (k = h(k));
+    map: function(v, E) {
+      v = h(v), E && (E = h(E));
       function y(m, A) {
         if (!t.Object(m) || t.Nil(m)) return !1;
-        for (var E in m) {
+        for (var k in m) {
           try {
-            k && l(k, E, A);
+            E && l(E, k, A);
           } catch (z) {
-            throw a(z, E, "key");
+            throw a(z, k, "key");
           }
           try {
-            var x = m[E];
+            var x = m[k];
             l(v, x, A);
           } catch (z) {
-            throw a(z, E);
+            throw a(z, k);
           }
         }
         return !0;
       }
-      return k ? y.toJSON = function() {
-        return "{" + r(k) + ": " + r(v) + "}";
+      return E ? y.toJSON = function() {
+        return "{" + r(E) + ": " + r(v) + "}";
       } : y.toJSON = function() {
         return "{" + r(v) + "}";
       }, y;
     },
     object: function(v) {
-      var k = {};
+      var E = {};
       for (var y in v)
-        k[y] = h(v[y]);
-      function m(A, E) {
+        E[y] = h(v[y]);
+      function m(A, k) {
         if (!t.Object(A) || t.Nil(A)) return !1;
         var x;
         try {
-          for (x in k) {
-            var z = k[x], F = A[x];
-            l(z, F, E);
+          for (x in E) {
+            var z = E[x], F = A[x];
+            l(z, F, k);
           }
-        } catch (j) {
-          throw a(j, x);
+        } catch (R) {
+          throw a(R, x);
         }
-        if (E) {
+        if (k) {
           for (x in A)
-            if (!k[x])
+            if (!E[x])
               throw new o(void 0, x);
         }
         return !0;
       }
       return m.toJSON = function() {
-        return r(k);
+        return r(E);
       }, m;
     },
     anyOf: function() {
       var v = [].slice.call(arguments).map(h);
-      function k(y, m) {
+      function E(y, m) {
         return v.some(function(A) {
           try {
             return l(A, y, m);
@@ -3312,13 +3340,13 @@ function Xf() {
           }
         });
       }
-      return k.toJSON = function() {
+      return E.toJSON = function() {
         return v.map(r).join("|");
-      }, k;
+      }, E;
     },
     allOf: function() {
       var v = [].slice.call(arguments).map(h);
-      function k(y, m) {
+      function E(y, m) {
         return v.every(function(A) {
           try {
             return l(A, y, m);
@@ -3327,40 +3355,40 @@ function Xf() {
           }
         });
       }
-      return k.toJSON = function() {
+      return E.toJSON = function() {
         return v.map(r).join(" & ");
-      }, k;
+      }, E;
     },
     quacksLike: function(v) {
-      function k(y) {
+      function E(y) {
         return v === s(y);
       }
-      return k.toJSON = function() {
+      return E.toJSON = function() {
         return v;
-      }, k;
+      }, E;
     },
     tuple: function() {
       var v = [].slice.call(arguments).map(h);
-      function k(y, m) {
-        return t.Nil(y) || t.Nil(y.length) || m && y.length !== v.length ? !1 : v.every(function(A, E) {
+      function E(y, m) {
+        return t.Nil(y) || t.Nil(y.length) || m && y.length !== v.length ? !1 : v.every(function(A, k) {
           try {
-            return l(A, y[E], m);
+            return l(A, y[k], m);
           } catch (x) {
-            throw a(x, E);
+            throw a(x, k);
           }
         });
       }
-      return k.toJSON = function() {
+      return E.toJSON = function() {
         return "(" + v.map(r).join(", ") + ")";
-      }, k;
+      }, E;
     },
     value: function(v) {
-      function k(y) {
+      function E(y) {
         return y === v;
       }
-      return k.toJSON = function() {
+      return E.toJSON = function() {
         return v;
-      }, k;
+      }, E;
     }
   };
   i.oneOf = i.anyOf;
@@ -3377,12 +3405,12 @@ function Xf() {
       return g;
     return i.value(g);
   }
-  function l(g, v, k, y) {
+  function l(g, v, E, y) {
     if (t.Function(g)) {
-      if (g(v, k)) return !0;
+      if (g(v, E)) return !0;
       throw new n(y || g, v);
     }
-    return l(h(g), v, k);
+    return l(h(g), v, E);
   }
   for (var c in t)
     l[c] = t[c];
@@ -3394,7 +3422,7 @@ function Xf() {
   return l.compile = h, l.TfTypeError = n, l.TfPropertyTypeError = o, Ja = l, Ja;
 }
 var Sg = Xf();
-const lv = /* @__PURE__ */ Ea(Sg), Jf = "0123456789abcdefABCDEF";
+const lv = /* @__PURE__ */ Ia(Sg), Jf = "0123456789abcdefABCDEF";
 Jf.split("").map((e) => e.codePointAt(0));
 Array(256).fill(!0).map((e, t) => {
   const r = String.fromCodePoint(t), n = Jf.indexOf(r);
@@ -3445,7 +3473,7 @@ function Og(e, t, r) {
     return n = (n << 8) + e[t] >>> 0, n = (n << 8) + e[t + 1] >>> 0, n = (n << 8) + e[t + 2] >>> 0, n = (n << 8) + e[t + 3] >>> 0, n;
   }
 }
-function Rg(e, t, r) {
+function jg(e, t, r) {
   if (t + 8 > e.length)
     throw new Error("Offset is outside the bounds of Uint8Array");
   if (r = r.toUpperCase(), r === "LE") {
@@ -3456,7 +3484,7 @@ function Rg(e, t, r) {
     return n = (n << 8n) + BigInt(e[t]), n = (n << 8n) + BigInt(e[t + 1]), n = (n << 8n) + BigInt(e[t + 2]), n = (n << 8n) + BigInt(e[t + 3]), n = (n << 8n) + BigInt(e[t + 4]), n = (n << 8n) + BigInt(e[t + 5]), n = (n << 8n) + BigInt(e[t + 6]), n = (n << 8n) + BigInt(e[t + 7]), n;
   }
 }
-const jg = (e) => {
+const Rg = (e) => {
   if (e < 0 || e > 0xffffffffffffffffn)
     throw new RangeError("value out of range");
 };
@@ -3465,7 +3493,7 @@ function Pg(e) {
     throw new RangeError("value out of range");
 }
 function Qf(e) {
-  typeof e == "number" ? Pg(e) : jg(e);
+  typeof e == "number" ? Pg(e) : Rg(e);
 }
 function fv(e, t, r) {
   Qf(e), r === void 0 && (r = 0), t === void 0 && (t = new Uint8Array(Ug(e)));
@@ -3494,7 +3522,7 @@ function dv(e, t) {
       bytes: 5
     };
   } else {
-    const n = Rg(e, t + 1, "LE");
+    const n = jg(e, t + 1, "LE");
     return { numberValue: n <= Number.MAX_SAFE_INTEGER ? Number(n) : null, bigintValue: n, bytes: 9 };
   }
 }
@@ -3573,8 +3601,8 @@ function Ng() {
     let w = 4;
     return l.slice(1).forEach((g) => {
       const v = g.slice(-1) === "'";
-      let k = 2147483647 & parseInt(v ? g.slice(0, -1) : g, 10);
-      v && (k += 2147483648), c.writeUInt32LE(k, w), w += 4;
+      let E = 2147483647 & parseInt(v ? g.slice(0, -1) : g, 10);
+      v && (E += 2147483648), c.writeUInt32LE(E, w), w += 4;
     }), {
       key: h,
       value: c
@@ -3737,10 +3765,10 @@ function Dg() {
   }
   return Kr.canAddToArray = a, Kr;
 }
-var Hr = {}, Rc;
+var Hr = {}, jc;
 function Fg() {
-  if (Rc) return Hr;
-  Rc = 1, Object.defineProperty(Hr, "__esModule", { value: !0 });
+  if (jc) return Hr;
+  jc = 1, Object.defineProperty(Hr, "__esModule", { value: !0 });
   const e = Ge();
   function t(a) {
     if (a.key[0] !== e.InputTypes.POR_COMMITMENT)
@@ -3766,10 +3794,10 @@ function Fg() {
   }
   return Hr.canAdd = o, Hr;
 }
-var $r = {}, jc;
+var $r = {}, Rc;
 function Kg() {
-  if (jc) return $r;
-  jc = 1, Object.defineProperty($r, "__esModule", { value: !0 });
+  if (Rc) return $r;
+  Rc = 1, Object.defineProperty($r, "__esModule", { value: !0 });
   const e = Ge();
   function t(a) {
     if (a.key[0] !== e.InputTypes.SIGHASH_TYPE)
@@ -4139,22 +4167,22 @@ function ed() {
         path: "m"
       };
       for (const v of e(c.value.length / 4 - 1)) {
-        const k = c.value.readUInt32LE(v * 4 + 4), y = !!(k & 2147483648), m = k & 2147483647;
+        const E = c.value.readUInt32LE(v * 4 + 4), y = !!(E & 2147483648), m = E & 2147483647;
         g.path += "/" + m.toString(10) + (y ? "'" : "");
       }
       return g;
     }
     function s(c) {
-      const w = J.from([n]), g = J.concat([w, c.pubkey]), v = c.path.split("/"), k = J.allocUnsafe(v.length * 4);
-      c.masterFingerprint.copy(k, 0);
+      const w = J.from([n]), g = J.concat([w, c.pubkey]), v = c.path.split("/"), E = J.allocUnsafe(v.length * 4);
+      c.masterFingerprint.copy(E, 0);
       let y = 4;
       return v.slice(1).forEach((m) => {
         const A = m.slice(-1) === "'";
-        let E = 2147483647 & parseInt(A ? m.slice(0, -1) : m, 10);
-        A && (E += 2147483648), k.writeUInt32LE(E, y), y += 4;
+        let k = 2147483647 & parseInt(A ? m.slice(0, -1) : m, 10);
+        A && (k += 2147483648), E.writeUInt32LE(k, y), y += 4;
       }), {
         key: g,
-        value: k
+        value: E
       };
     }
     const i = "{ masterFingerprint: Buffer; pubkey: Buffer; path: string; }";
@@ -4163,7 +4191,7 @@ function ed() {
     }
     function l(c, w, g) {
       const v = w.pubkey.toString("hex");
-      return g.has(v) ? !1 : (g.add(v), c.filter((k) => k.pubkey.equals(w.pubkey)).length === 0);
+      return g.has(v) ? !1 : (g.add(v), c.filter((E) => E.pubkey.equals(w.pubkey)).length === 0);
     }
     return {
       decode: a,
@@ -4238,16 +4266,16 @@ function Jg() {
       const w = e.decode(c.value), g = e.encodingLength(w), v = a.decode({
         key: c.key,
         value: c.value.slice(g + w * 32)
-      }), k = new Array(w);
+      }), E = new Array(w);
       for (let y = 0, m = g; y < w; y++, m += 32)
-        k[y] = c.value.slice(m, m + 32);
-      return Object.assign({}, v, { leafHashes: k });
+        E[y] = c.value.slice(m, m + 32);
+      return Object.assign({}, v, { leafHashes: E });
     }
     function i(c) {
       const w = a.encode(c), g = e.encodingLength(c.leafHashes.length), v = J.allocUnsafe(g);
       e.encode(c.leafHashes.length, v);
-      const k = J.concat([v, ...c.leafHashes, w.value]);
-      return Object.assign({}, w, { value: k });
+      const E = J.concat([v, ...c.leafHashes, w.value]);
+      return Object.assign({}, w, { value: E });
     }
     const h = "{ masterFingerprint: Buffer; pubkey: Buffer; path: string; leafHashes: Buffer[]; }";
     function l(c) {
@@ -4340,14 +4368,14 @@ var Vc;
 function bs() {
   if (Vc) return Bt;
   Vc = 1, Object.defineProperty(Bt, "__esModule", { value: !0 });
-  const e = Ge(), t = Ng(), r = Cg(), n = Lg(), o = qg(), a = Mg(), s = Dg(), i = Fg(), h = Kg(), l = Hg(), c = $g(), w = Gg(), g = Wg(), v = Vg(), k = Zg(), y = ed(), m = Yg(), A = Xg(), E = Jg(), x = Qg(), z = eb(), F = {
+  const e = Ge(), t = Ng(), r = Cg(), n = Lg(), o = qg(), a = Mg(), s = Dg(), i = Fg(), h = Kg(), l = Hg(), c = $g(), w = Gg(), g = Wg(), v = Vg(), E = Zg(), y = ed(), m = Yg(), A = Xg(), k = Jg(), x = Qg(), z = eb(), F = {
     unsignedTx: r,
     globalXpub: t,
     // pass an Array of key bytes that require pubkey beside the key
     checkPubkey: m.makeChecker([])
   };
   Bt.globals = F;
-  const j = {
+  const R = {
     nonWitnessUtxo: a,
     partialSig: s,
     sighashType: h,
@@ -4371,7 +4399,7 @@ function bs() {
     tapKeySig: l,
     tapScriptSig: g,
     tapLeafScript: c,
-    tapBip32Derivation: E.makeConverter(
+    tapBip32Derivation: k.makeConverter(
       e.InputTypes.TAP_BIP32_DERIVATION
     ),
     tapInternalKey: x.makeConverter(
@@ -4379,7 +4407,7 @@ function bs() {
     ),
     tapMerkleRoot: w
   };
-  Bt.inputs = j;
+  Bt.inputs = R;
   const I = {
     bip32Derivation: y.makeConverter(
       e.OutputTypes.BIP32_DERIVATION
@@ -4393,10 +4421,10 @@ function bs() {
     checkPubkey: m.makeChecker([
       e.OutputTypes.BIP32_DERIVATION
     ]),
-    tapBip32Derivation: E.makeConverter(
+    tapBip32Derivation: k.makeConverter(
       e.OutputTypes.TAP_BIP32_DERIVATION
     ),
-    tapTree: k,
+    tapTree: E,
     tapInternalKey: x.makeConverter(
       e.OutputTypes.TAP_INTERNAL_KEY
     )
@@ -4431,7 +4459,7 @@ function rb() {
         value: N
       };
     }
-    function k() {
+    function E() {
       if (l >= i.length)
         throw new Error("Format Error: Unexpected End of PSBT");
       const I = i.readUInt8(l) === 0;
@@ -4444,7 +4472,7 @@ function rb() {
         "Format Error: Magic Number must be followed by 0xff separator"
       );
     const y = [], m = {};
-    for (; !k(); ) {
+    for (; !E(); ) {
       const I = v(), N = I.key.toString("hex");
       if (m[N])
         throw new Error(
@@ -4457,35 +4485,35 @@ function rb() {
     );
     if (A.length !== 1)
       throw new Error("Format Error: Only one UNSIGNED_TX allowed");
-    const E = h(A[0].value), { inputCount: x, outputCount: z } = E.getInputOutputCounts(), F = [], j = [];
+    const k = h(A[0].value), { inputCount: x, outputCount: z } = k.getInputOutputCounts(), F = [], R = [];
     for (const I of t.range(x)) {
       const N = {}, O = [];
-      for (; !k(); ) {
-        const R = v(), U = R.key.toString("hex");
+      for (; !E(); ) {
+        const j = v(), U = j.key.toString("hex");
         if (N[U])
           throw new Error(
             "Format Error: Keys must be unique for each input: input index " + I + " key " + U
           );
-        N[U] = 1, O.push(R);
+        N[U] = 1, O.push(j);
       }
       F.push(O);
     }
     for (const I of t.range(z)) {
       const N = {}, O = [];
-      for (; !k(); ) {
-        const R = v(), U = R.key.toString("hex");
+      for (; !E(); ) {
+        const j = v(), U = j.key.toString("hex");
         if (N[U])
           throw new Error(
             "Format Error: Keys must be unique for each output: output index " + I + " key " + U
           );
-        N[U] = 1, O.push(R);
+        N[U] = 1, O.push(j);
       }
-      j.push(O);
+      R.push(O);
     }
-    return s(E, {
+    return s(k, {
       globalMapKeyVals: y,
       inputKeyVals: F,
-      outputKeyVals: j
+      outputKeyVals: R
     });
   }
   It.psbtFromBuffer = o;
@@ -4518,9 +4546,9 @@ function rb() {
         default:
           w.unknownKeyVals || (w.unknownKeyVals = []), w.unknownKeyVals.push(A);
       }
-    const v = l.length, k = c.length, y = [], m = [];
+    const v = l.length, E = c.length, y = [], m = [];
     for (const A of t.range(v)) {
-      const E = {};
+      const k = {};
       for (const x of l[A])
         switch (e.inputs.checkPubkey(x), x.key[0]) {
           case n.InputTypes.NON_WITNESS_UTXO:
@@ -4528,53 +4556,53 @@ function rb() {
               "input",
               x.key,
               n.InputTypes.NON_WITNESS_UTXO
-            ), E.nonWitnessUtxo !== void 0)
+            ), k.nonWitnessUtxo !== void 0)
               throw new Error(
                 "Format Error: Input has multiple NON_WITNESS_UTXO"
               );
-            E.nonWitnessUtxo = e.inputs.nonWitnessUtxo.decode(x);
+            k.nonWitnessUtxo = e.inputs.nonWitnessUtxo.decode(x);
             break;
           case n.InputTypes.WITNESS_UTXO:
             if (a(
               "input",
               x.key,
               n.InputTypes.WITNESS_UTXO
-            ), E.witnessUtxo !== void 0)
+            ), k.witnessUtxo !== void 0)
               throw new Error("Format Error: Input has multiple WITNESS_UTXO");
-            E.witnessUtxo = e.inputs.witnessUtxo.decode(x);
+            k.witnessUtxo = e.inputs.witnessUtxo.decode(x);
             break;
           case n.InputTypes.PARTIAL_SIG:
-            E.partialSig === void 0 && (E.partialSig = []), E.partialSig.push(e.inputs.partialSig.decode(x));
+            k.partialSig === void 0 && (k.partialSig = []), k.partialSig.push(e.inputs.partialSig.decode(x));
             break;
           case n.InputTypes.SIGHASH_TYPE:
             if (a(
               "input",
               x.key,
               n.InputTypes.SIGHASH_TYPE
-            ), E.sighashType !== void 0)
+            ), k.sighashType !== void 0)
               throw new Error("Format Error: Input has multiple SIGHASH_TYPE");
-            E.sighashType = e.inputs.sighashType.decode(x);
+            k.sighashType = e.inputs.sighashType.decode(x);
             break;
           case n.InputTypes.REDEEM_SCRIPT:
             if (a(
               "input",
               x.key,
               n.InputTypes.REDEEM_SCRIPT
-            ), E.redeemScript !== void 0)
+            ), k.redeemScript !== void 0)
               throw new Error("Format Error: Input has multiple REDEEM_SCRIPT");
-            E.redeemScript = e.inputs.redeemScript.decode(x);
+            k.redeemScript = e.inputs.redeemScript.decode(x);
             break;
           case n.InputTypes.WITNESS_SCRIPT:
             if (a(
               "input",
               x.key,
               n.InputTypes.WITNESS_SCRIPT
-            ), E.witnessScript !== void 0)
+            ), k.witnessScript !== void 0)
               throw new Error("Format Error: Input has multiple WITNESS_SCRIPT");
-            E.witnessScript = e.inputs.witnessScript.decode(x);
+            k.witnessScript = e.inputs.witnessScript.decode(x);
             break;
           case n.InputTypes.BIP32_DERIVATION:
-            E.bip32Derivation === void 0 && (E.bip32Derivation = []), E.bip32Derivation.push(
+            k.bip32Derivation === void 0 && (k.bip32Derivation = []), k.bip32Derivation.push(
               e.inputs.bip32Derivation.decode(x)
             );
             break;
@@ -4583,14 +4611,14 @@ function rb() {
               "input",
               x.key,
               n.InputTypes.FINAL_SCRIPTSIG
-            ), E.finalScriptSig = e.inputs.finalScriptSig.decode(x);
+            ), k.finalScriptSig = e.inputs.finalScriptSig.decode(x);
             break;
           case n.InputTypes.FINAL_SCRIPTWITNESS:
             a(
               "input",
               x.key,
               n.InputTypes.FINAL_SCRIPTWITNESS
-            ), E.finalScriptWitness = e.inputs.finalScriptWitness.decode(
+            ), k.finalScriptWitness = e.inputs.finalScriptWitness.decode(
               x
             );
             break;
@@ -4599,23 +4627,23 @@ function rb() {
               "input",
               x.key,
               n.InputTypes.POR_COMMITMENT
-            ), E.porCommitment = e.inputs.porCommitment.decode(x);
+            ), k.porCommitment = e.inputs.porCommitment.decode(x);
             break;
           case n.InputTypes.TAP_KEY_SIG:
             a(
               "input",
               x.key,
               n.InputTypes.TAP_KEY_SIG
-            ), E.tapKeySig = e.inputs.tapKeySig.decode(x);
+            ), k.tapKeySig = e.inputs.tapKeySig.decode(x);
             break;
           case n.InputTypes.TAP_SCRIPT_SIG:
-            E.tapScriptSig === void 0 && (E.tapScriptSig = []), E.tapScriptSig.push(e.inputs.tapScriptSig.decode(x));
+            k.tapScriptSig === void 0 && (k.tapScriptSig = []), k.tapScriptSig.push(e.inputs.tapScriptSig.decode(x));
             break;
           case n.InputTypes.TAP_LEAF_SCRIPT:
-            E.tapLeafScript === void 0 && (E.tapLeafScript = []), E.tapLeafScript.push(e.inputs.tapLeafScript.decode(x));
+            k.tapLeafScript === void 0 && (k.tapLeafScript = []), k.tapLeafScript.push(e.inputs.tapLeafScript.decode(x));
             break;
           case n.InputTypes.TAP_BIP32_DERIVATION:
-            E.tapBip32Derivation === void 0 && (E.tapBip32Derivation = []), E.tapBip32Derivation.push(
+            k.tapBip32Derivation === void 0 && (k.tapBip32Derivation = []), k.tapBip32Derivation.push(
               e.inputs.tapBip32Derivation.decode(x)
             );
             break;
@@ -4624,22 +4652,22 @@ function rb() {
               "input",
               x.key,
               n.InputTypes.TAP_INTERNAL_KEY
-            ), E.tapInternalKey = e.inputs.tapInternalKey.decode(x);
+            ), k.tapInternalKey = e.inputs.tapInternalKey.decode(x);
             break;
           case n.InputTypes.TAP_MERKLE_ROOT:
             a(
               "input",
               x.key,
               n.InputTypes.TAP_MERKLE_ROOT
-            ), E.tapMerkleRoot = e.inputs.tapMerkleRoot.decode(x);
+            ), k.tapMerkleRoot = e.inputs.tapMerkleRoot.decode(x);
             break;
           default:
-            E.unknownKeyVals || (E.unknownKeyVals = []), E.unknownKeyVals.push(x);
+            k.unknownKeyVals || (k.unknownKeyVals = []), k.unknownKeyVals.push(x);
         }
-      y.push(E);
+      y.push(k);
     }
-    for (const A of t.range(k)) {
-      const E = {};
+    for (const A of t.range(E)) {
+      const k = {};
       for (const x of c[A])
         switch (e.outputs.checkPubkey(x), x.key[0]) {
           case n.OutputTypes.REDEEM_SCRIPT:
@@ -4647,21 +4675,21 @@ function rb() {
               "output",
               x.key,
               n.OutputTypes.REDEEM_SCRIPT
-            ), E.redeemScript !== void 0)
+            ), k.redeemScript !== void 0)
               throw new Error("Format Error: Output has multiple REDEEM_SCRIPT");
-            E.redeemScript = e.outputs.redeemScript.decode(x);
+            k.redeemScript = e.outputs.redeemScript.decode(x);
             break;
           case n.OutputTypes.WITNESS_SCRIPT:
             if (a(
               "output",
               x.key,
               n.OutputTypes.WITNESS_SCRIPT
-            ), E.witnessScript !== void 0)
+            ), k.witnessScript !== void 0)
               throw new Error("Format Error: Output has multiple WITNESS_SCRIPT");
-            E.witnessScript = e.outputs.witnessScript.decode(x);
+            k.witnessScript = e.outputs.witnessScript.decode(x);
             break;
           case n.OutputTypes.BIP32_DERIVATION:
-            E.bip32Derivation === void 0 && (E.bip32Derivation = []), E.bip32Derivation.push(
+            k.bip32Derivation === void 0 && (k.bip32Derivation = []), k.bip32Derivation.push(
               e.outputs.bip32Derivation.decode(x)
             );
             break;
@@ -4670,24 +4698,24 @@ function rb() {
               "output",
               x.key,
               n.OutputTypes.TAP_INTERNAL_KEY
-            ), E.tapInternalKey = e.outputs.tapInternalKey.decode(x);
+            ), k.tapInternalKey = e.outputs.tapInternalKey.decode(x);
             break;
           case n.OutputTypes.TAP_TREE:
             a(
               "output",
               x.key,
               n.OutputTypes.TAP_TREE
-            ), E.tapTree = e.outputs.tapTree.decode(x);
+            ), k.tapTree = e.outputs.tapTree.decode(x);
             break;
           case n.OutputTypes.TAP_BIP32_DERIVATION:
-            E.tapBip32Derivation === void 0 && (E.tapBip32Derivation = []), E.tapBip32Derivation.push(
+            k.tapBip32Derivation === void 0 && (k.tapBip32Derivation = []), k.tapBip32Derivation.push(
               e.outputs.tapBip32Derivation.decode(x)
             );
             break;
           default:
-            E.unknownKeyVals || (E.unknownKeyVals = []), E.unknownKeyVals.push(x);
+            k.unknownKeyVals || (k.unknownKeyVals = []), k.unknownKeyVals.push(x);
         }
-      m.push(E);
+      m.push(k);
     }
     return { globalMap: w, inputs: y, outputs: m };
   }
@@ -4703,9 +4731,9 @@ function tb() {
       globalMap: s,
       inputs: i,
       outputs: h
-    }), g = t.keyValsToBuffer(l), v = (A) => A.length === 0 ? [J.from([0])] : A.map(t.keyValsToBuffer), k = v(c), y = v(w), m = J.allocUnsafe(5);
+    }), g = t.keyValsToBuffer(l), v = (A) => A.length === 0 ? [J.from([0])] : A.map(t.keyValsToBuffer), E = v(c), y = v(w), m = J.allocUnsafe(5);
     return m.writeUIntBE(482972169471, 0, 5), J.concat(
-      [m, g].concat(k, y)
+      [m, g].concat(E, y)
     );
   }
   Xt.psbtToBuffer = r;
@@ -4713,10 +4741,10 @@ function tb() {
   function o(s, i) {
     const h = /* @__PURE__ */ new Set(), l = Object.entries(s).reduce((w, [g, v]) => {
       if (g === "unknownKeyVals") return w;
-      const k = i[g];
-      if (k === void 0) return w;
+      const E = i[g];
+      if (E === void 0) return w;
       const y = (Array.isArray(v) ? v : [v]).map(
-        k.encode
+        E.encode
       );
       return y.map((A) => A.key.toString("hex")).forEach((A) => {
         if (h.has(A))
@@ -4757,8 +4785,8 @@ function nb() {
       throw new Error("Combine: Self missing transaction");
     const c = o(i.globalKeyVals), w = i.inputKeyVals.map(o), g = i.outputKeyVals.map(o);
     for (const v of h) {
-      const k = n(v);
-      if (k === void 0 || !k.toBuffer().equals(l.toBuffer()))
+      const E = n(v);
+      if (E === void 0 || !E.toBuffer().equals(l.toBuffer()))
         throw new Error(
           "Combine: One of the Psbts does not have the same transaction."
         );
@@ -4820,39 +4848,39 @@ function td() {
   return Qc || (Qc = 1, (function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 });
     const t = bs();
-    function r(v, k) {
-      const y = v[k];
-      if (y === void 0) throw new Error(`No input #${k}`);
+    function r(v, E) {
+      const y = v[E];
+      if (y === void 0) throw new Error(`No input #${E}`);
       return y;
     }
     e.checkForInput = r;
-    function n(v, k) {
-      const y = v[k];
-      if (y === void 0) throw new Error(`No output #${k}`);
+    function n(v, E) {
+      const y = v[E];
+      if (y === void 0) throw new Error(`No output #${E}`);
       return y;
     }
     e.checkForOutput = n;
-    function o(v, k, y) {
+    function o(v, E, y) {
       if (v.key[0] < y)
         throw new Error(
           "Use the method for your specific key instead of addUnknownKeyVal*"
         );
-      if (k && k.filter((m) => m.key.equals(v.key)).length !== 0)
+      if (E && E.filter((m) => m.key.equals(v.key)).length !== 0)
         throw new Error(`Duplicate Key: ${v.key.toString("hex")}`);
     }
     e.checkHasKey = o;
     function a(v) {
-      let k = 0;
+      let E = 0;
       return Object.keys(v).forEach((y) => {
-        Number(isNaN(Number(y))) && k++;
-      }), k;
+        Number(isNaN(Number(y))) && E++;
+      }), E;
     }
     e.getEnumLength = a;
-    function s(v, k) {
+    function s(v, E) {
       let y = !1;
-      if (k.nonWitnessUtxo || k.witnessUtxo) {
-        const m = !!k.redeemScript, A = !!k.witnessScript, E = !m || !!k.finalScriptSig, x = !A || !!k.finalScriptWitness, z = !!k.finalScriptSig || !!k.finalScriptWitness;
-        y = E && x && z;
+      if (E.nonWitnessUtxo || E.witnessUtxo) {
+        const m = !!E.redeemScript, A = !!E.witnessScript, k = !m || !!E.finalScriptSig, x = !A || !!E.finalScriptWitness, z = !!E.finalScriptSig || !!E.finalScriptWitness;
+        y = k && x && z;
       }
       if (y === !1)
         throw new Error(
@@ -4860,20 +4888,20 @@ function td() {
         );
     }
     e.inputCheckUncleanFinalized = s;
-    function i(v, k, y, m) {
+    function i(v, E, y, m) {
       throw new Error(
-        `Data for ${v} key ${k} is incorrect: Expected ${y} and got ${JSON.stringify(m)}`
+        `Data for ${v} key ${E} is incorrect: Expected ${y} and got ${JSON.stringify(m)}`
       );
     }
     function h(v) {
-      return (k, y) => {
-        for (const m of Object.keys(k)) {
-          const A = k[m], { canAdd: E, canAddToArray: x, check: z, expected: F } = (
+      return (E, y) => {
+        for (const m of Object.keys(E)) {
+          const A = E[m], { canAdd: k, canAddToArray: x, check: z, expected: F } = (
             // @ts-ignore
             t[v + "s"][m] || {}
-          ), j = !!x;
+          ), R = !!x;
           if (z)
-            if (j) {
+            if (R) {
               if (!Array.isArray(A) || // @ts-ignore
               y[m] && !Array.isArray(y[m]))
                 throw new Error(`Key type ${m} must be an array`);
@@ -4883,7 +4911,7 @@ function td() {
                 throw new Error("Can not add duplicate data to array");
               y[m] = I.concat(A);
             } else {
-              if (z(A) || i(v, m, F, A), !E(y, A))
+              if (z(A) || i(v, m, F, A), !k(y, A))
                 throw new Error(`Can not add duplicate data to ${v}`);
               y[m] = A;
             }
@@ -4891,26 +4919,26 @@ function td() {
       };
     }
     e.updateGlobal = h("global"), e.updateInput = h("input"), e.updateOutput = h("output");
-    function l(v, k) {
+    function l(v, E) {
       const y = v.length - 1, m = r(v, y);
-      e.updateInput(k, m);
+      e.updateInput(E, m);
     }
     e.addInputAttributes = l;
-    function c(v, k) {
+    function c(v, E) {
       const y = v.length - 1, m = n(v, y);
-      e.updateOutput(k, m);
+      e.updateOutput(E, m);
     }
     e.addOutputAttributes = c;
-    function w(v, k) {
-      if (!J.isBuffer(k) || k.length < 4)
+    function w(v, E) {
+      if (!J.isBuffer(E) || E.length < 4)
         throw new Error("Set Version: Invalid Transaction");
-      return k.writeUInt32LE(v, 0), k;
+      return E.writeUInt32LE(v, 0), E;
     }
     e.defaultVersionSetter = w;
-    function g(v, k) {
-      if (!J.isBuffer(k) || k.length < 4)
+    function g(v, E) {
+      if (!J.isBuffer(E) || E.length < 4)
         throw new Error("Set Locktime: Invalid Transaction");
-      return k.writeUInt32LE(v, k.length - 4), k;
+      return E.writeUInt32LE(v, E.length - 4), E;
     }
     e.defaultLocktimeSetter = g;
   })(ro)), ro;
@@ -5046,7 +5074,7 @@ function ob() {
     }), te.default = M, Object.freeze(te);
   }
   var o = /* @__PURE__ */ n(t), a = /* @__PURE__ */ n(r);
-  const s = e.secp256k1.ProjectivePoint, i = "Expected Private", h = "Expected Point", l = "Expected Tweak", c = "Expected Hash", w = "Expected Signature", g = "Expected Extra Data (32 bytes)", v = "Expected Scalar", k = "Bad Recovery Id", y = 32, m = 32, A = new Uint8Array([
+  const s = e.secp256k1.ProjectivePoint, i = "Expected Private", h = "Expected Point", l = "Expected Tweak", c = "Expected Hash", w = "Expected Signature", g = "Expected Extra Data (32 bytes)", v = "Expected Scalar", E = "Bad Recovery Id", y = 32, m = 32, A = new Uint8Array([
     255,
     255,
     255,
@@ -5079,7 +5107,7 @@ function ob() {
     54,
     65,
     65
-  ]), E = 32, x = new Uint8Array(32), z = new Uint8Array([
+  ]), k = 32, x = new Uint8Array(32), z = new Uint8Array([
     0,
     0,
     0,
@@ -5113,7 +5141,7 @@ function ob() {
     186,
     238
   ]), F = BigInt(1);
-  function j(M) {
+  function R(M) {
     return M instanceof Uint8Array;
   }
   function I(M, te) {
@@ -5128,11 +5156,11 @@ function ob() {
   function O(M) {
     return !(!(M instanceof Uint8Array) || M.length !== m || I(M, A) >= 0);
   }
-  function R(M) {
+  function j(M) {
     return M instanceof Uint8Array && M.length === 64 && I(M.subarray(0, 32), A) < 0 && I(M.subarray(32, 64), A) < 0;
   }
   function U(M) {
-    return j(M) && M.length === 64 && I(M.subarray(0, 32), z) < 0;
+    return R(M) && M.length === 64 && I(M.subarray(0, 32), z) < 0;
   }
   function T(M) {
     return !(N(M.subarray(0, 32)) || N(M.subarray(32, 64)));
@@ -5141,7 +5169,7 @@ function ob() {
     return M instanceof Uint8Array && M.length === y;
   }
   function re(M) {
-    return M === void 0 || M instanceof Uint8Array && M.length === E;
+    return M === void 0 || M instanceof Uint8Array && M.length === k;
   }
   function oe(M) {
     let te;
@@ -5287,7 +5315,7 @@ function ob() {
       throw new Error(l);
     return H(() => ie(M, te));
   }
-  function Re(M, te) {
+  function je(M, te) {
     if (!ee(M))
       throw new Error(i);
     if (!O(te))
@@ -5333,10 +5361,10 @@ function ob() {
   function Be(M, te, b, u) {
     if (!Z(M))
       throw new Error(c);
-    if (!R(te) || !T(te))
+    if (!j(te) || !T(te))
       throw new Error(w);
     if (b & 2 && !U(te))
-      throw new Error(k);
+      throw new Error(E);
     if (!ne(te.subarray(0, 32)))
       throw new Error(w);
     const S = e.secp256k1.Signature.fromCompact(te).addRecoveryBit(b).recoverPublicKey(M);
@@ -5346,7 +5374,7 @@ function ob() {
   function Ye(M, te, b, u) {
     if (!X(te))
       throw new Error(h);
-    if (!R(b))
+    if (!j(b))
       throw new Error(w);
     if (!Z(M))
       throw new Error(v);
@@ -5355,16 +5383,16 @@ function ob() {
   function fr(M, te, b) {
     if (!ne(te))
       throw new Error(h);
-    if (!R(b))
+    if (!j(b))
       throw new Error(w);
     if (!Z(M))
       throw new Error(v);
     return e.schnorr.verify(b, M, te);
   }
-  return Le.isPoint = X, Le.isPointCompressed = Q, Le.isPrivate = ee, Le.isXOnlyPoint = ne, Le.pointAdd = we, Le.pointAddScalar = Oe, Le.pointCompress = ye, Le.pointFromScalar = le, Le.pointMultiply = pe, Le.privateAdd = $, Le.privateNegate = ae, Le.privateSub = Re, Le.recover = Be, Le.sign = fe, Le.signRecoverable = ge, Le.signSchnorr = xe, Le.verify = Ye, Le.verifySchnorr = fr, Le.xOnlyPointAddTweak = se, Le.xOnlyPointFromPoint = ce, Le.xOnlyPointFromScalar = he, Le;
+  return Le.isPoint = X, Le.isPointCompressed = Q, Le.isPrivate = ee, Le.isXOnlyPoint = ne, Le.pointAdd = we, Le.pointAddScalar = Oe, Le.pointCompress = ye, Le.pointFromScalar = le, Le.pointMultiply = pe, Le.privateAdd = $, Le.privateNegate = ae, Le.privateSub = je, Le.recover = Be, Le.sign = fe, Le.signRecoverable = ge, Le.signSchnorr = xe, Le.verify = Ye, Le.verifySchnorr = fr, Le.xOnlyPointAddTweak = se, Le.xOnlyPointFromPoint = ce, Le.xOnlyPointFromScalar = he, Le;
 }
 var nd = ob();
-const ib = /* @__PURE__ */ Ea(nd), bv = /* @__PURE__ */ bh({
+const ib = /* @__PURE__ */ Ia(nd), bv = /* @__PURE__ */ bh({
   __proto__: null,
   default: ib
 }, [nd]);
@@ -5567,7 +5595,7 @@ function Ob(e, t, r) {
     return e[t] <= 127 ? n : n - 4294967296;
   }
 }
-function Rb(e, t, r) {
+function jb(e, t, r) {
   if (t + 8 > e.length)
     throw new Error("Offset is outside the bounds of Uint8Array");
   r = r.toUpperCase();
@@ -5579,7 +5607,7 @@ function Rb(e, t, r) {
     return o = (o << 8n) + BigInt(e[t]), o = (o << 8n) + BigInt(e[t + 1]), o = (o << 8n) + BigInt(e[t + 2]), o = (o << 8n) + BigInt(e[t + 3]), o = (o << 8n) + BigInt(e[t + 4]), o = (o << 8n) + BigInt(e[t + 5]), o = (o << 8n) + BigInt(e[t + 6]), o = (o << 8n) + BigInt(e[t + 7]), e[t] <= 127 ? o : o - 0x10000000000000000n;
   }
 }
-const jb = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Rb = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   compare: bb,
   concat: ub,
@@ -5588,7 +5616,7 @@ const jb = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   fromUtf8: cb,
   readInt16: zb,
   readInt32: Ob,
-  readInt64: Rb,
+  readInt64: jb,
   readInt8: Tb,
   readUInt16: kb,
   readUInt32: Eb,
@@ -5605,7 +5633,7 @@ const jb = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   writeUInt32: vb,
   writeUInt64: wb,
   writeUInt8: mb
-}, Symbol.toStringTag, { value: "Module" })), ms = /* @__PURE__ */ En(jb);
+}, Symbol.toStringTag, { value: "Module" })), ms = /* @__PURE__ */ Bn(Rb);
 var nu;
 function Pb() {
   if (nu) return br;
@@ -5766,11 +5794,11 @@ function Ci(e, t, r) {
         throw new Error("convertRadix: carry overflow");
       const v = g / r;
       i = g % r;
-      const k = Math.floor(v);
-      if (a[l] = k, !Number.isSafeInteger(k) || k * r + i !== g)
+      const E = Math.floor(v);
+      if (a[l] = E, !Number.isSafeInteger(E) || E * r + i !== g)
         throw new Error("convertRadix: carry overflow");
       if (h)
-        k ? h = !1 : n = l;
+        E ? h = !1 : n = l;
       else continue;
     }
     if (o.push(i), h)
@@ -5949,10 +5977,10 @@ function wd(e) {
   const t = e === "bech32" ? 1 : 734539939, r = /* @__PURE__ */ or(5), n = r.decode, o = r.encode, a = au(n);
   function s(w, g, v = 90) {
     st("bech32.encode prefix", w), _t(g) && (g = Array.from(g)), ws("bech32.encode", g);
-    const k = w.length;
-    if (k === 0)
-      throw new TypeError(`Invalid prefix length ${k}`);
-    const y = k + 7 + g.length;
+    const E = w.length;
+    if (E === 0)
+      throw new TypeError(`Invalid prefix length ${E}`);
+    const y = E + 7 + g.length;
     if (v !== !1 && y > v)
       throw new TypeError(`Length ${y} exceeds limit ${v}`);
     const m = w.toLowerCase(), A = su(m, g, t);
@@ -5963,19 +5991,19 @@ function wd(e) {
     const v = w.length;
     if (v < 8 || g !== !1 && v > g)
       throw new TypeError(`invalid string length: ${v} (${w}). Expected (8..${g})`);
-    const k = w.toLowerCase();
-    if (w !== k && w !== w.toUpperCase())
+    const E = w.toLowerCase();
+    if (w !== E && w !== w.toUpperCase())
       throw new Error("String must be lowercase or uppercase");
-    const y = k.lastIndexOf("1");
+    const y = E.lastIndexOf("1");
     if (y === 0 || y === -1)
       throw new Error('Letter "1" must be present between prefix and data only');
-    const m = k.slice(0, y), A = k.slice(y + 1);
+    const m = E.slice(0, y), A = E.slice(y + 1);
     if (A.length < 6)
       throw new Error("Data must be at least 6 characters long");
-    const E = Li.decode(A).slice(0, -6), x = su(m, E, t);
+    const k = Li.decode(A).slice(0, -6), x = su(m, k, t);
     if (!A.endsWith(x))
       throw new Error(`Invalid checksum in ${w}: expected "${x}"`);
-    return { prefix: m, words: E };
+    return { prefix: m, words: k };
   }
   const h = au(i);
   function l(w) {
@@ -6058,7 +6086,7 @@ const $b = /* @__PURE__ */ wd("bech32"), Gb = /* @__PURE__ */ wd("bech32m"), _d
   stringToBytes: Ad,
   utf8: _d,
   utils: Ub
-}, Symbol.toStringTag, { value: "Module" })), Sd = /* @__PURE__ */ En(Xb);
+}, Symbol.toStringTag, { value: "Module" })), Sd = /* @__PURE__ */ Bn(Xb);
 var Tr = {}, cu;
 function Id() {
   return cu || (cu = 1, (function(e) {
@@ -6109,7 +6137,7 @@ function Id() {
     }), e.Bip32PathSchema = o.pipe(o.string(), o.regex(/^(m\/)?(\d+'?\/)*\d+'?$/));
   })(Tr)), Tr;
 }
-var er = {}, Ot = {}, Rt = {}, jt = {}, Wn = {}, uu;
+var er = {}, Ot = {}, jt = {}, Rt = {}, Wn = {}, uu;
 function Jb() {
   if (uu) return Wn;
   uu = 1, Object.defineProperty(Wn, "__esModule", { value: !0 });
@@ -6132,11 +6160,11 @@ function Jb() {
       if (c.length === 0)
         return "";
       let w = 0, g = 0, v = 0;
-      const k = c.length;
-      for (; v !== k && c[v] === 0; )
+      const E = c.length;
+      for (; v !== E && c[v] === 0; )
         v++, w++;
-      const y = (k - v) * s + 1 >>> 0, m = new Uint8Array(y);
-      for (; v !== k; ) {
+      const y = (E - v) * s + 1 >>> 0, m = new Uint8Array(y);
+      for (; v !== E; ) {
         let x = c[v], z = 0;
         for (let F = y - 1; (x !== 0 || z < g) && F !== -1; F--, z++)
           x += 256 * m[F] >>> 0, m[F] = x % n >>> 0, x = x / n >>> 0;
@@ -6147,10 +6175,10 @@ function Jb() {
       let A = y - g;
       for (; A !== y && m[A] === 0; )
         A++;
-      let E = o.repeat(w);
+      let k = o.repeat(w);
       for (; A < y; ++A)
-        E += t.charAt(m[A]);
-      return E;
+        k += t.charAt(m[A]);
+      return k;
     }
     function h(c) {
       if (typeof c != "string")
@@ -6160,7 +6188,7 @@ function Jb() {
       let w = 0, g = 0, v = 0;
       for (; c[w] === o; )
         g++, w++;
-      const k = (c.length - w) * a + 1 >>> 0, y = new Uint8Array(k);
+      const E = (c.length - w) * a + 1 >>> 0, y = new Uint8Array(E);
       for (; w < c.length; ) {
         const x = c.charCodeAt(w);
         if (x > 255)
@@ -6169,19 +6197,19 @@ function Jb() {
         if (z === 255)
           return;
         let F = 0;
-        for (let j = k - 1; (z !== 0 || F < v) && j !== -1; j--, F++)
-          z += n * y[j] >>> 0, y[j] = z % 256 >>> 0, z = z / 256 >>> 0;
+        for (let R = E - 1; (z !== 0 || F < v) && R !== -1; R--, F++)
+          z += n * y[R] >>> 0, y[R] = z % 256 >>> 0, z = z / 256 >>> 0;
         if (z !== 0)
           throw new Error("Non-zero carry");
         v = F, w++;
       }
-      let m = k - v;
-      for (; m !== k && y[m] === 0; )
+      let m = E - v;
+      for (; m !== E && y[m] === 0; )
         m++;
-      const A = new Uint8Array(g + (k - m));
-      let E = g;
-      for (; m !== k; )
-        A[E++] = y[m++];
+      const A = new Uint8Array(g + (E - m));
+      let k = g;
+      for (; m !== E; )
+        A[k++] = y[m++];
       return A;
     }
     function l(c) {
@@ -6200,23 +6228,23 @@ function Jb() {
 }
 var lu;
 function Qb() {
-  if (lu) return jt;
+  if (lu) return Rt;
   lu = 1;
-  var e = jt && jt.__importDefault || function(n) {
+  var e = Rt && Rt.__importDefault || function(n) {
     return n && n.__esModule ? n : { default: n };
   };
-  Object.defineProperty(jt, "__esModule", { value: !0 });
+  Object.defineProperty(Rt, "__esModule", { value: !0 });
   var t = e(Jb()), r = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
-  return jt.default = (0, t.default)(r), jt;
+  return Rt.default = (0, t.default)(r), Rt;
 }
 var fu;
 function em() {
-  if (fu) return Rt;
+  if (fu) return jt;
   fu = 1;
-  var e = Rt && Rt.__importDefault || function(n) {
+  var e = jt && jt.__importDefault || function(n) {
     return n && n.__esModule ? n : { default: n };
   };
-  Object.defineProperty(Rt, "__esModule", { value: !0 }), Rt.default = r;
+  Object.defineProperty(jt, "__esModule", { value: !0 }), jt.default = r;
   var t = e(Qb());
   function r(n) {
     function o(h) {
@@ -6245,7 +6273,7 @@ function em() {
       decodeUnsafe: s
     };
   }
-  return Rt;
+  return jt;
 }
 var du;
 function rm() {
@@ -6347,14 +6375,14 @@ var gu;
 function nm() {
   if (gu) return gr;
   gu = 1;
-  var e = gr && gr.__createBinding || (Object.create ? (function(y, m, A, E) {
-    E === void 0 && (E = A);
+  var e = gr && gr.__createBinding || (Object.create ? (function(y, m, A, k) {
+    k === void 0 && (k = A);
     var x = Object.getOwnPropertyDescriptor(m, A);
     (!x || ("get" in x ? !m.__esModule : x.writable || x.configurable)) && (x = { enumerable: !0, get: function() {
       return m[A];
-    } }), Object.defineProperty(y, E, x);
-  }) : (function(y, m, A, E) {
-    E === void 0 && (E = A), y[E] = m[A];
+    } }), Object.defineProperty(y, k, x);
+  }) : (function(y, m, A, k) {
+    k === void 0 && (k = A), y[k] = m[A];
   })), t = gr && gr.__setModuleDefault || (Object.create ? (function(y, m) {
     Object.defineProperty(y, "default", { enumerable: !0, value: m });
   }) : function(y, m) {
@@ -6362,30 +6390,30 @@ function nm() {
   }), r = gr && gr.__importStar || /* @__PURE__ */ (function() {
     var y = function(m) {
       return y = Object.getOwnPropertyNames || function(A) {
-        var E = [];
-        for (var x in A) Object.prototype.hasOwnProperty.call(A, x) && (E[E.length] = x);
-        return E;
+        var k = [];
+        for (var x in A) Object.prototype.hasOwnProperty.call(A, x) && (k[k.length] = x);
+        return k;
       }, y(m);
     };
     return function(m) {
       if (m && m.__esModule) return m;
       var A = {};
-      if (m != null) for (var E = y(m), x = 0; x < E.length; x++) E[x] !== "default" && e(A, m, E[x]);
+      if (m != null) for (var k = y(m), x = 0; x < k.length; x++) k[x] !== "default" && e(A, m, k[x]);
       return t(A, m), A;
     };
   })();
-  Object.defineProperty(gr, "__esModule", { value: !0 }), gr.BIP32Factory = k;
+  Object.defineProperty(gr, "__esModule", { value: !0 }), gr.BIP32Factory = E;
   const n = r(ad()), o = Pb(), a = Sd, s = /* @__PURE__ */ kn(), i = r(/* @__PURE__ */ as()), h = Id(), l = r(tm()), c = r(ms), w = Ba(), g = (0, a.base58check)(s.sha256), v = {
     encode: (y) => g.encode(y),
     decode: (y) => g.decode(y)
   };
-  function k(y) {
+  function E(y) {
     (0, o.testEcc)(y);
     const m = 2147483648;
-    function A(R) {
-      return R.length === 32 ? R : R.slice(1, 33);
+    function A(j) {
+      return j.length === 32 ? j : j.slice(1, 33);
     }
-    class E {
+    class k {
       __D;
       __Q;
       lowR = !1;
@@ -6427,7 +6455,7 @@ function nm() {
         return y.verifySchnorr(U, this.publicKey.subarray(1, 33), T);
       }
     }
-    class x extends E {
+    class x extends k {
       chainCode;
       network;
       __DEPTH;
@@ -6498,7 +6526,7 @@ function nm() {
           const de = y.privateAdd(this.privateKey, oe);
           if (de == null)
             return this.derive(U + 1);
-          ie = j(de, ue, this.network, this.depth + 1, U, c.readUInt32(this.fingerprint, 0, "BE"));
+          ie = R(de, ue, this.network, this.depth + 1, U, c.readUInt32(this.fingerprint, 0, "BE"));
         }
         return ie;
       }
@@ -6536,7 +6564,7 @@ function nm() {
           re,
           Z.xOnlyPubkey
         ]);
-        return new E(void 0, oe);
+        return new k(void 0, oe);
       }
       tweakFromPrivateKey(U) {
         const T = this.publicKey[0] === 3 || this.publicKey[0] === 4 && (this.publicKey[64] & 1) === 1, Z = (() => {
@@ -6548,11 +6576,11 @@ function nm() {
         })(), re = y.privateAdd(Z, U);
         if (!re)
           throw new Error("Invalid tweaked private key!");
-        return new E(re, void 0);
+        return new k(re, void 0);
       }
     }
-    function z(R, U) {
-      const T = v.decode(R);
+    function z(j, U) {
+      const T = v.decode(j);
       if (T.length !== 78)
         throw new TypeError("Invalid buffer length");
       U = U || w.BITCOIN;
@@ -6571,36 +6599,36 @@ function nm() {
         if (T[45] !== 0)
           throw new TypeError("Invalid private key");
         const me = T.slice(46, 78);
-        de = j(me, ie, U, re, ue, oe);
+        de = R(me, ie, U, re, ue, oe);
       } else {
         const me = T.slice(45, 78);
         de = N(me, ie, U, re, ue, oe);
       }
       return de;
     }
-    function F(R, U, T) {
-      return j(R, U, T);
+    function F(j, U, T) {
+      return R(j, U, T);
     }
-    function j(R, U, T, Z, re, oe) {
-      if (i.parse(h.Buffer256Bit, R), i.parse(h.Buffer256Bit, U), T = T || w.BITCOIN, !y.isPrivate(R))
+    function R(j, U, T, Z, re, oe) {
+      if (i.parse(h.Buffer256Bit, j), i.parse(h.Buffer256Bit, U), T = T || w.BITCOIN, !y.isPrivate(j))
         throw new TypeError("Private key not in range [1, n)");
-      return new x(R, void 0, U, T, Z, re, oe);
+      return new x(j, void 0, U, T, Z, re, oe);
     }
-    function I(R, U, T) {
-      return N(R, U, T);
+    function I(j, U, T) {
+      return N(j, U, T);
     }
-    function N(R, U, T, Z, re, oe) {
-      if (i.parse(h.Buffer33Bytes, R), i.parse(h.Buffer256Bit, U), T = T || w.BITCOIN, !y.isPoint(R))
+    function N(j, U, T, Z, re, oe) {
+      if (i.parse(h.Buffer33Bytes, j), i.parse(h.Buffer256Bit, U), T = T || w.BITCOIN, !y.isPoint(j))
         throw new TypeError("Point is not on the curve");
-      return new x(void 0, R, U, T, Z, re, oe);
+      return new x(void 0, j, U, T, Z, re, oe);
     }
-    function O(R, U) {
-      if (i.parse(i.instance(Uint8Array), R), R.length < 16)
+    function O(j, U) {
+      if (i.parse(i.instance(Uint8Array), j), j.length < 16)
         throw new TypeError("Seed should be at least 128 bits");
-      if (R.length > 64)
+      if (j.length > 64)
         throw new TypeError("Seed should be at most 512 bits");
       U = U || w.BITCOIN;
-      const T = n.hmacSHA512(c.fromUtf8("Bitcoin seed"), R), Z = T.slice(0, 32), re = T.slice(32);
+      const T = n.hmacSHA512(c.fromUtf8("Bitcoin seed"), j), Z = T.slice(0, 32), re = T.slice(32);
       return F(Z, re, U);
     }
     return {
@@ -6681,7 +6709,7 @@ function ft(e, t) {
     }
   };
 }
-function jr(...e) {
+function Rr(...e) {
   for (const t of e)
     if (Array.isArray(t))
       for (const r of t)
@@ -6717,7 +6745,7 @@ const im = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   EMPTY: xs,
   abytes: ar,
   checkHash: Bd,
-  cleanBytes: jr,
+  cleanBytes: Rr,
   concatBytes: ts,
   copyBytes: am,
   equalBytes: ks,
@@ -6730,28 +6758,28 @@ const im = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   validateSigOpts: ea,
   validateVerOpts: _a,
   vecCoder: ft
-}, Symbol.toStringTag, { value: "Module" })), sm = /* @__PURE__ */ En(im);
+}, Symbol.toStringTag, { value: "Module" })), sm = /* @__PURE__ */ Bn(im);
 var Or = {};
 const cm = (e) => {
-  const { newPoly: t, N: r, Q: n, F: o, ROOT_OF_UNITY: a, brvBits: s } = e, i = (A, E = n) => {
-    const x = A % E | 0;
-    return (x >= 0 ? x | 0 : E + x | 0) | 0;
-  }, h = (A, E = n) => {
-    const x = i(A, E) | 0;
-    return (x > E >> 1 ? x - E | 0 : x) | 0;
+  const { newPoly: t, N: r, Q: n, F: o, ROOT_OF_UNITY: a, brvBits: s } = e, i = (A, k = n) => {
+    const x = A % k | 0;
+    return (x >= 0 ? x | 0 : k + x | 0) | 0;
+  }, h = (A, k = n) => {
+    const x = i(A, k) | 0;
+    return (x > k >> 1 ? x - k | 0 : x) | 0;
   };
   function l() {
     const A = t(r);
-    for (let E = 0; E < r; E++) {
-      const x = ph(E, s), z = BigInt(a) ** BigInt(x) % BigInt(n);
-      A[E] = Number(z) | 0;
+    for (let k = 0; k < r; k++) {
+      const x = ph(k, s), z = BigInt(a) ** BigInt(x) % BigInt(n);
+      A[k] = Number(z) | 0;
     }
     return A;
   }
   const c = l(), w = {
-    add: (A, E) => i((A | 0) + (E | 0)) | 0,
-    sub: (A, E) => i((A | 0) - (E | 0)) | 0,
-    mul: (A, E) => i((A | 0) * (E | 0)) | 0,
+    add: (A, k) => i((A | 0) + (k | 0)) | 0,
+    sub: (A, k) => i((A | 0) - (k | 0)) | 0,
+    mul: (A, k) => i((A | 0) * (k | 0)) | 0,
     inv: (A) => {
       throw new Error("not implemented");
     }
@@ -6761,32 +6789,32 @@ const cm = (e) => {
     invertButterflies: !0,
     skipStages: 0,
     brp: !1
-  }, v = js(w, { dit: !1, ...g }), k = js(w, { dit: !0, ...g });
+  }, v = Rs(w, { dit: !1, ...g }), E = Rs(w, { dit: !0, ...g });
   return { mod: i, smod: h, nttZetas: c, NTT: {
     encode: (A) => v(A),
     decode: (A) => {
-      k(A);
-      for (let E = 0; E < A.length; E++)
-        A[E] = i(o * A[E]);
+      E(A);
+      for (let k = 0; k < A.length; k++)
+        A[k] = i(o * A[k]);
       return A;
     }
-  }, bitsCoder: (A, E) => {
+  }, bitsCoder: (A, k) => {
     const x = Mi(A), z = A * (r / 8);
     return {
       bytesLen: z,
       encode: (F) => {
-        const j = new Uint8Array(z);
-        for (let I = 0, N = 0, O = 0, R = 0; I < F.length; I++)
-          for (N |= (E.encode(F[I]) & x) << O, O += A; O >= 8; O -= 8, N >>= 8)
-            j[R++] = N & Mi(O);
-        return j;
+        const R = new Uint8Array(z);
+        for (let I = 0, N = 0, O = 0, j = 0; I < F.length; I++)
+          for (N |= (k.encode(F[I]) & x) << O, O += A; O >= 8; O -= 8, N >>= 8)
+            R[j++] = N & Mi(O);
+        return R;
       },
       decode: (F) => {
-        const j = t(r);
-        for (let I = 0, N = 0, O = 0, R = 0; I < F.length; I++)
+        const R = t(r);
+        for (let I = 0, N = 0, O = 0, j = 0; I < F.length; I++)
           for (N |= F[I] << O, O += 8; O >= A; O -= A, N >>= A)
-            j[R++] = E.decode(N & x);
-        return j;
+            R[j++] = k.decode(N & x);
+        return R;
       }
     };
   } };
@@ -6800,19 +6828,19 @@ const cm = (e) => {
     stats: () => ({ calls: i, xofs: h }),
     get: (l, c) => (n[o + 0] = l, n[o + 1] = c, s.destroy(), s = e.create({}).update(n), i++, () => (h++, s.xofInto(a))),
     clean: () => {
-      s.destroy(), jr(a, n);
+      s.destroy(), Rr(a, n);
     }
   };
 }, As = /* @__PURE__ */ Td(ih), Ss = /* @__PURE__ */ Td(sr);
 function bu(e) {
   Es(e), e.externalMu !== void 0 && gh(e.externalMu, "opts.externalMu");
 }
-const je = 256, nt = 8380417, um = 1753, lm = 8347681, mt = 13, Ki = Math.floor((nt - 1) / 88) | 0, Hi = Math.floor((nt - 1) / 32) | 0, Ta = {
+const Re = 256, nt = 8380417, um = 1753, lm = 8347681, mt = 13, Ki = Math.floor((nt - 1) / 88) | 0, Hi = Math.floor((nt - 1) / 32) | 0, Ta = {
   2: { K: 4, L: 4, D: mt, GAMMA1: 2 ** 17, GAMMA2: Ki, TAU: 39, ETA: 2, OMEGA: 80 },
   3: { K: 6, L: 5, D: mt, GAMMA1: 2 ** 19, GAMMA2: Hi, TAU: 49, ETA: 4, OMEGA: 55 },
   5: { K: 8, L: 7, D: mt, GAMMA1: 2 ** 19, GAMMA2: Hi, TAU: 60, ETA: 2, OMEGA: 75 }
 }, tr = (e) => new Int32Array(e), { mod: gt, smod: ra, NTT: He, bitsCoder: fm } = cm({
-  N: je,
+  N: Re,
   Q: nt,
   F: lm,
   ROOT_OF_UNITY: um,
@@ -6830,27 +6858,27 @@ const je = 256, nt = 8380417, um = 1753, lm = 8347681, mt = 13, Ki = Math.floor(
     e[r] = gt(e[r] - t[r]);
   return e;
 }, dm = (e) => {
-  for (let t = 0; t < je; t++)
+  for (let t = 0; t < Re; t++)
     e[t] <<= mt;
   return e;
 }, en = (e, t) => {
-  for (let r = 0; r < je; r++)
+  for (let r = 0; r < Re; r++)
     if (Math.abs(ra(e[r])) >= t)
       return !0;
   return !1;
 }, Qr = (e, t) => {
-  const r = tr(je);
+  const r = tr(Re);
   for (let n = 0; n < e.length; n++)
     r[n] = gt(e[n] * t[n]);
   return r;
 };
 function Vn(e) {
-  const t = tr(je);
-  for (let r = 0; r < je; ) {
+  const t = tr(Re);
+  for (let r = 0; r < Re; ) {
     const n = e();
     if (n.length % 3)
       throw new Error("RejNTTPoly: unaligned block");
-    for (let o = 0; r < je && o <= n.length - 3; o += 3) {
+    for (let o = 0; r < Re && o <= n.length - 3; o += 3) {
       const a = (n[o + 0] | n[o + 1] << 8 | n[o + 2] << 16) & 8388607;
       a < nt && (t[r++] = a);
     }
@@ -6865,10 +6893,10 @@ function Is(e) {
     throw new Error("Wrong GAMMA1");
   if (![Ki, Hi].includes(o))
     throw new Error("Wrong GAMMA2");
-  const k = a * s, y = (C) => {
+  const E = a * s, y = (C) => {
     const G = gt(C), V = ra(G, 2 * o) | 0;
     return G - V === nt - 1 ? { r1: 0, r0: V - 1 | 0 } : { r1: Math.floor((G - V) / (2 * o)) | 0, r0: V };
-  }, m = (C) => y(C).r1, A = (C) => y(C).r0, E = (C, G) => C <= o || C > nt - o || C === nt - o && G === 0 ? 0 : 1, x = (C, G) => {
+  }, m = (C) => y(C).r1, A = (C) => y(C).r0, k = (C, G) => C <= o || C > nt - o || C === nt - o && G === 0 ? 0 : 1, x = (C, G) => {
     const V = Math.floor((nt - 1) / (2 * o)), { r1: X, r0: Q } = y(G);
     return C === 1 ? Q > 0 ? gt(X + 1, V) | 0 : gt(X - 1, V) | 0 : X | 0;
   }, z = (C) => {
@@ -6881,7 +6909,7 @@ function Is(e) {
         throw new Error("hint.encode: hint is false");
       const G = new Uint8Array(i + t);
       for (let V = 0, X = 0; V < t; V++) {
-        for (let Q = 0; Q < je; Q++)
+        for (let Q = 0; Q < Re; Q++)
           C[V][Q] !== 0 && (G[X++] = Q);
         G[i + V] = X;
       }
@@ -6891,7 +6919,7 @@ function Is(e) {
       const G = [];
       let V = 0;
       for (let X = 0; X < t; X++) {
-        const Q = tr(je);
+        const Q = tr(Re);
         if (C[i + X] < V || C[i + X] > i)
           return !1;
         for (let ee = V; ee < C[i + X]; ee++) {
@@ -6906,27 +6934,27 @@ function Is(e) {
           return !1;
       return G;
     }
-  }, j = Qt(s === 2 ? 3 : 4, (C) => s - C, (C) => {
+  }, R = Qt(s === 2 ? 3 : 4, (C) => s - C, (C) => {
     if (!(-s <= C && C <= s))
       throw new Error(`malformed key s1/s3 ${C} outside of ETA range [${-s}, ${s}]`);
     return C;
-  }), I = Qt(13, (C) => (1 << mt - 1) - C), N = Qt(10), O = Qt(n === 1 << 17 ? 18 : 20, (C) => ra(n - C)), R = Qt(o === Ki ? 6 : 4), U = ft(R, t), T = an("publicKey", 32, ft(N, t)), Z = an("secretKey", 32, 32, l, ft(j, r), ft(j, t), ft(I, t)), re = an("signature", c, ft(O, r), F), oe = s === 2 ? (C) => C < 15 ? 2 - C % 5 : !1 : (C) => C < 9 ? 4 - C : !1;
+  }), I = Qt(13, (C) => (1 << mt - 1) - C), N = Qt(10), O = Qt(n === 1 << 17 ? 18 : 20, (C) => ra(n - C)), j = Qt(o === Ki ? 6 : 4), U = ft(j, t), T = an("publicKey", 32, ft(N, t)), Z = an("secretKey", 32, 32, l, ft(R, r), ft(R, t), ft(I, t)), re = an("signature", c, ft(O, r), F), oe = s === 2 ? (C) => C < 15 ? 2 - C % 5 : !1 : (C) => C < 9 ? 4 - C : !1;
   function ue(C) {
-    const G = tr(je);
-    for (let V = 0; V < je; ) {
+    const G = tr(Re);
+    for (let V = 0; V < Re; ) {
       const X = C();
-      for (let Q = 0; V < je && Q < X.length; Q += 1) {
+      for (let Q = 0; V < Re && Q < X.length; Q += 1) {
         const ee = oe(X[Q] & 15), ne = oe(X[Q] >> 4 & 15);
-        ee !== !1 && (G[V++] = ee), V < je && ne !== !1 && (G[V++] = ne);
+        ee !== !1 && (G[V++] = ee), V < Re && ne !== !1 && (G[V++] = ne);
       }
     }
     return G;
   }
   const ie = (C) => {
-    const G = tr(je), V = sr.create({}).update(C), X = new Uint8Array(sr.blockLen);
+    const G = tr(Re), V = sr.create({}).update(C), X = new Uint8Array(sr.blockLen);
     V.xofInto(X);
     const Q = X.slice(0, 8);
-    for (let ee = je - a, ne = 8, se = 0, ce = 0; ee < je; ee++) {
+    for (let ee = Re - a, ne = 8, se = 0, ce = 0; ee < Re; ee++) {
       let le = ee + 1;
       for (; le > ee; )
         le = X[ne++], !(ne < sr.blockLen) && (V.xofInto(X), ne = 0);
@@ -6934,21 +6962,21 @@ function Is(e) {
     }
     return G;
   }, de = (C) => {
-    const G = tr(je), V = tr(je);
+    const G = tr(Re), V = tr(Re);
     for (let X = 0; X < C.length; X++) {
       const { r0: Q, r1: ee } = z(C[X]);
       G[X] = Q, V[X] = ee;
     }
     return { r0: G, r1: V };
   }, me = (C, G) => {
-    for (let V = 0; V < je; V++)
+    for (let V = 0; V < Re; V++)
       C[V] = x(G[V], C[V]);
     return C;
   }, Se = (C, G) => {
-    const V = tr(je);
+    const V = tr(Re);
     let X = 0;
-    for (let Q = 0; Q < je; Q++) {
-      const ee = E(C[Q], G[Q]);
+    for (let Q = 0; Q < Re; Q++) {
+      const ee = k(C[Q], G[Q]);
       V[Q] = ee, X += ee;
     }
     return { v: V, cnt: X };
@@ -6963,16 +6991,16 @@ function Is(e) {
     },
     keygen: (C) => {
       const G = new Uint8Array(34), V = C === void 0;
-      V && (C = qi(32)), ar(C, 32, "seed"), G.set(C), V && jr(C), G[32] = t, G[33] = r;
+      V && (C = qi(32)), ar(C, 32, "seed"), G.set(C), V && Rr(C), G[32] = t, G[33] = r;
       const [X, Q, ee] = q.decode(sr(G, { dkLen: q.bytesLen })), ne = g(Q), se = [];
       for (let ae = 0; ae < r; ae++)
         se.push(ue(ne.get(ae & 255, ae >> 8 & 255)));
       const ce = [];
       for (let ae = r; ae < r + t; ae++)
         ce.push(ue(ne.get(ae & 255, ae >> 8 & 255)));
-      const le = se.map((ae) => He.encode(ae.slice())), he = [], ye = [], pe = w(X), we = tr(je);
+      const le = se.map((ae) => He.encode(ae.slice())), he = [], ye = [], pe = w(X), we = tr(Re);
       for (let ae = 0; ae < t; ae++) {
-        jr(we);
+        Rr(we);
         for (let xe = 0; xe < r; xe++) {
           const Be = Vn(pe.get(xe, ae));
           Jr(we, Qr(Be, le[xe]));
@@ -6981,11 +7009,11 @@ function Is(e) {
         const { r0: fe, r1: ge } = de(Jr(we, ce[ae]));
         he.push(fe), ye.push(ge);
       }
-      const Oe = T.encode([X, ye]), $ = sr(Oe, { dkLen: l }), Re = Z.encode([X, ee, $, se, ce, he]);
-      return pe.clean(), ne.clean(), jr(X, Q, ee, se, ce, le, we, he, ye, $, G), { publicKey: Oe, secretKey: Re };
+      const Oe = T.encode([X, ye]), $ = sr(Oe, { dkLen: l }), je = Z.encode([X, ee, $, se, ce, he]);
+      return pe.clean(), ne.clean(), Rr(X, Q, ee, se, ce, le, we, he, ye, $, G), { publicKey: Oe, secretKey: je };
     },
     getPublicKey: (C) => {
-      const [G, V, X, Q, ee, ne] = Z.decode(C), se = w(G), ce = Q.map((ye) => He.encode(ye.slice())), le = [], he = tr(je);
+      const [G, V, X, Q, ee, ne] = Z.decode(C), se = w(G), ce = Q.map((ye) => He.encode(ye.slice())), le = [], he = tr(Re);
       for (let ye = 0; ye < t; ye++) {
         he.fill(0);
         for (let we = 0; we < r; we++) {
@@ -6996,7 +7024,7 @@ function Is(e) {
         const { r1: pe } = de(he);
         le.push(pe);
       }
-      return se.clean(), jr(he, ce, ne, Q, ee), T.encode([G, le]);
+      return se.clean(), Rr(he, ce, ne, Q, ee), T.encode([G, le]);
     },
     // NOTE: random is optional.
     sign: (C, G, V = {}) => {
@@ -7018,27 +7046,27 @@ function Is(e) {
       ar(Oe, 32, "extraEntropy");
       const $ = sr.create({ dkLen: h }).update(ne).update(Oe).update(we).digest();
       ar($, h);
-      const Re = g($, O.bytesLen);
+      const je = g($, O.bytesLen);
       e: for (let ae = 0; ; ) {
         const fe = [];
         for (let d = 0; d < r; d++, ae++)
-          fe.push(O.decode(Re.get(ae & 255, ae >> 8)()));
+          fe.push(O.decode(je.get(ae & 255, ae >> 8)()));
         const ge = fe.map((d) => He.encode(d.slice())), xe = [];
         for (let d = 0; d < t; d++) {
-          const S = tr(je);
+          const S = tr(Re);
           for (let P = 0; P < r; P++)
             Jr(S, Qr(ye[d][P], ge[P]));
           He.decode(S), xe.push(S);
         }
         const Be = xe.map((d) => d.map(m)), Ye = sr.create({ dkLen: c }).update(we).update(U.encode(Be)).digest(), fr = He.encode(ie(Ye)), M = ce.map((d) => Qr(d, fr));
         for (let d = 0; d < r; d++)
-          if (Jr(He.decode(M[d]), fe[d]), en(M[d], n - k))
+          if (Jr(He.decode(M[d]), fe[d]), en(M[d], n - E))
             continue e;
         let te = 0;
         const b = [];
         for (let d = 0; d < t; d++) {
           const S = He.decode(Qr(le[d], fr)), P = yu(xe[d], S).map(A);
-          if (en(P, o - k))
+          if (en(P, o - E))
             continue e;
           const D = He.decode(Qr(he[d], fr));
           if (en(D, o))
@@ -7049,9 +7077,9 @@ function Is(e) {
         }
         if (te > i)
           continue;
-        Re.clean();
+        je.clean();
         const u = re.encode([Ye, M, b]);
-        return jr(Ye, M, b, fr, Be, xe, ge, fe, $, we, ce, le, he, ...ye), u;
+        return Rr(Ye, M, b, fr, Be, xe, ge, fe, $, we, ce, le, he, ...ye), u;
       }
       throw new Error("Unreachable code path reached, report this error");
     },
@@ -7064,14 +7092,14 @@ function Is(e) {
       if (he === !1)
         return !1;
       for (let ae = 0; ae < r; ae++)
-        if (en(le[ae], n - k))
+        if (en(le[ae], n - E))
           return !1;
       const ye = Q ? G : sr.create({ dkLen: h }).update(se).update(G).digest(), pe = He.encode(ie(ce)), we = le.map((ae) => ae.slice());
       for (let ae = 0; ae < r; ae++)
         He.encode(we[ae]);
       const Oe = [], $ = w(ee);
       for (let ae = 0; ae < t; ae++) {
-        const fe = Qr(He.encode(dm(ne[ae])), pe), ge = tr(je);
+        const fe = Qr(He.encode(dm(ne[ae])), pe), ge = tr(Re);
         for (let Be = 0; Be < r; Be++) {
           const Ye = Vn($.get(Be, ae));
           Jr(ge, Qr(Ye, we[Be]));
@@ -7080,14 +7108,14 @@ function Is(e) {
         Oe.push(me(xe, he[ae]));
       }
       $.clean();
-      const Re = sr.create({ dkLen: c }).update(ye).update(U.encode(Oe)).digest();
+      const je = sr.create({ dkLen: c }).update(ye).update(U.encode(Oe)).digest();
       for (const ae of he)
         if (!(ae.reduce((ge, xe) => ge + xe, 0) <= i))
           return !1;
       for (const ae of le)
-        if (en(ae, n - k))
+        if (en(ae, n - E))
           return !1;
-      return ks(ce, Re);
+      return ks(ce, je);
     }
   };
   return {
@@ -7100,7 +7128,7 @@ function Is(e) {
     sign: (C, G, V = {}) => {
       ea(V);
       const X = Di(C, V.context), Q = H.sign(X, G, V);
-      return jr(X), Q;
+      return Rr(X), Q;
     },
     verify: (C, G, V, X = {}) => (_a(X), H.verify(C, Di(G, X.context), V)),
     prehash: (C) => (Bd(C, v), {
@@ -7112,7 +7140,7 @@ function Is(e) {
       sign: (G, V, X = {}) => {
         ea(X);
         const Q = Fi(C, G, X.context), ee = H.sign(Q, V, X);
-        return jr(Q), ee;
+        return Rr(Q), ee;
       },
       verify: (G, V, X, Q = {}) => (_a(Q), H.verify(G, Fi(C, V, Q.context), X))
     })
@@ -7148,7 +7176,7 @@ const hm = /* @__PURE__ */ Is({
   ml_dsa44: hm,
   ml_dsa65: pm,
   ml_dsa87: gm
-}, Symbol.toStringTag, { value: "Module" })), mm = /* @__PURE__ */ En(bm);
+}, Symbol.toStringTag, { value: "Module" })), mm = /* @__PURE__ */ Bn(bm);
 var vu;
 function zd() {
   if (vu) return Or;
@@ -7207,38 +7235,38 @@ var wu;
 function ym() {
   if (wu) return dr;
   wu = 1;
-  var e = dr && dr.__createBinding || (Object.create ? (function(j, I, N, O) {
+  var e = dr && dr.__createBinding || (Object.create ? (function(R, I, N, O) {
     O === void 0 && (O = N);
-    var R = Object.getOwnPropertyDescriptor(I, N);
-    (!R || ("get" in R ? !I.__esModule : R.writable || R.configurable)) && (R = { enumerable: !0, get: function() {
+    var j = Object.getOwnPropertyDescriptor(I, N);
+    (!j || ("get" in j ? !I.__esModule : j.writable || j.configurable)) && (j = { enumerable: !0, get: function() {
       return I[N];
-    } }), Object.defineProperty(j, O, R);
-  }) : (function(j, I, N, O) {
-    O === void 0 && (O = N), j[O] = I[N];
-  })), t = dr && dr.__setModuleDefault || (Object.create ? (function(j, I) {
-    Object.defineProperty(j, "default", { enumerable: !0, value: I });
-  }) : function(j, I) {
-    j.default = I;
+    } }), Object.defineProperty(R, O, j);
+  }) : (function(R, I, N, O) {
+    O === void 0 && (O = N), R[O] = I[N];
+  })), t = dr && dr.__setModuleDefault || (Object.create ? (function(R, I) {
+    Object.defineProperty(R, "default", { enumerable: !0, value: I });
+  }) : function(R, I) {
+    R.default = I;
   }), r = dr && dr.__importStar || /* @__PURE__ */ (function() {
-    var j = function(I) {
-      return j = Object.getOwnPropertyNames || function(N) {
+    var R = function(I) {
+      return R = Object.getOwnPropertyNames || function(N) {
         var O = [];
-        for (var R in N) Object.prototype.hasOwnProperty.call(N, R) && (O[O.length] = R);
+        for (var j in N) Object.prototype.hasOwnProperty.call(N, j) && (O[O.length] = j);
         return O;
-      }, j(I);
+      }, R(I);
     };
     return function(I) {
       if (I && I.__esModule) return I;
       var N = {};
-      if (I != null) for (var O = j(I), R = 0; R < O.length; R++) O[R] !== "default" && e(N, I, O[R]);
+      if (I != null) for (var O = R(I), j = 0; j < O.length; j++) O[j] !== "default" && e(N, I, O[j]);
       return t(N, I), N;
     };
   })();
   Object.defineProperty(dr, "__esModule", { value: !0 }), dr.QuantumBIP32Factory = void 0;
   const n = sm, o = r(ad()), a = r(ms), s = r(/* @__PURE__ */ as()), i = Id(), h = Sd, l = /* @__PURE__ */ kn(), c = zd(), w = Ba(), g = (0, h.base58check)(l.sha256), v = {
-    encode: (j) => g.encode(j),
-    decode: (j) => g.decode(j)
-  }, k = 32, y = 2147483648;
+    encode: (R) => g.encode(R),
+    decode: (R) => g.decode(R)
+  }, E = 32, y = 2147483648;
   class m {
     _privateKey;
     _publicKey;
@@ -7270,8 +7298,8 @@ function ym() {
     _depth;
     _index;
     _parentFingerprint;
-    constructor(I, N, O, R, U = 0, T = 0, Z = 0) {
-      super(I, N, R), this.chainCode = O, this._depth = U, this._index = T, this._parentFingerprint = Z;
+    constructor(I, N, O, j, U = 0, T = 0, Z = 0) {
+      super(I, N, j), this.chainCode = O, this._depth = U, this._index = T, this._parentFingerprint = Z;
     }
     get depth() {
       return this._depth;
@@ -7301,7 +7329,7 @@ function ym() {
       return new A(void 0, this.publicKey, this.chainCode, this.config, this.depth, this.index, this.parentFingerprint);
     }
     toBase58() {
-      const I = this.isNeutered() ? this.config.network.bip32.public : this.config.network.bip32.private, N = !this.isNeutered(), R = 45 + (N ? this.config.privateKeySize : this.config.publicKeySize), U = new Uint8Array(R);
+      const I = this.isNeutered() ? this.config.network.bip32.public : this.config.network.bip32.private, N = !this.isNeutered(), j = 45 + (N ? this.config.privateKeySize : this.config.publicKeySize), U = new Uint8Array(j);
       let T = 0;
       return a.writeUInt32(U, T, I, "BE"), T += 4, a.writeUInt8(U, T, this.depth), T += 1, a.writeUInt32(U, T, this.parentFingerprint, "BE"), T += 4, a.writeUInt32(U, T, this.index, "BE"), T += 4, U.set(this.chainCode, T), T += 32, N ? U.set(this._privateKey, T) : U.set(this._publicKey, T), v.encode(U);
     }
@@ -7321,7 +7349,7 @@ function ym() {
         const oe = o.hash256(this._privateKey);
         O = new Uint8Array(36), O.set(oe, 0), a.writeUInt32(O, 32, I, "BE");
       }
-      const R = o.hmacSHA512(this.chainCode, O), U = R.slice(0, 32), T = R.slice(32), { secretKey: Z, publicKey: re } = this.config.algorithm.keygen(U);
+      const j = o.hmacSHA512(this.chainCode, O), U = j.slice(0, 32), T = j.slice(32), { secretKey: Z, publicKey: re } = this.config.algorithm.keygen(U);
       return new A(Z, re, T, this.config, this.depth + 1, I, a.readUInt32(this.fingerprint, 0, "BE"));
     }
     deriveHardened(I) {
@@ -7340,18 +7368,18 @@ function ym() {
           throw new TypeError("Expected master, got child");
         N = N.slice(1);
       }
-      return N.reduce((O, R) => {
+      return N.reduce((O, j) => {
         let U;
-        return R.slice(-1) === "'" ? (U = parseInt(R.slice(0, -1), 10), O.deriveHardened(U)) : (U = parseInt(R, 10), O.derive(U));
+        return j.slice(-1) === "'" ? (U = parseInt(j.slice(0, -1), 10), O.deriveHardened(U)) : (U = parseInt(j, 10), O.derive(U));
       }, this);
     }
   }
-  function E(j, I, N) {
-    if (s.parse(s.instance(Uint8Array), j), j.length < 16)
+  function k(R, I, N) {
+    if (s.parse(s.instance(Uint8Array), R), R.length < 16)
       throw new TypeError("Seed should be at least 128 bits");
-    if (j.length > 64)
+    if (R.length > 64)
       throw new TypeError("Seed should be at most 512 bits");
-    const O = (0, c.getMLDSAConfig)(N || c.MLDSASecurityLevel.LEVEL2, I || w.BITCOIN), R = o.hmacSHA512(a.fromUtf8("Bitcoin seed"), j), U = R.slice(0, 32), T = R.slice(32), { secretKey: Z, publicKey: re } = O.algorithm.keygen(U);
+    const O = (0, c.getMLDSAConfig)(N || c.MLDSASecurityLevel.LEVEL2, I || w.BITCOIN), j = o.hmacSHA512(a.fromUtf8("Bitcoin seed"), R), U = j.slice(0, 32), T = j.slice(32), { secretKey: Z, publicKey: re } = O.algorithm.keygen(U);
     return new A(
       Z,
       re,
@@ -7365,11 +7393,11 @@ function ym() {
       0
     );
   }
-  function x(j) {
-    const I = v.decode(j), N = a.readUInt32(I, 0, "BE"), O = (0, c.findNetworkByVersion)(N);
+  function x(R) {
+    const I = v.decode(R), N = a.readUInt32(I, 0, "BE"), O = (0, c.findNetworkByVersion)(N);
     if (!O)
       throw new TypeError("Unknown network version");
-    const { network: R, isPrivate: U } = O, Z = I.length - 45;
+    const { network: j, isPrivate: U } = O, Z = I.length - 45;
     let re;
     if (U)
       if (Z === 2560)
@@ -7388,7 +7416,7 @@ function ym() {
       re = c.MLDSASecurityLevel.LEVEL5;
     else
       throw new TypeError(`Invalid public key size: ${Z}`);
-    const oe = (0, c.getMLDSAConfig)(re, R), ue = U ? 45 + oe.privateKeySize : 45 + oe.publicKeySize;
+    const oe = (0, c.getMLDSAConfig)(re, j), ue = U ? 45 + oe.privateKeySize : 45 + oe.publicKeySize;
     if (I.length !== ue)
       throw new TypeError(`Invalid buffer length: expected ${ue}, got ${I.length}`);
     let ie = 4;
@@ -7411,49 +7439,49 @@ function ym() {
       return new A(void 0, q, De, oe, de, Se, me);
     }
   }
-  function z(j, I, N, O) {
-    const R = (0, c.getMLDSAConfig)(O || c.MLDSASecurityLevel.LEVEL2, N || w.BITCOIN);
-    if (j.length !== R.publicKeySize)
-      throw new TypeError(`Invalid public key length for ML-DSA-${O}: expected ${R.publicKeySize}, got ${j.length}`);
-    if (I.length !== k)
-      throw new TypeError(`Invalid chain code length: expected ${k}, got ${I.length}`);
-    return new A(void 0, j, I, R, 0, 0, 0);
+  function z(R, I, N, O) {
+    const j = (0, c.getMLDSAConfig)(O || c.MLDSASecurityLevel.LEVEL2, N || w.BITCOIN);
+    if (R.length !== j.publicKeySize)
+      throw new TypeError(`Invalid public key length for ML-DSA-${O}: expected ${j.publicKeySize}, got ${R.length}`);
+    if (I.length !== E)
+      throw new TypeError(`Invalid chain code length: expected ${E}, got ${I.length}`);
+    return new A(void 0, R, I, j, 0, 0, 0);
   }
-  function F(j, I, N, O) {
-    const R = (0, c.getMLDSAConfig)(O || c.MLDSASecurityLevel.LEVEL2, N || w.BITCOIN);
-    if (j.length !== R.privateKeySize)
-      throw new TypeError(`Invalid private key length for ML-DSA-${O}: expected ${R.privateKeySize}, got ${j.length}`);
-    if (I.length !== k)
-      throw new TypeError(`Invalid chain code length: expected ${k}, got ${I.length}`);
-    const U = R.algorithm.getPublicKey(j);
-    return new A(j, U, I, R, 0, 0, 0);
+  function F(R, I, N, O) {
+    const j = (0, c.getMLDSAConfig)(O || c.MLDSASecurityLevel.LEVEL2, N || w.BITCOIN);
+    if (R.length !== j.privateKeySize)
+      throw new TypeError(`Invalid private key length for ML-DSA-${O}: expected ${j.privateKeySize}, got ${R.length}`);
+    if (I.length !== E)
+      throw new TypeError(`Invalid chain code length: expected ${E}, got ${I.length}`);
+    const U = j.algorithm.getPublicKey(R);
+    return new A(R, U, I, j, 0, 0, 0);
   }
   return dr.QuantumBIP32Factory = {
-    fromSeed: E,
+    fromSeed: k,
     fromBase58: x,
     fromPublicKey: z,
     fromPrivateKey: F
   }, dr;
 }
-var Rr = {}, _u;
+var jr = {}, _u;
 function Od() {
-  if (_u) return Rr;
-  _u = 1, Object.defineProperty(Rr, "__esModule", { value: !0 }), Rr.QuantumDerivationPath = Rr.DerivationPath = void 0, Rr.getQuantumPath = r, Rr.getBitcoinPath = n;
+  if (_u) return jr;
+  _u = 1, Object.defineProperty(jr, "__esModule", { value: !0 }), jr.QuantumDerivationPath = jr.DerivationPath = void 0, jr.getQuantumPath = r, jr.getBitcoinPath = n;
   var e;
   (function(o) {
     o.BIP44 = "m/44'/0'/0'/0/0", o.BIP49 = "m/49'/0'/0'/0/0", o.BIP84 = "m/84'/0'/0'/0/0", o.BIP86 = "m/86'/0'/0'/0/0", o.BIP360 = "m/360'/0'/0'/0/0";
-  })(e || (Rr.DerivationPath = e = {}));
+  })(e || (jr.DerivationPath = e = {}));
   var t;
   (function(o) {
     o.STANDARD = "m/360'/0'/0'/0/0", o.CHANGE = "m/360'/0'/0'/1/0", o.ACCOUNT_0_ADDRESS_0 = "m/360'/0'/0'/0/0", o.ACCOUNT_0_ADDRESS_1 = "m/360'/0'/0'/0/1", o.ACCOUNT_1_ADDRESS_0 = "m/360'/1'/0'/0/0";
-  })(t || (Rr.QuantumDerivationPath = t = {}));
+  })(t || (jr.QuantumDerivationPath = t = {}));
   function r(o = 0, a = 0, s = !1) {
     return `m/360'/${o}'/${s ? 1 : 0}'/${a}`;
   }
   function n(o, a = 0, s = 0, i = !1) {
     return `m/${o}'/0'/${a}'/${i ? 1 : 0}/${s}`;
   }
-  return Rr;
+  return jr;
 }
 var ku;
 function vm() {
@@ -7524,7 +7552,7 @@ function wm() {
   })(to)), to;
 }
 var _m = wm();
-const mv = /* @__PURE__ */ Ea(_m);
+const mv = /* @__PURE__ */ Ia(_m);
 var ao = {}, ut = {}, lt = {}, xu;
 function km() {
   return xu || (xu = 1, Object.defineProperty(lt, "__esModule", { value: !0 }), lt.testnet = lt.bitcoin = void 0, lt.bitcoin = {
@@ -7583,7 +7611,7 @@ function xm() {
   throw new Error("unable to locate global object");
 }
 const Su = xm(), Iu = Su.crypto || Su.msCrypto;
-function Rd(e) {
+function jd(e) {
   switch (e) {
     case "sha256":
       return fn.create();
@@ -7592,7 +7620,7 @@ function Rd(e) {
   }
   Bs(!1, "invalid hashing algorithm name", "algorithm", e);
 }
-function jd(e, t) {
+function Rd(e, t) {
   const r = { sha256: fn, sha512: ns }[e];
   return Bs(r != null, "invalid hmac algorithm", "algorithm", e), sh.create(r, t);
 }
@@ -7609,18 +7637,18 @@ function Ud(e) {
   return Iu.getRandomValues(t), t;
 }
 const Am = {
-  createHash: Rd,
-  createHmac: jd,
+  createHash: jd,
+  createHmac: Rd,
   pbkdf2Sync: Pd,
   randomBytes: Ud
 }, Sm = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  createHash: Rd,
-  createHmac: jd,
+  createHash: jd,
+  createHmac: Rd,
   default: Am,
   pbkdf2Sync: Pd,
   randomBytes: Ud
-}, Symbol.toStringTag, { value: "Module" })), Nd = /* @__PURE__ */ En(Sm);
+}, Symbol.toStringTag, { value: "Module" })), Nd = /* @__PURE__ */ Bn(Sm);
 var io, Bu;
 function Im() {
   return Bu || (Bu = 1, io = Nd.randomBytes), io;
@@ -7638,78 +7666,78 @@ function Tm() {
     for (var n = [], o = [], a = typeof Uint8Array < "u" ? Uint8Array : Array, s = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", i = 0, h = s.length; i < h; ++i)
       n[i] = s[i], o[s.charCodeAt(i)] = i;
     o[45] = 62, o[95] = 63;
-    function l(E) {
-      var x = E.length;
+    function l(k) {
+      var x = k.length;
       if (x % 4 > 0)
         throw new Error("Invalid string. Length must be a multiple of 4");
-      var z = E.indexOf("=");
+      var z = k.indexOf("=");
       z === -1 && (z = x);
       var F = z === x ? 0 : 4 - z % 4;
       return [z, F];
     }
-    function c(E) {
-      var x = l(E), z = x[0], F = x[1];
+    function c(k) {
+      var x = l(k), z = x[0], F = x[1];
       return (z + F) * 3 / 4 - F;
     }
-    function w(E, x, z) {
+    function w(k, x, z) {
       return (x + z) * 3 / 4 - z;
     }
-    function g(E) {
-      var x, z = l(E), F = z[0], j = z[1], I = new a(w(E, F, j)), N = 0, O = j > 0 ? F - 4 : F, R;
-      for (R = 0; R < O; R += 4)
-        x = o[E.charCodeAt(R)] << 18 | o[E.charCodeAt(R + 1)] << 12 | o[E.charCodeAt(R + 2)] << 6 | o[E.charCodeAt(R + 3)], I[N++] = x >> 16 & 255, I[N++] = x >> 8 & 255, I[N++] = x & 255;
-      return j === 2 && (x = o[E.charCodeAt(R)] << 2 | o[E.charCodeAt(R + 1)] >> 4, I[N++] = x & 255), j === 1 && (x = o[E.charCodeAt(R)] << 10 | o[E.charCodeAt(R + 1)] << 4 | o[E.charCodeAt(R + 2)] >> 2, I[N++] = x >> 8 & 255, I[N++] = x & 255), I;
+    function g(k) {
+      var x, z = l(k), F = z[0], R = z[1], I = new a(w(k, F, R)), N = 0, O = R > 0 ? F - 4 : F, j;
+      for (j = 0; j < O; j += 4)
+        x = o[k.charCodeAt(j)] << 18 | o[k.charCodeAt(j + 1)] << 12 | o[k.charCodeAt(j + 2)] << 6 | o[k.charCodeAt(j + 3)], I[N++] = x >> 16 & 255, I[N++] = x >> 8 & 255, I[N++] = x & 255;
+      return R === 2 && (x = o[k.charCodeAt(j)] << 2 | o[k.charCodeAt(j + 1)] >> 4, I[N++] = x & 255), R === 1 && (x = o[k.charCodeAt(j)] << 10 | o[k.charCodeAt(j + 1)] << 4 | o[k.charCodeAt(j + 2)] >> 2, I[N++] = x >> 8 & 255, I[N++] = x & 255), I;
     }
-    function v(E) {
-      return n[E >> 18 & 63] + n[E >> 12 & 63] + n[E >> 6 & 63] + n[E & 63];
+    function v(k) {
+      return n[k >> 18 & 63] + n[k >> 12 & 63] + n[k >> 6 & 63] + n[k & 63];
     }
-    function k(E, x, z) {
-      for (var F, j = [], I = x; I < z; I += 3)
-        F = (E[I] << 16 & 16711680) + (E[I + 1] << 8 & 65280) + (E[I + 2] & 255), j.push(v(F));
-      return j.join("");
+    function E(k, x, z) {
+      for (var F, R = [], I = x; I < z; I += 3)
+        F = (k[I] << 16 & 16711680) + (k[I + 1] << 8 & 65280) + (k[I + 2] & 255), R.push(v(F));
+      return R.join("");
     }
-    function y(E) {
-      for (var x, z = E.length, F = z % 3, j = [], I = 16383, N = 0, O = z - F; N < O; N += I)
-        j.push(k(E, N, N + I > O ? O : N + I));
-      return F === 1 ? (x = E[z - 1], j.push(
+    function y(k) {
+      for (var x, z = k.length, F = z % 3, R = [], I = 16383, N = 0, O = z - F; N < O; N += I)
+        R.push(E(k, N, N + I > O ? O : N + I));
+      return F === 1 ? (x = k[z - 1], R.push(
         n[x >> 2] + n[x << 4 & 63] + "=="
-      )) : F === 2 && (x = (E[z - 2] << 8) + E[z - 1], j.push(
+      )) : F === 2 && (x = (k[z - 2] << 8) + k[z - 1], R.push(
         n[x >> 10] + n[x >> 4 & 63] + n[x << 2 & 63] + "="
-      )), j.join("");
+      )), R.join("");
     }
     var m = {};
-    m.read = function(E, x, z, F, j) {
-      var I, N, O = j * 8 - F - 1, R = (1 << O) - 1, U = R >> 1, T = -7, Z = z ? j - 1 : 0, re = z ? -1 : 1, oe = E[x + Z];
-      for (Z += re, I = oe & (1 << -T) - 1, oe >>= -T, T += O; T > 0; I = I * 256 + E[x + Z], Z += re, T -= 8)
+    m.read = function(k, x, z, F, R) {
+      var I, N, O = R * 8 - F - 1, j = (1 << O) - 1, U = j >> 1, T = -7, Z = z ? R - 1 : 0, re = z ? -1 : 1, oe = k[x + Z];
+      for (Z += re, I = oe & (1 << -T) - 1, oe >>= -T, T += O; T > 0; I = I * 256 + k[x + Z], Z += re, T -= 8)
         ;
-      for (N = I & (1 << -T) - 1, I >>= -T, T += F; T > 0; N = N * 256 + E[x + Z], Z += re, T -= 8)
+      for (N = I & (1 << -T) - 1, I >>= -T, T += F; T > 0; N = N * 256 + k[x + Z], Z += re, T -= 8)
         ;
       if (I === 0)
         I = 1 - U;
       else {
-        if (I === R)
+        if (I === j)
           return N ? NaN : (oe ? -1 : 1) * (1 / 0);
         N = N + Math.pow(2, F), I = I - U;
       }
       return (oe ? -1 : 1) * N * Math.pow(2, I - F);
-    }, m.write = function(E, x, z, F, j, I) {
-      var N, O, R, U = I * 8 - j - 1, T = (1 << U) - 1, Z = T >> 1, re = j === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, oe = F ? 0 : I - 1, ue = F ? 1 : -1, ie = x < 0 || x === 0 && 1 / x < 0 ? 1 : 0;
-      for (x = Math.abs(x), isNaN(x) || x === 1 / 0 ? (O = isNaN(x) ? 1 : 0, N = T) : (N = Math.floor(Math.log(x) / Math.LN2), x * (R = Math.pow(2, -N)) < 1 && (N--, R *= 2), N + Z >= 1 ? x += re / R : x += re * Math.pow(2, 1 - Z), x * R >= 2 && (N++, R /= 2), N + Z >= T ? (O = 0, N = T) : N + Z >= 1 ? (O = (x * R - 1) * Math.pow(2, j), N = N + Z) : (O = x * Math.pow(2, Z - 1) * Math.pow(2, j), N = 0)); j >= 8; E[z + oe] = O & 255, oe += ue, O /= 256, j -= 8)
+    }, m.write = function(k, x, z, F, R, I) {
+      var N, O, j, U = I * 8 - R - 1, T = (1 << U) - 1, Z = T >> 1, re = R === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, oe = F ? 0 : I - 1, ue = F ? 1 : -1, ie = x < 0 || x === 0 && 1 / x < 0 ? 1 : 0;
+      for (x = Math.abs(x), isNaN(x) || x === 1 / 0 ? (O = isNaN(x) ? 1 : 0, N = T) : (N = Math.floor(Math.log(x) / Math.LN2), x * (j = Math.pow(2, -N)) < 1 && (N--, j *= 2), N + Z >= 1 ? x += re / j : x += re * Math.pow(2, 1 - Z), x * j >= 2 && (N++, j /= 2), N + Z >= T ? (O = 0, N = T) : N + Z >= 1 ? (O = (x * j - 1) * Math.pow(2, R), N = N + Z) : (O = x * Math.pow(2, Z - 1) * Math.pow(2, R), N = 0)); R >= 8; k[z + oe] = O & 255, oe += ue, O /= 256, R -= 8)
         ;
-      for (N = N << j | O, U += j; U > 0; E[z + oe] = N & 255, oe += ue, N /= 256, U -= 8)
+      for (N = N << R | O, U += R; U > 0; k[z + oe] = N & 255, oe += ue, N /= 256, U -= 8)
         ;
-      E[z + oe - ue] |= ie * 128;
+      k[z + oe - ue] |= ie * 128;
     };
-    (function(E) {
+    (function(k) {
       const x = r, z = m, F = typeof Symbol == "function" && typeof Symbol.for == "function" ? /* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom") : null;
-      E.Buffer = T, E.SlowBuffer = H, E.INSPECT_MAX_BYTES = 50;
-      const j = 2147483647;
-      E.kMaxLength = j;
+      k.Buffer = T, k.SlowBuffer = H, k.INSPECT_MAX_BYTES = 50;
+      const R = 2147483647;
+      k.kMaxLength = R;
       const { Uint8Array: I, ArrayBuffer: N, SharedArrayBuffer: O } = globalThis;
-      T.TYPED_ARRAY_SUPPORT = R(), !T.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
+      T.TYPED_ARRAY_SUPPORT = j(), !T.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
         "This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support."
       );
-      function R() {
+      function j() {
         try {
           const _ = new I(1), f = { foo: function() {
             return 42;
@@ -7733,7 +7761,7 @@ function Tm() {
         }
       });
       function U(_) {
-        if (_ > j)
+        if (_ > R)
           throw new RangeError('The value "' + _ + '" is invalid for option "size"');
         const f = new I(_);
         return Object.setPrototypeOf(f, T.prototype), f;
@@ -7833,13 +7861,13 @@ function Tm() {
           return p.length === 0 || _.copy(p, 0, 0, f), p;
         }
         if (_.length !== void 0)
-          return typeof _.length != "number" || Ra(_.length) ? U(0) : de(_);
+          return typeof _.length != "number" || ja(_.length) ? U(0) : de(_);
         if (_.type === "Buffer" && Array.isArray(_.data))
           return de(_.data);
       }
       function q(_) {
-        if (_ >= j)
-          throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + j.toString(16) + " bytes");
+        if (_ >= R)
+          throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + R.toString(16) + " bytes");
         return _ | 0;
       }
       function H(_) {
@@ -7948,7 +7976,7 @@ function Tm() {
         for (_ || (_ = "utf8"); ; )
           switch (_) {
             case "hex":
-              return Re(this, f, p);
+              return je(this, f, p);
             case "utf8":
             case "utf-8":
               return ye(this, f, p);
@@ -8003,7 +8031,7 @@ function Tm() {
         return this === f ? !0 : T.compare(this, f) === 0;
       }, T.prototype.inspect = function() {
         let f = "";
-        const p = E.INSPECT_MAX_BYTES;
+        const p = k.INSPECT_MAX_BYTES;
         return f = this.toString("hex", 0, p).replace(/(.{2})/g, "$1 ").trim(), this.length > p && (f += " ... "), "<Buffer " + f + ">";
       }, F && (T.prototype[F] = T.prototype.inspect), T.prototype.compare = function(f, p, B, L, K) {
         if (hr(f, I) && (f = T.from(f, f.offset, f.byteLength)), !T.isBuffer(f))
@@ -8030,7 +8058,7 @@ function Tm() {
       };
       function X(_, f, p, B, L) {
         if (_.length === 0) return -1;
-        if (typeof p == "string" ? (B = p, p = 0) : p > 2147483647 ? p = 2147483647 : p < -2147483648 && (p = -2147483648), p = +p, Ra(p) && (p = L ? 0 : _.length - 1), p < 0 && (p = _.length + p), p >= _.length) {
+        if (typeof p == "string" ? (B = p, p = 0) : p > 2147483647 ? p = 2147483647 : p < -2147483648 && (p = -2147483648), p = +p, ja(p) && (p = L ? 0 : _.length - 1), p < 0 && (p = _.length + p), p >= _.length) {
           if (L) return -1;
           p = _.length - 1;
         } else if (p < 0)
@@ -8088,22 +8116,22 @@ function Tm() {
         let Y;
         for (Y = 0; Y < B; ++Y) {
           const ve = parseInt(f.substr(Y * 2, 2), 16);
-          if (Ra(ve)) return Y;
+          if (ja(ve)) return Y;
           _[p + Y] = ve;
         }
         return Y;
       }
       function ne(_, f, p, B) {
-        return Rn(Te(f, _.length - p), _, p, B);
+        return jn(Te(f, _.length - p), _, p, B);
       }
       function se(_, f, p, B) {
-        return Rn(ze(f), _, p, B);
+        return jn(ze(f), _, p, B);
       }
       function ce(_, f, p, B) {
-        return Rn(Ae(f), _, p, B);
+        return jn(Ae(f), _, p, B);
       }
       function le(_, f, p, B) {
-        return Rn(Pe(f, _.length - p), _, p, B);
+        return jn(Pe(f, _.length - p), _, p, B);
       }
       T.prototype.write = function(f, p, B, L) {
         if (p === void 0)
@@ -8206,7 +8234,7 @@ function Tm() {
           B += String.fromCharCode(_[L]);
         return B;
       }
-      function Re(_, f, p) {
+      function je(_, f, p) {
         const B = _.length;
         (!f || f < 0) && (f = 0), (!p || p < 0 || p > B) && (p = B);
         let L = "";
@@ -8612,7 +8640,7 @@ function Tm() {
       function Ae(_) {
         return x.toByteArray(be(_));
       }
-      function Rn(_, f, p, B) {
+      function jn(_, f, p, B) {
         let L;
         for (L = 0; L < B && !(L + p >= f.length || L >= _.length); ++L)
           f[L + p] = _[L];
@@ -8621,7 +8649,7 @@ function Tm() {
       function hr(_, f) {
         return _ instanceof f || _ != null && _.constructor != null && _.constructor.name != null && _.constructor.name === f.name;
       }
-      function Ra(_) {
+      function ja(_) {
         return _ !== _;
       }
       const eh = (function() {
@@ -8676,10 +8704,10 @@ function Sr() {
     };
   })(Zn, Zn.exports)), Zn.exports;
 }
-var uo, Ru;
+var uo, ju;
 function zm() {
-  if (Ru) return uo;
-  Ru = 1;
+  if (ju) return uo;
+  ju = 1;
   var e = Sr().Buffer;
   function t(r) {
     if (r.length >= 255)
@@ -8698,50 +8726,50 @@ function zm() {
         throw new TypeError("Expected Buffer");
       if (y.length === 0)
         return "";
-      for (var m = 0, A = 0, E = 0, x = y.length; E !== x && y[E] === 0; )
-        E++, m++;
-      for (var z = (x - E) * w + 1 >>> 0, F = new Uint8Array(z); E !== x; ) {
-        for (var j = y[E], I = 0, N = z - 1; (j !== 0 || I < A) && N !== -1; N--, I++)
-          j += 256 * F[N] >>> 0, F[N] = j % h >>> 0, j = j / h >>> 0;
-        if (j !== 0)
+      for (var m = 0, A = 0, k = 0, x = y.length; k !== x && y[k] === 0; )
+        k++, m++;
+      for (var z = (x - k) * w + 1 >>> 0, F = new Uint8Array(z); k !== x; ) {
+        for (var R = y[k], I = 0, N = z - 1; (R !== 0 || I < A) && N !== -1; N--, I++)
+          R += 256 * F[N] >>> 0, F[N] = R % h >>> 0, R = R / h >>> 0;
+        if (R !== 0)
           throw new Error("Non-zero carry");
-        A = I, E++;
+        A = I, k++;
       }
       for (var O = z - A; O !== z && F[O] === 0; )
         O++;
-      for (var R = l.repeat(m); O < z; ++O)
-        R += r.charAt(F[O]);
-      return R;
+      for (var j = l.repeat(m); O < z; ++O)
+        j += r.charAt(F[O]);
+      return j;
     }
     function v(y) {
       if (typeof y != "string")
         throw new TypeError("Expected String");
       if (y.length === 0)
         return e.alloc(0);
-      for (var m = 0, A = 0, E = 0; y[m] === l; )
+      for (var m = 0, A = 0, k = 0; y[m] === l; )
         A++, m++;
       for (var x = (y.length - m) * c + 1 >>> 0, z = new Uint8Array(x); m < y.length; ) {
         var F = y.charCodeAt(m);
         if (F > 255)
           return;
-        var j = n[F];
-        if (j === 255)
+        var R = n[F];
+        if (R === 255)
           return;
-        for (var I = 0, N = x - 1; (j !== 0 || I < E) && N !== -1; N--, I++)
-          j += h * z[N] >>> 0, z[N] = j % 256 >>> 0, j = j / 256 >>> 0;
-        if (j !== 0)
+        for (var I = 0, N = x - 1; (R !== 0 || I < k) && N !== -1; N--, I++)
+          R += h * z[N] >>> 0, z[N] = R % 256 >>> 0, R = R / 256 >>> 0;
+        if (R !== 0)
           throw new Error("Non-zero carry");
-        E = I, m++;
+        k = I, m++;
       }
-      for (var O = x - E; O !== x && z[O] === 0; )
+      for (var O = x - k; O !== x && z[O] === 0; )
         O++;
-      var R = e.allocUnsafe(A + (x - O));
-      R.fill(0, 0, A);
+      var j = e.allocUnsafe(A + (x - O));
+      j.fill(0, 0, A);
       for (var U = A; O !== x; )
-        R[U++] = z[O++];
-      return R;
+        j[U++] = z[O++];
+      return j;
     }
-    function k(y) {
+    function E(y) {
       var m = v(y);
       if (m)
         return m;
@@ -8750,20 +8778,20 @@ function zm() {
     return {
       encode: g,
       decodeUnsafe: v,
-      decode: k
+      decode: E
     };
   }
   return uo = t, uo;
 }
-var lo, ju;
+var lo, Ru;
 function Om() {
-  if (ju) return lo;
-  ju = 1;
+  if (Ru) return lo;
+  Ru = 1;
   var e = zm(), t = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
   return lo = e(t), lo;
 }
 var fo, Pu;
-function Rm() {
+function jm() {
   if (Pu) return fo;
   Pu = 1;
   var e = Om(), t = Sr().Buffer;
@@ -8798,10 +8826,10 @@ function Rm() {
   }, fo;
 }
 var ho, Uu;
-function jm() {
+function Rm() {
   if (Uu) return ho;
   Uu = 1;
-  var e = Bm(), t = Rm();
+  var e = Bm(), t = jm();
   function r(n) {
     var o = e("sha256").update(n).digest();
     return e("sha256").update(o).digest();
@@ -8812,7 +8840,7 @@ var po, Nu;
 function Pm() {
   if (Nu) return po;
   Nu = 1;
-  var e = jm();
+  var e = Rm();
   function t(a, s) {
     if (s !== void 0 && a[0] !== s) throw new Error("Invalid network version");
     if (a.length === 33)
@@ -9073,16 +9101,16 @@ function Nm() {
     function c(y, m) {
       if (t.typeforce(t.Buffer256bit, y), !h.isPrivate(y))
         throw new TypeError("Private key not in range [1, n)");
-      return t.typeforce(a, m), new k(y, void 0, m);
+      return t.typeforce(a, m), new E(y, void 0, m);
     }
     function w(y, m) {
-      return t.typeforce(h.isPoint, y), t.typeforce(a, m), new k(void 0, y, m);
+      return t.typeforce(h.isPoint, y), t.typeforce(a, m), new E(void 0, y, m);
     }
     function g(y, m) {
-      const A = n.decode(y), E = A.version;
+      const A = n.decode(y), k = A.version;
       if (t.Array(m)) {
-        if (m = m.filter((x) => E === x.wif).pop(), !m) throw new Error("Unknown network version");
-      } else if (m = m || e.bitcoin, E !== m.wif) throw new Error("Invalid network version");
+        if (m = m.filter((x) => k === x.wif).pop(), !m) throw new Error("Unknown network version");
+      } else if (m = m || e.bitcoin, k !== m.wif) throw new Error("Invalid network version");
       return c(A.privateKey, {
         compressed: A.compressed,
         network: m
@@ -9097,14 +9125,14 @@ function Nm() {
       while (!h.isPrivate(A));
       return c(A, y);
     }
-    class k {
+    class E {
       __D;
       __Q;
       compressed;
       network;
       lowR;
-      constructor(m, A, E) {
-        this.__D = m, this.__Q = A, this.lowR = !1, E === void 0 && (E = {}), this.compressed = E.compressed === void 0 ? !0 : E.compressed, this.network = E.network || e.bitcoin, A !== void 0 && (this.__Q = J.from(h.pointCompress(A, this.compressed)));
+      constructor(m, A, k) {
+        this.__D = m, this.__Q = A, this.lowR = !1, k === void 0 && (k = {}), this.compressed = k.compressed === void 0 ? !0 : k.compressed, this.network = k.network || e.bitcoin, A !== void 0 && (this.__Q = J.from(h.pointCompress(A, this.compressed)));
       }
       get privateKey() {
         return this.__D;
@@ -9128,12 +9156,12 @@ function Nm() {
         if (A === void 0 && (A = this.lowR), A === !1)
           return J.from(h.sign(m, this.__D));
         {
-          let E = h.sign(m, this.__D);
+          let k = h.sign(m, this.__D);
           const x = J.alloc(32, 0);
           let z = 0;
-          for (; E[0] > 127; )
-            z++, x.writeUIntLE(z, 0, 6), E = h.sign(m, this.__D, x);
-          return J.from(E);
+          for (; k[0] > 127; )
+            z++, x.writeUIntLE(z, 0, 6), k = h.sign(m, this.__D, x);
+          return J.from(k);
         }
       }
       signSchnorr(m) {
@@ -9151,19 +9179,19 @@ function Nm() {
         return h.verifySchnorr(m, this.publicKey.subarray(1, 33), A);
       }
       tweakFromPublicKey(m) {
-        const A = s(this.publicKey), E = h.xOnlyPointAddTweak(A, m);
-        if (!E || E.xOnlyPubkey === null)
+        const A = s(this.publicKey), k = h.xOnlyPointAddTweak(A, m);
+        if (!k || k.xOnlyPubkey === null)
           throw new Error("Cannot tweak public key!");
         const x = J.from([
-          E.parity === 0 ? 2 : 3
+          k.parity === 0 ? 2 : 3
         ]);
         return w(
-          J.concat([x, E.xOnlyPubkey]),
+          J.concat([x, k.xOnlyPubkey]),
           { network: this.network, compressed: this.compressed }
         );
       }
       tweakFromPrivateKey(m) {
-        const E = this.publicKey[0] === 3 || this.publicKey[0] === 4 && (this.publicKey[64] & 1) === 1 ? h.privateNegate(this.privateKey) : this.privateKey, x = h.privateAdd(E, m);
+        const k = this.publicKey[0] === 3 || this.publicKey[0] === 4 && (this.publicKey[64] & 1) === 1 ? h.privateNegate(this.privateKey) : this.privateKey, x = h.privateAdd(k, m);
         if (!x) throw new Error("Invalid tweaked private key!");
         return c(J.from(x), {
           network: this.network,
@@ -9627,48 +9655,48 @@ Please pass a 2048 word array explicitly.`;
   function c(O) {
     return (O || "").normalize("NFKD");
   }
-  function w(O, R, U) {
+  function w(O, j, U) {
     for (; O.length < U; )
-      O = R + O;
+      O = j + O;
     return O;
   }
   function g(O) {
     return parseInt(O, 2);
   }
   function v(O) {
-    return O.map((R) => w(R.toString(2), "0", 8)).join("");
+    return O.map((j) => w(j.toString(2), "0", 8)).join("");
   }
-  function k(O) {
+  function E(O) {
     const U = O.length * 8 / 32, T = e.sha256(Uint8Array.from(O));
     return v(Array.from(T)).slice(0, U);
   }
   function y(O) {
     return "mnemonic" + (O || "");
   }
-  function m(O, R) {
-    const U = Uint8Array.from(J.from(c(O), "utf8")), T = Uint8Array.from(J.from(y(c(R)), "utf8")), Z = r.pbkdf2(t.sha512, U, T, {
+  function m(O, j) {
+    const U = Uint8Array.from(J.from(c(O), "utf8")), T = Uint8Array.from(J.from(y(c(j)), "utf8")), Z = r.pbkdf2(t.sha512, U, T, {
       c: 2048,
       dkLen: 64
     });
     return J.from(Z);
   }
   ir.mnemonicToSeedSync = m;
-  function A(O, R) {
-    const U = Uint8Array.from(J.from(c(O), "utf8")), T = Uint8Array.from(J.from(y(c(R)), "utf8"));
+  function A(O, j) {
+    const U = Uint8Array.from(J.from(c(O), "utf8")), T = Uint8Array.from(J.from(y(c(j)), "utf8"));
     return r.pbkdf2Async(t.sha512, U, T, {
       c: 2048,
       dkLen: 64
     }).then((Z) => J.from(Z));
   }
   ir.mnemonicToSeed = A;
-  function E(O, R) {
-    if (R = R || a, !R)
+  function k(O, j) {
+    if (j = j || a, !j)
       throw new Error(l);
     const U = c(O).split(" ");
     if (U.length % 3 !== 0)
       throw new Error(s);
     const T = U.map((me) => {
-      const Se = R.indexOf(me);
+      const Se = j.indexOf(me);
       if (Se === -1)
         throw new Error(s);
       return w(Se.toString(2), "0", 11);
@@ -9680,13 +9708,13 @@ Please pass a 2048 word array explicitly.`;
     if (ue.length % 4 !== 0)
       throw new Error(i);
     const ie = J.from(ue);
-    if (k(ie) !== oe)
+    if (E(ie) !== oe)
       throw new Error(h);
     return ie.toString("hex");
   }
-  ir.mnemonicToEntropy = E;
-  function x(O, R) {
-    if (J.isBuffer(O) || (O = J.from(O, "hex")), R = R || a, !R)
+  ir.mnemonicToEntropy = k;
+  function x(O, j) {
+    if (J.isBuffer(O) || (O = J.from(O, "hex")), j = j || a, !j)
       throw new Error(l);
     if (O.length < 16)
       throw new TypeError(i);
@@ -9694,40 +9722,40 @@ Please pass a 2048 word array explicitly.`;
       throw new TypeError(i);
     if (O.length % 4 !== 0)
       throw new TypeError(i);
-    const U = v(Array.from(O)), T = k(O), oe = (U + T).match(/(.{1,11})/g).map((ue) => {
+    const U = v(Array.from(O)), T = E(O), oe = (U + T).match(/(.{1,11})/g).map((ue) => {
       const ie = g(ue);
-      return R[ie];
+      return j[ie];
     });
-    return R[0] === "あいこくしん" ? oe.join("　") : oe.join(" ");
+    return j[0] === "あいこくしん" ? oe.join("　") : oe.join(" ");
   }
   ir.entropyToMnemonic = x;
-  function z(O, R, U) {
+  function z(O, j, U) {
     if (O = O || 128, O % 32 !== 0)
       throw new TypeError(i);
-    return R = R || ((T) => J.from(n.randomBytes(T))), x(R(O / 8), U);
+    return j = j || ((T) => J.from(n.randomBytes(T))), x(j(O / 8), U);
   }
   ir.generateMnemonic = z;
-  function F(O, R) {
+  function F(O, j) {
     try {
-      E(O, R);
+      k(O, j);
     } catch {
       return !1;
     }
     return !0;
   }
   ir.validateMnemonic = F;
-  function j(O) {
-    const R = o.wordlists[O];
-    if (R)
-      a = R;
+  function R(O) {
+    const j = o.wordlists[O];
+    if (j)
+      a = j;
     else
       throw new Error('Could not find wordlist for language "' + O + '"');
   }
-  ir.setDefaultWordlist = j;
+  ir.setDefaultWordlist = R;
   function I() {
     if (!a)
       throw new Error("No Default Wordlist set");
-    return Object.keys(o.wordlists).filter((O) => O === "JA" || O === "EN" ? !1 : o.wordlists[O].every((R, U) => R === a[U]))[0];
+    return Object.keys(o.wordlists).filter((O) => O === "JA" || O === "EN" ? !1 : o.wordlists[O].every((j, U) => j === a[U]))[0];
   }
   ir.getDefaultWordlist = I;
   var N = Yu();
@@ -9932,13 +9960,13 @@ var Oo, ll;
 function yy() {
   return ll || (ll = 1, Oo = Math.max), Oo;
 }
-var Ro, fl;
+var jo, fl;
 function vy() {
-  return fl || (fl = 1, Ro = Math.min), Ro;
+  return fl || (fl = 1, jo = Math.min), jo;
 }
-var jo, dl;
+var Ro, dl;
 function wy() {
-  return dl || (dl = 1, jo = Math.pow), jo;
+  return dl || (dl = 1, Ro = Math.pow), Ro;
 }
 var Po, hl;
 function _y() {
@@ -10044,9 +10072,9 @@ function Sy() {
         h,
         o(c, arguments)
       );
-    }, v = r(0, l.length - c.length), k = [], y = 0; y < v; y++)
-      k[y] = "$" + y;
-    if (w = Function("binder", "return function (" + s(k, ",") + "){ return binder.apply(this,arguments); }")(g), l.prototype) {
+    }, v = r(0, l.length - c.length), E = [], y = 0; y < v; y++)
+      E[y] = "$" + y;
+    if (w = Function("binder", "return function (" + s(E, ",") + "){ return binder.apply(this,arguments); }")(g), l.prototype) {
       var m = function() {
       };
       m.prototype = l.prototype, w.prototype = new m(), m.prototype = null;
@@ -10116,7 +10144,7 @@ function By() {
   ) : !1, Yo;
 }
 var Xo, zl;
-function Rs() {
+function js() {
   if (zl) return Xo;
   zl = 1;
   var e = $d(), t = Gd(), r = /* @__PURE__ */ By();
@@ -10137,33 +10165,33 @@ function Vd() {
   var e = Function.prototype.call, t = Object.prototype.hasOwnProperty, r = On();
   return Jo = r.call(e, t), Jo;
 }
-var Qo, Rl;
+var Qo, jl;
 function Zd() {
-  if (Rl) return Qo;
-  Rl = 1;
-  var e, t = /* @__PURE__ */ Kd(), r = /* @__PURE__ */ fy(), n = /* @__PURE__ */ dy(), o = /* @__PURE__ */ hy(), a = /* @__PURE__ */ py(), s = /* @__PURE__ */ Hd(), i = /* @__PURE__ */ Gt(), h = /* @__PURE__ */ gy(), l = /* @__PURE__ */ by(), c = /* @__PURE__ */ my(), w = /* @__PURE__ */ yy(), g = /* @__PURE__ */ vy(), v = /* @__PURE__ */ wy(), k = /* @__PURE__ */ _y(), y = /* @__PURE__ */ Ey(), m = Function, A = function(ee) {
+  if (jl) return Qo;
+  jl = 1;
+  var e, t = /* @__PURE__ */ Kd(), r = /* @__PURE__ */ fy(), n = /* @__PURE__ */ dy(), o = /* @__PURE__ */ hy(), a = /* @__PURE__ */ py(), s = /* @__PURE__ */ Hd(), i = /* @__PURE__ */ Gt(), h = /* @__PURE__ */ gy(), l = /* @__PURE__ */ by(), c = /* @__PURE__ */ my(), w = /* @__PURE__ */ yy(), g = /* @__PURE__ */ vy(), v = /* @__PURE__ */ wy(), E = /* @__PURE__ */ _y(), y = /* @__PURE__ */ Ey(), m = Function, A = function(ee) {
     try {
       return m('"use strict"; return (' + ee + ").constructor;")();
     } catch {
     }
-  }, E = /* @__PURE__ */ Wt(), x = /* @__PURE__ */ Oa(), z = function() {
+  }, k = /* @__PURE__ */ Wt(), x = /* @__PURE__ */ Oa(), z = function() {
     throw new i();
-  }, F = E ? (function() {
+  }, F = k ? (function() {
     try {
       return arguments.callee, z;
     } catch {
       try {
-        return E(arguments, "callee").get;
+        return k(arguments, "callee").get;
       } catch {
         return z;
       }
     }
-  })() : z, j = Ay()(), I = Rs(), N = Gd(), O = $d(), R = zs(), U = Ts(), T = {}, Z = typeof Uint8Array > "u" || !I ? e : I(Uint8Array), re = {
+  })() : z, R = Ay()(), I = js(), N = Gd(), O = $d(), j = zs(), U = Ts(), T = {}, Z = typeof Uint8Array > "u" || !I ? e : I(Uint8Array), re = {
     __proto__: null,
     "%AggregateError%": typeof AggregateError > "u" ? e : AggregateError,
     "%Array%": Array,
     "%ArrayBuffer%": typeof ArrayBuffer > "u" ? e : ArrayBuffer,
-    "%ArrayIteratorPrototype%": j && I ? I([][Symbol.iterator]()) : e,
+    "%ArrayIteratorPrototype%": R && I ? I([][Symbol.iterator]()) : e,
     "%AsyncFromSyncIteratorPrototype%": e,
     "%AsyncFunction%": T,
     "%AsyncGenerator%": T,
@@ -10195,14 +10223,14 @@ function Zd() {
     "%Int32Array%": typeof Int32Array > "u" ? e : Int32Array,
     "%isFinite%": isFinite,
     "%isNaN%": isNaN,
-    "%IteratorPrototype%": j && I ? I(I([][Symbol.iterator]())) : e,
+    "%IteratorPrototype%": R && I ? I(I([][Symbol.iterator]())) : e,
     "%JSON%": typeof JSON == "object" ? JSON : e,
     "%Map%": typeof Map > "u" ? e : Map,
-    "%MapIteratorPrototype%": typeof Map > "u" || !j || !I ? e : I((/* @__PURE__ */ new Map())[Symbol.iterator]()),
+    "%MapIteratorPrototype%": typeof Map > "u" || !R || !I ? e : I((/* @__PURE__ */ new Map())[Symbol.iterator]()),
     "%Math%": Math,
     "%Number%": Number,
     "%Object%": t,
-    "%Object.getOwnPropertyDescriptor%": E,
+    "%Object.getOwnPropertyDescriptor%": k,
     "%parseFloat%": parseFloat,
     "%parseInt%": parseInt,
     "%Promise%": typeof Promise > "u" ? e : Promise,
@@ -10212,11 +10240,11 @@ function Zd() {
     "%Reflect%": typeof Reflect > "u" ? e : Reflect,
     "%RegExp%": RegExp,
     "%Set%": typeof Set > "u" ? e : Set,
-    "%SetIteratorPrototype%": typeof Set > "u" || !j || !I ? e : I((/* @__PURE__ */ new Set())[Symbol.iterator]()),
+    "%SetIteratorPrototype%": typeof Set > "u" || !R || !I ? e : I((/* @__PURE__ */ new Set())[Symbol.iterator]()),
     "%SharedArrayBuffer%": typeof SharedArrayBuffer > "u" ? e : SharedArrayBuffer,
     "%String%": String,
-    "%StringIteratorPrototype%": j && I ? I(""[Symbol.iterator]()) : e,
-    "%Symbol%": j ? Symbol : e,
+    "%StringIteratorPrototype%": R && I ? I(""[Symbol.iterator]()) : e,
+    "%Symbol%": R ? Symbol : e,
     "%SyntaxError%": s,
     "%ThrowTypeError%": F,
     "%TypedArray%": Z,
@@ -10230,7 +10258,7 @@ function Zd() {
     "%WeakRef%": typeof WeakRef > "u" ? e : WeakRef,
     "%WeakSet%": typeof WeakSet > "u" ? e : WeakSet,
     "%Function.prototype.call%": U,
-    "%Function.prototype.apply%": R,
+    "%Function.prototype.apply%": j,
     "%Object.defineProperty%": x,
     "%Object.getPrototypeOf%": N,
     "%Math.abs%": l,
@@ -10238,7 +10266,7 @@ function Zd() {
     "%Math.max%": w,
     "%Math.min%": g,
     "%Math.pow%": v,
-    "%Math.round%": k,
+    "%Math.round%": E,
     "%Math.sign%": y,
     "%Reflect.getPrototypeOf%": O
   };
@@ -10318,7 +10346,7 @@ function Zd() {
     "%URIErrorPrototype%": ["URIError", "prototype"],
     "%WeakMapPrototype%": ["WeakMap", "prototype"],
     "%WeakSetPrototype%": ["WeakSet", "prototype"]
-  }, de = On(), me = /* @__PURE__ */ Vd(), Se = de.call(U, Array.prototype.concat), De = de.call(R, Array.prototype.splice), q = de.call(U, String.prototype.replace), H = de.call(U, String.prototype.slice), C = de.call(U, RegExp.prototype.exec), G = /[^%.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|%$))/g, V = /\\(\\)?/g, X = function(ne) {
+  }, de = On(), me = /* @__PURE__ */ Vd(), Se = de.call(U, Array.prototype.concat), De = de.call(j, Array.prototype.splice), q = de.call(U, String.prototype.replace), H = de.call(U, String.prototype.slice), C = de.call(U, RegExp.prototype.exec), G = /[^%.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|%$))/g, V = /\\(\\)?/g, X = function(ne) {
     var se = H(ne, 0, 1), ce = H(ne, -1);
     if (se === "%" && ce !== "%")
       throw new s("invalid intrinsic syntax, expected closing `%`");
@@ -10351,11 +10379,11 @@ function Zd() {
       throw new s("`%` may not be present anywhere but at the beginning and end of the intrinsic name");
     var ce = X(ne), le = ce.length > 0 ? ce[0] : "", he = Q("%" + le + "%", se), ye = he.name, pe = he.value, we = !1, Oe = he.alias;
     Oe && (le = Oe[0], De(ce, Se([0, 1], Oe)));
-    for (var $ = 1, Re = !0; $ < ce.length; $ += 1) {
+    for (var $ = 1, je = !0; $ < ce.length; $ += 1) {
       var ae = ce[$], fe = H(ae, 0, 1), ge = H(ae, -1);
       if ((fe === '"' || fe === "'" || fe === "`" || ge === '"' || ge === "'" || ge === "`") && fe !== ge)
         throw new s("property names with quotes must have matching quotes");
-      if ((ae === "constructor" || !Re) && (we = !0), le += "." + ae, ye = "%" + le + "%", me(re, ye))
+      if ((ae === "constructor" || !je) && (we = !0), le += "." + ae, ye = "%" + le + "%", me(re, ye))
         pe = re[ye];
       else if (pe != null) {
         if (!(ae in pe)) {
@@ -10363,21 +10391,21 @@ function Zd() {
             throw new i("base intrinsic for " + ne + " exists, but the property is not available.");
           return;
         }
-        if (E && $ + 1 >= ce.length) {
-          var xe = E(pe, ae);
-          Re = !!xe, Re && "get" in xe && !("originalValue" in xe.get) ? pe = xe.get : pe = pe[ae];
+        if (k && $ + 1 >= ce.length) {
+          var xe = k(pe, ae);
+          je = !!xe, je && "get" in xe && !("originalValue" in xe.get) ? pe = xe.get : pe = pe[ae];
         } else
-          Re = me(pe, ae), pe = pe[ae];
-        Re && !we && (re[ye] = pe);
+          je = me(pe, ae), pe = pe[ae];
+        je && !we && (re[ye] = pe);
       }
     }
     return pe;
   }, Qo;
 }
-var ei, jl;
+var ei, Rl;
 function Vt() {
-  if (jl) return ei;
-  jl = 1;
+  if (Rl) return ei;
+  Rl = 1;
   var e = /* @__PURE__ */ Zd(), t = Os(), r = t([e("%String.prototype.indexOf%")]);
   return ei = function(o, a) {
     var s = (
@@ -10425,8 +10453,8 @@ function zy() {
           g,
           "lastIndex"
         )
-      ), k = v && r(v, "value");
-      if (!k)
+      ), E = v && r(v, "value");
+      if (!E)
         return !1;
       try {
         a(
@@ -10461,7 +10489,7 @@ function Oy() {
   }, ni;
 }
 var ai, Cl;
-function Ry() {
+function jy() {
   if (Cl) return ai;
   Cl = 1;
   const e = (
@@ -10472,10 +10500,10 @@ function Ry() {
   return ai = () => e, ai;
 }
 var oi, Ll;
-function jy() {
+function Ry() {
   if (Ll) return oi;
   Ll = 1;
-  var e = /* @__PURE__ */ Vt(), t = /* @__PURE__ */ Oy(), r = t(/^\s*(?:function)?\*/), n = za()(), o = Rs(), a = e("Object.prototype.toString"), s = e("Function.prototype.toString"), i = /* @__PURE__ */ Ry();
+  var e = /* @__PURE__ */ Vt(), t = /* @__PURE__ */ Oy(), r = t(/^\s*(?:function)?\*/), n = za()(), o = js(), a = e("Object.prototype.toString"), s = e("Function.prototype.toString"), i = /* @__PURE__ */ jy();
   return oi = function(l) {
     if (typeof l != "function")
       return !1;
@@ -10505,8 +10533,8 @@ function Py() {
       }), n = {}, t(function() {
         throw 42;
       }, null, r);
-    } catch (E) {
-      E !== n && (t = null);
+    } catch (k) {
+      k !== n && (t = null);
     }
   else
     t = null;
@@ -10523,7 +10551,7 @@ function Py() {
     } catch {
       return !1;
     }
-  }, i = Object.prototype.toString, h = "[object Object]", l = "[object Function]", c = "[object GeneratorFunction]", w = "[object HTMLAllCollection]", g = "[object HTML document.all class]", v = "[object HTMLCollection]", k = typeof Symbol == "function" && !!Symbol.toStringTag, y = !(0 in [,]), m = function() {
+  }, i = Object.prototype.toString, h = "[object Object]", l = "[object Function]", c = "[object GeneratorFunction]", w = "[object HTMLAllCollection]", g = "[object HTML document.all class]", v = "[object HTMLCollection]", E = typeof Symbol == "function" && !!Symbol.toStringTag, y = !(0 in [,]), m = function() {
     return !1;
   };
   if (typeof document == "object") {
@@ -10555,7 +10583,7 @@ function Py() {
       return !0;
     if (!x || typeof x != "function" && typeof x != "object")
       return !1;
-    if (k)
+    if (E)
       return s(x);
     if (a(x))
       return !1;
@@ -10721,30 +10749,41 @@ var gi, Vl;
 function Yd() {
   if (Vl) return gi;
   Vl = 1;
-  var e = Uy(), t = /* @__PURE__ */ Cy(), r = Fy(), n = /* @__PURE__ */ Vt(), o = /* @__PURE__ */ Wt(), a = Rs(), s = n("Object.prototype.toString"), i = za()(), h = globalThis, l = t(), c = n("String.prototype.slice"), w = n("Array.prototype.indexOf", !0) || function(m, A) {
-    for (var E = 0; E < m.length; E += 1)
-      if (m[E] === A)
-        return E;
+  var e = Uy(), t = /* @__PURE__ */ Cy(), r = Fy(), n = /* @__PURE__ */ Vt(), o = /* @__PURE__ */ Wt(), a = js(), s = n("Object.prototype.toString"), i = za()(), h = globalThis, l = t(), c = n("String.prototype.slice"), w = n("Array.prototype.indexOf", !0) || function(m, A) {
+    for (var k = 0; k < m.length; k += 1)
+      if (m[k] === A)
+        return k;
     return -1;
   }, g = { __proto__: null };
   i && o && a ? e(l, function(y) {
     var m = new h[y]();
     if (Symbol.toStringTag in m && a) {
-      var A = a(m), E = o(A, Symbol.toStringTag);
-      if (!E && A) {
+      var A = a(m), k = o(A, Symbol.toStringTag);
+      if (!k && A) {
         var x = a(A);
-        E = o(x, Symbol.toStringTag);
+        k = o(x, Symbol.toStringTag);
+      }
+      if (k && k.get) {
+        var z = r(k.get);
+        g[
+          /** @type {`$${import('.').TypedArrayName}`} */
+          "$" + y
+        ] = z;
       }
-      g["$" + y] = r(E.get);
     }
   }) : e(l, function(y) {
     var m = new h[y](), A = m.slice || m.set;
-    A && (g[
-      /** @type {`$${import('.').TypedArrayName}`} */
-      "$" + y
-    ] = /** @type {import('./types').BoundSlice | import('./types').BoundSet} */
-    // @ts-expect-error TODO FIXME
-    r(A));
+    if (A) {
+      var k = (
+        /** @type {import('./types').BoundSlice | import('./types').BoundSet} */
+        // @ts-expect-error TODO FIXME
+        r(A)
+      );
+      g[
+        /** @type {`$${import('.').TypedArrayName}`} */
+        "$" + y
+      ] = k;
+    }
   });
   var v = function(m) {
     var A = !1;
@@ -10752,25 +10791,25 @@ function Yd() {
       /** @type {Record<`\$${import('.').TypedArrayName}`, Getter>} */
       g,
       /** @type {(getter: Getter, name: `\$${import('.').TypedArrayName}`) => void} */
-      function(E, x) {
+      function(k, x) {
         if (!A)
           try {
-            "$" + E(m) === x && (A = /** @type {import('.').TypedArrayName} */
+            "$" + k(m) === x && (A = /** @type {import('.').TypedArrayName} */
             c(x, 1));
           } catch {
           }
       }
     ), A;
-  }, k = function(m) {
+  }, E = function(m) {
     var A = !1;
     return e(
       /** @type {Record<`\$${import('.').TypedArrayName}`, Getter>} */
       g,
       /** @type {(getter: Getter, name: `\$${import('.').TypedArrayName}`) => void} */
-      function(E, x) {
+      function(k, x) {
         if (!A)
           try {
-            E(m), A = /** @type {import('.').TypedArrayName} */
+            k(m), A = /** @type {import('.').TypedArrayName} */
             c(x, 1);
           } catch {
           }
@@ -10782,7 +10821,7 @@ function Yd() {
       return !1;
     if (!i) {
       var A = c(s(m), 8, -1);
-      return w(l, A) > -1 ? A : A !== "Object" ? !1 : k(m);
+      return w(l, A) > -1 ? A : A !== "Object" ? !1 : E(m);
     }
     return o ? v(m) : null;
   }, gi;
@@ -10799,7 +10838,7 @@ function Xd() {
 var Yl;
 function Ky() {
   return Yl || (Yl = 1, (function(e) {
-    var t = /* @__PURE__ */ Ty(), r = jy(), n = /* @__PURE__ */ Yd(), o = /* @__PURE__ */ Xd();
+    var t = /* @__PURE__ */ Ty(), r = Ry(), n = /* @__PURE__ */ Yd(), o = /* @__PURE__ */ Xd();
     function a($) {
       return $.call.bind($);
     }
@@ -10808,11 +10847,11 @@ function Ky() {
       var g = a(BigInt.prototype.valueOf);
     if (i)
       var v = a(Symbol.prototype.valueOf);
-    function k($, Re) {
+    function E($, je) {
       if (typeof $ != "object")
         return !1;
       try {
-        return Re($), !0;
+        return je($), !0;
       } catch {
         return !1;
       }
@@ -10830,10 +10869,10 @@ function Ky() {
       return n($) === "Uint8Array";
     }
     e.isUint8Array = A;
-    function E($) {
+    function k($) {
       return n($) === "Uint8ClampedArray";
     }
-    e.isUint8ClampedArray = E;
+    e.isUint8ClampedArray = k;
     function x($) {
       return n($) === "Uint16Array";
     }
@@ -10846,10 +10885,10 @@ function Ky() {
       return n($) === "Int8Array";
     }
     e.isInt8Array = F;
-    function j($) {
+    function R($) {
       return n($) === "Int16Array";
     }
-    e.isInt16Array = j;
+    e.isInt16Array = R;
     function I($) {
       return n($) === "Int32Array";
     }
@@ -10862,10 +10901,10 @@ function Ky() {
       return n($) === "Float64Array";
     }
     e.isFloat64Array = O;
-    function R($) {
+    function j($) {
       return n($) === "BigInt64Array";
     }
-    e.isBigInt64Array = R;
+    e.isBigInt64Array = j;
     function U($) {
       return n($) === "BigUint64Array";
     }
@@ -10947,23 +10986,23 @@ function Ky() {
     }
     e.isWebAssemblyCompiledModule = se;
     function ce($) {
-      return k($, l);
+      return E($, l);
     }
     e.isNumberObject = ce;
     function le($) {
-      return k($, c);
+      return E($, c);
     }
     e.isStringObject = le;
     function he($) {
-      return k($, w);
+      return E($, w);
     }
     e.isBooleanObject = he;
     function ye($) {
-      return s && k($, g);
+      return s && E($, g);
     }
     e.isBigIntObject = ye;
     function pe($) {
-      return i && k($, v);
+      return i && E($, v);
     }
     e.isSymbolObject = pe;
     function we($) {
@@ -11021,7 +11060,7 @@ function $y() {
             return ee;
         }
       }), Q = G[C]; C < V; Q = G[++C])
-        E(Q) || !O(Q) ? X += " " + Q : X += " " + s(Q);
+        k(Q) || !O(Q) ? X += " " + Q : X += " " + s(Q);
       return X;
     }, e.deprecate = function(q, H) {
       if (typeof yr < "u" && yr.noDeprecation === !0)
@@ -11124,7 +11163,7 @@ function $y() {
         }
         if (N(H))
           return q.stylize(RegExp.prototype.toString.call(H), "regexp");
-        if (R(H))
+        if (j(H))
           return q.stylize(Date.prototype.toString.call(H), "date");
         if (U(H))
           return g(H);
@@ -11134,14 +11173,14 @@ function $y() {
         var le = H.name ? ": " + H.name : "";
         ne = " [Function" + le + "]";
       }
-      if (N(H) && (ne = " " + RegExp.prototype.toString.call(H)), R(H) && (ne = " " + Date.prototype.toUTCString.call(H)), U(H) && (ne = " " + g(H)), X.length === 0 && (!se || H.length == 0))
+      if (N(H) && (ne = " " + RegExp.prototype.toString.call(H)), j(H) && (ne = " " + Date.prototype.toUTCString.call(H)), U(H) && (ne = " " + g(H)), X.length === 0 && (!se || H.length == 0))
         return ce[0] + ne + ce[1];
       if (C < 0)
         return N(H) ? q.stylize(RegExp.prototype.toString.call(H), "regexp") : q.stylize("[Object]", "special");
       q.seen.push(H);
       var he;
       return se ? he = v(q, H, C, Q, X) : he = X.map(function(ye) {
-        return k(q, H, C, Q, ye, se);
+        return E(q, H, C, Q, ye, se);
       }), q.seen.pop(), y(he, ne, ce);
     }
     function w(q, H) {
@@ -11155,7 +11194,7 @@ function $y() {
         return q.stylize("" + H, "number");
       if (A(H))
         return q.stylize("" + H, "boolean");
-      if (E(H))
+      if (k(H))
         return q.stylize("null", "null");
     }
     function g(q) {
@@ -11163,7 +11202,7 @@ function $y() {
     }
     function v(q, H, C, G, V) {
       for (var X = [], Q = 0, ee = H.length; Q < ee; ++Q)
-        de(H, String(Q)) ? X.push(k(
+        de(H, String(Q)) ? X.push(E(
           q,
           H,
           C,
@@ -11172,7 +11211,7 @@ function $y() {
           !0
         )) : X.push("");
       return V.forEach(function(ne) {
-        ne.match(/^\d+$/) || X.push(k(
+        ne.match(/^\d+$/) || X.push(E(
           q,
           H,
           C,
@@ -11182,9 +11221,9 @@ function $y() {
         ));
       }), X;
     }
-    function k(q, H, C, G, V, X) {
+    function E(q, H, C, G, V, X) {
       var Q, ee, ne;
-      if (ne = Object.getOwnPropertyDescriptor(H, V) || { value: H[V] }, ne.get ? ne.set ? ee = q.stylize("[Getter/Setter]", "special") : ee = q.stylize("[Getter]", "special") : ne.set && (ee = q.stylize("[Setter]", "special")), de(G, V) || (Q = "[" + V + "]"), ee || (q.seen.indexOf(ne.value) < 0 ? (E(C) ? ee = c(q, ne.value, null) : ee = c(q, ne.value, C - 1), ee.indexOf(`
+      if (ne = Object.getOwnPropertyDescriptor(H, V) || { value: H[V] }, ne.get ? ne.set ? ee = q.stylize("[Getter/Setter]", "special") : ee = q.stylize("[Getter]", "special") : ne.set && (ee = q.stylize("[Setter]", "special")), de(G, V) || (Q = "[" + V + "]"), ee || (q.seen.indexOf(ne.value) < 0 ? (k(C) ? ee = c(q, ne.value, null) : ee = c(q, ne.value, C - 1), ee.indexOf(`
 `) > -1 && (X ? ee = ee.split(`
 `).map(function(se) {
         return "  " + se;
@@ -11219,10 +11258,10 @@ function $y() {
       return typeof q == "boolean";
     }
     e.isBoolean = A;
-    function E(q) {
+    function k(q) {
       return q === null;
     }
-    e.isNull = E;
+    e.isNull = k;
     function x(q) {
       return q == null;
     }
@@ -11235,10 +11274,10 @@ function $y() {
       return typeof q == "string";
     }
     e.isString = F;
-    function j(q) {
+    function R(q) {
       return typeof q == "symbol";
     }
-    e.isSymbol = j;
+    e.isSymbol = R;
     function I(q) {
       return q === void 0;
     }
@@ -11251,10 +11290,10 @@ function $y() {
       return typeof q == "object" && q !== null;
     }
     e.isObject = O;
-    function R(q) {
+    function j(q) {
       return O(q) && re(q) === "[object Date]";
     }
-    e.isDate = R, e.types.isDate = R;
+    e.isDate = j, e.types.isDate = j;
     function U(q) {
       return O(q) && (re(q) === "[object Error]" || q instanceof Error);
     }
@@ -11468,8 +11507,8 @@ function Zy() {
       return e.from(h);
     var v = t(h);
     if (v)
-      for (var k = 0; k < h.length; k += 1) {
-        var y = h[k];
+      for (var E = 0; E < h.length; E += 1) {
+        var y = h[E];
         if (typeof y != "number" || y < 0 || y > 255 || ~~y !== y)
           throw new RangeError("Array items must be numbers in the range 0-255.");
       }
@@ -11537,15 +11576,15 @@ function Yy() {
     return l === 0 ? c & w | ~c & g : l === 2 ? c & w | c & g | w & g : c ^ w ^ g;
   }
   return a.prototype._update = function(l) {
-    for (var c = this._w, w = this._a | 0, g = this._b | 0, v = this._c | 0, k = this._d | 0, y = this._e | 0, m = 0; m < 16; ++m)
+    for (var c = this._w, w = this._a | 0, g = this._b | 0, v = this._c | 0, E = this._d | 0, y = this._e | 0, m = 0; m < 16; ++m)
       c[m] = l.readInt32BE(m * 4);
     for (; m < 80; ++m)
       c[m] = c[m - 3] ^ c[m - 8] ^ c[m - 14] ^ c[m - 16];
     for (var A = 0; A < 80; ++A) {
-      var E = ~~(A / 20), x = s(w) + h(E, g, v, k) + y + c[A] + n[E] | 0;
-      y = k, k = v, v = i(g), g = w, w = x;
+      var k = ~~(A / 20), x = s(w) + h(k, g, v, E) + y + c[A] + n[k] | 0;
+      y = E, E = v, v = i(g), g = w, w = x;
     }
-    this._a = w + this._a | 0, this._b = g + this._b | 0, this._c = v + this._c | 0, this._d = k + this._d | 0, this._e = y + this._e | 0;
+    this._a = w + this._a | 0, this._b = g + this._b | 0, this._c = v + this._c | 0, this._d = E + this._d | 0, this._e = y + this._e | 0;
   }, a.prototype._hash = function() {
     var l = r.allocUnsafe(20);
     return l.writeInt32BE(this._a | 0, 0), l.writeInt32BE(this._b | 0, 4), l.writeInt32BE(this._c | 0, 8), l.writeInt32BE(this._d | 0, 12), l.writeInt32BE(this._e | 0, 16), l;
@@ -11580,15 +11619,15 @@ function Xy() {
     return c === 0 ? w & g | ~w & v : c === 2 ? w & g | w & v | g & v : w ^ g ^ v;
   }
   return a.prototype._update = function(c) {
-    for (var w = this._w, g = this._a | 0, v = this._b | 0, k = this._c | 0, y = this._d | 0, m = this._e | 0, A = 0; A < 16; ++A)
+    for (var w = this._w, g = this._a | 0, v = this._b | 0, E = this._c | 0, y = this._d | 0, m = this._e | 0, A = 0; A < 16; ++A)
       w[A] = c.readInt32BE(A * 4);
     for (; A < 80; ++A)
       w[A] = s(w[A - 3] ^ w[A - 8] ^ w[A - 14] ^ w[A - 16]);
-    for (var E = 0; E < 80; ++E) {
-      var x = ~~(E / 20), z = i(g) + l(x, v, k, y) + m + w[E] + n[x] | 0;
-      m = y, y = k, k = h(v), v = g, g = z;
+    for (var k = 0; k < 80; ++k) {
+      var x = ~~(k / 20), z = i(g) + l(x, v, E, y) + m + w[k] + n[x] | 0;
+      m = y, y = E, E = h(v), v = g, g = z;
     }
-    this._a = g + this._a | 0, this._b = v + this._b | 0, this._c = k + this._c | 0, this._d = y + this._d | 0, this._e = m + this._e | 0;
+    this._a = g + this._a | 0, this._b = v + this._b | 0, this._c = E + this._c | 0, this._d = y + this._d | 0, this._e = m + this._e | 0;
   }, a.prototype._hash = function() {
     var c = r.allocUnsafe(20);
     return c.writeInt32BE(this._a | 0, 0), c.writeInt32BE(this._b | 0, 4), c.writeInt32BE(this._c | 0, 8), c.writeInt32BE(this._d | 0, 12), c.writeInt32BE(this._e | 0, 16), c;
@@ -11670,11 +11709,11 @@ function Jd() {
   e(a, t), a.prototype.init = function() {
     return this._a = 1779033703, this._b = 3144134277, this._c = 1013904242, this._d = 2773480762, this._e = 1359893119, this._f = 2600822924, this._g = 528734635, this._h = 1541459225, this;
   };
-  function s(g, v, k) {
-    return k ^ g & (v ^ k);
+  function s(g, v, E) {
+    return E ^ g & (v ^ E);
   }
-  function i(g, v, k) {
-    return g & v | k & (g | v);
+  function i(g, v, E) {
+    return g & v | E & (g | v);
   }
   function h(g) {
     return (g >>> 2 | g << 30) ^ (g >>> 13 | g << 19) ^ (g >>> 22 | g << 10);
@@ -11689,15 +11728,15 @@ function Jd() {
     return (g >>> 17 | g << 15) ^ (g >>> 19 | g << 13) ^ g >>> 10;
   }
   return a.prototype._update = function(g) {
-    for (var v = this._w, k = this._a | 0, y = this._b | 0, m = this._c | 0, A = this._d | 0, E = this._e | 0, x = this._f | 0, z = this._g | 0, F = this._h | 0, j = 0; j < 16; ++j)
-      v[j] = g.readInt32BE(j * 4);
-    for (; j < 64; ++j)
-      v[j] = w(v[j - 2]) + v[j - 7] + c(v[j - 15]) + v[j - 16] | 0;
+    for (var v = this._w, E = this._a | 0, y = this._b | 0, m = this._c | 0, A = this._d | 0, k = this._e | 0, x = this._f | 0, z = this._g | 0, F = this._h | 0, R = 0; R < 16; ++R)
+      v[R] = g.readInt32BE(R * 4);
+    for (; R < 64; ++R)
+      v[R] = w(v[R - 2]) + v[R - 7] + c(v[R - 15]) + v[R - 16] | 0;
     for (var I = 0; I < 64; ++I) {
-      var N = F + l(E) + s(E, x, z) + n[I] + v[I] | 0, O = h(k) + i(k, y, m) | 0;
-      F = z, z = x, x = E, E = A + N | 0, A = m, m = y, y = k, k = N + O | 0;
+      var N = F + l(k) + s(k, x, z) + n[I] + v[I] | 0, O = h(E) + i(E, y, m) | 0;
+      F = z, z = x, x = k, k = A + N | 0, A = m, m = y, y = E, E = N + O | 0;
     }
-    this._a = k + this._a | 0, this._b = y + this._b | 0, this._c = m + this._c | 0, this._d = A + this._d | 0, this._e = E + this._e | 0, this._f = x + this._f | 0, this._g = z + this._g | 0, this._h = F + this._h | 0;
+    this._a = E + this._a | 0, this._b = y + this._b | 0, this._c = m + this._c | 0, this._d = A + this._d | 0, this._e = k + this._e | 0, this._f = x + this._f | 0, this._g = z + this._g | 0, this._h = F + this._h | 0;
   }, a.prototype._hash = function() {
     var g = r.allocUnsafe(32);
     return g.writeInt32BE(this._a, 0), g.writeInt32BE(this._b, 4), g.writeInt32BE(this._c, 8), g.writeInt32BE(this._d, 12), g.writeInt32BE(this._e, 16), g.writeInt32BE(this._f, 20), g.writeInt32BE(this._g, 24), g.writeInt32BE(this._h, 28), g;
@@ -11914,30 +11953,30 @@ function Qd() {
   function v(y, m) {
     return (y >>> 19 | m << 13) ^ (m >>> 29 | y << 3) ^ (y >>> 6 | m << 26);
   }
-  function k(y, m) {
+  function E(y, m) {
     return y >>> 0 < m >>> 0 ? 1 : 0;
   }
   return a.prototype._update = function(y) {
-    for (var m = this._w, A = this._ah | 0, E = this._bh | 0, x = this._ch | 0, z = this._dh | 0, F = this._eh | 0, j = this._fh | 0, I = this._gh | 0, N = this._hh | 0, O = this._al | 0, R = this._bl | 0, U = this._cl | 0, T = this._dl | 0, Z = this._el | 0, re = this._fl | 0, oe = this._gl | 0, ue = this._hl | 0, ie = 0; ie < 32; ie += 2)
+    for (var m = this._w, A = this._ah | 0, k = this._bh | 0, x = this._ch | 0, z = this._dh | 0, F = this._eh | 0, R = this._fh | 0, I = this._gh | 0, N = this._hh | 0, O = this._al | 0, j = this._bl | 0, U = this._cl | 0, T = this._dl | 0, Z = this._el | 0, re = this._fl | 0, oe = this._gl | 0, ue = this._hl | 0, ie = 0; ie < 32; ie += 2)
       m[ie] = y.readInt32BE(ie * 4), m[ie + 1] = y.readInt32BE(ie * 4 + 4);
     for (; ie < 160; ie += 2) {
       var de = m[ie - 30], me = m[ie - 30 + 1], Se = c(de, me), De = w(me, de);
       de = m[ie - 4], me = m[ie - 4 + 1];
-      var q = g(de, me), H = v(me, de), C = m[ie - 14], G = m[ie - 14 + 1], V = m[ie - 32], X = m[ie - 32 + 1], Q = De + G | 0, ee = Se + C + k(Q, De) | 0;
-      Q = Q + H | 0, ee = ee + q + k(Q, H) | 0, Q = Q + X | 0, ee = ee + V + k(Q, X) | 0, m[ie] = ee, m[ie + 1] = Q;
+      var q = g(de, me), H = v(me, de), C = m[ie - 14], G = m[ie - 14 + 1], V = m[ie - 32], X = m[ie - 32 + 1], Q = De + G | 0, ee = Se + C + E(Q, De) | 0;
+      Q = Q + H | 0, ee = ee + q + E(Q, H) | 0, Q = Q + X | 0, ee = ee + V + E(Q, X) | 0, m[ie] = ee, m[ie + 1] = Q;
     }
     for (var ne = 0; ne < 160; ne += 2) {
       ee = m[ne], Q = m[ne + 1];
-      var se = i(A, E, x), ce = i(O, R, U), le = h(A, O), he = h(O, A), ye = l(F, Z), pe = l(Z, F), we = n[ne], Oe = n[ne + 1], $ = s(F, j, I), Re = s(Z, re, oe), ae = ue + pe | 0, fe = N + ye + k(ae, ue) | 0;
-      ae = ae + Re | 0, fe = fe + $ + k(ae, Re) | 0, ae = ae + Oe | 0, fe = fe + we + k(ae, Oe) | 0, ae = ae + Q | 0, fe = fe + ee + k(ae, Q) | 0;
-      var ge = he + ce | 0, xe = le + se + k(ge, he) | 0;
-      N = I, ue = oe, I = j, oe = re, j = F, re = Z, Z = T + ae | 0, F = z + fe + k(Z, T) | 0, z = x, T = U, x = E, U = R, E = A, R = O, O = ae + ge | 0, A = fe + xe + k(O, ae) | 0;
+      var se = i(A, k, x), ce = i(O, j, U), le = h(A, O), he = h(O, A), ye = l(F, Z), pe = l(Z, F), we = n[ne], Oe = n[ne + 1], $ = s(F, R, I), je = s(Z, re, oe), ae = ue + pe | 0, fe = N + ye + E(ae, ue) | 0;
+      ae = ae + je | 0, fe = fe + $ + E(ae, je) | 0, ae = ae + Oe | 0, fe = fe + we + E(ae, Oe) | 0, ae = ae + Q | 0, fe = fe + ee + E(ae, Q) | 0;
+      var ge = he + ce | 0, xe = le + se + E(ge, he) | 0;
+      N = I, ue = oe, I = R, oe = re, R = F, re = Z, Z = T + ae | 0, F = z + fe + E(Z, T) | 0, z = x, T = U, x = k, U = j, k = A, j = O, O = ae + ge | 0, A = fe + xe + E(O, ae) | 0;
     }
-    this._al = this._al + O | 0, this._bl = this._bl + R | 0, this._cl = this._cl + U | 0, this._dl = this._dl + T | 0, this._el = this._el + Z | 0, this._fl = this._fl + re | 0, this._gl = this._gl + oe | 0, this._hl = this._hl + ue | 0, this._ah = this._ah + A + k(this._al, O) | 0, this._bh = this._bh + E + k(this._bl, R) | 0, this._ch = this._ch + x + k(this._cl, U) | 0, this._dh = this._dh + z + k(this._dl, T) | 0, this._eh = this._eh + F + k(this._el, Z) | 0, this._fh = this._fh + j + k(this._fl, re) | 0, this._gh = this._gh + I + k(this._gl, oe) | 0, this._hh = this._hh + N + k(this._hl, ue) | 0;
+    this._al = this._al + O | 0, this._bl = this._bl + j | 0, this._cl = this._cl + U | 0, this._dl = this._dl + T | 0, this._el = this._el + Z | 0, this._fl = this._fl + re | 0, this._gl = this._gl + oe | 0, this._hl = this._hl + ue | 0, this._ah = this._ah + A + E(this._al, O) | 0, this._bh = this._bh + k + E(this._bl, j) | 0, this._ch = this._ch + x + E(this._cl, U) | 0, this._dh = this._dh + z + E(this._dl, T) | 0, this._eh = this._eh + F + E(this._el, Z) | 0, this._fh = this._fh + R + E(this._fl, re) | 0, this._gh = this._gh + I + E(this._gl, oe) | 0, this._hh = this._hh + N + E(this._hl, ue) | 0;
   }, a.prototype._hash = function() {
     var y = r.allocUnsafe(64);
-    function m(A, E, x) {
-      y.writeInt32BE(A, x), y.writeInt32BE(E, x + 4);
+    function m(A, k, x) {
+      y.writeInt32BE(A, x), y.writeInt32BE(k, x + 4);
     }
     return m(this._ah, this._al, 0), m(this._bh, this._bl, 8), m(this._ch, this._cl, 16), m(this._dh, this._dl, 24), m(this._eh, this._el, 32), m(this._fh, this._fl, 40), m(this._gh, this._gl, 48), m(this._hh, this._hl, 56), y;
   }, Si = a, Si;
@@ -11972,7 +12011,7 @@ function ev() {
   })(bo)), bo.exports;
 }
 var rv = ev();
-const kv = /* @__PURE__ */ Ea(rv);
+const kv = /* @__PURE__ */ Ia(rv);
 export {
   J as B,
   wv as L,
@@ -11986,7 +12025,7 @@ export {
   _m as h,
   uv as i,
   bv as j,
-  Rd as k,
+  jd as k,
   nd as l,
   _v as m,
   kv as n,