zigap-utils 0.0.26 → 0.0.28

package/dist/index.es.js

@@ -47,14 +47,14 @@ function la() {
   ti = 1;
   var f = cn, e = Symbol.for("react.element"), t = Symbol.for("react.fragment"), r = Object.prototype.hasOwnProperty, a = f.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner, i = { key: !0, ref: !0, __self: !0, __source: !0 };
   function y(x, u, o) {
-    var c, v = {}, b = null, C = null;
-    o !== void 0 && (b = "" + o), u.key !== void 0 && (b = "" + u.key), u.ref !== void 0 && (C = u.ref);
+    var c, v = {}, b = null, B = null;
+    o !== void 0 && (b = "" + o), u.key !== void 0 && (b = "" + u.key), u.ref !== void 0 && (B = u.ref);
     for (c in u)
       r.call(u, c) && !i.hasOwnProperty(c) && (v[c] = u[c]);
     if (x && x.defaultProps)
       for (c in u = x.defaultProps, u)
         v[c] === void 0 && (v[c] = u[c]);
-    return { $$typeof: e, type: x, key: b, ref: C, props: v, _owner: a.current };
+    return { $$typeof: e, type: x, key: b, ref: B, props: v, _owner: a.current };
   }
   return Xt.Fragment = t, Xt.jsx = y, Xt.jsxs = y, Xt;
 }
@@ -71,7 +71,7 @@ var Zt = {};
 var ri;
 function xa() {
   return ri || (ri = 1, process.env.NODE_ENV !== "production" && function() {
-    var f = cn, e = Symbol.for("react.element"), t = Symbol.for("react.portal"), r = Symbol.for("react.fragment"), a = Symbol.for("react.strict_mode"), i = Symbol.for("react.profiler"), y = Symbol.for("react.provider"), x = Symbol.for("react.context"), u = Symbol.for("react.forward_ref"), o = Symbol.for("react.suspense"), c = Symbol.for("react.suspense_list"), v = Symbol.for("react.memo"), b = Symbol.for("react.lazy"), C = Symbol.for("react.offscreen"), w = Symbol.iterator, R = "@@iterator";
+    var f = cn, e = Symbol.for("react.element"), t = Symbol.for("react.portal"), r = Symbol.for("react.fragment"), a = Symbol.for("react.strict_mode"), i = Symbol.for("react.profiler"), y = Symbol.for("react.provider"), x = Symbol.for("react.context"), u = Symbol.for("react.forward_ref"), o = Symbol.for("react.suspense"), c = Symbol.for("react.suspense_list"), v = Symbol.for("react.memo"), b = Symbol.for("react.lazy"), B = Symbol.for("react.offscreen"), w = Symbol.iterator, R = "@@iterator";
     function k(p) {
       if (p === null || typeof p != "object")
         return null;
@@ -99,7 +99,7 @@ function xa() {
     var T = !1, H = !1, $ = !1, K = !1, X = !1, Q;
     Q = Symbol.for("react.module.reference");
     function U(p) {
-      return !!(typeof p == "string" || typeof p == "function" || p === r || p === i || X || p === a || p === o || p === c || K || p === C || T || H || $ || typeof p == "object" && p !== null && (p.$$typeof === b || p.$$typeof === v || p.$$typeof === y || p.$$typeof === x || p.$$typeof === u || // This needs to include all possible module reference object
+      return !!(typeof p == "string" || typeof p == "function" || p === r || p === i || X || p === a || p === o || p === c || K || p === B || T || H || $ || typeof p == "object" && p !== null && (p.$$typeof === b || p.$$typeof === v || p.$$typeof === y || p.$$typeof === x || p.$$typeof === u || // This needs to include all possible module reference object
       // types supported by any Flight configuration anywhere since
       // we don't know which Flight build this will end up being used
       // with.
@@ -160,13 +160,13 @@ function xa() {
         }
       return null;
     }
-    var g = Object.assign, B = 0, F, z, N, D, h, E, j;
+    var g = Object.assign, C = 0, F, z, N, D, h, E, j;
     function Y() {
     }
     Y.__reactDisabledLog = !0;
     function W() {
       {
-        if (B === 0) {
+        if (C === 0) {
           F = console.log, z = console.info, N = console.warn, D = console.error, h = console.group, E = console.groupCollapsed, j = console.groupEnd;
           var p = {
             configurable: !0,
@@ -184,12 +184,12 @@ function xa() {
             groupEnd: p
           });
         }
-        B++;
+        C++;
       }
     }
     function re() {
       {
-        if (B--, B === 0) {
+        if (C--, C === 0) {
           var p = {
             configurable: !0,
             enumerable: !0,
@@ -219,7 +219,7 @@ function xa() {
             })
           });
         }
-        B < 0 && S("disabledDepth fell below zero. This is a bug in React. Please file an issue.");
+        C < 0 && S("disabledDepth fell below zero. This is a bug in React. Please file an issue.");
       }
     }
     var ce = q.ReactCurrentDispatcher, we;
@@ -699,8 +699,8 @@ var St;
       for (let w = 0; w < this.size; w++)
         this.modules.push(b.slice()), this.isFunction.push(b.slice());
       this.drawFunctionPatterns();
-      const C = this.addEccAndInterleave(c);
-      if (this.drawCodewords(C), v == -1) {
+      const B = this.addEccAndInterleave(c);
+      if (this.drawCodewords(B), v == -1) {
         let w = 1e9;
         for (let R = 0; R < 8; R++) {
           this.applyMask(R), this.drawFormatBits(R);
@@ -718,7 +718,7 @@ var St;
       const c = f.QrSegment.makeBytes(u);
       return e.encodeSegments([c], o);
     }
-    static encodeSegments(u, o, c = 1, v = 40, b = -1, C = !0) {
+    static encodeSegments(u, o, c = 1, v = 40, b = -1, B = !0) {
       if (!(e.MIN_VERSION <= c && c <= v && v <= e.MAX_VERSION) || b < -1 || b > 7)
         throw new RangeError("Invalid value");
       let w, R;
@@ -732,7 +732,7 @@ var St;
           throw new RangeError("Data too long");
       }
       for (const P of [e.Ecc.MEDIUM, e.Ecc.QUARTILE, e.Ecc.HIGH])
-        C && R <= e.getNumDataCodewords(w, P) * 8 && (o = P);
+        B && R <= e.getNumDataCodewords(w, P) * 8 && (o = P);
       let k = [];
       for (const P of u) {
         r(P.mode.modeBits, 4, k), r(P.numChars, P.mode.numCharCountBits(w), k);
@@ -792,15 +792,15 @@ var St;
       const o = this.version << 12 | u;
       i(o >>> 18 == 0);
       for (let c = 0; c < 18; c++) {
-        const v = a(o, c), b = this.size - 11 + c % 3, C = Math.floor(c / 3);
-        this.setFunctionModule(b, C, v), this.setFunctionModule(C, b, v);
+        const v = a(o, c), b = this.size - 11 + c % 3, B = Math.floor(c / 3);
+        this.setFunctionModule(b, B, v), this.setFunctionModule(B, b, v);
       }
     }
     drawFinderPattern(u, o) {
       for (let c = -4; c <= 4; c++)
         for (let v = -4; v <= 4; v++) {
-          const b = Math.max(Math.abs(v), Math.abs(c)), C = u + v, w = o + c;
-          0 <= C && C < this.size && 0 <= w && w < this.size && this.setFunctionModule(C, w, b != 2 && b != 4);
+          const b = Math.max(Math.abs(v), Math.abs(c)), B = u + v, w = o + c;
+          0 <= B && B < this.size && 0 <= w && w < this.size && this.setFunctionModule(B, w, b != 2 && b != 4);
         }
     }
     drawAlignmentPattern(u, o) {
@@ -815,7 +815,7 @@ var St;
       const o = this.version, c = this.errorCorrectionLevel;
       if (u.length != e.getNumDataCodewords(o, c))
         throw new RangeError("Invalid argument");
-      const v = e.NUM_ERROR_CORRECTION_BLOCKS[c.ordinal][o], b = e.ECC_CODEWORDS_PER_BLOCK[c.ordinal][o], C = Math.floor(e.getNumRawDataModules(o) / 8), w = v - C % v, R = Math.floor(C / v);
+      const v = e.NUM_ERROR_CORRECTION_BLOCKS[c.ordinal][o], b = e.ECC_CODEWORDS_PER_BLOCK[c.ordinal][o], B = Math.floor(e.getNumRawDataModules(o) / 8), w = v - B % v, R = Math.floor(B / v);
       let k = [];
       const q = e.reedSolomonComputeDivisor(b);
       for (let P = 0, T = 0; P < v; P++) {
@@ -829,7 +829,7 @@ var St;
         k.forEach((T, H) => {
           (P != R - b || H >= w) && S.push(T[P]);
         });
-      return i(S.length == C), S;
+      return i(S.length == B), S;
     }
     drawCodewords(u) {
       if (u.length != Math.floor(e.getNumRawDataModules(this.version) / 8))
@@ -839,8 +839,8 @@ var St;
         c == 6 && (c = 5);
         for (let v = 0; v < this.size; v++)
           for (let b = 0; b < 2; b++) {
-            const C = c - b, R = (c + 1 & 2) == 0 ? this.size - 1 - v : v;
-            !this.isFunction[R][C] && o < u.length * 8 && (this.modules[R][C] = a(u[o >>> 3], 7 - (o & 7)), o++);
+            const B = c - b, R = (c + 1 & 2) == 0 ? this.size - 1 - v : v;
+            !this.isFunction[R][B] && o < u.length * 8 && (this.modules[R][B] = a(u[o >>> 3], 7 - (o & 7)), o++);
           }
       }
       i(o == u.length * 8);
@@ -885,25 +885,25 @@ var St;
     getPenaltyScore() {
       let u = 0;
       for (let b = 0; b < this.size; b++) {
-        let C = !1, w = 0, R = [0, 0, 0, 0, 0, 0, 0];
+        let B = !1, w = 0, R = [0, 0, 0, 0, 0, 0, 0];
         for (let k = 0; k < this.size; k++)
-          this.modules[b][k] == C ? (w++, w == 5 ? u += e.PENALTY_N1 : w > 5 && u++) : (this.finderPenaltyAddHistory(w, R), C || (u += this.finderPenaltyCountPatterns(R) * e.PENALTY_N3), C = this.modules[b][k], w = 1);
-        u += this.finderPenaltyTerminateAndCount(C, w, R) * e.PENALTY_N3;
+          this.modules[b][k] == B ? (w++, w == 5 ? u += e.PENALTY_N1 : w > 5 && u++) : (this.finderPenaltyAddHistory(w, R), B || (u += this.finderPenaltyCountPatterns(R) * e.PENALTY_N3), B = this.modules[b][k], w = 1);
+        u += this.finderPenaltyTerminateAndCount(B, w, R) * e.PENALTY_N3;
       }
       for (let b = 0; b < this.size; b++) {
-        let C = !1, w = 0, R = [0, 0, 0, 0, 0, 0, 0];
+        let B = !1, w = 0, R = [0, 0, 0, 0, 0, 0, 0];
         for (let k = 0; k < this.size; k++)
-          this.modules[k][b] == C ? (w++, w == 5 ? u += e.PENALTY_N1 : w > 5 && u++) : (this.finderPenaltyAddHistory(w, R), C || (u += this.finderPenaltyCountPatterns(R) * e.PENALTY_N3), C = this.modules[k][b], w = 1);
-        u += this.finderPenaltyTerminateAndCount(C, w, R) * e.PENALTY_N3;
+          this.modules[k][b] == B ? (w++, w == 5 ? u += e.PENALTY_N1 : w > 5 && u++) : (this.finderPenaltyAddHistory(w, R), B || (u += this.finderPenaltyCountPatterns(R) * e.PENALTY_N3), B = this.modules[k][b], w = 1);
+        u += this.finderPenaltyTerminateAndCount(B, w, R) * e.PENALTY_N3;
       }
       for (let b = 0; b < this.size - 1; b++)
-        for (let C = 0; C < this.size - 1; C++) {
-          const w = this.modules[b][C];
-          w == this.modules[b][C + 1] && w == this.modules[b + 1][C] && w == this.modules[b + 1][C + 1] && (u += e.PENALTY_N2);
+        for (let B = 0; B < this.size - 1; B++) {
+          const w = this.modules[b][B];
+          w == this.modules[b][B + 1] && w == this.modules[b + 1][B] && w == this.modules[b + 1][B + 1] && (u += e.PENALTY_N2);
         }
       let o = 0;
       for (const b of this.modules)
-        o = b.reduce((C, w) => C + (w ? 1 : 0), o);
+        o = b.reduce((B, w) => B + (w ? 1 : 0), o);
       const c = this.size * this.size, v = Math.ceil(Math.abs(o * 20 - c * 10) / c) - 1;
       return i(0 <= v && v <= 9), u += v * e.PENALTY_N4, i(0 <= u && u <= 2568888), u;
     }
@@ -950,7 +950,7 @@ var St;
       let c = o.map((v) => 0);
       for (const v of u) {
         const b = v ^ c.shift();
-        c.push(0), o.forEach((C, w) => c[w] ^= e.reedSolomonMultiply(C, b));
+        c.push(0), o.forEach((B, w) => c[w] ^= e.reedSolomonMultiply(B, b));
       }
       return c;
     }
@@ -1144,8 +1144,8 @@ function Ca(f, e, t, r) {
   const a = t ? un : 0, i = f.length + a * 2, y = Math.floor(e * Ea), x = i / e, u = (r.width || y) * x, o = (r.height || y) * x, c = r.x == null ? f.length / 2 - u / 2 : r.x * x, v = r.y == null ? f.length / 2 - o / 2 : r.y * x;
   let b = null;
   if (r.excavate) {
-    let C = Math.floor(c), w = Math.floor(v), R = Math.ceil(u + c - C), k = Math.ceil(o + v - w);
-    b = { x: C, y: w, w: R, h: k };
+    let B = Math.floor(c), w = Math.floor(v), R = Math.ceil(u + c - B), k = Math.ceil(o + v - w);
+    b = { x: B, y: w, w: R, h: k };
   }
   return { x: c, y: v, h: o, w: u, excavation: b };
 }
@@ -1176,21 +1176,21 @@ function ln(f) {
     "includeMargin",
     "style",
     "imageSettings"
-  ]), v = o == null ? void 0 : o.src, b = ei(null), C = ei(null), [w, R] = qf(!1);
+  ]), v = o == null ? void 0 : o.src, b = ei(null), B = ei(null), [w, R] = qf(!1);
   zt(() => {
     if (b.current != null) {
       const S = b.current, P = S.getContext("2d");
       if (!P)
         return;
       let T = tr.QrCode.encodeText(t, pa[a]).getModules();
-      const H = x ? un : 0, $ = T.length + H * 2, K = Ca(T, r, x, o), X = C.current, Q = K != null && X !== null && X.complete && X.naturalHeight !== 0 && X.naturalWidth !== 0;
+      const H = x ? un : 0, $ = T.length + H * 2, K = Ca(T, r, x, o), X = B.current, Q = K != null && X !== null && X.complete && X.naturalHeight !== 0 && X.naturalWidth !== 0;
       Q && K.excavation != null && (T = Ba(T, K.excavation));
       const U = window.devicePixelRatio || 1;
       S.height = S.width = r * U;
       const A = r / $ * U;
       P.scale(A, A), P.fillStyle = i, P.fillRect(0, 0, $, $), P.fillStyle = y, Ma ? P.fill(new Path2D(wa(T, H))) : T.forEach(function(n, d) {
-        n.forEach(function(g, B) {
-          g && P.fillRect(B + H, d + H, 1, 1);
+        n.forEach(function(g, C) {
+          g && P.fillRect(C + H, d + H, 1, 1);
         });
       }), Q && P.drawImage(X, K.x + H, K.y + H, K.w, K.h);
     }
@@ -1206,7 +1206,7 @@ function ln(f) {
     onLoad: () => {
       R(!0);
     },
-    ref: C
+    ref: B
   })), /* @__PURE__ */ nr.createElement(nr.Fragment, null, /* @__PURE__ */ nr.createElement("canvas", ii({
     style: k,
     height: r,
@@ -1372,7 +1372,7 @@ function $e() {
            *     var string = wordArray.toString(CryptoJS.enc.Utf8);
            */
           toString: function(S) {
-            return (S || C).stringify(this);
+            return (S || B).stringify(this);
           },
           /**
            * Concatenates a word array to this word array.
@@ -1439,7 +1439,7 @@ function $e() {
               P.push(y());
             return new v.init(P, S);
           }
-        }), b = u.enc = {}, C = b.Hex = {
+        }), b = u.enc = {}, B = b.Hex = {
           /**
            * Converts a word array to a hex string.
            *
@@ -1930,8 +1930,8 @@ function _r() {
            */
           toX32: function() {
             for (var o = this.words, c = o.length, v = [], b = 0; b < c; b++) {
-              var C = o[b];
-              v.push(C.high), v.push(C.low);
+              var B = o[b];
+              v.push(B.high), v.push(B.low);
             }
             return x.create(v, this.sigBytes);
           },
@@ -2000,8 +2000,8 @@ function Ra() {
            */
           stringify: function(u) {
             for (var o = u.words, c = u.sigBytes, v = [], b = 0; b < c; b += 2) {
-              var C = o[b >>> 2] >>> 16 - b % 4 * 8 & 65535;
-              v.push(String.fromCharCode(C));
+              var B = o[b >>> 2] >>> 16 - b % 4 * 8 & 65535;
+              v.push(String.fromCharCode(B));
             }
             return v.join("");
           },
@@ -2039,8 +2039,8 @@ function Ra() {
            */
           stringify: function(u) {
             for (var o = u.words, c = u.sigBytes, v = [], b = 0; b < c; b += 2) {
-              var C = x(o[b >>> 2] >>> 16 - b % 4 * 8 & 65535);
-              v.push(String.fromCharCode(C));
+              var B = x(o[b >>> 2] >>> 16 - b % 4 * 8 & 65535);
+              v.push(String.fromCharCode(B));
             }
             return v.join("");
           },
@@ -2095,8 +2095,8 @@ function Rt() {
           stringify: function(u) {
             var o = u.words, c = u.sigBytes, v = this._map;
             u.clamp();
-            for (var b = [], C = 0; C < c; C += 3)
-              for (var w = o[C >>> 2] >>> 24 - C % 4 * 8 & 255, R = o[C + 1 >>> 2] >>> 24 - (C + 1) % 4 * 8 & 255, k = o[C + 2 >>> 2] >>> 24 - (C + 2) % 4 * 8 & 255, q = w << 16 | R << 8 | k, S = 0; S < 4 && C + S * 0.75 < c; S++)
+            for (var b = [], B = 0; B < c; B += 3)
+              for (var w = o[B >>> 2] >>> 24 - B % 4 * 8 & 255, R = o[B + 1 >>> 2] >>> 24 - (B + 1) % 4 * 8 & 255, k = o[B + 2 >>> 2] >>> 24 - (B + 2) % 4 * 8 & 255, q = w << 16 | R << 8 | k, S = 0; S < 4 && B + S * 0.75 < c; S++)
                 b.push(v.charAt(q >>> 6 * (3 - S) & 63));
             var P = v.charAt(64);
             if (P)
@@ -2124,9 +2124,9 @@ function Rt() {
               for (var b = 0; b < c.length; b++)
                 v[c.charCodeAt(b)] = b;
             }
-            var C = c.charAt(64);
-            if (C) {
-              var w = u.indexOf(C);
+            var B = c.charAt(64);
+            if (B) {
+              var w = u.indexOf(B);
               w !== -1 && (o = w);
             }
             return x(u, o, v);
@@ -2134,9 +2134,9 @@ function Rt() {
           _map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
         };
         function x(u, o, c) {
-          for (var v = [], b = 0, C = 0; C < o; C++)
-            if (C % 4) {
-              var w = c[u.charCodeAt(C - 1)] << C % 4 * 2, R = c[u.charCodeAt(C)] >>> 6 - C % 4 * 2, k = w | R;
+          for (var v = [], b = 0, B = 0; B < o; B++)
+            if (B % 4) {
+              var w = c[u.charCodeAt(B - 1)] << B % 4 * 2, R = c[u.charCodeAt(B)] >>> 6 - B % 4 * 2, k = w | R;
               v[b >>> 2] |= k << 24 - b % 4 * 8, b++;
             }
           return i.create(v, b);
@@ -2173,14 +2173,14 @@ function ka() {
             o === void 0 && (o = !0);
             var c = u.words, v = u.sigBytes, b = o ? this._safe_map : this._map;
             u.clamp();
-            for (var C = [], w = 0; w < v; w += 3)
+            for (var B = [], w = 0; w < v; w += 3)
               for (var R = c[w >>> 2] >>> 24 - w % 4 * 8 & 255, k = c[w + 1 >>> 2] >>> 24 - (w + 1) % 4 * 8 & 255, q = c[w + 2 >>> 2] >>> 24 - (w + 2) % 4 * 8 & 255, S = R << 16 | k << 8 | q, P = 0; P < 4 && w + P * 0.75 < v; P++)
-                C.push(b.charAt(S >>> 6 * (3 - P) & 63));
+                B.push(b.charAt(S >>> 6 * (3 - P) & 63));
             var T = b.charAt(64);
             if (T)
-              for (; C.length % 4; )
-                C.push(T);
-            return C.join("");
+              for (; B.length % 4; )
+                B.push(T);
+            return B.join("");
           },
           /**
            * Converts a Base64url string to a word array.
@@ -2202,8 +2202,8 @@ function ka() {
             var c = u.length, v = o ? this._safe_map : this._map, b = this._reverseMap;
             if (!b) {
               b = this._reverseMap = [];
-              for (var C = 0; C < v.length; C++)
-                b[v.charCodeAt(C)] = C;
+              for (var B = 0; B < v.length; B++)
+                b[v.charCodeAt(B)] = B;
             }
             var w = v.charAt(64);
             if (w) {
@@ -2216,9 +2216,9 @@ function ka() {
           _safe_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
         };
         function x(u, o, c) {
-          for (var v = [], b = 0, C = 0; C < o; C++)
-            if (C % 4) {
-              var w = c[u.charCodeAt(C - 1)] << C % 4 * 2, R = c[u.charCodeAt(C)] >>> 6 - C % 4 * 2, k = w | R;
+          for (var v = [], b = 0, B = 0; B < o; B++)
+            if (B % 4) {
+              var w = c[u.charCodeAt(B - 1)] << B % 4 * 2, R = c[u.charCodeAt(B)] >>> 6 - B % 4 * 2, k = w | R;
               v[b >>> 2] |= k << 24 - b % 4 * 8, b++;
             }
           return i.create(v, b);
@@ -2253,8 +2253,8 @@ function kt() {
               var S = k + q, P = R[S];
               R[S] = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360;
             }
-            var T = this._hash.words, H = R[k + 0], $ = R[k + 1], K = R[k + 2], X = R[k + 3], Q = R[k + 4], U = R[k + 5], A = R[k + 6], n = R[k + 7], d = R[k + 8], g = R[k + 9], B = R[k + 10], F = R[k + 11], z = R[k + 12], N = R[k + 13], D = R[k + 14], h = R[k + 15], E = T[0], j = T[1], Y = T[2], W = T[3];
-            E = v(E, j, Y, W, H, 7, o[0]), W = v(W, E, j, Y, $, 12, o[1]), Y = v(Y, W, E, j, K, 17, o[2]), j = v(j, Y, W, E, X, 22, o[3]), E = v(E, j, Y, W, Q, 7, o[4]), W = v(W, E, j, Y, U, 12, o[5]), Y = v(Y, W, E, j, A, 17, o[6]), j = v(j, Y, W, E, n, 22, o[7]), E = v(E, j, Y, W, d, 7, o[8]), W = v(W, E, j, Y, g, 12, o[9]), Y = v(Y, W, E, j, B, 17, o[10]), j = v(j, Y, W, E, F, 22, o[11]), E = v(E, j, Y, W, z, 7, o[12]), W = v(W, E, j, Y, N, 12, o[13]), Y = v(Y, W, E, j, D, 17, o[14]), j = v(j, Y, W, E, h, 22, o[15]), E = b(E, j, Y, W, $, 5, o[16]), W = b(W, E, j, Y, A, 9, o[17]), Y = b(Y, W, E, j, F, 14, o[18]), j = b(j, Y, W, E, H, 20, o[19]), E = b(E, j, Y, W, U, 5, o[20]), W = b(W, E, j, Y, B, 9, o[21]), Y = b(Y, W, E, j, h, 14, o[22]), j = b(j, Y, W, E, Q, 20, o[23]), E = b(E, j, Y, W, g, 5, o[24]), W = b(W, E, j, Y, D, 9, o[25]), Y = b(Y, W, E, j, X, 14, o[26]), j = b(j, Y, W, E, d, 20, o[27]), E = b(E, j, Y, W, N, 5, o[28]), W = b(W, E, j, Y, K, 9, o[29]), Y = b(Y, W, E, j, n, 14, o[30]), j = b(j, Y, W, E, z, 20, o[31]), E = C(E, j, Y, W, U, 4, o[32]), W = C(W, E, j, Y, d, 11, o[33]), Y = C(Y, W, E, j, F, 16, o[34]), j = C(j, Y, W, E, D, 23, o[35]), E = C(E, j, Y, W, $, 4, o[36]), W = C(W, E, j, Y, Q, 11, o[37]), Y = C(Y, W, E, j, n, 16, o[38]), j = C(j, Y, W, E, B, 23, o[39]), E = C(E, j, Y, W, N, 4, o[40]), W = C(W, E, j, Y, H, 11, o[41]), Y = C(Y, W, E, j, X, 16, o[42]), j = C(j, Y, W, E, A, 23, o[43]), E = C(E, j, Y, W, g, 4, o[44]), W = C(W, E, j, Y, z, 11, o[45]), Y = C(Y, W, E, j, h, 16, o[46]), j = C(j, Y, W, E, K, 23, o[47]), E = w(E, j, Y, W, H, 6, o[48]), W = w(W, E, j, Y, n, 10, o[49]), Y = w(Y, W, E, j, D, 15, o[50]), j = w(j, Y, W, E, U, 21, o[51]), E = w(E, j, Y, W, z, 6, o[52]), W = w(W, E, j, Y, X, 10, o[53]), Y = w(Y, W, E, j, B, 15, o[54]), j = w(j, Y, W, E, $, 21, o[55]), E = w(E, j, Y, W, d, 6, o[56]), W = w(W, E, j, Y, h, 10, o[57]), Y = w(Y, W, E, j, A, 15, o[58]), j = w(j, Y, W, E, N, 21, o[59]), E = w(E, j, Y, W, Q, 6, o[60]), W = w(W, E, j, Y, F, 10, o[61]), Y = w(Y, W, E, j, K, 15, o[62]), j = w(j, Y, W, E, g, 21, o[63]), T[0] = T[0] + E | 0, T[1] = T[1] + j | 0, T[2] = T[2] + Y | 0, T[3] = T[3] + W | 0;
+            var T = this._hash.words, H = R[k + 0], $ = R[k + 1], K = R[k + 2], X = R[k + 3], Q = R[k + 4], U = R[k + 5], A = R[k + 6], n = R[k + 7], d = R[k + 8], g = R[k + 9], C = R[k + 10], F = R[k + 11], z = R[k + 12], N = R[k + 13], D = R[k + 14], h = R[k + 15], E = T[0], j = T[1], Y = T[2], W = T[3];
+            E = v(E, j, Y, W, H, 7, o[0]), W = v(W, E, j, Y, $, 12, o[1]), Y = v(Y, W, E, j, K, 17, o[2]), j = v(j, Y, W, E, X, 22, o[3]), E = v(E, j, Y, W, Q, 7, o[4]), W = v(W, E, j, Y, U, 12, o[5]), Y = v(Y, W, E, j, A, 17, o[6]), j = v(j, Y, W, E, n, 22, o[7]), E = v(E, j, Y, W, d, 7, o[8]), W = v(W, E, j, Y, g, 12, o[9]), Y = v(Y, W, E, j, C, 17, o[10]), j = v(j, Y, W, E, F, 22, o[11]), E = v(E, j, Y, W, z, 7, o[12]), W = v(W, E, j, Y, N, 12, o[13]), Y = v(Y, W, E, j, D, 17, o[14]), j = v(j, Y, W, E, h, 22, o[15]), E = b(E, j, Y, W, $, 5, o[16]), W = b(W, E, j, Y, A, 9, o[17]), Y = b(Y, W, E, j, F, 14, o[18]), j = b(j, Y, W, E, H, 20, o[19]), E = b(E, j, Y, W, U, 5, o[20]), W = b(W, E, j, Y, C, 9, o[21]), Y = b(Y, W, E, j, h, 14, o[22]), j = b(j, Y, W, E, Q, 20, o[23]), E = b(E, j, Y, W, g, 5, o[24]), W = b(W, E, j, Y, D, 9, o[25]), Y = b(Y, W, E, j, X, 14, o[26]), j = b(j, Y, W, E, d, 20, o[27]), E = b(E, j, Y, W, N, 5, o[28]), W = b(W, E, j, Y, K, 9, o[29]), Y = b(Y, W, E, j, n, 14, o[30]), j = b(j, Y, W, E, z, 20, o[31]), E = B(E, j, Y, W, U, 4, o[32]), W = B(W, E, j, Y, d, 11, o[33]), Y = B(Y, W, E, j, F, 16, o[34]), j = B(j, Y, W, E, D, 23, o[35]), E = B(E, j, Y, W, $, 4, o[36]), W = B(W, E, j, Y, Q, 11, o[37]), Y = B(Y, W, E, j, n, 16, o[38]), j = B(j, Y, W, E, C, 23, o[39]), E = B(E, j, Y, W, N, 4, o[40]), W = B(W, E, j, Y, H, 11, o[41]), Y = B(Y, W, E, j, X, 16, o[42]), j = B(j, Y, W, E, A, 23, o[43]), E = B(E, j, Y, W, g, 4, o[44]), W = B(W, E, j, Y, z, 11, o[45]), Y = B(Y, W, E, j, h, 16, o[46]), j = B(j, Y, W, E, K, 23, o[47]), E = w(E, j, Y, W, H, 6, o[48]), W = w(W, E, j, Y, n, 10, o[49]), Y = w(Y, W, E, j, D, 15, o[50]), j = w(j, Y, W, E, U, 21, o[51]), E = w(E, j, Y, W, z, 6, o[52]), W = w(W, E, j, Y, X, 10, o[53]), Y = w(Y, W, E, j, C, 15, o[54]), j = w(j, Y, W, E, $, 21, o[55]), E = w(E, j, Y, W, d, 6, o[56]), W = w(W, E, j, Y, h, 10, o[57]), Y = w(Y, W, E, j, A, 15, o[58]), j = w(j, Y, W, E, N, 21, o[59]), E = w(E, j, Y, W, Q, 6, o[60]), W = w(W, E, j, Y, F, 10, o[61]), Y = w(Y, W, E, j, K, 15, o[62]), j = w(j, Y, W, E, g, 21, o[63]), T[0] = T[0] + E | 0, T[1] = T[1] + j | 0, T[2] = T[2] + Y | 0, T[3] = T[3] + W | 0;
           },
           _doFinalize: function() {
             var R = this._data, k = R.words, q = this._nDataBytes * 8, S = R.sigBytes * 8;
@@ -2280,7 +2280,7 @@ function kt() {
           var $ = R + (k & S | q & ~S) + P + H;
           return ($ << T | $ >>> 32 - T) + k;
         }
-        function C(R, k, q, S, P, T, H) {
+        function B(R, k, q, S, P, T, H) {
           var $ = R + (k ^ q ^ S) + P + H;
           return ($ << T | $ >>> 32 - T) + k;
         }
@@ -2311,21 +2311,21 @@ function bn() {
             ]);
           },
           _doProcessBlock: function(c, v) {
-            for (var b = this._hash.words, C = b[0], w = b[1], R = b[2], k = b[3], q = b[4], S = 0; S < 80; S++) {
+            for (var b = this._hash.words, B = b[0], w = b[1], R = b[2], k = b[3], q = b[4], S = 0; S < 80; S++) {
               if (S < 16)
                 u[S] = c[v + S] | 0;
               else {
                 var P = u[S - 3] ^ u[S - 8] ^ u[S - 14] ^ u[S - 16];
                 u[S] = P << 1 | P >>> 31;
               }
-              var T = (C << 5 | C >>> 27) + q + u[S];
-              S < 20 ? T += (w & R | ~w & k) + 1518500249 : S < 40 ? T += (w ^ R ^ k) + 1859775393 : S < 60 ? T += (w & R | w & k | R & k) - 1894007588 : T += (w ^ R ^ k) - 899497514, q = k, k = R, R = w << 30 | w >>> 2, w = C, C = T;
+              var T = (B << 5 | B >>> 27) + q + u[S];
+              S < 20 ? T += (w & R | ~w & k) + 1518500249 : S < 40 ? T += (w ^ R ^ k) + 1859775393 : S < 60 ? T += (w & R | w & k | R & k) - 1894007588 : T += (w ^ R ^ k) - 899497514, q = k, k = R, R = w << 30 | w >>> 2, w = B, B = T;
             }
-            b[0] = b[0] + C | 0, b[1] = b[1] + w | 0, b[2] = b[2] + R | 0, b[3] = b[3] + k | 0, b[4] = b[4] + q | 0;
+            b[0] = b[0] + B | 0, b[1] = b[1] + w | 0, b[2] = b[2] + R | 0, b[3] = b[3] + k | 0, b[4] = b[4] + q | 0;
           },
           _doFinalize: function() {
-            var c = this._data, v = c.words, b = this._nDataBytes * 8, C = c.sigBytes * 8;
-            return v[C >>> 5] |= 128 << 24 - C % 32, v[(C + 64 >>> 9 << 4) + 14] = Math.floor(b / 4294967296), v[(C + 64 >>> 9 << 4) + 15] = b, c.sigBytes = v.length * 4, this._process(), this._hash;
+            var c = this._data, v = c.words, b = this._nDataBytes * 8, B = c.sigBytes * 8;
+            return v[B >>> 5] |= 128 << 24 - B % 32, v[(B + 64 >>> 9 << 4) + 14] = Math.floor(b / 4294967296), v[(B + 64 >>> 9 << 4) + 15] = b, c.sigBytes = v.length * 4, this._process(), this._hash;
           },
           clone: function() {
             var c = y.clone.call(this);
@@ -2346,7 +2346,7 @@ function Nf() {
       return function(r) {
         var a = t, i = a.lib, y = i.WordArray, x = i.Hasher, u = a.algo, o = [], c = [];
         (function() {
-          function C(q) {
+          function B(q) {
             for (var S = r.sqrt(q), P = 2; P <= S; P++)
               if (!(q % P))
                 return !1;
@@ -2356,32 +2356,32 @@ function Nf() {
             return (q - (q | 0)) * 4294967296 | 0;
           }
           for (var R = 2, k = 0; k < 64; )
-            C(R) && (k < 8 && (o[k] = w(r.pow(R, 1 / 2))), c[k] = w(r.pow(R, 1 / 3)), k++), R++;
+            B(R) && (k < 8 && (o[k] = w(r.pow(R, 1 / 2))), c[k] = w(r.pow(R, 1 / 3)), k++), R++;
         })();
         var v = [], b = u.SHA256 = x.extend({
           _doReset: function() {
             this._hash = new y.init(o.slice(0));
           },
-          _doProcessBlock: function(C, w) {
+          _doProcessBlock: function(B, w) {
             for (var R = this._hash.words, k = R[0], q = R[1], S = R[2], P = R[3], T = R[4], H = R[5], $ = R[6], K = R[7], X = 0; X < 64; X++) {
               if (X < 16)
-                v[X] = C[w + X] | 0;
+                v[X] = B[w + X] | 0;
               else {
                 var Q = v[X - 15], U = (Q << 25 | Q >>> 7) ^ (Q << 14 | Q >>> 18) ^ Q >>> 3, A = v[X - 2], n = (A << 15 | A >>> 17) ^ (A << 13 | A >>> 19) ^ A >>> 10;
                 v[X] = U + v[X - 7] + n + v[X - 16];
               }
-              var d = T & H ^ ~T & $, g = k & q ^ k & S ^ q & S, B = (k << 30 | k >>> 2) ^ (k << 19 | k >>> 13) ^ (k << 10 | k >>> 22), F = (T << 26 | T >>> 6) ^ (T << 21 | T >>> 11) ^ (T << 7 | T >>> 25), z = K + F + d + c[X] + v[X], N = B + g;
+              var d = T & H ^ ~T & $, g = k & q ^ k & S ^ q & S, C = (k << 30 | k >>> 2) ^ (k << 19 | k >>> 13) ^ (k << 10 | k >>> 22), F = (T << 26 | T >>> 6) ^ (T << 21 | T >>> 11) ^ (T << 7 | T >>> 25), z = K + F + d + c[X] + v[X], N = C + g;
               K = $, $ = H, H = T, T = P + z | 0, P = S, S = q, q = k, k = z + N | 0;
             }
             R[0] = R[0] + k | 0, R[1] = R[1] + q | 0, R[2] = R[2] + S | 0, R[3] = R[3] + P | 0, R[4] = R[4] + T | 0, R[5] = R[5] + H | 0, R[6] = R[6] + $ | 0, R[7] = R[7] + K | 0;
           },
           _doFinalize: function() {
-            var C = this._data, w = C.words, R = this._nDataBytes * 8, k = C.sigBytes * 8;
-            return w[k >>> 5] |= 128 << 24 - k % 32, w[(k + 64 >>> 9 << 4) + 14] = r.floor(R / 4294967296), w[(k + 64 >>> 9 << 4) + 15] = R, C.sigBytes = w.length * 4, this._process(), this._hash;
+            var B = this._data, w = B.words, R = this._nDataBytes * 8, k = B.sigBytes * 8;
+            return w[k >>> 5] |= 128 << 24 - k % 32, w[(k + 64 >>> 9 << 4) + 14] = r.floor(R / 4294967296), w[(k + 64 >>> 9 << 4) + 15] = R, B.sigBytes = w.length * 4, this._process(), this._hash;
           },
           clone: function() {
-            var C = x.clone.call(this);
-            return C._hash = this._hash.clone(), C;
+            var B = x.clone.call(this);
+            return B._hash = this._hash.clone(), B;
           }
         });
         a.SHA256 = x._createHelper(b), a.HmacSHA256 = x._createHmacHelper(b);
@@ -2516,7 +2516,7 @@ function pn() {
           for (var w = 0; w < 80; w++)
             b[w] = c();
         })();
-        var C = o.SHA512 = i.extend({
+        var B = o.SHA512 = i.extend({
           _doReset: function() {
             this._hash = new u.init([
               new x.init(1779033703, 4089235720),
@@ -2530,7 +2530,7 @@ function pn() {
             ]);
           },
           _doProcessBlock: function(w, R) {
-            for (var k = this._hash.words, q = k[0], S = k[1], P = k[2], T = k[3], H = k[4], $ = k[5], K = k[6], X = k[7], Q = q.high, U = q.low, A = S.high, n = S.low, d = P.high, g = P.low, B = T.high, F = T.low, z = H.high, N = H.low, D = $.high, h = $.low, E = K.high, j = K.low, Y = X.high, W = X.low, re = Q, ce = U, we = A, Ae = n, Me = d, Fe = g, Z0 = B, We = F, Oe = z, _0 = N, Ge = D, Ye = h, $0 = E, Qe = j, ze = Y, O0 = W, qe = 0; qe < 80; qe++) {
+            for (var k = this._hash.words, q = k[0], S = k[1], P = k[2], T = k[3], H = k[4], $ = k[5], K = k[6], X = k[7], Q = q.high, U = q.low, A = S.high, n = S.low, d = P.high, g = P.low, C = T.high, F = T.low, z = H.high, N = H.low, D = $.high, h = $.low, E = K.high, j = K.low, Y = X.high, W = X.low, re = Q, ce = U, we = A, Ae = n, Me = d, Fe = g, Z0 = C, We = F, Oe = z, _0 = N, Ge = D, Ye = h, $0 = E, Qe = j, ze = Y, O0 = W, qe = 0; qe < 80; qe++) {
               var Se, F0, Je = b[qe];
               if (qe < 16)
                 F0 = Je.high = w[R + qe * 2] | 0, Se = Je.low = w[R + qe * 2 + 1] | 0;
@@ -2541,7 +2541,7 @@ function pn() {
               var N0 = Oe & Ge ^ ~Oe & $0, o0 = _0 & Ye ^ ~_0 & Qe, x0 = re & we ^ re & Me ^ we & Me, D0 = ce & Ae ^ ce & Fe ^ Ae & Fe, t0 = (re >>> 28 | ce << 4) ^ (re << 30 | ce >>> 2) ^ (re << 25 | ce >>> 7), Ve = (ce >>> 28 | re << 4) ^ (ce << 30 | re >>> 2) ^ (ce << 25 | re >>> 7), tt = (Oe >>> 14 | _0 << 18) ^ (Oe >>> 18 | _0 << 14) ^ (Oe << 23 | _0 >>> 9), c0 = (_0 >>> 14 | Oe << 18) ^ (_0 >>> 18 | Oe << 14) ^ (_0 << 23 | Oe >>> 9), d0 = v[qe], yt = d0.high, Ie = d0.low, Re = O0 + c0, l = ze + tt + (Re >>> 0 < O0 >>> 0 ? 1 : 0), Re = Re + o0, l = l + N0 + (Re >>> 0 < o0 >>> 0 ? 1 : 0), Re = Re + Ie, l = l + yt + (Re >>> 0 < Ie >>> 0 ? 1 : 0), Re = Re + Se, l = l + F0 + (Re >>> 0 < Se >>> 0 ? 1 : 0), _ = Ve + D0, m = t0 + x0 + (_ >>> 0 < Ve >>> 0 ? 1 : 0);
               ze = $0, O0 = Qe, $0 = Ge, Qe = Ye, Ge = Oe, Ye = _0, _0 = We + Re | 0, Oe = Z0 + l + (_0 >>> 0 < We >>> 0 ? 1 : 0) | 0, Z0 = Me, We = Fe, Me = we, Fe = Ae, we = re, Ae = ce, ce = Re + _ | 0, re = l + m + (ce >>> 0 < Re >>> 0 ? 1 : 0) | 0;
             }
-            U = q.low = U + ce, q.high = Q + re + (U >>> 0 < ce >>> 0 ? 1 : 0), n = S.low = n + Ae, S.high = A + we + (n >>> 0 < Ae >>> 0 ? 1 : 0), g = P.low = g + Fe, P.high = d + Me + (g >>> 0 < Fe >>> 0 ? 1 : 0), F = T.low = F + We, T.high = B + Z0 + (F >>> 0 < We >>> 0 ? 1 : 0), N = H.low = N + _0, H.high = z + Oe + (N >>> 0 < _0 >>> 0 ? 1 : 0), h = $.low = h + Ye, $.high = D + Ge + (h >>> 0 < Ye >>> 0 ? 1 : 0), j = K.low = j + Qe, K.high = E + $0 + (j >>> 0 < Qe >>> 0 ? 1 : 0), W = X.low = W + O0, X.high = Y + ze + (W >>> 0 < O0 >>> 0 ? 1 : 0);
+            U = q.low = U + ce, q.high = Q + re + (U >>> 0 < ce >>> 0 ? 1 : 0), n = S.low = n + Ae, S.high = A + we + (n >>> 0 < Ae >>> 0 ? 1 : 0), g = P.low = g + Fe, P.high = d + Me + (g >>> 0 < Fe >>> 0 ? 1 : 0), F = T.low = F + We, T.high = C + Z0 + (F >>> 0 < We >>> 0 ? 1 : 0), N = H.low = N + _0, H.high = z + Oe + (N >>> 0 < _0 >>> 0 ? 1 : 0), h = $.low = h + Ye, $.high = D + Ge + (h >>> 0 < Ye >>> 0 ? 1 : 0), j = K.low = j + Qe, K.high = E + $0 + (j >>> 0 < Qe >>> 0 ? 1 : 0), W = X.low = W + O0, X.high = Y + ze + (W >>> 0 < O0 >>> 0 ? 1 : 0);
           },
           _doFinalize: function() {
             var w = this._data, R = w.words, k = this._nDataBytes * 8, q = w.sigBytes * 8;
@@ -2555,7 +2555,7 @@ function pn() {
           },
           blockSize: 1024 / 32
         });
-        r.SHA512 = i._createHelper(C), r.HmacSHA512 = i._createHmacHelper(C);
+        r.SHA512 = i._createHelper(B), r.HmacSHA512 = i._createHmacHelper(B);
       }(), t.SHA512;
     });
   }(Wr)), Wr.exports;
@@ -2597,7 +2597,7 @@ function Ta() {
       f.exports = r($e(), _r());
     })(Pe, function(t) {
       return function(r) {
-        var a = t, i = a.lib, y = i.WordArray, x = i.Hasher, u = a.x64, o = u.Word, c = a.algo, v = [], b = [], C = [];
+        var a = t, i = a.lib, y = i.WordArray, x = i.Hasher, u = a.x64, o = u.Word, c = a.algo, v = [], b = [], B = [];
         (function() {
           for (var k = 1, q = 0, S = 0; S < 24; S++) {
             v[k + 5 * q] = (S + 1) * (S + 2) / 2 % 64;
@@ -2615,7 +2615,7 @@ function Ta() {
               }
               H & 128 ? H = H << 1 ^ 113 : H <<= 1;
             }
-            C[$] = o.create(K, X);
+            B[$] = o.create(K, X);
           }
         })();
         var w = [];
@@ -2657,7 +2657,7 @@ function Ta() {
                 d.high = U, d.low = A;
               }
               for (var Q = 0; Q < 5; Q++)
-                for (var g = w[(Q + 4) % 5], B = w[(Q + 1) % 5], F = B.high, z = B.low, U = g.high ^ (F << 1 | z >>> 31), A = g.low ^ (z << 1 | F >>> 31), n = 0; n < 5; n++) {
+                for (var g = w[(Q + 4) % 5], C = w[(Q + 1) % 5], F = C.high, z = C.low, U = g.high ^ (F << 1 | z >>> 31), A = g.low ^ (z << 1 | F >>> 31), n = 0; n < 5; n++) {
                   var K = S[Q + 5 * n];
                   K.high ^= U, K.low ^= A;
                 }
@@ -2674,7 +2674,7 @@ function Ta() {
                   var N = Q + 5 * n, K = S[N], re = w[N], ce = w[(Q + 1) % 5 + 5 * n], we = w[(Q + 2) % 5 + 5 * n];
                   K.high = re.high ^ ~ce.high & we.high, K.low = re.low ^ ~ce.low & we.low;
                 }
-              var K = S[0], Ae = C[X];
+              var K = S[0], Ae = B[X];
               K.high ^= Ae.high, K.low ^= Ae.low;
             }
           },
@@ -3041,7 +3041,7 @@ function Oa() {
           13,
           11,
           11
-        ]), C = y.create([0, 1518500249, 1859775393, 2400959708, 2840853838]), w = y.create([1352829926, 1548603684, 1836072691, 2053994217, 0]), R = u.RIPEMD160 = x.extend({
+        ]), B = y.create([0, 1518500249, 1859775393, 2400959708, 2840853838]), w = y.create([1352829926, 1548603684, 1836072691, 2053994217, 0]), R = u.RIPEMD160 = x.extend({
           _doReset: function() {
             this._hash = y.create([1732584193, 4023233417, 2562383102, 271733878, 3285377520]);
           },
@@ -3050,10 +3050,10 @@ function Oa() {
               var Q = K + X, U = $[Q];
               $[Q] = (U << 8 | U >>> 24) & 16711935 | (U << 24 | U >>> 8) & 4278255360;
             }
-            var A = this._hash.words, n = C.words, d = w.words, g = o.words, B = c.words, F = v.words, z = b.words, N, D, h, E, j, Y, W, re, ce, we;
+            var A = this._hash.words, n = B.words, d = w.words, g = o.words, C = c.words, F = v.words, z = b.words, N, D, h, E, j, Y, W, re, ce, we;
             Y = N = A[0], W = D = A[1], re = h = A[2], ce = E = A[3], we = j = A[4];
             for (var Ae, X = 0; X < 80; X += 1)
-              Ae = N + $[K + g[X]] | 0, X < 16 ? Ae += k(D, h, E) + n[0] : X < 32 ? Ae += q(D, h, E) + n[1] : X < 48 ? Ae += S(D, h, E) + n[2] : X < 64 ? Ae += P(D, h, E) + n[3] : Ae += T(D, h, E) + n[4], Ae = Ae | 0, Ae = H(Ae, F[X]), Ae = Ae + j | 0, N = j, j = E, E = H(h, 10), h = D, D = Ae, Ae = Y + $[K + B[X]] | 0, X < 16 ? Ae += T(W, re, ce) + d[0] : X < 32 ? Ae += P(W, re, ce) + d[1] : X < 48 ? Ae += S(W, re, ce) + d[2] : X < 64 ? Ae += q(W, re, ce) + d[3] : Ae += k(W, re, ce) + d[4], Ae = Ae | 0, Ae = H(Ae, z[X]), Ae = Ae + we | 0, Y = we, we = ce, ce = H(re, 10), re = W, W = Ae;
+              Ae = N + $[K + g[X]] | 0, X < 16 ? Ae += k(D, h, E) + n[0] : X < 32 ? Ae += q(D, h, E) + n[1] : X < 48 ? Ae += S(D, h, E) + n[2] : X < 64 ? Ae += P(D, h, E) + n[3] : Ae += T(D, h, E) + n[4], Ae = Ae | 0, Ae = H(Ae, F[X]), Ae = Ae + j | 0, N = j, j = E, E = H(h, 10), h = D, D = Ae, Ae = Y + $[K + C[X]] | 0, X < 16 ? Ae += T(W, re, ce) + d[0] : X < 32 ? Ae += P(W, re, ce) + d[1] : X < 48 ? Ae += S(W, re, ce) + d[2] : X < 64 ? Ae += q(W, re, ce) + d[3] : Ae += k(W, re, ce) + d[4], Ae = Ae | 0, Ae = H(Ae, z[X]), Ae = Ae + we | 0, Y = we, we = ce, ce = H(re, 10), re = W, W = Ae;
             Ae = A[1] + h + ce | 0, A[1] = A[2] + E + we | 0, A[2] = A[3] + j + Y | 0, A[3] = A[4] + N + W | 0, A[4] = A[0] + D + re | 0, A[0] = Ae;
           },
           _doFinalize: function() {
@@ -3116,9 +3116,9 @@ function Lf() {
             o = this._hasher = new o.init(), typeof c == "string" && (c = x.parse(c));
             var v = o.blockSize, b = v * 4;
             c.sigBytes > b && (c = o.finalize(c)), c.clamp();
-            for (var C = this._oKey = c.clone(), w = this._iKey = c.clone(), R = C.words, k = w.words, q = 0; q < v; q++)
+            for (var B = this._oKey = c.clone(), w = this._iKey = c.clone(), R = B.words, k = w.words, q = 0; q < v; q++)
               R[q] ^= 1549556828, k[q] ^= 909522486;
-            C.sigBytes = w.sigBytes = b, this.reset();
+            B.sigBytes = w.sigBytes = b, this.reset();
           },
           /**
            * Resets this HMAC to its initial state.
@@ -3218,7 +3218,7 @@ function za() {
            *     var key = kdf.compute(password, salt);
            */
           compute: function(v, b) {
-            for (var C = this.cfg, w = o.create(C.hasher, v), R = y.create(), k = y.create([1]), q = R.words, S = k.words, P = C.keySize, T = C.iterations; q.length < P; ) {
+            for (var B = this.cfg, w = o.create(B.hasher, v), R = y.create(), k = y.create([1]), q = R.words, S = k.words, P = B.keySize, T = B.iterations; q.length < P; ) {
               var H = w.update(b).finalize(k);
               w.reset();
               for (var $ = H.words, K = $.length, X = H, Q = 1; Q < T; Q++) {
@@ -3231,8 +3231,8 @@ function za() {
             return R.sigBytes = P * 4, R;
           }
         });
-        r.PBKDF2 = function(v, b, C) {
-          return c.create(C).compute(v, b);
+        r.PBKDF2 = function(v, b, B) {
+          return c.create(B).compute(v, b);
         };
       }(), t.PBKDF2;
     });
@@ -3285,7 +3285,7 @@ function At() {
            *     var key = kdf.compute(password, salt);
            */
           compute: function(c, v) {
-            for (var b, C = this.cfg, w = C.hasher.create(), R = y.create(), k = R.words, q = C.keySize, S = C.iterations; k.length < q; ) {
+            for (var b, B = this.cfg, w = B.hasher.create(), R = y.create(), k = R.words, q = B.keySize, S = B.iterations; k.length < q; ) {
               b && w.update(b), b = w.update(c).finalize(v), w.reset();
               for (var P = 1; P < S; P++)
                 b = w.finalize(b), w.reset();
@@ -3310,7 +3310,7 @@ function C0() {
       t.lib.Cipher || function(r) {
         var a = t, i = a.lib, y = i.Base, x = i.WordArray, u = i.BufferedBlockAlgorithm, o = a.enc;
         o.Utf8;
-        var c = o.Base64, v = a.algo, b = v.EvpKDF, C = i.Cipher = u.extend({
+        var c = o.Base64, v = a.algo, b = v.EvpKDF, B = i.Cipher = u.extend({
           /**
            * Configuration options.
            *
@@ -3442,7 +3442,7 @@ function C0() {
             };
           }()
         });
-        i.StreamCipher = C.extend({
+        i.StreamCipher = B.extend({
           _doFinalize: function() {
             var U = this._process(!0);
             return U;
@@ -3507,8 +3507,8 @@ function C0() {
              *     mode.processBlock(data.words, offset);
              */
             processBlock: function(n, d) {
-              var g = this._cipher, B = g.blockSize;
-              A.call(this, n, d, B), g.encryptBlock(n, d), this._prevBlock = n.slice(d, d + B);
+              var g = this._cipher, C = g.blockSize;
+              A.call(this, n, d, C), g.encryptBlock(n, d), this._prevBlock = n.slice(d, d + C);
             }
           }), U.Decryptor = U.extend({
             /**
@@ -3522,15 +3522,15 @@ function C0() {
              *     mode.processBlock(data.words, offset);
              */
             processBlock: function(n, d) {
-              var g = this._cipher, B = g.blockSize, F = n.slice(d, d + B);
-              g.decryptBlock(n, d), A.call(this, n, d, B), this._prevBlock = F;
+              var g = this._cipher, C = g.blockSize, F = n.slice(d, d + C);
+              g.decryptBlock(n, d), A.call(this, n, d, C), this._prevBlock = F;
             }
           });
           function A(n, d, g) {
-            var B, F = this._iv;
-            F ? (B = F, this._iv = r) : B = this._prevBlock;
+            var C, F = this._iv;
+            F ? (C = F, this._iv = r) : C = this._prevBlock;
             for (var z = 0; z < g; z++)
-              n[d + z] ^= B[z];
+              n[d + z] ^= C[z];
           }
           return U;
         }(), q = a.pad = {}, S = q.Pkcs7 = {
@@ -3547,9 +3547,9 @@ function C0() {
            *     CryptoJS.pad.Pkcs7.pad(wordArray, 4);
            */
           pad: function(U, A) {
-            for (var n = A * 4, d = n - U.sigBytes % n, g = d << 24 | d << 16 | d << 8 | d, B = [], F = 0; F < d; F += 4)
-              B.push(g);
-            var z = x.create(B, d);
+            for (var n = A * 4, d = n - U.sigBytes % n, g = d << 24 | d << 16 | d << 8 | d, C = [], F = 0; F < d; F += 4)
+              C.push(g);
+            var z = x.create(C, d);
             U.concat(z);
           },
           /**
@@ -3568,20 +3568,20 @@ function C0() {
             U.sigBytes -= A;
           }
         };
-        i.BlockCipher = C.extend({
+        i.BlockCipher = B.extend({
           /**
            * Configuration options.
            *
            * @property {Mode} mode The block mode to use. Default: CBC
            * @property {Padding} padding The padding strategy to use. Default: Pkcs7
            */
-          cfg: C.cfg.extend({
+          cfg: B.cfg.extend({
             mode: k,
             padding: S
           }),
           reset: function() {
             var U;
-            C.reset.call(this);
+            B.reset.call(this);
             var A = this.cfg, n = A.iv, d = A.mode;
             this._xformMode == this._ENC_XFORM_MODE ? U = d.createEncryptor : (U = d.createDecryptor, this._minBufferSize = 1), this._mode && this._mode.__creator == U ? this._mode.init(this, n && n.words) : (this._mode = U.call(d, this, n && n.words), this._mode.__creator = U);
           },
@@ -3699,9 +3699,9 @@ function C0() {
            */
           encrypt: function(U, A, n, d) {
             d = this.cfg.extend(d);
-            var g = U.createEncryptor(n, d), B = g.finalize(A), F = g.cfg;
+            var g = U.createEncryptor(n, d), C = g.finalize(A), F = g.cfg;
             return P.create({
-              ciphertext: B,
+              ciphertext: C,
               key: n,
               iv: F.iv,
               algorithm: U,
@@ -3771,11 +3771,11 @@ function C0() {
            */
           execute: function(U, A, n, d, g) {
             if (d || (d = x.random(64 / 8)), g)
-              var B = b.create({ keySize: A + n, hasher: g }).compute(U, d);
+              var C = b.create({ keySize: A + n, hasher: g }).compute(U, d);
             else
-              var B = b.create({ keySize: A + n }).compute(U, d);
-            var F = x.create(B.words.slice(A), n * 4);
-            return B.sigBytes = A * 4, P.create({ key: B, iv: F, salt: d });
+              var C = b.create({ keySize: A + n }).compute(U, d);
+            var F = x.create(C.words.slice(A), n * 4);
+            return C.sigBytes = A * 4, P.create({ key: C, iv: F, salt: d });
           }
         }, Q = i.PasswordBasedCipher = $.extend({
           /**
@@ -3807,8 +3807,8 @@ function C0() {
             d = this.cfg.extend(d);
             var g = d.kdf.execute(n, U.keySize, U.ivSize, d.salt, d.hasher);
             d.iv = g.iv;
-            var B = $.encrypt.call(this, U, A, g.key, d);
-            return B.mixIn(g), B;
+            var C = $.encrypt.call(this, U, A, g.key, d);
+            return C.mixIn(g), C;
           },
           /**
            * Decrypts serialized ciphertext using a password.
@@ -3831,8 +3831,8 @@ function C0() {
             d = this.cfg.extend(d), A = this._parse(A, d.format);
             var g = d.kdf.execute(n, U.keySize, U.ivSize, A.salt, d.hasher);
             d.iv = g.iv;
-            var B = $.decrypt.call(this, U, A, g.key, d);
-            return B;
+            var C = $.decrypt.call(this, U, A, g.key, d);
+            return C;
           }
         });
       }();
@@ -3919,10 +3919,10 @@ function La() {
           processBlock: function(x, u) {
             var o = this._cipher, c = o.blockSize, v = this._iv, b = this._counter;
             v && (b = this._counter = v.slice(0), this._iv = void 0), i(b);
-            var C = b.slice(0);
-            o.encryptBlock(C, 0);
+            var B = b.slice(0);
+            o.encryptBlock(B, 0);
             for (var w = 0; w < c; w++)
-              x[u + w] ^= C[w];
+              x[u + w] ^= B[w];
           }
         });
         return r.Decryptor = y, r;
@@ -4117,7 +4117,7 @@ function Xa() {
       f.exports = r($e(), Rt(), kt(), At(), C0());
     })(Pe, function(t) {
       return function() {
-        var r = t, a = r.lib, i = a.BlockCipher, y = r.algo, x = [], u = [], o = [], c = [], v = [], b = [], C = [], w = [], R = [], k = [];
+        var r = t, a = r.lib, i = a.BlockCipher, y = r.algo, x = [], u = [], o = [], c = [], v = [], b = [], B = [], w = [], R = [], k = [];
         (function() {
           for (var P = [], T = 0; T < 256; T++)
             T < 128 ? P[T] = T << 1 : P[T] = T << 1 ^ 283;
@@ -4127,7 +4127,7 @@ function Xa() {
             var X = P[H], Q = P[X], U = P[Q], A = P[K] * 257 ^ K * 16843008;
             o[H] = A << 24 | A >>> 8, c[H] = A << 16 | A >>> 16, v[H] = A << 8 | A >>> 24, b[H] = A;
             var A = U * 16843009 ^ Q * 65537 ^ X * 257 ^ H * 16843008;
-            C[K] = A << 24 | A >>> 8, w[K] = A << 16 | A >>> 16, R[K] = A << 8 | A >>> 24, k[K] = A, H ? (H = X ^ P[P[P[U ^ X]]], $ ^= P[P[$]]) : H = $ = 1;
+            B[K] = A << 24 | A >>> 8, w[K] = A << 16 | A >>> 16, R[K] = A << 8 | A >>> 24, k[K] = A, H ? (H = X ^ P[P[P[U ^ X]]], $ ^= P[P[$]]) : H = $ = 1;
           }
         })();
         var q = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], S = y.AES = i.extend({
@@ -4142,7 +4142,7 @@ function Xa() {
                   var P = Q[U];
                 else
                   var P = Q[U - 4];
-                n < 4 || U <= 4 ? A[n] = P : A[n] = C[x[P >>> 24]] ^ w[x[P >>> 16 & 255]] ^ R[x[P >>> 8 & 255]] ^ k[x[P & 255]];
+                n < 4 || U <= 4 ? A[n] = P : A[n] = B[x[P >>> 24]] ^ w[x[P >>> 16 & 255]] ^ R[x[P >>> 8 & 255]] ^ k[x[P & 255]];
               }
             }
           },
@@ -4151,16 +4151,16 @@ function Xa() {
           },
           decryptBlock: function(P, T) {
             var H = P[T + 1];
-            P[T + 1] = P[T + 3], P[T + 3] = H, this._doCryptBlock(P, T, this._invKeySchedule, C, w, R, k, u);
+            P[T + 1] = P[T + 3], P[T + 3] = H, this._doCryptBlock(P, T, this._invKeySchedule, B, w, R, k, u);
             var H = P[T + 1];
             P[T + 1] = P[T + 3], P[T + 3] = H;
           },
           _doCryptBlock: function(P, T, H, $, K, X, Q, U) {
-            for (var A = this._nRounds, n = P[T] ^ H[0], d = P[T + 1] ^ H[1], g = P[T + 2] ^ H[2], B = P[T + 3] ^ H[3], F = 4, z = 1; z < A; z++) {
-              var N = $[n >>> 24] ^ K[d >>> 16 & 255] ^ X[g >>> 8 & 255] ^ Q[B & 255] ^ H[F++], D = $[d >>> 24] ^ K[g >>> 16 & 255] ^ X[B >>> 8 & 255] ^ Q[n & 255] ^ H[F++], h = $[g >>> 24] ^ K[B >>> 16 & 255] ^ X[n >>> 8 & 255] ^ Q[d & 255] ^ H[F++], E = $[B >>> 24] ^ K[n >>> 16 & 255] ^ X[d >>> 8 & 255] ^ Q[g & 255] ^ H[F++];
-              n = N, d = D, g = h, B = E;
+            for (var A = this._nRounds, n = P[T] ^ H[0], d = P[T + 1] ^ H[1], g = P[T + 2] ^ H[2], C = P[T + 3] ^ H[3], F = 4, z = 1; z < A; z++) {
+              var N = $[n >>> 24] ^ K[d >>> 16 & 255] ^ X[g >>> 8 & 255] ^ Q[C & 255] ^ H[F++], D = $[d >>> 24] ^ K[g >>> 16 & 255] ^ X[C >>> 8 & 255] ^ Q[n & 255] ^ H[F++], h = $[g >>> 24] ^ K[C >>> 16 & 255] ^ X[n >>> 8 & 255] ^ Q[d & 255] ^ H[F++], E = $[C >>> 24] ^ K[n >>> 16 & 255] ^ X[d >>> 8 & 255] ^ Q[g & 255] ^ H[F++];
+              n = N, d = D, g = h, C = E;
             }
-            var N = (U[n >>> 24] << 24 | U[d >>> 16 & 255] << 16 | U[g >>> 8 & 255] << 8 | U[B & 255]) ^ H[F++], D = (U[d >>> 24] << 24 | U[g >>> 16 & 255] << 16 | U[B >>> 8 & 255] << 8 | U[n & 255]) ^ H[F++], h = (U[g >>> 24] << 24 | U[B >>> 16 & 255] << 16 | U[n >>> 8 & 255] << 8 | U[d & 255]) ^ H[F++], E = (U[B >>> 24] << 24 | U[n >>> 16 & 255] << 16 | U[d >>> 8 & 255] << 8 | U[g & 255]) ^ H[F++];
+            var N = (U[n >>> 24] << 24 | U[d >>> 16 & 255] << 16 | U[g >>> 8 & 255] << 8 | U[C & 255]) ^ H[F++], D = (U[d >>> 24] << 24 | U[g >>> 16 & 255] << 16 | U[C >>> 8 & 255] << 8 | U[n & 255]) ^ H[F++], h = (U[g >>> 24] << 24 | U[C >>> 16 & 255] << 16 | U[n >>> 8 & 255] << 8 | U[d & 255]) ^ H[F++], E = (U[C >>> 24] << 24 | U[n >>> 16 & 255] << 16 | U[d >>> 8 & 255] << 8 | U[g & 255]) ^ H[F++];
             P[T] = N, P[T + 1] = D, P[T + 2] = h, P[T + 3] = E;
           },
           keySize: 256 / 32
@@ -4821,7 +4821,7 @@ function Za() {
           8064,
           504,
           2147483679
-        ], C = x.DES = y.extend({
+        ], B = x.DES = y.extend({
           _doReset: function() {
             for (var q = this._key, S = q.words, P = [], T = 0; T < 56; T++) {
               var H = u[T] - 1;
@@ -4866,14 +4866,14 @@ function Za() {
           var P = (this._rBlock >>> q ^ this._lBlock) & S;
           this._lBlock ^= P, this._rBlock ^= P << q;
         }
-        r.DES = y._createHelper(C);
+        r.DES = y._createHelper(B);
         var k = x.TripleDES = y.extend({
           _doReset: function() {
             var q = this._key, S = q.words;
             if (S.length !== 2 && S.length !== 4 && S.length < 6)
               throw new Error("Invalid key length - 3DES requires the key length to be 64, 128, 192 or >192.");
             var P = S.slice(0, 2), T = S.length < 4 ? S.slice(0, 2) : S.slice(2, 4), H = S.length < 6 ? S.slice(0, 2) : S.slice(4, 6);
-            this._des1 = C.createEncryptor(i.create(P)), this._des2 = C.createEncryptor(i.create(T)), this._des3 = C.createEncryptor(i.create(H));
+            this._des1 = B.createEncryptor(i.create(P)), this._des2 = B.createEncryptor(i.create(T)), this._des3 = B.createEncryptor(i.create(H));
           },
           encryptBlock: function(q, S) {
             this._des1.encryptBlock(q, S), this._des2.decryptBlock(q, S), this._des3.encryptBlock(q, S);
@@ -4899,13 +4899,13 @@ function Ga() {
       return function() {
         var r = t, a = r.lib, i = a.StreamCipher, y = r.algo, x = y.RC4 = i.extend({
           _doReset: function() {
-            for (var c = this._key, v = c.words, b = c.sigBytes, C = this._S = [], w = 0; w < 256; w++)
-              C[w] = w;
+            for (var c = this._key, v = c.words, b = c.sigBytes, B = this._S = [], w = 0; w < 256; w++)
+              B[w] = w;
             for (var w = 0, R = 0; w < 256; w++) {
               var k = w % b, q = v[k >>> 2] >>> 24 - k % 4 * 8 & 255;
-              R = (R + C[w] + q) % 256;
-              var S = C[w];
-              C[w] = C[R], C[R] = S;
+              R = (R + B[w] + q) % 256;
+              var S = B[w];
+              B[w] = B[R], B[R] = S;
             }
             this._i = this._j = 0;
           },
@@ -4916,12 +4916,12 @@ function Ga() {
           ivSize: 0
         });
         function u() {
-          for (var c = this._S, v = this._i, b = this._j, C = 0, w = 0; w < 4; w++) {
+          for (var c = this._S, v = this._i, b = this._j, B = 0, w = 0; w < 4; w++) {
             v = (v + 1) % 256, b = (b + c[v]) % 256;
             var R = c[v];
-            c[v] = c[b], c[b] = R, C |= c[(c[v] + c[b]) % 256] << 24 - w * 8;
+            c[v] = c[b], c[b] = R, B |= c[(c[v] + c[b]) % 256] << 24 - w * 8;
           }
-          return this._i = v, this._j = b, C;
+          return this._i = v, this._j = b, B;
         }
         r.RC4 = i._createHelper(x);
         var o = y.RC4Drop = x.extend({
@@ -4953,7 +4953,7 @@ function Qa() {
       return function() {
         var r = t, a = r.lib, i = a.StreamCipher, y = r.algo, x = [], u = [], o = [], c = y.Rabbit = i.extend({
           _doReset: function() {
-            for (var b = this._key.words, C = this.cfg.iv, w = 0; w < 4; w++)
+            for (var b = this._key.words, B = this.cfg.iv, w = 0; w < 4; w++)
               b[w] = (b[w] << 8 | b[w] >>> 24) & 16711935 | (b[w] << 24 | b[w] >>> 8) & 4278255360;
             var R = this._X = [
               b[0],
@@ -4979,28 +4979,28 @@ function Qa() {
               v.call(this);
             for (var w = 0; w < 8; w++)
               k[w] ^= R[w + 4 & 7];
-            if (C) {
-              var q = C.words, S = q[0], P = q[1], T = (S << 8 | S >>> 24) & 16711935 | (S << 24 | S >>> 8) & 4278255360, H = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360, $ = T >>> 16 | H & 4294901760, K = H << 16 | T & 65535;
+            if (B) {
+              var q = B.words, S = q[0], P = q[1], T = (S << 8 | S >>> 24) & 16711935 | (S << 24 | S >>> 8) & 4278255360, H = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360, $ = T >>> 16 | H & 4294901760, K = H << 16 | T & 65535;
               k[0] ^= T, k[1] ^= $, k[2] ^= H, k[3] ^= K, k[4] ^= T, k[5] ^= $, k[6] ^= H, k[7] ^= K;
               for (var w = 0; w < 4; w++)
                 v.call(this);
             }
           },
-          _doProcessBlock: function(b, C) {
+          _doProcessBlock: function(b, B) {
             var w = this._X;
             v.call(this), x[0] = w[0] ^ w[5] >>> 16 ^ w[3] << 16, x[1] = w[2] ^ w[7] >>> 16 ^ w[5] << 16, x[2] = w[4] ^ w[1] >>> 16 ^ w[7] << 16, x[3] = w[6] ^ w[3] >>> 16 ^ w[1] << 16;
             for (var R = 0; R < 4; R++)
-              x[R] = (x[R] << 8 | x[R] >>> 24) & 16711935 | (x[R] << 24 | x[R] >>> 8) & 4278255360, b[C + R] ^= x[R];
+              x[R] = (x[R] << 8 | x[R] >>> 24) & 16711935 | (x[R] << 24 | x[R] >>> 8) & 4278255360, b[B + R] ^= x[R];
           },
           blockSize: 128 / 32,
           ivSize: 64 / 32
         });
         function v() {
-          for (var b = this._X, C = this._C, w = 0; w < 8; w++)
-            u[w] = C[w];
-          C[0] = C[0] + 1295307597 + this._b | 0, C[1] = C[1] + 3545052371 + (C[0] >>> 0 < u[0] >>> 0 ? 1 : 0) | 0, C[2] = C[2] + 886263092 + (C[1] >>> 0 < u[1] >>> 0 ? 1 : 0) | 0, C[3] = C[3] + 1295307597 + (C[2] >>> 0 < u[2] >>> 0 ? 1 : 0) | 0, C[4] = C[4] + 3545052371 + (C[3] >>> 0 < u[3] >>> 0 ? 1 : 0) | 0, C[5] = C[5] + 886263092 + (C[4] >>> 0 < u[4] >>> 0 ? 1 : 0) | 0, C[6] = C[6] + 1295307597 + (C[5] >>> 0 < u[5] >>> 0 ? 1 : 0) | 0, C[7] = C[7] + 3545052371 + (C[6] >>> 0 < u[6] >>> 0 ? 1 : 0) | 0, this._b = C[7] >>> 0 < u[7] >>> 0 ? 1 : 0;
+          for (var b = this._X, B = this._C, w = 0; w < 8; w++)
+            u[w] = B[w];
+          B[0] = B[0] + 1295307597 + this._b | 0, B[1] = B[1] + 3545052371 + (B[0] >>> 0 < u[0] >>> 0 ? 1 : 0) | 0, B[2] = B[2] + 886263092 + (B[1] >>> 0 < u[1] >>> 0 ? 1 : 0) | 0, B[3] = B[3] + 1295307597 + (B[2] >>> 0 < u[2] >>> 0 ? 1 : 0) | 0, B[4] = B[4] + 3545052371 + (B[3] >>> 0 < u[3] >>> 0 ? 1 : 0) | 0, B[5] = B[5] + 886263092 + (B[4] >>> 0 < u[4] >>> 0 ? 1 : 0) | 0, B[6] = B[6] + 1295307597 + (B[5] >>> 0 < u[5] >>> 0 ? 1 : 0) | 0, B[7] = B[7] + 3545052371 + (B[6] >>> 0 < u[6] >>> 0 ? 1 : 0) | 0, this._b = B[7] >>> 0 < u[7] >>> 0 ? 1 : 0;
           for (var w = 0; w < 8; w++) {
-            var R = b[w] + C[w], k = R & 65535, q = R >>> 16, S = ((k * k >>> 17) + k * q >>> 15) + q * q, P = ((R & 4294901760) * R | 0) + ((R & 65535) * R | 0);
+            var R = b[w] + B[w], k = R & 65535, q = R >>> 16, S = ((k * k >>> 17) + k * q >>> 15) + q * q, P = ((R & 4294901760) * R | 0) + ((R & 65535) * R | 0);
             o[w] = S ^ P;
           }
           b[0] = o[0] + (o[7] << 16 | o[7] >>> 16) + (o[6] << 16 | o[6] >>> 16) | 0, b[1] = o[1] + (o[0] << 8 | o[0] >>> 24) + o[7] | 0, b[2] = o[2] + (o[1] << 16 | o[1] >>> 16) + (o[0] << 16 | o[0] >>> 16) | 0, b[3] = o[3] + (o[2] << 8 | o[2] >>> 24) + o[1] | 0, b[4] = o[4] + (o[3] << 16 | o[3] >>> 16) + (o[2] << 16 | o[2] >>> 16) | 0, b[5] = o[5] + (o[4] << 8 | o[4] >>> 24) + o[3] | 0, b[6] = o[6] + (o[5] << 16 | o[5] >>> 16) + (o[4] << 16 | o[4] >>> 16) | 0, b[7] = o[7] + (o[6] << 8 | o[6] >>> 24) + o[5] | 0;
@@ -5019,7 +5019,7 @@ function Ja() {
       return function() {
         var r = t, a = r.lib, i = a.StreamCipher, y = r.algo, x = [], u = [], o = [], c = y.RabbitLegacy = i.extend({
           _doReset: function() {
-            var b = this._key.words, C = this.cfg.iv, w = this._X = [
+            var b = this._key.words, B = this.cfg.iv, w = this._X = [
               b[0],
               b[3] << 16 | b[2] >>> 16,
               b[1],
@@ -5043,28 +5043,28 @@ function Ja() {
               v.call(this);
             for (var k = 0; k < 8; k++)
               R[k] ^= w[k + 4 & 7];
-            if (C) {
-              var q = C.words, S = q[0], P = q[1], T = (S << 8 | S >>> 24) & 16711935 | (S << 24 | S >>> 8) & 4278255360, H = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360, $ = T >>> 16 | H & 4294901760, K = H << 16 | T & 65535;
+            if (B) {
+              var q = B.words, S = q[0], P = q[1], T = (S << 8 | S >>> 24) & 16711935 | (S << 24 | S >>> 8) & 4278255360, H = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360, $ = T >>> 16 | H & 4294901760, K = H << 16 | T & 65535;
               R[0] ^= T, R[1] ^= $, R[2] ^= H, R[3] ^= K, R[4] ^= T, R[5] ^= $, R[6] ^= H, R[7] ^= K;
               for (var k = 0; k < 4; k++)
                 v.call(this);
             }
           },
-          _doProcessBlock: function(b, C) {
+          _doProcessBlock: function(b, B) {
             var w = this._X;
             v.call(this), x[0] = w[0] ^ w[5] >>> 16 ^ w[3] << 16, x[1] = w[2] ^ w[7] >>> 16 ^ w[5] << 16, x[2] = w[4] ^ w[1] >>> 16 ^ w[7] << 16, x[3] = w[6] ^ w[3] >>> 16 ^ w[1] << 16;
             for (var R = 0; R < 4; R++)
-              x[R] = (x[R] << 8 | x[R] >>> 24) & 16711935 | (x[R] << 24 | x[R] >>> 8) & 4278255360, b[C + R] ^= x[R];
+              x[R] = (x[R] << 8 | x[R] >>> 24) & 16711935 | (x[R] << 24 | x[R] >>> 8) & 4278255360, b[B + R] ^= x[R];
           },
           blockSize: 128 / 32,
           ivSize: 64 / 32
         });
         function v() {
-          for (var b = this._X, C = this._C, w = 0; w < 8; w++)
-            u[w] = C[w];
-          C[0] = C[0] + 1295307597 + this._b | 0, C[1] = C[1] + 3545052371 + (C[0] >>> 0 < u[0] >>> 0 ? 1 : 0) | 0, C[2] = C[2] + 886263092 + (C[1] >>> 0 < u[1] >>> 0 ? 1 : 0) | 0, C[3] = C[3] + 1295307597 + (C[2] >>> 0 < u[2] >>> 0 ? 1 : 0) | 0, C[4] = C[4] + 3545052371 + (C[3] >>> 0 < u[3] >>> 0 ? 1 : 0) | 0, C[5] = C[5] + 886263092 + (C[4] >>> 0 < u[4] >>> 0 ? 1 : 0) | 0, C[6] = C[6] + 1295307597 + (C[5] >>> 0 < u[5] >>> 0 ? 1 : 0) | 0, C[7] = C[7] + 3545052371 + (C[6] >>> 0 < u[6] >>> 0 ? 1 : 0) | 0, this._b = C[7] >>> 0 < u[7] >>> 0 ? 1 : 0;
+          for (var b = this._X, B = this._C, w = 0; w < 8; w++)
+            u[w] = B[w];
+          B[0] = B[0] + 1295307597 + this._b | 0, B[1] = B[1] + 3545052371 + (B[0] >>> 0 < u[0] >>> 0 ? 1 : 0) | 0, B[2] = B[2] + 886263092 + (B[1] >>> 0 < u[1] >>> 0 ? 1 : 0) | 0, B[3] = B[3] + 1295307597 + (B[2] >>> 0 < u[2] >>> 0 ? 1 : 0) | 0, B[4] = B[4] + 3545052371 + (B[3] >>> 0 < u[3] >>> 0 ? 1 : 0) | 0, B[5] = B[5] + 886263092 + (B[4] >>> 0 < u[4] >>> 0 ? 1 : 0) | 0, B[6] = B[6] + 1295307597 + (B[5] >>> 0 < u[5] >>> 0 ? 1 : 0) | 0, B[7] = B[7] + 3545052371 + (B[6] >>> 0 < u[6] >>> 0 ? 1 : 0) | 0, this._b = B[7] >>> 0 < u[7] >>> 0 ? 1 : 0;
           for (var w = 0; w < 8; w++) {
-            var R = b[w] + C[w], k = R & 65535, q = R >>> 16, S = ((k * k >>> 17) + k * q >>> 15) + q * q, P = ((R & 4294901760) * R | 0) + ((R & 65535) * R | 0);
+            var R = b[w] + B[w], k = R & 65535, q = R >>> 16, S = ((k * k >>> 17) + k * q >>> 15) + q * q, P = ((R & 4294901760) * R | 0) + ((R & 65535) * R | 0);
             o[w] = S ^ P;
           }
           b[0] = o[0] + (o[7] << 16 | o[7] >>> 16) + (o[6] << 16 | o[6] >>> 16) | 0, b[1] = o[1] + (o[0] << 8 | o[0] >>> 24) + o[7] | 0, b[2] = o[2] + (o[1] << 16 | o[1] >>> 16) + (o[0] << 16 | o[0] >>> 16) | 0, b[3] = o[3] + (o[2] << 8 | o[2] >>> 24) + o[1] | 0, b[4] = o[4] + (o[3] << 16 | o[3] >>> 16) + (o[2] << 16 | o[2] >>> 16) | 0, b[5] = o[5] + (o[4] << 8 | o[4] >>> 24) + o[3] | 0, b[6] = o[6] + (o[5] << 16 | o[5] >>> 16) + (o[4] << 16 | o[4] >>> 16) | 0, b[7] = o[7] + (o[6] << 8 | o[6] >>> 24) + o[5] | 0;
@@ -6149,7 +6149,7 @@ function es() {
             P = P ^ k.pbox[$], T = v(k, P) ^ T, H = P, P = T, T = H;
           return H = P, P = T, T = H, T = T ^ k.pbox[x], P = P ^ k.pbox[x + 1], { left: P, right: T };
         }
-        function C(k, q, S) {
+        function B(k, q, S) {
           let P = q, T = S, H;
           for (let $ = x + 1; $ > 1; --$)
             P = P ^ k.pbox[$], T = v(k, P) ^ T, H = P, P = T, T = H;
@@ -6184,7 +6184,7 @@ function es() {
             k[q] = S.left, k[q + 1] = S.right;
           },
           decryptBlock: function(k, q) {
-            var S = C(c, k[q], k[q + 1]);
+            var S = B(c, k[q], k[q + 1]);
             k[q] = S.left, k[q + 1] = S.right;
           },
           blockSize: 64 / 32,
@@ -6299,8 +6299,8 @@ Hf.exports;
       if (typeof n == "object")
         return this._initArray(n, d, g);
       d === "hex" && (d = 16), r(d === (d | 0) && d >= 2 && d <= 36), n = n.toString().replace(/\s+/g, "");
-      var B = 0;
-      n[0] === "-" && (B++, this.negative = 1), B < n.length && (d === 16 ? this._parseHex(n, B, g) : (this._parseBase(n, d, B), g === "le" && this._initArray(this.toArray(), d, g)));
+      var C = 0;
+      n[0] === "-" && (C++, this.negative = 1), C < n.length && (d === 16 ? this._parseHex(n, C, g) : (this._parseBase(n, d, C), g === "le" && this._initArray(this.toArray(), d, g)));
     }, i.prototype._initNumber = function(n, d, g) {
       n < 0 && (this.negative = 1, n = -n), n < 67108864 ? (this.words = [n & 67108863], this.length = 1) : n < 4503599627370496 ? (this.words = [
         n & 67108863,
@@ -6314,15 +6314,15 @@ Hf.exports;
       if (r(typeof n.length == "number"), n.length <= 0)
         return this.words = [0], this.length = 1, this;
       this.length = Math.ceil(n.length / 3), this.words = new Array(this.length);
-      for (var B = 0; B < this.length; B++)
-        this.words[B] = 0;
+      for (var C = 0; C < this.length; C++)
+        this.words[C] = 0;
       var F, z, N = 0;
       if (g === "be")
-        for (B = n.length - 1, F = 0; B >= 0; B -= 3)
-          z = n[B] | n[B - 1] << 8 | n[B - 2] << 16, this.words[F] |= z << N & 67108863, this.words[F + 1] = z >>> 26 - N & 67108863, N += 24, N >= 26 && (N -= 26, F++);
+        for (C = n.length - 1, F = 0; C >= 0; C -= 3)
+          z = n[C] | n[C - 1] << 8 | n[C - 2] << 16, this.words[F] |= z << N & 67108863, this.words[F + 1] = z >>> 26 - N & 67108863, N += 24, N >= 26 && (N -= 26, F++);
       else if (g === "le")
-        for (B = 0, F = 0; B < n.length; B += 3)
-          z = n[B] | n[B + 1] << 8 | n[B + 2] << 16, this.words[F] |= z << N & 67108863, this.words[F + 1] = z >>> 26 - N & 67108863, N += 24, N >= 26 && (N -= 26, F++);
+        for (C = 0, F = 0; C < n.length; C += 3)
+          z = n[C] | n[C + 1] << 8 | n[C + 2] << 16, this.words[F] |= z << N & 67108863, this.words[F + 1] = z >>> 26 - N & 67108863, N += 24, N >= 26 && (N -= 26, F++);
       return this.strip();
     };
     function x(A, n) {
@@ -6335,33 +6335,33 @@ Hf.exports;
     }
     i.prototype._parseHex = function(n, d, g) {
       this.length = Math.ceil((n.length - d) / 6), this.words = new Array(this.length);
-      for (var B = 0; B < this.length; B++)
-        this.words[B] = 0;
+      for (var C = 0; C < this.length; C++)
+        this.words[C] = 0;
       var F = 0, z = 0, N;
       if (g === "be")
-        for (B = n.length - 1; B >= d; B -= 2)
-          N = u(n, d, B) << F, this.words[z] |= N & 67108863, F >= 18 ? (F -= 18, z += 1, this.words[z] |= N >>> 26) : F += 8;
+        for (C = n.length - 1; C >= d; C -= 2)
+          N = u(n, d, C) << F, this.words[z] |= N & 67108863, F >= 18 ? (F -= 18, z += 1, this.words[z] |= N >>> 26) : F += 8;
       else {
         var D = n.length - d;
-        for (B = D % 2 === 0 ? d + 1 : d; B < n.length; B += 2)
-          N = u(n, d, B) << F, this.words[z] |= N & 67108863, F >= 18 ? (F -= 18, z += 1, this.words[z] |= N >>> 26) : F += 8;
+        for (C = D % 2 === 0 ? d + 1 : d; C < n.length; C += 2)
+          N = u(n, d, C) << F, this.words[z] |= N & 67108863, F >= 18 ? (F -= 18, z += 1, this.words[z] |= N >>> 26) : F += 8;
       }
       this.strip();
     };
     function o(A, n, d, g) {
-      for (var B = 0, F = Math.min(A.length, d), z = n; z < F; z++) {
+      for (var C = 0, F = Math.min(A.length, d), z = n; z < F; z++) {
         var N = A.charCodeAt(z) - 48;
-        B *= g, N >= 49 ? B += N - 49 + 10 : N >= 17 ? B += N - 17 + 10 : B += N;
+        C *= g, N >= 49 ? C += N - 49 + 10 : N >= 17 ? C += N - 17 + 10 : C += N;
       }
-      return B;
+      return C;
     }
     i.prototype._parseBase = function(n, d, g) {
       this.words = [0], this.length = 1;
-      for (var B = 0, F = 1; F <= 67108863; F *= d)
-        B++;
-      B--, F = F / d | 0;
-      for (var z = n.length - g, N = z % B, D = Math.min(z, z - N) + g, h = 0, E = g; E < D; E += B)
-        h = o(n, E, E + B, d), this.imuln(F), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
+      for (var C = 0, F = 1; F <= 67108863; F *= d)
+        C++;
+      C--, F = F / d | 0;
+      for (var z = n.length - g, N = z % C, D = Math.min(z, z - N) + g, h = 0, E = g; E < D; E += C)
+        h = o(n, E, E + C, d), this.imuln(F), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
       if (N !== 0) {
         var j = 1;
         for (h = o(n, E, n.length, d), E = 0; E < N; E++)
@@ -6499,9 +6499,9 @@ Hf.exports;
       var g;
       if (n === 16 || n === "hex") {
         g = "";
-        for (var B = 0, F = 0, z = 0; z < this.length; z++) {
-          var N = this.words[z], D = ((N << B | F) & 16777215).toString(16);
-          F = N >>> 24 - B & 16777215, F !== 0 || z !== this.length - 1 ? g = c[6 - D.length] + D + g : g = D + g, B += 2, B >= 26 && (B -= 26, z--);
+        for (var C = 0, F = 0, z = 0; z < this.length; z++) {
+          var N = this.words[z], D = ((N << C | F) & 16777215).toString(16);
+          F = N >>> 24 - C & 16777215, F !== 0 || z !== this.length - 1 ? g = c[6 - D.length] + D + g : g = D + g, C += 2, C >= 26 && (C -= 26, z--);
         }
         for (F !== 0 && (g = F.toString(16) + g); g.length % d !== 0; )
           g = "0" + g;
@@ -6530,8 +6530,8 @@ Hf.exports;
     }, i.prototype.toArray = function(n, d) {
       return this.toArrayLike(Array, n, d);
     }, i.prototype.toArrayLike = function(n, d, g) {
-      var B = this.byteLength(), F = g || Math.max(1, B);
-      r(B <= F, "byte array longer than desired length"), r(F > 0, "Requested array length <= 0"), this.strip();
+      var C = this.byteLength(), F = g || Math.max(1, C);
+      r(C <= F, "byte array longer than desired length"), r(F > 0, "Requested array length <= 0"), this.strip();
       var z = d === "le", N = new n(F), D, h, E = this.clone();
       if (z) {
         for (h = 0; !E.isZero(); h++)
@@ -6539,7 +6539,7 @@ Hf.exports;
         for (; h < F; h++)
           N[h] = 0;
       } else {
-        for (h = 0; h < F - B; h++)
+        for (h = 0; h < F - C; h++)
           N[h] = 0;
         for (h = 0; !E.isZero(); h++)
           D = E.andln(255), E.iushrn(8), N[F - h - 1] = D;
@@ -6559,10 +6559,10 @@ Hf.exports;
       var n = this.words[this.length - 1], d = this._countBits(n);
       return (this.length - 1) * 26 + d;
     };
-    function C(A) {
+    function B(A) {
       for (var n = new Array(A.bitLength()), d = 0; d < n.length; d++) {
-        var g = d / 26 | 0, B = d % 26;
-        n[d] = (A.words[g] & 1 << B) >>> B;
+        var g = d / 26 | 0, C = d % 26;
+        n[d] = (A.words[g] & 1 << C) >>> C;
       }
       return n;
     }
@@ -6614,11 +6614,11 @@ Hf.exports;
     }, i.prototype.iuxor = function(n) {
       var d, g;
       this.length > n.length ? (d = this, g = n) : (d = n, g = this);
-      for (var B = 0; B < g.length; B++)
-        this.words[B] = d.words[B] ^ g.words[B];
+      for (var C = 0; C < g.length; C++)
+        this.words[C] = d.words[C] ^ g.words[C];
       if (this !== d)
-        for (; B < d.length; B++)
-          this.words[B] = d.words[B];
+        for (; C < d.length; C++)
+          this.words[C] = d.words[C];
       return this.length = d.length, this.strip();
     }, i.prototype.ixor = function(n) {
       return r((this.negative | n.negative) === 0), this.iuxor(n);
@@ -6630,25 +6630,25 @@ Hf.exports;
       r(typeof n == "number" && n >= 0);
       var d = Math.ceil(n / 26) | 0, g = n % 26;
       this._expand(d), g > 0 && d--;
-      for (var B = 0; B < d; B++)
-        this.words[B] = ~this.words[B] & 67108863;
-      return g > 0 && (this.words[B] = ~this.words[B] & 67108863 >> 26 - g), this.strip();
+      for (var C = 0; C < d; C++)
+        this.words[C] = ~this.words[C] & 67108863;
+      return g > 0 && (this.words[C] = ~this.words[C] & 67108863 >> 26 - g), this.strip();
     }, i.prototype.notn = function(n) {
       return this.clone().inotn(n);
     }, i.prototype.setn = function(n, d) {
       r(typeof n == "number" && n >= 0);
-      var g = n / 26 | 0, B = n % 26;
-      return this._expand(g + 1), d ? this.words[g] = this.words[g] | 1 << B : this.words[g] = this.words[g] & ~(1 << B), this.strip();
+      var g = n / 26 | 0, C = n % 26;
+      return this._expand(g + 1), d ? this.words[g] = this.words[g] | 1 << C : this.words[g] = this.words[g] & ~(1 << C), this.strip();
     }, i.prototype.iadd = function(n) {
       var d;
       if (this.negative !== 0 && n.negative === 0)
         return this.negative = 0, d = this.isub(n), this.negative ^= 1, this._normSign();
       if (this.negative === 0 && n.negative !== 0)
         return n.negative = 0, d = this.isub(n), n.negative = 1, d._normSign();
-      var g, B;
-      this.length > n.length ? (g = this, B = n) : (g = n, B = this);
-      for (var F = 0, z = 0; z < B.length; z++)
-        d = (g.words[z] | 0) + (B.words[z] | 0) + F, this.words[z] = d & 67108863, F = d >>> 26;
+      var g, C;
+      this.length > n.length ? (g = this, C = n) : (g = n, C = this);
+      for (var F = 0, z = 0; z < C.length; z++)
+        d = (g.words[z] | 0) + (C.words[z] | 0) + F, this.words[z] = d & 67108863, F = d >>> 26;
       for (; F !== 0 && z < g.length; z++)
         d = (g.words[z] | 0) + F, this.words[z] = d & 67108863, F = d >>> 26;
       if (this.length = g.length, F !== 0)
@@ -6670,16 +6670,16 @@ Hf.exports;
       var g = this.cmp(n);
       if (g === 0)
         return this.negative = 0, this.length = 1, this.words[0] = 0, this;
-      var B, F;
-      g > 0 ? (B = this, F = n) : (B = n, F = this);
+      var C, F;
+      g > 0 ? (C = this, F = n) : (C = n, F = this);
       for (var z = 0, N = 0; N < F.length; N++)
-        d = (B.words[N] | 0) - (F.words[N] | 0) + z, z = d >> 26, this.words[N] = d & 67108863;
-      for (; z !== 0 && N < B.length; N++)
-        d = (B.words[N] | 0) + z, z = d >> 26, this.words[N] = d & 67108863;
-      if (z === 0 && N < B.length && B !== this)
-        for (; N < B.length; N++)
-          this.words[N] = B.words[N];
-      return this.length = Math.max(this.length, N), B !== this && (this.negative = 1), this.strip();
+        d = (C.words[N] | 0) - (F.words[N] | 0) + z, z = d >> 26, this.words[N] = d & 67108863;
+      for (; z !== 0 && N < C.length; N++)
+        d = (C.words[N] | 0) + z, z = d >> 26, this.words[N] = d & 67108863;
+      if (z === 0 && N < C.length && C !== this)
+        for (; N < C.length; N++)
+          this.words[N] = C.words[N];
+      return this.length = Math.max(this.length, N), C !== this && (this.negative = 1), this.strip();
     }, i.prototype.sub = function(n) {
       return this.clone().isub(n);
     };
@@ -6687,19 +6687,19 @@ Hf.exports;
       d.negative = n.negative ^ A.negative;
       var g = A.length + n.length | 0;
       d.length = g, g = g - 1 | 0;
-      var B = A.words[0] | 0, F = n.words[0] | 0, z = B * F, N = z & 67108863, D = z / 67108864 | 0;
+      var C = A.words[0] | 0, F = n.words[0] | 0, z = C * F, N = z & 67108863, D = z / 67108864 | 0;
       d.words[0] = N;
       for (var h = 1; h < g; h++) {
         for (var E = D >>> 26, j = D & 67108863, Y = Math.min(h, n.length - 1), W = Math.max(0, h - A.length + 1); W <= Y; W++) {
           var re = h - W | 0;
-          B = A.words[re] | 0, F = n.words[W] | 0, z = B * F + j, E += z / 67108864 | 0, j = z & 67108863;
+          C = A.words[re] | 0, F = n.words[W] | 0, z = C * F + j, E += z / 67108864 | 0, j = z & 67108863;
         }
         d.words[h] = j | 0, D = E | 0;
       }
       return D !== 0 ? d.words[h] = D | 0 : d.length--, d.strip();
     }
     var R = function(n, d, g) {
-      var B = n.words, F = d.words, z = g.words, N = 0, D, h, E, j = B[0] | 0, Y = j & 8191, W = j >>> 13, re = B[1] | 0, ce = re & 8191, we = re >>> 13, Ae = B[2] | 0, Me = Ae & 8191, Fe = Ae >>> 13, Z0 = B[3] | 0, We = Z0 & 8191, Oe = Z0 >>> 13, _0 = B[4] | 0, Ge = _0 & 8191, Ye = _0 >>> 13, $0 = B[5] | 0, Qe = $0 & 8191, ze = $0 >>> 13, O0 = B[6] | 0, qe = O0 & 8191, Se = O0 >>> 13, F0 = B[7] | 0, Je = F0 & 8191, f0 = F0 >>> 13, S0 = B[8] | 0, Ne = S0 & 8191, u0 = S0 >>> 13, G0 = B[9] | 0, l0 = G0 & 8191, He = G0 >>> 13, z0 = F[0] | 0, a0 = z0 & 8191, r0 = z0 >>> 13, q0 = F[1] | 0, i0 = q0 & 8191, s0 = q0 >>> 13, W0 = F[2] | 0, e0 = W0 & 8191, n0 = W0 >>> 13, N0 = F[3] | 0, o0 = N0 & 8191, x0 = N0 >>> 13, D0 = F[4] | 0, t0 = D0 & 8191, Ve = D0 >>> 13, tt = F[5] | 0, c0 = tt & 8191, d0 = tt >>> 13, yt = F[6] | 0, Ie = yt & 8191, Re = yt >>> 13, l = F[7] | 0, _ = l & 8191, m = l >>> 13, s = F[8] | 0, M = s & 8191, p = s >>> 13, I = F[9] | 0, L = I & 8191, V = I >>> 13;
+      var C = n.words, F = d.words, z = g.words, N = 0, D, h, E, j = C[0] | 0, Y = j & 8191, W = j >>> 13, re = C[1] | 0, ce = re & 8191, we = re >>> 13, Ae = C[2] | 0, Me = Ae & 8191, Fe = Ae >>> 13, Z0 = C[3] | 0, We = Z0 & 8191, Oe = Z0 >>> 13, _0 = C[4] | 0, Ge = _0 & 8191, Ye = _0 >>> 13, $0 = C[5] | 0, Qe = $0 & 8191, ze = $0 >>> 13, O0 = C[6] | 0, qe = O0 & 8191, Se = O0 >>> 13, F0 = C[7] | 0, Je = F0 & 8191, f0 = F0 >>> 13, S0 = C[8] | 0, Ne = S0 & 8191, u0 = S0 >>> 13, G0 = C[9] | 0, l0 = G0 & 8191, He = G0 >>> 13, z0 = F[0] | 0, a0 = z0 & 8191, r0 = z0 >>> 13, q0 = F[1] | 0, i0 = q0 & 8191, s0 = q0 >>> 13, W0 = F[2] | 0, e0 = W0 & 8191, n0 = W0 >>> 13, N0 = F[3] | 0, o0 = N0 & 8191, x0 = N0 >>> 13, D0 = F[4] | 0, t0 = D0 & 8191, Ve = D0 >>> 13, tt = F[5] | 0, c0 = tt & 8191, d0 = tt >>> 13, yt = F[6] | 0, Ie = yt & 8191, Re = yt >>> 13, l = F[7] | 0, _ = l & 8191, m = l >>> 13, s = F[8] | 0, M = s & 8191, p = s >>> 13, I = F[9] | 0, L = I & 8191, V = I >>> 13;
       g.negative = n.negative ^ d.negative, g.length = 19, D = Math.imul(Y, a0), h = Math.imul(Y, r0), h = h + Math.imul(W, a0) | 0, E = Math.imul(W, r0);
       var ne = (N + D | 0) + ((h & 8191) << 13) | 0;
       N = (E + (h >>> 13) | 0) + (ne >>> 26) | 0, ne &= 67108863, D = Math.imul(ce, a0), h = Math.imul(ce, r0), h = h + Math.imul(we, a0) | 0, E = Math.imul(we, r0), D = D + Math.imul(Y, i0) | 0, h = h + Math.imul(Y, s0) | 0, h = h + Math.imul(W, i0) | 0, E = E + Math.imul(W, s0) | 0;
@@ -6743,14 +6743,14 @@ Hf.exports;
     Math.imul || (R = w);
     function k(A, n, d) {
       d.negative = n.negative ^ A.negative, d.length = A.length + n.length;
-      for (var g = 0, B = 0, F = 0; F < d.length - 1; F++) {
-        var z = B;
-        B = 0;
+      for (var g = 0, C = 0, F = 0; F < d.length - 1; F++) {
+        var z = C;
+        C = 0;
         for (var N = g & 67108863, D = Math.min(F, n.length - 1), h = Math.max(0, F - A.length + 1); h <= D; h++) {
           var E = F - h, j = A.words[E] | 0, Y = n.words[h] | 0, W = j * Y, re = W & 67108863;
-          z = z + (W / 67108864 | 0) | 0, re = re + N | 0, N = re & 67108863, z = z + (re >>> 26) | 0, B += z >>> 26, z &= 67108863;
+          z = z + (W / 67108864 | 0) | 0, re = re + N | 0, N = re & 67108863, z = z + (re >>> 26) | 0, C += z >>> 26, z &= 67108863;
         }
-        d.words[F] = N, g = z, z = B;
+        d.words[F] = N, g = z, z = C;
       }
       return g !== 0 ? d.words[F] = g : d.length--, d.strip();
     }
@@ -6759,54 +6759,54 @@ Hf.exports;
       return g.mulp(A, n, d);
     }
     i.prototype.mulTo = function(n, d) {
-      var g, B = this.length + n.length;
-      return this.length === 10 && n.length === 10 ? g = R(this, n, d) : B < 63 ? g = w(this, n, d) : B < 1024 ? g = k(this, n, d) : g = q(this, n, d), g;
+      var g, C = this.length + n.length;
+      return this.length === 10 && n.length === 10 ? g = R(this, n, d) : C < 63 ? g = w(this, n, d) : C < 1024 ? g = k(this, n, d) : g = q(this, n, d), g;
     };
     function S(A, n) {
       this.x = A, this.y = n;
     }
     S.prototype.makeRBT = function(n) {
-      for (var d = new Array(n), g = i.prototype._countBits(n) - 1, B = 0; B < n; B++)
-        d[B] = this.revBin(B, g, n);
+      for (var d = new Array(n), g = i.prototype._countBits(n) - 1, C = 0; C < n; C++)
+        d[C] = this.revBin(C, g, n);
       return d;
     }, S.prototype.revBin = function(n, d, g) {
       if (n === 0 || n === g - 1)
         return n;
-      for (var B = 0, F = 0; F < d; F++)
-        B |= (n & 1) << d - F - 1, n >>= 1;
-      return B;
-    }, S.prototype.permute = function(n, d, g, B, F, z) {
+      for (var C = 0, F = 0; F < d; F++)
+        C |= (n & 1) << d - F - 1, n >>= 1;
+      return C;
+    }, S.prototype.permute = function(n, d, g, C, F, z) {
       for (var N = 0; N < z; N++)
-        B[N] = d[n[N]], F[N] = g[n[N]];
-    }, S.prototype.transform = function(n, d, g, B, F, z) {
-      this.permute(z, n, d, g, B, F);
+        C[N] = d[n[N]], F[N] = g[n[N]];
+    }, S.prototype.transform = function(n, d, g, C, F, z) {
+      this.permute(z, n, d, g, C, F);
       for (var N = 1; N < F; N <<= 1)
         for (var D = N << 1, h = Math.cos(2 * Math.PI / D), E = Math.sin(2 * Math.PI / D), j = 0; j < F; j += D)
           for (var Y = h, W = E, re = 0; re < N; re++) {
-            var ce = g[j + re], we = B[j + re], Ae = g[j + re + N], Me = B[j + re + N], Fe = Y * Ae - W * Me;
-            Me = Y * Me + W * Ae, Ae = Fe, g[j + re] = ce + Ae, B[j + re] = we + Me, g[j + re + N] = ce - Ae, B[j + re + N] = we - Me, re !== D && (Fe = h * Y - E * W, W = h * W + E * Y, Y = Fe);
+            var ce = g[j + re], we = C[j + re], Ae = g[j + re + N], Me = C[j + re + N], Fe = Y * Ae - W * Me;
+            Me = Y * Me + W * Ae, Ae = Fe, g[j + re] = ce + Ae, C[j + re] = we + Me, g[j + re + N] = ce - Ae, C[j + re + N] = we - Me, re !== D && (Fe = h * Y - E * W, W = h * W + E * Y, Y = Fe);
           }
     }, S.prototype.guessLen13b = function(n, d) {
-      var g = Math.max(d, n) | 1, B = g & 1, F = 0;
+      var g = Math.max(d, n) | 1, C = g & 1, F = 0;
       for (g = g / 2 | 0; g; g = g >>> 1)
         F++;
-      return 1 << F + 1 + B;
+      return 1 << F + 1 + C;
     }, S.prototype.conjugate = function(n, d, g) {
       if (!(g <= 1))
-        for (var B = 0; B < g / 2; B++) {
-          var F = n[B];
-          n[B] = n[g - B - 1], n[g - B - 1] = F, F = d[B], d[B] = -d[g - B - 1], d[g - B - 1] = -F;
+        for (var C = 0; C < g / 2; C++) {
+          var F = n[C];
+          n[C] = n[g - C - 1], n[g - C - 1] = F, F = d[C], d[C] = -d[g - C - 1], d[g - C - 1] = -F;
         }
     }, S.prototype.normalize13b = function(n, d) {
-      for (var g = 0, B = 0; B < d / 2; B++) {
-        var F = Math.round(n[2 * B + 1] / d) * 8192 + Math.round(n[2 * B] / d) + g;
-        n[B] = F & 67108863, F < 67108864 ? g = 0 : g = F / 67108864 | 0;
+      for (var g = 0, C = 0; C < d / 2; C++) {
+        var F = Math.round(n[2 * C + 1] / d) * 8192 + Math.round(n[2 * C] / d) + g;
+        n[C] = F & 67108863, F < 67108864 ? g = 0 : g = F / 67108864 | 0;
       }
       return n;
-    }, S.prototype.convert13b = function(n, d, g, B) {
+    }, S.prototype.convert13b = function(n, d, g, C) {
       for (var F = 0, z = 0; z < d; z++)
         F = F + (n[z] | 0), g[2 * z] = F & 8191, F = F >>> 13, g[2 * z + 1] = F & 8191, F = F >>> 13;
-      for (z = 2 * d; z < B; ++z)
+      for (z = 2 * d; z < C; ++z)
         g[z] = 0;
       r(F === 0), r((F & -8192) === 0);
     }, S.prototype.stub = function(n) {
@@ -6814,13 +6814,13 @@ Hf.exports;
         d[g] = 0;
       return d;
     }, S.prototype.mulp = function(n, d, g) {
-      var B = 2 * this.guessLen13b(n.length, d.length), F = this.makeRBT(B), z = this.stub(B), N = new Array(B), D = new Array(B), h = new Array(B), E = new Array(B), j = new Array(B), Y = new Array(B), W = g.words;
-      W.length = B, this.convert13b(n.words, n.length, N, B), this.convert13b(d.words, d.length, E, B), this.transform(N, z, D, h, B, F), this.transform(E, z, j, Y, B, F);
-      for (var re = 0; re < B; re++) {
+      var C = 2 * this.guessLen13b(n.length, d.length), F = this.makeRBT(C), z = this.stub(C), N = new Array(C), D = new Array(C), h = new Array(C), E = new Array(C), j = new Array(C), Y = new Array(C), W = g.words;
+      W.length = C, this.convert13b(n.words, n.length, N, C), this.convert13b(d.words, d.length, E, C), this.transform(N, z, D, h, C, F), this.transform(E, z, j, Y, C, F);
+      for (var re = 0; re < C; re++) {
         var ce = D[re] * j[re] - h[re] * Y[re];
         h[re] = D[re] * Y[re] + h[re] * j[re], D[re] = ce;
       }
-      return this.conjugate(D, h, B), this.transform(D, h, W, z, B, F), this.conjugate(W, z, B), this.normalize13b(W, B), g.negative = n.negative ^ d.negative, g.length = n.length + d.length, g.strip();
+      return this.conjugate(D, h, C), this.transform(D, h, W, z, C, F), this.conjugate(W, z, C), this.normalize13b(W, C), g.negative = n.negative ^ d.negative, g.length = n.length + d.length, g.strip();
     }, i.prototype.mul = function(n) {
       var d = new i(null);
       return d.words = new Array(this.length + n.length), this.mulTo(n, d);
@@ -6832,8 +6832,8 @@ Hf.exports;
     }, i.prototype.imuln = function(n) {
       r(typeof n == "number"), r(n < 67108864);
       for (var d = 0, g = 0; g < this.length; g++) {
-        var B = (this.words[g] | 0) * n, F = (B & 67108863) + (d & 67108863);
-        d >>= 26, d += B / 67108864 | 0, d += F >>> 26, this.words[g] = F & 67108863;
+        var C = (this.words[g] | 0) * n, F = (C & 67108863) + (d & 67108863);
+        d >>= 26, d += C / 67108864 | 0, d += F >>> 26, this.words[g] = F & 67108863;
       }
       return d !== 0 && (this.words[g] = d, this.length++), this;
     }, i.prototype.muln = function(n) {
@@ -6843,22 +6843,22 @@ Hf.exports;
     }, i.prototype.isqr = function() {
       return this.imul(this.clone());
     }, i.prototype.pow = function(n) {
-      var d = C(n);
+      var d = B(n);
       if (d.length === 0)
         return new i(1);
-      for (var g = this, B = 0; B < d.length && d[B] === 0; B++, g = g.sqr())
+      for (var g = this, C = 0; C < d.length && d[C] === 0; C++, g = g.sqr())
         ;
-      if (++B < d.length)
-        for (var F = g.sqr(); B < d.length; B++, F = F.sqr())
-          d[B] !== 0 && (g = g.mul(F));
+      if (++C < d.length)
+        for (var F = g.sqr(); C < d.length; C++, F = F.sqr())
+          d[C] !== 0 && (g = g.mul(F));
       return g;
     }, i.prototype.iushln = function(n) {
       r(typeof n == "number" && n >= 0);
-      var d = n % 26, g = (n - d) / 26, B = 67108863 >>> 26 - d << 26 - d, F;
+      var d = n % 26, g = (n - d) / 26, C = 67108863 >>> 26 - d << 26 - d, F;
       if (d !== 0) {
         var z = 0;
         for (F = 0; F < this.length; F++) {
-          var N = this.words[F] & B, D = (this.words[F] | 0) - N << d;
+          var N = this.words[F] & C, D = (this.words[F] | 0) - N << d;
           this.words[F] = D | z, z = N >>> 26 - d;
         }
         z && (this.words[F] = z, this.length++);
@@ -6875,10 +6875,10 @@ Hf.exports;
       return r(this.negative === 0), this.iushln(n);
     }, i.prototype.iushrn = function(n, d, g) {
       r(typeof n == "number" && n >= 0);
-      var B;
-      d ? B = (d - d % 26) / 26 : B = 0;
+      var C;
+      d ? C = (d - d % 26) / 26 : C = 0;
       var F = n % 26, z = Math.min((n - F) / 26, this.length), N = 67108863 ^ 67108863 >>> F << F, D = g;
-      if (B -= z, B = Math.max(0, B), D) {
+      if (C -= z, C = Math.max(0, C), D) {
         for (var h = 0; h < z; h++)
           D.words[h] = this.words[h];
         D.length = z;
@@ -6890,7 +6890,7 @@ Hf.exports;
         else
           this.words[0] = 0, this.length = 1;
       var E = 0;
-      for (h = this.length - 1; h >= 0 && (E !== 0 || h >= B); h--) {
+      for (h = this.length - 1; h >= 0 && (E !== 0 || h >= C); h--) {
         var j = this.words[h] | 0;
         this.words[h] = E << 26 - F | j >>> F, E = j & N;
       }
@@ -6907,19 +6907,19 @@ Hf.exports;
       return this.clone().iushrn(n);
     }, i.prototype.testn = function(n) {
       r(typeof n == "number" && n >= 0);
-      var d = n % 26, g = (n - d) / 26, B = 1 << d;
+      var d = n % 26, g = (n - d) / 26, C = 1 << d;
       if (this.length <= g)
         return !1;
       var F = this.words[g];
-      return !!(F & B);
+      return !!(F & C);
     }, i.prototype.imaskn = function(n) {
       r(typeof n == "number" && n >= 0);
       var d = n % 26, g = (n - d) / 26;
       if (r(this.negative === 0, "imaskn works only with positive numbers"), this.length <= g)
         return this;
       if (d !== 0 && g++, this.length = Math.min(g, this.length), d !== 0) {
-        var B = 67108863 ^ 67108863 >>> d << d;
-        this.words[this.length - 1] &= B;
+        var C = 67108863 ^ 67108863 >>> d << d;
+        this.words[this.length - 1] &= C;
       }
       return this.strip();
     }, i.prototype.maskn = function(n) {
@@ -6951,8 +6951,8 @@ Hf.exports;
     }, i.prototype.abs = function() {
       return this.clone().iabs();
     }, i.prototype._ishlnsubmul = function(n, d, g) {
-      var B = n.length + g, F;
-      this._expand(B);
+      var C = n.length + g, F;
+      this._expand(C);
       var z, N = 0;
       for (F = 0; F < n.length; F++) {
         z = (this.words[F + g] | 0) + N;
@@ -6967,25 +6967,25 @@ Hf.exports;
         z = -(this.words[F] | 0) + N, N = z >> 26, this.words[F] = z & 67108863;
       return this.negative = 1, this.strip();
     }, i.prototype._wordDiv = function(n, d) {
-      var g = this.length - n.length, B = this.clone(), F = n, z = F.words[F.length - 1] | 0, N = this._countBits(z);
-      g = 26 - N, g !== 0 && (F = F.ushln(g), B.iushln(g), z = F.words[F.length - 1] | 0);
-      var D = B.length - F.length, h;
+      var g = this.length - n.length, C = this.clone(), F = n, z = F.words[F.length - 1] | 0, N = this._countBits(z);
+      g = 26 - N, g !== 0 && (F = F.ushln(g), C.iushln(g), z = F.words[F.length - 1] | 0);
+      var D = C.length - F.length, h;
       if (d !== "mod") {
         h = new i(null), h.length = D + 1, h.words = new Array(h.length);
         for (var E = 0; E < h.length; E++)
           h.words[E] = 0;
       }
-      var j = B.clone()._ishlnsubmul(F, 1, D);
-      j.negative === 0 && (B = j, h && (h.words[D] = 1));
+      var j = C.clone()._ishlnsubmul(F, 1, D);
+      j.negative === 0 && (C = j, h && (h.words[D] = 1));
       for (var Y = D - 1; Y >= 0; Y--) {
-        var W = (B.words[F.length + Y] | 0) * 67108864 + (B.words[F.length + Y - 1] | 0);
-        for (W = Math.min(W / z | 0, 67108863), B._ishlnsubmul(F, W, Y); B.negative !== 0; )
-          W--, B.negative = 0, B._ishlnsubmul(F, 1, Y), B.isZero() || (B.negative ^= 1);
+        var W = (C.words[F.length + Y] | 0) * 67108864 + (C.words[F.length + Y - 1] | 0);
+        for (W = Math.min(W / z | 0, 67108863), C._ishlnsubmul(F, W, Y); C.negative !== 0; )
+          W--, C.negative = 0, C._ishlnsubmul(F, 1, Y), C.isZero() || (C.negative ^= 1);
         h && (h.words[Y] = W);
       }
-      return h && h.strip(), B.strip(), d !== "div" && g !== 0 && B.iushrn(g), {
+      return h && h.strip(), C.strip(), d !== "div" && g !== 0 && C.iushrn(g), {
         div: h || null,
-        mod: B
+        mod: C
       };
     }, i.prototype.divmod = function(n, d, g) {
       if (r(!n.isZero()), this.isZero())
@@ -6993,12 +6993,12 @@ Hf.exports;
           div: new i(0),
           mod: new i(0)
         };
-      var B, F, z;
-      return this.negative !== 0 && n.negative === 0 ? (z = this.neg().divmod(n, d), d !== "mod" && (B = z.div.neg()), d !== "div" && (F = z.mod.neg(), g && F.negative !== 0 && F.iadd(n)), {
-        div: B,
+      var C, F, z;
+      return this.negative !== 0 && n.negative === 0 ? (z = this.neg().divmod(n, d), d !== "mod" && (C = z.div.neg()), d !== "div" && (F = z.mod.neg(), g && F.negative !== 0 && F.iadd(n)), {
+        div: C,
         mod: F
-      }) : this.negative === 0 && n.negative !== 0 ? (z = this.divmod(n.neg(), d), d !== "mod" && (B = z.div.neg()), {
-        div: B,
+      }) : this.negative === 0 && n.negative !== 0 ? (z = this.divmod(n.neg(), d), d !== "mod" && (C = z.div.neg()), {
+        div: C,
         mod: z.mod
       }) : this.negative & n.negative ? (z = this.neg().divmod(n.neg(), d), d !== "div" && (F = z.mod.neg(), g && F.negative !== 0 && F.isub(n)), {
         div: z.div,
@@ -7026,18 +7026,18 @@ Hf.exports;
       var d = this.divmod(n);
       if (d.mod.isZero())
         return d.div;
-      var g = d.div.negative !== 0 ? d.mod.isub(n) : d.mod, B = n.ushrn(1), F = n.andln(1), z = g.cmp(B);
+      var g = d.div.negative !== 0 ? d.mod.isub(n) : d.mod, C = n.ushrn(1), F = n.andln(1), z = g.cmp(C);
       return z < 0 || F === 1 && z === 0 ? d.div : d.div.negative !== 0 ? d.div.isubn(1) : d.div.iaddn(1);
     }, i.prototype.modn = function(n) {
       r(n <= 67108863);
-      for (var d = (1 << 26) % n, g = 0, B = this.length - 1; B >= 0; B--)
-        g = (d * g + (this.words[B] | 0)) % n;
+      for (var d = (1 << 26) % n, g = 0, C = this.length - 1; C >= 0; C--)
+        g = (d * g + (this.words[C] | 0)) % n;
       return g;
     }, i.prototype.idivn = function(n) {
       r(n <= 67108863);
       for (var d = 0, g = this.length - 1; g >= 0; g--) {
-        var B = (this.words[g] | 0) + d * 67108864;
-        this.words[g] = B / n | 0, d = B % n;
+        var C = (this.words[g] | 0) + d * 67108864;
+        this.words[g] = C / n | 0, d = C % n;
       }
       return this.strip();
     }, i.prototype.divn = function(n) {
@@ -7046,20 +7046,20 @@ Hf.exports;
       r(n.negative === 0), r(!n.isZero());
       var d = this, g = n.clone();
       d.negative !== 0 ? d = d.umod(n) : d = d.clone();
-      for (var B = new i(1), F = new i(0), z = new i(0), N = new i(1), D = 0; d.isEven() && g.isEven(); )
+      for (var C = new i(1), F = new i(0), z = new i(0), N = new i(1), D = 0; d.isEven() && g.isEven(); )
         d.iushrn(1), g.iushrn(1), ++D;
       for (var h = g.clone(), E = d.clone(); !d.isZero(); ) {
         for (var j = 0, Y = 1; !(d.words[0] & Y) && j < 26; ++j, Y <<= 1)
           ;
         if (j > 0)
           for (d.iushrn(j); j-- > 0; )
-            (B.isOdd() || F.isOdd()) && (B.iadd(h), F.isub(E)), B.iushrn(1), F.iushrn(1);
+            (C.isOdd() || F.isOdd()) && (C.iadd(h), F.isub(E)), C.iushrn(1), F.iushrn(1);
         for (var W = 0, re = 1; !(g.words[0] & re) && W < 26; ++W, re <<= 1)
           ;
         if (W > 0)
           for (g.iushrn(W); W-- > 0; )
             (z.isOdd() || N.isOdd()) && (z.iadd(h), N.isub(E)), z.iushrn(1), N.iushrn(1);
-        d.cmp(g) >= 0 ? (d.isub(g), B.isub(z), F.isub(N)) : (g.isub(d), z.isub(B), N.isub(F));
+        d.cmp(g) >= 0 ? (d.isub(g), C.isub(z), F.isub(N)) : (g.isub(d), z.isub(C), N.isub(F));
       }
       return {
         a: z,
@@ -7070,21 +7070,21 @@ Hf.exports;
       r(n.negative === 0), r(!n.isZero());
       var d = this, g = n.clone();
       d.negative !== 0 ? d = d.umod(n) : d = d.clone();
-      for (var B = new i(1), F = new i(0), z = g.clone(); d.cmpn(1) > 0 && g.cmpn(1) > 0; ) {
+      for (var C = new i(1), F = new i(0), z = g.clone(); d.cmpn(1) > 0 && g.cmpn(1) > 0; ) {
         for (var N = 0, D = 1; !(d.words[0] & D) && N < 26; ++N, D <<= 1)
           ;
         if (N > 0)
           for (d.iushrn(N); N-- > 0; )
-            B.isOdd() && B.iadd(z), B.iushrn(1);
+            C.isOdd() && C.iadd(z), C.iushrn(1);
         for (var h = 0, E = 1; !(g.words[0] & E) && h < 26; ++h, E <<= 1)
           ;
         if (h > 0)
           for (g.iushrn(h); h-- > 0; )
             F.isOdd() && F.iadd(z), F.iushrn(1);
-        d.cmp(g) >= 0 ? (d.isub(g), B.isub(F)) : (g.isub(d), F.isub(B));
+        d.cmp(g) >= 0 ? (d.isub(g), C.isub(F)) : (g.isub(d), F.isub(C));
       }
       var j;
-      return d.cmpn(1) === 0 ? j = B : j = F, j.cmpn(0) < 0 && j.iadd(n), j;
+      return d.cmpn(1) === 0 ? j = C : j = F, j.cmpn(0) < 0 && j.iadd(n), j;
     }, i.prototype.gcd = function(n) {
       if (this.isZero())
         return n.abs();
@@ -7092,7 +7092,7 @@ Hf.exports;
         return this.abs();
       var d = this.clone(), g = n.clone();
       d.negative = 0, g.negative = 0;
-      for (var B = 0; d.isEven() && g.isEven(); B++)
+      for (var C = 0; d.isEven() && g.isEven(); C++)
         d.iushrn(1), g.iushrn(1);
       do {
         for (; d.isEven(); )
@@ -7107,7 +7107,7 @@ Hf.exports;
           break;
         d.isub(g);
       } while (!0);
-      return g.iushln(B);
+      return g.iushln(C);
     }, i.prototype.invm = function(n) {
       return this.egcd(n).a.umod(n);
     }, i.prototype.isEven = function() {
@@ -7118,10 +7118,10 @@ Hf.exports;
       return this.words[0] & n;
     }, i.prototype.bincn = function(n) {
       r(typeof n == "number");
-      var d = n % 26, g = (n - d) / 26, B = 1 << d;
+      var d = n % 26, g = (n - d) / 26, C = 1 << d;
       if (this.length <= g)
-        return this._expand(g + 1), this.words[g] |= B, this;
-      for (var F = B, z = g; F !== 0 && z < this.length; z++) {
+        return this._expand(g + 1), this.words[g] |= C, this;
+      for (var F = C, z = g; F !== 0 && z < this.length; z++) {
         var N = this.words[z] | 0;
         N += F, F = N >>> 26, N &= 67108863, this.words[z] = N;
       }
@@ -7140,8 +7140,8 @@ Hf.exports;
         g = 1;
       else {
         d && (n = -n), r(n <= 67108863, "Number is too big");
-        var B = this.words[0] | 0;
-        g = B === n ? 0 : B < n ? -1 : 1;
+        var C = this.words[0] | 0;
+        g = C === n ? 0 : C < n ? -1 : 1;
       }
       return this.negative !== 0 ? -g | 0 : g;
     }, i.prototype.cmp = function(n) {
@@ -7157,9 +7157,9 @@ Hf.exports;
       if (this.length < n.length)
         return -1;
       for (var d = 0, g = this.length - 1; g >= 0; g--) {
-        var B = this.words[g] | 0, F = n.words[g] | 0;
-        if (B !== F) {
-          B < F ? d = -1 : B > F && (d = 1);
+        var C = this.words[g] | 0, F = n.words[g] | 0;
+        if (C !== F) {
+          C < F ? d = -1 : C > F && (d = 1);
           break;
         }
       }
@@ -7238,8 +7238,8 @@ Hf.exports;
       do
         this.split(d, this.tmp), d = this.imulK(d), d = d.iadd(this.tmp), g = d.bitLength();
       while (g > this.n);
-      var B = g < this.n ? -1 : d.ucmp(this.p);
-      return B === 0 ? (d.words[0] = 0, d.length = 1) : B > 0 ? d.isub(this.p) : d.strip !== void 0 ? d.strip() : d._strip(), d;
+      var C = g < this.n ? -1 : d.ucmp(this.p);
+      return C === 0 ? (d.words[0] = 0, d.length = 1) : C > 0 ? d.isub(this.p) : d.strip !== void 0 ? d.strip() : d._strip(), d;
     }, T.prototype.split = function(n, d) {
       n.iushrn(this.n, 0, d);
     }, T.prototype.imulK = function(n) {
@@ -7253,9 +7253,9 @@ Hf.exports;
       );
     }
     a(H, T), H.prototype.split = function(n, d) {
-      for (var g = 4194303, B = Math.min(n.length, 9), F = 0; F < B; F++)
+      for (var g = 4194303, C = Math.min(n.length, 9), F = 0; F < C; F++)
         d.words[F] = n.words[F];
-      if (d.length = B, n.length <= 9) {
+      if (d.length = C, n.length <= 9) {
         n.words[0] = 0, n.length = 1;
         return;
       }
@@ -7268,8 +7268,8 @@ Hf.exports;
     }, H.prototype.imulK = function(n) {
       n.words[n.length] = 0, n.words[n.length + 1] = 0, n.length += 2;
       for (var d = 0, g = 0; g < n.length; g++) {
-        var B = n.words[g] | 0;
-        d += B * 977, n.words[g] = d & 67108863, d = B * 64 + (d / 67108864 | 0);
+        var C = n.words[g] | 0;
+        d += C * 977, n.words[g] = d & 67108863, d = C * 64 + (d / 67108864 | 0);
       }
       return n.words[n.length - 1] === 0 && (n.length--, n.words[n.length - 1] === 0 && n.length--), n;
     };
@@ -7298,8 +7298,8 @@ Hf.exports;
     }
     a(X, T), X.prototype.imulK = function(n) {
       for (var d = 0, g = 0; g < n.length; g++) {
-        var B = (n.words[g] | 0) * 19 + d, F = B & 67108863;
-        B >>>= 26, n.words[g] = F, d = B;
+        var C = (n.words[g] | 0) * 19 + d, F = C & 67108863;
+        C >>>= 26, n.words[g] = F, d = C;
       }
       return d !== 0 && (n.words[n.length++] = d), n;
     }, i._prime = function(n) {
@@ -7370,13 +7370,13 @@ Hf.exports;
         var g = this.m.add(new i(1)).iushrn(2);
         return this.pow(n, g);
       }
-      for (var B = this.m.subn(1), F = 0; !B.isZero() && B.andln(1) === 0; )
-        F++, B.iushrn(1);
-      r(!B.isZero());
+      for (var C = this.m.subn(1), F = 0; !C.isZero() && C.andln(1) === 0; )
+        F++, C.iushrn(1);
+      r(!C.isZero());
       var z = new i(1).toRed(this), N = z.redNeg(), D = this.m.subn(1).iushrn(1), h = this.m.bitLength();
       for (h = new i(2 * h * h).toRed(this); this.pow(h, D).cmp(N) !== 0; )
         h.redIAdd(N);
-      for (var E = this.pow(h, B), j = this.pow(n, B.addn(1).iushrn(1)), Y = this.pow(n, B), W = F; Y.cmp(z) !== 0; ) {
+      for (var E = this.pow(h, C), j = this.pow(n, C.addn(1).iushrn(1)), Y = this.pow(n, C), W = F; Y.cmp(z) !== 0; ) {
         for (var re = Y, ce = 0; re.cmp(z) !== 0; ce++)
           re = re.redSqr();
         r(ce < W);
@@ -7392,19 +7392,19 @@ Hf.exports;
         return new i(1).toRed(this);
       if (d.cmpn(1) === 0)
         return n.clone();
-      var g = 4, B = new Array(1 << g);
-      B[0] = new i(1).toRed(this), B[1] = n;
-      for (var F = 2; F < B.length; F++)
-        B[F] = this.mul(B[F - 1], n);
-      var z = B[0], N = 0, D = 0, h = d.bitLength() % 26;
+      var g = 4, C = new Array(1 << g);
+      C[0] = new i(1).toRed(this), C[1] = n;
+      for (var F = 2; F < C.length; F++)
+        C[F] = this.mul(C[F - 1], n);
+      var z = C[0], N = 0, D = 0, h = d.bitLength() % 26;
       for (h === 0 && (h = 26), F = d.length - 1; F >= 0; F--) {
         for (var E = d.words[F], j = h - 1; j >= 0; j--) {
           var Y = E >> j & 1;
-          if (z !== B[0] && (z = this.sqr(z)), Y === 0 && N === 0) {
+          if (z !== C[0] && (z = this.sqr(z)), Y === 0 && N === 0) {
             D = 0;
             continue;
           }
-          N <<= 1, N |= Y, D++, !(D !== g && (F !== 0 || j !== 0)) && (z = this.mul(z, B[N]), D = 0, N = 0);
+          N <<= 1, N |= Y, D++, !(D !== g && (F !== 0 || j !== 0)) && (z = this.mul(z, C[N]), D = 0, N = 0);
         }
         h = 26;
       }
@@ -7429,12 +7429,12 @@ Hf.exports;
     }, U.prototype.imul = function(n, d) {
       if (n.isZero() || d.isZero())
         return n.words[0] = 0, n.length = 1, n;
-      var g = n.imul(d), B = g.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), F = g.isub(B).iushrn(this.shift), z = F;
+      var g = n.imul(d), C = g.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), F = g.isub(C).iushrn(this.shift), z = F;
       return F.cmp(this.m) >= 0 ? z = F.isub(this.m) : F.cmpn(0) < 0 && (z = F.iadd(this.m)), z._forceRed(this);
     }, U.prototype.mul = function(n, d) {
       if (n.isZero() || d.isZero())
         return new i(0)._forceRed(this);
-      var g = n.mul(d), B = g.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), F = g.isub(B).iushrn(this.shift), z = F;
+      var g = n.mul(d), C = g.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), F = g.isub(C).iushrn(this.shift), z = F;
       return F.cmp(this.m) >= 0 ? z = F.isub(this.m) : F.cmpn(0) < 0 && (z = F.iadd(this.m)), z._forceRed(this);
     }, U.prototype.invm = function(n) {
       var d = this.imod(n._invmp(this.m).mul(this.r2));
@@ -7494,15 +7494,15 @@ var Uf = {};
   var e = f, t = pt, r = Pt, a = Uf;
   e.assert = r, e.toArray = a.toArray, e.zero2 = a.zero2, e.toHex = a.toHex, e.encode = a.encode;
   function i(c, v, b) {
-    var C = new Array(Math.max(c.bitLength(), b) + 1), w;
-    for (w = 0; w < C.length; w += 1)
-      C[w] = 0;
+    var B = new Array(Math.max(c.bitLength(), b) + 1), w;
+    for (w = 0; w < B.length; w += 1)
+      B[w] = 0;
     var R = 1 << v + 1, k = c.clone();
-    for (w = 0; w < C.length; w++) {
+    for (w = 0; w < B.length; w++) {
       var q, S = k.andln(R - 1);
-      k.isOdd() ? (S > (R >> 1) - 1 ? q = (R >> 1) - S : q = S, k.isubn(q)) : q = 0, C[w] = q, k.iushrn(1);
+      k.isOdd() ? (S > (R >> 1) - 1 ? q = (R >> 1) - S : q = S, k.isubn(q)) : q = 0, B[w] = q, k.iushrn(1);
     }
-    return C;
+    return B;
   }
   e.getNAF = i;
   function y(c, v) {
@@ -7511,21 +7511,21 @@ var Uf = {};
       []
     ];
     c = c.clone(), v = v.clone();
-    for (var C = 0, w = 0, R; c.cmpn(-C) > 0 || v.cmpn(-w) > 0; ) {
-      var k = c.andln(3) + C & 3, q = v.andln(3) + w & 3;
+    for (var B = 0, w = 0, R; c.cmpn(-B) > 0 || v.cmpn(-w) > 0; ) {
+      var k = c.andln(3) + B & 3, q = v.andln(3) + w & 3;
       k === 3 && (k = -1), q === 3 && (q = -1);
       var S;
-      k & 1 ? (R = c.andln(7) + C & 7, (R === 3 || R === 5) && q === 2 ? S = -k : S = k) : S = 0, b[0].push(S);
+      k & 1 ? (R = c.andln(7) + B & 7, (R === 3 || R === 5) && q === 2 ? S = -k : S = k) : S = 0, b[0].push(S);
       var P;
-      q & 1 ? (R = v.andln(7) + w & 7, (R === 3 || R === 5) && k === 2 ? P = -q : P = q) : P = 0, b[1].push(P), 2 * C === S + 1 && (C = 1 - C), 2 * w === P + 1 && (w = 1 - w), c.iushrn(1), v.iushrn(1);
+      q & 1 ? (R = v.andln(7) + w & 7, (R === 3 || R === 5) && k === 2 ? P = -q : P = q) : P = 0, b[1].push(P), 2 * B === S + 1 && (B = 1 - B), 2 * w === P + 1 && (w = 1 - w), c.iushrn(1), v.iushrn(1);
     }
     return b;
   }
   e.getJSF = y;
   function x(c, v, b) {
-    var C = "_" + v;
+    var B = "_" + v;
     c.prototype[v] = function() {
-      return this[C] !== void 0 ? this[C] : this[C] = b.call(this);
+      return this[B] !== void 0 ? this[B] : this[B] = b.call(this);
     };
   }
   e.cachedProperty = x;
@@ -7624,8 +7624,8 @@ Et.prototype._wnafMulAdd = function(e, t, r, a, i) {
   var y = this._wnafT1, x = this._wnafT2, u = this._wnafT3, o = 0, c, v, b;
   for (c = 0; c < a; c++) {
     b = t[c];
-    var C = b._getNAFPoints(e);
-    y[c] = C.wnd, x[c] = C.points;
+    var B = b._getNAFPoints(e);
+    y[c] = B.wnd, x[c] = B.points;
   }
   for (c = a - 1; c >= 1; c -= 2) {
     var w = c - 1, R = c;
@@ -7828,7 +7828,7 @@ X0.prototype._getEndoRoots = function(e) {
   return [y, x];
 };
 X0.prototype._getEndoBasis = function(e) {
-  for (var t = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), r = e, a = this.n.clone(), i = new g0(1), y = new g0(0), x = new g0(0), u = new g0(1), o, c, v, b, C, w, R, k = 0, q, S; r.cmpn(0) !== 0; ) {
+  for (var t = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), r = e, a = this.n.clone(), i = new g0(1), y = new g0(0), x = new g0(0), u = new g0(1), o, c, v, b, B, w, R, k = 0, q, S; r.cmpn(0) !== 0; ) {
     var P = a.div(r);
     q = a.sub(P.mul(r)), S = x.sub(P.mul(i));
     var T = u.sub(P.mul(y));
@@ -7838,11 +7838,11 @@ X0.prototype._getEndoBasis = function(e) {
       break;
     R = q, a = r, r = q, x = i, i = S, u = y, y = T;
   }
-  C = q.neg(), w = S;
-  var H = v.sqr().add(b.sqr()), $ = C.sqr().add(w.sqr());
-  return $.cmp(H) >= 0 && (C = o, w = c), v.negative && (v = v.neg(), b = b.neg()), C.negative && (C = C.neg(), w = w.neg()), [
+  B = q.neg(), w = S;
+  var H = v.sqr().add(b.sqr()), $ = B.sqr().add(w.sqr());
+  return $.cmp(H) >= 0 && (B = o, w = c), v.negative && (v = v.neg(), b = b.neg()), B.negative && (B = B.neg(), w = w.neg()), [
     { a: v, b },
-    { a: C, b: w }
+    { a: B, b: w }
   ];
 };
 X0.prototype._endoSplit = function(e) {
@@ -8042,8 +8042,8 @@ R0.prototype.add = function(e) {
   var t = e.z.redSqr(), r = this.z.redSqr(), a = this.x.redMul(t), i = e.x.redMul(r), y = this.y.redMul(t.redMul(e.z)), x = e.y.redMul(r.redMul(this.z)), u = a.redSub(i), o = y.redSub(x);
   if (u.cmpn(0) === 0)
     return o.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
-  var c = u.redSqr(), v = c.redMul(u), b = a.redMul(c), C = o.redSqr().redIAdd(v).redISub(b).redISub(b), w = o.redMul(b.redISub(C)).redISub(y.redMul(v)), R = this.z.redMul(e.z).redMul(u);
-  return this.curve.jpoint(C, w, R);
+  var c = u.redSqr(), v = c.redMul(u), b = a.redMul(c), B = o.redSqr().redIAdd(v).redISub(b).redISub(b), w = o.redMul(b.redISub(B)).redISub(y.redMul(v)), R = this.z.redMul(e.z).redMul(u);
+  return this.curve.jpoint(B, w, R);
 };
 R0.prototype.mixedAdd = function(e) {
   if (this.isInfinity())
@@ -8053,8 +8053,8 @@ R0.prototype.mixedAdd = function(e) {
   var t = this.z.redSqr(), r = this.x, a = e.x.redMul(t), i = this.y, y = e.y.redMul(t).redMul(this.z), x = r.redSub(a), u = i.redSub(y);
   if (x.cmpn(0) === 0)
     return u.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
-  var o = x.redSqr(), c = o.redMul(x), v = r.redMul(o), b = u.redSqr().redIAdd(c).redISub(v).redISub(v), C = u.redMul(v.redISub(b)).redISub(i.redMul(c)), w = this.z.redMul(x);
-  return this.curve.jpoint(b, C, w);
+  var o = x.redSqr(), c = o.redMul(x), v = r.redMul(o), b = u.redSqr().redIAdd(c).redISub(v).redISub(v), B = u.redMul(v.redISub(b)).redISub(i.redMul(c)), w = this.z.redMul(x);
+  return this.curve.jpoint(b, B, w);
 };
 R0.prototype.dblp = function(e) {
   if (e === 0)
@@ -8072,10 +8072,10 @@ R0.prototype.dblp = function(e) {
   }
   var a = this.curve.a, i = this.curve.tinv, y = this.x, x = this.y, u = this.z, o = u.redSqr().redSqr(), c = x.redAdd(x);
   for (t = 0; t < e; t++) {
-    var v = y.redSqr(), b = c.redSqr(), C = b.redSqr(), w = v.redAdd(v).redIAdd(v).redIAdd(a.redMul(o)), R = y.redMul(b), k = w.redSqr().redISub(R.redAdd(R)), q = R.redISub(k), S = w.redMul(q);
-    S = S.redIAdd(S).redISub(C);
+    var v = y.redSqr(), b = c.redSqr(), B = b.redSqr(), w = v.redAdd(v).redIAdd(v).redIAdd(a.redMul(o)), R = y.redMul(b), k = w.redSqr().redISub(R.redAdd(R)), q = R.redISub(k), S = w.redMul(q);
+    S = S.redIAdd(S).redISub(B);
     var P = c.redMul(u);
-    t + 1 < e && (o = o.redMul(C)), y = k, u = P, c = S;
+    t + 1 < e && (o = o.redMul(B)), y = k, u = P, c = S;
   }
   return this.curve.jpoint(y, c.redMul(i), u);
 };
@@ -8090,9 +8090,9 @@ R0.prototype._zeroDbl = function() {
     var u = a.redAdd(a).redIAdd(a), o = u.redSqr().redISub(x).redISub(x), c = y.redIAdd(y);
     c = c.redIAdd(c), c = c.redIAdd(c), e = o, t = u.redMul(x.redISub(o)).redISub(c), r = this.y.redAdd(this.y);
   } else {
-    var v = this.x.redSqr(), b = this.y.redSqr(), C = b.redSqr(), w = this.x.redAdd(b).redSqr().redISub(v).redISub(C);
+    var v = this.x.redSqr(), b = this.y.redSqr(), B = b.redSqr(), w = this.x.redAdd(b).redSqr().redISub(v).redISub(B);
     w = w.redIAdd(w);
-    var R = v.redAdd(v).redIAdd(v), k = R.redSqr(), q = C.redIAdd(C);
+    var R = v.redAdd(v).redIAdd(v), k = R.redSqr(), q = B.redIAdd(B);
     q = q.redIAdd(q), q = q.redIAdd(q), e = k.redISub(w).redISub(w), t = R.redMul(w.redISub(e)).redISub(q), r = this.y.redMul(this.z), r = r.redIAdd(r);
   }
   return this.curve.jpoint(e, t, r);
@@ -8107,9 +8107,9 @@ R0.prototype._threeDbl = function() {
     var c = y.redIAdd(y);
     c = c.redIAdd(c), c = c.redIAdd(c), t = u.redMul(x.redISub(o)).redISub(c), r = this.y.redAdd(this.y);
   } else {
-    var v = this.z.redSqr(), b = this.y.redSqr(), C = this.x.redMul(b), w = this.x.redSub(v).redMul(this.x.redAdd(v));
+    var v = this.z.redSqr(), b = this.y.redSqr(), B = this.x.redMul(b), w = this.x.redSub(v).redMul(this.x.redAdd(v));
     w = w.redAdd(w).redIAdd(w);
-    var R = C.redIAdd(C);
+    var R = B.redIAdd(B);
     R = R.redIAdd(R);
     var k = R.redAdd(R);
     e = w.redSqr().redISub(k), r = this.y.redAdd(this.z).redSqr().redISub(b).redISub(v);
@@ -8121,9 +8121,9 @@ R0.prototype._threeDbl = function() {
 R0.prototype._dbl = function() {
   var e = this.curve.a, t = this.x, r = this.y, a = this.z, i = a.redSqr().redSqr(), y = t.redSqr(), x = r.redSqr(), u = y.redAdd(y).redIAdd(y).redIAdd(e.redMul(i)), o = t.redAdd(t);
   o = o.redIAdd(o);
-  var c = o.redMul(x), v = u.redSqr().redISub(c.redAdd(c)), b = c.redISub(v), C = x.redSqr();
-  C = C.redIAdd(C), C = C.redIAdd(C), C = C.redIAdd(C);
-  var w = u.redMul(b).redISub(C), R = r.redAdd(r).redMul(a);
+  var c = o.redMul(x), v = u.redSqr().redISub(c.redAdd(c)), b = c.redISub(v), B = x.redSqr();
+  B = B.redIAdd(B), B = B.redIAdd(B), B = B.redIAdd(B);
+  var w = u.redMul(b).redISub(B), R = r.redAdd(r).redMul(a);
   return this.curve.jpoint(v, w, R);
 };
 R0.prototype.trpl = function() {
@@ -8137,10 +8137,10 @@ R0.prototype.trpl = function() {
   v = v.redIAdd(v), v = v.redIAdd(v);
   var b = this.x.redMul(u).redISub(v);
   b = b.redIAdd(b), b = b.redIAdd(b);
-  var C = this.y.redMul(c.redMul(o.redISub(c)).redISub(x.redMul(u)));
-  C = C.redIAdd(C), C = C.redIAdd(C), C = C.redIAdd(C);
+  var B = this.y.redMul(c.redMul(o.redISub(c)).redISub(x.redMul(u)));
+  B = B.redIAdd(B), B = B.redIAdd(B), B = B.redIAdd(B);
   var w = this.z.redAdd(x).redSqr().redISub(r).redISub(u);
-  return this.curve.jpoint(b, C, w);
+  return this.curve.jpoint(b, B, w);
 };
 R0.prototype.mul = function(e, t) {
   return e = new g0(e, t), this.curve._wnafMul(this, e);
@@ -8325,8 +8325,8 @@ v0.prototype.dbl = function() {
   return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();
 };
 v0.prototype._extAdd = function(e) {
-  var t = this.y.redSub(this.x).redMul(e.y.redSub(e.x)), r = this.y.redAdd(this.x).redMul(e.y.redAdd(e.x)), a = this.t.redMul(this.curve.dd).redMul(e.t), i = this.z.redMul(e.z.redAdd(e.z)), y = r.redSub(t), x = i.redSub(a), u = i.redAdd(a), o = r.redAdd(t), c = y.redMul(x), v = u.redMul(o), b = y.redMul(o), C = x.redMul(u);
-  return this.curve.point(c, v, C, b);
+  var t = this.y.redSub(this.x).redMul(e.y.redSub(e.x)), r = this.y.redAdd(this.x).redMul(e.y.redAdd(e.x)), a = this.t.redMul(this.curve.dd).redMul(e.t), i = this.z.redMul(e.z.redAdd(e.z)), y = r.redSub(t), x = i.redSub(a), u = i.redAdd(a), o = r.redAdd(t), c = y.redMul(x), v = u.redMul(o), b = y.redMul(o), B = x.redMul(u);
+  return this.curve.point(c, v, B, b);
 };
 v0.prototype._projAdd = function(e) {
   var t = this.z.redMul(e.z), r = t.redSqr(), a = this.x.redMul(e.x), i = this.y.redMul(e.y), y = this.curve.d.redMul(a).redMul(i), x = r.redSub(y), u = r.redAdd(y), o = this.x.redAdd(this.y).redMul(e.x.redAdd(e.y)).redISub(a).redISub(i), c = t.redMul(x).redMul(o), v, b;
@@ -8739,8 +8739,8 @@ st.prototype._update = function(e, t) {
     r[a] = lo(mo(r[a - 2]), r[a - 7], go(r[a - 15]), r[a - 16]);
   var i = this.h[0], y = this.h[1], x = this.h[2], u = this.h[3], o = this.h[4], c = this.h[5], v = this.h[6], b = this.h[7];
   for (uo(this.k.length === r.length), a = 0; a < r.length; a++) {
-    var C = xo(b, yo(o), vo(o, c, v), this.k[a], r[a]), w = Q0(po(i), bo(i, y, x));
-    b = v, v = c, c = o, o = Q0(u, C), u = x, x = y, y = i, i = Q0(C, w);
+    var B = xo(b, yo(o), vo(o, c, v), this.k[a], r[a]), w = Q0(po(i), bo(i, y, x));
+    b = v, v = c, c = o, o = Q0(u, B), u = x, x = y, y = i, i = Q0(B, w);
   }
   this.h[0] = Q0(this.h[0], i), this.h[1] = Q0(this.h[1], y), this.h[2] = Q0(this.h[2], x), this.h[3] = Q0(this.h[3], u), this.h[4] = Q0(this.h[4], o), this.h[5] = Q0(this.h[5], c), this.h[6] = Q0(this.h[6], v), this.h[7] = Q0(this.h[7], b);
 };
@@ -8989,10 +8989,10 @@ et.prototype._prepareBlock = function(e, t) {
 };
 et.prototype._update = function(e, t) {
   this._prepareBlock(e, t);
-  var r = this.W, a = this.h[0], i = this.h[1], y = this.h[2], x = this.h[3], u = this.h[4], o = this.h[5], c = this.h[6], v = this.h[7], b = this.h[8], C = this.h[9], w = this.h[10], R = this.h[11], k = this.h[12], q = this.h[13], S = this.h[14], P = this.h[15];
+  var r = this.W, a = this.h[0], i = this.h[1], y = this.h[2], x = this.h[3], u = this.h[4], o = this.h[5], c = this.h[6], v = this.h[7], b = this.h[8], B = this.h[9], w = this.h[10], R = this.h[11], k = this.h[12], q = this.h[13], S = this.h[14], P = this.h[15];
   wo(this.k.length === r.length);
   for (var T = 0; T < r.length; T += 2) {
-    var H = S, $ = P, K = Oo(b, C), X = zo(b, C), Q = Do(b, C, w, R, k), U = Ro(b, C, w, R, k, q), A = this.k[T], n = this.k[T + 1], d = r[T], g = r[T + 1], B = Mo(
+    var H = S, $ = P, K = Oo(b, B), X = zo(b, B), Q = Do(b, B, w, R, k), U = Ro(b, B, w, R, k, q), A = this.k[T], n = this.k[T + 1], d = r[T], g = r[T + 1], C = Mo(
       H,
       $,
       K,
@@ -9017,9 +9017,9 @@ et.prototype._update = function(e, t) {
     );
     H = Io(a, i), $ = To(a, i), K = ko(a, i, y, x, u), X = Po(a, i, y, x, u, o);
     var z = yf(H, $, K, X), N = gf(H, $, K, X);
-    S = k, P = q, k = w, q = R, w = b, R = C, b = yf(c, v, B, F), C = gf(v, v, B, F), c = u, v = o, u = y, o = x, y = a, x = i, a = yf(B, F, z, N), i = gf(B, F, z, N);
+    S = k, P = q, k = w, q = R, w = b, R = B, b = yf(c, v, C, F), B = gf(v, v, C, F), c = u, v = o, u = y, o = x, y = a, x = i, a = yf(C, F, z, N), i = gf(C, F, z, N);
   }
-  gt(this.h, 0, a, i), gt(this.h, 2, y, x), gt(this.h, 4, u, o), gt(this.h, 6, c, v), gt(this.h, 8, b, C), gt(this.h, 10, w, R), gt(this.h, 12, k, q), gt(this.h, 14, S, P);
+  gt(this.h, 0, a, i), gt(this.h, 2, y, x), gt(this.h, 4, u, o), gt(this.h, 6, c, v), gt(this.h, 8, b, B), gt(this.h, 10, w, R), gt(this.h, 12, k, q), gt(this.h, 14, S, P);
 };
 et.prototype._digest = function(e) {
   return e === "hex" ? H0.toHex32(this.h, "big") : H0.split32(this.h, "big");
@@ -9122,18 +9122,18 @@ ot.outSize = 160;
 ot.hmacStrength = 192;
 ot.padLength = 64;
 ot.prototype._update = function(e, t) {
-  for (var r = this.h[0], a = this.h[1], i = this.h[2], y = this.h[3], x = this.h[4], u = r, o = a, c = i, v = y, b = x, C = 0; C < 80; C++) {
+  for (var r = this.h[0], a = this.h[1], i = this.h[2], y = this.h[3], x = this.h[4], u = r, o = a, c = i, v = y, b = x, B = 0; B < 80; B++) {
     var w = Ui(
       ar(
-        $i(r, Wi(C, a, i, y), e[Ko[C] + t], Wo(C)),
-        Vo[C]
+        $i(r, Wi(B, a, i, y), e[Ko[B] + t], Wo(B)),
+        Vo[B]
       ),
       x
     );
     r = x, x = y, y = ar(i, 10), i = a, a = w, w = Ui(
       ar(
-        $i(u, Wi(79 - C, o, c, v), e[jo[C] + t], Yo(C)),
-        Xo[C]
+        $i(u, Wi(79 - B, o, c, v), e[jo[B] + t], Yo(B)),
+        Xo[B]
       ),
       b
     ), u = b, b = v, v = ar(c, 10), c = o, o = w;
@@ -10652,11 +10652,11 @@ j0.prototype.sign = function(e, t, r, a) {
     if (v = this._truncateToN(v, !0), !(v.cmpn(1) <= 0 || v.cmp(o) >= 0)) {
       var b = this.g.mul(v);
       if (!b.isInfinity()) {
-        var C = b.getX(), w = C.umod(this.n);
+        var B = b.getX(), w = B.umod(this.n);
         if (w.cmpn(0) !== 0) {
           var R = v.invm(this.n).mul(w.mul(t.getPrivate()).iadd(e));
           if (R = R.umod(this.n), R.cmpn(0) !== 0) {
-            var k = (b.getY().isOdd() ? 1 : 0) | (C.cmp(w) !== 0 ? 2 : 0);
+            var k = (b.getY().isOdd() ? 1 : 0) | (B.cmp(w) !== 0 ? 2 : 0);
             return a.canonical && R.cmp(this.nh) > 0 && (R = this.n.sub(R), k ^= 1), new Dr({ r: w, s: R, recoveryParam: k });
           }
         }
@@ -10831,7 +10831,7 @@ var Kn = { exports: {} };
       throw new Error("no PRNG");
     }, a = new Uint8Array(16), i = new Uint8Array(32);
     i[0] = 9;
-    var y = t(), x = t([1]), u = t([56129, 1]), o = t([30883, 4953, 19914, 30187, 55467, 16705, 2637, 112, 59544, 30585, 16505, 36039, 65139, 11119, 27886, 20995]), c = t([61785, 9906, 39828, 60374, 45398, 33411, 5274, 224, 53552, 61171, 33010, 6542, 64743, 22239, 55772, 9222]), v = t([54554, 36645, 11616, 51542, 42930, 38181, 51040, 26924, 56412, 64982, 57905, 49316, 21502, 52590, 14035, 8553]), b = t([26200, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214]), C = t([41136, 18958, 6951, 50414, 58488, 44335, 6150, 12099, 55207, 15867, 153, 11085, 57099, 20417, 9344, 11139]);
+    var y = t(), x = t([1]), u = t([56129, 1]), o = t([30883, 4953, 19914, 30187, 55467, 16705, 2637, 112, 59544, 30585, 16505, 36039, 65139, 11119, 27886, 20995]), c = t([61785, 9906, 39828, 60374, 45398, 33411, 5274, 224, 53552, 61171, 33010, 6542, 64743, 22239, 55772, 9222]), v = t([54554, 36645, 11616, 51542, 42930, 38181, 51040, 26924, 56412, 64982, 57905, 49316, 21502, 52590, 14035, 8553]), b = t([26200, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214]), B = t([41136, 18958, 6951, 50414, 58488, 44335, 6150, 12099, 55207, 15867, 153, 11085, 57099, 20417, 9344, 11139]);
     function w(l, _, m, s) {
       l[_] = m >> 24 & 255, l[_ + 1] = m >> 16 & 255, l[_ + 2] = m >> 8 & 255, l[_ + 3] = m & 255, l[_ + 4] = s >> 24 & 255, l[_ + 5] = s >> 16 & 255, l[_ + 6] = s >> 8 & 255, l[_ + 7] = s & 255;
     }
@@ -10972,7 +10972,7 @@ var Kn = { exports: {} };
         l[p] = 0;
       return 0;
     }
-    function B(l, _, m, s, M) {
+    function C(l, _, m, s, M) {
       var p, I = new Uint8Array(32);
       if (m < 32 || (Q(I, 0, 32, s, M), d(_, 16, _, 32, m - 32, I) !== 0))
         return -1;
@@ -11077,7 +11077,7 @@ var Kn = { exports: {} };
       var s = new Uint8Array(32);
       return Me(s, m, _), H(l, a, s, $);
     }
-    var Oe = g, _0 = B;
+    var Oe = g, _0 = C;
     function Ge(l, _, m, s, M, p) {
       var I = new Uint8Array(32);
       return We(I, M, p), Oe(l, _, m, s, I);
@@ -11340,7 +11340,7 @@ var Kn = { exports: {} };
     }
     function l0(l, _) {
       var m = t(), s = t(), M = t(), p = t(), I = t(), L = t(), V = t();
-      return F(l[2], x), j(l[1], _), ce(M, l[1]), re(p, M, o), W(M, M, l[2]), Y(p, l[2], p), ce(I, p), ce(L, I), re(V, L, I), re(m, V, M), re(m, m, p), Ae(m, m), re(m, m, M), re(m, m, p), re(m, m, p), re(l[0], m, p), ce(s, l[0]), re(s, s, p), h(s, M) && re(l[0], l[0], C), ce(s, l[0]), re(s, s, p), h(s, M) ? -1 : (E(l[0]) === _[31] >> 7 && W(l[0], y, l[0]), re(l[3], l[0], l[1]), 0);
+      return F(l[2], x), j(l[1], _), ce(M, l[1]), re(p, M, o), W(M, M, l[2]), Y(p, l[2], p), ce(I, p), ce(L, I), re(V, L, I), re(m, V, M), re(m, m, p), Ae(m, m), re(m, m, M), re(m, m, p), re(m, m, p), re(l[0], m, p), ce(s, l[0]), re(s, s, p), h(s, M) && re(l[0], l[0], B), ce(s, l[0]), re(s, s, p), h(s, M) ? -1 : (E(l[0]) === _[31] >> 7 && W(l[0], y, l[0]), re(l[3], l[0], l[1]), 0);
     }
     function He(l, _, m, s) {
       var M, p = new Uint8Array(32), I = new Uint8Array(64), L = [t(), t(), t(), t()], V = [t(), t(), t(), t()];
@@ -11371,7 +11371,7 @@ var Kn = { exports: {} };
       crypto_verify_16: k,
       crypto_verify_32: q,
       crypto_secretbox: g,
-      crypto_secretbox_open: B,
+      crypto_secretbox_open: C,
       crypto_scalarmult: Me,
       crypto_scalarmult_base: Fe,
       crypto_box_beforenm: We,
@@ -11449,7 +11449,7 @@ var Kn = { exports: {} };
       Ie(l, _, m), d0(m, _);
       for (var s = new Uint8Array(q0 + l.length), M = new Uint8Array(s.length), p = 0; p < l.length; p++)
         s[p + q0] = l[p];
-      return s.length < 32 || B(M, s, s.length, _, m) !== 0 ? null : M.subarray(r0);
+      return s.length < 32 || C(M, s, s.length, _, m) !== 0 ? null : M.subarray(r0);
     }, e.secretbox.keyLength = z0, e.secretbox.nonceLength = a0, e.secretbox.overheadLength = q0, e.scalarMult = function(l, _) {
       if (Ie(l, _), l.length !== s0)
         throw new Error("bad n size");
@@ -13948,7 +13948,7 @@ class v1 {
     this.socketInstance.socket.emit("joinRoom", e);
   }
   leaveRoom(e) {
-    this.socketInstance.socket.emit("leaveRoom", e);
+    this.socketInstance.socket.emit("leaveRoom", e), this.socketInstance.socket.disconnect();
   }
   confirmMessage(e, t) {
     return this.socketInstance.socket.emit("confirmMessage", e, t);
@@ -13972,7 +13972,7 @@ class b1 {
   // 타입 가드 함수
   // eslint-disable-next-line @typescript-eslint/no-explicit-any
   isAccountCryptoType(e) {
-    return typeof e == "object" && e !== null && typeof e.signature == "string" && typeof e.publicKey == "string" && typeof e.address == "string" && typeof e.etc == "string";
+    return typeof e == "object" && e !== null && typeof e.signature == "string" && typeof e.publicKey == "string" && typeof e.address == "string" && typeof e.network == "string" && typeof e.etc == "string";
   }
   // eslint-disable-next-line @typescript-eslint/no-explicit-any
   // private isSignature(obj: any): obj is SignatureType {
@@ -14019,10 +14019,10 @@ class b1 {
         t = `${t}
 
 Nonce: ${r}`, await this.sendMessage(e, t);
-        const { publicKey: i, signature: y, address: x } = await this.getAccountCrypto();
+        const { publicKey: i, signature: y, address: x, network: u } = await this.getAccountCrypto();
         if (!jn.xphereVerify(t, i, y))
           throw new Error("Verification failed");
-        return { address: x };
+        return { address: x, network: u };
       } else
         throw new Error("Verification failed");
     } catch (a) {
@@ -14034,46 +14034,57 @@ Nonce: ${r}`, await this.sendMessage(e, t);
 }
 const p1 = new b1();
 class y1 {
-  generateQrCode(e, t) {
-    const r = ut.lib.WordArray.random(16).toString(ut.enc.Hex);
-    let a = "";
-    return e === "login" ? a = `zigap://login?roomId=${r}&dapp=${t}` : e === "send" ? a = `zigap://send?roomId=${r}&dapp=${t}` : e === "provide" && (a = `zigap://provide?roomId=${r}&dapp=${t}`), xt.joinRoom(r), {
-      qrCode: a,
-      roomId: r
+  generateQrCode(e, t, r, a) {
+    const i = ut.lib.WordArray.random(16).toString(ut.enc.Hex);
+    let y = "";
+    return e === "login" ? y = `http://172.30.1.61:3000/qrCode/scan?type=login&roomId=${i}&dapp=${t}&url=${r}&network=${a}` : e === "send" ? y = `zigap://send?roomId=${i}&dapp=${t}` : e === "provide" && (y = `zigap://provide?roomId=${i}&dapp=${t}`), xt.joinRoom(i), {
+      qrCode: y,
+      roomId: i
     };
   }
 }
-const oa = new y1(), ca = "data:image/svg+xml,%3csvg%20width='167'%20height='166'%20viewBox='0%200%20167%20166'%20fill='none'%20xmlns='http://www.w3.org/2000/svg'%3e%3cpath%20fill-rule='evenodd'%20clip-rule='evenodd'%20d='M116.052%20115.296H166.355H166.36V0H51.0675V50.3042H0.759995V165.6H116.052V115.296ZM90.3366%2065.3428L40.21%20115.296H40.4307L40.2551%20115.471H101.014V150.561H15.7981V65.3428H90.3366ZM76.7327%20100.257H151.317V15.0386H66.1006V50.1536L109.424%2050.3042H126.684L126.624%2050.364L126.669%2050.3642L113.846%2063.1431L76.7327%20100.257Z'%20fill='url(%23paint0_linear_2322_66)'/%3e%3cdefs%3e%3clinearGradient%20id='paint0_linear_2322_66'%20x1='167.74'%20y1='-2.07'%20x2='-3.37985'%20y2='172.5'%20gradientUnits='userSpaceOnUse'%3e%3cstop%20stop-color='%231349F8'/%3e%3cstop%20offset='1'%20stop-color='%235C13F8'/%3e%3c/linearGradient%3e%3c/defs%3e%3c/svg%3e", E1 = ({ dapp: f, sigMessage: e, validTime: t, onReceive: r, isShowLogo: a = !0, ...i }) => {
-  const [y, x] = qf(!0), u = jn.generateNonce(16), { qrCode: o, roomId: c } = oa.generateQrCode("login", f);
+const oa = new y1(), ca = "data:image/svg+xml,%3csvg%20width='167'%20height='166'%20viewBox='0%200%20167%20166'%20fill='none'%20xmlns='http://www.w3.org/2000/svg'%3e%3cpath%20fill-rule='evenodd'%20clip-rule='evenodd'%20d='M116.052%20115.296H166.355H166.36V0H51.0675V50.3042H0.759995V165.6H116.052V115.296ZM90.3366%2065.3428L40.21%20115.296H40.4307L40.2551%20115.471H101.014V150.561H15.7981V65.3428H90.3366ZM76.7327%20100.257H151.317V15.0386H66.1006V50.1536L109.424%2050.3042H126.684L126.624%2050.364L126.669%2050.3642L113.846%2063.1431L76.7327%20100.257Z'%20fill='url(%23paint0_linear_2322_66)'/%3e%3cdefs%3e%3clinearGradient%20id='paint0_linear_2322_66'%20x1='167.74'%20y1='-2.07'%20x2='-3.37985'%20y2='172.5'%20gradientUnits='userSpaceOnUse'%3e%3cstop%20stop-color='%231349F8'/%3e%3cstop%20offset='1'%20stop-color='%235C13F8'/%3e%3c/linearGradient%3e%3c/defs%3e%3c/svg%3e", E1 = ({
+  availableNetworks: f,
+  dapp: e,
+  url: t,
+  sigMessage: r,
+  validTime: a,
+  onReceive: i,
+  isShowLogo: y = !1,
+  logoSize: x = 30,
+  ...u
+}) => {
+  const [o, c] = qf(!0), v = jn.generateNonce(16), { qrCode: b, roomId: B } = oa.generateQrCode("login", e, t, f);
   return zt(() => {
-    const v = setTimeout(
+    const w = setTimeout(
       () => {
-        xt.leaveRoom(c), x(!1);
+        xt.leaveRoom(B), c(!1);
       },
-      t * 60 * 1e3
+      a * 60 * 1e3
     );
-    return () => clearTimeout(v);
-  }, [c, t]), zt(() => {
+    return () => clearTimeout(w);
+  }, [B, a]), zt(() => {
     (async () => {
       try {
-        console.log("roomId", c);
-        const C = {
+        console.log("roomId", B);
+        const R = await p1.qrLogin(B, r, v), k = {
           isSuccess: !0,
-          address: (await p1.qrLogin(c, e, u)).address
+          address: R.address,
+          network: R.network
         };
-        r(C);
+        i(k);
       } catch {
-        r({
+        i({
           isSuccess: !1
         });
       }
     })();
-  }, [r, e]), y ? /* @__PURE__ */ vr.jsx(
+  }, [i, r]), o ? /* @__PURE__ */ vr.jsx(
     ln,
     {
-      value: o,
-      ...a && { imageSettings: { src: ca, width: 60, height: 60, excavate: !1 } },
-      ...i
+      value: b,
+      ...y && { imageSettings: { src: ca, width: x, height: x, excavate: !1 } },
+      ...u
     }
   ) : /* @__PURE__ */ vr.jsx("div", { children: "QR loading error" });
 };
@@ -14081,7 +14092,7 @@ class g1 {
   // 타입 가드 함수
   // eslint-disable-next-line @typescript-eslint/no-explicit-any
   isAccountType(e) {
-    return typeof e == "object" && e !== null && typeof e.address == "string";
+    return typeof e == "object" && e !== null && typeof e.address == "string" && typeof e.network == "string";
   }
   getAccount() {
     return new Promise((e, t) => {
@@ -14100,36 +14111,47 @@ class g1 {
     }
   }
 }
-const m1 = new g1(), w1 = ({ dapp: f, validTime: e, onReceive: t, isShowLogo: r = !0, ...a }) => {
-  const [i, y] = qf(!0), { qrCode: x, roomId: u } = oa.generateQrCode("provide", f);
+const m1 = new g1(), w1 = ({
+  availableNetworks: f,
+  dapp: e,
+  url: t,
+  validTime: r,
+  onReceive: a,
+  isShowLogo: i = !1,
+  logoSize: y = 30,
+  ...x
+}) => {
+  const [u, o] = qf(!0), { qrCode: c, roomId: v } = oa.generateQrCode("provide", e, t, f);
   return zt(() => {
-    const o = setTimeout(
+    const b = setTimeout(
       () => {
-        xt.leaveRoom(u), y(!1);
+        xt.leaveRoom(v), o(!1);
       },
-      e * 60 * 1e3
+      r * 60 * 1e3
     );
-    return () => clearTimeout(o);
-  }, [u, e]), zt(() => {
+    return () => clearTimeout(b);
+  }, [v, r]), zt(() => {
     (async () => {
       try {
-        const v = {
+        console.log("roomId22", v);
+        const B = await m1.qrAddressProvide(v), w = {
           isSuccess: !0,
-          address: (await m1.qrAddressProvide(u)).address
+          address: B.address,
+          network: B.network
         };
-        t(v);
+        a(w);
       } catch {
-        t({
+        a({
           isSuccess: !1
         });
       }
     })();
-  }, [t]), i ? /* @__PURE__ */ vr.jsx(
+  }, [a]), u ? /* @__PURE__ */ vr.jsx(
     ln,
     {
-      value: x,
-      ...r && { imageSettings: { src: ca, width: 60, height: 60, excavate: !1 } },
-      ...a
+      value: c,
+      ...i && { imageSettings: { src: ca, width: y, height: y, excavate: !1 } },
+      ...x
     }
   ) : /* @__PURE__ */ vr.jsx("div", { children: "QR loading error" });
 };