u-space 0.0.18 → 0.0.19

package/dist/plugins/u-manager/index.js

@@ -1,6 +1,6 @@
 import { FileLoader, Scene, OrthographicCamera, Mesh, PlaneGeometry, MeshBasicNodeMaterial, SRGBColorSpace, Matrix4, Loader, LoadingManager, Group, EventDispatcher, Vector3, Box3, Quaternion, Sphere, Vector4, BufferGeometry, Float32BufferAttribute, DataTexture, RGBAFormat, FloatType, NearestFilter, MeshStandardNodeMaterial, Color, Euler } from "three/webgpu";
 import { TextureLoaderManager, Model, ShapeMesh, CircleMesh, ExtrudeMesh, tweenAnimation, Topology, BaseMesh, BaseGroup, MaterialEffects as MaterialEffects$1 } from "u-space";
-import { pass, attribute, vec4, positionLocal, textureLoad, ivec2, mat4, int, textureSize } from "three/tsl";
+import { pass, attribute, vec4, positionLocal, transformNormal, normalLocal, textureLoad, ivec2, mat4, int, textureSize } from "three/tsl";
 import { MaterialEffects } from "../../index.js";
 class BaseFileLoader extends FileLoader {
   constructor(t) {
@@ -193,7 +193,7 @@ ieee754.write = function(c, t, u, o, d, r) {
     const se = X.write(U, I);
     return se !== C && (X = X.slice(0, se)), X;
   }
-  function q(U) {
+  function B(U) {
     const I = U.length < 0 ? 0 : D(U.length) | 0, C = n(I);
     for (let X = 0; X < I; X += 1)
       C[X] = U[X] & 255;
@@ -204,7 +204,7 @@ ieee754.write = function(c, t, u, o, d, r) {
       const I = new r(U);
       return S(I.buffer, I.byteOffset, I.byteLength);
     }
-    return q(U);
+    return B(U);
   }
   function S(U, I, C) {
     if (I < 0 || U.byteLength < I)
@@ -220,9 +220,9 @@ ieee754.write = function(c, t, u, o, d, r) {
       return C.length === 0 || U.copy(C, 0, 0, I), C;
     }
     if (U.length !== void 0)
-      return typeof U.length != "number" || ge(U.length) ? n(0) : q(U);
+      return typeof U.length != "number" || ge(U.length) ? n(0) : B(U);
     if (U.type === "Buffer" && Array.isArray(U.data))
-      return q(U.data);
+      return B(U.data);
   }
   function D(U) {
     if (U >= d)
@@ -338,7 +338,7 @@ ieee754.write = function(c, t, u, o, d, r) {
           return x(this, I, C);
         case "utf8":
         case "utf-8":
-          return B(this, I, C);
+          return q(this, I, C);
         case "ascii":
           return w(this, I, C);
         case "latin1":
@@ -384,7 +384,7 @@ ieee754.write = function(c, t, u, o, d, r) {
     return this;
   }, e.prototype.toString = function() {
     const I = this.length;
-    return I === 0 ? "" : arguments.length === 0 ? B(this, 0, I) : J.apply(this, arguments);
+    return I === 0 ? "" : arguments.length === 0 ? q(this, 0, I) : J.apply(this, arguments);
   }, e.prototype.toLocaleString = e.prototype.toString, e.prototype.equals = function(I) {
     if (!e.isBuffer(I)) throw new TypeError("Argument must be a Buffer");
     return this === I ? !0 : e.compare(this, I) === 0;
@@ -539,7 +539,7 @@ ieee754.write = function(c, t, u, o, d, r) {
   function R(U, I, C) {
     return I === 0 && C === U.length ? t.fromByteArray(U) : t.fromByteArray(U.slice(I, C));
   }
-  function B(U, I, C) {
+  function q(U, I, C) {
     C = Math.min(U.length, C);
     const X = [];
     let se = I;
@@ -1196,8 +1196,8 @@ function requireDist() {
         o[O >> 10] + o[O >> 4 & 63] + o[O << 2 & 63] + "="
       )), j.join("");
     }
-    var q = {};
-    q.read = function(S, O, D, $, j) {
+    var B = {};
+    B.read = function(S, O, D, $, j) {
       var J, ie, ne = j * 8 - $ - 1, de = (1 << ne) - 1, Z = de >> 1, y = -7, g = D ? j - 1 : 0, p = D ? -1 : 1, _ = S[O + g];
       for (g += p, J = _ & (1 << -y) - 1, _ >>= -y, y += ne; y > 0; J = J * 256 + S[O + g], g += p, y -= 8)
         ;
@@ -1211,16 +1211,16 @@ function requireDist() {
         ie = ie + Math.pow(2, $), J = J - Z;
       }
       return (_ ? -1 : 1) * ie * Math.pow(2, J - $);
-    }, q.write = function(S, O, D, $, j, J) {
-      var ie, ne, de, Z = J * 8 - j - 1, y = (1 << Z) - 1, g = y >> 1, p = j === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, _ = $ ? 0 : J - 1, R = $ ? 1 : -1, B = O < 0 || O === 0 && 1 / O < 0 ? 1 : 0;
+    }, B.write = function(S, O, D, $, j, J) {
+      var ie, ne, de, Z = J * 8 - j - 1, y = (1 << Z) - 1, g = y >> 1, p = j === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, _ = $ ? 0 : J - 1, R = $ ? 1 : -1, q = O < 0 || O === 0 && 1 / O < 0 ? 1 : 0;
       for (O = Math.abs(O), isNaN(O) || O === 1 / 0 ? (ne = isNaN(O) ? 1 : 0, ie = y) : (ie = Math.floor(Math.log(O) / Math.LN2), O * (de = Math.pow(2, -ie)) < 1 && (ie--, de *= 2), ie + g >= 1 ? O += p / de : O += p * Math.pow(2, 1 - g), O * de >= 2 && (ie++, de /= 2), ie + g >= y ? (ne = 0, ie = y) : ie + g >= 1 ? (ne = (O * de - 1) * Math.pow(2, j), ie = ie + g) : (ne = O * Math.pow(2, g - 1) * Math.pow(2, j), ie = 0)); j >= 8; S[D + _] = ne & 255, _ += R, ne /= 256, j -= 8)
         ;
       for (ie = ie << j | ne, Z += j; Z > 0; S[D + _] = ie & 255, _ += R, ie /= 256, Z -= 8)
         ;
-      S[D + _ - R] |= B * 128;
+      S[D + _ - R] |= q * 128;
     };
     (function(S) {
-      const O = u, D = q, $ = typeof Symbol == "function" && typeof Symbol.for == "function" ? /* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom") : null;
+      const O = u, D = B, $ = typeof Symbol == "function" && typeof Symbol.for == "function" ? /* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom") : null;
       S.Buffer = y, S.SlowBuffer = L, S.INSPECT_MAX_BYTES = 50;
       const j = 2147483647;
       S.kMaxLength = j;
@@ -1270,7 +1270,7 @@ function requireDist() {
       y.poolSize = 8192;
       function g(W, T, k) {
         if (typeof W == "string")
-          return B(W, T);
+          return q(W, T);
         if (ie.isView(W))
           return A(W);
         if (W == null)
@@ -1317,7 +1317,7 @@ function requireDist() {
       }, y.allocUnsafeSlow = function(W) {
         return R(W);
       };
-      function B(W, T) {
+      function q(W, T) {
         if ((typeof T != "string" || T === "") && (T = "utf8"), !y.isEncoding(T))
           throw new TypeError("Unknown encoding: " + T);
         const k = K(W, T) | 0;
@@ -2389,7 +2389,7 @@ function requireEvents() {
     if (J === void 0)
       return [];
     var ie = J[$];
-    return ie === void 0 ? [] : typeof ie == "function" ? j ? [ie.listener || ie] : [ie] : j ? q(ie) : b(ie, ie.length);
+    return ie === void 0 ? [] : typeof ie == "function" ? j ? [ie.listener || ie] : [ie] : j ? B(ie) : b(ie, ie.length);
   }
   r.prototype.listeners = function($) {
     return l(this, $, !0);
@@ -2422,7 +2422,7 @@ function requireEvents() {
       D[$] = D[$ + 1];
     D.pop();
   }
-  function q(D) {
+  function B(D) {
     for (var $ = new Array(D.length), j = 0; j < $.length; ++j)
       $[j] = D[j].listener || D[j];
     return $;
@@ -2655,9 +2655,9 @@ function requireImplementation$4() {
     }, v = u(0, n.length - e.length), b = [], m = 0; m < v; m++)
       b[m] = "$" + m;
     if (s = Function("binder", "return function (" + h(b, ",") + "){ return binder.apply(this,arguments); }")(l), n.prototype) {
-      var q = function() {
+      var B = function() {
       };
-      q.prototype = n.prototype, s.prototype = new q(), q.prototype = null;
+      B.prototype = n.prototype, s.prototype = new B(), B.prototype = null;
     }
     return s;
   }, implementation$4;
@@ -2749,9 +2749,9 @@ var getIntrinsic, hasRequiredGetIntrinsic;
 function requireGetIntrinsic() {
   if (hasRequiredGetIntrinsic) return getIntrinsic;
   hasRequiredGetIntrinsic = 1;
-  var c, t = /* @__PURE__ */ requireEsObjectAtoms(), u = /* @__PURE__ */ requireEsErrors(), o = /* @__PURE__ */ require_eval(), d = /* @__PURE__ */ requireRange(), r = /* @__PURE__ */ requireRef(), h = /* @__PURE__ */ requireSyntax(), f = /* @__PURE__ */ requireType(), a = /* @__PURE__ */ requireUri(), n = /* @__PURE__ */ requireAbs(), e = /* @__PURE__ */ requireFloor(), s = /* @__PURE__ */ requireMax(), l = /* @__PURE__ */ requireMin(), v = /* @__PURE__ */ requirePow(), b = /* @__PURE__ */ requireRound(), m = /* @__PURE__ */ requireSign$1(), q = Function, E = function(ee) {
+  var c, t = /* @__PURE__ */ requireEsObjectAtoms(), u = /* @__PURE__ */ requireEsErrors(), o = /* @__PURE__ */ require_eval(), d = /* @__PURE__ */ requireRange(), r = /* @__PURE__ */ requireRef(), h = /* @__PURE__ */ requireSyntax(), f = /* @__PURE__ */ requireType(), a = /* @__PURE__ */ requireUri(), n = /* @__PURE__ */ requireAbs(), e = /* @__PURE__ */ requireFloor(), s = /* @__PURE__ */ requireMax(), l = /* @__PURE__ */ requireMin(), v = /* @__PURE__ */ requirePow(), b = /* @__PURE__ */ requireRound(), m = /* @__PURE__ */ requireSign$1(), B = Function, E = function(ee) {
     try {
-      return q('"use strict"; return (' + ee + ").constructor;")();
+      return B('"use strict"; return (' + ee + ").constructor;")();
     } catch {
     }
   }, S = /* @__PURE__ */ requireGopd(), O = /* @__PURE__ */ requireEsDefineProperty(), D = function() {
@@ -2796,7 +2796,7 @@ function requireGetIntrinsic() {
     "%Float32Array%": typeof Float32Array > "u" ? c : Float32Array,
     "%Float64Array%": typeof Float64Array > "u" ? c : Float64Array,
     "%FinalizationRegistry%": typeof FinalizationRegistry > "u" ? c : FinalizationRegistry,
-    "%Function%": q,
+    "%Function%": B,
     "%GeneratorFunction%": y,
     "%Int8Array%": typeof Int8Array > "u" ? c : Int8Array,
     "%Int16Array%": typeof Int16Array > "u" ? c : Int16Array,
@@ -2873,7 +2873,7 @@ function requireGetIntrinsic() {
       fe && J && (z = J(fe.prototype));
     }
     return p[ae] = z, z;
-  }, B = {
+  }, q = {
     __proto__: null,
     "%ArrayBufferPrototype%": ["ArrayBuffer", "prototype"],
     "%ArrayPrototype%": ["Array", "prototype"],
@@ -2938,7 +2938,7 @@ function requireGetIntrinsic() {
     }), fe;
   }, F = function(ae, z) {
     var G = ae, fe;
-    if (A(B, G) && (fe = B[G], G = "%" + fe[0] + "%"), A(p, G)) {
+    if (A(q, G) && (fe = q[G], G = "%" + fe[0] + "%"), A(p, G)) {
       var me = p[G];
       if (me === y && (me = R(G)), typeof me > "u" && !z)
         throw new f("intrinsic " + ae + " exists, but is not available. Please file an issue!");
@@ -3131,12 +3131,12 @@ function requireIsCallable() {
     } catch {
       return !1;
     }
-  }, f = Object.prototype.toString, a = "[object Object]", n = "[object Function]", e = "[object GeneratorFunction]", s = "[object HTMLAllCollection]", l = "[object HTML document.all class]", v = "[object HTMLCollection]", b = typeof Symbol == "function" && !!Symbol.toStringTag, m = !(0 in [,]), q = function() {
+  }, f = Object.prototype.toString, a = "[object Object]", n = "[object Function]", e = "[object GeneratorFunction]", s = "[object HTMLAllCollection]", l = "[object HTML document.all class]", v = "[object HTMLCollection]", b = typeof Symbol == "function" && !!Symbol.toStringTag, m = !(0 in [,]), B = function() {
     return !1;
   };
   if (typeof document == "object") {
     var E = document.all;
-    f.call(E) === f.call(document.all) && (q = function(O) {
+    f.call(E) === f.call(document.all) && (B = function(O) {
       if ((m || !O) && (typeof O > "u" || typeof O == "object"))
         try {
           var D = f.call(O);
@@ -3147,7 +3147,7 @@ function requireIsCallable() {
     });
   }
   return isCallable = t ? function(O) {
-    if (q(O))
+    if (B(O))
       return !0;
     if (!O || typeof O != "function" && typeof O != "object")
       return !1;
@@ -3159,7 +3159,7 @@ function requireIsCallable() {
     }
     return !r(O) && h(O);
   } : function(O) {
-    if (q(O))
+    if (B(O))
       return !0;
     if (!O || typeof O != "function" && typeof O != "object")
       return !1;
@@ -3329,16 +3329,16 @@ var whichTypedArray, hasRequiredWhichTypedArray;
 function requireWhichTypedArray() {
   if (hasRequiredWhichTypedArray) return whichTypedArray;
   hasRequiredWhichTypedArray = 1;
-  var c = requireForEach(), t = /* @__PURE__ */ requireAvailableTypedArrays(), u = requireCallBind(), o = /* @__PURE__ */ requireCallBound$1(), d = /* @__PURE__ */ requireGopd(), r = requireGetProto(), h = o("Object.prototype.toString"), f = requireShams()(), a = typeof globalThis > "u" ? commonjsGlobal : globalThis, n = t(), e = o("String.prototype.slice"), s = o("Array.prototype.indexOf", !0) || function(q, E) {
-    for (var S = 0; S < q.length; S += 1)
-      if (q[S] === E)
+  var c = requireForEach(), t = /* @__PURE__ */ requireAvailableTypedArrays(), u = requireCallBind(), o = /* @__PURE__ */ requireCallBound$1(), d = /* @__PURE__ */ requireGopd(), r = requireGetProto(), h = o("Object.prototype.toString"), f = requireShams()(), a = typeof globalThis > "u" ? commonjsGlobal : globalThis, n = t(), e = o("String.prototype.slice"), s = o("Array.prototype.indexOf", !0) || function(B, E) {
+    for (var S = 0; S < B.length; S += 1)
+      if (B[S] === E)
         return S;
     return -1;
   }, l = { __proto__: null };
   f && d && r ? c(n, function(m) {
-    var q = new a[m]();
-    if (Symbol.toStringTag in q && r) {
-      var E = r(q), S = d(E, Symbol.toStringTag);
+    var B = new a[m]();
+    if (Symbol.toStringTag in B && r) {
+      var E = r(B), S = d(E, Symbol.toStringTag);
       if (!S && E) {
         var O = r(E);
         S = d(O, Symbol.toStringTag);
@@ -3352,7 +3352,7 @@ function requireWhichTypedArray() {
       }
     }
   }) : c(n, function(m) {
-    var q = new a[m](), E = q.slice || q.set;
+    var B = new a[m](), E = B.slice || B.set;
     if (E) {
       var S = (
         /** @type {import('./types').BoundSlice | import('./types').BoundSet} */
@@ -3365,7 +3365,7 @@ function requireWhichTypedArray() {
       ] = S;
     }
   });
-  var v = function(q) {
+  var v = function(B) {
     var E = !1;
     return c(
       /** @type {Record<`\$${import('.').TypedArrayName}`, Getter>} */
@@ -3374,13 +3374,13 @@ function requireWhichTypedArray() {
       function(S, O) {
         if (!E)
           try {
-            "$" + S(q) === O && (E = /** @type {import('.').TypedArrayName} */
+            "$" + S(B) === O && (E = /** @type {import('.').TypedArrayName} */
             e(O, 1));
           } catch {
           }
       }
     ), E;
-  }, b = function(q) {
+  }, b = function(B) {
     var E = !1;
     return c(
       /** @type {Record<`\$${import('.').TypedArrayName}`, Getter>} */
@@ -3389,21 +3389,21 @@ function requireWhichTypedArray() {
       function(S, O) {
         if (!E)
           try {
-            S(q), E = /** @type {import('.').TypedArrayName} */
+            S(B), E = /** @type {import('.').TypedArrayName} */
             e(O, 1);
           } catch {
           }
       }
     ), E;
   };
-  return whichTypedArray = function(q) {
-    if (!q || typeof q != "object")
+  return whichTypedArray = function(B) {
+    if (!B || typeof B != "object")
       return !1;
     if (!f) {
-      var E = e(h(q), 8, -1);
-      return s(n, E) > -1 ? E : E !== "Object" ? !1 : b(q);
+      var E = e(h(B), 8, -1);
+      return s(n, E) > -1 ? E : E !== "Object" ? !1 : b(B);
     }
-    return d ? v(q) : null;
+    return d ? v(B) : null;
   }, whichTypedArray;
 }
 var isTypedArray, hasRequiredIsTypedArray;
@@ -3441,10 +3441,10 @@ function requireTypes$1() {
       return typeof Promise < "u" && be instanceof Promise || be !== null && typeof be == "object" && typeof be.then == "function" && typeof be.catch == "function";
     }
     c.isPromise = m;
-    function q(be) {
+    function B(be) {
       return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? ArrayBuffer.isView(be) : d(be) || L(be);
     }
-    c.isArrayBufferView = q;
+    c.isArrayBufferView = B;
     function E(be) {
       return o(be) === "Uint8Array";
     }
@@ -3509,10 +3509,10 @@ function requireTypes$1() {
       return a(be) === "[object WeakMap]";
     }
     R.working = typeof WeakMap < "u" && R(/* @__PURE__ */ new WeakMap());
-    function B(be) {
+    function q(be) {
       return typeof WeakMap > "u" ? !1 : R.working ? R(be) : be instanceof WeakMap;
     }
-    c.isWeakMap = B;
+    c.isWeakMap = q;
     function P(be) {
       return a(be) === "[object WeakSet]";
     }
@@ -3749,7 +3749,7 @@ function requireUtil$1() {
           return l(L);
       }
       var ae = "", z = !1, G = ["{", "}"];
-      if (q(L) && (z = !0, G = ["[", "]"]), y(L)) {
+      if (B(L) && (z = !0, G = ["[", "]"]), y(L)) {
         var fe = L.name ? ": " + L.name : "";
         ae = " [Function" + fe + "]";
       }
@@ -3830,10 +3830,10 @@ function requireUtil$1() {
   `) + " " + K[1] : K[0] + L + " " + x.join(", ") + " " + K[1];
     }
     c.types = requireTypes$1();
-    function q(x) {
+    function B(x) {
       return Array.isArray(x);
     }
-    c.isArray = q;
+    c.isArray = B;
     function E(x) {
       return typeof x == "boolean";
     }
@@ -3907,7 +3907,7 @@ function requireUtil$1() {
       "Nov",
       "Dec"
     ];
-    function B() {
+    function q() {
       var x = /* @__PURE__ */ new Date(), L = [
         _(x.getHours()),
         _(x.getMinutes()),
@@ -3916,7 +3916,7 @@ function requireUtil$1() {
       return [x.getDate(), R[x.getMonth()], L].join(" ");
     }
     c.log = function() {
-      console.log("%s - %s", B(), c.format.apply(c, arguments));
+      console.log("%s - %s", q(), c.format.apply(c, arguments));
     }, c.inherits = requireInherits_browser(), c._extend = function(x, L) {
       if (!L || !ne(L)) return x;
       for (var K = Object.keys(L), Q = K.length; Q--; )
@@ -4007,40 +4007,40 @@ function requireBuffer_list() {
   if (hasRequiredBuffer_list) return buffer_list;
   hasRequiredBuffer_list = 1;
   function c(b, m) {
-    var q = Object.keys(b);
+    var B = Object.keys(b);
     if (Object.getOwnPropertySymbols) {
       var E = Object.getOwnPropertySymbols(b);
       m && (E = E.filter(function(S) {
         return Object.getOwnPropertyDescriptor(b, S).enumerable;
-      })), q.push.apply(q, E);
+      })), B.push.apply(B, E);
     }
-    return q;
+    return B;
   }
   function t(b) {
     for (var m = 1; m < arguments.length; m++) {
-      var q = arguments[m] != null ? arguments[m] : {};
-      m % 2 ? c(Object(q), !0).forEach(function(E) {
-        u(b, E, q[E]);
-      }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(b, Object.getOwnPropertyDescriptors(q)) : c(Object(q)).forEach(function(E) {
-        Object.defineProperty(b, E, Object.getOwnPropertyDescriptor(q, E));
+      var B = arguments[m] != null ? arguments[m] : {};
+      m % 2 ? c(Object(B), !0).forEach(function(E) {
+        u(b, E, B[E]);
+      }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(b, Object.getOwnPropertyDescriptors(B)) : c(Object(B)).forEach(function(E) {
+        Object.defineProperty(b, E, Object.getOwnPropertyDescriptor(B, E));
       });
     }
     return b;
   }
-  function u(b, m, q) {
-    return m = h(m), m in b ? Object.defineProperty(b, m, { value: q, enumerable: !0, configurable: !0, writable: !0 }) : b[m] = q, b;
+  function u(b, m, B) {
+    return m = h(m), m in b ? Object.defineProperty(b, m, { value: B, enumerable: !0, configurable: !0, writable: !0 }) : b[m] = B, b;
   }
   function o(b, m) {
     if (!(b instanceof m))
       throw new TypeError("Cannot call a class as a function");
   }
   function d(b, m) {
-    for (var q = 0; q < m.length; q++) {
-      var E = m[q];
+    for (var B = 0; B < m.length; B++) {
+      var E = m[B];
       E.enumerable = E.enumerable || !1, E.configurable = !0, "value" in E && (E.writable = !0), Object.defineProperty(b, h(E.key), E);
     }
   }
-  function r(b, m, q) {
+  function r(b, m, B) {
     return m && d(b.prototype, m), Object.defineProperty(b, "prototype", { writable: !1 }), b;
   }
   function h(b) {
@@ -4049,17 +4049,17 @@ function requireBuffer_list() {
   }
   function f(b, m) {
     if (typeof b != "object" || b === null) return b;
-    var q = b[Symbol.toPrimitive];
-    if (q !== void 0) {
-      var E = q.call(b, m);
+    var B = b[Symbol.toPrimitive];
+    if (B !== void 0) {
+      var E = B.call(b, m);
       if (typeof E != "object") return E;
       throw new TypeError("@@toPrimitive must return a primitive value.");
     }
     return String(b);
   }
   var a = requireDist(), n = a.Buffer, e = requireUtil$1(), s = e.inspect, l = s && s.custom || "inspect";
-  function v(b, m, q) {
-    n.prototype.copy.call(b, m, q);
+  function v(b, m, B) {
+    n.prototype.copy.call(b, m, B);
   }
   return buffer_list = /* @__PURE__ */ (function() {
     function b() {
@@ -4067,18 +4067,18 @@ function requireBuffer_list() {
     }
     return r(b, [{
       key: "push",
-      value: function(q) {
+      value: function(B) {
         var E = {
-          data: q,
+          data: B,
           next: null
         };
         this.length > 0 ? this.tail.next = E : this.head = E, this.tail = E, ++this.length;
       }
     }, {
       key: "unshift",
-      value: function(q) {
+      value: function(B) {
         var E = {
-          data: q,
+          data: B,
           next: this.head
         };
         this.length === 0 && (this.tail = E), this.head = E, ++this.length;
@@ -4087,8 +4087,8 @@ function requireBuffer_list() {
       key: "shift",
       value: function() {
         if (this.length !== 0) {
-          var q = this.head.data;
-          return this.length === 1 ? this.head = this.tail = null : this.head = this.head.next, --this.length, q;
+          var B = this.head.data;
+          return this.length === 1 ? this.head = this.tail = null : this.head = this.head.next, --this.length, B;
         }
       }
     }, {
@@ -4098,25 +4098,25 @@ function requireBuffer_list() {
       }
     }, {
       key: "join",
-      value: function(q) {
+      value: function(B) {
         if (this.length === 0) return "";
-        for (var E = this.head, S = "" + E.data; E = E.next; ) S += q + E.data;
+        for (var E = this.head, S = "" + E.data; E = E.next; ) S += B + E.data;
         return S;
       }
     }, {
       key: "concat",
-      value: function(q) {
+      value: function(B) {
         if (this.length === 0) return n.alloc(0);
-        for (var E = n.allocUnsafe(q >>> 0), S = this.head, O = 0; S; )
+        for (var E = n.allocUnsafe(B >>> 0), S = this.head, O = 0; S; )
           v(S.data, E, O), O += S.data.length, S = S.next;
         return E;
       }
       // Consumes a specified amount of bytes or characters from the buffered data.
     }, {
       key: "consume",
-      value: function(q, E) {
+      value: function(B, E) {
         var S;
-        return q < this.head.data.length ? (S = this.head.data.slice(0, q), this.head.data = this.head.data.slice(q)) : q === this.head.data.length ? S = this.shift() : S = E ? this._getString(q) : this._getBuffer(q), S;
+        return B < this.head.data.length ? (S = this.head.data.slice(0, B), this.head.data = this.head.data.slice(B)) : B === this.head.data.length ? S = this.shift() : S = E ? this._getString(B) : this._getBuffer(B), S;
       }
     }, {
       key: "first",
@@ -4126,11 +4126,11 @@ function requireBuffer_list() {
       // Consumes a specified amount of characters from the buffered data.
     }, {
       key: "_getString",
-      value: function(q) {
+      value: function(B) {
         var E = this.head, S = 1, O = E.data;
-        for (q -= O.length; E = E.next; ) {
-          var D = E.data, $ = q > D.length ? D.length : q;
-          if ($ === D.length ? O += D : O += D.slice(0, q), q -= $, q === 0) {
+        for (B -= O.length; E = E.next; ) {
+          var D = E.data, $ = B > D.length ? D.length : B;
+          if ($ === D.length ? O += D : O += D.slice(0, B), B -= $, B === 0) {
             $ === D.length ? (++S, E.next ? this.head = E.next : this.head = this.tail = null) : (this.head = E, E.data = D.slice($));
             break;
           }
@@ -4141,11 +4141,11 @@ function requireBuffer_list() {
       // Consumes a specified amount of bytes from the buffered data.
     }, {
       key: "_getBuffer",
-      value: function(q) {
-        var E = n.allocUnsafe(q), S = this.head, O = 1;
-        for (S.data.copy(E), q -= S.data.length; S = S.next; ) {
-          var D = S.data, $ = q > D.length ? D.length : q;
-          if (D.copy(E, E.length - q, 0, $), q -= $, q === 0) {
+      value: function(B) {
+        var E = n.allocUnsafe(B), S = this.head, O = 1;
+        for (S.data.copy(E), B -= S.data.length; S = S.next; ) {
+          var D = S.data, $ = B > D.length ? D.length : B;
+          if (D.copy(E, E.length - B, 0, $), B -= $, B === 0) {
             $ === D.length ? (++O, S.next ? this.head = S.next : this.head = this.tail = null) : (this.head = S, S.data = D.slice($));
             break;
           }
@@ -4156,7 +4156,7 @@ function requireBuffer_list() {
       // Make sure the linked list only shows the minimal necessary information.
     }, {
       key: l,
-      value: function(q, E) {
+      value: function(B, E) {
         return s(this, t(t({}, E), {}, {
           // Only inspect one level.
           depth: 0,
@@ -4214,8 +4214,8 @@ function requireErrorsBrowser() {
     }
     var s = /* @__PURE__ */ (function(l) {
       c(v, l);
-      function v(b, m, q) {
-        return l.call(this, e(b, m, q)) || this;
+      function v(b, m, B) {
+        return l.call(this, e(b, m, B)) || this;
       }
       return v;
     })(n);
@@ -4334,7 +4334,7 @@ function require_stream_writable$1() {
   function f(H) {
     return d.isBuffer(H) || H instanceof r;
   }
-  var a = requireDestroy$1(), n = requireState(), e = n.getHighWaterMark, s = requireErrorsBrowser().codes, l = s.ERR_INVALID_ARG_TYPE, v = s.ERR_METHOD_NOT_IMPLEMENTED, b = s.ERR_MULTIPLE_CALLBACK, m = s.ERR_STREAM_CANNOT_PIPE, q = s.ERR_STREAM_DESTROYED, E = s.ERR_STREAM_NULL_VALUES, S = s.ERR_STREAM_WRITE_AFTER_END, O = s.ERR_UNKNOWN_ENCODING, D = a.errorOrDestroy;
+  var a = requireDestroy$1(), n = requireState(), e = n.getHighWaterMark, s = requireErrorsBrowser().codes, l = s.ERR_INVALID_ARG_TYPE, v = s.ERR_METHOD_NOT_IMPLEMENTED, b = s.ERR_MULTIPLE_CALLBACK, m = s.ERR_STREAM_CANNOT_PIPE, B = s.ERR_STREAM_DESTROYED, E = s.ERR_STREAM_NULL_VALUES, S = s.ERR_STREAM_WRITE_AFTER_END, O = s.ERR_UNKNOWN_ENCODING, D = a.errorOrDestroy;
   requireInherits_browser()(ie, o);
   function $() {
   }
@@ -4438,7 +4438,7 @@ function require_stream_writable$1() {
     return me;
   }
   function g(H, N, F, ee, ae, z, G) {
-    N.writelen = ee, N.writecb = G, N.writing = !0, N.sync = !0, N.destroyed ? N.onwrite(new q("write")) : F ? H._writev(ae, N.onwrite) : H._write(ae, z, N.onwrite), N.sync = !1;
+    N.writelen = ee, N.writecb = G, N.writing = !0, N.sync = !0, N.destroyed ? N.onwrite(new B("write")) : F ? H._writev(ae, N.onwrite) : H._write(ae, z, N.onwrite), N.sync = !1;
   }
   function p(H, N, F, ee, ae) {
     --N.pendingcb, F ? (process$1.nextTick(ae, ee), process$1.nextTick(L, H, N), H._writableState.errorEmitted = !0, D(H, ee)) : (ae(ee), H._writableState.errorEmitted = !0, D(H, ee), L(H, N));
@@ -4452,10 +4452,10 @@ function require_stream_writable$1() {
     if (_(F), N) p(H, F, ee, N, ae);
     else {
       var z = w(F) || H.destroyed;
-      !z && !F.corked && !F.bufferProcessing && F.bufferedRequest && A(H, F), ee ? process$1.nextTick(B, H, F, z, ae) : B(H, F, z, ae);
+      !z && !F.corked && !F.bufferProcessing && F.bufferedRequest && A(H, F), ee ? process$1.nextTick(q, H, F, z, ae) : q(H, F, z, ae);
     }
   }
-  function B(H, N, F, ee) {
+  function q(H, N, F, ee) {
     F || P(H, N), N.pendingcb--, ee(), L(H, N);
   }
   function P(H, N) {
@@ -4669,7 +4669,7 @@ function requireString_decoder() {
         this.text = v, this.end = b, S = 3;
         break;
       default:
-        this.write = m, this.end = q;
+        this.write = m, this.end = B;
         return;
     }
     this.lastNeed = 0, this.lastTotal = 0, this.lastChar = c.allocUnsafe(S);
@@ -4756,7 +4756,7 @@ function requireString_decoder() {
   function m(E) {
     return E.toString(this.encoding);
   }
-  function q(E) {
+  function B(E) {
     return E && E.length ? this.write(E) : "";
   }
   return string_decoder;
@@ -4793,7 +4793,7 @@ function requireEndOfStream() {
       a = !1, v = !0, n || f.call(r);
     }, m = function(O) {
       f.call(r, O);
-    }, q = function() {
+    }, B = function() {
       var O;
       if (a && !v)
         return (!r._readableState || !r._readableState.ended) && (O = new c()), f.call(r, O);
@@ -4802,8 +4802,8 @@ function requireEndOfStream() {
     }, E = function() {
       r.req.on("finish", l);
     };
-    return o(r) ? (r.on("complete", l), r.on("abort", q), r.req ? E() : r.on("request", E)) : n && !r._writableState && (r.on("end", e), r.on("close", e)), r.on("end", b), r.on("finish", l), h.error !== !1 && r.on("error", m), r.on("close", q), function() {
-      r.removeListener("complete", l), r.removeListener("abort", q), r.removeListener("request", E), r.req && r.req.removeListener("finish", l), r.removeListener("end", e), r.removeListener("close", e), r.removeListener("finish", l), r.removeListener("end", b), r.removeListener("error", m), r.removeListener("close", q);
+    return o(r) ? (r.on("complete", l), r.on("abort", B), r.req ? E() : r.on("request", E)) : n && !r._writableState && (r.on("end", e), r.on("close", e)), r.on("end", b), r.on("finish", l), h.error !== !1 && r.on("error", m), r.on("close", B), function() {
+      r.removeListener("complete", l), r.removeListener("abort", B), r.removeListener("request", E), r.req && r.req.removeListener("finish", l), r.removeListener("end", e), r.removeListener("close", e), r.removeListener("finish", l), r.removeListener("end", b), r.removeListener("error", m), r.removeListener("close", B);
     };
   }
   return endOfStream = d, endOfStream;
@@ -4858,7 +4858,7 @@ function requireAsync_iterator() {
       }, j);
     };
   }
-  var q = Object.getPrototypeOf(function() {
+  var B = Object.getPrototypeOf(function() {
   }), E = Object.setPrototypeOf((c = {
     get stream() {
       return this[s];
@@ -4899,7 +4899,7 @@ function requireAsync_iterator() {
         $(l(void 0, !0));
       });
     });
-  }), c), q), S = function(D) {
+  }), c), B), S = function(D) {
     var $, j = Object.create(E, ($ = {}, t($, s, {
       value: D,
       writable: !0
@@ -4959,7 +4959,7 @@ function require_stream_readable$1() {
   var f = requireUtil$1(), a;
   f && f.debuglog ? a = f.debuglog("stream") : a = function() {
   };
-  var n = requireBuffer_list(), e = requireDestroy$1(), s = requireState(), l = s.getHighWaterMark, v = requireErrorsBrowser().codes, b = v.ERR_INVALID_ARG_TYPE, m = v.ERR_STREAM_PUSH_AFTER_EOF, q = v.ERR_METHOD_NOT_IMPLEMENTED, E = v.ERR_STREAM_UNSHIFT_AFTER_END_EVENT, S, O, D;
+  var n = requireBuffer_list(), e = requireDestroy$1(), s = requireState(), l = s.getHighWaterMark, v = requireErrorsBrowser().codes, b = v.ERR_INVALID_ARG_TYPE, m = v.ERR_STREAM_PUSH_AFTER_EOF, B = v.ERR_METHOD_NOT_IMPLEMENTED, E = v.ERR_STREAM_UNSHIFT_AFTER_END_EVENT, S, O, D;
   requireInherits_browser()(ne, u);
   var $ = e.errorOrDestroy, j = ["error", "close", "destroy", "pause", "resume"];
   function J(z, G, fe) {
@@ -5017,7 +5017,7 @@ function require_stream_readable$1() {
     return !_e.ended && (_e.length < _e.highWaterMark || _e.length === 0);
   }
   function Z(z, G, fe, me) {
-    G.flowing && G.length === 0 && !G.sync ? (G.awaitDrain = 0, z.emit("data", fe)) : (G.length += G.objectMode ? 1 : fe.length, me ? G.buffer.unshift(fe) : G.buffer.push(fe), G.needReadable && B(z)), A(z, G);
+    G.flowing && G.length === 0 && !G.sync ? (G.awaitDrain = 0, z.emit("data", fe)) : (G.length += G.objectMode ? 1 : fe.length, me ? G.buffer.unshift(fe) : G.buffer.push(fe), G.needReadable && q(z)), A(z, G);
   }
   function y(z, G) {
     var fe;
@@ -5044,7 +5044,7 @@ function require_stream_readable$1() {
     a("read", z), z = parseInt(z, 10);
     var G = this._readableState, fe = z;
     if (z !== 0 && (G.emittedReadable = !1), z === 0 && G.needReadable && ((G.highWaterMark !== 0 ? G.length >= G.highWaterMark : G.length > 0) || G.ended))
-      return a("read: emitReadable", G.length, G.ended), G.length === 0 && G.ended ? F(this) : B(this), null;
+      return a("read: emitReadable", G.length, G.ended), G.length === 0 && G.ended ? F(this) : q(this), null;
     if (z = _(z, G), z === 0 && G.ended)
       return G.length === 0 && F(this), null;
     var me = G.needReadable;
@@ -5058,10 +5058,10 @@ function require_stream_readable$1() {
         var fe = G.decoder.end();
         fe && fe.length && (G.buffer.push(fe), G.length += G.objectMode ? 1 : fe.length);
       }
-      G.ended = !0, G.sync ? B(z) : (G.needReadable = !1, G.emittedReadable || (G.emittedReadable = !0, P(z)));
+      G.ended = !0, G.sync ? q(z) : (G.needReadable = !1, G.emittedReadable || (G.emittedReadable = !0, P(z)));
     }
   }
-  function B(z) {
+  function q(z) {
     var G = z._readableState;
     a("emitReadable", G.needReadable, G.emittedReadable), G.needReadable = !1, G.emittedReadable || (a("emitReadable", G.flowing), G.emittedReadable = !0, process$1.nextTick(P, z));
   }
@@ -5081,7 +5081,7 @@ function require_stream_readable$1() {
     G.readingMore = !1;
   }
   ne.prototype._read = function(z) {
-    $(this, new q("_read()"));
+    $(this, new B("_read()"));
   }, ne.prototype.pipe = function(z, G) {
     var fe = this, me = this._readableState;
     switch (me.pipesCount) {
@@ -5158,7 +5158,7 @@ function require_stream_readable$1() {
     return qe === -1 ? this : (G.pipes.splice(qe, 1), G.pipesCount -= 1, G.pipesCount === 1 && (G.pipes = G.pipes[0]), z.emit("unpipe", this, fe), this);
   }, ne.prototype.on = function(z, G) {
     var fe = u.prototype.on.call(this, z, G), me = this._readableState;
-    return z === "data" ? (me.readableListening = this.listenerCount("readable") > 0, me.flowing !== !1 && this.resume()) : z === "readable" && !me.endEmitted && !me.readableListening && (me.readableListening = me.needReadable = !0, me.flowing = !1, me.emittedReadable = !1, a("on readable", me.length, me.reading), me.length ? B(this) : me.reading || process$1.nextTick(L, this)), fe;
+    return z === "data" ? (me.readableListening = this.listenerCount("readable") > 0, me.flowing !== !1 && this.resume()) : z === "readable" && !me.endEmitted && !me.readableListening && (me.readableListening = me.needReadable = !0, me.flowing = !1, me.emittedReadable = !1, a("on readable", me.length, me.reading), me.length ? q(this) : me.reading || process$1.nextTick(L, this)), fe;
   }, ne.prototype.addListener = ne.prototype.on, ne.prototype.removeListener = function(z, G) {
     var fe = u.prototype.removeListener.call(this, z, G);
     return z === "readable" && process$1.nextTick(x, this), fe;
@@ -5371,19 +5371,19 @@ function requirePipeline() {
   }
   function f(l, v, b, m) {
     m = t(m);
-    var q = !1;
+    var B = !1;
     l.on("close", function() {
-      q = !0;
+      B = !0;
     }), c === void 0 && (c = requireEndOfStream()), c(l, {
       readable: v,
       writable: b
     }, function(S) {
       if (S) return m(S);
-      q = !0, m();
+      B = !0, m();
     });
     var E = !1;
     return function(S) {
-      if (!q && !E) {
+      if (!B && !E) {
         if (E = !0, h(l)) return l.abort();
         if (typeof l.destroy == "function") return l.destroy();
         m(S || new d("pipe"));
@@ -5405,10 +5405,10 @@ function requirePipeline() {
     var m = e(v);
     if (Array.isArray(v[0]) && (v = v[0]), v.length < 2)
       throw new o("streams");
-    var q, E = v.map(function(S, O) {
+    var B, E = v.map(function(S, O) {
       var D = O < v.length - 1, $ = O > 0;
       return f(S, D, $, function(j) {
-        q || (q = j), j && E.forEach(a), !D && (E.forEach(a), m(q));
+        B || (B = j), j && E.forEach(a), !D && (E.forEach(a), m(B));
       });
     });
     return v.reduce(n);
@@ -5534,17 +5534,17 @@ function requireMd5_js() {
   function r(e, s) {
     return e << s | e >>> 32 - s;
   }
-  function h(e, s, l, v, b, m, q) {
-    return r(e + (s & l | ~s & v) + b + m | 0, q) + s | 0;
+  function h(e, s, l, v, b, m, B) {
+    return r(e + (s & l | ~s & v) + b + m | 0, B) + s | 0;
   }
-  function f(e, s, l, v, b, m, q) {
-    return r(e + (s & v | l & ~v) + b + m | 0, q) + s | 0;
+  function f(e, s, l, v, b, m, B) {
+    return r(e + (s & v | l & ~v) + b + m | 0, B) + s | 0;
   }
-  function a(e, s, l, v, b, m, q) {
-    return r(e + (s ^ l ^ v) + b + m | 0, q) + s | 0;
+  function a(e, s, l, v, b, m, B) {
+    return r(e + (s ^ l ^ v) + b + m | 0, B) + s | 0;
   }
-  function n(e, s, l, v, b, m, q) {
-    return r(e + (l ^ (s | ~v)) + b + m | 0, q) + s | 0;
+  function n(e, s, l, v, b, m, B) {
+    return r(e + (l ^ (s | ~v)) + b + m | 0, B) + s | 0;
   }
   return md5_js = d, md5_js;
 }
@@ -5839,10 +5839,10 @@ function require_stream_writable() {
   hasRequired_stream_writable = 1;
   var c = requireProcessNextickArgs();
   _stream_writable = m;
-  function t(B) {
+  function t(q) {
     var P = this;
     this.next = null, this.entry = null, this.finish = function() {
-      R(P, B);
+      R(P, q);
     };
   }
   var u = !process$1.browser && ["v0.10", "v0.9."].indexOf(process$1.version.slice(0, 5)) > -1 ? setImmediate : c.nextTick, o;
@@ -5853,24 +5853,24 @@ function require_stream_writable() {
     deprecate: requireBrowser$a()
   }, h = requireStreamBrowser(), f = requireSafeBuffer().Buffer, a = (typeof commonjsGlobal < "u" ? commonjsGlobal : typeof window < "u" ? window : typeof self < "u" ? self : {}).Uint8Array || function() {
   };
-  function n(B) {
-    return f.from(B);
+  function n(q) {
+    return f.from(q);
   }
-  function e(B) {
-    return f.isBuffer(B) || B instanceof a;
+  function e(q) {
+    return f.isBuffer(q) || q instanceof a;
   }
   var s = requireDestroy();
   d.inherits(m, h);
   function l() {
   }
-  function v(B, P) {
-    o = o || require_stream_duplex(), B = B || {};
+  function v(q, P) {
+    o = o || require_stream_duplex(), q = q || {};
     var A = P instanceof o;
-    this.objectMode = !!B.objectMode, A && (this.objectMode = this.objectMode || !!B.writableObjectMode);
-    var w = B.highWaterMark, M = B.writableHighWaterMark, x = this.objectMode ? 16 : 16 * 1024;
+    this.objectMode = !!q.objectMode, A && (this.objectMode = this.objectMode || !!q.writableObjectMode);
+    var w = q.highWaterMark, M = q.writableHighWaterMark, x = this.objectMode ? 16 : 16 * 1024;
     w || w === 0 ? this.highWaterMark = w : A && (M || M === 0) ? this.highWaterMark = M : this.highWaterMark = x, this.highWaterMark = Math.floor(this.highWaterMark), this.finalCalled = !1, this.needDrain = !1, this.ending = !1, this.ended = !1, this.finished = !1, this.destroyed = !1;
-    var L = B.decodeStrings === !1;
-    this.decodeStrings = !L, this.defaultEncoding = B.defaultEncoding || "utf8", this.length = 0, this.writing = !1, this.corked = 0, this.sync = !0, this.bufferProcessing = !1, this.onwrite = function(K) {
+    var L = q.decodeStrings === !1;
+    this.decodeStrings = !L, this.defaultEncoding = q.defaultEncoding || "utf8", this.length = 0, this.writing = !1, this.corked = 0, this.sync = !0, this.bufferProcessing = !1, this.onwrite = function(K) {
       J(P, K);
     }, this.writecb = null, this.writelen = 0, this.bufferedRequest = null, this.lastBufferedRequest = null, this.pendingcb = 0, this.prefinished = !1, this.errorEmitted = !1, this.bufferedRequestCount = 0, this.corkedRequestsFree = new t(this);
   }
@@ -5890,43 +5890,43 @@ function require_stream_writable() {
   })();
   var b;
   typeof Symbol == "function" && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] == "function" ? (b = Function.prototype[Symbol.hasInstance], Object.defineProperty(m, Symbol.hasInstance, {
-    value: function(B) {
-      return b.call(this, B) ? !0 : this !== m ? !1 : B && B._writableState instanceof v;
+    value: function(q) {
+      return b.call(this, q) ? !0 : this !== m ? !1 : q && q._writableState instanceof v;
     }
-  })) : b = function(B) {
-    return B instanceof this;
+  })) : b = function(q) {
+    return q instanceof this;
   };
-  function m(B) {
+  function m(q) {
     if (o = o || require_stream_duplex(), !b.call(m, this) && !(this instanceof o))
-      return new m(B);
-    this._writableState = new v(B, this), this.writable = !0, B && (typeof B.write == "function" && (this._write = B.write), typeof B.writev == "function" && (this._writev = B.writev), typeof B.destroy == "function" && (this._destroy = B.destroy), typeof B.final == "function" && (this._final = B.final)), h.call(this);
+      return new m(q);
+    this._writableState = new v(q, this), this.writable = !0, q && (typeof q.write == "function" && (this._write = q.write), typeof q.writev == "function" && (this._writev = q.writev), typeof q.destroy == "function" && (this._destroy = q.destroy), typeof q.final == "function" && (this._final = q.final)), h.call(this);
   }
   m.prototype.pipe = function() {
     this.emit("error", new Error("Cannot pipe, not readable"));
   };
-  function q(B, P) {
+  function B(q, P) {
     var A = new Error("write after end");
-    B.emit("error", A), c.nextTick(P, A);
+    q.emit("error", A), c.nextTick(P, A);
   }
-  function E(B, P, A, w) {
+  function E(q, P, A, w) {
     var M = !0, x = !1;
-    return A === null ? x = new TypeError("May not write null values to stream") : typeof A != "string" && A !== void 0 && !P.objectMode && (x = new TypeError("Invalid non-string/buffer chunk")), x && (B.emit("error", x), c.nextTick(w, x), M = !1), M;
+    return A === null ? x = new TypeError("May not write null values to stream") : typeof A != "string" && A !== void 0 && !P.objectMode && (x = new TypeError("Invalid non-string/buffer chunk")), x && (q.emit("error", x), c.nextTick(w, x), M = !1), M;
   }
-  m.prototype.write = function(B, P, A) {
-    var w = this._writableState, M = !1, x = !w.objectMode && e(B);
-    return x && !f.isBuffer(B) && (B = n(B)), typeof P == "function" && (A = P, P = null), x ? P = "buffer" : P || (P = w.defaultEncoding), typeof A != "function" && (A = l), w.ended ? q(this, A) : (x || E(this, w, B, A)) && (w.pendingcb++, M = O(this, w, x, B, P, A)), M;
+  m.prototype.write = function(q, P, A) {
+    var w = this._writableState, M = !1, x = !w.objectMode && e(q);
+    return x && !f.isBuffer(q) && (q = n(q)), typeof P == "function" && (A = P, P = null), x ? P = "buffer" : P || (P = w.defaultEncoding), typeof A != "function" && (A = l), w.ended ? B(this, A) : (x || E(this, w, q, A)) && (w.pendingcb++, M = O(this, w, x, q, P, A)), M;
   }, m.prototype.cork = function() {
-    var B = this._writableState;
-    B.corked++;
+    var q = this._writableState;
+    q.corked++;
   }, m.prototype.uncork = function() {
-    var B = this._writableState;
-    B.corked && (B.corked--, !B.writing && !B.corked && !B.bufferProcessing && B.bufferedRequest && de(this, B));
+    var q = this._writableState;
+    q.corked && (q.corked--, !q.writing && !q.corked && !q.bufferProcessing && q.bufferedRequest && de(this, q));
   }, m.prototype.setDefaultEncoding = function(P) {
     if (typeof P == "string" && (P = P.toLowerCase()), !(["hex", "utf8", "utf-8", "ascii", "binary", "base64", "ucs2", "ucs-2", "utf16le", "utf-16le", "raw"].indexOf((P + "").toLowerCase()) > -1)) throw new TypeError("Unknown encoding: " + P);
     return this._writableState.defaultEncoding = P, this;
   };
-  function S(B, P, A) {
-    return !B.objectMode && B.decodeStrings !== !1 && typeof P == "string" && (P = f.from(P, A)), P;
+  function S(q, P, A) {
+    return !q.objectMode && q.decodeStrings !== !1 && typeof P == "string" && (P = f.from(P, A)), P;
   }
   Object.defineProperty(m.prototype, "writableHighWaterMark", {
     // making it explicit this property is not enumerable
@@ -5937,7 +5937,7 @@ function require_stream_writable() {
       return this._writableState.highWaterMark;
     }
   });
-  function O(B, P, A, w, M, x) {
+  function O(q, P, A, w, M, x) {
     if (!A) {
       var L = S(P, w, M);
       w !== L && (A = !0, M = "buffer", w = L);
@@ -5955,92 +5955,92 @@ function require_stream_writable() {
         next: null
       }, H ? H.next = P.lastBufferedRequest : P.bufferedRequest = P.lastBufferedRequest, P.bufferedRequestCount += 1;
     } else
-      D(B, P, !1, K, w, M, x);
+      D(q, P, !1, K, w, M, x);
     return Q;
   }
-  function D(B, P, A, w, M, x, L) {
-    P.writelen = w, P.writecb = L, P.writing = !0, P.sync = !0, A ? B._writev(M, P.onwrite) : B._write(M, x, P.onwrite), P.sync = !1;
+  function D(q, P, A, w, M, x, L) {
+    P.writelen = w, P.writecb = L, P.writing = !0, P.sync = !0, A ? q._writev(M, P.onwrite) : q._write(M, x, P.onwrite), P.sync = !1;
   }
-  function $(B, P, A, w, M) {
-    --P.pendingcb, A ? (c.nextTick(M, w), c.nextTick(p, B, P), B._writableState.errorEmitted = !0, B.emit("error", w)) : (M(w), B._writableState.errorEmitted = !0, B.emit("error", w), p(B, P));
+  function $(q, P, A, w, M) {
+    --P.pendingcb, A ? (c.nextTick(M, w), c.nextTick(p, q, P), q._writableState.errorEmitted = !0, q.emit("error", w)) : (M(w), q._writableState.errorEmitted = !0, q.emit("error", w), p(q, P));
   }
-  function j(B) {
-    B.writing = !1, B.writecb = null, B.length -= B.writelen, B.writelen = 0;
+  function j(q) {
+    q.writing = !1, q.writecb = null, q.length -= q.writelen, q.writelen = 0;
   }
-  function J(B, P) {
-    var A = B._writableState, w = A.sync, M = A.writecb;
-    if (j(A), P) $(B, A, w, P, M);
+  function J(q, P) {
+    var A = q._writableState, w = A.sync, M = A.writecb;
+    if (j(A), P) $(q, A, w, P, M);
     else {
       var x = Z(A);
-      !x && !A.corked && !A.bufferProcessing && A.bufferedRequest && de(B, A), w ? u(ie, B, A, x, M) : ie(B, A, x, M);
+      !x && !A.corked && !A.bufferProcessing && A.bufferedRequest && de(q, A), w ? u(ie, q, A, x, M) : ie(q, A, x, M);
     }
   }
-  function ie(B, P, A, w) {
-    A || ne(B, P), P.pendingcb--, w(), p(B, P);
+  function ie(q, P, A, w) {
+    A || ne(q, P), P.pendingcb--, w(), p(q, P);
   }
-  function ne(B, P) {
-    P.length === 0 && P.needDrain && (P.needDrain = !1, B.emit("drain"));
+  function ne(q, P) {
+    P.length === 0 && P.needDrain && (P.needDrain = !1, q.emit("drain"));
   }
-  function de(B, P) {
+  function de(q, P) {
     P.bufferProcessing = !0;
     var A = P.bufferedRequest;
-    if (B._writev && A && A.next) {
+    if (q._writev && A && A.next) {
       var w = P.bufferedRequestCount, M = new Array(w), x = P.corkedRequestsFree;
       x.entry = A;
       for (var L = 0, K = !0; A; )
         M[L] = A, A.isBuf || (K = !1), A = A.next, L += 1;
-      M.allBuffers = K, D(B, P, !0, P.length, M, "", x.finish), P.pendingcb++, P.lastBufferedRequest = null, x.next ? (P.corkedRequestsFree = x.next, x.next = null) : P.corkedRequestsFree = new t(P), P.bufferedRequestCount = 0;
+      M.allBuffers = K, D(q, P, !0, P.length, M, "", x.finish), P.pendingcb++, P.lastBufferedRequest = null, x.next ? (P.corkedRequestsFree = x.next, x.next = null) : P.corkedRequestsFree = new t(P), P.bufferedRequestCount = 0;
     } else {
       for (; A; ) {
         var Q = A.chunk, H = A.encoding, N = A.callback, F = P.objectMode ? 1 : Q.length;
-        if (D(B, P, !1, F, Q, H, N), A = A.next, P.bufferedRequestCount--, P.writing)
+        if (D(q, P, !1, F, Q, H, N), A = A.next, P.bufferedRequestCount--, P.writing)
           break;
       }
       A === null && (P.lastBufferedRequest = null);
     }
     P.bufferedRequest = A, P.bufferProcessing = !1;
   }
-  m.prototype._write = function(B, P, A) {
+  m.prototype._write = function(q, P, A) {
     A(new Error("_write() is not implemented"));
-  }, m.prototype._writev = null, m.prototype.end = function(B, P, A) {
+  }, m.prototype._writev = null, m.prototype.end = function(q, P, A) {
     var w = this._writableState;
-    typeof B == "function" ? (A = B, B = null, P = null) : typeof P == "function" && (A = P, P = null), B != null && this.write(B, P), w.corked && (w.corked = 1, this.uncork()), w.ending || _(this, w, A);
+    typeof q == "function" ? (A = q, q = null, P = null) : typeof P == "function" && (A = P, P = null), q != null && this.write(q, P), w.corked && (w.corked = 1, this.uncork()), w.ending || _(this, w, A);
   };
-  function Z(B) {
-    return B.ending && B.length === 0 && B.bufferedRequest === null && !B.finished && !B.writing;
+  function Z(q) {
+    return q.ending && q.length === 0 && q.bufferedRequest === null && !q.finished && !q.writing;
   }
-  function y(B, P) {
-    B._final(function(A) {
-      P.pendingcb--, A && B.emit("error", A), P.prefinished = !0, B.emit("prefinish"), p(B, P);
+  function y(q, P) {
+    q._final(function(A) {
+      P.pendingcb--, A && q.emit("error", A), P.prefinished = !0, q.emit("prefinish"), p(q, P);
     });
   }
-  function g(B, P) {
-    !P.prefinished && !P.finalCalled && (typeof B._final == "function" ? (P.pendingcb++, P.finalCalled = !0, c.nextTick(y, B, P)) : (P.prefinished = !0, B.emit("prefinish")));
+  function g(q, P) {
+    !P.prefinished && !P.finalCalled && (typeof q._final == "function" ? (P.pendingcb++, P.finalCalled = !0, c.nextTick(y, q, P)) : (P.prefinished = !0, q.emit("prefinish")));
   }
-  function p(B, P) {
+  function p(q, P) {
     var A = Z(P);
-    return A && (g(B, P), P.pendingcb === 0 && (P.finished = !0, B.emit("finish"))), A;
+    return A && (g(q, P), P.pendingcb === 0 && (P.finished = !0, q.emit("finish"))), A;
   }
-  function _(B, P, A) {
-    P.ending = !0, p(B, P), A && (P.finished ? c.nextTick(A) : B.once("finish", A)), P.ended = !0, B.writable = !1;
+  function _(q, P, A) {
+    P.ending = !0, p(q, P), A && (P.finished ? c.nextTick(A) : q.once("finish", A)), P.ended = !0, q.writable = !1;
   }
-  function R(B, P, A) {
-    var w = B.entry;
-    for (B.entry = null; w; ) {
+  function R(q, P, A) {
+    var w = q.entry;
+    for (q.entry = null; w; ) {
       var M = w.callback;
       P.pendingcb--, M(A), w = w.next;
     }
-    P.corkedRequestsFree.next = B;
+    P.corkedRequestsFree.next = q;
   }
   return Object.defineProperty(m.prototype, "destroyed", {
     get: function() {
       return this._writableState === void 0 ? !1 : this._writableState.destroyed;
     },
-    set: function(B) {
-      this._writableState && (this._writableState.destroyed = B);
+    set: function(q) {
+      this._writableState && (this._writableState.destroyed = q);
     }
-  }), m.prototype.destroy = s.destroy, m.prototype._undestroy = s.undestroy, m.prototype._destroy = function(B, P) {
-    this.end(), P(B);
+  }), m.prototype.destroy = s.destroy, m.prototype._undestroy = s.undestroy, m.prototype._destroy = function(q, P) {
+    this.end(), P(q);
   }, _stream_writable;
 }
 var _stream_duplex, hasRequired_stream_duplex;
@@ -6118,7 +6118,7 @@ function require_stream_readable() {
   var l = requireBufferList(), v = requireDestroy(), b;
   n.inherits(S, d);
   var m = ["error", "close", "destroy", "pause", "resume"];
-  function q(N, F, ee) {
+  function B(N, F, ee) {
     if (typeof N.prependListener == "function") return N.prependListener(F, ee);
     !N._events || !N._events[F] ? N.on(F, ee) : t(N._events[F]) ? N._events[F].unshift(ee) : N._events[F] = [ee, N._events[F]];
   }
@@ -6256,7 +6256,7 @@ function require_stream_readable() {
     function Fe(oe) {
       s("onerror", oe), Te(), N.removeListener("error", Fe), o(N, "error") === 0 && N.emit("error", oe);
     }
-    q(N, "error", Fe);
+    B(N, "error", Fe);
     function Be() {
       N.removeListener("finish", Me), Te();
     }
@@ -6305,9 +6305,9 @@ function require_stream_readable() {
   }
   S.prototype.resume = function() {
     var N = this._readableState;
-    return N.flowing || (s("resume"), N.flowing = !0, B(this, N)), this;
+    return N.flowing || (s("resume"), N.flowing = !0, q(this, N)), this;
   };
-  function B(N, F) {
+  function q(N, F) {
     F.resumeScheduled || (F.resumeScheduled = !0, c.nextTick(P, N, F));
   }
   function P(N, F) {
@@ -6882,10 +6882,10 @@ function requireRipemd160() {
   function m(E, S, O, D, $, j, J, ie) {
     return e(E + (S ^ (O | ~D)) + j + J | 0, ie) + $ | 0;
   }
-  function q() {
+  function B() {
     u.call(this, 64), this._a = 1732584193, this._b = 4023233417, this._c = 2562383102, this._d = 271733878, this._e = 3285377520;
   }
-  return t(q, u), q.prototype._update = function() {
+  return t(B, u), B.prototype._update = function() {
     for (var E = o, S = 0; S < 16; ++S)
       E[S] = this._block.readInt32LE(S * 4);
     for (var O = this._a | 0, D = this._b | 0, $ = this._c | 0, j = this._d | 0, J = this._e | 0, ie = this._a | 0, ne = this._b | 0, de = this._c | 0, Z = this._d | 0, y = this._e | 0, g = 0; g < 80; g += 1) {
@@ -6894,11 +6894,11 @@ function requireRipemd160() {
     }
     var R = this._b + $ + Z | 0;
     this._b = this._c + j + y | 0, this._c = this._d + J + ie | 0, this._d = this._e + O + ne | 0, this._e = this._a + D + de | 0, this._a = R;
-  }, q.prototype._digest = function() {
+  }, B.prototype._digest = function() {
     this._block[this._blockOffset] = 128, this._blockOffset += 1, this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), this._blockOffset = 0), this._block.fill(0, this._blockOffset, 56), this._block.writeUInt32LE(this._length[0], 56), this._block.writeUInt32LE(this._length[1], 60), this._update();
     var E = c.alloc ? c.alloc(20) : new c(20);
     return E.writeInt32LE(this._a, 0), E.writeInt32LE(this._b, 4), E.writeInt32LE(this._c, 8), E.writeInt32LE(this._d, 12), E.writeInt32LE(this._e, 16), E;
-  }, ripemd160 = q, ripemd160;
+  }, ripemd160 = B, ripemd160;
 }
 var sha_js = { exports: {} }, hash$1, hasRequiredHash$1;
 function requireHash$1() {
@@ -6959,10 +6959,10 @@ function requireSha$1() {
     return n === 0 ? e & s | ~e & l : n === 2 ? e & s | e & l | s & l : e ^ s ^ l;
   }
   return r.prototype._update = function(n) {
-    for (var e = this._w, s = this._a | 0, l = this._b | 0, v = this._c | 0, b = this._d | 0, m = this._e | 0, q = 0; q < 16; ++q)
-      e[q] = n.readInt32BE(q * 4);
-    for (; q < 80; ++q)
-      e[q] = e[q - 3] ^ e[q - 8] ^ e[q - 14] ^ e[q - 16];
+    for (var e = this._w, s = this._a | 0, l = this._b | 0, v = this._c | 0, b = this._d | 0, m = this._e | 0, B = 0; B < 16; ++B)
+      e[B] = n.readInt32BE(B * 4);
+    for (; B < 80; ++B)
+      e[B] = e[B - 3] ^ e[B - 8] ^ e[B - 14] ^ e[B - 16];
     for (var E = 0; E < 80; ++E) {
       var S = ~~(E / 20), O = h(s) + a(S, l, v, b) + m + e[E] + o[S] | 0;
       m = b, b = v, v = f(l), l = s, s = O;
@@ -7002,15 +7002,15 @@ function requireSha1() {
     return e === 0 ? s & l | ~s & v : e === 2 ? s & l | s & v | l & v : s ^ l ^ v;
   }
   return r.prototype._update = function(e) {
-    for (var s = this._w, l = this._a | 0, v = this._b | 0, b = this._c | 0, m = this._d | 0, q = this._e | 0, E = 0; E < 16; ++E)
+    for (var s = this._w, l = this._a | 0, v = this._b | 0, b = this._c | 0, m = this._d | 0, B = this._e | 0, E = 0; E < 16; ++E)
       s[E] = e.readInt32BE(E * 4);
     for (; E < 80; ++E)
       s[E] = h(s[E - 3] ^ s[E - 8] ^ s[E - 14] ^ s[E - 16]);
     for (var S = 0; S < 80; ++S) {
-      var O = ~~(S / 20), D = f(l) + n(O, v, b, m) + q + s[S] + o[O] | 0;
-      q = m, m = b, b = a(v), v = l, l = D;
+      var O = ~~(S / 20), D = f(l) + n(O, v, b, m) + B + s[S] + o[O] | 0;
+      B = m, m = b, b = a(v), v = l, l = D;
     }
-    this._a = l + this._a | 0, this._b = v + this._b | 0, this._c = b + this._c | 0, this._d = m + this._d | 0, this._e = q + this._e | 0;
+    this._a = l + this._a | 0, this._b = v + this._b | 0, this._c = b + this._c | 0, this._d = m + this._d | 0, this._e = B + this._e | 0;
   }, r.prototype._hash = function() {
     var e = u.allocUnsafe(20);
     return e.writeInt32BE(this._a | 0, 0), e.writeInt32BE(this._b | 0, 4), e.writeInt32BE(this._c | 0, 8), e.writeInt32BE(this._d | 0, 12), e.writeInt32BE(this._e | 0, 16), e;
@@ -7111,15 +7111,15 @@ function requireSha256() {
     return (l >>> 17 | l << 15) ^ (l >>> 19 | l << 13) ^ l >>> 10;
   }
   return r.prototype._update = function(l) {
-    for (var v = this._w, b = this._a | 0, m = this._b | 0, q = this._c | 0, E = this._d | 0, S = this._e | 0, O = this._f | 0, D = this._g | 0, $ = this._h | 0, j = 0; j < 16; ++j)
+    for (var v = this._w, b = this._a | 0, m = this._b | 0, B = this._c | 0, E = this._d | 0, S = this._e | 0, O = this._f | 0, D = this._g | 0, $ = this._h | 0, j = 0; j < 16; ++j)
       v[j] = l.readInt32BE(j * 4);
     for (; j < 64; ++j)
       v[j] = s(v[j - 2]) + v[j - 7] + e(v[j - 15]) + v[j - 16] | 0;
     for (var J = 0; J < 64; ++J) {
-      var ie = $ + n(S) + h(S, O, D) + o[J] + v[J] | 0, ne = a(b) + f(b, m, q) | 0;
-      $ = D, D = O, O = S, S = E + ie | 0, E = q, q = m, m = b, b = ie + ne | 0;
+      var ie = $ + n(S) + h(S, O, D) + o[J] + v[J] | 0, ne = a(b) + f(b, m, B) | 0;
+      $ = D, D = O, O = S, S = E + ie | 0, E = B, B = m, m = b, b = ie + ne | 0;
     }
-    this._a = b + this._a | 0, this._b = m + this._b | 0, this._c = q + this._c | 0, this._d = E + this._d | 0, this._e = S + this._e | 0, this._f = O + this._f | 0, this._g = D + this._g | 0, this._h = $ + this._h | 0;
+    this._a = b + this._a | 0, this._b = m + this._b | 0, this._c = B + this._c | 0, this._d = E + this._d | 0, this._e = S + this._e | 0, this._f = O + this._f | 0, this._g = D + this._g | 0, this._h = $ + this._h | 0;
   }, r.prototype._hash = function() {
     var l = u.allocUnsafe(32);
     return l.writeInt32BE(this._a, 0), l.writeInt32BE(this._b, 4), l.writeInt32BE(this._c, 8), l.writeInt32BE(this._d, 12), l.writeInt32BE(this._e, 16), l.writeInt32BE(this._f, 20), l.writeInt32BE(this._g, 24), l.writeInt32BE(this._h, 28), l;
@@ -7312,44 +7312,44 @@ function requireSha512() {
   c(r, t), r.prototype.init = function() {
     return this._ah = 1779033703, this._bh = 3144134277, this._ch = 1013904242, this._dh = 2773480762, this._eh = 1359893119, this._fh = 2600822924, this._gh = 528734635, this._hh = 1541459225, this._al = 4089235720, this._bl = 2227873595, this._cl = 4271175723, this._dl = 1595750129, this._el = 2917565137, this._fl = 725511199, this._gl = 4215389547, this._hl = 327033209, this;
   };
-  function h(m, q, E) {
-    return E ^ m & (q ^ E);
+  function h(m, B, E) {
+    return E ^ m & (B ^ E);
   }
-  function f(m, q, E) {
-    return m & q | E & (m | q);
+  function f(m, B, E) {
+    return m & B | E & (m | B);
   }
-  function a(m, q) {
-    return (m >>> 28 | q << 4) ^ (q >>> 2 | m << 30) ^ (q >>> 7 | m << 25);
+  function a(m, B) {
+    return (m >>> 28 | B << 4) ^ (B >>> 2 | m << 30) ^ (B >>> 7 | m << 25);
   }
-  function n(m, q) {
-    return (m >>> 14 | q << 18) ^ (m >>> 18 | q << 14) ^ (q >>> 9 | m << 23);
+  function n(m, B) {
+    return (m >>> 14 | B << 18) ^ (m >>> 18 | B << 14) ^ (B >>> 9 | m << 23);
   }
-  function e(m, q) {
-    return (m >>> 1 | q << 31) ^ (m >>> 8 | q << 24) ^ m >>> 7;
+  function e(m, B) {
+    return (m >>> 1 | B << 31) ^ (m >>> 8 | B << 24) ^ m >>> 7;
   }
-  function s(m, q) {
-    return (m >>> 1 | q << 31) ^ (m >>> 8 | q << 24) ^ (m >>> 7 | q << 25);
+  function s(m, B) {
+    return (m >>> 1 | B << 31) ^ (m >>> 8 | B << 24) ^ (m >>> 7 | B << 25);
   }
-  function l(m, q) {
-    return (m >>> 19 | q << 13) ^ (q >>> 29 | m << 3) ^ m >>> 6;
+  function l(m, B) {
+    return (m >>> 19 | B << 13) ^ (B >>> 29 | m << 3) ^ m >>> 6;
   }
-  function v(m, q) {
-    return (m >>> 19 | q << 13) ^ (q >>> 29 | m << 3) ^ (m >>> 6 | q << 26);
+  function v(m, B) {
+    return (m >>> 19 | B << 13) ^ (B >>> 29 | m << 3) ^ (m >>> 6 | B << 26);
   }
-  function b(m, q) {
-    return m >>> 0 < q >>> 0 ? 1 : 0;
+  function b(m, B) {
+    return m >>> 0 < B >>> 0 ? 1 : 0;
   }
   return r.prototype._update = function(m) {
-    for (var q = this._w, E = this._ah | 0, S = this._bh | 0, O = this._ch | 0, D = this._dh | 0, $ = this._eh | 0, j = this._fh | 0, J = this._gh | 0, ie = this._hh | 0, ne = this._al | 0, de = this._bl | 0, Z = this._cl | 0, y = this._dl | 0, g = this._el | 0, p = this._fl | 0, _ = this._gl | 0, R = this._hl | 0, B = 0; B < 32; B += 2)
-      q[B] = m.readInt32BE(B * 4), q[B + 1] = m.readInt32BE(B * 4 + 4);
-    for (; B < 160; B += 2) {
-      var P = q[B - 30], A = q[B - 30 + 1], w = e(P, A), M = s(A, P);
-      P = q[B - 4], A = q[B - 4 + 1];
-      var x = l(P, A), L = v(A, P), K = q[B - 14], Q = q[B - 14 + 1], H = q[B - 32], N = q[B - 32 + 1], F = M + Q | 0, ee = w + K + b(F, M) | 0;
-      F = F + L | 0, ee = ee + x + b(F, L) | 0, F = F + N | 0, ee = ee + H + b(F, N) | 0, q[B] = ee, q[B + 1] = F;
+    for (var B = this._w, E = this._ah | 0, S = this._bh | 0, O = this._ch | 0, D = this._dh | 0, $ = this._eh | 0, j = this._fh | 0, J = this._gh | 0, ie = this._hh | 0, ne = this._al | 0, de = this._bl | 0, Z = this._cl | 0, y = this._dl | 0, g = this._el | 0, p = this._fl | 0, _ = this._gl | 0, R = this._hl | 0, q = 0; q < 32; q += 2)
+      B[q] = m.readInt32BE(q * 4), B[q + 1] = m.readInt32BE(q * 4 + 4);
+    for (; q < 160; q += 2) {
+      var P = B[q - 30], A = B[q - 30 + 1], w = e(P, A), M = s(A, P);
+      P = B[q - 4], A = B[q - 4 + 1];
+      var x = l(P, A), L = v(A, P), K = B[q - 14], Q = B[q - 14 + 1], H = B[q - 32], N = B[q - 32 + 1], F = M + Q | 0, ee = w + K + b(F, M) | 0;
+      F = F + L | 0, ee = ee + x + b(F, L) | 0, F = F + N | 0, ee = ee + H + b(F, N) | 0, B[q] = ee, B[q + 1] = F;
     }
     for (var ae = 0; ae < 160; ae += 2) {
-      ee = q[ae], F = q[ae + 1];
+      ee = B[ae], F = B[ae + 1];
       var z = f(E, S, O), G = f(ne, de, Z), fe = a(E, ne), me = a(ne, E), xe = n($, g), _e = n(g, $), qe = o[ae], Re = o[ae + 1], be = h($, j, J), Fe = h(g, p, _), Be = R + _e | 0, Me = ie + xe + b(Be, R) | 0;
       Be = Be + Fe | 0, Me = Me + be + b(Be, Fe) | 0, Be = Be + Re | 0, Me = Me + qe + b(Be, Re) | 0, Be = Be + F | 0, Me = Me + ee + b(Be, F) | 0;
       var Te = me + G | 0, oe = fe + z + b(Te, me) | 0;
@@ -7358,10 +7358,10 @@ function requireSha512() {
     this._al = this._al + ne | 0, this._bl = this._bl + de | 0, this._cl = this._cl + Z | 0, this._dl = this._dl + y | 0, this._el = this._el + g | 0, this._fl = this._fl + p | 0, this._gl = this._gl + _ | 0, this._hl = this._hl + R | 0, this._ah = this._ah + E + b(this._al, ne) | 0, this._bh = this._bh + S + b(this._bl, de) | 0, this._ch = this._ch + O + b(this._cl, Z) | 0, this._dh = this._dh + D + b(this._dl, y) | 0, this._eh = this._eh + $ + b(this._el, g) | 0, this._fh = this._fh + j + b(this._fl, p) | 0, this._gh = this._gh + J + b(this._gl, _) | 0, this._hh = this._hh + ie + b(this._hl, R) | 0;
   }, r.prototype._hash = function() {
     var m = u.allocUnsafe(64);
-    function q(E, S, O) {
+    function B(E, S, O) {
       m.writeInt32BE(E, O), m.writeInt32BE(S, O + 4);
     }
-    return q(this._ah, this._al, 0), q(this._bh, this._bl, 8), q(this._ch, this._cl, 16), q(this._dh, this._dl, 24), q(this._eh, this._el, 32), q(this._fh, this._fl, 40), q(this._gh, this._gl, 48), q(this._hh, this._hl, 56), m;
+    return B(this._ah, this._al, 0), B(this._bh, this._bl, 8), B(this._ch, this._cl, 16), B(this._dh, this._dl, 24), B(this._eh, this._el, 32), B(this._fh, this._fl, 40), B(this._gh, this._gl, 48), B(this._hh, this._hl, 56), m;
   }, sha512$1 = r, sha512$1;
 }
 var sha384$1, hasRequiredSha384;
@@ -7611,26 +7611,26 @@ function requireSyncBrowser() {
     return new t().update(b).digest();
   }
   function s(b) {
-    function m(q) {
-      return u(b).update(q).digest();
+    function m(B) {
+      return u(b).update(B).digest();
     }
     return b === "rmd160" || b === "ripemd160" ? e : b === "md5" ? c : m;
   }
-  function l(b, m, q) {
+  function l(b, m, B) {
     var E = s(b), S = b === "sha512" || b === "sha384" ? 128 : 64;
     m.length > S ? m = E(m) : m.length < S && (m = o.concat([m, f], S));
     for (var O = o.allocUnsafe(S + a[b]), D = o.allocUnsafe(S + a[b]), $ = 0; $ < S; $++)
       O[$] = m[$] ^ 54, D[$] = m[$] ^ 92;
-    var j = o.allocUnsafe(S + q + 4);
+    var j = o.allocUnsafe(S + B + 4);
     O.copy(j, 0, 0, S), this.ipad1 = j, this.ipad2 = O, this.opad = D, this.alg = b, this.blocksize = S, this.hash = E, this.size = a[b];
   }
   l.prototype.run = function(b, m) {
     b.copy(m, this.blocksize);
-    var q = this.hash(m);
-    return q.copy(this.opad, this.blocksize), this.hash(this.opad);
+    var B = this.hash(m);
+    return B.copy(this.opad, this.blocksize), this.hash(this.opad);
   };
-  function v(b, m, q, E, S) {
-    d(q, E), b = h(b, r, "Password"), m = h(m, r, "Salt");
+  function v(b, m, B, E, S) {
+    d(B, E), b = h(b, r, "Password"), m = h(m, r, "Salt");
     var O = (S || "sha1").toLowerCase(), D = n[O] || O, $ = a[D];
     if (typeof $ != "number" || !$)
       throw new TypeError("Digest algorithm not supported: " + S);
@@ -7638,7 +7638,7 @@ function requireSyncBrowser() {
     m.copy(ie, 0, 0, m.length);
     for (var ne = 0, de = $, Z = Math.ceil(E / de), y = 1; y <= Z; y++) {
       ie.writeUInt32BE(y, m.length);
-      for (var g = j.run(ie, j.ipad1), p = g, _ = 1; _ < q; _++) {
+      for (var g = j.run(ie, j.ipad1), p = g, _ = 1; _ < B; _++) {
         p = j.run(p, j.ipad2);
         for (var R = 0; R < de; R++)
           g[R] ^= p[R];
@@ -7667,12 +7667,12 @@ function requireAsync() {
   function e() {
     return n || (commonjsGlobal.process && commonjsGlobal.process.nextTick ? n = commonjsGlobal.process.nextTick : commonjsGlobal.queueMicrotask ? n = commonjsGlobal.queueMicrotask : commonjsGlobal.setImmediate ? n = commonjsGlobal.setImmediate : n = commonjsGlobal.setTimeout, n);
   }
-  function s(b, m, q, E, S) {
+  function s(b, m, B, E, S) {
     return h.importKey("raw", b, { name: "PBKDF2" }, !1, ["deriveBits"]).then(function(O) {
       return h.deriveBits({
         name: "PBKDF2",
         salt: m,
-        iterations: q,
+        iterations: B,
         hash: {
           name: S
         }
@@ -7698,18 +7698,18 @@ function requireAsync() {
     return a[b] = m, m;
   }
   function v(b, m) {
-    b.then(function(q) {
+    b.then(function(B) {
       e()(function() {
-        m(null, q);
+        m(null, B);
       });
-    }, function(q) {
+    }, function(B) {
       e()(function() {
-        m(q);
+        m(B);
       });
     });
   }
-  return async = function(b, m, q, E, S, O) {
-    if (typeof S == "function" && (O = S, S = void 0), t(q, E), b = d(b, u, "Password"), m = d(m, u, "Salt"), typeof O != "function")
+  return async = function(b, m, B, E, S, O) {
+    if (typeof S == "function" && (O = S, S = void 0), t(B, E), b = d(b, u, "Password"), m = d(m, u, "Salt"), typeof O != "function")
       throw new Error("No callback provided to pbkdf2");
     S = S || "sha1";
     var D = f[S.toLowerCase()];
@@ -7717,7 +7717,7 @@ function requireAsync() {
       e()(function() {
         var $;
         try {
-          $ = o(b, m, q, E, S);
+          $ = o(b, m, B, E, S);
         } catch (j) {
           O(j);
           return;
@@ -7727,7 +7727,7 @@ function requireAsync() {
       return;
     }
     v(l(D).then(function($) {
-      return $ ? s(b, m, q, E, D) : o(b, m, q, E, S);
+      return $ ? s(b, m, B, E, D) : o(b, m, B, E, S);
     }), O);
   }, async;
 }
@@ -8549,17 +8549,17 @@ function requireDes$1() {
     return a.slice(0, a.length - n);
   }, r.prototype._encrypt = function(a, n, e, s, l) {
     for (var v = n, b = e, m = 0; m < a.keys.length; m += 2) {
-      var q = a.keys[m], E = a.keys[m + 1];
-      u.expand(b, a.tmp, 0), q ^= a.tmp[0], E ^= a.tmp[1];
-      var S = u.substitute(q, E), O = u.permute(S), D = b;
+      var B = a.keys[m], E = a.keys[m + 1];
+      u.expand(b, a.tmp, 0), B ^= a.tmp[0], E ^= a.tmp[1];
+      var S = u.substitute(B, E), O = u.permute(S), D = b;
       b = (v ^ O) >>> 0, v = D;
     }
     u.rip(b, v, s, l);
   }, r.prototype._decrypt = function(a, n, e, s, l) {
     for (var v = e, b = n, m = a.keys.length - 2; m >= 0; m -= 2) {
-      var q = a.keys[m], E = a.keys[m + 1];
-      u.expand(v, a.tmp, 0), q ^= a.tmp[0], E ^= a.tmp[1];
-      var S = u.substitute(q, E), O = u.permute(S), D = v;
+      var B = a.keys[m], E = a.keys[m + 1];
+      u.expand(v, a.tmp, 0), B ^= a.tmp[0], E ^= a.tmp[1];
+      var S = u.substitute(B, E), O = u.permute(S), D = v;
       v = (b ^ O) >>> 0, b = D;
     }
     u.rip(v, b, s, l);
@@ -8882,18 +8882,18 @@ function requireAes() {
       f[a] = 0;
   }
   function o(f, a, n, e, s) {
-    for (var l = n[0], v = n[1], b = n[2], m = n[3], q = f[0] ^ a[0], E = f[1] ^ a[1], S = f[2] ^ a[2], O = f[3] ^ a[3], D, $, j, J, ie = 4, ne = 1; ne < s; ne++)
-      D = l[q >>> 24] ^ v[E >>> 16 & 255] ^ b[S >>> 8 & 255] ^ m[O & 255] ^ a[ie++], $ = l[E >>> 24] ^ v[S >>> 16 & 255] ^ b[O >>> 8 & 255] ^ m[q & 255] ^ a[ie++], j = l[S >>> 24] ^ v[O >>> 16 & 255] ^ b[q >>> 8 & 255] ^ m[E & 255] ^ a[ie++], J = l[O >>> 24] ^ v[q >>> 16 & 255] ^ b[E >>> 8 & 255] ^ m[S & 255] ^ a[ie++], q = D, E = $, S = j, O = J;
-    return D = (e[q >>> 24] << 24 | e[E >>> 16 & 255] << 16 | e[S >>> 8 & 255] << 8 | e[O & 255]) ^ a[ie++], $ = (e[E >>> 24] << 24 | e[S >>> 16 & 255] << 16 | e[O >>> 8 & 255] << 8 | e[q & 255]) ^ a[ie++], j = (e[S >>> 24] << 24 | e[O >>> 16 & 255] << 16 | e[q >>> 8 & 255] << 8 | e[E & 255]) ^ a[ie++], J = (e[O >>> 24] << 24 | e[q >>> 16 & 255] << 16 | e[E >>> 8 & 255] << 8 | e[S & 255]) ^ a[ie++], D = D >>> 0, $ = $ >>> 0, j = j >>> 0, J = J >>> 0, [D, $, j, J];
+    for (var l = n[0], v = n[1], b = n[2], m = n[3], B = f[0] ^ a[0], E = f[1] ^ a[1], S = f[2] ^ a[2], O = f[3] ^ a[3], D, $, j, J, ie = 4, ne = 1; ne < s; ne++)
+      D = l[B >>> 24] ^ v[E >>> 16 & 255] ^ b[S >>> 8 & 255] ^ m[O & 255] ^ a[ie++], $ = l[E >>> 24] ^ v[S >>> 16 & 255] ^ b[O >>> 8 & 255] ^ m[B & 255] ^ a[ie++], j = l[S >>> 24] ^ v[O >>> 16 & 255] ^ b[B >>> 8 & 255] ^ m[E & 255] ^ a[ie++], J = l[O >>> 24] ^ v[B >>> 16 & 255] ^ b[E >>> 8 & 255] ^ m[S & 255] ^ a[ie++], B = D, E = $, S = j, O = J;
+    return D = (e[B >>> 24] << 24 | e[E >>> 16 & 255] << 16 | e[S >>> 8 & 255] << 8 | e[O & 255]) ^ a[ie++], $ = (e[E >>> 24] << 24 | e[S >>> 16 & 255] << 16 | e[O >>> 8 & 255] << 8 | e[B & 255]) ^ a[ie++], j = (e[S >>> 24] << 24 | e[O >>> 16 & 255] << 16 | e[B >>> 8 & 255] << 8 | e[E & 255]) ^ a[ie++], J = (e[O >>> 24] << 24 | e[B >>> 16 & 255] << 16 | e[E >>> 8 & 255] << 8 | e[S & 255]) ^ a[ie++], D = D >>> 0, $ = $ >>> 0, j = j >>> 0, J = J >>> 0, [D, $, j, J];
   }
   var d = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], r = (function() {
     for (var f = new Array(256), a = 0; a < 256; a++)
       a < 128 ? f[a] = a << 1 : f[a] = a << 1 ^ 283;
     for (var n = [], e = [], s = [[], [], [], []], l = [[], [], [], []], v = 0, b = 0, m = 0; m < 256; ++m) {
-      var q = b ^ b << 1 ^ b << 2 ^ b << 3 ^ b << 4;
-      q = q >>> 8 ^ q & 255 ^ 99, n[v] = q, e[q] = v;
-      var E = f[v], S = f[E], O = f[S], D = f[q] * 257 ^ q * 16843008;
-      s[0][v] = D << 24 | D >>> 8, s[1][v] = D << 16 | D >>> 16, s[2][v] = D << 8 | D >>> 24, s[3][v] = D, D = O * 16843009 ^ S * 65537 ^ E * 257 ^ v * 16843008, l[0][q] = D << 24 | D >>> 8, l[1][q] = D << 16 | D >>> 16, l[2][q] = D << 8 | D >>> 24, l[3][q] = D, v === 0 ? v = b = 1 : (v = E ^ f[f[f[O ^ E]]], b ^= f[f[b]]);
+      var B = b ^ b << 1 ^ b << 2 ^ b << 3 ^ b << 4;
+      B = B >>> 8 ^ B & 255 ^ 99, n[v] = B, e[B] = v;
+      var E = f[v], S = f[E], O = f[S], D = f[B] * 257 ^ B * 16843008;
+      s[0][v] = D << 24 | D >>> 8, s[1][v] = D << 16 | D >>> 16, s[2][v] = D << 8 | D >>> 24, s[3][v] = D, D = O * 16843009 ^ S * 65537 ^ E * 257 ^ v * 16843008, l[0][B] = D << 24 | D >>> 8, l[1][B] = D << 16 | D >>> 16, l[2][B] = D << 8 | D >>> 24, l[3][B] = D, v === 0 ? v = b = 1 : (v = E ^ f[f[f[O ^ E]]], b ^= f[f[b]]);
     }
     return {
       SBOX: n,
@@ -8913,8 +8913,8 @@ function requireAes() {
       l % a === 0 ? (v = v << 8 | v >>> 24, v = r.SBOX[v >>> 24] << 24 | r.SBOX[v >>> 16 & 255] << 16 | r.SBOX[v >>> 8 & 255] << 8 | r.SBOX[v & 255], v ^= d[l / a | 0] << 24) : a > 6 && l % a === 4 && (v = r.SBOX[v >>> 24] << 24 | r.SBOX[v >>> 16 & 255] << 16 | r.SBOX[v >>> 8 & 255] << 8 | r.SBOX[v & 255]), s[l] = s[l - a] ^ v;
     }
     for (var b = [], m = 0; m < e; m++) {
-      var q = e - m, E = s[q - (m % 4 ? 0 : 4)];
-      m < 4 || q <= 4 ? b[m] = E : b[m] = r.INV_SUB_MIX[0][r.SBOX[E >>> 24]] ^ r.INV_SUB_MIX[1][r.SBOX[E >>> 16 & 255]] ^ r.INV_SUB_MIX[2][r.SBOX[E >>> 8 & 255]] ^ r.INV_SUB_MIX[3][r.SBOX[E & 255]];
+      var B = e - m, E = s[B - (m % 4 ? 0 : 4)];
+      m < 4 || B <= 4 ? b[m] = E : b[m] = r.INV_SUB_MIX[0][r.SBOX[E >>> 24]] ^ r.INV_SUB_MIX[1][r.SBOX[E >>> 16 & 255]] ^ r.INV_SUB_MIX[2][r.SBOX[E >>> 8 & 255]] ^ r.INV_SUB_MIX[3][r.SBOX[E & 255]];
     }
     this._nRounds = n, this._keySchedule = s, this._invKeySchedule = b;
   }, h.prototype.encryptBlockRaw = function(f) {
@@ -8988,8 +8988,8 @@ function requireAuthCipher() {
       return e._finID = t.concat([s, t.from([0, 0, 0, 1])]), t.concat([s, t.from([0, 0, 0, 2])]);
     var v = new d(l), b = s.length, m = b % 16;
     v.update(s), m && (m = 16 - m, v.update(t.alloc(m, 0))), v.update(t.alloc(8, 0));
-    var q = b * 8, E = t.alloc(8);
-    E.writeUIntBE(q, 0, 8), v.update(E), e._finID = v.state;
+    var B = b * 8, E = t.alloc(8);
+    E.writeUIntBE(B, 0, 8), v.update(E), e._finID = v.state;
     var S = t.from(e._finID);
     return h(S), S;
   }
@@ -9073,9 +9073,9 @@ function requireEncrypter() {
   }
   f(a, d), a.prototype._update = function(v) {
     this._cache.add(v);
-    for (var b, m, q = []; b = this._cache.get(); )
-      m = this._mode.encrypt(this, b), q.push(m);
-    return u.concat(q);
+    for (var b, m, B = []; b = this._cache.get(); )
+      m = this._mode.encrypt(this, b), B.push(m);
+    return u.concat(B);
   };
   var n = u.alloc(16, 16);
   a.prototype._final = function() {
@@ -9104,17 +9104,17 @@ function requireEncrypter() {
     return u.concat([this.cache, b]);
   };
   function s(v, b, m) {
-    var q = c[v.toLowerCase()];
-    if (!q) throw new TypeError("invalid suite type");
-    if (typeof b == "string" && (b = u.from(b)), b.length !== q.key / 8) throw new TypeError("invalid key length " + b.length);
-    if (typeof m == "string" && (m = u.from(m)), q.mode !== "GCM" && m.length !== q.iv) throw new TypeError("invalid iv length " + m.length);
-    return q.type === "stream" ? new o(q.module, b, m) : q.type === "auth" ? new t(q.module, b, m) : new a(q.module, b, m);
+    var B = c[v.toLowerCase()];
+    if (!B) throw new TypeError("invalid suite type");
+    if (typeof b == "string" && (b = u.from(b)), b.length !== B.key / 8) throw new TypeError("invalid key length " + b.length);
+    if (typeof m == "string" && (m = u.from(m)), B.mode !== "GCM" && m.length !== B.iv) throw new TypeError("invalid iv length " + m.length);
+    return B.type === "stream" ? new o(B.module, b, m) : B.type === "auth" ? new t(B.module, b, m) : new a(B.module, b, m);
   }
   function l(v, b) {
     var m = c[v.toLowerCase()];
     if (!m) throw new TypeError("invalid suite type");
-    var q = h(b, !1, m.key, m.iv);
-    return s(v, q.key, q.iv);
+    var B = h(b, !1, m.key, m.iv);
+    return s(v, B.key, B.iv);
   }
   return encrypter.createCipheriv = s, encrypter.createCipher = l, encrypter;
 }
@@ -9128,9 +9128,9 @@ function requireDecrypter() {
   }
   f(a, d), a.prototype._update = function(v) {
     this._cache.add(v);
-    for (var b, m, q = []; b = this._cache.get(this._autopadding); )
-      m = this._mode.decrypt(this, b), q.push(m);
-    return t.concat(q);
+    for (var b, m, B = []; b = this._cache.get(this._autopadding); )
+      m = this._mode.decrypt(this, b), B.push(m);
+    return t.concat(B);
   }, a.prototype._final = function() {
     var v = this._cache.flush();
     if (this._autopadding)
@@ -9167,17 +9167,17 @@ function requireDecrypter() {
       return v.slice(0, 16 - b);
   }
   function s(v, b, m) {
-    var q = u[v.toLowerCase()];
-    if (!q) throw new TypeError("invalid suite type");
-    if (typeof m == "string" && (m = t.from(m)), q.mode !== "GCM" && m.length !== q.iv) throw new TypeError("invalid iv length " + m.length);
-    if (typeof b == "string" && (b = t.from(b)), b.length !== q.key / 8) throw new TypeError("invalid key length " + b.length);
-    return q.type === "stream" ? new o(q.module, b, m, !0) : q.type === "auth" ? new c(q.module, b, m, !0) : new a(q.module, b, m);
+    var B = u[v.toLowerCase()];
+    if (!B) throw new TypeError("invalid suite type");
+    if (typeof m == "string" && (m = t.from(m)), B.mode !== "GCM" && m.length !== B.iv) throw new TypeError("invalid iv length " + m.length);
+    if (typeof b == "string" && (b = t.from(b)), b.length !== B.key / 8) throw new TypeError("invalid key length " + b.length);
+    return B.type === "stream" ? new o(B.module, b, m, !0) : B.type === "auth" ? new c(B.module, b, m, !0) : new a(B.module, b, m);
   }
   function l(v, b) {
     var m = u[v.toLowerCase()];
     if (!m) throw new TypeError("invalid suite type");
-    var q = h(b, !1, m.key, m.iv);
-    return s(v, q.key, q.iv);
+    var B = h(b, !1, m.key, m.iv);
+    return s(v, B.key, B.iv);
   }
   return decrypter.createDecipher = l, decrypter.createDecipheriv = s, decrypter;
 }
@@ -9312,13 +9312,13 @@ function requireBn$1() {
         this.length = Math.ceil(y.length / 3), this.words = new Array(this.length);
         for (var _ = 0; _ < this.length; _++)
           this.words[_] = 0;
-        var R, B, P = 0;
+        var R, q, P = 0;
         if (p === "be")
           for (_ = y.length - 1, R = 0; _ >= 0; _ -= 3)
-            B = y[_] | y[_ - 1] << 8 | y[_ - 2] << 16, this.words[R] |= B << P & 67108863, this.words[R + 1] = B >>> 26 - P & 67108863, P += 24, P >= 26 && (P -= 26, R++);
+            q = y[_] | y[_ - 1] << 8 | y[_ - 2] << 16, this.words[R] |= q << P & 67108863, this.words[R + 1] = q >>> 26 - P & 67108863, P += 24, P >= 26 && (P -= 26, R++);
         else if (p === "le")
           for (_ = 0, R = 0; _ < y.length; _ += 3)
-            B = y[_] | y[_ + 1] << 8 | y[_ + 2] << 16, this.words[R] |= B << P & 67108863, this.words[R + 1] = B >>> 26 - P & 67108863, P += 24, P >= 26 && (P -= 26, R++);
+            q = y[_] | y[_ + 1] << 8 | y[_ + 2] << 16, this.words[R] |= q << P & 67108863, this.words[R + 1] = q >>> 26 - P & 67108863, P += 24, P >= 26 && (P -= 26, R++);
         return this.strip();
       };
       function f(Z, y) {
@@ -9333,20 +9333,20 @@ function requireBn$1() {
         this.length = Math.ceil((y.length - g) / 6), this.words = new Array(this.length);
         for (var _ = 0; _ < this.length; _++)
           this.words[_] = 0;
-        var R = 0, B = 0, P;
+        var R = 0, q = 0, P;
         if (p === "be")
           for (_ = y.length - 1; _ >= g; _ -= 2)
-            P = a(y, g, _) << R, this.words[B] |= P & 67108863, R >= 18 ? (R -= 18, B += 1, this.words[B] |= P >>> 26) : R += 8;
+            P = a(y, g, _) << R, this.words[q] |= P & 67108863, R >= 18 ? (R -= 18, q += 1, this.words[q] |= P >>> 26) : R += 8;
         else {
           var A = y.length - g;
           for (_ = A % 2 === 0 ? g + 1 : g; _ < y.length; _ += 2)
-            P = a(y, g, _) << R, this.words[B] |= P & 67108863, R >= 18 ? (R -= 18, B += 1, this.words[B] |= P >>> 26) : R += 8;
+            P = a(y, g, _) << R, this.words[q] |= P & 67108863, R >= 18 ? (R -= 18, q += 1, this.words[q] |= P >>> 26) : R += 8;
         }
         this.strip();
       };
       function n(Z, y, g, p) {
-        for (var _ = 0, R = Math.min(Z.length, g), B = y; B < R; B++) {
-          var P = Z.charCodeAt(B) - 48;
+        for (var _ = 0, R = Math.min(Z.length, g), q = y; q < R; q++) {
+          var P = Z.charCodeAt(q) - 48;
           _ *= p, P >= 49 ? _ += P - 49 + 10 : P >= 17 ? _ += P - 17 + 10 : _ += P;
         }
         return _;
@@ -9356,7 +9356,7 @@ function requireBn$1() {
         for (var _ = 0, R = 1; R <= 67108863; R *= g)
           _++;
         _--, R = R / g | 0;
-        for (var B = y.length - p, P = B % _, A = Math.min(B, B - P) + p, w = 0, M = p; M < A; M += _)
+        for (var q = y.length - p, P = q % _, A = Math.min(q, q - P) + p, w = 0, M = p; M < A; M += _)
           w = n(y, M, M + _, g), this.imuln(R), this.words[0] + w < 67108864 ? this.words[0] += w : this._iaddn(w);
         if (P !== 0) {
           var x = 1;
@@ -9495,9 +9495,9 @@ function requireBn$1() {
         var p;
         if (y === 16 || y === "hex") {
           p = "";
-          for (var _ = 0, R = 0, B = 0; B < this.length; B++) {
-            var P = this.words[B], A = ((P << _ | R) & 16777215).toString(16);
-            R = P >>> 24 - _ & 16777215, _ += 2, _ >= 26 && (_ -= 26, B--), R !== 0 || B !== this.length - 1 ? p = e[6 - A.length] + A + p : p = A + p;
+          for (var _ = 0, R = 0, q = 0; q < this.length; q++) {
+            var P = this.words[q], A = ((P << _ | R) & 16777215).toString(16);
+            R = P >>> 24 - _ & 16777215, _ += 2, _ >= 26 && (_ -= 26, q--), R !== 0 || q !== this.length - 1 ? p = e[6 - A.length] + A + p : p = A + p;
           }
           for (R !== 0 && (p = R.toString(16) + p); p.length % g !== 0; )
             p = "0" + p;
@@ -9528,8 +9528,8 @@ function requireBn$1() {
       }, r.prototype.toArrayLike = function(y, g, p) {
         var _ = this.byteLength(), R = p || Math.max(1, _);
         o(_ <= R, "byte array longer than desired length"), o(R > 0, "Requested array length <= 0"), this.strip();
-        var B = g === "le", P = new y(R), A, w, M = this.clone();
-        if (B) {
+        var q = g === "le", P = new y(R), A, w, M = this.clone();
+        if (q) {
           for (w = 0; !M.isZero(); w++)
             A = M.andln(255), M.iushrn(8), P[w] = A;
           for (; w < R; w++)
@@ -9640,15 +9640,15 @@ function requireBn$1() {
           return y.negative = 0, g = this.isub(y), y.negative = 1, g._normSign();
         var p, _;
         this.length > y.length ? (p = this, _ = y) : (p = y, _ = this);
-        for (var R = 0, B = 0; B < _.length; B++)
-          g = (p.words[B] | 0) + (_.words[B] | 0) + R, this.words[B] = g & 67108863, R = g >>> 26;
-        for (; R !== 0 && B < p.length; B++)
-          g = (p.words[B] | 0) + R, this.words[B] = g & 67108863, R = g >>> 26;
+        for (var R = 0, q = 0; q < _.length; q++)
+          g = (p.words[q] | 0) + (_.words[q] | 0) + R, this.words[q] = g & 67108863, R = g >>> 26;
+        for (; R !== 0 && q < p.length; q++)
+          g = (p.words[q] | 0) + R, this.words[q] = g & 67108863, R = g >>> 26;
         if (this.length = p.length, R !== 0)
           this.words[this.length] = R, this.length++;
         else if (p !== this)
-          for (; B < p.length; B++)
-            this.words[B] = p.words[B];
+          for (; q < p.length; q++)
+            this.words[q] = p.words[q];
         return this;
       }, r.prototype.add = function(y) {
         var g;
@@ -9665,11 +9665,11 @@ function requireBn$1() {
           return this.negative = 0, this.length = 1, this.words[0] = 0, this;
         var _, R;
         p > 0 ? (_ = this, R = y) : (_ = y, R = this);
-        for (var B = 0, P = 0; P < R.length; P++)
-          g = (_.words[P] | 0) - (R.words[P] | 0) + B, B = g >> 26, this.words[P] = g & 67108863;
-        for (; B !== 0 && P < _.length; P++)
-          g = (_.words[P] | 0) + B, B = g >> 26, this.words[P] = g & 67108863;
-        if (B === 0 && P < _.length && _ !== this)
+        for (var q = 0, P = 0; P < R.length; P++)
+          g = (_.words[P] | 0) - (R.words[P] | 0) + q, q = g >> 26, this.words[P] = g & 67108863;
+        for (; q !== 0 && P < _.length; P++)
+          g = (_.words[P] | 0) + q, q = g >> 26, this.words[P] = g & 67108863;
+        if (q === 0 && P < _.length && _ !== this)
           for (; P < _.length; P++)
             this.words[P] = _.words[P];
         return this.length = Math.max(this.length, P), _ !== this && (this.negative = 1), this.strip();
@@ -9680,19 +9680,19 @@ function requireBn$1() {
         g.negative = y.negative ^ Z.negative;
         var p = Z.length + y.length | 0;
         g.length = p, p = p - 1 | 0;
-        var _ = Z.words[0] | 0, R = y.words[0] | 0, B = _ * R, P = B & 67108863, A = B / 67108864 | 0;
+        var _ = Z.words[0] | 0, R = y.words[0] | 0, q = _ * R, P = q & 67108863, A = q / 67108864 | 0;
         g.words[0] = P;
         for (var w = 1; w < p; w++) {
           for (var M = A >>> 26, x = A & 67108863, L = Math.min(w, y.length - 1), K = Math.max(0, w - Z.length + 1); K <= L; K++) {
             var Q = w - K | 0;
-            _ = Z.words[Q] | 0, R = y.words[K] | 0, B = _ * R + x, M += B / 67108864 | 0, x = B & 67108863;
+            _ = Z.words[Q] | 0, R = y.words[K] | 0, q = _ * R + x, M += q / 67108864 | 0, x = q & 67108863;
           }
           g.words[w] = x | 0, A = M | 0;
         }
         return A !== 0 ? g.words[w] = A | 0 : g.length--, g.strip();
       }
       var m = function(y, g, p) {
-        var _ = y.words, R = g.words, B = p.words, P = 0, A, w, M, x = _[0] | 0, L = x & 8191, K = x >>> 13, Q = _[1] | 0, H = Q & 8191, N = Q >>> 13, F = _[2] | 0, ee = F & 8191, ae = F >>> 13, z = _[3] | 0, G = z & 8191, fe = z >>> 13, me = _[4] | 0, xe = me & 8191, _e = me >>> 13, qe = _[5] | 0, Re = qe & 8191, be = qe >>> 13, Fe = _[6] | 0, Be = Fe & 8191, Me = Fe >>> 13, Te = _[7] | 0, oe = Te & 8191, ce = Te >>> 13, ge = _[8] | 0, we = ge & 8191, Se = ge >>> 13, Oe = _[9] | 0, U = Oe & 8191, I = Oe >>> 13, C = R[0] | 0, X = C & 8191, se = C >>> 13, le = R[1] | 0, ve = le & 8191, Ce = le >>> 13, Le = R[2] | 0, Ie = Le & 8191, je = Le >>> 13, $e = R[3] | 0, He = $e & 8191, Ke = $e >>> 13, Ze = R[4] | 0, We = Ze & 8191, Ye = Ze >>> 13, Xe = R[5] | 0, W = Xe & 8191, T = Xe >>> 13, k = R[6] | 0, re = k & 8191, ue = k >>> 13, pe = R[7] | 0, ye = pe & 8191, ke = pe >>> 13, Ve = R[8] | 0, Ne = Ve & 8191, Ge = Ve >>> 13, Ue = R[9] | 0, ze = Ue & 8191, Je = Ue >>> 13;
+        var _ = y.words, R = g.words, q = p.words, P = 0, A, w, M, x = _[0] | 0, L = x & 8191, K = x >>> 13, Q = _[1] | 0, H = Q & 8191, N = Q >>> 13, F = _[2] | 0, ee = F & 8191, ae = F >>> 13, z = _[3] | 0, G = z & 8191, fe = z >>> 13, me = _[4] | 0, xe = me & 8191, _e = me >>> 13, qe = _[5] | 0, Re = qe & 8191, be = qe >>> 13, Fe = _[6] | 0, Be = Fe & 8191, Me = Fe >>> 13, Te = _[7] | 0, oe = Te & 8191, ce = Te >>> 13, ge = _[8] | 0, we = ge & 8191, Se = ge >>> 13, Oe = _[9] | 0, U = Oe & 8191, I = Oe >>> 13, C = R[0] | 0, X = C & 8191, se = C >>> 13, le = R[1] | 0, ve = le & 8191, Ce = le >>> 13, Le = R[2] | 0, Ie = Le & 8191, je = Le >>> 13, $e = R[3] | 0, He = $e & 8191, Ke = $e >>> 13, Ze = R[4] | 0, We = Ze & 8191, Ye = Ze >>> 13, Xe = R[5] | 0, W = Xe & 8191, T = Xe >>> 13, k = R[6] | 0, re = k & 8191, ue = k >>> 13, pe = R[7] | 0, ye = pe & 8191, ke = pe >>> 13, Ve = R[8] | 0, Ne = Ve & 8191, Ge = Ve >>> 13, Ue = R[9] | 0, ze = Ue & 8191, Je = Ue >>> 13;
         p.negative = y.negative ^ g.negative, p.length = 19, A = Math.imul(L, X), w = Math.imul(L, se), w = w + Math.imul(K, X) | 0, M = Math.imul(K, se);
         var Qe = (P + A | 0) + ((w & 8191) << 13) | 0;
         P = (M + (w >>> 13) | 0) + (Qe >>> 26) | 0, Qe &= 67108863, A = Math.imul(H, X), w = Math.imul(H, se), w = w + Math.imul(N, X) | 0, M = Math.imul(N, se), A = A + Math.imul(L, ve) | 0, w = w + Math.imul(L, Ce) | 0, w = w + Math.imul(K, ve) | 0, M = M + Math.imul(K, Ce) | 0;
@@ -9731,19 +9731,19 @@ function requireBn$1() {
         var xr = (P + A | 0) + ((w & 8191) << 13) | 0;
         P = (M + (w >>> 13) | 0) + (xr >>> 26) | 0, xr &= 67108863, A = Math.imul(U, ze), w = Math.imul(U, Je), w = w + Math.imul(I, ze) | 0, M = Math.imul(I, Je);
         var Sr = (P + A | 0) + ((w & 8191) << 13) | 0;
-        return P = (M + (w >>> 13) | 0) + (Sr >>> 26) | 0, Sr &= 67108863, B[0] = Qe, B[1] = er, B[2] = fr, B[3] = ur, B[4] = cr, B[5] = nr, B[6] = hr, B[7] = lr, B[8] = dr, B[9] = pr, B[10] = vr, B[11] = br, B[12] = yr, B[13] = gr, B[14] = wr, B[15] = rr, B[16] = _r, B[17] = xr, B[18] = Sr, P !== 0 && (B[19] = P, p.length++), p;
+        return P = (M + (w >>> 13) | 0) + (Sr >>> 26) | 0, Sr &= 67108863, q[0] = Qe, q[1] = er, q[2] = fr, q[3] = ur, q[4] = cr, q[5] = nr, q[6] = hr, q[7] = lr, q[8] = dr, q[9] = pr, q[10] = vr, q[11] = br, q[12] = yr, q[13] = gr, q[14] = wr, q[15] = rr, q[16] = _r, q[17] = xr, q[18] = Sr, P !== 0 && (q[19] = P, p.length++), p;
       };
       Math.imul || (m = b);
-      function q(Z, y, g) {
+      function B(Z, y, g) {
         g.negative = y.negative ^ Z.negative, g.length = Z.length + y.length;
         for (var p = 0, _ = 0, R = 0; R < g.length - 1; R++) {
-          var B = _;
+          var q = _;
           _ = 0;
           for (var P = p & 67108863, A = Math.min(R, y.length - 1), w = Math.max(0, R - Z.length + 1); w <= A; w++) {
             var M = R - w, x = Z.words[M] | 0, L = y.words[w] | 0, K = x * L, Q = K & 67108863;
-            B = B + (K / 67108864 | 0) | 0, Q = Q + P | 0, P = Q & 67108863, B = B + (Q >>> 26) | 0, _ += B >>> 26, B &= 67108863;
+            q = q + (K / 67108864 | 0) | 0, Q = Q + P | 0, P = Q & 67108863, q = q + (Q >>> 26) | 0, _ += q >>> 26, q &= 67108863;
           }
-          g.words[R] = P, p = B, B = _;
+          g.words[R] = P, p = q, q = _;
         }
         return p !== 0 ? g.words[R] = p : g.length--, g.strip();
       }
@@ -9753,7 +9753,7 @@ function requireBn$1() {
       }
       r.prototype.mulTo = function(y, g) {
         var p, _ = this.length + y.length;
-        return this.length === 10 && y.length === 10 ? p = m(this, y, g) : _ < 63 ? p = b(this, y, g) : _ < 1024 ? p = q(this, y, g) : p = E(this, y, g), p;
+        return this.length === 10 && y.length === 10 ? p = m(this, y, g) : _ < 63 ? p = b(this, y, g) : _ < 1024 ? p = B(this, y, g) : p = E(this, y, g), p;
       };
       function S(Z, y) {
         this.x = Z, this.y = y;
@@ -9767,11 +9767,11 @@ function requireBn$1() {
         for (var _ = 0, R = 0; R < g; R++)
           _ |= (y & 1) << g - R - 1, y >>= 1;
         return _;
-      }, S.prototype.permute = function(y, g, p, _, R, B) {
-        for (var P = 0; P < B; P++)
+      }, S.prototype.permute = function(y, g, p, _, R, q) {
+        for (var P = 0; P < q; P++)
           _[P] = g[y[P]], R[P] = p[y[P]];
-      }, S.prototype.transform = function(y, g, p, _, R, B) {
-        this.permute(B, y, g, p, _, R);
+      }, S.prototype.transform = function(y, g, p, _, R, q) {
+        this.permute(q, y, g, p, _, R);
         for (var P = 1; P < R; P <<= 1)
           for (var A = P << 1, w = Math.cos(2 * Math.PI / A), M = Math.sin(2 * Math.PI / A), x = 0; x < R; x += A)
             for (var L = w, K = M, Q = 0; Q < P; Q++) {
@@ -9796,23 +9796,23 @@ function requireBn$1() {
         }
         return y;
       }, S.prototype.convert13b = function(y, g, p, _) {
-        for (var R = 0, B = 0; B < g; B++)
-          R = R + (y[B] | 0), p[2 * B] = R & 8191, R = R >>> 13, p[2 * B + 1] = R & 8191, R = R >>> 13;
-        for (B = 2 * g; B < _; ++B)
-          p[B] = 0;
+        for (var R = 0, q = 0; q < g; q++)
+          R = R + (y[q] | 0), p[2 * q] = R & 8191, R = R >>> 13, p[2 * q + 1] = R & 8191, R = R >>> 13;
+        for (q = 2 * g; q < _; ++q)
+          p[q] = 0;
         o(R === 0), o((R & -8192) === 0);
       }, S.prototype.stub = function(y) {
         for (var g = new Array(y), p = 0; p < y; p++)
           g[p] = 0;
         return g;
       }, S.prototype.mulp = function(y, g, p) {
-        var _ = 2 * this.guessLen13b(y.length, g.length), R = this.makeRBT(_), B = this.stub(_), P = new Array(_), A = new Array(_), w = new Array(_), M = new Array(_), x = new Array(_), L = new Array(_), K = p.words;
-        K.length = _, this.convert13b(y.words, y.length, P, _), this.convert13b(g.words, g.length, M, _), this.transform(P, B, A, w, _, R), this.transform(M, B, x, L, _, R);
+        var _ = 2 * this.guessLen13b(y.length, g.length), R = this.makeRBT(_), q = this.stub(_), P = new Array(_), A = new Array(_), w = new Array(_), M = new Array(_), x = new Array(_), L = new Array(_), K = p.words;
+        K.length = _, this.convert13b(y.words, y.length, P, _), this.convert13b(g.words, g.length, M, _), this.transform(P, q, A, w, _, R), this.transform(M, q, x, L, _, R);
         for (var Q = 0; Q < _; Q++) {
           var H = A[Q] * x[Q] - w[Q] * L[Q];
           w[Q] = A[Q] * L[Q] + w[Q] * x[Q], A[Q] = H;
         }
-        return this.conjugate(A, w, _), this.transform(A, w, K, B, _, R), this.conjugate(K, B, _), this.normalize13b(K, _), p.negative = y.negative ^ g.negative, p.length = y.length + g.length, p.strip();
+        return this.conjugate(A, w, _), this.transform(A, w, K, q, _, R), this.conjugate(K, q, _), this.normalize13b(K, _), p.negative = y.negative ^ g.negative, p.length = y.length + g.length, p.strip();
       }, r.prototype.mul = function(y) {
         var g = new r(null);
         return g.words = new Array(this.length + y.length), this.mulTo(y, g);
@@ -9847,12 +9847,12 @@ function requireBn$1() {
         o(typeof y == "number" && y >= 0);
         var g = y % 26, p = (y - g) / 26, _ = 67108863 >>> 26 - g << 26 - g, R;
         if (g !== 0) {
-          var B = 0;
+          var q = 0;
           for (R = 0; R < this.length; R++) {
             var P = this.words[R] & _, A = (this.words[R] | 0) - P << g;
-            this.words[R] = A | B, B = P >>> 26 - g;
+            this.words[R] = A | q, q = P >>> 26 - g;
           }
-          B && (this.words[R] = B, this.length++);
+          q && (this.words[R] = q, this.length++);
         }
         if (p !== 0) {
           for (R = this.length - 1; R >= 0; R--)
@@ -9868,15 +9868,15 @@ function requireBn$1() {
         o(typeof y == "number" && y >= 0);
         var _;
         g ? _ = (g - g % 26) / 26 : _ = 0;
-        var R = y % 26, B = Math.min((y - R) / 26, this.length), P = 67108863 ^ 67108863 >>> R << R, A = p;
-        if (_ -= B, _ = Math.max(0, _), A) {
-          for (var w = 0; w < B; w++)
+        var R = y % 26, q = Math.min((y - R) / 26, this.length), P = 67108863 ^ 67108863 >>> R << R, A = p;
+        if (_ -= q, _ = Math.max(0, _), A) {
+          for (var w = 0; w < q; w++)
             A.words[w] = this.words[w];
-          A.length = B;
+          A.length = q;
         }
-        if (B !== 0) if (this.length > B)
-          for (this.length -= B, w = 0; w < this.length; w++)
-            this.words[w] = this.words[w + B];
+        if (q !== 0) if (this.length > q)
+          for (this.length -= q, w = 0; w < this.length; w++)
+            this.words[w] = this.words[w + q];
         else
           this.words[0] = 0, this.length = 1;
         var M = 0;
@@ -9941,21 +9941,21 @@ function requireBn$1() {
       }, r.prototype._ishlnsubmul = function(y, g, p) {
         var _ = y.length + p, R;
         this._expand(_);
-        var B, P = 0;
+        var q, P = 0;
         for (R = 0; R < y.length; R++) {
-          B = (this.words[R + p] | 0) + P;
+          q = (this.words[R + p] | 0) + P;
           var A = (y.words[R] | 0) * g;
-          B -= A & 67108863, P = (B >> 26) - (A / 67108864 | 0), this.words[R + p] = B & 67108863;
+          q -= A & 67108863, P = (q >> 26) - (A / 67108864 | 0), this.words[R + p] = q & 67108863;
         }
         for (; R < this.length - p; R++)
-          B = (this.words[R + p] | 0) + P, P = B >> 26, this.words[R + p] = B & 67108863;
+          q = (this.words[R + p] | 0) + P, P = q >> 26, this.words[R + p] = q & 67108863;
         if (P === 0) return this.strip();
         for (o(P === -1), P = 0, R = 0; R < this.length; R++)
-          B = -(this.words[R] | 0) + P, P = B >> 26, this.words[R] = B & 67108863;
+          q = -(this.words[R] | 0) + P, P = q >> 26, this.words[R] = q & 67108863;
         return this.negative = 1, this.strip();
       }, r.prototype._wordDiv = function(y, g) {
-        var p = this.length - y.length, _ = this.clone(), R = y, B = R.words[R.length - 1] | 0, P = this._countBits(B);
-        p = 26 - P, p !== 0 && (R = R.ushln(p), _.iushln(p), B = R.words[R.length - 1] | 0);
+        var p = this.length - y.length, _ = this.clone(), R = y, q = R.words[R.length - 1] | 0, P = this._countBits(q);
+        p = 26 - P, p !== 0 && (R = R.ushln(p), _.iushln(p), q = R.words[R.length - 1] | 0);
         var A = _.length - R.length, w;
         if (g !== "mod") {
           w = new r(null), w.length = A + 1, w.words = new Array(w.length);
@@ -9966,7 +9966,7 @@ function requireBn$1() {
         x.negative === 0 && (_ = x, w && (w.words[A] = 1));
         for (var L = A - 1; L >= 0; L--) {
           var K = (_.words[R.length + L] | 0) * 67108864 + (_.words[R.length + L - 1] | 0);
-          for (K = Math.min(K / B | 0, 67108863), _._ishlnsubmul(R, K, L); _.negative !== 0; )
+          for (K = Math.min(K / q | 0, 67108863), _._ishlnsubmul(R, K, L); _.negative !== 0; )
             K--, _.negative = 0, _._ishlnsubmul(R, 1, L), _.isZero() || (_.negative ^= 1);
           w && (w.words[L] = K);
         }
@@ -9980,15 +9980,15 @@ function requireBn$1() {
             div: new r(0),
             mod: new r(0)
           };
-        var _, R, B;
-        return this.negative !== 0 && y.negative === 0 ? (B = this.neg().divmod(y, g), g !== "mod" && (_ = B.div.neg()), g !== "div" && (R = B.mod.neg(), p && R.negative !== 0 && R.iadd(y)), {
+        var _, R, q;
+        return this.negative !== 0 && y.negative === 0 ? (q = this.neg().divmod(y, g), g !== "mod" && (_ = q.div.neg()), g !== "div" && (R = q.mod.neg(), p && R.negative !== 0 && R.iadd(y)), {
           div: _,
           mod: R
-        }) : this.negative === 0 && y.negative !== 0 ? (B = this.divmod(y.neg(), g), g !== "mod" && (_ = B.div.neg()), {
+        }) : this.negative === 0 && y.negative !== 0 ? (q = this.divmod(y.neg(), g), g !== "mod" && (_ = q.div.neg()), {
           div: _,
-          mod: B.mod
-        }) : (this.negative & y.negative) !== 0 ? (B = this.neg().divmod(y.neg(), g), g !== "div" && (R = B.mod.neg(), p && R.negative !== 0 && R.isub(y)), {
-          div: B.div,
+          mod: q.mod
+        }) : (this.negative & y.negative) !== 0 ? (q = this.neg().divmod(y.neg(), g), g !== "div" && (R = q.mod.neg(), p && R.negative !== 0 && R.isub(y)), {
+          div: q.div,
           mod: R
         }) : y.length > this.length || this.cmp(y) < 0 ? {
           div: new r(0),
@@ -10012,8 +10012,8 @@ function requireBn$1() {
       }, r.prototype.divRound = function(y) {
         var g = this.divmod(y);
         if (g.mod.isZero()) return g.div;
-        var p = g.div.negative !== 0 ? g.mod.isub(y) : g.mod, _ = y.ushrn(1), R = y.andln(1), B = p.cmp(_);
-        return B < 0 || R === 1 && B === 0 ? g.div : g.div.negative !== 0 ? g.div.isubn(1) : g.div.iaddn(1);
+        var p = g.div.negative !== 0 ? g.mod.isub(y) : g.mod, _ = y.ushrn(1), R = y.andln(1), q = p.cmp(_);
+        return q < 0 || R === 1 && q === 0 ? g.div : g.div.negative !== 0 ? g.div.isubn(1) : g.div.iaddn(1);
       }, r.prototype.modn = function(y) {
         o(y <= 67108863);
         for (var g = (1 << 26) % y, p = 0, _ = this.length - 1; _ >= 0; _--)
@@ -10032,7 +10032,7 @@ function requireBn$1() {
         o(y.negative === 0), o(!y.isZero());
         var g = this, p = y.clone();
         g.negative !== 0 ? g = g.umod(y) : g = g.clone();
-        for (var _ = new r(1), R = new r(0), B = new r(0), P = new r(1), A = 0; g.isEven() && p.isEven(); )
+        for (var _ = new r(1), R = new r(0), q = new r(0), P = new r(1), A = 0; g.isEven() && p.isEven(); )
           g.iushrn(1), p.iushrn(1), ++A;
         for (var w = p.clone(), M = g.clone(); !g.isZero(); ) {
           for (var x = 0, L = 1; (g.words[0] & L) === 0 && x < 26; ++x, L <<= 1) ;
@@ -10042,11 +10042,11 @@ function requireBn$1() {
           for (var K = 0, Q = 1; (p.words[0] & Q) === 0 && K < 26; ++K, Q <<= 1) ;
           if (K > 0)
             for (p.iushrn(K); K-- > 0; )
-              (B.isOdd() || P.isOdd()) && (B.iadd(w), P.isub(M)), B.iushrn(1), P.iushrn(1);
-          g.cmp(p) >= 0 ? (g.isub(p), _.isub(B), R.isub(P)) : (p.isub(g), B.isub(_), P.isub(R));
+              (q.isOdd() || P.isOdd()) && (q.iadd(w), P.isub(M)), q.iushrn(1), P.iushrn(1);
+          g.cmp(p) >= 0 ? (g.isub(p), _.isub(q), R.isub(P)) : (p.isub(g), q.isub(_), P.isub(R));
         }
         return {
-          a: B,
+          a: q,
           b: P,
           gcd: p.iushln(A)
         };
@@ -10054,15 +10054,15 @@ function requireBn$1() {
         o(y.negative === 0), o(!y.isZero());
         var g = this, p = y.clone();
         g.negative !== 0 ? g = g.umod(y) : g = g.clone();
-        for (var _ = new r(1), R = new r(0), B = p.clone(); g.cmpn(1) > 0 && p.cmpn(1) > 0; ) {
+        for (var _ = new r(1), R = new r(0), q = p.clone(); g.cmpn(1) > 0 && p.cmpn(1) > 0; ) {
           for (var P = 0, A = 1; (g.words[0] & A) === 0 && P < 26; ++P, A <<= 1) ;
           if (P > 0)
             for (g.iushrn(P); P-- > 0; )
-              _.isOdd() && _.iadd(B), _.iushrn(1);
+              _.isOdd() && _.iadd(q), _.iushrn(1);
           for (var w = 0, M = 1; (p.words[0] & M) === 0 && w < 26; ++w, M <<= 1) ;
           if (w > 0)
             for (p.iushrn(w); w-- > 0; )
-              R.isOdd() && R.iadd(B), R.iushrn(1);
+              R.isOdd() && R.iadd(q), R.iushrn(1);
           g.cmp(p) >= 0 ? (g.isub(p), _.isub(R)) : (p.isub(g), R.isub(_));
         }
         var x;
@@ -10081,8 +10081,8 @@ function requireBn$1() {
             p.iushrn(1);
           var R = g.cmp(p);
           if (R < 0) {
-            var B = g;
-            g = p, p = B;
+            var q = g;
+            g = p, p = q;
           } else if (R === 0 || p.cmpn(1) === 0)
             break;
           g.isub(p);
@@ -10101,11 +10101,11 @@ function requireBn$1() {
         var g = y % 26, p = (y - g) / 26, _ = 1 << g;
         if (this.length <= p)
           return this._expand(p + 1), this.words[p] |= _, this;
-        for (var R = _, B = p; R !== 0 && B < this.length; B++) {
-          var P = this.words[B] | 0;
-          P += R, R = P >>> 26, P &= 67108863, this.words[B] = P;
+        for (var R = _, q = p; R !== 0 && q < this.length; q++) {
+          var P = this.words[q] | 0;
+          P += R, R = P >>> 26, P &= 67108863, this.words[q] = P;
         }
-        return R !== 0 && (this.words[B] = R, this.length++), this;
+        return R !== 0 && (this.words[q] = R, this.length++), this;
       }, r.prototype.isZero = function() {
         return this.length === 1 && this.words[0] === 0;
       }, r.prototype.cmpn = function(y) {
@@ -10233,12 +10233,12 @@ function requireBn$1() {
           y.words[0] = 0, y.length = 1;
           return;
         }
-        var B = y.words[9];
-        for (g.words[g.length++] = B & p, R = 10; R < y.length; R++) {
+        var q = y.words[9];
+        for (g.words[g.length++] = q & p, R = 10; R < y.length; R++) {
           var P = y.words[R] | 0;
-          y.words[R - 10] = (P & p) << 4 | B >>> 22, B = P;
+          y.words[R - 10] = (P & p) << 4 | q >>> 22, q = P;
         }
-        B >>>= 22, y.words[R - 10] = B, B === 0 && y.length > 10 ? y.length -= 10 : y.length -= 9;
+        q >>>= 22, y.words[R - 10] = q, q === 0 && y.length > 10 ? y.length -= 10 : y.length -= 9;
       }, $.prototype.imulK = function(y) {
         y.words[y.length] = 0, y.words[y.length + 1] = 0, y.length += 2;
         for (var g = 0, p = 0; p < y.length; p++) {
@@ -10345,11 +10345,11 @@ function requireBn$1() {
         for (var _ = this.m.subn(1), R = 0; !_.isZero() && _.andln(1) === 0; )
           R++, _.iushrn(1);
         o(!_.isZero());
-        var B = new r(1).toRed(this), P = B.redNeg(), A = this.m.subn(1).iushrn(1), w = this.m.bitLength();
+        var q = new r(1).toRed(this), P = q.redNeg(), A = this.m.subn(1).iushrn(1), w = this.m.bitLength();
         for (w = new r(2 * w * w).toRed(this); this.pow(w, A).cmp(P) !== 0; )
           w.redIAdd(P);
-        for (var M = this.pow(w, _), x = this.pow(y, _.addn(1).iushrn(1)), L = this.pow(y, _), K = R; L.cmp(B) !== 0; ) {
-          for (var Q = L, H = 0; Q.cmp(B) !== 0; H++)
+        for (var M = this.pow(w, _), x = this.pow(y, _.addn(1).iushrn(1)), L = this.pow(y, _), K = R; L.cmp(q) !== 0; ) {
+          for (var Q = L, H = 0; Q.cmp(q) !== 0; H++)
             Q = Q.redSqr();
           o(H < K);
           var N = this.pow(M, new r(1).iushln(K - H - 1));
@@ -10366,19 +10366,19 @@ function requireBn$1() {
         _[0] = new r(1).toRed(this), _[1] = y;
         for (var R = 2; R < _.length; R++)
           _[R] = this.mul(_[R - 1], y);
-        var B = _[0], P = 0, A = 0, w = g.bitLength() % 26;
+        var q = _[0], P = 0, A = 0, w = g.bitLength() % 26;
         for (w === 0 && (w = 26), R = g.length - 1; R >= 0; R--) {
           for (var M = g.words[R], x = w - 1; x >= 0; x--) {
             var L = M >> x & 1;
-            if (B !== _[0] && (B = this.sqr(B)), L === 0 && P === 0) {
+            if (q !== _[0] && (q = this.sqr(q)), L === 0 && P === 0) {
               A = 0;
               continue;
             }
-            P <<= 1, P |= L, A++, !(A !== p && (R !== 0 || x !== 0)) && (B = this.mul(B, _[P]), A = 0, P = 0);
+            P <<= 1, P |= L, A++, !(A !== p && (R !== 0 || x !== 0)) && (q = this.mul(q, _[P]), A = 0, P = 0);
           }
           w = 26;
         }
-        return B;
+        return q;
       }, ne.prototype.convertTo = function(y) {
         var g = y.umod(this.m);
         return g === y ? g.clone() : g;
@@ -10399,12 +10399,12 @@ function requireBn$1() {
       }, de.prototype.imul = function(y, g) {
         if (y.isZero() || g.isZero())
           return y.words[0] = 0, y.length = 1, y;
-        var p = y.imul(g), _ = p.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), R = p.isub(_).iushrn(this.shift), B = R;
-        return R.cmp(this.m) >= 0 ? B = R.isub(this.m) : R.cmpn(0) < 0 && (B = R.iadd(this.m)), B._forceRed(this);
+        var p = y.imul(g), _ = p.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), R = p.isub(_).iushrn(this.shift), q = R;
+        return R.cmp(this.m) >= 0 ? q = R.isub(this.m) : R.cmpn(0) < 0 && (q = R.iadd(this.m)), q._forceRed(this);
       }, de.prototype.mul = function(y, g) {
         if (y.isZero() || g.isZero()) return new r(0)._forceRed(this);
-        var p = y.mul(g), _ = p.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), R = p.isub(_).iushrn(this.shift), B = R;
-        return R.cmp(this.m) >= 0 ? B = R.isub(this.m) : R.cmpn(0) < 0 && (B = R.iadd(this.m)), B._forceRed(this);
+        var p = y.mul(g), _ = p.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), R = p.isub(_).iushrn(this.shift), q = R;
+        return R.cmp(this.m) >= 0 ? q = R.isub(this.m) : R.cmpn(0) < 0 && (q = R.iadd(this.m)), q._forceRed(this);
       }, de.prototype.invm = function(y) {
         var g = this.imod(y._invmp(this.m).mul(this.r2));
         return g._forceRed(this);
@@ -10480,12 +10480,12 @@ function requireMr() {
     for (var l = d.shrn(s), v = e.toRed(a), b = !0; r > 0; r--) {
       var m = this._randrange(new c(2), e);
       h && h(m);
-      var q = m.toRed(a).redPow(l);
-      if (!(q.cmp(n) === 0 || q.cmp(v) === 0)) {
+      var B = m.toRed(a).redPow(l);
+      if (!(B.cmp(n) === 0 || B.cmp(v) === 0)) {
         for (var E = 1; E < s; E++) {
-          if (q = q.redSqr(), q.cmp(n) === 0)
+          if (B = B.redSqr(), B.cmp(n) === 0)
             return !1;
-          if (q.cmp(v) === 0)
+          if (B.cmp(v) === 0)
             break;
         }
         if (E === s)
@@ -10504,13 +10504,13 @@ function requireMr() {
         return b;
       var m = v.toRed(f).redPow(s);
       if (!(m.cmp(a) === 0 || m.cmp(l) === 0)) {
-        for (var q = 1; q < e; q++) {
+        for (var B = 1; B < e; B++) {
           if (m = m.redSqr(), m.cmp(a) === 0)
             return m.fromRed().subn(1).gcd(d);
           if (m.cmp(l) === 0)
             break;
         }
-        if (q === e)
+        if (B === e)
           return m = m.redSqr(), m.fromRed().subn(1).gcd(d);
       }
     }
@@ -10522,7 +10522,7 @@ function requireGeneratePrime() {
   if (hasRequiredGeneratePrime) return generatePrime;
   hasRequiredGeneratePrime = 1;
   var c = requireBrowser$b();
-  generatePrime = q, q.simpleSieve = b, q.fermatTest = m;
+  generatePrime = B, B.simpleSieve = b, B.fermatTest = m;
   var t = requireBn$1(), u = new t(24), o = requireMr(), d = new o(), r = new t(1), h = new t(2), f = new t(5);
   new t(16), new t(8);
   var a = new t(10), n = new t(3);
@@ -10552,7 +10552,7 @@ function requireGeneratePrime() {
     var S = t.mont(E);
     return h.toRed(S).redPow(E.subn(1)).fromRed().cmpn(1) === 0;
   }
-  function q(E, S) {
+  function B(E, S) {
     if (E < 16)
       return S === 2 || S === 5 ? new t([140, 123]) : new t([140, 39]);
     S = new t(S);
@@ -10587,36 +10587,36 @@ function requireDh() {
   hasRequiredDh = 1;
   var c = requireBn$1(), t = requireMr(), u = new t(), o = new c(24), d = new c(11), r = new c(10), h = new c(3), f = new c(7), a = requireGeneratePrime(), n = requireBrowser$b();
   dh = b;
-  function e(q, E) {
-    return E = E || "utf8", Buffer.isBuffer(q) || (q = new Buffer(q, E)), this._pub = new c(q), this;
+  function e(B, E) {
+    return E = E || "utf8", Buffer.isBuffer(B) || (B = new Buffer(B, E)), this._pub = new c(B), this;
   }
-  function s(q, E) {
-    return E = E || "utf8", Buffer.isBuffer(q) || (q = new Buffer(q, E)), this._priv = new c(q), this;
+  function s(B, E) {
+    return E = E || "utf8", Buffer.isBuffer(B) || (B = new Buffer(B, E)), this._priv = new c(B), this;
   }
   var l = {};
-  function v(q, E) {
-    var S = E.toString("hex"), O = [S, q.toString(16)].join("_");
+  function v(B, E) {
+    var S = E.toString("hex"), O = [S, B.toString(16)].join("_");
     if (O in l)
       return l[O];
     var D = 0;
-    if (q.isEven() || !a.simpleSieve || !a.fermatTest(q) || !u.test(q))
+    if (B.isEven() || !a.simpleSieve || !a.fermatTest(B) || !u.test(B))
       return D += 1, S === "02" || S === "05" ? D += 8 : D += 4, l[O] = D, D;
-    u.test(q.shrn(1)) || (D += 2);
+    u.test(B.shrn(1)) || (D += 2);
     var $;
     switch (S) {
       case "02":
-        q.mod(o).cmp(d) && (D += 8);
+        B.mod(o).cmp(d) && (D += 8);
         break;
       case "05":
-        $ = q.mod(r), $.cmp(h) && $.cmp(f) && (D += 8);
+        $ = B.mod(r), $.cmp(h) && $.cmp(f) && (D += 8);
         break;
       default:
         D += 4;
     }
     return l[O] = D, D;
   }
-  function b(q, E, S) {
-    this.setGenerator(E), this.__prime = new c(q), this._prime = c.mont(this.__prime), this._primeLen = q.length, this._pub = void 0, this._priv = void 0, this._primeCode = void 0, S ? (this.setPublicKey = e, this.setPrivateKey = s) : this._primeCode = 8;
+  function b(B, E, S) {
+    this.setGenerator(E), this.__prime = new c(B), this._prime = c.mont(this.__prime), this._primeLen = B.length, this._pub = void 0, this._priv = void 0, this._primeCode = void 0, S ? (this.setPublicKey = e, this.setPrivateKey = s) : this._primeCode = 8;
   }
   Object.defineProperty(b.prototype, "verifyError", {
     enumerable: !0,
@@ -10625,9 +10625,9 @@ function requireDh() {
     }
   }), b.prototype.generateKeys = function() {
     return this._priv || (this._priv = new c(n(this._primeLen))), this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed(), this.getPublicKey();
-  }, b.prototype.computeSecret = function(q) {
-    q = new c(q), q = q.toRed(this._prime);
-    var E = q.redPow(this._priv).fromRed(), S = new Buffer(E.toArray()), O = this.getPrime();
+  }, b.prototype.computeSecret = function(B) {
+    B = new c(B), B = B.toRed(this._prime);
+    var E = B.redPow(this._priv).fromRed(), S = new Buffer(E.toArray()), O = this.getPrime();
     if (S.length < O.length) {
       var D = new Buffer(O.length - S.length);
       D.fill(0), S = Buffer.concat([D, S]);
@@ -10637,15 +10637,15 @@ function requireDh() {
     return m(this._pub, E);
   }, b.prototype.getPrivateKey = function(E) {
     return m(this._priv, E);
-  }, b.prototype.getPrime = function(q) {
-    return m(this.__prime, q);
-  }, b.prototype.getGenerator = function(q) {
-    return m(this._gen, q);
-  }, b.prototype.setGenerator = function(q, E) {
-    return E = E || "utf8", Buffer.isBuffer(q) || (q = new Buffer(q, E)), this.__gen = q, this._gen = new c(q), this;
+  }, b.prototype.getPrime = function(B) {
+    return m(this.__prime, B);
+  }, b.prototype.getGenerator = function(B) {
+    return m(this._gen, B);
+  }, b.prototype.setGenerator = function(B, E) {
+    return E = E || "utf8", Buffer.isBuffer(B) || (B = new Buffer(B, E)), this.__gen = B, this._gen = new c(B), this;
   };
-  function m(q, E) {
-    var S = new Buffer(q.toArray());
+  function m(B, E) {
+    var S = new Buffer(B.toArray());
     return E ? S.toString(E) : S;
   }
   return dh;
@@ -10705,8 +10705,8 @@ function requireBn() {
         if (typeof p == "object")
           return this._initArray(p, _, R);
         _ === "hex" && (_ = 16), o(_ === (_ | 0) && _ >= 2 && _ <= 36), p = p.toString().replace(/\s+/g, "");
-        var B = 0;
-        p[0] === "-" && (B++, this.negative = 1), B < p.length && (_ === 16 ? this._parseHex(p, B, R) : (this._parseBase(p, _, B), R === "le" && this._initArray(this.toArray(), _, R)));
+        var q = 0;
+        p[0] === "-" && (q++, this.negative = 1), q < p.length && (_ === 16 ? this._parseHex(p, q, R) : (this._parseBase(p, _, q), R === "le" && this._initArray(this.toArray(), _, R)));
       }, r.prototype._initNumber = function(p, _, R) {
         p < 0 && (this.negative = 1, p = -p), p < 67108864 ? (this.words = [p & 67108863], this.length = 1) : p < 4503599627370496 ? (this.words = [
           p & 67108863,
@@ -10720,15 +10720,15 @@ function requireBn() {
         if (o(typeof p.length == "number"), p.length <= 0)
           return this.words = [0], this.length = 1, this;
         this.length = Math.ceil(p.length / 3), this.words = new Array(this.length);
-        for (var B = 0; B < this.length; B++)
-          this.words[B] = 0;
+        for (var q = 0; q < this.length; q++)
+          this.words[q] = 0;
         var P, A, w = 0;
         if (R === "be")
-          for (B = p.length - 1, P = 0; B >= 0; B -= 3)
-            A = p[B] | p[B - 1] << 8 | p[B - 2] << 16, this.words[P] |= A << w & 67108863, this.words[P + 1] = A >>> 26 - w & 67108863, w += 24, w >= 26 && (w -= 26, P++);
+          for (q = p.length - 1, P = 0; q >= 0; q -= 3)
+            A = p[q] | p[q - 1] << 8 | p[q - 2] << 16, this.words[P] |= A << w & 67108863, this.words[P + 1] = A >>> 26 - w & 67108863, w += 24, w >= 26 && (w -= 26, P++);
         else if (R === "le")
-          for (B = 0, P = 0; B < p.length; B += 3)
-            A = p[B] | p[B + 1] << 8 | p[B + 2] << 16, this.words[P] |= A << w & 67108863, this.words[P + 1] = A >>> 26 - w & 67108863, w += 24, w >= 26 && (w -= 26, P++);
+          for (q = 0, P = 0; q < p.length; q += 3)
+            A = p[q] | p[q + 1] << 8 | p[q + 2] << 16, this.words[P] |= A << w & 67108863, this.words[P + 1] = A >>> 26 - w & 67108863, w += 24, w >= 26 && (w -= 26, P++);
         return this._strip();
       };
       function f(g, p) {
@@ -10747,33 +10747,33 @@ function requireBn() {
       }
       r.prototype._parseHex = function(p, _, R) {
         this.length = Math.ceil((p.length - _) / 6), this.words = new Array(this.length);
-        for (var B = 0; B < this.length; B++)
-          this.words[B] = 0;
+        for (var q = 0; q < this.length; q++)
+          this.words[q] = 0;
         var P = 0, A = 0, w;
         if (R === "be")
-          for (B = p.length - 1; B >= _; B -= 2)
-            w = a(p, _, B) << P, this.words[A] |= w & 67108863, P >= 18 ? (P -= 18, A += 1, this.words[A] |= w >>> 26) : P += 8;
+          for (q = p.length - 1; q >= _; q -= 2)
+            w = a(p, _, q) << P, this.words[A] |= w & 67108863, P >= 18 ? (P -= 18, A += 1, this.words[A] |= w >>> 26) : P += 8;
         else {
           var M = p.length - _;
-          for (B = M % 2 === 0 ? _ + 1 : _; B < p.length; B += 2)
-            w = a(p, _, B) << P, this.words[A] |= w & 67108863, P >= 18 ? (P -= 18, A += 1, this.words[A] |= w >>> 26) : P += 8;
+          for (q = M % 2 === 0 ? _ + 1 : _; q < p.length; q += 2)
+            w = a(p, _, q) << P, this.words[A] |= w & 67108863, P >= 18 ? (P -= 18, A += 1, this.words[A] |= w >>> 26) : P += 8;
         }
         this._strip();
       };
       function n(g, p, _, R) {
-        for (var B = 0, P = 0, A = Math.min(g.length, _), w = p; w < A; w++) {
+        for (var q = 0, P = 0, A = Math.min(g.length, _), w = p; w < A; w++) {
           var M = g.charCodeAt(w) - 48;
-          B *= R, M >= 49 ? P = M - 49 + 10 : M >= 17 ? P = M - 17 + 10 : P = M, o(M >= 0 && P < R, "Invalid character"), B += P;
+          q *= R, M >= 49 ? P = M - 49 + 10 : M >= 17 ? P = M - 17 + 10 : P = M, o(M >= 0 && P < R, "Invalid character"), q += P;
         }
-        return B;
+        return q;
       }
       r.prototype._parseBase = function(p, _, R) {
         this.words = [0], this.length = 1;
-        for (var B = 0, P = 1; P <= 67108863; P *= _)
-          B++;
-        B--, P = P / _ | 0;
-        for (var A = p.length - R, w = A % B, M = Math.min(A, A - w) + R, x = 0, L = R; L < M; L += B)
-          x = n(p, L, L + B, _), this.imuln(P), this.words[0] + x < 67108864 ? this.words[0] += x : this._iaddn(x);
+        for (var q = 0, P = 1; P <= 67108863; P *= _)
+          q++;
+        q--, P = P / _ | 0;
+        for (var A = p.length - R, w = A % q, M = Math.min(A, A - w) + R, x = 0, L = R; L < M; L += q)
+          x = n(p, L, L + q, _), this.imuln(P), this.words[0] + x < 67108864 ? this.words[0] += x : this._iaddn(x);
         if (w !== 0) {
           var K = 1;
           for (x = n(p, L, p.length, _), L = 0; L < w; L++)
@@ -10925,9 +10925,9 @@ function requireBn() {
         var R;
         if (p === 16 || p === "hex") {
           R = "";
-          for (var B = 0, P = 0, A = 0; A < this.length; A++) {
-            var w = this.words[A], M = ((w << B | P) & 16777215).toString(16);
-            P = w >>> 24 - B & 16777215, B += 2, B >= 26 && (B -= 26, A--), P !== 0 || A !== this.length - 1 ? R = l[6 - M.length] + M + R : R = M + R;
+          for (var q = 0, P = 0, A = 0; A < this.length; A++) {
+            var w = this.words[A], M = ((w << q | P) & 16777215).toString(16);
+            P = w >>> 24 - q & 16777215, q += 2, q >= 26 && (q -= 26, A--), P !== 0 || A !== this.length - 1 ? R = l[6 - M.length] + M + R : R = M + R;
           }
           for (P !== 0 && (R = P.toString(16) + R); R.length % _ !== 0; )
             R = "0" + R;
@@ -10961,25 +10961,25 @@ function requireBn() {
       };
       r.prototype.toArrayLike = function(p, _, R) {
         this._strip();
-        var B = this.byteLength(), P = R || Math.max(1, B);
-        o(B <= P, "byte array longer than desired length"), o(P > 0, "Requested array length <= 0");
+        var q = this.byteLength(), P = R || Math.max(1, q);
+        o(q <= P, "byte array longer than desired length"), o(P > 0, "Requested array length <= 0");
         var A = m(p, P), w = _ === "le" ? "LE" : "BE";
-        return this["_toArrayLike" + w](A, B), A;
+        return this["_toArrayLike" + w](A, q), A;
       }, r.prototype._toArrayLikeLE = function(p, _) {
-        for (var R = 0, B = 0, P = 0, A = 0; P < this.length; P++) {
-          var w = this.words[P] << A | B;
-          p[R++] = w & 255, R < p.length && (p[R++] = w >> 8 & 255), R < p.length && (p[R++] = w >> 16 & 255), A === 6 ? (R < p.length && (p[R++] = w >> 24 & 255), B = 0, A = 0) : (B = w >>> 24, A += 2);
+        for (var R = 0, q = 0, P = 0, A = 0; P < this.length; P++) {
+          var w = this.words[P] << A | q;
+          p[R++] = w & 255, R < p.length && (p[R++] = w >> 8 & 255), R < p.length && (p[R++] = w >> 16 & 255), A === 6 ? (R < p.length && (p[R++] = w >> 24 & 255), q = 0, A = 0) : (q = w >>> 24, A += 2);
         }
         if (R < p.length)
-          for (p[R++] = B; R < p.length; )
+          for (p[R++] = q; R < p.length; )
             p[R++] = 0;
       }, r.prototype._toArrayLikeBE = function(p, _) {
-        for (var R = p.length - 1, B = 0, P = 0, A = 0; P < this.length; P++) {
-          var w = this.words[P] << A | B;
-          p[R--] = w & 255, R >= 0 && (p[R--] = w >> 8 & 255), R >= 0 && (p[R--] = w >> 16 & 255), A === 6 ? (R >= 0 && (p[R--] = w >> 24 & 255), B = 0, A = 0) : (B = w >>> 24, A += 2);
+        for (var R = p.length - 1, q = 0, P = 0, A = 0; P < this.length; P++) {
+          var w = this.words[P] << A | q;
+          p[R--] = w & 255, R >= 0 && (p[R--] = w >> 8 & 255), R >= 0 && (p[R--] = w >> 16 & 255), A === 6 ? (R >= 0 && (p[R--] = w >> 24 & 255), q = 0, A = 0) : (q = w >>> 24, A += 2);
         }
         if (R >= 0)
-          for (p[R--] = B; R >= 0; )
+          for (p[R--] = q; R >= 0; )
             p[R--] = 0;
       }, Math.clz32 ? r.prototype._countBits = function(p) {
         return 32 - Math.clz32(p);
@@ -10994,10 +10994,10 @@ function requireBn() {
         var p = this.words[this.length - 1], _ = this._countBits(p);
         return (this.length - 1) * 26 + _;
       };
-      function q(g) {
+      function B(g) {
         for (var p = new Array(g.bitLength()), _ = 0; _ < p.length; _++) {
-          var R = _ / 26 | 0, B = _ % 26;
-          p[_] = g.words[R] >>> B & 1;
+          var R = _ / 26 | 0, q = _ % 26;
+          p[_] = g.words[R] >>> q & 1;
         }
         return p;
       }
@@ -11047,11 +11047,11 @@ function requireBn() {
       }, r.prototype.iuxor = function(p) {
         var _, R;
         this.length > p.length ? (_ = this, R = p) : (_ = p, R = this);
-        for (var B = 0; B < R.length; B++)
-          this.words[B] = _.words[B] ^ R.words[B];
+        for (var q = 0; q < R.length; q++)
+          this.words[q] = _.words[q] ^ R.words[q];
         if (this !== _)
-          for (; B < _.length; B++)
-            this.words[B] = _.words[B];
+          for (; q < _.length; q++)
+            this.words[q] = _.words[q];
         return this.length = _.length, this._strip();
       }, r.prototype.ixor = function(p) {
         return o((this.negative | p.negative) === 0), this.iuxor(p);
@@ -11063,25 +11063,25 @@ function requireBn() {
         o(typeof p == "number" && p >= 0);
         var _ = Math.ceil(p / 26) | 0, R = p % 26;
         this._expand(_), R > 0 && _--;
-        for (var B = 0; B < _; B++)
-          this.words[B] = ~this.words[B] & 67108863;
-        return R > 0 && (this.words[B] = ~this.words[B] & 67108863 >> 26 - R), this._strip();
+        for (var q = 0; q < _; q++)
+          this.words[q] = ~this.words[q] & 67108863;
+        return R > 0 && (this.words[q] = ~this.words[q] & 67108863 >> 26 - R), this._strip();
       }, r.prototype.notn = function(p) {
         return this.clone().inotn(p);
       }, r.prototype.setn = function(p, _) {
         o(typeof p == "number" && p >= 0);
-        var R = p / 26 | 0, B = p % 26;
-        return this._expand(R + 1), _ ? this.words[R] = this.words[R] | 1 << B : this.words[R] = this.words[R] & ~(1 << B), this._strip();
+        var R = p / 26 | 0, q = p % 26;
+        return this._expand(R + 1), _ ? this.words[R] = this.words[R] | 1 << q : this.words[R] = this.words[R] & ~(1 << q), this._strip();
       }, r.prototype.iadd = function(p) {
         var _;
         if (this.negative !== 0 && p.negative === 0)
           return this.negative = 0, _ = this.isub(p), this.negative ^= 1, this._normSign();
         if (this.negative === 0 && p.negative !== 0)
           return p.negative = 0, _ = this.isub(p), p.negative = 1, _._normSign();
-        var R, B;
-        this.length > p.length ? (R = this, B = p) : (R = p, B = this);
-        for (var P = 0, A = 0; A < B.length; A++)
-          _ = (R.words[A] | 0) + (B.words[A] | 0) + P, this.words[A] = _ & 67108863, P = _ >>> 26;
+        var R, q;
+        this.length > p.length ? (R = this, q = p) : (R = p, q = this);
+        for (var P = 0, A = 0; A < q.length; A++)
+          _ = (R.words[A] | 0) + (q.words[A] | 0) + P, this.words[A] = _ & 67108863, P = _ >>> 26;
         for (; P !== 0 && A < R.length; A++)
           _ = (R.words[A] | 0) + P, this.words[A] = _ & 67108863, P = _ >>> 26;
         if (this.length = R.length, P !== 0)
@@ -11103,16 +11103,16 @@ function requireBn() {
         var R = this.cmp(p);
         if (R === 0)
           return this.negative = 0, this.length = 1, this.words[0] = 0, this;
-        var B, P;
-        R > 0 ? (B = this, P = p) : (B = p, P = this);
+        var q, P;
+        R > 0 ? (q = this, P = p) : (q = p, P = this);
         for (var A = 0, w = 0; w < P.length; w++)
-          _ = (B.words[w] | 0) - (P.words[w] | 0) + A, A = _ >> 26, this.words[w] = _ & 67108863;
-        for (; A !== 0 && w < B.length; w++)
-          _ = (B.words[w] | 0) + A, A = _ >> 26, this.words[w] = _ & 67108863;
-        if (A === 0 && w < B.length && B !== this)
-          for (; w < B.length; w++)
-            this.words[w] = B.words[w];
-        return this.length = Math.max(this.length, w), B !== this && (this.negative = 1), this._strip();
+          _ = (q.words[w] | 0) - (P.words[w] | 0) + A, A = _ >> 26, this.words[w] = _ & 67108863;
+        for (; A !== 0 && w < q.length; w++)
+          _ = (q.words[w] | 0) + A, A = _ >> 26, this.words[w] = _ & 67108863;
+        if (A === 0 && w < q.length && q !== this)
+          for (; w < q.length; w++)
+            this.words[w] = q.words[w];
+        return this.length = Math.max(this.length, w), q !== this && (this.negative = 1), this._strip();
       }, r.prototype.sub = function(p) {
         return this.clone().isub(p);
       };
@@ -11120,19 +11120,19 @@ function requireBn() {
         _.negative = p.negative ^ g.negative;
         var R = g.length + p.length | 0;
         _.length = R, R = R - 1 | 0;
-        var B = g.words[0] | 0, P = p.words[0] | 0, A = B * P, w = A & 67108863, M = A / 67108864 | 0;
+        var q = g.words[0] | 0, P = p.words[0] | 0, A = q * P, w = A & 67108863, M = A / 67108864 | 0;
         _.words[0] = w;
         for (var x = 1; x < R; x++) {
           for (var L = M >>> 26, K = M & 67108863, Q = Math.min(x, p.length - 1), H = Math.max(0, x - g.length + 1); H <= Q; H++) {
             var N = x - H | 0;
-            B = g.words[N] | 0, P = p.words[H] | 0, A = B * P + K, L += A / 67108864 | 0, K = A & 67108863;
+            q = g.words[N] | 0, P = p.words[H] | 0, A = q * P + K, L += A / 67108864 | 0, K = A & 67108863;
           }
           _.words[x] = K | 0, M = L | 0;
         }
         return M !== 0 ? _.words[x] = M | 0 : _.length--, _._strip();
       }
       var S = function(p, _, R) {
-        var B = p.words, P = _.words, A = R.words, w = 0, M, x, L, K = B[0] | 0, Q = K & 8191, H = K >>> 13, N = B[1] | 0, F = N & 8191, ee = N >>> 13, ae = B[2] | 0, z = ae & 8191, G = ae >>> 13, fe = B[3] | 0, me = fe & 8191, xe = fe >>> 13, _e = B[4] | 0, qe = _e & 8191, Re = _e >>> 13, be = B[5] | 0, Fe = be & 8191, Be = be >>> 13, Me = B[6] | 0, Te = Me & 8191, oe = Me >>> 13, ce = B[7] | 0, ge = ce & 8191, we = ce >>> 13, Se = B[8] | 0, Oe = Se & 8191, U = Se >>> 13, I = B[9] | 0, C = I & 8191, X = I >>> 13, se = P[0] | 0, le = se & 8191, ve = se >>> 13, Ce = P[1] | 0, Le = Ce & 8191, Ie = Ce >>> 13, je = P[2] | 0, $e = je & 8191, He = je >>> 13, Ke = P[3] | 0, Ze = Ke & 8191, We = Ke >>> 13, Ye = P[4] | 0, Xe = Ye & 8191, W = Ye >>> 13, T = P[5] | 0, k = T & 8191, re = T >>> 13, ue = P[6] | 0, pe = ue & 8191, ye = ue >>> 13, ke = P[7] | 0, Ve = ke & 8191, Ne = ke >>> 13, Ge = P[8] | 0, Ue = Ge & 8191, ze = Ge >>> 13, Je = P[9] | 0, Qe = Je & 8191, er = Je >>> 13;
+        var q = p.words, P = _.words, A = R.words, w = 0, M, x, L, K = q[0] | 0, Q = K & 8191, H = K >>> 13, N = q[1] | 0, F = N & 8191, ee = N >>> 13, ae = q[2] | 0, z = ae & 8191, G = ae >>> 13, fe = q[3] | 0, me = fe & 8191, xe = fe >>> 13, _e = q[4] | 0, qe = _e & 8191, Re = _e >>> 13, be = q[5] | 0, Fe = be & 8191, Be = be >>> 13, Me = q[6] | 0, Te = Me & 8191, oe = Me >>> 13, ce = q[7] | 0, ge = ce & 8191, we = ce >>> 13, Se = q[8] | 0, Oe = Se & 8191, U = Se >>> 13, I = q[9] | 0, C = I & 8191, X = I >>> 13, se = P[0] | 0, le = se & 8191, ve = se >>> 13, Ce = P[1] | 0, Le = Ce & 8191, Ie = Ce >>> 13, je = P[2] | 0, $e = je & 8191, He = je >>> 13, Ke = P[3] | 0, Ze = Ke & 8191, We = Ke >>> 13, Ye = P[4] | 0, Xe = Ye & 8191, W = Ye >>> 13, T = P[5] | 0, k = T & 8191, re = T >>> 13, ue = P[6] | 0, pe = ue & 8191, ye = ue >>> 13, ke = P[7] | 0, Ve = ke & 8191, Ne = ke >>> 13, Ge = P[8] | 0, Ue = Ge & 8191, ze = Ge >>> 13, Je = P[9] | 0, Qe = Je & 8191, er = Je >>> 13;
         R.negative = p.negative ^ _.negative, R.length = 19, M = Math.imul(Q, le), x = Math.imul(Q, ve), x = x + Math.imul(H, le) | 0, L = Math.imul(H, ve);
         var fr = (w + M | 0) + ((x & 8191) << 13) | 0;
         w = (L + (x >>> 13) | 0) + (fr >>> 26) | 0, fr &= 67108863, M = Math.imul(F, le), x = Math.imul(F, ve), x = x + Math.imul(ee, le) | 0, L = Math.imul(ee, ve), M = M + Math.imul(Q, Le) | 0, x = x + Math.imul(Q, Ie) | 0, x = x + Math.imul(H, Le) | 0, L = L + Math.imul(H, Ie) | 0;
@@ -11176,14 +11176,14 @@ function requireBn() {
       Math.imul || (S = E);
       function O(g, p, _) {
         _.negative = p.negative ^ g.negative, _.length = g.length + p.length;
-        for (var R = 0, B = 0, P = 0; P < _.length - 1; P++) {
-          var A = B;
-          B = 0;
+        for (var R = 0, q = 0, P = 0; P < _.length - 1; P++) {
+          var A = q;
+          q = 0;
           for (var w = R & 67108863, M = Math.min(P, p.length - 1), x = Math.max(0, P - g.length + 1); x <= M; x++) {
             var L = P - x, K = g.words[L] | 0, Q = p.words[x] | 0, H = K * Q, N = H & 67108863;
-            A = A + (H / 67108864 | 0) | 0, N = N + w | 0, w = N & 67108863, A = A + (N >>> 26) | 0, B += A >>> 26, A &= 67108863;
+            A = A + (H / 67108864 | 0) | 0, N = N + w | 0, w = N & 67108863, A = A + (N >>> 26) | 0, q += A >>> 26, A &= 67108863;
           }
-          _.words[P] = w, R = A, A = B;
+          _.words[P] = w, R = A, A = q;
         }
         return R !== 0 ? _.words[P] = R : _.length--, _._strip();
       }
@@ -11191,8 +11191,8 @@ function requireBn() {
         return O(g, p, _);
       }
       r.prototype.mulTo = function(p, _) {
-        var R, B = this.length + p.length;
-        return this.length === 10 && p.length === 10 ? R = S(this, p, _) : B < 63 ? R = E(this, p, _) : B < 1024 ? R = O(this, p, _) : R = D(this, p, _), R;
+        var R, q = this.length + p.length;
+        return this.length === 10 && p.length === 10 ? R = S(this, p, _) : q < 63 ? R = E(this, p, _) : q < 1024 ? R = O(this, p, _) : R = D(this, p, _), R;
       }, r.prototype.mul = function(p) {
         var _ = new r(null);
         return _.words = new Array(this.length + p.length), this.mulTo(p, _);
@@ -11204,11 +11204,11 @@ function requireBn() {
       }, r.prototype.imuln = function(p) {
         var _ = p < 0;
         _ && (p = -p), o(typeof p == "number"), o(p < 67108864);
-        for (var R = 0, B = 0; B < this.length; B++) {
-          var P = (this.words[B] | 0) * p, A = (P & 67108863) + (R & 67108863);
-          R >>= 26, R += P / 67108864 | 0, R += A >>> 26, this.words[B] = A & 67108863;
+        for (var R = 0, q = 0; q < this.length; q++) {
+          var P = (this.words[q] | 0) * p, A = (P & 67108863) + (R & 67108863);
+          R >>= 26, R += P / 67108864 | 0, R += A >>> 26, this.words[q] = A & 67108863;
         }
-        return R !== 0 && (this.words[B] = R, this.length++), this.length = p === 0 ? 1 : this.length, _ ? this.ineg() : this;
+        return R !== 0 && (this.words[q] = R, this.length++), this.length = p === 0 ? 1 : this.length, _ ? this.ineg() : this;
       }, r.prototype.muln = function(p) {
         return this.clone().imuln(p);
       }, r.prototype.sqr = function() {
@@ -11216,21 +11216,21 @@ function requireBn() {
       }, r.prototype.isqr = function() {
         return this.imul(this.clone());
       }, r.prototype.pow = function(p) {
-        var _ = q(p);
+        var _ = B(p);
         if (_.length === 0) return new r(1);
-        for (var R = this, B = 0; B < _.length && _[B] === 0; B++, R = R.sqr())
+        for (var R = this, q = 0; q < _.length && _[q] === 0; q++, R = R.sqr())
           ;
-        if (++B < _.length)
-          for (var P = R.sqr(); B < _.length; B++, P = P.sqr())
-            _[B] !== 0 && (R = R.mul(P));
+        if (++q < _.length)
+          for (var P = R.sqr(); q < _.length; q++, P = P.sqr())
+            _[q] !== 0 && (R = R.mul(P));
         return R;
       }, r.prototype.iushln = function(p) {
         o(typeof p == "number" && p >= 0);
-        var _ = p % 26, R = (p - _) / 26, B = 67108863 >>> 26 - _ << 26 - _, P;
+        var _ = p % 26, R = (p - _) / 26, q = 67108863 >>> 26 - _ << 26 - _, P;
         if (_ !== 0) {
           var A = 0;
           for (P = 0; P < this.length; P++) {
-            var w = this.words[P] & B, M = (this.words[P] | 0) - w << _;
+            var w = this.words[P] & q, M = (this.words[P] | 0) - w << _;
             this.words[P] = M | A, A = w >>> 26 - _;
           }
           A && (this.words[P] = A, this.length++);
@@ -11247,10 +11247,10 @@ function requireBn() {
         return o(this.negative === 0), this.iushln(p);
       }, r.prototype.iushrn = function(p, _, R) {
         o(typeof p == "number" && p >= 0);
-        var B;
-        _ ? B = (_ - _ % 26) / 26 : B = 0;
+        var q;
+        _ ? q = (_ - _ % 26) / 26 : q = 0;
         var P = p % 26, A = Math.min((p - P) / 26, this.length), w = 67108863 ^ 67108863 >>> P << P, M = R;
-        if (B -= A, B = Math.max(0, B), M) {
+        if (q -= A, q = Math.max(0, q), M) {
           for (var x = 0; x < A; x++)
             M.words[x] = this.words[x];
           M.length = A;
@@ -11261,7 +11261,7 @@ function requireBn() {
         else
           this.words[0] = 0, this.length = 1;
         var L = 0;
-        for (x = this.length - 1; x >= 0 && (L !== 0 || x >= B); x--) {
+        for (x = this.length - 1; x >= 0 && (L !== 0 || x >= q); x--) {
           var K = this.words[x] | 0;
           this.words[x] = L << 26 - P | K >>> P, L = K & w;
         }
@@ -11278,18 +11278,18 @@ function requireBn() {
         return this.clone().iushrn(p);
       }, r.prototype.testn = function(p) {
         o(typeof p == "number" && p >= 0);
-        var _ = p % 26, R = (p - _) / 26, B = 1 << _;
+        var _ = p % 26, R = (p - _) / 26, q = 1 << _;
         if (this.length <= R) return !1;
         var P = this.words[R];
-        return !!(P & B);
+        return !!(P & q);
       }, r.prototype.imaskn = function(p) {
         o(typeof p == "number" && p >= 0);
         var _ = p % 26, R = (p - _) / 26;
         if (o(this.negative === 0, "imaskn works only with positive numbers"), this.length <= R)
           return this;
         if (_ !== 0 && R++, this.length = Math.min(R, this.length), _ !== 0) {
-          var B = 67108863 ^ 67108863 >>> _ << _;
-          this.words[this.length - 1] &= B;
+          var q = 67108863 ^ 67108863 >>> _ << _;
+          this.words[this.length - 1] &= q;
         }
         return this.length === 0 && (this.words[0] = 0, this.length = 1), this._strip();
       }, r.prototype.maskn = function(p) {
@@ -11320,8 +11320,8 @@ function requireBn() {
       }, r.prototype.abs = function() {
         return this.clone().iabs();
       }, r.prototype._ishlnsubmul = function(p, _, R) {
-        var B = p.length + R, P;
-        this._expand(B);
+        var q = p.length + R, P;
+        this._expand(q);
         var A, w = 0;
         for (P = 0; P < p.length; P++) {
           A = (this.words[P + R] | 0) + w;
@@ -11335,25 +11335,25 @@ function requireBn() {
           A = -(this.words[P] | 0) + w, w = A >> 26, this.words[P] = A & 67108863;
         return this.negative = 1, this._strip();
       }, r.prototype._wordDiv = function(p, _) {
-        var R = this.length - p.length, B = this.clone(), P = p, A = P.words[P.length - 1] | 0, w = this._countBits(A);
-        R = 26 - w, R !== 0 && (P = P.ushln(R), B.iushln(R), A = P.words[P.length - 1] | 0);
-        var M = B.length - P.length, x;
+        var R = this.length - p.length, q = this.clone(), P = p, A = P.words[P.length - 1] | 0, w = this._countBits(A);
+        R = 26 - w, R !== 0 && (P = P.ushln(R), q.iushln(R), A = P.words[P.length - 1] | 0);
+        var M = q.length - P.length, x;
         if (_ !== "mod") {
           x = new r(null), x.length = M + 1, x.words = new Array(x.length);
           for (var L = 0; L < x.length; L++)
             x.words[L] = 0;
         }
-        var K = B.clone()._ishlnsubmul(P, 1, M);
-        K.negative === 0 && (B = K, x && (x.words[M] = 1));
+        var K = q.clone()._ishlnsubmul(P, 1, M);
+        K.negative === 0 && (q = K, x && (x.words[M] = 1));
         for (var Q = M - 1; Q >= 0; Q--) {
-          var H = (B.words[P.length + Q] | 0) * 67108864 + (B.words[P.length + Q - 1] | 0);
-          for (H = Math.min(H / A | 0, 67108863), B._ishlnsubmul(P, H, Q); B.negative !== 0; )
-            H--, B.negative = 0, B._ishlnsubmul(P, 1, Q), B.isZero() || (B.negative ^= 1);
+          var H = (q.words[P.length + Q] | 0) * 67108864 + (q.words[P.length + Q - 1] | 0);
+          for (H = Math.min(H / A | 0, 67108863), q._ishlnsubmul(P, H, Q); q.negative !== 0; )
+            H--, q.negative = 0, q._ishlnsubmul(P, 1, Q), q.isZero() || (q.negative ^= 1);
           x && (x.words[Q] = H);
         }
-        return x && x._strip(), B._strip(), _ !== "div" && R !== 0 && B.iushrn(R), {
+        return x && x._strip(), q._strip(), _ !== "div" && R !== 0 && q.iushrn(R), {
           div: x || null,
-          mod: B
+          mod: q
         };
       }, r.prototype.divmod = function(p, _, R) {
         if (o(!p.isZero()), this.isZero())
@@ -11361,12 +11361,12 @@ function requireBn() {
             div: new r(0),
             mod: new r(0)
           };
-        var B, P, A;
-        return this.negative !== 0 && p.negative === 0 ? (A = this.neg().divmod(p, _), _ !== "mod" && (B = A.div.neg()), _ !== "div" && (P = A.mod.neg(), R && P.negative !== 0 && P.iadd(p)), {
-          div: B,
+        var q, P, A;
+        return this.negative !== 0 && p.negative === 0 ? (A = this.neg().divmod(p, _), _ !== "mod" && (q = A.div.neg()), _ !== "div" && (P = A.mod.neg(), R && P.negative !== 0 && P.iadd(p)), {
+          div: q,
           mod: P
-        }) : this.negative === 0 && p.negative !== 0 ? (A = this.divmod(p.neg(), _), _ !== "mod" && (B = A.div.neg()), {
-          div: B,
+        }) : this.negative === 0 && p.negative !== 0 ? (A = this.divmod(p.neg(), _), _ !== "mod" && (q = A.div.neg()), {
+          div: q,
           mod: A.mod
         }) : (this.negative & p.negative) !== 0 ? (A = this.neg().divmod(p.neg(), _), _ !== "div" && (P = A.mod.neg(), R && P.negative !== 0 && P.isub(p)), {
           div: A.div,
@@ -11393,22 +11393,22 @@ function requireBn() {
       }, r.prototype.divRound = function(p) {
         var _ = this.divmod(p);
         if (_.mod.isZero()) return _.div;
-        var R = _.div.negative !== 0 ? _.mod.isub(p) : _.mod, B = p.ushrn(1), P = p.andln(1), A = R.cmp(B);
+        var R = _.div.negative !== 0 ? _.mod.isub(p) : _.mod, q = p.ushrn(1), P = p.andln(1), A = R.cmp(q);
         return A < 0 || P === 1 && A === 0 ? _.div : _.div.negative !== 0 ? _.div.isubn(1) : _.div.iaddn(1);
       }, r.prototype.modrn = function(p) {
         var _ = p < 0;
         _ && (p = -p), o(p <= 67108863);
-        for (var R = (1 << 26) % p, B = 0, P = this.length - 1; P >= 0; P--)
-          B = (R * B + (this.words[P] | 0)) % p;
-        return _ ? -B : B;
+        for (var R = (1 << 26) % p, q = 0, P = this.length - 1; P >= 0; P--)
+          q = (R * q + (this.words[P] | 0)) % p;
+        return _ ? -q : q;
       }, r.prototype.modn = function(p) {
         return this.modrn(p);
       }, r.prototype.idivn = function(p) {
         var _ = p < 0;
         _ && (p = -p), o(p <= 67108863);
-        for (var R = 0, B = this.length - 1; B >= 0; B--) {
-          var P = (this.words[B] | 0) + R * 67108864;
-          this.words[B] = P / p | 0, R = P % p;
+        for (var R = 0, q = this.length - 1; q >= 0; q--) {
+          var P = (this.words[q] | 0) + R * 67108864;
+          this.words[q] = P / p | 0, R = P % p;
         }
         return this._strip(), _ ? this.ineg() : this;
       }, r.prototype.divn = function(p) {
@@ -11417,18 +11417,18 @@ function requireBn() {
         o(p.negative === 0), o(!p.isZero());
         var _ = this, R = p.clone();
         _.negative !== 0 ? _ = _.umod(p) : _ = _.clone();
-        for (var B = new r(1), P = new r(0), A = new r(0), w = new r(1), M = 0; _.isEven() && R.isEven(); )
+        for (var q = new r(1), P = new r(0), A = new r(0), w = new r(1), M = 0; _.isEven() && R.isEven(); )
           _.iushrn(1), R.iushrn(1), ++M;
         for (var x = R.clone(), L = _.clone(); !_.isZero(); ) {
           for (var K = 0, Q = 1; (_.words[0] & Q) === 0 && K < 26; ++K, Q <<= 1) ;
           if (K > 0)
             for (_.iushrn(K); K-- > 0; )
-              (B.isOdd() || P.isOdd()) && (B.iadd(x), P.isub(L)), B.iushrn(1), P.iushrn(1);
+              (q.isOdd() || P.isOdd()) && (q.iadd(x), P.isub(L)), q.iushrn(1), P.iushrn(1);
           for (var H = 0, N = 1; (R.words[0] & N) === 0 && H < 26; ++H, N <<= 1) ;
           if (H > 0)
             for (R.iushrn(H); H-- > 0; )
               (A.isOdd() || w.isOdd()) && (A.iadd(x), w.isub(L)), A.iushrn(1), w.iushrn(1);
-          _.cmp(R) >= 0 ? (_.isub(R), B.isub(A), P.isub(w)) : (R.isub(_), A.isub(B), w.isub(P));
+          _.cmp(R) >= 0 ? (_.isub(R), q.isub(A), P.isub(w)) : (R.isub(_), A.isub(q), w.isub(P));
         }
         return {
           a: A,
@@ -11439,25 +11439,25 @@ function requireBn() {
         o(p.negative === 0), o(!p.isZero());
         var _ = this, R = p.clone();
         _.negative !== 0 ? _ = _.umod(p) : _ = _.clone();
-        for (var B = new r(1), P = new r(0), A = R.clone(); _.cmpn(1) > 0 && R.cmpn(1) > 0; ) {
+        for (var q = new r(1), P = new r(0), A = R.clone(); _.cmpn(1) > 0 && R.cmpn(1) > 0; ) {
           for (var w = 0, M = 1; (_.words[0] & M) === 0 && w < 26; ++w, M <<= 1) ;
           if (w > 0)
             for (_.iushrn(w); w-- > 0; )
-              B.isOdd() && B.iadd(A), B.iushrn(1);
+              q.isOdd() && q.iadd(A), q.iushrn(1);
           for (var x = 0, L = 1; (R.words[0] & L) === 0 && x < 26; ++x, L <<= 1) ;
           if (x > 0)
             for (R.iushrn(x); x-- > 0; )
               P.isOdd() && P.iadd(A), P.iushrn(1);
-          _.cmp(R) >= 0 ? (_.isub(R), B.isub(P)) : (R.isub(_), P.isub(B));
+          _.cmp(R) >= 0 ? (_.isub(R), q.isub(P)) : (R.isub(_), P.isub(q));
         }
         var K;
-        return _.cmpn(1) === 0 ? K = B : K = P, K.cmpn(0) < 0 && K.iadd(p), K;
+        return _.cmpn(1) === 0 ? K = q : K = P, K.cmpn(0) < 0 && K.iadd(p), K;
       }, r.prototype.gcd = function(p) {
         if (this.isZero()) return p.abs();
         if (p.isZero()) return this.abs();
         var _ = this.clone(), R = p.clone();
         _.negative = 0, R.negative = 0;
-        for (var B = 0; _.isEven() && R.isEven(); B++)
+        for (var q = 0; _.isEven() && R.isEven(); q++)
           _.iushrn(1), R.iushrn(1);
         do {
           for (; _.isEven(); )
@@ -11472,7 +11472,7 @@ function requireBn() {
             break;
           _.isub(R);
         } while (!0);
-        return R.iushln(B);
+        return R.iushln(q);
       }, r.prototype.invm = function(p) {
         return this.egcd(p).a.umod(p);
       }, r.prototype.isEven = function() {
@@ -11483,10 +11483,10 @@ function requireBn() {
         return this.words[0] & p;
       }, r.prototype.bincn = function(p) {
         o(typeof p == "number");
-        var _ = p % 26, R = (p - _) / 26, B = 1 << _;
+        var _ = p % 26, R = (p - _) / 26, q = 1 << _;
         if (this.length <= R)
-          return this._expand(R + 1), this.words[R] |= B, this;
-        for (var P = B, A = R; P !== 0 && A < this.length; A++) {
+          return this._expand(R + 1), this.words[R] |= q, this;
+        for (var P = q, A = R; P !== 0 && A < this.length; A++) {
           var w = this.words[A] | 0;
           w += P, P = w >>> 26, w &= 67108863, this.words[A] = w;
         }
@@ -11503,8 +11503,8 @@ function requireBn() {
           R = 1;
         else {
           _ && (p = -p), o(p <= 67108863, "Number is too big");
-          var B = this.words[0] | 0;
-          R = B === p ? 0 : B < p ? -1 : 1;
+          var q = this.words[0] | 0;
+          R = q === p ? 0 : q < p ? -1 : 1;
         }
         return this.negative !== 0 ? -R | 0 : R;
       }, r.prototype.cmp = function(p) {
@@ -11516,9 +11516,9 @@ function requireBn() {
         if (this.length > p.length) return 1;
         if (this.length < p.length) return -1;
         for (var _ = 0, R = this.length - 1; R >= 0; R--) {
-          var B = this.words[R] | 0, P = p.words[R] | 0;
-          if (B !== P) {
-            B < P ? _ = -1 : B > P && (_ = 1);
+          var q = this.words[R] | 0, P = p.words[R] | 0;
+          if (q !== P) {
+            q < P ? _ = -1 : q > P && (_ = 1);
             break;
           }
         }
@@ -11597,8 +11597,8 @@ function requireBn() {
         do
           this.split(_, this.tmp), _ = this.imulK(_), _ = _.iadd(this.tmp), R = _.bitLength();
         while (R > this.n);
-        var B = R < this.n ? -1 : _.ucmp(this.p);
-        return B === 0 ? (_.words[0] = 0, _.length = 1) : B > 0 ? _.isub(this.p) : _.strip !== void 0 ? _.strip() : _._strip(), _;
+        var q = R < this.n ? -1 : _.ucmp(this.p);
+        return q === 0 ? (_.words[0] = 0, _.length = 1) : q > 0 ? _.isub(this.p) : _.strip !== void 0 ? _.strip() : _._strip(), _;
       }, j.prototype.split = function(p, _) {
         p.iushrn(this.n, 0, _);
       }, j.prototype.imulK = function(p) {
@@ -11612,9 +11612,9 @@ function requireBn() {
         );
       }
       d(J, j), J.prototype.split = function(p, _) {
-        for (var R = 4194303, B = Math.min(p.length, 9), P = 0; P < B; P++)
+        for (var R = 4194303, q = Math.min(p.length, 9), P = 0; P < q; P++)
           _.words[P] = p.words[P];
-        if (_.length = B, p.length <= 9) {
+        if (_.length = q, p.length <= 9) {
           p.words[0] = 0, p.length = 1;
           return;
         }
@@ -11627,8 +11627,8 @@ function requireBn() {
       }, J.prototype.imulK = function(p) {
         p.words[p.length] = 0, p.words[p.length + 1] = 0, p.length += 2;
         for (var _ = 0, R = 0; R < p.length; R++) {
-          var B = p.words[R] | 0;
-          _ += B * 977, p.words[R] = _ & 67108863, _ = B * 64 + (_ / 67108864 | 0);
+          var q = p.words[R] | 0;
+          _ += q * 977, p.words[R] = _ & 67108863, _ = q * 64 + (_ / 67108864 | 0);
         }
         return p.words[p.length - 1] === 0 && (p.length--, p.words[p.length - 1] === 0 && p.length--), p;
       };
@@ -11657,8 +11657,8 @@ function requireBn() {
       }
       d(de, j), de.prototype.imulK = function(p) {
         for (var _ = 0, R = 0; R < p.length; R++) {
-          var B = (p.words[R] | 0) * 19 + _, P = B & 67108863;
-          B >>>= 26, p.words[R] = P, _ = B;
+          var q = (p.words[R] | 0) * 19 + _, P = q & 67108863;
+          q >>>= 26, p.words[R] = P, _ = q;
         }
         return _ !== 0 && (p.words[p.length++] = _), p;
       }, r._prime = function(p) {
@@ -11727,13 +11727,13 @@ function requireBn() {
           var R = this.m.add(new r(1)).iushrn(2);
           return this.pow(p, R);
         }
-        for (var B = this.m.subn(1), P = 0; !B.isZero() && B.andln(1) === 0; )
-          P++, B.iushrn(1);
-        o(!B.isZero());
+        for (var q = this.m.subn(1), P = 0; !q.isZero() && q.andln(1) === 0; )
+          P++, q.iushrn(1);
+        o(!q.isZero());
         var A = new r(1).toRed(this), w = A.redNeg(), M = this.m.subn(1).iushrn(1), x = this.m.bitLength();
         for (x = new r(2 * x * x).toRed(this); this.pow(x, M).cmp(w) !== 0; )
           x.redIAdd(w);
-        for (var L = this.pow(x, B), K = this.pow(p, B.addn(1).iushrn(1)), Q = this.pow(p, B), H = P; Q.cmp(A) !== 0; ) {
+        for (var L = this.pow(x, q), K = this.pow(p, q.addn(1).iushrn(1)), Q = this.pow(p, q), H = P; Q.cmp(A) !== 0; ) {
           for (var N = Q, F = 0; N.cmp(A) !== 0; F++)
             N = N.redSqr();
           o(F < H);
@@ -11747,19 +11747,19 @@ function requireBn() {
       }, Z.prototype.pow = function(p, _) {
         if (_.isZero()) return new r(1).toRed(this);
         if (_.cmpn(1) === 0) return p.clone();
-        var R = 4, B = new Array(1 << R);
-        B[0] = new r(1).toRed(this), B[1] = p;
-        for (var P = 2; P < B.length; P++)
-          B[P] = this.mul(B[P - 1], p);
-        var A = B[0], w = 0, M = 0, x = _.bitLength() % 26;
+        var R = 4, q = new Array(1 << R);
+        q[0] = new r(1).toRed(this), q[1] = p;
+        for (var P = 2; P < q.length; P++)
+          q[P] = this.mul(q[P - 1], p);
+        var A = q[0], w = 0, M = 0, x = _.bitLength() % 26;
         for (x === 0 && (x = 26), P = _.length - 1; P >= 0; P--) {
           for (var L = _.words[P], K = x - 1; K >= 0; K--) {
             var Q = L >> K & 1;
-            if (A !== B[0] && (A = this.sqr(A)), Q === 0 && w === 0) {
+            if (A !== q[0] && (A = this.sqr(A)), Q === 0 && w === 0) {
               M = 0;
               continue;
             }
-            w <<= 1, w |= Q, M++, !(M !== R && (P !== 0 || K !== 0)) && (A = this.mul(A, B[w]), M = 0, w = 0);
+            w <<= 1, w |= Q, M++, !(M !== R && (P !== 0 || K !== 0)) && (A = this.mul(A, q[w]), M = 0, w = 0);
           }
           x = 26;
         }
@@ -11784,11 +11784,11 @@ function requireBn() {
       }, y.prototype.imul = function(p, _) {
         if (p.isZero() || _.isZero())
           return p.words[0] = 0, p.length = 1, p;
-        var R = p.imul(_), B = R.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), P = R.isub(B).iushrn(this.shift), A = P;
+        var R = p.imul(_), q = R.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), P = R.isub(q).iushrn(this.shift), A = P;
         return P.cmp(this.m) >= 0 ? A = P.isub(this.m) : P.cmpn(0) < 0 && (A = P.iadd(this.m)), A._forceRed(this);
       }, y.prototype.mul = function(p, _) {
         if (p.isZero() || _.isZero()) return new r(0)._forceRed(this);
-        var R = p.mul(_), B = R.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), P = R.isub(B).iushrn(this.shift), A = P;
+        var R = p.mul(_), q = R.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), P = R.isub(q).iushrn(this.shift), A = P;
         return P.cmp(this.m) >= 0 ? A = P.isub(this.m) : P.cmpn(0) < 0 && (A = P.iadd(this.m)), A._forceRed(this);
       }, y.prototype.invm = function(p) {
         var _ = this.imod(p._invmp(this.m).mul(this.r2));
@@ -11814,7 +11814,7 @@ function requireBrowserifyRsa() {
     return { blinder: a, unblinder: f.invm(h.modulus) };
   }
   function r(h, f) {
-    var a = d(f), n = f.modulus.byteLength(), e = new c(h).mul(a.blinder).umod(f.modulus), s = e.toRed(c.mont(f.prime1)), l = e.toRed(c.mont(f.prime2)), v = f.coefficient, b = f.prime1, m = f.prime2, q = s.redPow(f.exponent1).fromRed(), E = l.redPow(f.exponent2).fromRed(), S = q.isub(E).imul(v).umod(b).imul(m);
+    var a = d(f), n = f.modulus.byteLength(), e = new c(h).mul(a.blinder).umod(f.modulus), s = e.toRed(c.mont(f.prime1)), l = e.toRed(c.mont(f.prime2)), v = f.coefficient, b = f.prime1, m = f.prime2, B = s.redPow(f.exponent1).fromRed(), E = l.redPow(f.exponent2).fromRed(), S = B.isub(E).imul(v).umod(b).imul(m);
     return E.iadd(S).imul(a.unblinder).umod(f.modulus).toArrayLike(u, "be", n);
   }
   return r.getr = o, browserifyRsa = r, browserifyRsa;
@@ -11873,10 +11873,10 @@ function requireUtils$2() {
       var v = new Array(Math.max(e.bitLength(), l) + 1), b;
       for (b = 0; b < v.length; b += 1)
         v[b] = 0;
-      var m = 1 << s + 1, q = e.clone();
+      var m = 1 << s + 1, B = e.clone();
       for (b = 0; b < v.length; b++) {
-        var E, S = q.andln(m - 1);
-        q.isOdd() ? (S > (m >> 1) - 1 ? E = (m >> 1) - S : E = S, q.isubn(E)) : E = 0, v[b] = E, q.iushrn(1);
+        var E, S = B.andln(m - 1);
+        B.isOdd() ? (S > (m >> 1) - 1 ? E = (m >> 1) - S : E = S, B.isubn(E)) : E = 0, v[b] = E, B.iushrn(1);
       }
       return v;
     }
@@ -11888,12 +11888,12 @@ function requireUtils$2() {
       ];
       e = e.clone(), s = s.clone();
       for (var v = 0, b = 0, m; e.cmpn(-v) > 0 || s.cmpn(-b) > 0; ) {
-        var q = e.andln(3) + v & 3, E = s.andln(3) + b & 3;
-        q === 3 && (q = -1), E === 3 && (E = -1);
+        var B = e.andln(3) + v & 3, E = s.andln(3) + b & 3;
+        B === 3 && (B = -1), E === 3 && (E = -1);
         var S;
-        (q & 1) === 0 ? S = 0 : (m = e.andln(7) + v & 7, (m === 3 || m === 5) && E === 2 ? S = -q : S = q), l[0].push(S);
+        (B & 1) === 0 ? S = 0 : (m = e.andln(7) + v & 7, (m === 3 || m === 5) && E === 2 ? S = -B : S = B), l[0].push(S);
         var O;
-        (E & 1) === 0 ? O = 0 : (m = s.andln(7) + b & 7, (m === 3 || m === 5) && q === 2 ? O = -E : O = E), l[1].push(O), 2 * v === S + 1 && (v = 1 - v), 2 * b === O + 1 && (b = 1 - b), e.iushrn(1), s.iushrn(1);
+        (E & 1) === 0 ? O = 0 : (m = s.andln(7) + b & 7, (m === 3 || m === 5) && B === 2 ? O = -E : O = E), l[1].push(O), 2 * v === S + 1 && (v = 1 - v), 2 * b === O + 1 && (b = 1 - b), e.iushrn(1), s.iushrn(1);
       }
       return l;
     }
@@ -11936,8 +11936,8 @@ function requireBase$1() {
     var v = [], b, m;
     for (b = 0; b < s.length; b += e.step) {
       m = 0;
-      for (var q = b + e.step - 1; q >= b; q--)
-        m = (m << 1) + s[q];
+      for (var B = b + e.step - 1; B >= b; B--)
+        m = (m << 1) + s[B];
       v.push(m);
     }
     for (var E = this.jpoint(null, null, null), S = this.jpoint(null, null, null), O = l; O > 0; O--) {
@@ -11950,16 +11950,16 @@ function requireBase$1() {
     var e = 4, s = a._getNAFPoints(e);
     e = s.wnd;
     for (var l = s.points, v = u(n, e, this._bitLength), b = this.jpoint(null, null, null), m = v.length - 1; m >= 0; m--) {
-      for (var q = 0; m >= 0 && v[m] === 0; m--)
-        q++;
-      if (m >= 0 && q++, b = b.dblp(q), m < 0)
+      for (var B = 0; m >= 0 && v[m] === 0; m--)
+        B++;
+      if (m >= 0 && B++, b = b.dblp(B), m < 0)
         break;
       var E = v[m];
       d(E !== 0), a.type === "affine" ? E > 0 ? b = b.mixedAdd(l[E - 1 >> 1]) : b = b.mixedAdd(l[-E - 1 >> 1].neg()) : E > 0 ? b = b.add(l[E - 1 >> 1]) : b = b.add(l[-E - 1 >> 1].neg());
     }
     return a.type === "affine" ? b.toP() : b;
   }, r.prototype._wnafMulAdd = function(a, n, e, s, l) {
-    var v = this._wnafT1, b = this._wnafT2, m = this._wnafT3, q = 0, E, S, O;
+    var v = this._wnafT1, b = this._wnafT2, m = this._wnafT3, B = 0, E, S, O;
     for (E = 0; E < s; E++) {
       O = n[E];
       var D = O._getNAFPoints(a);
@@ -11968,7 +11968,7 @@ function requireBase$1() {
     for (E = s - 1; E >= 1; E -= 2) {
       var $ = E - 1, j = E;
       if (v[$] !== 1 || v[j] !== 1) {
-        m[$] = u(e[$], v[$], this._bitLength), m[j] = u(e[j], v[j], this._bitLength), q = Math.max(m[$].length, q), q = Math.max(m[j].length, q);
+        m[$] = u(e[$], v[$], this._bitLength), m[j] = u(e[j], v[j], this._bitLength), B = Math.max(m[$].length, B), B = Math.max(m[j].length, B);
         continue;
       }
       var J = [
@@ -12002,13 +12002,13 @@ function requireBase$1() {
         3
         /* 1 1 */
       ], ne = o(e[$], e[j]);
-      for (q = Math.max(ne[0].length, q), m[$] = new Array(q), m[j] = new Array(q), S = 0; S < q; S++) {
+      for (B = Math.max(ne[0].length, B), m[$] = new Array(B), m[j] = new Array(B), S = 0; S < B; S++) {
         var de = ne[0][S] | 0, Z = ne[1][S] | 0;
         m[$][S] = ie[(de + 1) * 3 + (Z + 1)], m[j][S] = 0, b[$] = J;
       }
     }
     var y = this.jpoint(null, null, null), g = this._wnafT4;
-    for (E = q; E >= 0; E--) {
+    for (E = B; E >= 0; E--) {
       for (var p = 0; E >= 0; ) {
         var _ = !0;
         for (S = 0; S < s; S++)
@@ -12137,15 +12137,15 @@ function requireShort() {
     var e = n === this.p ? this.red : t.mont(n), s = new t(2).toRed(e).redInvm(), l = s.redNeg(), v = new t(3).toRed(e).redNeg().redSqrt().redMul(s), b = l.redAdd(v).fromRed(), m = l.redSub(v).fromRed();
     return [b, m];
   }, r.prototype._getEndoBasis = function(n) {
-    for (var e = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), s = n, l = this.n.clone(), v = new t(1), b = new t(0), m = new t(0), q = new t(1), E, S, O, D, $, j, J, ie = 0, ne, de; s.cmpn(0) !== 0; ) {
+    for (var e = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), s = n, l = this.n.clone(), v = new t(1), b = new t(0), m = new t(0), B = new t(1), E, S, O, D, $, j, J, ie = 0, ne, de; s.cmpn(0) !== 0; ) {
       var Z = l.div(s);
       ne = l.sub(Z.mul(s)), de = m.sub(Z.mul(v));
-      var y = q.sub(Z.mul(b));
+      var y = B.sub(Z.mul(b));
       if (!O && ne.cmp(e) < 0)
         E = J.neg(), S = v, O = ne.neg(), D = de;
       else if (O && ++ie === 2)
         break;
-      J = ne, l = s, s = ne, m = v, v = de, q = b, b = y;
+      J = ne, l = s, s = ne, m = v, v = de, B = b, b = y;
     }
     $ = ne.neg(), j = de;
     var g = O.sqr().add(D.sqr()), p = $.sqr().add(j.sqr());
@@ -12154,7 +12154,7 @@ function requireShort() {
       { a: $, b: j }
     ];
   }, r.prototype._endoSplit = function(n) {
-    var e = this.endo.basis, s = e[0], l = e[1], v = l.b.mul(n).divRound(this.n), b = s.b.neg().mul(n).divRound(this.n), m = v.mul(s.a), q = b.mul(l.a), E = v.mul(s.b), S = b.mul(l.b), O = n.sub(m).sub(q), D = E.add(S).neg();
+    var e = this.endo.basis, s = e[0], l = e[1], v = l.b.mul(n).divRound(this.n), b = s.b.neg().mul(n).divRound(this.n), m = v.mul(s.a), B = b.mul(l.a), E = v.mul(s.b), S = b.mul(l.b), O = n.sub(m).sub(B), D = E.add(S).neg();
     return { k1: O, k2: D };
   }, r.prototype.pointFromX = function(n, e) {
     n = new t(n, 16), n.red || (n = n.toRed(this.red));
@@ -12170,8 +12170,8 @@ function requireShort() {
     return s.redSqr().redISub(v).cmpn(0) === 0;
   }, r.prototype._endoWnafMulAdd = function(n, e, s) {
     for (var l = this._endoWnafT1, v = this._endoWnafT2, b = 0; b < n.length; b++) {
-      var m = this._endoSplit(e[b]), q = n[b], E = q._getBeta();
-      m.k1.negative && (m.k1.ineg(), q = q.neg(!0)), m.k2.negative && (m.k2.ineg(), E = E.neg(!0)), l[b * 2] = q, l[b * 2 + 1] = E, v[b * 2] = m.k1, v[b * 2 + 1] = m.k2;
+      var m = this._endoSplit(e[b]), B = n[b], E = B._getBeta();
+      m.k1.negative && (m.k1.ineg(), B = B.neg(!0)), m.k2.negative && (m.k2.ineg(), E = E.neg(!0)), l[b * 2] = B, l[b * 2 + 1] = E, v[b * 2] = m.k1, v[b * 2 + 1] = m.k2;
     }
     for (var S = this._wnafMulAdd(1, l, v, b * 2, s), O = 0; O < b * 2; O++)
       l[O] = null, v[O] = null;
@@ -12323,20 +12323,20 @@ function requireShort() {
       return n;
     if (n.isInfinity())
       return this;
-    var e = n.z.redSqr(), s = this.z.redSqr(), l = this.x.redMul(e), v = n.x.redMul(s), b = this.y.redMul(e.redMul(n.z)), m = n.y.redMul(s.redMul(this.z)), q = l.redSub(v), E = b.redSub(m);
-    if (q.cmpn(0) === 0)
+    var e = n.z.redSqr(), s = this.z.redSqr(), l = this.x.redMul(e), v = n.x.redMul(s), b = this.y.redMul(e.redMul(n.z)), m = n.y.redMul(s.redMul(this.z)), B = l.redSub(v), E = b.redSub(m);
+    if (B.cmpn(0) === 0)
       return E.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
-    var S = q.redSqr(), O = S.redMul(q), D = l.redMul(S), $ = E.redSqr().redIAdd(O).redISub(D).redISub(D), j = E.redMul(D.redISub($)).redISub(b.redMul(O)), J = this.z.redMul(n.z).redMul(q);
+    var S = B.redSqr(), O = S.redMul(B), D = l.redMul(S), $ = E.redSqr().redIAdd(O).redISub(D).redISub(D), j = E.redMul(D.redISub($)).redISub(b.redMul(O)), J = this.z.redMul(n.z).redMul(B);
     return this.curve.jpoint($, j, J);
   }, f.prototype.mixedAdd = function(n) {
     if (this.isInfinity())
       return n.toJ();
     if (n.isInfinity())
       return this;
-    var e = this.z.redSqr(), s = this.x, l = n.x.redMul(e), v = this.y, b = n.y.redMul(e).redMul(this.z), m = s.redSub(l), q = v.redSub(b);
+    var e = this.z.redSqr(), s = this.x, l = n.x.redMul(e), v = this.y, b = n.y.redMul(e).redMul(this.z), m = s.redSub(l), B = v.redSub(b);
     if (m.cmpn(0) === 0)
-      return q.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
-    var E = m.redSqr(), S = E.redMul(m), O = s.redMul(E), D = q.redSqr().redIAdd(S).redISub(O).redISub(O), $ = q.redMul(O.redISub(D)).redISub(v.redMul(S)), j = this.z.redMul(m);
+      return B.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
+    var E = m.redSqr(), S = E.redMul(m), O = s.redMul(E), D = B.redSqr().redIAdd(S).redISub(O).redISub(O), $ = B.redMul(O.redISub(D)).redISub(v.redMul(S)), j = this.z.redMul(m);
     return this.curve.jpoint(D, $, j);
   }, f.prototype.dblp = function(n) {
     if (n === 0)
@@ -12352,14 +12352,14 @@ function requireShort() {
         s = s.dbl();
       return s;
     }
-    var l = this.curve.a, v = this.curve.tinv, b = this.x, m = this.y, q = this.z, E = q.redSqr().redSqr(), S = m.redAdd(m);
+    var l = this.curve.a, v = this.curve.tinv, b = this.x, m = this.y, B = this.z, E = B.redSqr().redSqr(), S = m.redAdd(m);
     for (e = 0; e < n; e++) {
       var O = b.redSqr(), D = S.redSqr(), $ = D.redSqr(), j = O.redAdd(O).redIAdd(O).redIAdd(l.redMul(E)), J = b.redMul(D), ie = j.redSqr().redISub(J.redAdd(J)), ne = J.redISub(ie), de = j.redMul(ne);
       de = de.redIAdd(de).redISub($);
-      var Z = S.redMul(q);
-      e + 1 < n && (E = E.redMul($)), b = ie, q = Z, S = de;
+      var Z = S.redMul(B);
+      e + 1 < n && (E = E.redMul($)), b = ie, B = Z, S = de;
     }
-    return this.curve.jpoint(b, S.redMul(v), q);
+    return this.curve.jpoint(b, S.redMul(v), B);
   }, f.prototype.dbl = function() {
     return this.isInfinity() ? this : this.curve.zeroA ? this._zeroDbl() : this.curve.threeA ? this._threeDbl() : this._dbl();
   }, f.prototype._zeroDbl = function() {
@@ -12367,8 +12367,8 @@ function requireShort() {
     if (this.zOne) {
       var l = this.x.redSqr(), v = this.y.redSqr(), b = v.redSqr(), m = this.x.redAdd(v).redSqr().redISub(l).redISub(b);
       m = m.redIAdd(m);
-      var q = l.redAdd(l).redIAdd(l), E = q.redSqr().redISub(m).redISub(m), S = b.redIAdd(b);
-      S = S.redIAdd(S), S = S.redIAdd(S), n = E, e = q.redMul(m.redISub(E)).redISub(S), s = this.y.redAdd(this.y);
+      var B = l.redAdd(l).redIAdd(l), E = B.redSqr().redISub(m).redISub(m), S = b.redIAdd(b);
+      S = S.redIAdd(S), S = S.redIAdd(S), n = E, e = B.redMul(m.redISub(E)).redISub(S), s = this.y.redAdd(this.y);
     } else {
       var O = this.x.redSqr(), D = this.y.redSqr(), $ = D.redSqr(), j = this.x.redAdd(D).redSqr().redISub(O).redISub($);
       j = j.redIAdd(j);
@@ -12381,10 +12381,10 @@ function requireShort() {
     if (this.zOne) {
       var l = this.x.redSqr(), v = this.y.redSqr(), b = v.redSqr(), m = this.x.redAdd(v).redSqr().redISub(l).redISub(b);
       m = m.redIAdd(m);
-      var q = l.redAdd(l).redIAdd(l).redIAdd(this.curve.a), E = q.redSqr().redISub(m).redISub(m);
+      var B = l.redAdd(l).redIAdd(l).redIAdd(this.curve.a), E = B.redSqr().redISub(m).redISub(m);
       n = E;
       var S = b.redIAdd(b);
-      S = S.redIAdd(S), S = S.redIAdd(S), e = q.redMul(m.redISub(E)).redISub(S), s = this.y.redAdd(this.y);
+      S = S.redIAdd(S), S = S.redIAdd(S), e = B.redMul(m.redISub(E)).redISub(S), s = this.y.redAdd(this.y);
     } else {
       var O = this.z.redSqr(), D = this.y.redSqr(), $ = this.x.redMul(D), j = this.x.redSub(O).redMul(this.x.redAdd(O));
       j = j.redAdd(j).redIAdd(j);
@@ -12397,26 +12397,26 @@ function requireShort() {
     }
     return this.curve.jpoint(n, e, s);
   }, f.prototype._dbl = function() {
-    var n = this.curve.a, e = this.x, s = this.y, l = this.z, v = l.redSqr().redSqr(), b = e.redSqr(), m = s.redSqr(), q = b.redAdd(b).redIAdd(b).redIAdd(n.redMul(v)), E = e.redAdd(e);
+    var n = this.curve.a, e = this.x, s = this.y, l = this.z, v = l.redSqr().redSqr(), b = e.redSqr(), m = s.redSqr(), B = b.redAdd(b).redIAdd(b).redIAdd(n.redMul(v)), E = e.redAdd(e);
     E = E.redIAdd(E);
-    var S = E.redMul(m), O = q.redSqr().redISub(S.redAdd(S)), D = S.redISub(O), $ = m.redSqr();
+    var S = E.redMul(m), O = B.redSqr().redISub(S.redAdd(S)), D = S.redISub(O), $ = m.redSqr();
     $ = $.redIAdd($), $ = $.redIAdd($), $ = $.redIAdd($);
-    var j = q.redMul(D).redISub($), J = s.redAdd(s).redMul(l);
+    var j = B.redMul(D).redISub($), J = s.redAdd(s).redMul(l);
     return this.curve.jpoint(O, j, J);
   }, f.prototype.trpl = function() {
     if (!this.curve.zeroA)
       return this.dbl().add(this);
     var n = this.x.redSqr(), e = this.y.redSqr(), s = this.z.redSqr(), l = e.redSqr(), v = n.redAdd(n).redIAdd(n), b = v.redSqr(), m = this.x.redAdd(e).redSqr().redISub(n).redISub(l);
     m = m.redIAdd(m), m = m.redAdd(m).redIAdd(m), m = m.redISub(b);
-    var q = m.redSqr(), E = l.redIAdd(l);
+    var B = m.redSqr(), E = l.redIAdd(l);
     E = E.redIAdd(E), E = E.redIAdd(E), E = E.redIAdd(E);
-    var S = v.redIAdd(m).redSqr().redISub(b).redISub(q).redISub(E), O = e.redMul(S);
+    var S = v.redIAdd(m).redSqr().redISub(b).redISub(B).redISub(E), O = e.redMul(S);
     O = O.redIAdd(O), O = O.redIAdd(O);
-    var D = this.x.redMul(q).redISub(O);
+    var D = this.x.redMul(B).redISub(O);
     D = D.redIAdd(D), D = D.redIAdd(D);
-    var $ = this.y.redMul(S.redMul(E.redISub(S)).redISub(m.redMul(q)));
+    var $ = this.y.redMul(S.redMul(E.redISub(S)).redISub(m.redMul(B)));
     $ = $.redIAdd($), $ = $.redIAdd($), $ = $.redIAdd($);
-    var j = this.z.redAdd(m).redSqr().redISub(s).redISub(q);
+    var j = this.z.redAdd(m).redSqr().redISub(s).redISub(B);
     return this.curve.jpoint(D, $, j);
   }, f.prototype.mul = function(n, e) {
     return n = new t(n, e), this.curve._wnafMul(this, n);
@@ -12482,8 +12482,8 @@ function requireMont() {
   }, r.prototype.add = function() {
     throw new Error("Not supported on Montgomery curve");
   }, r.prototype.diffAdd = function(f, a) {
-    var n = this.x.redAdd(this.z), e = this.x.redSub(this.z), s = f.x.redAdd(f.z), l = f.x.redSub(f.z), v = l.redMul(n), b = s.redMul(e), m = a.z.redMul(v.redAdd(b).redSqr()), q = a.x.redMul(v.redISub(b).redSqr());
-    return this.curve.point(m, q);
+    var n = this.x.redAdd(this.z), e = this.x.redSub(this.z), s = f.x.redAdd(f.z), l = f.x.redSub(f.z), v = l.redMul(n), b = s.redMul(e), m = a.z.redMul(v.redAdd(b).redSqr()), B = a.x.redMul(v.redISub(b).redSqr());
+    return this.curve.point(m, B);
   }, r.prototype.mul = function(f) {
     for (var a = f.clone(), n = this, e = this.curve.point(null, null), s = this, l = []; a.cmpn(0) !== 0; a.iushrn(1))
       l.push(a.andln(1));
@@ -12558,24 +12558,24 @@ function requireEdwards() {
   }, h.prototype._extDbl = function() {
     var a = this.x.redSqr(), n = this.y.redSqr(), e = this.z.redSqr();
     e = e.redIAdd(e);
-    var s = this.curve._mulA(a), l = this.x.redAdd(this.y).redSqr().redISub(a).redISub(n), v = s.redAdd(n), b = v.redSub(e), m = s.redSub(n), q = l.redMul(b), E = v.redMul(m), S = l.redMul(m), O = b.redMul(v);
-    return this.curve.point(q, E, O, S);
+    var s = this.curve._mulA(a), l = this.x.redAdd(this.y).redSqr().redISub(a).redISub(n), v = s.redAdd(n), b = v.redSub(e), m = s.redSub(n), B = l.redMul(b), E = v.redMul(m), S = l.redMul(m), O = b.redMul(v);
+    return this.curve.point(B, E, O, S);
   }, h.prototype._projDbl = function() {
-    var a = this.x.redAdd(this.y).redSqr(), n = this.x.redSqr(), e = this.y.redSqr(), s, l, v, b, m, q;
+    var a = this.x.redAdd(this.y).redSqr(), n = this.x.redSqr(), e = this.y.redSqr(), s, l, v, b, m, B;
     if (this.curve.twisted) {
       b = this.curve._mulA(n);
       var E = b.redAdd(e);
-      this.zOne ? (s = a.redSub(n).redSub(e).redMul(E.redSub(this.curve.two)), l = E.redMul(b.redSub(e)), v = E.redSqr().redSub(E).redSub(E)) : (m = this.z.redSqr(), q = E.redSub(m).redISub(m), s = a.redSub(n).redISub(e).redMul(q), l = E.redMul(b.redSub(e)), v = E.redMul(q));
+      this.zOne ? (s = a.redSub(n).redSub(e).redMul(E.redSub(this.curve.two)), l = E.redMul(b.redSub(e)), v = E.redSqr().redSub(E).redSub(E)) : (m = this.z.redSqr(), B = E.redSub(m).redISub(m), s = a.redSub(n).redISub(e).redMul(B), l = E.redMul(b.redSub(e)), v = E.redMul(B));
     } else
-      b = n.redAdd(e), m = this.curve._mulC(this.z).redSqr(), q = b.redSub(m).redSub(m), s = this.curve._mulC(a.redISub(b)).redMul(q), l = this.curve._mulC(b).redMul(n.redISub(e)), v = b.redMul(q);
+      b = n.redAdd(e), m = this.curve._mulC(this.z).redSqr(), B = b.redSub(m).redSub(m), s = this.curve._mulC(a.redISub(b)).redMul(B), l = this.curve._mulC(b).redMul(n.redISub(e)), v = b.redMul(B);
     return this.curve.point(s, l, v);
   }, h.prototype.dbl = function() {
     return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();
   }, h.prototype._extAdd = function(a) {
-    var n = this.y.redSub(this.x).redMul(a.y.redSub(a.x)), e = this.y.redAdd(this.x).redMul(a.y.redAdd(a.x)), s = this.t.redMul(this.curve.dd).redMul(a.t), l = this.z.redMul(a.z.redAdd(a.z)), v = e.redSub(n), b = l.redSub(s), m = l.redAdd(s), q = e.redAdd(n), E = v.redMul(b), S = m.redMul(q), O = v.redMul(q), D = b.redMul(m);
+    var n = this.y.redSub(this.x).redMul(a.y.redSub(a.x)), e = this.y.redAdd(this.x).redMul(a.y.redAdd(a.x)), s = this.t.redMul(this.curve.dd).redMul(a.t), l = this.z.redMul(a.z.redAdd(a.z)), v = e.redSub(n), b = l.redSub(s), m = l.redAdd(s), B = e.redAdd(n), E = v.redMul(b), S = m.redMul(B), O = v.redMul(B), D = b.redMul(m);
     return this.curve.point(E, S, D, O);
   }, h.prototype._projAdd = function(a) {
-    var n = this.z.redMul(a.z), e = n.redSqr(), s = this.x.redMul(a.x), l = this.y.redMul(a.y), v = this.curve.d.redMul(s).redMul(l), b = e.redSub(v), m = e.redAdd(v), q = this.x.redAdd(this.y).redMul(a.x.redAdd(a.y)).redISub(s).redISub(l), E = n.redMul(b).redMul(q), S, O;
+    var n = this.z.redMul(a.z), e = n.redSqr(), s = this.x.redMul(a.x), l = this.y.redMul(a.y), v = this.curve.d.redMul(s).redMul(l), b = e.redSub(v), m = e.redAdd(v), B = this.x.redAdd(this.y).redMul(a.x.redAdd(a.y)).redISub(s).redISub(l), E = n.redMul(b).redMul(B), S, O;
     return this.curve.twisted ? (S = n.redMul(m).redMul(l.redSub(this.curve._mulA(s))), O = b.redMul(m)) : (S = n.redMul(m).redMul(l.redSub(s)), O = this.curve._mulC(b).redMul(m)), this.curve.point(E, S, O);
   }, h.prototype.add = function(a) {
     return this.isInfinity() ? a : a.isInfinity() ? this : this.curve.extended ? this._extAdd(a) : this._projAdd(a);
@@ -12643,8 +12643,8 @@ function requireUtils$1() {
           for (y = y.replace(/[^a-z0-9]+/ig, ""), y.length % 2 !== 0 && (y = "0" + y), R = 0; R < y.length; R += 2)
             p.push(parseInt(y[R] + y[R + 1], 16));
       } else for (var _ = 0, R = 0; R < y.length; R++) {
-        var B = y.charCodeAt(R);
-        B < 128 ? p[_++] = B : B < 2048 ? (p[_++] = B >> 6 | 192, p[_++] = B & 63 | 128) : u(y, R) ? (B = 65536 + ((B & 1023) << 10) + (y.charCodeAt(++R) & 1023), p[_++] = B >> 18 | 240, p[_++] = B >> 12 & 63 | 128, p[_++] = B >> 6 & 63 | 128, p[_++] = B & 63 | 128) : (p[_++] = B >> 12 | 224, p[_++] = B >> 6 & 63 | 128, p[_++] = B & 63 | 128);
+        var q = y.charCodeAt(R);
+        q < 128 ? p[_++] = q : q < 2048 ? (p[_++] = q >> 6 | 192, p[_++] = q & 63 | 128) : u(y, R) ? (q = 65536 + ((q & 1023) << 10) + (y.charCodeAt(++R) & 1023), p[_++] = q >> 18 | 240, p[_++] = q >> 12 & 63 | 128, p[_++] = q >> 6 & 63 | 128, p[_++] = q & 63 | 128) : (p[_++] = q >> 12 | 224, p[_++] = q >> 6 & 63 | 128, p[_++] = q & 63 | 128);
       }
     else
       for (R = 0; R < y.length; R++)
@@ -12682,17 +12682,17 @@ function requireUtils$1() {
   function n(y, g, p, _) {
     var R = p - g;
     c(R % 4 === 0);
-    for (var B = new Array(R / 4), P = 0, A = g; P < B.length; P++, A += 4) {
+    for (var q = new Array(R / 4), P = 0, A = g; P < q.length; P++, A += 4) {
       var w;
-      _ === "big" ? w = y[A] << 24 | y[A + 1] << 16 | y[A + 2] << 8 | y[A + 3] : w = y[A + 3] << 24 | y[A + 2] << 16 | y[A + 1] << 8 | y[A], B[P] = w >>> 0;
+      _ === "big" ? w = y[A] << 24 | y[A + 1] << 16 | y[A + 2] << 8 | y[A + 3] : w = y[A + 3] << 24 | y[A + 2] << 16 | y[A + 1] << 8 | y[A], q[P] = w >>> 0;
     }
-    return B;
+    return q;
   }
   utils.join32 = n;
   function e(y, g) {
     for (var p = new Array(y.length * 4), _ = 0, R = 0; _ < y.length; _++, R += 4) {
-      var B = y[_];
-      g === "big" ? (p[R] = B >>> 24, p[R + 1] = B >>> 16 & 255, p[R + 2] = B >>> 8 & 255, p[R + 3] = B & 255) : (p[R + 3] = B >>> 24, p[R + 2] = B >>> 16 & 255, p[R + 1] = B >>> 8 & 255, p[R] = B & 255);
+      var q = y[_];
+      g === "big" ? (p[R] = q >>> 24, p[R + 1] = q >>> 16 & 255, p[R + 2] = q >>> 8 & 255, p[R + 3] = q & 255) : (p[R + 3] = q >>> 24, p[R + 2] = q >>> 16 & 255, p[R + 1] = q >>> 8 & 255, p[R] = q & 255);
     }
     return p;
   }
@@ -12717,18 +12717,18 @@ function requireUtils$1() {
     return y + g + p + _ >>> 0;
   }
   utils.sum32_4 = m;
-  function q(y, g, p, _, R) {
+  function B(y, g, p, _, R) {
     return y + g + p + _ + R >>> 0;
   }
-  utils.sum32_5 = q;
+  utils.sum32_5 = B;
   function E(y, g, p, _) {
-    var R = y[g], B = y[g + 1], P = _ + B >>> 0, A = (P < _ ? 1 : 0) + p + R;
+    var R = y[g], q = y[g + 1], P = _ + q >>> 0, A = (P < _ ? 1 : 0) + p + R;
     y[g] = A >>> 0, y[g + 1] = P;
   }
   utils.sum64 = E;
   function S(y, g, p, _) {
-    var R = g + _ >>> 0, B = (R < g ? 1 : 0) + y + p;
-    return B >>> 0;
+    var R = g + _ >>> 0, q = (R < g ? 1 : 0) + y + p;
+    return q >>> 0;
   }
   utils.sum64_hi = S;
   function O(y, g, p, _) {
@@ -12736,27 +12736,27 @@ function requireUtils$1() {
     return R >>> 0;
   }
   utils.sum64_lo = O;
-  function D(y, g, p, _, R, B, P, A) {
+  function D(y, g, p, _, R, q, P, A) {
     var w = 0, M = g;
-    M = M + _ >>> 0, w += M < g ? 1 : 0, M = M + B >>> 0, w += M < B ? 1 : 0, M = M + A >>> 0, w += M < A ? 1 : 0;
+    M = M + _ >>> 0, w += M < g ? 1 : 0, M = M + q >>> 0, w += M < q ? 1 : 0, M = M + A >>> 0, w += M < A ? 1 : 0;
     var x = y + p + R + P + w;
     return x >>> 0;
   }
   utils.sum64_4_hi = D;
-  function $(y, g, p, _, R, B, P, A) {
-    var w = g + _ + B + A;
+  function $(y, g, p, _, R, q, P, A) {
+    var w = g + _ + q + A;
     return w >>> 0;
   }
   utils.sum64_4_lo = $;
-  function j(y, g, p, _, R, B, P, A, w, M) {
+  function j(y, g, p, _, R, q, P, A, w, M) {
     var x = 0, L = g;
-    L = L + _ >>> 0, x += L < g ? 1 : 0, L = L + B >>> 0, x += L < B ? 1 : 0, L = L + A >>> 0, x += L < A ? 1 : 0, L = L + M >>> 0, x += L < M ? 1 : 0;
+    L = L + _ >>> 0, x += L < g ? 1 : 0, L = L + q >>> 0, x += L < q ? 1 : 0, L = L + A >>> 0, x += L < A ? 1 : 0, L = L + M >>> 0, x += L < M ? 1 : 0;
     var K = y + p + R + P + w + x;
     return K >>> 0;
   }
   utils.sum64_5_hi = j;
-  function J(y, g, p, _, R, B, P, A, w, M) {
-    var x = g + _ + B + A + M;
+  function J(y, g, p, _, R, q, P, A, w, M) {
+    var x = g + _ + q + A + M;
     return x >>> 0;
   }
   utils.sum64_5_lo = J;
@@ -12883,12 +12883,12 @@ function require_1() {
       v[b] = s[l + b];
     for (; b < v.length; b++)
       v[b] = o(v[b - 3] ^ v[b - 8] ^ v[b - 14] ^ v[b - 16], 1);
-    var m = this.h[0], q = this.h[1], E = this.h[2], S = this.h[3], O = this.h[4];
+    var m = this.h[0], B = this.h[1], E = this.h[2], S = this.h[3], O = this.h[4];
     for (b = 0; b < v.length; b++) {
-      var D = ~~(b / 20), $ = r(o(m, 5), h(D, q, E, S), O, v[b], a[D]);
-      O = S, S = E, E = o(q, 30), q = m, m = $;
+      var D = ~~(b / 20), $ = r(o(m, 5), h(D, B, E, S), O, v[b], a[D]);
+      O = S, S = E, E = o(B, 30), B = m, m = $;
     }
-    this.h[0] = d(this.h[0], m), this.h[1] = d(this.h[1], q), this.h[2] = d(this.h[2], E), this.h[3] = d(this.h[3], S), this.h[4] = d(this.h[4], O);
+    this.h[0] = d(this.h[0], m), this.h[1] = d(this.h[1], B), this.h[2] = d(this.h[2], E), this.h[3] = d(this.h[3], S), this.h[4] = d(this.h[4], O);
   }, n.prototype._digest = function(s) {
     return s === "hex" ? c.toHex32(this.h, "big") : c.split32(this.h, "big");
   }, _1;
@@ -13181,9 +13181,9 @@ function require_512() {
     1816402316,
     1246189591
   ];
-  function q() {
-    if (!(this instanceof q))
-      return new q();
+  function B() {
+    if (!(this instanceof B))
+      return new B();
     b.call(this), this.h = [
       1779033703,
       4089235720,
@@ -13203,12 +13203,12 @@ function require_512() {
       327033209
     ], this.k = m, this.W = new Array(160);
   }
-  c.inherits(q, b), _512 = q, q.blockSize = 1024, q.outSize = 512, q.hmacStrength = 192, q.padLength = 128, q.prototype._prepareBlock = function(p, _) {
-    for (var R = this.W, B = 0; B < 32; B++)
-      R[B] = p[_ + B];
-    for (; B < R.length; B += 2) {
-      var P = Z(R[B - 4], R[B - 3]), A = y(R[B - 4], R[B - 3]), w = R[B - 14], M = R[B - 13], x = ne(R[B - 30], R[B - 29]), L = de(R[B - 30], R[B - 29]), K = R[B - 32], Q = R[B - 31];
-      R[B] = e(
+  c.inherits(B, b), _512 = B, B.blockSize = 1024, B.outSize = 512, B.hmacStrength = 192, B.padLength = 128, B.prototype._prepareBlock = function(p, _) {
+    for (var R = this.W, q = 0; q < 32; q++)
+      R[q] = p[_ + q];
+    for (; q < R.length; q += 2) {
+      var P = Z(R[q - 4], R[q - 3]), A = y(R[q - 4], R[q - 3]), w = R[q - 14], M = R[q - 13], x = ne(R[q - 30], R[q - 29]), L = de(R[q - 30], R[q - 29]), K = R[q - 32], Q = R[q - 31];
+      R[q] = e(
         P,
         A,
         w,
@@ -13217,7 +13217,7 @@ function require_512() {
         L,
         K,
         Q
-      ), R[B + 1] = s(
+      ), R[q + 1] = s(
         P,
         A,
         w,
@@ -13228,9 +13228,9 @@ function require_512() {
         Q
       );
     }
-  }, q.prototype._update = function(p, _) {
+  }, B.prototype._update = function(p, _) {
     this._prepareBlock(p, _);
-    var R = this.W, B = this.h[0], P = this.h[1], A = this.h[2], w = this.h[3], M = this.h[4], x = this.h[5], L = this.h[6], K = this.h[7], Q = this.h[8], H = this.h[9], N = this.h[10], F = this.h[11], ee = this.h[12], ae = this.h[13], z = this.h[14], G = this.h[15];
+    var R = this.W, q = this.h[0], P = this.h[1], A = this.h[2], w = this.h[3], M = this.h[4], x = this.h[5], L = this.h[6], K = this.h[7], Q = this.h[8], H = this.h[9], N = this.h[10], F = this.h[11], ee = this.h[12], ae = this.h[13], z = this.h[14], G = this.h[15];
     u(this.k.length === R.length);
     for (var fe = 0; fe < R.length; fe += 2) {
       var me = z, xe = G, _e = J(Q, H), qe = ie(Q, H), Re = E(Q, H, N, F, ee), be = S(Q, H, N, F, ee, ae), Fe = this.k[fe], Be = this.k[fe + 1], Me = R[fe], Te = R[fe + 1], oe = l(
@@ -13256,60 +13256,60 @@ function require_512() {
         Me,
         Te
       );
-      me = $(B, P), xe = j(B, P), _e = O(B, P, A, w, M), qe = D(B, P, A, w, M, x);
+      me = $(q, P), xe = j(q, P), _e = O(q, P, A, w, M), qe = D(q, P, A, w, M, x);
       var ge = a(me, xe, _e, qe), we = n(me, xe, _e, qe);
-      z = ee, G = ae, ee = N, ae = F, N = Q, F = H, Q = a(L, K, oe, ce), H = n(K, K, oe, ce), L = M, K = x, M = A, x = w, A = B, w = P, B = a(oe, ce, ge, we), P = n(oe, ce, ge, we);
+      z = ee, G = ae, ee = N, ae = F, N = Q, F = H, Q = a(L, K, oe, ce), H = n(K, K, oe, ce), L = M, K = x, M = A, x = w, A = q, w = P, q = a(oe, ce, ge, we), P = n(oe, ce, ge, we);
     }
-    f(this.h, 0, B, P), f(this.h, 2, A, w), f(this.h, 4, M, x), f(this.h, 6, L, K), f(this.h, 8, Q, H), f(this.h, 10, N, F), f(this.h, 12, ee, ae), f(this.h, 14, z, G);
-  }, q.prototype._digest = function(p) {
+    f(this.h, 0, q, P), f(this.h, 2, A, w), f(this.h, 4, M, x), f(this.h, 6, L, K), f(this.h, 8, Q, H), f(this.h, 10, N, F), f(this.h, 12, ee, ae), f(this.h, 14, z, G);
+  }, B.prototype._digest = function(p) {
     return p === "hex" ? c.toHex32(this.h, "big") : c.split32(this.h, "big");
   };
-  function E(g, p, _, R, B) {
-    var P = g & _ ^ ~g & B;
+  function E(g, p, _, R, q) {
+    var P = g & _ ^ ~g & q;
     return P < 0 && (P += 4294967296), P;
   }
-  function S(g, p, _, R, B, P) {
+  function S(g, p, _, R, q, P) {
     var A = p & R ^ ~p & P;
     return A < 0 && (A += 4294967296), A;
   }
-  function O(g, p, _, R, B) {
-    var P = g & _ ^ g & B ^ _ & B;
+  function O(g, p, _, R, q) {
+    var P = g & _ ^ g & q ^ _ & q;
     return P < 0 && (P += 4294967296), P;
   }
-  function D(g, p, _, R, B, P) {
+  function D(g, p, _, R, q, P) {
     var A = p & R ^ p & P ^ R & P;
     return A < 0 && (A += 4294967296), A;
   }
   function $(g, p) {
-    var _ = o(g, p, 28), R = o(p, g, 2), B = o(p, g, 7), P = _ ^ R ^ B;
+    var _ = o(g, p, 28), R = o(p, g, 2), q = o(p, g, 7), P = _ ^ R ^ q;
     return P < 0 && (P += 4294967296), P;
   }
   function j(g, p) {
-    var _ = d(g, p, 28), R = d(p, g, 2), B = d(p, g, 7), P = _ ^ R ^ B;
+    var _ = d(g, p, 28), R = d(p, g, 2), q = d(p, g, 7), P = _ ^ R ^ q;
     return P < 0 && (P += 4294967296), P;
   }
   function J(g, p) {
-    var _ = o(g, p, 14), R = o(g, p, 18), B = o(p, g, 9), P = _ ^ R ^ B;
+    var _ = o(g, p, 14), R = o(g, p, 18), q = o(p, g, 9), P = _ ^ R ^ q;
     return P < 0 && (P += 4294967296), P;
   }
   function ie(g, p) {
-    var _ = d(g, p, 14), R = d(g, p, 18), B = d(p, g, 9), P = _ ^ R ^ B;
+    var _ = d(g, p, 14), R = d(g, p, 18), q = d(p, g, 9), P = _ ^ R ^ q;
     return P < 0 && (P += 4294967296), P;
   }
   function ne(g, p) {
-    var _ = o(g, p, 1), R = o(g, p, 8), B = r(g, p, 7), P = _ ^ R ^ B;
+    var _ = o(g, p, 1), R = o(g, p, 8), q = r(g, p, 7), P = _ ^ R ^ q;
     return P < 0 && (P += 4294967296), P;
   }
   function de(g, p) {
-    var _ = d(g, p, 1), R = d(g, p, 8), B = h(g, p, 7), P = _ ^ R ^ B;
+    var _ = d(g, p, 1), R = d(g, p, 8), q = h(g, p, 7), P = _ ^ R ^ q;
     return P < 0 && (P += 4294967296), P;
   }
   function Z(g, p) {
-    var _ = o(g, p, 19), R = o(p, g, 29), B = r(g, p, 6), P = _ ^ R ^ B;
+    var _ = o(g, p, 19), R = o(p, g, 29), q = r(g, p, 6), P = _ ^ R ^ q;
     return P < 0 && (P += 4294967296), P;
   }
   function y(g, p) {
-    var _ = d(g, p, 19), R = d(p, g, 29), B = h(g, p, 6), P = _ ^ R ^ B;
+    var _ = d(g, p, 19), R = d(p, g, 29), q = h(g, p, 6), P = _ ^ R ^ q;
     return P < 0 && (P += 4294967296), P;
   }
   return _512;
@@ -13359,29 +13359,29 @@ function requireRipemd() {
       return new f();
     h.call(this), this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], this.endian = "little";
   }
-  c.inherits(f, h), ripemd.ripemd160 = f, f.blockSize = 512, f.outSize = 160, f.hmacStrength = 192, f.padLength = 64, f.prototype._update = function(q, E) {
+  c.inherits(f, h), ripemd.ripemd160 = f, f.blockSize = 512, f.outSize = 160, f.hmacStrength = 192, f.padLength = 64, f.prototype._update = function(B, E) {
     for (var S = this.h[0], O = this.h[1], D = this.h[2], $ = this.h[3], j = this.h[4], J = S, ie = O, ne = D, de = $, Z = j, y = 0; y < 80; y++) {
       var g = o(
         u(
-          r(S, a(y, O, D, $), q[s[y] + E], n(y)),
+          r(S, a(y, O, D, $), B[s[y] + E], n(y)),
           v[y]
         ),
         j
       );
       S = j, j = $, $ = u(D, 10), D = O, O = g, g = o(
         u(
-          r(J, a(79 - y, ie, ne, de), q[l[y] + E], e(y)),
+          r(J, a(79 - y, ie, ne, de), B[l[y] + E], e(y)),
           b[y]
         ),
         Z
       ), J = Z, Z = de, de = u(ne, 10), ne = ie, ie = g;
     }
     g = d(this.h[1], D, de), this.h[1] = d(this.h[2], $, Z), this.h[2] = d(this.h[3], j, J), this.h[3] = d(this.h[4], S, ie), this.h[4] = d(this.h[0], O, ne), this.h[0] = g;
-  }, f.prototype._digest = function(q) {
-    return q === "hex" ? c.toHex32(this.h, "little") : c.split32(this.h, "little");
+  }, f.prototype._digest = function(B) {
+    return B === "hex" ? c.toHex32(this.h, "little") : c.split32(this.h, "little");
   };
-  function a(m, q, E, S) {
-    return m <= 15 ? q ^ E ^ S : m <= 31 ? q & E | ~q & S : m <= 47 ? (q | ~E) ^ S : m <= 63 ? q & S | E & ~S : q ^ (E | ~S);
+  function a(m, B, E, S) {
+    return m <= 15 ? B ^ E ^ S : m <= 31 ? B & E | ~B & S : m <= 47 ? (B | ~E) ^ S : m <= 63 ? B & S | E & ~S : B ^ (E | ~S);
   }
   function n(m) {
     return m <= 15 ? 0 : m <= 31 ? 1518500249 : m <= 47 ? 1859775393 : m <= 63 ? 2400959708 : 2840853838;
@@ -14815,18 +14815,18 @@ function requireSignature$1() {
     var m = r(n, s);
     if (m === !1 || n.length !== m + s.place || (n[s.place] & 128) !== 0)
       return !1;
-    var q = n.slice(s.place, m + s.place);
+    var B = n.slice(s.place, m + s.place);
     if (b[0] === 0)
       if (b[1] & 128)
         b = b.slice(1);
       else
         return !1;
-    if (q[0] === 0)
-      if (q[1] & 128)
-        q = q.slice(1);
+    if (B[0] === 0)
+      if (B[1] & 128)
+        B = B.slice(1);
       else
         return !1;
-    return this.r = new c(b), this.s = new c(q), this.recoveryParam = null, !0;
+    return this.r = new c(b), this.s = new c(B), this.recoveryParam = null, !0;
   };
   function f(a, n) {
     if (n < 128) {
@@ -14903,11 +14903,11 @@ function requireEc() {
       for (var b = 0; b < e.length; b++) r((e[b] & 255) === e[b]);
     }
     s = this.keyFromPrivate(s, l), e = this._truncateToN(e, !1, v.msgBitLength), r(!e.isNeg(), "Can not sign a negative message");
-    var m = this.n.byteLength(), q = s.getPrivate().toArray("be", m), E = e.toArray("be", m);
+    var m = this.n.byteLength(), B = s.getPrivate().toArray("be", m), E = e.toArray("be", m);
     r(new c(E).eq(e), "Can not sign message");
     for (var S = new t({
       hash: this.hash,
-      entropy: q,
+      entropy: B,
       nonce: E,
       pers: v.pers,
       persEnc: v.persEnc || "utf8"
@@ -14929,18 +14929,18 @@ function requireEc() {
     }
   }, a.prototype.verify = function(e, s, l, v, b) {
     b || (b = {}), e = this._truncateToN(e, !1, b.msgBitLength), l = this.keyFromPublic(l, v), s = new f(s, "hex");
-    var m = s.r, q = s.s;
-    if (m.cmpn(1) < 0 || m.cmp(this.n) >= 0 || q.cmpn(1) < 0 || q.cmp(this.n) >= 0)
+    var m = s.r, B = s.s;
+    if (m.cmpn(1) < 0 || m.cmp(this.n) >= 0 || B.cmpn(1) < 0 || B.cmp(this.n) >= 0)
       return !1;
-    var E = q.invm(this.n), S = E.mul(e).umod(this.n), O = E.mul(m).umod(this.n), D;
+    var E = B.invm(this.n), S = E.mul(e).umod(this.n), O = E.mul(m).umod(this.n), D;
     return this.curve._maxwellTrick ? (D = this.g.jmulAdd(S, l.getPublic(), O), D.isInfinity() ? !1 : D.eqXToP(m)) : (D = this.g.mulAdd(S, l.getPublic(), O), D.isInfinity() ? !1 : D.getX().umod(this.n).cmp(m) === 0);
   }, a.prototype.recoverPubKey = function(n, e, s, l) {
     r((3 & s) === s, "The recovery param is more than two bits"), e = new f(e, l);
-    var v = this.n, b = new c(n), m = e.r, q = e.s, E = s & 1, S = s >> 1;
+    var v = this.n, b = new c(n), m = e.r, B = e.s, E = s & 1, S = s >> 1;
     if (m.cmp(this.curve.p.umod(this.curve.n)) >= 0 && S)
       throw new Error("Unable to find sencond key candinate");
     S ? m = this.curve.pointFromX(m.add(this.curve.n), E) : m = this.curve.pointFromX(m, E);
-    var O = e.r.invm(v), D = v.sub(b).mul(O).umod(v), $ = q.mul(O).umod(v);
+    var O = e.r.invm(v), D = v.sub(b).mul(O).umod(v), $ = B.mul(O).umod(v);
     return this.g.mulAdd(D, m, $);
   }, a.prototype.getKeyRecoveryParam = function(n, e, s, l) {
     if (e = new f(e, l), e.recoveryParam !== null)
@@ -15032,8 +15032,8 @@ function requireEddsa() {
   }
   return eddsa = f, f.prototype.sign = function(n, e) {
     n = d(n);
-    var s = this.keyFromSecret(e), l = this.hashInt(s.messagePrefix(), n), v = this.g.mul(l), b = this.encodePoint(v), m = this.hashInt(b, s.pubBytes(), n).mul(s.priv()), q = l.add(m).umod(this.curve.n);
-    return this.makeSignature({ R: v, S: q, Rencoded: b });
+    var s = this.keyFromSecret(e), l = this.hashInt(s.messagePrefix(), n), v = this.g.mul(l), b = this.encodePoint(v), m = this.hashInt(b, s.pubBytes(), n).mul(s.priv()), B = l.add(m).umod(this.curve.n);
+    return this.makeSignature({ R: v, S: B, Rencoded: b });
   }, f.prototype.verify = function(n, e, s) {
     if (n = d(n), e = this.makeSignature(e), e.S().gte(e.eddsa.curve.n) || e.S().isNeg())
       return !1;
@@ -15455,8 +15455,8 @@ function requireNode() {
       var b = {};
       return Object.keys(v).forEach(function(m) {
         m == (m | 0) && (m |= 0);
-        var q = v[m];
-        b[q] = m;
+        var B = v[m];
+        b[B] = m;
       }), b;
     }));
   }, h.forEach(function(n) {
@@ -15508,8 +15508,8 @@ function requireNode() {
       return e.wrapResult(l.children[0]._decode(e, s));
     var v = l.default, b = !0, m = null;
     if (l.key !== null && (m = e.enterKey(l.key)), l.optional) {
-      var q = null;
-      if (l.explicit !== null ? q = l.explicit : l.implicit !== null ? q = l.implicit : l.tag !== null && (q = l.tag), q === null && !l.any) {
+      var B = null;
+      if (l.explicit !== null ? B = l.explicit : l.implicit !== null ? B = l.implicit : l.tag !== null && (B = l.tag), B === null && !l.any) {
         var E = e.save();
         try {
           l.choice === null ? this._decodeGeneric(l.tag, e, s) : this._decodeChoice(e, s), b = !0;
@@ -15517,7 +15517,7 @@ function requireNode() {
           b = !1;
         }
         e.restore(E);
-      } else if (b = this._peekTag(e, q, l.any), e.isError(b))
+      } else if (b = this._peekTag(e, B, l.any), e.isError(b))
         return b;
     }
     var S;
@@ -15560,14 +15560,14 @@ function requireNode() {
   }, f.prototype._decodeChoice = function(e, s) {
     var l = this._baseState, v = null, b = !1;
     return Object.keys(l.choice).some(function(m) {
-      var q = e.save(), E = l.choice[m];
+      var B = e.save(), E = l.choice[m];
       try {
         var S = E._decode(e, s);
         if (e.isError(S))
           return !1;
         v = { type: m, value: S }, b = !0;
       } catch {
-        return e.restore(q), !1;
+        return e.restore(B), !1;
       }
       return !0;
     }, this), b ? v : e.error("Choice not matched");
@@ -15616,11 +15616,11 @@ function requireNode() {
         return s.error("Too many args for : " + v.tag);
       if (!Array.isArray(e))
         return s.error("seqof/setof, but data is not Array");
-      var q = this.clone();
-      q._baseState.implicit = null, b = this._createEncoderBuffer(e.map(function(D) {
+      var B = this.clone();
+      B._baseState.implicit = null, b = this._createEncoderBuffer(e.map(function(D) {
         var $ = this._baseState;
         return this._getUse($.args[0], e)._encode(D, s);
-      }, q));
+      }, B));
     } else v.use !== null ? E = this._getUse(v.use, l)._encode(e, s) : (b = this._encodePrimitive(v.tag, e), m = !0);
     var E;
     if (!v.any && v.choice === null) {
@@ -15759,11 +15759,11 @@ function requireDer$1() {
       return e.error('Failed to match tag: "' + s + '"');
     if (v.primitive || b !== null)
       return e.skip(b, 'Failed to match body of: "' + s + '"');
-    var m = e.save(), q = this._skipUntilEnd(
+    var m = e.save(), B = this._skipUntilEnd(
       e,
       'Failed to skip indefinite length body: "' + this.tag + '"'
     );
-    return e.isError(q) ? q : (b = e.offset - m.offset, e.restore(m), e.skip(b, 'Failed to match body of: "' + s + '"'));
+    return e.isError(B) ? B : (b = e.offset - m.offset, e.restore(m), e.skip(b, 'Failed to match body of: "' + s + '"'));
   }, h.prototype._skipUntilEnd = function(e, s) {
     for (; ; ) {
       var l = f(e, s);
@@ -15783,10 +15783,10 @@ function requireDer$1() {
       var m = this._peekTag(e, "end");
       if (e.isError(m))
         return m;
-      var q = l.decode(e, "der", v);
-      if (e.isError(q) && m)
+      var B = l.decode(e, "der", v);
+      if (e.isError(B) && m)
         break;
-      b.push(q);
+      b.push(B);
     }
     return b;
   }, h.prototype._decodeStr = function(e, s) {
@@ -15801,8 +15801,8 @@ function requireDer$1() {
         b += String.fromCharCode(v.readUInt16BE(m * 2));
       return b;
     } else if (s === "numstr") {
-      var q = e.raw().toString("ascii");
-      return this._isNumstr(q) ? q : e.error("Decoding of string type: numstr unsupported characters");
+      var B = e.raw().toString("ascii");
+      return this._isNumstr(B) ? B : e.error("Decoding of string type: numstr unsupported characters");
     } else {
       if (s === "octstr")
         return e.raw();
@@ -15815,10 +15815,10 @@ function requireDer$1() {
     }
   }, h.prototype._decodeObjid = function(e, s, l) {
     for (var v, b = [], m = 0; !e.isEmpty(); ) {
-      var q = e.readUInt8();
-      m <<= 7, m |= q & 127, (q & 128) === 0 && (b.push(m), m = 0);
+      var B = e.readUInt8();
+      m <<= 7, m |= B & 127, (B & 128) === 0 && (b.push(m), m = 0);
     }
-    q & 128 && b.push(m);
+    B & 128 && b.push(m);
     var E = b[0] / 40 | 0, S = b[0] % 40;
     if (l ? v = b : v = [E, S].concat(b.slice(1)), s) {
       var O = s[v.join(" ")];
@@ -15828,13 +15828,13 @@ function requireDer$1() {
   }, h.prototype._decodeTime = function(e, s) {
     var l = e.raw().toString();
     if (s === "gentime")
-      var v = l.slice(0, 4) | 0, b = l.slice(4, 6) | 0, m = l.slice(6, 8) | 0, q = l.slice(8, 10) | 0, E = l.slice(10, 12) | 0, S = l.slice(12, 14) | 0;
+      var v = l.slice(0, 4) | 0, b = l.slice(4, 6) | 0, m = l.slice(6, 8) | 0, B = l.slice(8, 10) | 0, E = l.slice(10, 12) | 0, S = l.slice(12, 14) | 0;
     else if (s === "utctime") {
-      var v = l.slice(0, 2) | 0, b = l.slice(2, 4) | 0, m = l.slice(4, 6) | 0, q = l.slice(6, 8) | 0, E = l.slice(8, 10) | 0, S = l.slice(10, 12) | 0;
+      var v = l.slice(0, 2) | 0, b = l.slice(2, 4) | 0, m = l.slice(4, 6) | 0, B = l.slice(6, 8) | 0, E = l.slice(8, 10) | 0, S = l.slice(10, 12) | 0;
       v < 70 ? v = 2e3 + v : v = 1900 + v;
     } else
       return e.error("Decoding " + s + " time is not supported yet");
-    return Date.UTC(v, b - 1, m, q, E, S, 0);
+    return Date.UTC(v, b - 1, m, B, E, S, 0);
   }, h.prototype._decodeNull = function(e) {
     return null;
   }, h.prototype._decodeBool = function(e) {
@@ -15949,12 +15949,12 @@ function requireDer() {
       var E = new t(2);
       return E[0] = b, E[1] = v.length, this._createEncoderBuffer([E, v]);
     }
-    for (var m = 1, q = v.length; q >= 256; q >>= 8)
+    for (var m = 1, B = v.length; B >= 256; B >>= 8)
       m++;
     var E = new t(2 + m);
     E[0] = b, E[1] = 128 | m;
-    for (var q = 1 + m, S = v.length; S > 0; q--, S >>= 8)
-      E[q] = S & 255;
+    for (var B = 1 + m, S = v.length; S > 0; B--, S >>= 8)
+      E[B] = S & 255;
     return this._createEncoderBuffer([E, v]);
   }, h.prototype._encodeStr = function(e, s) {
     if (s === "bitstr")
@@ -15990,12 +15990,12 @@ function requireDer() {
       for (b++; m >= 128; m >>= 7)
         b++;
     }
-    for (var q = new t(b), E = q.length - 1, v = e.length - 1; v >= 0; v--) {
+    for (var B = new t(b), E = B.length - 1, v = e.length - 1; v >= 0; v--) {
       var m = e[v];
-      for (q[E--] = m & 127; (m >>= 7) > 0; )
-        q[E--] = 128 | m & 127;
+      for (B[E--] = m & 127; (m >>= 7) > 0; )
+        B[E--] = 128 | m & 127;
     }
-    return this._createEncoderBuffer(q);
+    return this._createEncoderBuffer(B);
   };
   function f(n) {
     return n < 10 ? "0" + n : n;
@@ -16300,8 +16300,8 @@ function requireFixProc() {
   return fixProc = function(h, f) {
     var a = h.toString(), n = a.match(c), e;
     if (n) {
-      var l = "aes" + n[1], v = r.from(n[2], "hex"), b = r.from(n[3].replace(/[\r\n]/g, ""), "base64"), m = o(f, v.slice(0, 8), parseInt(n[1], 10)).key, q = [], E = d.createDecipheriv(l, m, v);
-      q.push(E.update(b)), q.push(E.final()), e = r.concat(q);
+      var l = "aes" + n[1], v = r.from(n[2], "hex"), b = r.from(n[3].replace(/[\r\n]/g, ""), "base64"), m = o(f, v.slice(0, 8), parseInt(n[1], 10)).key, B = [], E = d.createDecipheriv(l, m, v);
+      B.push(E.update(b)), B.push(E.final()), e = r.concat(B);
     } else {
       var s = a.match(u);
       e = r.from(s[2].replace(/[\r\n]/g, ""), "base64");
@@ -16319,7 +16319,7 @@ function requireParseAsn1() {
   hasRequiredParseAsn1 = 1;
   var c = requireAsn1(), t = require$$1, u = requireFixProc(), o = requireBrowser$6(), d = requireBrowser$7().pbkdf2Sync, r = requireSafeBuffer$1().Buffer;
   function h(a, n) {
-    var e = a.algorithm.decrypt.kde.kdeparams.salt, s = parseInt(a.algorithm.decrypt.kde.kdeparams.iters.toString(), 10), l = t[a.algorithm.decrypt.cipher.algo.join(".")], v = a.algorithm.decrypt.cipher.iv, b = a.subjectPrivateKey, m = parseInt(l.split("-")[1], 10) / 8, q = d(n, e, s, m, "sha1"), E = o.createDecipheriv(l, q, v), S = [];
+    var e = a.algorithm.decrypt.kde.kdeparams.salt, s = parseInt(a.algorithm.decrypt.kde.kdeparams.iters.toString(), 10), l = t[a.algorithm.decrypt.cipher.algo.join(".")], v = a.algorithm.decrypt.cipher.iv, b = a.subjectPrivateKey, m = parseInt(l.split("-")[1], 10) / 8, B = d(n, e, s, m, "sha1"), E = o.createDecipheriv(l, B, v), S = [];
     return S.push(E.update(b)), S.push(E.final()), r.concat(S);
   }
   function f(a) {
@@ -16435,7 +16435,7 @@ function requireSign() {
   }
   function e(E, S, O) {
     for (var D = S.params.priv_key, $ = S.params.p, j = S.params.q, J = S.params.g, ie = new d(0), ne, de = v(E, j).mod(j), Z = !1, y = l(D, j, E, O); Z === !1; )
-      ne = m(j, y, O), ie = q(J, ne, $, j), Z = ne.invm(j).imul(de.add(D.mul(ie))).mod(j), Z.cmpn(0) === 0 && (Z = !1, ie = new d(0));
+      ne = m(j, y, O), ie = B(J, ne, $, j), Z = ne.invm(j).imul(de.add(D.mul(ie))).mod(j), Z.cmpn(0) === 0 && (Z = !1, ie = new d(0));
     return s(ie, Z);
   }
   function s(E, S) {
@@ -16480,7 +16480,7 @@ function requireSign() {
     } while ($.cmp(E) !== -1);
     return $;
   }
-  function q(E, S, O, D) {
+  function B(E, S, O, D) {
     return E.toRed(d.mont(O)).redPow(S).fromRed().mod(D);
   }
   return sign.exports = a, sign.exports.getKey = l, sign.exports.makeKey = m, sign.exports;
@@ -16504,17 +16504,17 @@ function requireVerify() {
     if (l !== "rsa" && l !== "ecdsa/rsa")
       throw new Error("wrong public key type");
     e = c.concat([v, e]);
-    for (var m = b.modulus.byteLength(), q = [1], E = 0; e.length + q.length + 2 < m; )
-      q.push(255), E += 1;
-    q.push(0);
+    for (var m = b.modulus.byteLength(), B = [1], E = 0; e.length + B.length + 2 < m; )
+      B.push(255), E += 1;
+    B.push(0);
     for (var S = -1; ++S < e.length; )
-      q.push(e[S]);
-    q = c.from(q);
+      B.push(e[S]);
+    B = c.from(B);
     var O = t.mont(b.modulus);
     n = new t(n).toRed(O), n = n.redPow(new t(b.publicExponent)), n = c.from(n.fromRed().toArray());
     var D = E < 8 ? 1 : 0;
-    for (m = Math.min(n.length, q.length), n.length !== q.length && (D = 1), S = -1; ++S < m; )
-      D |= n[S] ^ q[S];
+    for (m = Math.min(n.length, B.length), n.length !== B.length && (D = 1), S = -1; ++S < m; )
+      D |= n[S] ^ B[S];
     return D === 0;
   }
   function h(n, e, s) {
@@ -16525,7 +16525,7 @@ function requireVerify() {
     return v.verify(e, n, b);
   }
   function f(n, e, s) {
-    var l = s.data.p, v = s.data.q, b = s.data.g, m = s.data.pub_key, q = o.signature.decode(n, "der"), E = q.s, S = q.r;
+    var l = s.data.p, v = s.data.q, b = s.data.g, m = s.data.pub_key, B = o.signature.decode(n, "der"), E = B.s, S = B.r;
     a(E, v), a(S, v);
     var O = t.mont(l), D = E.invm(v), $ = b.toRed(O).redPow(new t(e).mul(D).mod(v)).fromRed().mul(m.toRed(O).redPow(S.mul(D).mod(v)).fromRed()).mod(l).mod(v);
     return $.cmp(S) === 0;
@@ -16576,8 +16576,8 @@ function requireBrowser$3() {
   }, a.prototype.verify = function(l, v, b) {
     var m = typeof v == "string" ? c.from(v, b) : v;
     this.end();
-    var q = this._hash.digest();
-    return r(m, q, l, this._signType, this._tag);
+    var B = this._hash.digest();
+    return r(m, B, l, this._signType, this._tag);
   };
   function n(s) {
     return new f(s);
@@ -16705,14 +16705,14 @@ function requirePublicEncrypt() {
   hasRequiredPublicEncrypt = 1;
   var c = requireParseAsn1(), t = requireBrowser$b(), u = requireBrowser$9(), o = requireMgf(), d = requireXor(), r = requireBn$1(), h = requireWithPublic(), f = /* @__PURE__ */ requireBrowserifyRsa(), a = requireSafeBuffer$1().Buffer;
   publicEncrypt = function(v, b, m) {
-    var q;
-    v.padding ? q = v.padding : m ? q = 1 : q = 4;
+    var B;
+    v.padding ? B = v.padding : m ? B = 1 : B = 4;
     var E = c(v), S;
-    if (q === 4)
+    if (B === 4)
       S = n(E, b);
-    else if (q === 1)
+    else if (B === 1)
       S = e(E, b, m);
-    else if (q === 3) {
+    else if (B === 3) {
       if (S = new r(b), S.cmp(E.modulus) >= 0)
         throw new Error("data too long for modulus");
     } else
@@ -16720,22 +16720,22 @@ function requirePublicEncrypt() {
     return m ? f(S, E) : h(S, E);
   };
   function n(l, v) {
-    var b = l.modulus.byteLength(), m = v.length, q = u("sha1").update(a.alloc(0)).digest(), E = q.length, S = 2 * E;
+    var b = l.modulus.byteLength(), m = v.length, B = u("sha1").update(a.alloc(0)).digest(), E = B.length, S = 2 * E;
     if (m > b - S - 2)
       throw new Error("message too long");
-    var O = a.alloc(b - m - S - 2), D = b - E - 1, $ = t(E), j = d(a.concat([q, O, a.alloc(1, 1), v], D), o($, D)), J = d($, o(j, E));
+    var O = a.alloc(b - m - S - 2), D = b - E - 1, $ = t(E), j = d(a.concat([B, O, a.alloc(1, 1), v], D), o($, D)), J = d($, o(j, E));
     return new r(a.concat([a.alloc(1), J, j], b));
   }
   function e(l, v, b) {
-    var m = v.length, q = l.modulus.byteLength();
-    if (m > q - 11)
+    var m = v.length, B = l.modulus.byteLength();
+    if (m > B - 11)
       throw new Error("message too long");
     var E;
-    return b ? E = a.alloc(q - m - 3, 255) : E = s(q - m - 3), new r(a.concat([a.from([0, b ? 1 : 2]), E, a.alloc(1), v], q));
+    return b ? E = a.alloc(B - m - 3, 255) : E = s(B - m - 3), new r(a.concat([a.from([0, b ? 1 : 2]), E, a.alloc(1), v], B));
   }
   function s(l) {
-    for (var v = a.allocUnsafe(l), b = 0, m = t(l * 2), q = 0, E; b < l; )
-      q === m.length && (m = t(l * 2), q = 0), E = m[q++], E && (v[b++] = E);
+    for (var v = a.allocUnsafe(l), b = 0, m = t(l * 2), B = 0, E; b < l; )
+      B === m.length && (m = t(l * 2), B = 0), E = m[B++], E && (v[b++] = E);
     return v;
   }
   return publicEncrypt;
@@ -16748,16 +16748,16 @@ function requirePrivateDecrypt() {
   privateDecrypt = function(l, v, b) {
     var m;
     l.padding ? m = l.padding : b ? m = 1 : m = 4;
-    var q = c(l), E = q.modulus.byteLength();
-    if (v.length > E || new o(v).cmp(q.modulus) >= 0)
+    var B = c(l), E = B.modulus.byteLength();
+    if (v.length > E || new o(v).cmp(B.modulus) >= 0)
       throw new Error("decryption error");
     var S;
-    b ? S = h(new o(v), q) : S = d(v, q);
+    b ? S = h(new o(v), B) : S = d(v, B);
     var O = f.alloc(E - S.length);
     if (S = f.concat([O, S], E), m === 4)
-      return a(q, S);
+      return a(B, S);
     if (m === 1)
-      return n(q, S, b);
+      return n(B, S, b);
     if (m === 3)
       return S;
     throw new Error("unknown padding");
@@ -16766,7 +16766,7 @@ function requirePrivateDecrypt() {
     var v = s.modulus.byteLength(), b = r("sha1").update(f.alloc(0)).digest(), m = b.length;
     if (l[0] !== 0)
       throw new Error("decryption error");
-    var q = l.slice(1, m + 1), E = l.slice(m + 1), S = u(q, t(E, m)), O = u(E, t(S, v - m - 1));
+    var B = l.slice(1, m + 1), E = l.slice(m + 1), S = u(B, t(E, m)), O = u(E, t(S, v - m - 1));
     if (e(b, O.slice(0, m)))
       throw new Error("decryption error");
     for (var D = m; O[D] === 0; )
@@ -16776,13 +16776,13 @@ function requirePrivateDecrypt() {
     return O.slice(D);
   }
   function n(s, l, v) {
-    for (var b = l.slice(0, 2), m = 2, q = 0; l[m++] !== 0; )
+    for (var b = l.slice(0, 2), m = 2, B = 0; l[m++] !== 0; )
       if (m >= l.length) {
-        q++;
+        B++;
         break;
       }
     var E = l.slice(2, m - 1);
-    if ((b.toString("hex") !== "0002" && !v || b.toString("hex") !== "0001" && v) && q++, E.length < 8 && q++, q)
+    if ((b.toString("hex") !== "0002" && !v || b.toString("hex") !== "0001" && v) && B++, E.length < 8 && B++, B)
       throw new Error("decryption error");
     return l.slice(m);
   }
@@ -16845,7 +16845,7 @@ use chrome, FireFox or Internet Explorer 11`);
   }
   function e(l, v, b, m) {
     if (process$1.browser) {
-      var q = l.buffer, E = new Uint8Array(q, v, b);
+      var B = l.buffer, E = new Uint8Array(B, v, b);
       if (r.getRandomValues(E), m) {
         process$1.nextTick(function() {
           m(null, l);
@@ -17014,7 +17014,7 @@ function requireJsbn() {
     var Y = d();
     return Y.fromInt(V), Y;
   }
-  function q(V, Y, te) {
+  function B(V, Y, te) {
     var he;
     switch (Y) {
       case 2:
@@ -17154,7 +17154,7 @@ function requireJsbn() {
     }
     V.t > 0 && (V[V.t - 1] += Y.am(te, Y[te], V, 2 * te, 0, 1)), V.s = 0, V.clamp();
   }
-  function B(V, Y, te) {
+  function q(V, Y, te) {
     var he = V.abs();
     if (!(he.t <= 0)) {
       var Ee = this.abs();
@@ -17632,7 +17632,7 @@ function requireJsbn() {
     }
     return !0;
   }
-  return o.prototype.copyTo = v, o.prototype.fromInt = b, o.prototype.fromString = q, o.prototype.fromByteArray = E, o.prototype.fromBuffer = S, o.prototype.clamp = O, o.prototype.dlShiftTo = de, o.prototype.drShiftTo = Z, o.prototype.lShiftTo = y, o.prototype.rShiftTo = g, o.prototype.subTo = p, o.prototype.multiplyTo = _, o.prototype.squareTo = R, o.prototype.divRemTo = B, o.prototype.invDigit = Q, o.prototype.isEven = G, o.prototype.exp = fe, o.prototype.chunkSize = be, o.prototype.toRadix = Be, o.prototype.fromRadix = Me, o.prototype.fromNumber = Te, o.prototype.bitwiseTo = Oe, o.prototype.changeBit = Ye, o.prototype.addTo = k, o.prototype.dMultiply = Ge, o.prototype.dAddOffset = Ue, o.prototype.multiplyLowerTo = ur, o.prototype.multiplyUpperTo = cr, o.prototype.modInt = gr, o.prototype.millerRabin = Sr, o.prototype.toString = D, o.prototype.negate = $, o.prototype.abs = j, o.prototype.compareTo = J, o.prototype.bitLength = ne, o.prototype.mod = P, o.prototype.modPowInt = me, o.prototype.clone = xe, o.prototype.intValue = _e, o.prototype.byteValue = qe, o.prototype.shortValue = Re, o.prototype.signum = Fe, o.prototype.toByteArray = oe, o.prototype.toBuffer = ce, o.prototype.equals = ge, o.prototype.min = we, o.prototype.max = Se, o.prototype.and = I, o.prototype.or = X, o.prototype.xor = le, o.prototype.andNot = Ce, o.prototype.not = Le, o.prototype.shiftLeft = Ie, o.prototype.shiftRight = je, o.prototype.getLowestSetBit = He, o.prototype.bitCount = Ze, o.prototype.testBit = We, o.prototype.setBit = Xe, o.prototype.clearBit = W, o.prototype.flipBit = T, o.prototype.add = re, o.prototype.subtract = ue, o.prototype.multiply = pe, o.prototype.divide = ke, o.prototype.remainder = Ve, o.prototype.divideAndRemainder = Ne, o.prototype.modPow = br, o.prototype.modInverse = wr, o.prototype.pow = fr, o.prototype.gcd = yr, o.prototype.isProbablePrime = xr, o.int2char = s, o.ZERO = m(0), o.ONE = m(1), o.prototype.square = ye, jsbn = o, jsbn;
+  return o.prototype.copyTo = v, o.prototype.fromInt = b, o.prototype.fromString = B, o.prototype.fromByteArray = E, o.prototype.fromBuffer = S, o.prototype.clamp = O, o.prototype.dlShiftTo = de, o.prototype.drShiftTo = Z, o.prototype.lShiftTo = y, o.prototype.rShiftTo = g, o.prototype.subTo = p, o.prototype.multiplyTo = _, o.prototype.squareTo = R, o.prototype.divRemTo = q, o.prototype.invDigit = Q, o.prototype.isEven = G, o.prototype.exp = fe, o.prototype.chunkSize = be, o.prototype.toRadix = Be, o.prototype.fromRadix = Me, o.prototype.fromNumber = Te, o.prototype.bitwiseTo = Oe, o.prototype.changeBit = Ye, o.prototype.addTo = k, o.prototype.dMultiply = Ge, o.prototype.dAddOffset = Ue, o.prototype.multiplyLowerTo = ur, o.prototype.multiplyUpperTo = cr, o.prototype.modInt = gr, o.prototype.millerRabin = Sr, o.prototype.toString = D, o.prototype.negate = $, o.prototype.abs = j, o.prototype.compareTo = J, o.prototype.bitLength = ne, o.prototype.mod = P, o.prototype.modPowInt = me, o.prototype.clone = xe, o.prototype.intValue = _e, o.prototype.byteValue = qe, o.prototype.shortValue = Re, o.prototype.signum = Fe, o.prototype.toByteArray = oe, o.prototype.toBuffer = ce, o.prototype.equals = ge, o.prototype.min = we, o.prototype.max = Se, o.prototype.and = I, o.prototype.or = X, o.prototype.xor = le, o.prototype.andNot = Ce, o.prototype.not = Le, o.prototype.shiftLeft = Ie, o.prototype.shiftRight = je, o.prototype.getLowestSetBit = He, o.prototype.bitCount = Ze, o.prototype.testBit = We, o.prototype.setBit = Xe, o.prototype.clearBit = W, o.prototype.flipBit = T, o.prototype.add = re, o.prototype.subtract = ue, o.prototype.multiply = pe, o.prototype.divide = ke, o.prototype.remainder = Ve, o.prototype.divideAndRemainder = Ne, o.prototype.modPow = br, o.prototype.modInverse = wr, o.prototype.pow = fr, o.prototype.gcd = yr, o.prototype.isProbablePrime = xr, o.int2char = s, o.ZERO = m(0), o.ONE = m(1), o.prototype.square = ye, jsbn = o, jsbn;
 }
 var schemes = { exports: {} }, pkcs1$1 = { exports: {} }, hasRequiredPkcs1$1;
 function requirePkcs1$1() {
@@ -17722,8 +17722,8 @@ function requirePkcs1$1() {
         var b = this.pkcs1pad(v.digest(), l), m = this.key.$doPublic(new c(e));
         return m.toBuffer().toString("hex") == b.toString("hex");
       } else {
-        var q = t.createVerify("RSA-" + l.toUpperCase());
-        return q.update(n), q.verify(this.options.rsaUtils.exportKey("public"), e, s);
+        var B = t.createVerify("RSA-" + l.toUpperCase());
+        return B.update(n), B.verify(this.options.rsaUtils.exportKey("public"), e, s);
       }
     }, a.prototype.pkcs0pad = function(n) {
       var e = Buffer.alloc(this.key.maxMessageLength - n.length);
@@ -17786,10 +17786,10 @@ function requireOaep() {
         l.update(n), l = l.digest();
         var v = Buffer.alloc(e - h.length - 2 * s - 1);
         v.fill(0), v[v.length - 1] = 1;
-        for (var b = Buffer.concat([l, v, h]), m = t.randomBytes(s), q = a(m, b.length, f), E = 0; E < b.length; E++)
-          b[E] ^= q[E];
-        for (q = a(b, s, f), E = 0; E < m.length; E++)
-          m[E] ^= q[E];
+        for (var b = Buffer.concat([l, v, h]), m = t.randomBytes(s), B = a(m, b.length, f), E = 0; E < b.length; E++)
+          b[E] ^= B[E];
+        for (B = a(b, s, f), E = 0; E < m.length; E++)
+          m[E] ^= B[E];
         var S = Buffer.alloc(1 + m.length + b.length);
         return S[0] = 0, m.copy(S, 1), b.copy(S, 1 + m.length), S;
       }, r.prototype.encUnPad = function(h) {
@@ -17802,8 +17802,8 @@ function requireOaep() {
           l[b] ^= v[b];
         var m = t.createHash(f);
         m.update(n), m = m.digest();
-        var q = l.slice(0, e);
-        if (q.toString("hex") != m.toString("hex"))
+        var B = l.slice(0, e);
+        if (B.toString("hex") != m.toString("hex"))
           throw new Error("Error decoding message, the lHash calculated from the label provided and the lHash in the encrypted data do not match.");
         for (b = e; l[b++] === 0 && b < l.length; ) ;
         if (l[b - 1] != 1)
@@ -17843,10 +17843,10 @@ function requirePss() {
         throw new Error(
           "Output length passed to emBits(" + n + ") is too small for the options specified(" + e + ", " + l + "). To fix this issue increase the value of emBits. (minimum size: " + (8 * v + 8 * l + 9) + ")"
         );
-      var m = t.randomBytes(l), q = Buffer.alloc(8 + v + l);
-      q.fill(0, 0, 8), a.copy(q, 8), m.copy(q, 8 + a.length);
+      var m = t.randomBytes(l), B = Buffer.alloc(8 + v + l);
+      B.fill(0, 0, 8), a.copy(B, 8), m.copy(B, 8 + a.length);
       var E = t.createHash(e);
-      E.update(q), E = E.digest();
+      E.update(B), E = E.digest();
       var S = Buffer.alloc(b - m.length - v - 2);
       S.fill(0);
       var O = Buffer.alloc(S.length + 1 + m.length);
@@ -17861,19 +17861,19 @@ function requirePss() {
       var s = this.options.signingSchemeOptions.hash || u, l = this.options.signingSchemeOptions.mgf || h.eme_oaep_mgf1, v = this.options.signingSchemeOptions.saltLength || o, b = h.digestLength[s], m = Math.ceil(e / 8);
       if (m < b + v + 2 || n[n.length - 1] != 188)
         return !1;
-      var q = Buffer.alloc(m - b - 1);
-      n.copy(q, 0, 0, m - b - 1);
+      var B = Buffer.alloc(m - b - 1);
+      n.copy(B, 0, 0, m - b - 1);
       for (var E = 0, S = 0, O = 8 * m - e; S < O; S++)
         E |= 1 << 7 - S;
-      if ((q[0] & E) !== 0)
+      if ((B[0] & E) !== 0)
         return !1;
-      var D = n.slice(m - b - 1, m - 1), $ = l(D, q.length, s);
-      for (S = 0; S < q.length; S++)
-        q[S] ^= $[S];
-      for (O = 8 * m - e, E = 255 ^ 255 >> 8 - O << 8 - O, q[0] = q[0] & E, S = 0; q[S] === 0 && S < q.length; S++) ;
-      if (q[S] != 1)
+      var D = n.slice(m - b - 1, m - 1), $ = l(D, B.length, s);
+      for (S = 0; S < B.length; S++)
+        B[S] ^= $[S];
+      for (O = 8 * m - e, E = 255 ^ 255 >> 8 - O << 8 - O, B[0] = B[0] & E, S = 0; B[S] === 0 && S < B.length; S++) ;
+      if (B[S] != 1)
         return !1;
-      var j = q.slice(q.length - v), J = Buffer.alloc(8 + b + v);
+      var j = B.slice(B.length - v), J = Buffer.alloc(8 + b + v);
       J.fill(0, 0, 8), a.copy(J, 8), j.copy(J, 8 + a.length);
       var ie = t.createHash(s);
       return ie.update(J), ie = ie.digest(), D.toString("hex") === ie.toString("hex");
@@ -18246,7 +18246,7 @@ function requireErrors() {
   function m(S, O, D) {
     return S.substr(0, O.length) === O;
   }
-  function q(S, O, D) {
+  function B(S, O, D) {
     return (D === void 0 || D > S.length) && (D = S.length), S.substring(D - O.length, D) === O;
   }
   function E(S, O, D) {
@@ -18257,7 +18257,7 @@ function requireErrors() {
     var $;
     typeof O == "string" && m(O, "not ") ? ($ = "must not be", O = O.replace(/^not /, "")) : $ = "must be";
     var j;
-    if (q(S, " argument"))
+    if (B(S, " argument"))
       j = "The ".concat(S, " ").concat($, " ").concat(b(O, "type"));
     else {
       var J = E(S, ".") ? "property" : "argument";
@@ -18351,7 +18351,7 @@ function requireAssertion_error() {
   function a(A, w) {
     if (typeof w != "function" && w !== null)
       throw new TypeError("Super expression must either be null or a function");
-    A.prototype = Object.create(w && w.prototype, { constructor: { value: A, writable: !0, configurable: !0 } }), Object.defineProperty(A, "prototype", { writable: !1 }), w && q(A, w);
+    A.prototype = Object.create(w && w.prototype, { constructor: { value: A, writable: !0, configurable: !0 } }), Object.defineProperty(A, "prototype", { writable: !1 }), w && B(A, w);
   }
   function n(A) {
     var w = b();
@@ -18390,7 +18390,7 @@ function requireAssertion_error() {
       function L() {
         return v(x, arguments, E(this).constructor);
       }
-      return L.prototype = Object.create(x.prototype, { constructor: { value: L, enumerable: !1, writable: !0, configurable: !0 } }), q(L, x);
+      return L.prototype = Object.create(x.prototype, { constructor: { value: L, enumerable: !1, writable: !0, configurable: !0 } }), B(L, x);
     }, l(A);
   }
   function v(A, w, M) {
@@ -18398,7 +18398,7 @@ function requireAssertion_error() {
       var H = [null];
       H.push.apply(H, K);
       var N = Function.bind.apply(L, H), F = new N();
-      return Q && q(F, Q.prototype), F;
+      return Q && B(F, Q.prototype), F;
     }, v.apply(null, arguments);
   }
   function b() {
@@ -18414,10 +18414,10 @@ function requireAssertion_error() {
   function m(A) {
     return Function.toString.call(A).indexOf("[native code]") !== -1;
   }
-  function q(A, w) {
-    return q = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function(x, L) {
+  function B(A, w) {
+    return B = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function(x, L) {
       return x.__proto__ = L, x;
-    }, q(A, w);
+    }, B(A, w);
   }
   function E(A) {
     return E = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function(M) {
@@ -18485,7 +18485,7 @@ function requireAssertion_error() {
       getters: !0
     });
   }
-  function B(A, w, M) {
+  function q(A, w, M) {
     var x = "", L = "", K = 0, Q = "", H = !1, N = R(A), F = N.split(`
 `), ee = R(w).split(`
 `), ae = 0, z = "";
@@ -18572,7 +18572,7 @@ function requireAssertion_error() {
       if (Error.stackTraceLimit = 0, Q != null)
         K = M.call(this, String(Q));
       else if (process$1.stderr && process$1.stderr.isTTY && (process$1.stderr && process$1.stderr.getColorDepth && process$1.stderr.getColorDepth() !== 1 ? (ne = "\x1B[34m", de = "\x1B[32m", y = "\x1B[39m", Z = "\x1B[31m") : (ne = "", de = "", y = "", Z = "")), S(F) === "object" && F !== null && S(ee) === "object" && ee !== null && "stack" in F && F instanceof Error && "stack" in ee && ee instanceof Error && (F = _(F), ee = _(ee)), H === "deepStrictEqual" || H === "strictEqual")
-        K = M.call(this, B(F, ee, H));
+        K = M.call(this, q(F, ee, H));
       else if (H === "notDeepStrictEqual" || H === "notStrictEqual") {
         var z = g[H], G = R(F).split(`
 `);
@@ -18697,14 +18697,14 @@ function requireImplementation$3() {
       }
     };
     c = function(v) {
-      var b = v !== null && typeof v == "object", m = u.call(v) === "[object Function]", q = o(v), E = b && u.call(v) === "[object String]", S = [];
-      if (!b && !m && !q)
+      var b = v !== null && typeof v == "object", m = u.call(v) === "[object Function]", B = o(v), E = b && u.call(v) === "[object String]", S = [];
+      if (!b && !m && !B)
         throw new TypeError("Object.keys called on a non-object");
       var O = h && m;
       if (E && v.length > 0 && !t.call(v, 0))
         for (var D = 0; D < v.length; ++D)
           S.push(String(D));
-      if (q && v.length > 0)
+      if (B && v.length > 0)
         for (var $ = 0; $ < v.length; ++$)
           S.push(String($));
       else
@@ -18753,8 +18753,8 @@ function requireImplementation$2() {
     for (var s = 1; s < arguments.length; ++s) {
       var l = o(arguments[s]), v = c(l), b = t && (o.getOwnPropertySymbols || h);
       if (b)
-        for (var m = b(l), q = 0; q < m.length; ++q) {
-          var E = m[q];
+        for (var m = b(l), B = 0; B < m.length; ++B) {
+          var E = m[B];
           r(l, E) && d(v, E);
         }
       for (var S = 0; S < v.length; ++S) {
@@ -18983,8 +18983,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
   function v(oe) {
     return oe.call.bind(oe);
   }
-  var b = v(Object.prototype.hasOwnProperty), m = v(Object.prototype.propertyIsEnumerable), q = v(Object.prototype.toString), E = requireUtil$1().types, S = E.isAnyArrayBuffer, O = E.isArrayBufferView, D = E.isDate, $ = E.isMap, j = E.isRegExp, J = E.isSet, ie = E.isNativeError, ne = E.isBoxedPrimitive, de = E.isNumberObject, Z = E.isStringObject, y = E.isBooleanObject, g = E.isBigIntObject, p = E.isSymbolObject, _ = E.isFloat32Array, R = E.isFloat64Array;
-  function B(oe) {
+  var b = v(Object.prototype.hasOwnProperty), m = v(Object.prototype.propertyIsEnumerable), B = v(Object.prototype.toString), E = requireUtil$1().types, S = E.isAnyArrayBuffer, O = E.isArrayBufferView, D = E.isDate, $ = E.isMap, j = E.isRegExp, J = E.isSet, ie = E.isNativeError, ne = E.isBoxedPrimitive, de = E.isNumberObject, Z = E.isStringObject, y = E.isBooleanObject, g = E.isBigIntObject, p = E.isSymbolObject, _ = E.isFloat32Array, R = E.isFloat64Array;
+  function q(oe) {
     if (oe.length === 0 || oe.length > 10) return !0;
     for (var ce = 0; ce < oe.length; ce++) {
       var ge = oe.charCodeAt(ce);
@@ -18993,7 +18993,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
     return oe.length === 10 && oe >= Math.pow(2, 32);
   }
   function P(oe) {
-    return Object.keys(oe).filter(B).concat(s(oe).filter(Object.prototype.propertyIsEnumerable.bind(oe)));
+    return Object.keys(oe).filter(q).concat(s(oe).filter(Object.prototype.propertyIsEnumerable.bind(oe)));
   }
   function A(oe, ce) {
     if (oe === ce)
@@ -19040,7 +19040,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       if (ce === null || h(ce) !== "object")
         return !1;
     }
-    var Se = q(oe), Oe = q(ce);
+    var Se = B(oe), Oe = B(ce);
     if (Se !== Oe)
       return !1;
     if (Array.isArray(oe)) {
@@ -19293,7 +19293,7 @@ function requireAssert() {
     if (!(K instanceof Q))
       throw new TypeError("Cannot call a class as a function");
   }
-  var o = requireErrors(), d = o.codes, r = d.ERR_AMBIGUOUS_ARGUMENT, h = d.ERR_INVALID_ARG_TYPE, f = d.ERR_INVALID_ARG_VALUE, a = d.ERR_INVALID_RETURN_VALUE, n = d.ERR_MISSING_ARGS, e = requireAssertion_error(), s = requireUtil$1(), l = s.inspect, v = requireUtil$1().types, b = v.isPromise, m = v.isRegExp, q = requirePolyfill$2()(), E = requirePolyfill$1()(), S = requireCallBound()("RegExp.prototype.test"), O, D;
+  var o = requireErrors(), d = o.codes, r = d.ERR_AMBIGUOUS_ARGUMENT, h = d.ERR_INVALID_ARG_TYPE, f = d.ERR_INVALID_ARG_VALUE, a = d.ERR_INVALID_RETURN_VALUE, n = d.ERR_MISSING_ARGS, e = requireAssertion_error(), s = requireUtil$1(), l = s.inspect, v = requireUtil$1().types, b = v.isPromise, m = v.isRegExp, B = requirePolyfill$2()(), E = requirePolyfill$1()(), S = requireCallBound()("RegExp.prototype.test"), O, D;
   function $() {
     var K = requireComparisons();
     O = K.isDeepEqual, D = K.isDeepStrictEqual;
@@ -19485,7 +19485,7 @@ function requireAssert() {
     }
     return Q.prototype !== void 0 && K instanceof Q ? !0 : Error.isPrototypeOf(Q) ? !1 : Q.call({}, K) === !0;
   }
-  function B(K) {
+  function q(K) {
     if (typeof K != "function")
       throw new h("fn", "Function", K);
     try {
@@ -19563,7 +19563,7 @@ function requireAssert() {
   J.throws = function K(Q) {
     for (var H = arguments.length, N = new Array(H > 1 ? H - 1 : 0), F = 1; F < H; F++)
       N[F - 1] = arguments[F];
-    w.apply(void 0, [K, B(Q)].concat(N));
+    w.apply(void 0, [K, q(Q)].concat(N));
   }, J.rejects = function K(Q) {
     for (var H = arguments.length, N = new Array(H > 1 ? H - 1 : 0), F = 1; F < H; F++)
       N[F - 1] = arguments[F];
@@ -19573,7 +19573,7 @@ function requireAssert() {
   }, J.doesNotThrow = function K(Q) {
     for (var H = arguments.length, N = new Array(H > 1 ? H - 1 : 0), F = 1; F < H; F++)
       N[F - 1] = arguments[F];
-    M.apply(void 0, [K, B(Q)].concat(N));
+    M.apply(void 0, [K, q(Q)].concat(N));
   }, J.doesNotReject = function K(Q) {
     for (var H = arguments.length, N = new Array(H > 1 ? H - 1 : 0), F = 1; F < H; F++)
       N[F - 1] = arguments[F];
@@ -19643,7 +19643,7 @@ function requireAssert() {
       Q[H] = arguments[H];
     Z.apply(void 0, [L, Q.length].concat(Q));
   }
-  return J.strict = q(L, J, {
+  return J.strict = B(L, J, {
     equal: J.strictEqual,
     deepEqual: J.deepStrictEqual,
     notEqual: J.notStrictEqual,
@@ -19951,8 +19951,8 @@ function requirePkcs1() {
     c.exports = {
       privateExport: function(a, n) {
         n = n || {};
-        var e = a.n.toBuffer(), s = a.d.toBuffer(), l = a.p.toBuffer(), v = a.q.toBuffer(), b = a.dmp1.toBuffer(), m = a.dmq1.toBuffer(), q = a.coeff.toBuffer(), E = e.length + s.length + l.length + v.length + b.length + m.length + q.length + 512, S = new t.Writer({ size: E });
-        return S.startSequence(), S.writeInt(0), S.writeBuffer(e, 2), S.writeInt(a.e), S.writeBuffer(s, 2), S.writeBuffer(l, 2), S.writeBuffer(v, 2), S.writeBuffer(b, 2), S.writeBuffer(m, 2), S.writeBuffer(q, 2), S.endSequence(), n.type === "der" ? S.buffer : d + `
+        var e = a.n.toBuffer(), s = a.d.toBuffer(), l = a.p.toBuffer(), v = a.q.toBuffer(), b = a.dmp1.toBuffer(), m = a.dmq1.toBuffer(), B = a.coeff.toBuffer(), E = e.length + s.length + l.length + v.length + b.length + m.length + B.length + 512, S = new t.Writer({ size: E });
+        return S.startSequence(), S.writeInt(0), S.writeBuffer(e, 2), S.writeInt(a.e), S.writeBuffer(s, 2), S.writeBuffer(l, 2), S.writeBuffer(v, 2), S.writeBuffer(b, 2), S.writeBuffer(m, 2), S.writeBuffer(B, 2), S.endSequence(), n.type === "der" ? S.buffer : d + `
 ` + o.linebrk(S.buffer.toString("base64"), 64) + `
 ` + r;
       },
@@ -20035,8 +20035,8 @@ function requirePkcs8() {
     c.exports = {
       privateExport: function(n, e) {
         e = e || {};
-        var s = n.n.toBuffer(), l = n.d.toBuffer(), v = n.p.toBuffer(), b = n.q.toBuffer(), m = n.dmp1.toBuffer(), q = n.dmq1.toBuffer(), E = n.coeff.toBuffer(), S = s.length + l.length + v.length + b.length + m.length + q.length + E.length + 512, O = new t.Writer({ size: S });
-        O.startSequence(), O.writeInt(0), O.writeBuffer(s, 2), O.writeInt(n.e), O.writeBuffer(l, 2), O.writeBuffer(v, 2), O.writeBuffer(b, 2), O.writeBuffer(m, 2), O.writeBuffer(q, 2), O.writeBuffer(E, 2), O.endSequence();
+        var s = n.n.toBuffer(), l = n.d.toBuffer(), v = n.p.toBuffer(), b = n.q.toBuffer(), m = n.dmp1.toBuffer(), B = n.dmq1.toBuffer(), E = n.coeff.toBuffer(), S = s.length + l.length + v.length + b.length + m.length + B.length + E.length + 512, O = new t.Writer({ size: S });
+        O.startSequence(), O.writeInt(0), O.writeBuffer(s, 2), O.writeInt(n.e), O.writeBuffer(l, 2), O.writeBuffer(v, 2), O.writeBuffer(b, 2), O.writeBuffer(m, 2), O.writeBuffer(B, 2), O.writeBuffer(E, 2), O.endSequence();
         var D = new t.Writer({ size: S });
         return D.startSequence(), D.writeInt(0), D.startSequence(), D.writeOID(o), D.writeNull(), D.endSequence(), D.writeBuffer(O.buffer, 4), D.endSequence(), e.type === "der" ? D.buffer : r + `
 ` + d.linebrk(D.buffer.toString("base64"), 64) + `
@@ -20060,23 +20060,23 @@ function requirePkcs8() {
         var m = new t.Reader(b.readString(48, !0));
         if (m.readOID(6, !0) !== o)
           throw Error("Invalid Public key format");
-        var q = new t.Reader(b.readString(4, !0));
-        q.readSequence(), q.readString(2, !0), n.setPrivate(
-          q.readString(2, !0),
+        var B = new t.Reader(b.readString(4, !0));
+        B.readSequence(), B.readString(2, !0), n.setPrivate(
+          B.readString(2, !0),
           // modulus
-          q.readString(2, !0),
+          B.readString(2, !0),
           // publicExponent
-          q.readString(2, !0),
+          B.readString(2, !0),
           // privateExponent
-          q.readString(2, !0),
+          B.readString(2, !0),
           // prime1
-          q.readString(2, !0),
+          B.readString(2, !0),
           // prime2
-          q.readString(2, !0),
+          B.readString(2, !0),
           // exponent1 -- d mod (p1)
-          q.readString(2, !0),
+          B.readString(2, !0),
           // exponent2 -- d mod (q-1)
-          q.readString(2, !0)
+          B.readString(2, !0)
           // coefficient -- (inverse of q) mod p
         );
       },
@@ -20106,11 +20106,11 @@ function requirePkcs8() {
         var m = new t.Reader(b.readString(48, !0));
         if (m.readOID(6, !0) !== o)
           throw Error("Invalid Public key format");
-        var q = new t.Reader(b.readString(3, !0));
-        q.readByte(), q.readSequence(), n.setPublic(
-          q.readString(2, !0),
+        var B = new t.Reader(b.readString(3, !0));
+        B.readByte(), B.readSequence(), n.setPublic(
+          B.readString(2, !0),
           // modulus
-          q.readString(2, !0)
+          B.readString(2, !0)
           // publicExponent
         );
       },
@@ -20193,9 +20193,9 @@ function requireOpenssh() {
         let s = Buffer.alloc(4);
         for (s.writeUInt32BE(a.e, 0); s[0] === 0; ) s = s.slice(1);
         const l = a.d.toBuffer(), v = a.coeff.toBuffer(), b = a.p.toBuffer(), m = a.q.toBuffer();
-        let q;
-        typeof a.sshcomment < "u" ? q = Buffer.from(a.sshcomment) : q = Buffer.from([]);
-        const E = 15 + s.byteLength + 4 + e.byteLength, S = 23 + e.byteLength + 4 + s.byteLength + 4 + l.byteLength + 4 + v.byteLength + 4 + b.byteLength + 4 + m.byteLength + 4 + q.byteLength;
+        let B;
+        typeof a.sshcomment < "u" ? B = Buffer.from(a.sshcomment) : B = Buffer.from([]);
+        const E = 15 + s.byteLength + 4 + e.byteLength, S = 23 + e.byteLength + 4 + s.byteLength + 4 + l.byteLength + 4 + v.byteLength + 4 + b.byteLength + 4 + m.byteLength + 4 + B.byteLength;
         let O = 43 + // 32bit pubkey length
         E + 4 + //32bit private+checksum+comment+padding length
         S;
@@ -20205,7 +20205,7 @@ function requireOpenssh() {
         $.write("openssh-key-v1", "utf8"), $.writeUInt8(0, 14), j.off += 15, f(j, Buffer.from("none")), f(j, Buffer.from("none")), f(j, Buffer.from("")), j.off = j.buf.writeUInt32BE(1, j.off), j.off = j.buf.writeUInt32BE(E, j.off), f(j, Buffer.from("ssh-rsa")), f(j, s), f(j, e), j.off = j.buf.writeUInt32BE(
           O - 47 - E,
           j.off
-        ), j.off += 8, f(j, Buffer.from("ssh-rsa")), f(j, e), f(j, s), f(j, l), f(j, v), f(j, b), f(j, m), f(j, q);
+        ), j.off += 8, f(j, Buffer.from("ssh-rsa")), f(j, e), f(j, s), f(j, l), f(j, v), f(j, b), f(j, m), f(j, B);
         let J = 1;
         for (; j.off < O; )
           j.off = j.buf.writeUInt8(J++, j.off);
@@ -20232,13 +20232,13 @@ function requireOpenssh() {
           throw "Invalid file format.";
         if (v.off += 15, h(v).toString("ascii") !== "none" || h(v).toString("ascii") !== "none" || h(v).toString("ascii") !== "" || (v.off += 4, v.off += 4, h(v).toString("ascii") !== "ssh-rsa") || (h(v), h(v), v.off += 12, h(v).toString("ascii") !== "ssh-rsa"))
           throw Error("Unsupported key type");
-        const b = h(v), m = h(v), q = h(v), E = h(v), S = h(v), O = h(v), D = new o(q), $ = new o(O), j = new o(S), J = D.mod(j.subtract(o.ONE)), ie = D.mod($.subtract(o.ONE));
+        const b = h(v), m = h(v), B = h(v), E = h(v), S = h(v), O = h(v), D = new o(B), $ = new o(O), j = new o(S), J = D.mod(j.subtract(o.ONE)), ie = D.mod($.subtract(o.ONE));
         a.setPrivate(
           b,
           // modulus
           m,
           // publicExponent
-          q,
+          B,
           // privateExponent
           S,
           // prime1
@@ -20270,9 +20270,9 @@ function requireOpenssh() {
           if (Buffer.isBuffer(n) && (n = n.toString("utf8")), t.isString(n)) {
             if (n.substring(0, 8) !== "ssh-rsa ")
               throw Error("Unsupported key format");
-            let q = n.indexOf(" ", 8);
-            q === -1 ? q = n.length : a.sshcomment = n.substring(q + 1).replace(/\s+|\n\r|\n|\r$/gm, "");
-            const E = n.substring(8, q).replace(/\s+|\n\r|\n|\r$/gm, "");
+            let B = n.indexOf(" ", 8);
+            B === -1 ? B = n.length : a.sshcomment = n.substring(B + 1).replace(/\s+|\n\r|\n|\r$/gm, "");
+            const E = n.substring(8, B).replace(/\s+|\n\r|\n|\r$/gm, "");
             s = Buffer.from(E, "base64");
           } else
             throw Error("Unsupported key format");
@@ -20475,8 +20475,8 @@ function requireNodeRSA() {
       try {
         var m = this.keyPair.encrypt(this.$getDataForEncrypt(l, b), s);
         return v == "buffer" || !v ? m : m.toString(v);
-      } catch (q) {
-        throw Error("Error during encryption. Original error: " + q);
+      } catch (B) {
+        throw Error("Error during encryption. Original error: " + B);
       }
     }, e.prototype.$$decryptKey = function(s, l, v) {
       try {
@@ -20796,8 +20796,8 @@ class AnimationsParser extends EventDispatcher {
         },
         { delay: h, duration: f, mode: a, repeat: n, yoyo: e },
         (s, l) => {
-          const { x: v, y: b, z: m, rotationX: q, rotationY: E, rotationZ: S, scaleX: O, scaleY: D, scaleZ: $ } = s;
-          this.target.position.set(v, b, m), this.target.rotation.set(q, E, S), this.target.scale.set(O, D, $), this.dispatchEvent({ type: "update", source: s, tween: l });
+          const { x: v, y: b, z: m, rotationX: B, rotationY: E, rotationZ: S, scaleX: O, scaleY: D, scaleZ: $ } = s;
+          this.target.position.set(v, b, m), this.target.rotation.set(B, E, S), this.target.scale.set(O, D, $), this.dispatchEvent({ type: "update", source: s, tween: l });
         },
         (s) => {
           this.tweenSet.add(s), this.dispatchEvent({ type: "start", tween: s });
@@ -20898,7 +20898,13 @@ class VisionsParser {
     ]);
   }
 }
-const PLANISH_SCALE_Y = 0.01, _box = new Box3(), _pivot = new Vector3(), _raycastHits = [], _dummyPosition = new Vector3(), _dummyQuaternion = new Quaternion(), _dummyScale = new Vector3(), _boundsMatrix = new Matrix4(), _boundsSphere = new Sphere();
+const PLANISH_SCALE_Y = 0.01, SEMANTIC_RENDER_OFFSETS = {
+  Walls: 0,
+  Columns: 6e-3,
+  Spaces: 0,
+  Doors: 0.01,
+  Windows: 0.01
+}, _box = new Box3(), _pivot = new Vector3(), _raycastHits = [], _dummyPosition = new Vector3(), _dummyQuaternion = new Quaternion(), _dummyScale = new Vector3(), _boundsMatrix = new Matrix4(), _boundsSphere = new Sphere();
 function getStateTextureSize(c, t = 1) {
   return Math.max(1, Math.ceil(Math.sqrt(Math.max(1, c * t))));
 }
@@ -20914,23 +20920,23 @@ function copyAttributeComponents(c, t, u, o) {
   for (let d = 0; d < u; d++)
     o.push(c?.getComponent(t, d) ?? 0);
 }
-function createSemanticMaterial(c, t, u) {
-  const o = attribute("semanticIndex", "float").toInt(), d = (e) => int(textureSize(textureLoad(e), int(0)).x).toConst(), r = (e) => {
-    const s = d(e), l = o.mod(s).toConst(), v = o.div(s).toConst();
-    return textureLoad(e, ivec2(l, v));
-  }, h = () => {
-    const e = d(u), s = o.mul(4).toConst(), l = s.mod(e).toConst(), v = s.div(e).toConst();
+function createSemanticMaterial(c, t, u, o) {
+  const d = attribute("semanticIndex", "float").toInt(), r = (m) => int(textureSize(textureLoad(m), int(0)).x).toConst(), h = (m) => {
+    const B = r(m), E = d.mod(B).toConst(), S = d.div(B).toConst();
+    return textureLoad(m, ivec2(E, S));
+  }, f = () => {
+    const m = r(u), B = d.mul(4).toConst(), E = B.mod(m).toConst(), S = B.div(m).toConst();
     return mat4(
-      textureLoad(u, ivec2(l, v)),
-      textureLoad(u, ivec2(l.add(1), v)),
-      textureLoad(u, ivec2(l.add(2), v)),
-      textureLoad(u, ivec2(l.add(3), v))
+      textureLoad(u, ivec2(E, S)),
+      textureLoad(u, ivec2(E.add(1), S)),
+      textureLoad(u, ivec2(E.add(2), S)),
+      textureLoad(u, ivec2(E.add(3), S))
     );
-  }, f = r(c), a = r(t).x, n = new MeshStandardNodeMaterial({
+  }, a = h(c), n = h(t).x, e = h(o).x, s = f(), l = s.mul(vec4(positionLocal, 1)).xyz, v = transformNormal(normalLocal, s).normalize(), b = new MeshStandardNodeMaterial({
     transparent: !0,
-    depthWrite: !1
+    depthWrite: !0
   });
-  return n.colorNode = vec4(f.rgb, 1), n.opacityNode = f.a.mul(a), n.maskNode = a.greaterThan(0.5).and(f.a.greaterThan(1e-3)), n.positionNode = h().mul(vec4(positionLocal, 1)).xyz, n;
+  return b.colorNode = vec4(a.rgb, 1), b.opacityNode = a.a.mul(n), b.maskNode = n.greaterThan(0.5).and(a.a.greaterThan(1e-3)), b.positionNode = l.add(v.mul(e)), b;
 }
 function copySemanticColor(c, t) {
   if (c instanceof Color) {
@@ -20945,10 +20951,10 @@ function buildMergedSemanticGeometry(c) {
     const e = a.geometry, s = e.getAttribute("position"), l = e.getAttribute("normal"), v = e.getAttribute("uv"), b = e.getIndex();
     if (!s) return;
     e.computeBoundingBox(), _box.copy(e.boundingBox ?? _box.makeEmpty()), _box.getCenter(_pivot), _pivot.y = _box.min.y;
-    const m = t.length / 3, q = [], E = [], S = [], O = [];
+    const m = t.length / 3, B = [], E = [], S = [], O = [];
     for (let j = 0; j < s.count; j++) {
       const J = s.getX(j) - _pivot.x, ie = s.getY(j) - _pivot.y, ne = s.getZ(j) - _pivot.z;
-      t.push(J, ie, ne), q.push(J, ie, ne), d.push(n), copyAttributeComponents(l, j, 3, u), copyAttributeComponents(l, j, 3, E), copyAttributeComponents(v, j, 2, o), copyAttributeComponents(v, j, 2, S);
+      t.push(J, ie, ne), B.push(J, ie, ne), d.push(n), copyAttributeComponents(l, j, 3, u), copyAttributeComponents(l, j, 3, E), copyAttributeComponents(v, j, 2, o), copyAttributeComponents(v, j, 2, S);
     }
     if (b)
       for (let j = 0; j < b.count; j++) {
@@ -20959,7 +20965,7 @@ function buildMergedSemanticGeometry(c) {
       for (let j = 0; j < s.count; j++)
         r.push(m + j), O.push(j);
     const D = new BufferGeometry();
-    D.setAttribute("position", new Float32BufferAttribute(q, 3)), l && D.setAttribute("normal", new Float32BufferAttribute(E, 3)), v && D.setAttribute("uv", new Float32BufferAttribute(S, 2)), D.setIndex(O), D.computeBoundingBox(), D.computeBoundingSphere();
+    D.setAttribute("position", new Float32BufferAttribute(B, 3)), l && D.setAttribute("normal", new Float32BufferAttribute(E, 3)), v && D.setAttribute("uv", new Float32BufferAttribute(S, 2)), D.setIndex(O), D.computeBoundingBox(), D.computeBoundingSphere();
     const $ = new Matrix4().makeTranslation(_pivot.x, _pivot.y, _pivot.z);
     h.push({
       id: a.id,
@@ -20993,24 +20999,25 @@ class FloorMesh extends BaseMesh {
   #i;
   #a;
   #o;
+  #s;
   #n;
   constructor(t) {
-    const { geometry: u, states: o } = buildMergedSemanticGeometry(t), d = getStateTextureSize(o.length), r = getMatrixTextureSize(o.length), h = createStateTexture(d), f = createStateTexture(d), a = createStateTexture(r), n = createSemanticMaterial(h, f, a);
-    super(u, n), this.#r = o, this.#t = {
+    const { geometry: u, states: o } = buildMergedSemanticGeometry(t), d = getStateTextureSize(o.length), r = getMatrixTextureSize(o.length), h = createStateTexture(d), f = createStateTexture(d), a = createStateTexture(r), n = createStateTexture(d), e = createSemanticMaterial(h, f, a, n);
+    super(u, e), this.#r = o, this.#t = {
       Walls: this.wallsInstances,
       Columns: this.columnsInstances,
       Spaces: this.spacesInstances,
       Doors: this.doorsInstances,
       Windows: this.windowsInstances
-    }, this.#i = h, this.#a = f, this.#o = a, this.#n = new Mesh(), this.#n.matrixAutoUpdate = !1, this.frustumCulled = !1, this.#r.forEach((e) => {
-      this.semanticInstances.set(e.id, e.index), this.#t[e.kind].set(e.id, e.index), this.#s(e.index), this.#l(e.index), this.#f(e.index);
-    }), this.userData.semanticEntries = this.#r.map(({ id: e, kind: s, name: l, index: v }) => ({ id: e, kind: s, name: l, index: v }));
+    }, this.#i = h, this.#a = f, this.#o = a, this.#s = n, this.#n = new Mesh(), this.#n.matrixAutoUpdate = !1, this.frustumCulled = !1, this.#r.forEach((s) => {
+      this.semanticInstances.set(s.id, s.index), this.#t[s.kind].set(s.id, s.index), this.#f(s.index), this.#d(s.index), this.#u(s.index), this.#p(s.index);
+    }), this.userData.semanticEntries = this.#r.map(({ id: s, kind: l, name: v, index: b }) => ({ id: s, kind: l, name: v, index: b }));
   }
   planish(t) {
-    return this.#c(t, (u) => this.setScaleYAt(u, PLANISH_SCALE_Y)), this;
+    return this.#h(t, (u) => this.setScaleYAt(u, PLANISH_SCALE_Y)), this;
   }
   unplanish(t) {
-    return this.#c(t, (u) => this.setScaleYAt(u, 1)), this;
+    return this.#h(t, (u) => this.setScaleYAt(u, 1)), this;
   }
   get semanticCount() {
     return this.#r.length;
@@ -21032,7 +21039,7 @@ class FloorMesh extends BaseMesh {
   }
   setColorAt(t, u) {
     const o = this.#e(t);
-    return copySemanticColor(u, o.color), this.#s(t), this;
+    return copySemanticColor(u, o.color), this.#f(t), this;
   }
   getColorAt(t, u = new Vector4()) {
     const o = this.#e(t).color;
@@ -21040,29 +21047,29 @@ class FloorMesh extends BaseMesh {
   }
   setOpacityAt(t, u) {
     const o = this.#e(t);
-    return o.color.w = Math.max(0, Math.min(1, u)), this.#s(t), this;
+    return o.color.w = Math.max(0, Math.min(1, u)), this.#f(t), this;
   }
   getOpacityAt(t) {
     return this.#e(t).color.w;
   }
   setVisibleAt(t, u) {
     const o = this.#e(t);
-    return o.visible = u, this.#l(t), this;
+    return o.visible = u, this.#d(t), this;
   }
   getVisibleAt(t) {
     return this.#e(t).visible;
   }
   setMatrixAt(t, u) {
     const o = this.#e(t);
-    return o.matrix.copy(u), o.finalMatrix.multiplyMatrices(o.baseMatrix, o.matrix), this.#u(), this.#f(t), this;
+    return o.matrix.copy(u), o.finalMatrix.multiplyMatrices(o.baseMatrix, o.matrix), this.#c(), this.#u(t), this;
   }
   setScaleAt(t, u, o, d) {
-    return this.#h(t, (r) => {
+    return this.#l(t, (r) => {
       u instanceof Vector3 ? r.copy(u) : r.set(u, o ?? u, d ?? u);
     });
   }
   setScaleYAt(t, u) {
-    return this.#h(t, (o) => {
+    return this.#l(t, (o) => {
       o.y = u;
     });
   }
@@ -21104,7 +21111,7 @@ class FloorMesh extends BaseMesh {
       }
   }
   dispose() {
-    this.geometry.dispose(), Array.isArray(this.material) ? this.material.forEach((t) => t.dispose()) : this.material.dispose(), this.#i.dispose(), this.#a.dispose(), this.#o.dispose(), this.#r.forEach((t) => t.geometry.dispose());
+    this.geometry.dispose(), Array.isArray(this.material) ? this.material.forEach((t) => t.dispose()) : this.material.dispose(), this.#i.dispose(), this.#a.dispose(), this.#o.dispose(), this.#s.dispose(), this.#r.forEach((t) => t.geometry.dispose());
   }
   #e(t) {
     const u = this.#r[t];
@@ -21112,10 +21119,10 @@ class FloorMesh extends BaseMesh {
       throw new Error(`u-space FloorMesh: invalid semantic index ${t}.`);
     return u;
   }
-  #u() {
+  #c() {
     this.boundingBox = null, this.boundingSphere = null;
   }
-  #c(t, u) {
+  #h(t, u) {
     if (t === void 0) {
       this.#r.forEach((o) => u(o.index));
       return;
@@ -21123,20 +21130,24 @@ class FloorMesh extends BaseMesh {
     for (const o of this.#t[t].values())
       u(o);
   }
-  #h(t, u) {
+  #l(t, u) {
     const o = this.#e(t);
-    return o.matrix.decompose(_dummyPosition, _dummyQuaternion, _dummyScale), u(_dummyScale), o.matrix.compose(_dummyPosition, _dummyQuaternion, _dummyScale), o.finalMatrix.multiplyMatrices(o.baseMatrix, o.matrix), this.#u(), this.#f(t), this;
+    return o.matrix.decompose(_dummyPosition, _dummyQuaternion, _dummyScale), u(_dummyScale), o.matrix.compose(_dummyPosition, _dummyQuaternion, _dummyScale), o.finalMatrix.multiplyMatrices(o.baseMatrix, o.matrix), this.#c(), this.#u(t), this;
   }
-  #s(t) {
+  #f(t) {
     this.#e(t).color.toArray(this.#i.image.data, t * 4), this.#i.needsUpdate = !0;
   }
-  #l(t) {
+  #d(t) {
     const u = this.#e(t), o = this.#a.image.data;
     o[t * 4] = u.visible ? 1 : 0, o[t * 4 + 1] = 0, o[t * 4 + 2] = 0, o[t * 4 + 3] = 1, this.#a.needsUpdate = !0;
   }
-  #f(t) {
+  #u(t) {
     this.#e(t).finalMatrix.toArray(this.#o.image.data, t * 16), this.#o.needsUpdate = !0;
   }
+  #p(t) {
+    const u = this.#e(t), o = this.#s.image.data;
+    o[t * 4] = SEMANTIC_RENDER_OFFSETS[u.kind], o[t * 4 + 1] = 0, o[t * 4 + 2] = 0, o[t * 4 + 3] = 1, this.#s.needsUpdate = !0;
+  }
 }
 class BuildingGroup extends BaseGroup {
   isBuildingGroup = !0;
@@ -21874,7 +21885,7 @@ class TranslateNode extends Node {
                   m,
                   new Vector3().set(m.x + a, m.y, m.z),
                   { duration: 800 },
-                  (q) => s(b.position, q)
+                  (B) => s(b.position, B)
                 );
                 break;
               case "y":
@@ -21883,7 +21894,7 @@ class TranslateNode extends Node {
                   m,
                   new Vector3().set(m.x, m.y + a, m.z),
                   { duration: 800 },
-                  (q) => s(b.position, q)
+                  (B) => s(b.position, B)
                 );
                 break;
               case "z":
@@ -21892,7 +21903,7 @@ class TranslateNode extends Node {
                   m,
                   new Vector3().set(m.x, m.y, m.z + a),
                   { duration: 800 },
-                  (q) => s(b.position, q)
+                  (B) => s(b.position, B)
                 );
                 break;
             }
@@ -21939,13 +21950,13 @@ class ScaleNode extends Node {
             const m = b.scale.clone();
             switch (f) {
               case "x":
-                await tweenAnimation(this.viewer, m, new Vector3().set(m.x * a, m.y, m.z), { duration: 800 }, (q) => s(b.scale, q));
+                await tweenAnimation(this.viewer, m, new Vector3().set(m.x * a, m.y, m.z), { duration: 800 }, (B) => s(b.scale, B));
                 break;
               case "y":
-                await tweenAnimation(this.viewer, m, new Vector3().set(m.x, m.y * a, m.z), { duration: 800 }, (q) => s(b.scale, q));
+                await tweenAnimation(this.viewer, m, new Vector3().set(m.x, m.y * a, m.z), { duration: 800 }, (B) => s(b.scale, B));
                 break;
               case "z":
-                await tweenAnimation(this.viewer, m, new Vector3().set(m.x, m.y, m.z * a), { duration: 800 }, (q) => s(b.scale, q));
+                await tweenAnimation(this.viewer, m, new Vector3().set(m.x, m.y, m.z * a), { duration: 800 }, (B) => s(b.scale, B));
                 break;
             }
           });
@@ -21988,13 +21999,13 @@ class RotateNode extends Node {
         };
         await (async () => {
           const v = a / 180 * Math.PI, b = objectHandle(h, async (m) => {
-            const q = m.rotation.clone();
+            const B = m.rotation.clone();
             switch (f) {
               case "x":
                 await tweenAnimation(
                   this.viewer,
-                  q,
-                  new Euler().set(q.x + v, q.y, q.z),
+                  B,
+                  new Euler().set(B.x + v, B.y, B.z),
                   { duration: 800 },
                   (E) => s(m.rotation, E)
                 );
@@ -22002,8 +22013,8 @@ class RotateNode extends Node {
               case "y":
                 await tweenAnimation(
                   this.viewer,
-                  q,
-                  new Euler().set(q.x, q.y + v, q.z),
+                  B,
+                  new Euler().set(B.x, B.y + v, B.z),
                   { duration: 800 },
                   (E) => s(m.rotation, E)
                 );
@@ -22011,8 +22022,8 @@ class RotateNode extends Node {
               case "z":
                 await tweenAnimation(
                   this.viewer,
-                  q,
-                  new Euler().set(q.x, q.y, q.z + v),
+                  B,
+                  new Euler().set(B.x, B.y, B.z + v),
                   { duration: 800 },
                   (E) => s(m.rotation, E)
                 );