zigap-utils 0.0.30 → 0.0.31

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (9) hide show
  1. package/README.md +1 -1
  2. package/dist/components/LoginQR/LoginQR.types.d.ts +6 -0
  3. package/dist/index.cjs.js +10 -8
  4. package/dist/index.es.js +268 -261
  5. package/dist/util/login.d.ts +2 -2
  6. package/dist/util/types.d.ts +6 -0
  7. package/dist/validation/hashing.d.ts +2 -0
  8. package/dist/validation/token.d.ts +5 -0
  9. package/package.json +1 -1
package/dist/index.es.js CHANGED
@@ -78,7 +78,7 @@ function xa() {
78
78
  var I = w && p[w] || p[R];
79
79
  return typeof I == "function" ? I : null;
80
80
  }
81
- var q = f.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;
81
+ var z = f.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;
82
82
  function S(p) {
83
83
  {
84
84
  for (var I = arguments.length, L = new Array(I > 1 ? I - 1 : 0), V = 1; V < I; V++)
@@ -88,7 +88,7 @@ function xa() {
88
88
  }
89
89
  function P(p, I, L) {
90
90
  {
91
- var V = q.ReactDebugCurrentFrame, ne = V.getStackAddendum();
91
+ var V = z.ReactDebugCurrentFrame, ne = V.getStackAddendum();
92
92
  ne !== "" && (I += "%s", L = L.concat([ne]));
93
93
  var fe = L.map(function(he) {
94
94
  return String(he);
@@ -160,14 +160,14 @@ function xa() {
160
160
  }
161
161
  return null;
162
162
  }
163
- var g = Object.assign, C = 0, F, z, N, D, h, E, j;
163
+ var g = Object.assign, C = 0, F, q, N, D, h, E, j;
164
164
  function Y() {
165
165
  }
166
166
  Y.__reactDisabledLog = !0;
167
167
  function W() {
168
168
  {
169
169
  if (C === 0) {
170
- F = console.log, z = console.info, N = console.warn, D = console.error, h = console.group, E = console.groupCollapsed, j = console.groupEnd;
170
+ F = console.log, q = console.info, N = console.warn, D = console.error, h = console.group, E = console.groupCollapsed, j = console.groupEnd;
171
171
  var p = {
172
172
  configurable: !0,
173
173
  enumerable: !0,
@@ -200,7 +200,7 @@ function xa() {
200
200
  value: F
201
201
  }),
202
202
  info: g({}, p, {
203
- value: z
203
+ value: q
204
204
  }),
205
205
  warn: g({}, p, {
206
206
  value: N
@@ -222,7 +222,7 @@ function xa() {
222
222
  C < 0 && S("disabledDepth fell below zero. This is a bug in React. Please file an issue.");
223
223
  }
224
224
  }
225
- var ce = q.ReactCurrentDispatcher, we;
225
+ var ce = z.ReactCurrentDispatcher, we;
226
226
  function Ae(p, I, L) {
227
227
  {
228
228
  if (we === void 0)
@@ -348,7 +348,7 @@ function xa() {
348
348
  }
349
349
  return "";
350
350
  }
351
- var Ye = Object.prototype.hasOwnProperty, $0 = {}, Qe = q.ReactDebugCurrentFrame;
351
+ var Ye = Object.prototype.hasOwnProperty, $0 = {}, Qe = z.ReactDebugCurrentFrame;
352
352
  function ze(p) {
353
353
  if (p) {
354
354
  var I = p._owner, L = Ge(p.type, p._source, I ? I.type : null);
@@ -399,7 +399,7 @@ function xa() {
399
399
  if (Je(p))
400
400
  return S("The provided key is an unsupported type %s. This value must be coerced to a string before before using it here.", F0(p)), f0(p);
401
401
  }
402
- var Ne = q.ReactCurrentOwner, u0 = {
402
+ var Ne = z.ReactCurrentOwner, u0 = {
403
403
  key: !0,
404
404
  ref: !0,
405
405
  __self: !0,
@@ -497,7 +497,7 @@ function xa() {
497
497
  return s0(p, te, xe, ne, V, Ne.current, he);
498
498
  }
499
499
  }
500
- var e0 = q.ReactCurrentOwner, n0 = q.ReactDebugCurrentFrame;
500
+ var e0 = z.ReactCurrentOwner, n0 = z.ReactDebugCurrentFrame;
501
501
  function N0(p) {
502
502
  if (p) {
503
503
  var I = p._owner, L = Ge(p.type, p._source, I ? I.type : null);
@@ -740,9 +740,9 @@ var St;
740
740
  k.push(T);
741
741
  }
742
742
  i(k.length == R);
743
- const q = e.getNumDataCodewords(w, o) * 8;
744
- i(k.length <= q), r(0, Math.min(4, q - k.length), k), r(0, (8 - k.length % 8) % 8, k), i(k.length % 8 == 0);
745
- for (let P = 236; k.length < q; P ^= 253)
743
+ const z = e.getNumDataCodewords(w, o) * 8;
744
+ i(k.length <= z), r(0, Math.min(4, z - k.length), k), r(0, (8 - k.length % 8) % 8, k), i(k.length % 8 == 0);
745
+ for (let P = 236; k.length < z; P ^= 253)
746
746
  r(P, 8, k);
747
747
  let S = [];
748
748
  for (; S.length * 8 < k.length; )
@@ -817,11 +817,11 @@ var St;
817
817
  throw new RangeError("Invalid argument");
818
818
  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);
819
819
  let k = [];
820
- const q = e.reedSolomonComputeDivisor(b);
820
+ const z = e.reedSolomonComputeDivisor(b);
821
821
  for (let P = 0, T = 0; P < v; P++) {
822
822
  let H = u.slice(T, T + R - b + (P < w ? 0 : 1));
823
823
  T += H.length;
824
- const $ = e.reedSolomonComputeRemainder(H, q);
824
+ const $ = e.reedSolomonComputeRemainder(H, z);
825
825
  P < w && H.push(0), k.push(H.concat($));
826
826
  }
827
827
  let S = [];
@@ -1198,8 +1198,8 @@ function ln(f) {
1198
1198
  R(!1);
1199
1199
  }, [v]);
1200
1200
  const k = ii({ height: r, width: r }, u);
1201
- let q = null;
1202
- return v != null && (q = /* @__PURE__ */ nr.createElement("img", {
1201
+ let z = null;
1202
+ return v != null && (z = /* @__PURE__ */ nr.createElement("img", {
1203
1203
  src: v,
1204
1204
  key: v,
1205
1205
  style: { display: "none" },
@@ -1212,7 +1212,7 @@ function ln(f) {
1212
1212
  height: r,
1213
1213
  width: r,
1214
1214
  ref: b
1215
- }, c)), q);
1215
+ }, c)), z);
1216
1216
  }
1217
1217
  var xn = { exports: {} };
1218
1218
  function vn(f) {
@@ -1713,11 +1713,11 @@ function $e() {
1713
1713
  */
1714
1714
  _createHmacHelper: function(S) {
1715
1715
  return function(P, T) {
1716
- return new q.HMAC.init(S, T).finalize(P);
1716
+ return new z.HMAC.init(S, T).finalize(P);
1717
1717
  };
1718
1718
  }
1719
1719
  });
1720
- var q = u.algo = {};
1720
+ var z = u.algo = {};
1721
1721
  return u;
1722
1722
  }(Math);
1723
1723
  return t;
@@ -2096,8 +2096,8 @@ function Rt() {
2096
2096
  var o = u.words, c = u.sigBytes, v = this._map;
2097
2097
  u.clamp();
2098
2098
  for (var b = [], B = 0; B < c; B += 3)
2099
- 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++)
2100
- b.push(v.charAt(q >>> 6 * (3 - S) & 63));
2099
+ 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, z = w << 16 | R << 8 | k, S = 0; S < 4 && B + S * 0.75 < c; S++)
2100
+ b.push(v.charAt(z >>> 6 * (3 - S) & 63));
2101
2101
  var P = v.charAt(64);
2102
2102
  if (P)
2103
2103
  for (; b.length % 4; )
@@ -2174,7 +2174,7 @@ function ka() {
2174
2174
  var c = u.words, v = u.sigBytes, b = o ? this._safe_map : this._map;
2175
2175
  u.clamp();
2176
2176
  for (var B = [], w = 0; w < v; w += 3)
2177
- 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++)
2177
+ for (var R = c[w >>> 2] >>> 24 - w % 4 * 8 & 255, k = c[w + 1 >>> 2] >>> 24 - (w + 1) % 4 * 8 & 255, z = c[w + 2 >>> 2] >>> 24 - (w + 2) % 4 * 8 & 255, S = R << 16 | k << 8 | z, P = 0; P < 4 && w + P * 0.75 < v; P++)
2178
2178
  B.push(b.charAt(S >>> 6 * (3 - P) & 63));
2179
2179
  var T = b.charAt(64);
2180
2180
  if (T)
@@ -2249,17 +2249,17 @@ function kt() {
2249
2249
  ]);
2250
2250
  },
2251
2251
  _doProcessBlock: function(R, k) {
2252
- for (var q = 0; q < 16; q++) {
2253
- var S = k + q, P = R[S];
2252
+ for (var z = 0; z < 16; z++) {
2253
+ var S = k + z, P = R[S];
2254
2254
  R[S] = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360;
2255
2255
  }
2256
- 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];
2257
- 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;
2256
+ 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], q = 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];
2257
+ 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, q, 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, q, 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, q, 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, q, 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;
2258
2258
  },
2259
2259
  _doFinalize: function() {
2260
- var R = this._data, k = R.words, q = this._nDataBytes * 8, S = R.sigBytes * 8;
2260
+ var R = this._data, k = R.words, z = this._nDataBytes * 8, S = R.sigBytes * 8;
2261
2261
  k[S >>> 5] |= 128 << 24 - S % 32;
2262
- var P = r.floor(q / 4294967296), T = q;
2262
+ var P = r.floor(z / 4294967296), T = z;
2263
2263
  k[(S + 64 >>> 9 << 4) + 15] = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360, k[(S + 64 >>> 9 << 4) + 14] = (T << 8 | T >>> 24) & 16711935 | (T << 24 | T >>> 8) & 4278255360, R.sigBytes = (k.length + 1) * 4, this._process();
2264
2264
  for (var H = this._hash, $ = H.words, K = 0; K < 4; K++) {
2265
2265
  var X = $[K];
@@ -2272,20 +2272,20 @@ function kt() {
2272
2272
  return R._hash = this._hash.clone(), R;
2273
2273
  }
2274
2274
  });
2275
- function v(R, k, q, S, P, T, H) {
2276
- var $ = R + (k & q | ~k & S) + P + H;
2275
+ function v(R, k, z, S, P, T, H) {
2276
+ var $ = R + (k & z | ~k & S) + P + H;
2277
2277
  return ($ << T | $ >>> 32 - T) + k;
2278
2278
  }
2279
- function b(R, k, q, S, P, T, H) {
2280
- var $ = R + (k & S | q & ~S) + P + H;
2279
+ function b(R, k, z, S, P, T, H) {
2280
+ var $ = R + (k & S | z & ~S) + P + H;
2281
2281
  return ($ << T | $ >>> 32 - T) + k;
2282
2282
  }
2283
- function B(R, k, q, S, P, T, H) {
2284
- var $ = R + (k ^ q ^ S) + P + H;
2283
+ function B(R, k, z, S, P, T, H) {
2284
+ var $ = R + (k ^ z ^ S) + P + H;
2285
2285
  return ($ << T | $ >>> 32 - T) + k;
2286
2286
  }
2287
- function w(R, k, q, S, P, T, H) {
2288
- var $ = R + (q ^ (k | ~S)) + P + H;
2287
+ function w(R, k, z, S, P, T, H) {
2288
+ var $ = R + (z ^ (k | ~S)) + P + H;
2289
2289
  return ($ << T | $ >>> 32 - T) + k;
2290
2290
  }
2291
2291
  a.MD5 = x._createHelper(c), a.HmacMD5 = x._createHmacHelper(c);
@@ -2311,17 +2311,17 @@ function bn() {
2311
2311
  ]);
2312
2312
  },
2313
2313
  _doProcessBlock: function(c, v) {
2314
- 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++) {
2314
+ for (var b = this._hash.words, B = b[0], w = b[1], R = b[2], k = b[3], z = b[4], S = 0; S < 80; S++) {
2315
2315
  if (S < 16)
2316
2316
  u[S] = c[v + S] | 0;
2317
2317
  else {
2318
2318
  var P = u[S - 3] ^ u[S - 8] ^ u[S - 14] ^ u[S - 16];
2319
2319
  u[S] = P << 1 | P >>> 31;
2320
2320
  }
2321
- var T = (B << 5 | B >>> 27) + q + u[S];
2322
- 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;
2321
+ var T = (B << 5 | B >>> 27) + z + u[S];
2322
+ 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, z = k, k = R, R = w << 30 | w >>> 2, w = B, B = T;
2323
2323
  }
2324
- 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;
2324
+ 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] + z | 0;
2325
2325
  },
2326
2326
  _doFinalize: function() {
2327
2327
  var c = this._data, v = c.words, b = this._nDataBytes * 8, B = c.sigBytes * 8;
@@ -2346,14 +2346,14 @@ function Nf() {
2346
2346
  return function(r) {
2347
2347
  var a = t, i = a.lib, y = i.WordArray, x = i.Hasher, u = a.algo, o = [], c = [];
2348
2348
  (function() {
2349
- function B(q) {
2350
- for (var S = r.sqrt(q), P = 2; P <= S; P++)
2351
- if (!(q % P))
2349
+ function B(z) {
2350
+ for (var S = r.sqrt(z), P = 2; P <= S; P++)
2351
+ if (!(z % P))
2352
2352
  return !1;
2353
2353
  return !0;
2354
2354
  }
2355
- function w(q) {
2356
- return (q - (q | 0)) * 4294967296 | 0;
2355
+ function w(z) {
2356
+ return (z - (z | 0)) * 4294967296 | 0;
2357
2357
  }
2358
2358
  for (var R = 2, k = 0; k < 64; )
2359
2359
  B(R) && (k < 8 && (o[k] = w(r.pow(R, 1 / 2))), c[k] = w(r.pow(R, 1 / 3)), k++), R++;
@@ -2363,17 +2363,17 @@ function Nf() {
2363
2363
  this._hash = new y.init(o.slice(0));
2364
2364
  },
2365
2365
  _doProcessBlock: function(B, w) {
2366
- 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++) {
2366
+ for (var R = this._hash.words, k = R[0], z = R[1], S = R[2], P = R[3], T = R[4], H = R[5], $ = R[6], K = R[7], X = 0; X < 64; X++) {
2367
2367
  if (X < 16)
2368
2368
  v[X] = B[w + X] | 0;
2369
2369
  else {
2370
2370
  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;
2371
2371
  v[X] = U + v[X - 7] + n + v[X - 16];
2372
2372
  }
2373
- 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;
2374
- K = $, $ = H, H = T, T = P + z | 0, P = S, S = q, q = k, k = z + N | 0;
2373
+ var d = T & H ^ ~T & $, g = k & z ^ k & S ^ z & 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), q = K + F + d + c[X] + v[X], N = C + g;
2374
+ K = $, $ = H, H = T, T = P + q | 0, P = S, S = z, z = k, k = q + N | 0;
2375
2375
  }
2376
- 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;
2376
+ R[0] = R[0] + k | 0, R[1] = R[1] + z | 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;
2377
2377
  },
2378
2378
  _doFinalize: function() {
2379
2379
  var B = this._data, w = B.words, R = this._nDataBytes * 8, k = B.sigBytes * 8;
@@ -2530,7 +2530,7 @@ function pn() {
2530
2530
  ]);
2531
2531
  },
2532
2532
  _doProcessBlock: function(w, R) {
2533
- 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++) {
2533
+ for (var k = this._hash.words, z = k[0], S = k[1], P = k[2], T = k[3], H = k[4], $ = k[5], K = k[6], X = k[7], Q = z.high, U = z.low, A = S.high, n = S.low, d = P.high, g = P.low, C = T.high, F = T.low, q = 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 = q, _0 = N, Ge = D, Ye = h, $0 = E, Qe = j, ze = Y, O0 = W, qe = 0; qe < 80; qe++) {
2534
2534
  var Se, F0, Je = b[qe];
2535
2535
  if (qe < 16)
2536
2536
  F0 = Je.high = w[R + qe * 2] | 0, Se = Je.low = w[R + qe * 2 + 1] | 0;
@@ -2541,11 +2541,11 @@ function pn() {
2541
2541
  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);
2542
2542
  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;
2543
2543
  }
2544
- 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);
2544
+ U = z.low = U + ce, z.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 = q + 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);
2545
2545
  },
2546
2546
  _doFinalize: function() {
2547
- var w = this._data, R = w.words, k = this._nDataBytes * 8, q = w.sigBytes * 8;
2548
- R[q >>> 5] |= 128 << 24 - q % 32, R[(q + 128 >>> 10 << 5) + 30] = Math.floor(k / 4294967296), R[(q + 128 >>> 10 << 5) + 31] = k, w.sigBytes = R.length * 4, this._process();
2547
+ var w = this._data, R = w.words, k = this._nDataBytes * 8, z = w.sigBytes * 8;
2548
+ R[z >>> 5] |= 128 << 24 - z % 32, R[(z + 128 >>> 10 << 5) + 30] = Math.floor(k / 4294967296), R[(z + 128 >>> 10 << 5) + 31] = k, w.sigBytes = R.length * 4, this._process();
2549
2549
  var S = this._hash.toX32();
2550
2550
  return S;
2551
2551
  },
@@ -2599,14 +2599,14 @@ function Ta() {
2599
2599
  return function(r) {
2600
2600
  var a = t, i = a.lib, y = i.WordArray, x = i.Hasher, u = a.x64, o = u.Word, c = a.algo, v = [], b = [], B = [];
2601
2601
  (function() {
2602
- for (var k = 1, q = 0, S = 0; S < 24; S++) {
2603
- v[k + 5 * q] = (S + 1) * (S + 2) / 2 % 64;
2604
- var P = q % 5, T = (2 * k + 3 * q) % 5;
2605
- k = P, q = T;
2602
+ for (var k = 1, z = 0, S = 0; S < 24; S++) {
2603
+ v[k + 5 * z] = (S + 1) * (S + 2) / 2 % 64;
2604
+ var P = z % 5, T = (2 * k + 3 * z) % 5;
2605
+ k = P, z = T;
2606
2606
  }
2607
2607
  for (var k = 0; k < 5; k++)
2608
- for (var q = 0; q < 5; q++)
2609
- b[k + 5 * q] = q + (2 * k + 3 * q) % 5 * 5;
2608
+ for (var z = 0; z < 5; z++)
2609
+ b[k + 5 * z] = z + (2 * k + 3 * z) % 5 * 5;
2610
2610
  for (var H = 1, $ = 0; $ < 24; $++) {
2611
2611
  for (var K = 0, X = 0, Q = 0; Q < 7; Q++) {
2612
2612
  if (H & 1) {
@@ -2636,13 +2636,13 @@ function Ta() {
2636
2636
  outputLength: 512
2637
2637
  }),
2638
2638
  _doReset: function() {
2639
- for (var k = this._state = [], q = 0; q < 25; q++)
2640
- k[q] = new o.init();
2639
+ for (var k = this._state = [], z = 0; z < 25; z++)
2640
+ k[z] = new o.init();
2641
2641
  this.blockSize = (1600 - 2 * this.cfg.outputLength) / 32;
2642
2642
  },
2643
- _doProcessBlock: function(k, q) {
2643
+ _doProcessBlock: function(k, z) {
2644
2644
  for (var S = this._state, P = this.blockSize / 2, T = 0; T < P; T++) {
2645
- var H = k[q + 2 * T], $ = k[q + 2 * T + 1];
2645
+ var H = k[z + 2 * T], $ = k[z + 2 * T + 1];
2646
2646
  H = (H << 8 | H >>> 24) & 16711935 | (H << 24 | H >>> 8) & 4278255360, $ = ($ << 8 | $ >>> 24) & 16711935 | ($ << 24 | $ >>> 8) & 4278255360;
2647
2647
  var K = S[T];
2648
2648
  K.high ^= $, K.low ^= H;
@@ -2657,7 +2657,7 @@ function Ta() {
2657
2657
  d.high = U, d.low = A;
2658
2658
  }
2659
2659
  for (var Q = 0; Q < 5; Q++)
2660
- 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++) {
2660
+ for (var g = w[(Q + 4) % 5], C = w[(Q + 1) % 5], F = C.high, q = C.low, U = g.high ^ (F << 1 | q >>> 31), A = g.low ^ (q << 1 | F >>> 31), n = 0; n < 5; n++) {
2661
2661
  var K = S[Q + 5 * n];
2662
2662
  K.high ^= U, K.low ^= A;
2663
2663
  }
@@ -2679,10 +2679,10 @@ function Ta() {
2679
2679
  }
2680
2680
  },
2681
2681
  _doFinalize: function() {
2682
- var k = this._data, q = k.words;
2682
+ var k = this._data, z = k.words;
2683
2683
  this._nDataBytes * 8;
2684
2684
  var S = k.sigBytes * 8, P = this.blockSize * 32;
2685
- q[S >>> 5] |= 1 << 24 - S % 32, q[(r.ceil((S + 1) / P) * P >>> 5) - 1] |= 128, k.sigBytes = q.length * 4, this._process();
2685
+ z[S >>> 5] |= 1 << 24 - S % 32, z[(r.ceil((S + 1) / P) * P >>> 5) - 1] |= 128, k.sigBytes = z.length * 4, this._process();
2686
2686
  for (var T = this._state, H = this.cfg.outputLength / 8, $ = H / 8, K = [], X = 0; X < $; X++) {
2687
2687
  var Q = T[X], U = Q.high, A = Q.low;
2688
2688
  U = (U << 8 | U >>> 24) & 16711935 | (U << 24 | U >>> 8) & 4278255360, A = (A << 8 | A >>> 24) & 16711935 | (A << 24 | A >>> 8) & 4278255360, K.push(A), K.push(U);
@@ -2690,8 +2690,8 @@ function Ta() {
2690
2690
  return new y.init(K, H);
2691
2691
  },
2692
2692
  clone: function() {
2693
- for (var k = x.clone.call(this), q = k._state = this._state.slice(0), S = 0; S < 25; S++)
2694
- q[S] = q[S].clone();
2693
+ for (var k = x.clone.call(this), z = k._state = this._state.slice(0), S = 0; S < 25; S++)
2694
+ z[S] = z[S].clone();
2695
2695
  return k;
2696
2696
  }
2697
2697
  });
@@ -3050,10 +3050,10 @@ function Oa() {
3050
3050
  var Q = K + X, U = $[Q];
3051
3051
  $[Q] = (U << 8 | U >>> 24) & 16711935 | (U << 24 | U >>> 8) & 4278255360;
3052
3052
  }
3053
- 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;
3053
+ var A = this._hash.words, n = B.words, d = w.words, g = o.words, C = c.words, F = v.words, q = b.words, N, D, h, E, j, Y, W, re, ce, we;
3054
3054
  Y = N = A[0], W = D = A[1], re = h = A[2], ce = E = A[3], we = j = A[4];
3055
3055
  for (var Ae, X = 0; X < 80; X += 1)
3056
- 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;
3056
+ Ae = N + $[K + g[X]] | 0, X < 16 ? Ae += k(D, h, E) + n[0] : X < 32 ? Ae += z(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 += z(W, re, ce) + d[3] : Ae += k(W, re, ce) + d[4], Ae = Ae | 0, Ae = H(Ae, q[X]), Ae = Ae + we | 0, Y = we, we = ce, ce = H(re, 10), re = W, W = Ae;
3057
3057
  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;
3058
3058
  },
3059
3059
  _doFinalize: function() {
@@ -3073,7 +3073,7 @@ function Oa() {
3073
3073
  function k($, K, X) {
3074
3074
  return $ ^ K ^ X;
3075
3075
  }
3076
- function q($, K, X) {
3076
+ function z($, K, X) {
3077
3077
  return $ & K | ~$ & X;
3078
3078
  }
3079
3079
  function S($, K, X) {
@@ -3116,8 +3116,8 @@ function Lf() {
3116
3116
  o = this._hasher = new o.init(), typeof c == "string" && (c = x.parse(c));
3117
3117
  var v = o.blockSize, b = v * 4;
3118
3118
  c.sigBytes > b && (c = o.finalize(c)), c.clamp();
3119
- for (var B = this._oKey = c.clone(), w = this._iKey = c.clone(), R = B.words, k = w.words, q = 0; q < v; q++)
3120
- R[q] ^= 1549556828, k[q] ^= 909522486;
3119
+ for (var B = this._oKey = c.clone(), w = this._iKey = c.clone(), R = B.words, k = w.words, z = 0; z < v; z++)
3120
+ R[z] ^= 1549556828, k[z] ^= 909522486;
3121
3121
  B.sigBytes = w.sigBytes = b, this.reset();
3122
3122
  },
3123
3123
  /**
@@ -3218,7 +3218,7 @@ function za() {
3218
3218
  * var key = kdf.compute(password, salt);
3219
3219
  */
3220
3220
  compute: function(v, b) {
3221
- 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; ) {
3221
+ for (var B = this.cfg, w = o.create(B.hasher, v), R = y.create(), k = y.create([1]), z = R.words, S = k.words, P = B.keySize, T = B.iterations; z.length < P; ) {
3222
3222
  var H = w.update(b).finalize(k);
3223
3223
  w.reset();
3224
3224
  for (var $ = H.words, K = $.length, X = H, Q = 1; Q < T; Q++) {
@@ -3285,13 +3285,13 @@ function At() {
3285
3285
  * var key = kdf.compute(password, salt);
3286
3286
  */
3287
3287
  compute: function(c, v) {
3288
- 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; ) {
3288
+ for (var b, B = this.cfg, w = B.hasher.create(), R = y.create(), k = R.words, z = B.keySize, S = B.iterations; k.length < z; ) {
3289
3289
  b && w.update(b), b = w.update(c).finalize(v), w.reset();
3290
3290
  for (var P = 1; P < S; P++)
3291
3291
  b = w.finalize(b), w.reset();
3292
3292
  R.concat(b);
3293
3293
  }
3294
- return R.sigBytes = q * 4, R;
3294
+ return R.sigBytes = z * 4, R;
3295
3295
  }
3296
3296
  });
3297
3297
  r.EvpKDF = function(c, v, b) {
@@ -3529,11 +3529,11 @@ function C0() {
3529
3529
  function A(n, d, g) {
3530
3530
  var C, F = this._iv;
3531
3531
  F ? (C = F, this._iv = r) : C = this._prevBlock;
3532
- for (var z = 0; z < g; z++)
3533
- n[d + z] ^= C[z];
3532
+ for (var q = 0; q < g; q++)
3533
+ n[d + q] ^= C[q];
3534
3534
  }
3535
3535
  return U;
3536
- }(), q = a.pad = {}, S = q.Pkcs7 = {
3536
+ }(), z = a.pad = {}, S = z.Pkcs7 = {
3537
3537
  /**
3538
3538
  * Pads data using the algorithm defined in PKCS #5/7.
3539
3539
  *
@@ -3549,8 +3549,8 @@ function C0() {
3549
3549
  pad: function(U, A) {
3550
3550
  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)
3551
3551
  C.push(g);
3552
- var z = x.create(C, d);
3553
- U.concat(z);
3552
+ var q = x.create(C, d);
3553
+ U.concat(q);
3554
3554
  },
3555
3555
  /**
3556
3556
  * Unpads data that had been padded using the algorithm defined in PKCS #5/7.
@@ -4130,12 +4130,12 @@ function Xa() {
4130
4130
  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;
4131
4131
  }
4132
4132
  })();
4133
- var q = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], S = y.AES = i.extend({
4133
+ var z = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], S = y.AES = i.extend({
4134
4134
  _doReset: function() {
4135
4135
  var P;
4136
4136
  if (!(this._nRounds && this._keyPriorReset === this._key)) {
4137
4137
  for (var T = this._keyPriorReset = this._key, H = T.words, $ = T.sigBytes / 4, K = this._nRounds = $ + 6, X = (K + 1) * 4, Q = this._keySchedule = [], U = 0; U < X; U++)
4138
- U < $ ? Q[U] = H[U] : (P = Q[U - 1], U % $ ? $ > 6 && U % $ == 4 && (P = x[P >>> 24] << 24 | x[P >>> 16 & 255] << 16 | x[P >>> 8 & 255] << 8 | x[P & 255]) : (P = P << 8 | P >>> 24, P = x[P >>> 24] << 24 | x[P >>> 16 & 255] << 16 | x[P >>> 8 & 255] << 8 | x[P & 255], P ^= q[U / $ | 0] << 24), Q[U] = Q[U - $] ^ P);
4138
+ U < $ ? Q[U] = H[U] : (P = Q[U - 1], U % $ ? $ > 6 && U % $ == 4 && (P = x[P >>> 24] << 24 | x[P >>> 16 & 255] << 16 | x[P >>> 8 & 255] << 8 | x[P & 255]) : (P = P << 8 | P >>> 24, P = x[P >>> 24] << 24 | x[P >>> 16 & 255] << 16 | x[P >>> 8 & 255] << 8 | x[P & 255], P ^= z[U / $ | 0] << 24), Q[U] = Q[U - $] ^ P);
4139
4139
  for (var A = this._invKeySchedule = [], n = 0; n < X; n++) {
4140
4140
  var U = X - n;
4141
4141
  if (n % 4)
@@ -4156,7 +4156,7 @@ function Xa() {
4156
4156
  P[T + 1] = P[T + 3], P[T + 3] = H;
4157
4157
  },
4158
4158
  _doCryptBlock: function(P, T, H, $, K, X, Q, U) {
4159
- 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++) {
4159
+ 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, q = 1; q < A; q++) {
4160
4160
  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++];
4161
4161
  n = N, d = D, g = h, C = E;
4162
4162
  }
@@ -4823,7 +4823,7 @@ function Za() {
4823
4823
  2147483679
4824
4824
  ], B = x.DES = y.extend({
4825
4825
  _doReset: function() {
4826
- for (var q = this._key, S = q.words, P = [], T = 0; T < 56; T++) {
4826
+ for (var z = this._key, S = z.words, P = [], T = 0; T < 56; T++) {
4827
4827
  var H = u[T] - 1;
4828
4828
  P[T] = S[H >>> 5] >>> 31 - H % 32 & 1;
4829
4829
  }
@@ -4838,48 +4838,48 @@ function Za() {
4838
4838
  for (var U = this._invSubKeys = [], T = 0; T < 16; T++)
4839
4839
  U[T] = $[15 - T];
4840
4840
  },
4841
- encryptBlock: function(q, S) {
4842
- this._doCryptBlock(q, S, this._subKeys);
4841
+ encryptBlock: function(z, S) {
4842
+ this._doCryptBlock(z, S, this._subKeys);
4843
4843
  },
4844
- decryptBlock: function(q, S) {
4845
- this._doCryptBlock(q, S, this._invSubKeys);
4844
+ decryptBlock: function(z, S) {
4845
+ this._doCryptBlock(z, S, this._invSubKeys);
4846
4846
  },
4847
- _doCryptBlock: function(q, S, P) {
4848
- this._lBlock = q[S], this._rBlock = q[S + 1], w.call(this, 4, 252645135), w.call(this, 16, 65535), R.call(this, 2, 858993459), R.call(this, 8, 16711935), w.call(this, 1, 1431655765);
4847
+ _doCryptBlock: function(z, S, P) {
4848
+ this._lBlock = z[S], this._rBlock = z[S + 1], w.call(this, 4, 252645135), w.call(this, 16, 65535), R.call(this, 2, 858993459), R.call(this, 8, 16711935), w.call(this, 1, 1431655765);
4849
4849
  for (var T = 0; T < 16; T++) {
4850
4850
  for (var H = P[T], $ = this._lBlock, K = this._rBlock, X = 0, Q = 0; Q < 8; Q++)
4851
4851
  X |= v[Q][((K ^ H[Q]) & b[Q]) >>> 0];
4852
4852
  this._lBlock = K, this._rBlock = $ ^ X;
4853
4853
  }
4854
4854
  var U = this._lBlock;
4855
- this._lBlock = this._rBlock, this._rBlock = U, w.call(this, 1, 1431655765), R.call(this, 8, 16711935), R.call(this, 2, 858993459), w.call(this, 16, 65535), w.call(this, 4, 252645135), q[S] = this._lBlock, q[S + 1] = this._rBlock;
4855
+ this._lBlock = this._rBlock, this._rBlock = U, w.call(this, 1, 1431655765), R.call(this, 8, 16711935), R.call(this, 2, 858993459), w.call(this, 16, 65535), w.call(this, 4, 252645135), z[S] = this._lBlock, z[S + 1] = this._rBlock;
4856
4856
  },
4857
4857
  keySize: 64 / 32,
4858
4858
  ivSize: 64 / 32,
4859
4859
  blockSize: 64 / 32
4860
4860
  });
4861
- function w(q, S) {
4862
- var P = (this._lBlock >>> q ^ this._rBlock) & S;
4863
- this._rBlock ^= P, this._lBlock ^= P << q;
4861
+ function w(z, S) {
4862
+ var P = (this._lBlock >>> z ^ this._rBlock) & S;
4863
+ this._rBlock ^= P, this._lBlock ^= P << z;
4864
4864
  }
4865
- function R(q, S) {
4866
- var P = (this._rBlock >>> q ^ this._lBlock) & S;
4867
- this._lBlock ^= P, this._rBlock ^= P << q;
4865
+ function R(z, S) {
4866
+ var P = (this._rBlock >>> z ^ this._lBlock) & S;
4867
+ this._lBlock ^= P, this._rBlock ^= P << z;
4868
4868
  }
4869
4869
  r.DES = y._createHelper(B);
4870
4870
  var k = x.TripleDES = y.extend({
4871
4871
  _doReset: function() {
4872
- var q = this._key, S = q.words;
4872
+ var z = this._key, S = z.words;
4873
4873
  if (S.length !== 2 && S.length !== 4 && S.length < 6)
4874
4874
  throw new Error("Invalid key length - 3DES requires the key length to be 64, 128, 192 or >192.");
4875
4875
  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);
4876
4876
  this._des1 = B.createEncryptor(i.create(P)), this._des2 = B.createEncryptor(i.create(T)), this._des3 = B.createEncryptor(i.create(H));
4877
4877
  },
4878
- encryptBlock: function(q, S) {
4879
- this._des1.encryptBlock(q, S), this._des2.decryptBlock(q, S), this._des3.encryptBlock(q, S);
4878
+ encryptBlock: function(z, S) {
4879
+ this._des1.encryptBlock(z, S), this._des2.decryptBlock(z, S), this._des3.encryptBlock(z, S);
4880
4880
  },
4881
- decryptBlock: function(q, S) {
4882
- this._des3.decryptBlock(q, S), this._des2.encryptBlock(q, S), this._des1.decryptBlock(q, S);
4881
+ decryptBlock: function(z, S) {
4882
+ this._des3.decryptBlock(z, S), this._des2.encryptBlock(z, S), this._des1.decryptBlock(z, S);
4883
4883
  },
4884
4884
  keySize: 192 / 32,
4885
4885
  ivSize: 64 / 32,
@@ -4902,8 +4902,8 @@ function Ga() {
4902
4902
  for (var c = this._key, v = c.words, b = c.sigBytes, B = this._S = [], w = 0; w < 256; w++)
4903
4903
  B[w] = w;
4904
4904
  for (var w = 0, R = 0; w < 256; w++) {
4905
- var k = w % b, q = v[k >>> 2] >>> 24 - k % 4 * 8 & 255;
4906
- R = (R + B[w] + q) % 256;
4905
+ var k = w % b, z = v[k >>> 2] >>> 24 - k % 4 * 8 & 255;
4906
+ R = (R + B[w] + z) % 256;
4907
4907
  var S = B[w];
4908
4908
  B[w] = B[R], B[R] = S;
4909
4909
  }
@@ -4980,7 +4980,7 @@ function Qa() {
4980
4980
  for (var w = 0; w < 8; w++)
4981
4981
  k[w] ^= R[w + 4 & 7];
4982
4982
  if (B) {
4983
- 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;
4983
+ var z = B.words, S = z[0], P = z[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;
4984
4984
  k[0] ^= T, k[1] ^= $, k[2] ^= H, k[3] ^= K, k[4] ^= T, k[5] ^= $, k[6] ^= H, k[7] ^= K;
4985
4985
  for (var w = 0; w < 4; w++)
4986
4986
  v.call(this);
@@ -5000,7 +5000,7 @@ function Qa() {
5000
5000
  u[w] = B[w];
5001
5001
  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;
5002
5002
  for (var w = 0; w < 8; w++) {
5003
- 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);
5003
+ var R = b[w] + B[w], k = R & 65535, z = R >>> 16, S = ((k * k >>> 17) + k * z >>> 15) + z * z, P = ((R & 4294901760) * R | 0) + ((R & 65535) * R | 0);
5004
5004
  o[w] = S ^ P;
5005
5005
  }
5006
5006
  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;
@@ -5044,7 +5044,7 @@ function Ja() {
5044
5044
  for (var k = 0; k < 8; k++)
5045
5045
  R[k] ^= w[k + 4 & 7];
5046
5046
  if (B) {
5047
- 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;
5047
+ var z = B.words, S = z[0], P = z[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;
5048
5048
  R[0] ^= T, R[1] ^= $, R[2] ^= H, R[3] ^= K, R[4] ^= T, R[5] ^= $, R[6] ^= H, R[7] ^= K;
5049
5049
  for (var k = 0; k < 4; k++)
5050
5050
  v.call(this);
@@ -5064,7 +5064,7 @@ function Ja() {
5064
5064
  u[w] = B[w];
5065
5065
  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;
5066
5066
  for (var w = 0; w < 8; w++) {
5067
- 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);
5067
+ var R = b[w] + B[w], k = R & 65535, z = R >>> 16, S = ((k * k >>> 17) + k * z >>> 15) + z * z, P = ((R & 4294901760) * R | 0) + ((R & 65535) * R | 0);
5068
5068
  o[w] = S ^ P;
5069
5069
  }
5070
5070
  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;
@@ -6139,23 +6139,23 @@ function es() {
6139
6139
  pbox: [],
6140
6140
  sbox: []
6141
6141
  };
6142
- function v(k, q) {
6143
- let S = q >> 24 & 255, P = q >> 16 & 255, T = q >> 8 & 255, H = q & 255, $ = k.sbox[0][S] + k.sbox[1][P];
6142
+ function v(k, z) {
6143
+ let S = z >> 24 & 255, P = z >> 16 & 255, T = z >> 8 & 255, H = z & 255, $ = k.sbox[0][S] + k.sbox[1][P];
6144
6144
  return $ = $ ^ k.sbox[2][T], $ = $ + k.sbox[3][H], $;
6145
6145
  }
6146
- function b(k, q, S) {
6147
- let P = q, T = S, H;
6146
+ function b(k, z, S) {
6147
+ let P = z, T = S, H;
6148
6148
  for (let $ = 0; $ < x; ++$)
6149
6149
  P = P ^ k.pbox[$], T = v(k, P) ^ T, H = P, P = T, T = H;
6150
6150
  return H = P, P = T, T = H, T = T ^ k.pbox[x], P = P ^ k.pbox[x + 1], { left: P, right: T };
6151
6151
  }
6152
- function B(k, q, S) {
6153
- let P = q, T = S, H;
6152
+ function B(k, z, S) {
6153
+ let P = z, T = S, H;
6154
6154
  for (let $ = x + 1; $ > 1; --$)
6155
6155
  P = P ^ k.pbox[$], T = v(k, P) ^ T, H = P, P = T, T = H;
6156
6156
  return H = P, P = T, T = H, T = T ^ k.pbox[1], P = P ^ k.pbox[0], { left: P, right: T };
6157
6157
  }
6158
- function w(k, q, S) {
6158
+ function w(k, z, S) {
6159
6159
  for (let K = 0; K < 4; K++) {
6160
6160
  k.sbox[K] = [];
6161
6161
  for (let X = 0; X < 256; X++)
@@ -6163,7 +6163,7 @@ function es() {
6163
6163
  }
6164
6164
  let P = 0;
6165
6165
  for (let K = 0; K < x + 2; K++)
6166
- k.pbox[K] = u[K] ^ q[P], P++, P >= S && (P = 0);
6166
+ k.pbox[K] = u[K] ^ z[P], P++, P >= S && (P = 0);
6167
6167
  let T = 0, H = 0, $ = 0;
6168
6168
  for (let K = 0; K < x + 2; K += 2)
6169
6169
  $ = b(k, T, H), T = $.left, H = $.right, k.pbox[K] = T, k.pbox[K + 1] = H;
@@ -6175,17 +6175,17 @@ function es() {
6175
6175
  var R = y.Blowfish = i.extend({
6176
6176
  _doReset: function() {
6177
6177
  if (this._keyPriorReset !== this._key) {
6178
- var k = this._keyPriorReset = this._key, q = k.words, S = k.sigBytes / 4;
6179
- w(c, q, S);
6178
+ var k = this._keyPriorReset = this._key, z = k.words, S = k.sigBytes / 4;
6179
+ w(c, z, S);
6180
6180
  }
6181
6181
  },
6182
- encryptBlock: function(k, q) {
6183
- var S = b(c, k[q], k[q + 1]);
6184
- k[q] = S.left, k[q + 1] = S.right;
6182
+ encryptBlock: function(k, z) {
6183
+ var S = b(c, k[z], k[z + 1]);
6184
+ k[z] = S.left, k[z + 1] = S.right;
6185
6185
  },
6186
- decryptBlock: function(k, q) {
6187
- var S = B(c, k[q], k[q + 1]);
6188
- k[q] = S.left, k[q + 1] = S.right;
6186
+ decryptBlock: function(k, z) {
6187
+ var S = B(c, k[z], k[z + 1]);
6188
+ k[z] = S.left, k[z + 1] = S.right;
6189
6189
  },
6190
6190
  blockSize: 64 / 32,
6191
6191
  keySize: 128 / 32,
@@ -6316,13 +6316,13 @@ Hf.exports;
6316
6316
  this.length = Math.ceil(n.length / 3), this.words = new Array(this.length);
6317
6317
  for (var C = 0; C < this.length; C++)
6318
6318
  this.words[C] = 0;
6319
- var F, z, N = 0;
6319
+ var F, q, N = 0;
6320
6320
  if (g === "be")
6321
6321
  for (C = n.length - 1, F = 0; C >= 0; C -= 3)
6322
- 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++);
6322
+ q = n[C] | n[C - 1] << 8 | n[C - 2] << 16, this.words[F] |= q << N & 67108863, this.words[F + 1] = q >>> 26 - N & 67108863, N += 24, N >= 26 && (N -= 26, F++);
6323
6323
  else if (g === "le")
6324
6324
  for (C = 0, F = 0; C < n.length; C += 3)
6325
- 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++);
6325
+ q = n[C] | n[C + 1] << 8 | n[C + 2] << 16, this.words[F] |= q << N & 67108863, this.words[F + 1] = q >>> 26 - N & 67108863, N += 24, N >= 26 && (N -= 26, F++);
6326
6326
  return this.strip();
6327
6327
  };
6328
6328
  function x(A, n) {
@@ -6337,20 +6337,20 @@ Hf.exports;
6337
6337
  this.length = Math.ceil((n.length - d) / 6), this.words = new Array(this.length);
6338
6338
  for (var C = 0; C < this.length; C++)
6339
6339
  this.words[C] = 0;
6340
- var F = 0, z = 0, N;
6340
+ var F = 0, q = 0, N;
6341
6341
  if (g === "be")
6342
6342
  for (C = n.length - 1; C >= d; C -= 2)
6343
- N = u(n, d, C) << F, this.words[z] |= N & 67108863, F >= 18 ? (F -= 18, z += 1, this.words[z] |= N >>> 26) : F += 8;
6343
+ N = u(n, d, C) << F, this.words[q] |= N & 67108863, F >= 18 ? (F -= 18, q += 1, this.words[q] |= N >>> 26) : F += 8;
6344
6344
  else {
6345
6345
  var D = n.length - d;
6346
6346
  for (C = D % 2 === 0 ? d + 1 : d; C < n.length; C += 2)
6347
- N = u(n, d, C) << F, this.words[z] |= N & 67108863, F >= 18 ? (F -= 18, z += 1, this.words[z] |= N >>> 26) : F += 8;
6347
+ N = u(n, d, C) << F, this.words[q] |= N & 67108863, F >= 18 ? (F -= 18, q += 1, this.words[q] |= N >>> 26) : F += 8;
6348
6348
  }
6349
6349
  this.strip();
6350
6350
  };
6351
6351
  function o(A, n, d, g) {
6352
- for (var C = 0, F = Math.min(A.length, d), z = n; z < F; z++) {
6353
- var N = A.charCodeAt(z) - 48;
6352
+ for (var C = 0, F = Math.min(A.length, d), q = n; q < F; q++) {
6353
+ var N = A.charCodeAt(q) - 48;
6354
6354
  C *= g, N >= 49 ? C += N - 49 + 10 : N >= 17 ? C += N - 17 + 10 : C += N;
6355
6355
  }
6356
6356
  return C;
@@ -6360,7 +6360,7 @@ Hf.exports;
6360
6360
  for (var C = 0, F = 1; F <= 67108863; F *= d)
6361
6361
  C++;
6362
6362
  C--, F = F / d | 0;
6363
- for (var z = n.length - g, N = z % C, D = Math.min(z, z - N) + g, h = 0, E = g; E < D; E += C)
6363
+ for (var q = n.length - g, N = q % C, D = Math.min(q, q - N) + g, h = 0, E = g; E < D; E += C)
6364
6364
  h = o(n, E, E + C, d), this.imuln(F), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
6365
6365
  if (N !== 0) {
6366
6366
  var j = 1;
@@ -6499,9 +6499,9 @@ Hf.exports;
6499
6499
  var g;
6500
6500
  if (n === 16 || n === "hex") {
6501
6501
  g = "";
6502
- for (var C = 0, F = 0, z = 0; z < this.length; z++) {
6503
- var N = this.words[z], D = ((N << C | F) & 16777215).toString(16);
6504
- 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--);
6502
+ for (var C = 0, F = 0, q = 0; q < this.length; q++) {
6503
+ var N = this.words[q], D = ((N << C | F) & 16777215).toString(16);
6504
+ F = N >>> 24 - C & 16777215, F !== 0 || q !== this.length - 1 ? g = c[6 - D.length] + D + g : g = D + g, C += 2, C >= 26 && (C -= 26, q--);
6505
6505
  }
6506
6506
  for (F !== 0 && (g = F.toString(16) + g); g.length % d !== 0; )
6507
6507
  g = "0" + g;
@@ -6532,8 +6532,8 @@ Hf.exports;
6532
6532
  }, i.prototype.toArrayLike = function(n, d, g) {
6533
6533
  var C = this.byteLength(), F = g || Math.max(1, C);
6534
6534
  r(C <= F, "byte array longer than desired length"), r(F > 0, "Requested array length <= 0"), this.strip();
6535
- var z = d === "le", N = new n(F), D, h, E = this.clone();
6536
- if (z) {
6535
+ var q = d === "le", N = new n(F), D, h, E = this.clone();
6536
+ if (q) {
6537
6537
  for (h = 0; !E.isZero(); h++)
6538
6538
  D = E.andln(255), E.iushrn(8), N[h] = D;
6539
6539
  for (; h < F; h++)
@@ -6647,15 +6647,15 @@ Hf.exports;
6647
6647
  return n.negative = 0, d = this.isub(n), n.negative = 1, d._normSign();
6648
6648
  var g, C;
6649
6649
  this.length > n.length ? (g = this, C = n) : (g = n, C = this);
6650
- for (var F = 0, z = 0; z < C.length; z++)
6651
- d = (g.words[z] | 0) + (C.words[z] | 0) + F, this.words[z] = d & 67108863, F = d >>> 26;
6652
- for (; F !== 0 && z < g.length; z++)
6653
- d = (g.words[z] | 0) + F, this.words[z] = d & 67108863, F = d >>> 26;
6650
+ for (var F = 0, q = 0; q < C.length; q++)
6651
+ d = (g.words[q] | 0) + (C.words[q] | 0) + F, this.words[q] = d & 67108863, F = d >>> 26;
6652
+ for (; F !== 0 && q < g.length; q++)
6653
+ d = (g.words[q] | 0) + F, this.words[q] = d & 67108863, F = d >>> 26;
6654
6654
  if (this.length = g.length, F !== 0)
6655
6655
  this.words[this.length] = F, this.length++;
6656
6656
  else if (g !== this)
6657
- for (; z < g.length; z++)
6658
- this.words[z] = g.words[z];
6657
+ for (; q < g.length; q++)
6658
+ this.words[q] = g.words[q];
6659
6659
  return this;
6660
6660
  }, i.prototype.add = function(n) {
6661
6661
  var d;
@@ -6672,11 +6672,11 @@ Hf.exports;
6672
6672
  return this.negative = 0, this.length = 1, this.words[0] = 0, this;
6673
6673
  var C, F;
6674
6674
  g > 0 ? (C = this, F = n) : (C = n, F = this);
6675
- for (var z = 0, N = 0; N < F.length; N++)
6676
- d = (C.words[N] | 0) - (F.words[N] | 0) + z, z = d >> 26, this.words[N] = d & 67108863;
6677
- for (; z !== 0 && N < C.length; N++)
6678
- d = (C.words[N] | 0) + z, z = d >> 26, this.words[N] = d & 67108863;
6679
- if (z === 0 && N < C.length && C !== this)
6675
+ for (var q = 0, N = 0; N < F.length; N++)
6676
+ d = (C.words[N] | 0) - (F.words[N] | 0) + q, q = d >> 26, this.words[N] = d & 67108863;
6677
+ for (; q !== 0 && N < C.length; N++)
6678
+ d = (C.words[N] | 0) + q, q = d >> 26, this.words[N] = d & 67108863;
6679
+ if (q === 0 && N < C.length && C !== this)
6680
6680
  for (; N < C.length; N++)
6681
6681
  this.words[N] = C.words[N];
6682
6682
  return this.length = Math.max(this.length, N), C !== this && (this.negative = 1), this.strip();
@@ -6687,19 +6687,19 @@ Hf.exports;
6687
6687
  d.negative = n.negative ^ A.negative;
6688
6688
  var g = A.length + n.length | 0;
6689
6689
  d.length = g, g = g - 1 | 0;
6690
- var C = A.words[0] | 0, F = n.words[0] | 0, z = C * F, N = z & 67108863, D = z / 67108864 | 0;
6690
+ var C = A.words[0] | 0, F = n.words[0] | 0, q = C * F, N = q & 67108863, D = q / 67108864 | 0;
6691
6691
  d.words[0] = N;
6692
6692
  for (var h = 1; h < g; h++) {
6693
6693
  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++) {
6694
6694
  var re = h - W | 0;
6695
- C = A.words[re] | 0, F = n.words[W] | 0, z = C * F + j, E += z / 67108864 | 0, j = z & 67108863;
6695
+ C = A.words[re] | 0, F = n.words[W] | 0, q = C * F + j, E += q / 67108864 | 0, j = q & 67108863;
6696
6696
  }
6697
6697
  d.words[h] = j | 0, D = E | 0;
6698
6698
  }
6699
6699
  return D !== 0 ? d.words[h] = D | 0 : d.length--, d.strip();
6700
6700
  }
6701
6701
  var R = function(n, d, g) {
6702
- 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;
6702
+ var C = n.words, F = d.words, q = 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;
6703
6703
  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);
6704
6704
  var ne = (N + D | 0) + ((h & 8191) << 13) | 0;
6705
6705
  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;
@@ -6738,29 +6738,29 @@ Hf.exports;
6738
6738
  var Z = (N + D | 0) + ((h & 8191) << 13) | 0;
6739
6739
  N = (E + (h >>> 13) | 0) + (Z >>> 26) | 0, Z &= 67108863, D = Math.imul(l0, L), h = Math.imul(l0, V), h = h + Math.imul(He, L) | 0, E = Math.imul(He, V);
6740
6740
  var G = (N + D | 0) + ((h & 8191) << 13) | 0;
6741
- return N = (E + (h >>> 13) | 0) + (G >>> 26) | 0, G &= 67108863, z[0] = ne, z[1] = fe, z[2] = he, z[3] = te, z[4] = xe, z[5] = ue, z[6] = ve, z[7] = ge, z[8] = me, z[9] = _e, z[10] = pe, z[11] = de, z[12] = ye, z[13] = oe, z[14] = le, z[15] = be, z[16] = se, z[17] = Z, z[18] = G, N !== 0 && (z[19] = N, g.length++), g;
6741
+ return N = (E + (h >>> 13) | 0) + (G >>> 26) | 0, G &= 67108863, q[0] = ne, q[1] = fe, q[2] = he, q[3] = te, q[4] = xe, q[5] = ue, q[6] = ve, q[7] = ge, q[8] = me, q[9] = _e, q[10] = pe, q[11] = de, q[12] = ye, q[13] = oe, q[14] = le, q[15] = be, q[16] = se, q[17] = Z, q[18] = G, N !== 0 && (q[19] = N, g.length++), g;
6742
6742
  };
6743
6743
  Math.imul || (R = w);
6744
6744
  function k(A, n, d) {
6745
6745
  d.negative = n.negative ^ A.negative, d.length = A.length + n.length;
6746
6746
  for (var g = 0, C = 0, F = 0; F < d.length - 1; F++) {
6747
- var z = C;
6747
+ var q = C;
6748
6748
  C = 0;
6749
6749
  for (var N = g & 67108863, D = Math.min(F, n.length - 1), h = Math.max(0, F - A.length + 1); h <= D; h++) {
6750
6750
  var E = F - h, j = A.words[E] | 0, Y = n.words[h] | 0, W = j * Y, re = W & 67108863;
6751
- z = z + (W / 67108864 | 0) | 0, re = re + N | 0, N = re & 67108863, z = z + (re >>> 26) | 0, C += z >>> 26, z &= 67108863;
6751
+ q = q + (W / 67108864 | 0) | 0, re = re + N | 0, N = re & 67108863, q = q + (re >>> 26) | 0, C += q >>> 26, q &= 67108863;
6752
6752
  }
6753
- d.words[F] = N, g = z, z = C;
6753
+ d.words[F] = N, g = q, q = C;
6754
6754
  }
6755
6755
  return g !== 0 ? d.words[F] = g : d.length--, d.strip();
6756
6756
  }
6757
- function q(A, n, d) {
6757
+ function z(A, n, d) {
6758
6758
  var g = new S();
6759
6759
  return g.mulp(A, n, d);
6760
6760
  }
6761
6761
  i.prototype.mulTo = function(n, d) {
6762
6762
  var g, C = this.length + n.length;
6763
- 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;
6763
+ 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 = z(this, n, d), g;
6764
6764
  };
6765
6765
  function S(A, n) {
6766
6766
  this.x = A, this.y = n;
@@ -6775,11 +6775,11 @@ Hf.exports;
6775
6775
  for (var C = 0, F = 0; F < d; F++)
6776
6776
  C |= (n & 1) << d - F - 1, n >>= 1;
6777
6777
  return C;
6778
- }, S.prototype.permute = function(n, d, g, C, F, z) {
6779
- for (var N = 0; N < z; N++)
6778
+ }, S.prototype.permute = function(n, d, g, C, F, q) {
6779
+ for (var N = 0; N < q; N++)
6780
6780
  C[N] = d[n[N]], F[N] = g[n[N]];
6781
- }, S.prototype.transform = function(n, d, g, C, F, z) {
6782
- this.permute(z, n, d, g, C, F);
6781
+ }, S.prototype.transform = function(n, d, g, C, F, q) {
6782
+ this.permute(q, n, d, g, C, F);
6783
6783
  for (var N = 1; N < F; N <<= 1)
6784
6784
  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)
6785
6785
  for (var Y = h, W = E, re = 0; re < N; re++) {
@@ -6804,29 +6804,29 @@ Hf.exports;
6804
6804
  }
6805
6805
  return n;
6806
6806
  }, S.prototype.convert13b = function(n, d, g, C) {
6807
- for (var F = 0, z = 0; z < d; z++)
6808
- F = F + (n[z] | 0), g[2 * z] = F & 8191, F = F >>> 13, g[2 * z + 1] = F & 8191, F = F >>> 13;
6809
- for (z = 2 * d; z < C; ++z)
6810
- g[z] = 0;
6807
+ for (var F = 0, q = 0; q < d; q++)
6808
+ F = F + (n[q] | 0), g[2 * q] = F & 8191, F = F >>> 13, g[2 * q + 1] = F & 8191, F = F >>> 13;
6809
+ for (q = 2 * d; q < C; ++q)
6810
+ g[q] = 0;
6811
6811
  r(F === 0), r((F & -8192) === 0);
6812
6812
  }, S.prototype.stub = function(n) {
6813
6813
  for (var d = new Array(n), g = 0; g < n; g++)
6814
6814
  d[g] = 0;
6815
6815
  return d;
6816
6816
  }, S.prototype.mulp = function(n, d, g) {
6817
- 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;
6818
- 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);
6817
+ var C = 2 * this.guessLen13b(n.length, d.length), F = this.makeRBT(C), q = 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;
6818
+ W.length = C, this.convert13b(n.words, n.length, N, C), this.convert13b(d.words, d.length, E, C), this.transform(N, q, D, h, C, F), this.transform(E, q, j, Y, C, F);
6819
6819
  for (var re = 0; re < C; re++) {
6820
6820
  var ce = D[re] * j[re] - h[re] * Y[re];
6821
6821
  h[re] = D[re] * Y[re] + h[re] * j[re], D[re] = ce;
6822
6822
  }
6823
- 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();
6823
+ return this.conjugate(D, h, C), this.transform(D, h, W, q, C, F), this.conjugate(W, q, C), this.normalize13b(W, C), g.negative = n.negative ^ d.negative, g.length = n.length + d.length, g.strip();
6824
6824
  }, i.prototype.mul = function(n) {
6825
6825
  var d = new i(null);
6826
6826
  return d.words = new Array(this.length + n.length), this.mulTo(n, d);
6827
6827
  }, i.prototype.mulf = function(n) {
6828
6828
  var d = new i(null);
6829
- return d.words = new Array(this.length + n.length), q(this, n, d);
6829
+ return d.words = new Array(this.length + n.length), z(this, n, d);
6830
6830
  }, i.prototype.imul = function(n) {
6831
6831
  return this.clone().mulTo(n, this);
6832
6832
  }, i.prototype.imuln = function(n) {
@@ -6856,12 +6856,12 @@ Hf.exports;
6856
6856
  r(typeof n == "number" && n >= 0);
6857
6857
  var d = n % 26, g = (n - d) / 26, C = 67108863 >>> 26 - d << 26 - d, F;
6858
6858
  if (d !== 0) {
6859
- var z = 0;
6859
+ var q = 0;
6860
6860
  for (F = 0; F < this.length; F++) {
6861
6861
  var N = this.words[F] & C, D = (this.words[F] | 0) - N << d;
6862
- this.words[F] = D | z, z = N >>> 26 - d;
6862
+ this.words[F] = D | q, q = N >>> 26 - d;
6863
6863
  }
6864
- z && (this.words[F] = z, this.length++);
6864
+ q && (this.words[F] = q, this.length++);
6865
6865
  }
6866
6866
  if (g !== 0) {
6867
6867
  for (F = this.length - 1; F >= 0; F--)
@@ -6877,16 +6877,16 @@ Hf.exports;
6877
6877
  r(typeof n == "number" && n >= 0);
6878
6878
  var C;
6879
6879
  d ? C = (d - d % 26) / 26 : C = 0;
6880
- var F = n % 26, z = Math.min((n - F) / 26, this.length), N = 67108863 ^ 67108863 >>> F << F, D = g;
6881
- if (C -= z, C = Math.max(0, C), D) {
6882
- for (var h = 0; h < z; h++)
6880
+ var F = n % 26, q = Math.min((n - F) / 26, this.length), N = 67108863 ^ 67108863 >>> F << F, D = g;
6881
+ if (C -= q, C = Math.max(0, C), D) {
6882
+ for (var h = 0; h < q; h++)
6883
6883
  D.words[h] = this.words[h];
6884
- D.length = z;
6884
+ D.length = q;
6885
6885
  }
6886
- if (z !== 0)
6887
- if (this.length > z)
6888
- for (this.length -= z, h = 0; h < this.length; h++)
6889
- this.words[h] = this.words[h + z];
6886
+ if (q !== 0)
6887
+ if (this.length > q)
6888
+ for (this.length -= q, h = 0; h < this.length; h++)
6889
+ this.words[h] = this.words[h + q];
6890
6890
  else
6891
6891
  this.words[0] = 0, this.length = 1;
6892
6892
  var E = 0;
@@ -6953,22 +6953,22 @@ Hf.exports;
6953
6953
  }, i.prototype._ishlnsubmul = function(n, d, g) {
6954
6954
  var C = n.length + g, F;
6955
6955
  this._expand(C);
6956
- var z, N = 0;
6956
+ var q, N = 0;
6957
6957
  for (F = 0; F < n.length; F++) {
6958
- z = (this.words[F + g] | 0) + N;
6958
+ q = (this.words[F + g] | 0) + N;
6959
6959
  var D = (n.words[F] | 0) * d;
6960
- z -= D & 67108863, N = (z >> 26) - (D / 67108864 | 0), this.words[F + g] = z & 67108863;
6960
+ q -= D & 67108863, N = (q >> 26) - (D / 67108864 | 0), this.words[F + g] = q & 67108863;
6961
6961
  }
6962
6962
  for (; F < this.length - g; F++)
6963
- z = (this.words[F + g] | 0) + N, N = z >> 26, this.words[F + g] = z & 67108863;
6963
+ q = (this.words[F + g] | 0) + N, N = q >> 26, this.words[F + g] = q & 67108863;
6964
6964
  if (N === 0)
6965
6965
  return this.strip();
6966
6966
  for (r(N === -1), N = 0, F = 0; F < this.length; F++)
6967
- z = -(this.words[F] | 0) + N, N = z >> 26, this.words[F] = z & 67108863;
6967
+ q = -(this.words[F] | 0) + N, N = q >> 26, this.words[F] = q & 67108863;
6968
6968
  return this.negative = 1, this.strip();
6969
6969
  }, i.prototype._wordDiv = function(n, d) {
6970
- var g = this.length - n.length, C = this.clone(), F = n, z = F.words[F.length - 1] | 0, N = this._countBits(z);
6971
- g = 26 - N, g !== 0 && (F = F.ushln(g), C.iushln(g), z = F.words[F.length - 1] | 0);
6970
+ var g = this.length - n.length, C = this.clone(), F = n, q = F.words[F.length - 1] | 0, N = this._countBits(q);
6971
+ g = 26 - N, g !== 0 && (F = F.ushln(g), C.iushln(g), q = F.words[F.length - 1] | 0);
6972
6972
  var D = C.length - F.length, h;
6973
6973
  if (d !== "mod") {
6974
6974
  h = new i(null), h.length = D + 1, h.words = new Array(h.length);
@@ -6979,7 +6979,7 @@ Hf.exports;
6979
6979
  j.negative === 0 && (C = j, h && (h.words[D] = 1));
6980
6980
  for (var Y = D - 1; Y >= 0; Y--) {
6981
6981
  var W = (C.words[F.length + Y] | 0) * 67108864 + (C.words[F.length + Y - 1] | 0);
6982
- for (W = Math.min(W / z | 0, 67108863), C._ishlnsubmul(F, W, Y); C.negative !== 0; )
6982
+ for (W = Math.min(W / q | 0, 67108863), C._ishlnsubmul(F, W, Y); C.negative !== 0; )
6983
6983
  W--, C.negative = 0, C._ishlnsubmul(F, 1, Y), C.isZero() || (C.negative ^= 1);
6984
6984
  h && (h.words[Y] = W);
6985
6985
  }
@@ -6993,15 +6993,15 @@ Hf.exports;
6993
6993
  div: new i(0),
6994
6994
  mod: new i(0)
6995
6995
  };
6996
- var C, F, z;
6997
- 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)), {
6996
+ var C, F, q;
6997
+ return this.negative !== 0 && n.negative === 0 ? (q = this.neg().divmod(n, d), d !== "mod" && (C = q.div.neg()), d !== "div" && (F = q.mod.neg(), g && F.negative !== 0 && F.iadd(n)), {
6998
6998
  div: C,
6999
6999
  mod: F
7000
- }) : this.negative === 0 && n.negative !== 0 ? (z = this.divmod(n.neg(), d), d !== "mod" && (C = z.div.neg()), {
7000
+ }) : this.negative === 0 && n.negative !== 0 ? (q = this.divmod(n.neg(), d), d !== "mod" && (C = q.div.neg()), {
7001
7001
  div: C,
7002
- mod: z.mod
7003
- }) : this.negative & n.negative ? (z = this.neg().divmod(n.neg(), d), d !== "div" && (F = z.mod.neg(), g && F.negative !== 0 && F.isub(n)), {
7004
- div: z.div,
7002
+ mod: q.mod
7003
+ }) : this.negative & n.negative ? (q = this.neg().divmod(n.neg(), d), d !== "div" && (F = q.mod.neg(), g && F.negative !== 0 && F.isub(n)), {
7004
+ div: q.div,
7005
7005
  mod: F
7006
7006
  }) : n.length > this.length || this.cmp(n) < 0 ? {
7007
7007
  div: new i(0),
@@ -7026,8 +7026,8 @@ Hf.exports;
7026
7026
  var d = this.divmod(n);
7027
7027
  if (d.mod.isZero())
7028
7028
  return d.div;
7029
- var g = d.div.negative !== 0 ? d.mod.isub(n) : d.mod, C = n.ushrn(1), F = n.andln(1), z = g.cmp(C);
7030
- return z < 0 || F === 1 && z === 0 ? d.div : d.div.negative !== 0 ? d.div.isubn(1) : d.div.iaddn(1);
7029
+ var g = d.div.negative !== 0 ? d.mod.isub(n) : d.mod, C = n.ushrn(1), F = n.andln(1), q = g.cmp(C);
7030
+ return q < 0 || F === 1 && q === 0 ? d.div : d.div.negative !== 0 ? d.div.isubn(1) : d.div.iaddn(1);
7031
7031
  }, i.prototype.modn = function(n) {
7032
7032
  r(n <= 67108863);
7033
7033
  for (var d = (1 << 26) % n, g = 0, C = this.length - 1; C >= 0; C--)
@@ -7046,7 +7046,7 @@ Hf.exports;
7046
7046
  r(n.negative === 0), r(!n.isZero());
7047
7047
  var d = this, g = n.clone();
7048
7048
  d.negative !== 0 ? d = d.umod(n) : d = d.clone();
7049
- for (var C = new i(1), F = new i(0), z = new i(0), N = new i(1), D = 0; d.isEven() && g.isEven(); )
7049
+ for (var C = new i(1), F = new i(0), q = new i(0), N = new i(1), D = 0; d.isEven() && g.isEven(); )
7050
7050
  d.iushrn(1), g.iushrn(1), ++D;
7051
7051
  for (var h = g.clone(), E = d.clone(); !d.isZero(); ) {
7052
7052
  for (var j = 0, Y = 1; !(d.words[0] & Y) && j < 26; ++j, Y <<= 1)
@@ -7058,11 +7058,11 @@ Hf.exports;
7058
7058
  ;
7059
7059
  if (W > 0)
7060
7060
  for (g.iushrn(W); W-- > 0; )
7061
- (z.isOdd() || N.isOdd()) && (z.iadd(h), N.isub(E)), z.iushrn(1), N.iushrn(1);
7062
- d.cmp(g) >= 0 ? (d.isub(g), C.isub(z), F.isub(N)) : (g.isub(d), z.isub(C), N.isub(F));
7061
+ (q.isOdd() || N.isOdd()) && (q.iadd(h), N.isub(E)), q.iushrn(1), N.iushrn(1);
7062
+ d.cmp(g) >= 0 ? (d.isub(g), C.isub(q), F.isub(N)) : (g.isub(d), q.isub(C), N.isub(F));
7063
7063
  }
7064
7064
  return {
7065
- a: z,
7065
+ a: q,
7066
7066
  b: N,
7067
7067
  gcd: g.iushln(D)
7068
7068
  };
@@ -7070,17 +7070,17 @@ Hf.exports;
7070
7070
  r(n.negative === 0), r(!n.isZero());
7071
7071
  var d = this, g = n.clone();
7072
7072
  d.negative !== 0 ? d = d.umod(n) : d = d.clone();
7073
- for (var C = new i(1), F = new i(0), z = g.clone(); d.cmpn(1) > 0 && g.cmpn(1) > 0; ) {
7073
+ for (var C = new i(1), F = new i(0), q = g.clone(); d.cmpn(1) > 0 && g.cmpn(1) > 0; ) {
7074
7074
  for (var N = 0, D = 1; !(d.words[0] & D) && N < 26; ++N, D <<= 1)
7075
7075
  ;
7076
7076
  if (N > 0)
7077
7077
  for (d.iushrn(N); N-- > 0; )
7078
- C.isOdd() && C.iadd(z), C.iushrn(1);
7078
+ C.isOdd() && C.iadd(q), C.iushrn(1);
7079
7079
  for (var h = 0, E = 1; !(g.words[0] & E) && h < 26; ++h, E <<= 1)
7080
7080
  ;
7081
7081
  if (h > 0)
7082
7082
  for (g.iushrn(h); h-- > 0; )
7083
- F.isOdd() && F.iadd(z), F.iushrn(1);
7083
+ F.isOdd() && F.iadd(q), F.iushrn(1);
7084
7084
  d.cmp(g) >= 0 ? (d.isub(g), C.isub(F)) : (g.isub(d), F.isub(C));
7085
7085
  }
7086
7086
  var j;
@@ -7101,8 +7101,8 @@ Hf.exports;
7101
7101
  g.iushrn(1);
7102
7102
  var F = d.cmp(g);
7103
7103
  if (F < 0) {
7104
- var z = d;
7105
- d = g, g = z;
7104
+ var q = d;
7105
+ d = g, g = q;
7106
7106
  } else if (F === 0 || g.cmpn(1) === 0)
7107
7107
  break;
7108
7108
  d.isub(g);
@@ -7121,11 +7121,11 @@ Hf.exports;
7121
7121
  var d = n % 26, g = (n - d) / 26, C = 1 << d;
7122
7122
  if (this.length <= g)
7123
7123
  return this._expand(g + 1), this.words[g] |= C, this;
7124
- for (var F = C, z = g; F !== 0 && z < this.length; z++) {
7125
- var N = this.words[z] | 0;
7126
- N += F, F = N >>> 26, N &= 67108863, this.words[z] = N;
7124
+ for (var F = C, q = g; F !== 0 && q < this.length; q++) {
7125
+ var N = this.words[q] | 0;
7126
+ N += F, F = N >>> 26, N &= 67108863, this.words[q] = N;
7127
7127
  }
7128
- return F !== 0 && (this.words[z] = F, this.length++), this;
7128
+ return F !== 0 && (this.words[q] = F, this.length++), this;
7129
7129
  }, i.prototype.isZero = function() {
7130
7130
  return this.length === 1 && this.words[0] === 0;
7131
7131
  }, i.prototype.cmpn = function(n) {
@@ -7259,12 +7259,12 @@ Hf.exports;
7259
7259
  n.words[0] = 0, n.length = 1;
7260
7260
  return;
7261
7261
  }
7262
- var z = n.words[9];
7263
- for (d.words[d.length++] = z & g, F = 10; F < n.length; F++) {
7262
+ var q = n.words[9];
7263
+ for (d.words[d.length++] = q & g, F = 10; F < n.length; F++) {
7264
7264
  var N = n.words[F] | 0;
7265
- n.words[F - 10] = (N & g) << 4 | z >>> 22, z = N;
7265
+ n.words[F - 10] = (N & g) << 4 | q >>> 22, q = N;
7266
7266
  }
7267
- z >>>= 22, n.words[F - 10] = z, z === 0 && n.length > 10 ? n.length -= 10 : n.length -= 9;
7267
+ q >>>= 22, n.words[F - 10] = q, q === 0 && n.length > 10 ? n.length -= 10 : n.length -= 9;
7268
7268
  }, H.prototype.imulK = function(n) {
7269
7269
  n.words[n.length] = 0, n.words[n.length + 1] = 0, n.length += 2;
7270
7270
  for (var d = 0, g = 0; g < n.length; g++) {
@@ -7373,11 +7373,11 @@ Hf.exports;
7373
7373
  for (var C = this.m.subn(1), F = 0; !C.isZero() && C.andln(1) === 0; )
7374
7374
  F++, C.iushrn(1);
7375
7375
  r(!C.isZero());
7376
- var z = new i(1).toRed(this), N = z.redNeg(), D = this.m.subn(1).iushrn(1), h = this.m.bitLength();
7376
+ var q = new i(1).toRed(this), N = q.redNeg(), D = this.m.subn(1).iushrn(1), h = this.m.bitLength();
7377
7377
  for (h = new i(2 * h * h).toRed(this); this.pow(h, D).cmp(N) !== 0; )
7378
7378
  h.redIAdd(N);
7379
- 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; ) {
7380
- for (var re = Y, ce = 0; re.cmp(z) !== 0; ce++)
7379
+ 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(q) !== 0; ) {
7380
+ for (var re = Y, ce = 0; re.cmp(q) !== 0; ce++)
7381
7381
  re = re.redSqr();
7382
7382
  r(ce < W);
7383
7383
  var we = this.pow(E, new i(1).iushln(W - ce - 1));
@@ -7396,19 +7396,19 @@ Hf.exports;
7396
7396
  C[0] = new i(1).toRed(this), C[1] = n;
7397
7397
  for (var F = 2; F < C.length; F++)
7398
7398
  C[F] = this.mul(C[F - 1], n);
7399
- var z = C[0], N = 0, D = 0, h = d.bitLength() % 26;
7399
+ var q = C[0], N = 0, D = 0, h = d.bitLength() % 26;
7400
7400
  for (h === 0 && (h = 26), F = d.length - 1; F >= 0; F--) {
7401
7401
  for (var E = d.words[F], j = h - 1; j >= 0; j--) {
7402
7402
  var Y = E >> j & 1;
7403
- if (z !== C[0] && (z = this.sqr(z)), Y === 0 && N === 0) {
7403
+ if (q !== C[0] && (q = this.sqr(q)), Y === 0 && N === 0) {
7404
7404
  D = 0;
7405
7405
  continue;
7406
7406
  }
7407
- N <<= 1, N |= Y, D++, !(D !== g && (F !== 0 || j !== 0)) && (z = this.mul(z, C[N]), D = 0, N = 0);
7407
+ N <<= 1, N |= Y, D++, !(D !== g && (F !== 0 || j !== 0)) && (q = this.mul(q, C[N]), D = 0, N = 0);
7408
7408
  }
7409
7409
  h = 26;
7410
7410
  }
7411
- return z;
7411
+ return q;
7412
7412
  }, Q.prototype.convertTo = function(n) {
7413
7413
  var d = n.umod(this.m);
7414
7414
  return d === n ? d.clone() : d;
@@ -7429,13 +7429,13 @@ Hf.exports;
7429
7429
  }, U.prototype.imul = function(n, d) {
7430
7430
  if (n.isZero() || d.isZero())
7431
7431
  return n.words[0] = 0, n.length = 1, n;
7432
- 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;
7433
- return F.cmp(this.m) >= 0 ? z = F.isub(this.m) : F.cmpn(0) < 0 && (z = F.iadd(this.m)), z._forceRed(this);
7432
+ 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), q = F;
7433
+ return F.cmp(this.m) >= 0 ? q = F.isub(this.m) : F.cmpn(0) < 0 && (q = F.iadd(this.m)), q._forceRed(this);
7434
7434
  }, U.prototype.mul = function(n, d) {
7435
7435
  if (n.isZero() || d.isZero())
7436
7436
  return new i(0)._forceRed(this);
7437
- 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;
7438
- return F.cmp(this.m) >= 0 ? z = F.isub(this.m) : F.cmpn(0) < 0 && (z = F.iadd(this.m)), z._forceRed(this);
7437
+ 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), q = F;
7438
+ return F.cmp(this.m) >= 0 ? q = F.isub(this.m) : F.cmpn(0) < 0 && (q = F.iadd(this.m)), q._forceRed(this);
7439
7439
  }, U.prototype.invm = function(n) {
7440
7440
  var d = this.imod(n._invmp(this.m).mul(this.r2));
7441
7441
  return d._forceRed(this);
@@ -7499,8 +7499,8 @@ var Uf = {};
7499
7499
  B[w] = 0;
7500
7500
  var R = 1 << v + 1, k = c.clone();
7501
7501
  for (w = 0; w < B.length; w++) {
7502
- var q, S = k.andln(R - 1);
7503
- k.isOdd() ? (S > (R >> 1) - 1 ? q = (R >> 1) - S : q = S, k.isubn(q)) : q = 0, B[w] = q, k.iushrn(1);
7502
+ var z, S = k.andln(R - 1);
7503
+ k.isOdd() ? (S > (R >> 1) - 1 ? z = (R >> 1) - S : z = S, k.isubn(z)) : z = 0, B[w] = z, k.iushrn(1);
7504
7504
  }
7505
7505
  return B;
7506
7506
  }
@@ -7512,12 +7512,12 @@ var Uf = {};
7512
7512
  ];
7513
7513
  c = c.clone(), v = v.clone();
7514
7514
  for (var B = 0, w = 0, R; c.cmpn(-B) > 0 || v.cmpn(-w) > 0; ) {
7515
- var k = c.andln(3) + B & 3, q = v.andln(3) + w & 3;
7516
- k === 3 && (k = -1), q === 3 && (q = -1);
7515
+ var k = c.andln(3) + B & 3, z = v.andln(3) + w & 3;
7516
+ k === 3 && (k = -1), z === 3 && (z = -1);
7517
7517
  var S;
7518
- k & 1 ? (R = c.andln(7) + B & 7, (R === 3 || R === 5) && q === 2 ? S = -k : S = k) : S = 0, b[0].push(S);
7518
+ k & 1 ? (R = c.andln(7) + B & 7, (R === 3 || R === 5) && z === 2 ? S = -k : S = k) : S = 0, b[0].push(S);
7519
7519
  var P;
7520
- 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);
7520
+ z & 1 ? (R = v.andln(7) + w & 7, (R === 3 || R === 5) && k === 2 ? P = -z : P = z) : 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);
7521
7521
  }
7522
7522
  return b;
7523
7523
  }
@@ -7644,7 +7644,7 @@ Et.prototype._wnafMulAdd = function(e, t, r, a, i) {
7644
7644
  /* 7 */
7645
7645
  ];
7646
7646
  t[w].y.cmp(t[R].y) === 0 ? (k[1] = t[w].add(t[R]), k[2] = t[w].toJ().mixedAdd(t[R].neg())) : t[w].y.cmp(t[R].y.redNeg()) === 0 ? (k[1] = t[w].toJ().mixedAdd(t[R]), k[2] = t[w].add(t[R].neg())) : (k[1] = t[w].toJ().mixedAdd(t[R]), k[2] = t[w].toJ().mixedAdd(t[R].neg()));
7647
- var q = [
7647
+ var z = [
7648
7648
  -3,
7649
7649
  /* -1 -1 */
7650
7650
  -1,
@@ -7666,7 +7666,7 @@ Et.prototype._wnafMulAdd = function(e, t, r, a, i) {
7666
7666
  ], S = ps(r[w], r[R]);
7667
7667
  for (o = Math.max(S[0].length, o), u[w] = new Array(o), u[R] = new Array(o), v = 0; v < o; v++) {
7668
7668
  var P = S[0][v] | 0, T = S[1][v] | 0;
7669
- u[w][v] = q[(P + 1) * 3 + (T + 1)], u[R][v] = 0, x[w] = k;
7669
+ u[w][v] = z[(P + 1) * 3 + (T + 1)], u[R][v] = 0, x[w] = k;
7670
7670
  }
7671
7671
  }
7672
7672
  var H = this.jpoint(null, null, null), $ = this._wnafT4;
@@ -7828,17 +7828,17 @@ X0.prototype._getEndoRoots = function(e) {
7828
7828
  return [y, x];
7829
7829
  };
7830
7830
  X0.prototype._getEndoBasis = function(e) {
7831
- 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; ) {
7831
+ 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, z, S; r.cmpn(0) !== 0; ) {
7832
7832
  var P = a.div(r);
7833
- q = a.sub(P.mul(r)), S = x.sub(P.mul(i));
7833
+ z = a.sub(P.mul(r)), S = x.sub(P.mul(i));
7834
7834
  var T = u.sub(P.mul(y));
7835
- if (!v && q.cmp(t) < 0)
7836
- o = R.neg(), c = i, v = q.neg(), b = S;
7835
+ if (!v && z.cmp(t) < 0)
7836
+ o = R.neg(), c = i, v = z.neg(), b = S;
7837
7837
  else if (v && ++k === 2)
7838
7838
  break;
7839
- R = q, a = r, r = q, x = i, i = S, u = y, y = T;
7839
+ R = z, a = r, r = z, x = i, i = S, u = y, y = T;
7840
7840
  }
7841
- B = q.neg(), w = S;
7841
+ B = z.neg(), w = S;
7842
7842
  var H = v.sqr().add(b.sqr()), $ = B.sqr().add(w.sqr());
7843
7843
  return $.cmp(H) >= 0 && (B = o, w = c), v.negative && (v = v.neg(), b = b.neg()), B.negative && (B = B.neg(), w = w.neg()), [
7844
7844
  { a: v, b },
@@ -8072,7 +8072,7 @@ R0.prototype.dblp = function(e) {
8072
8072
  }
8073
8073
  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);
8074
8074
  for (t = 0; t < e; t++) {
8075
- 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);
8075
+ 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)), z = R.redISub(k), S = w.redMul(z);
8076
8076
  S = S.redIAdd(S).redISub(B);
8077
8077
  var P = c.redMul(u);
8078
8078
  t + 1 < e && (o = o.redMul(B)), y = k, u = P, c = S;
@@ -8092,8 +8092,8 @@ R0.prototype._zeroDbl = function() {
8092
8092
  } else {
8093
8093
  var v = this.x.redSqr(), b = this.y.redSqr(), B = b.redSqr(), w = this.x.redAdd(b).redSqr().redISub(v).redISub(B);
8094
8094
  w = w.redIAdd(w);
8095
- var R = v.redAdd(v).redIAdd(v), k = R.redSqr(), q = B.redIAdd(B);
8096
- 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);
8095
+ var R = v.redAdd(v).redIAdd(v), k = R.redSqr(), z = B.redIAdd(B);
8096
+ z = z.redIAdd(z), z = z.redIAdd(z), e = k.redISub(w).redISub(w), t = R.redMul(w.redISub(e)).redISub(z), r = this.y.redMul(this.z), r = r.redIAdd(r);
8097
8097
  }
8098
8098
  return this.curve.jpoint(e, t, r);
8099
8099
  };
@@ -8113,8 +8113,8 @@ R0.prototype._threeDbl = function() {
8113
8113
  R = R.redIAdd(R);
8114
8114
  var k = R.redAdd(R);
8115
8115
  e = w.redSqr().redISub(k), r = this.y.redAdd(this.z).redSqr().redISub(b).redISub(v);
8116
- var q = b.redSqr();
8117
- q = q.redIAdd(q), q = q.redIAdd(q), q = q.redIAdd(q), t = w.redMul(R.redISub(e)).redISub(q);
8116
+ var z = b.redSqr();
8117
+ z = z.redIAdd(z), z = z.redIAdd(z), z = z.redIAdd(z), t = w.redMul(R.redISub(e)).redISub(z);
8118
8118
  }
8119
8119
  return this.curve.jpoint(e, t, r);
8120
8120
  };
@@ -8989,10 +8989,10 @@ et.prototype._prepareBlock = function(e, t) {
8989
8989
  };
8990
8990
  et.prototype._update = function(e, t) {
8991
8991
  this._prepareBlock(e, t);
8992
- 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];
8992
+ 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], z = this.h[13], S = this.h[14], P = this.h[15];
8993
8993
  wo(this.k.length === r.length);
8994
8994
  for (var T = 0; T < r.length; T += 2) {
8995
- 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(
8995
+ 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, z), A = this.k[T], n = this.k[T + 1], d = r[T], g = r[T + 1], C = Mo(
8996
8996
  H,
8997
8997
  $,
8998
8998
  K,
@@ -9016,10 +9016,10 @@ et.prototype._update = function(e, t) {
9016
9016
  g
9017
9017
  );
9018
9018
  H = Io(a, i), $ = To(a, i), K = ko(a, i, y, x, u), X = Po(a, i, y, x, u, o);
9019
- var z = yf(H, $, K, X), N = gf(H, $, K, X);
9020
- 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);
9019
+ var q = yf(H, $, K, X), N = gf(H, $, K, X);
9020
+ S = k, P = z, k = w, z = 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, q, N), i = gf(C, F, q, N);
9021
9021
  }
9022
- 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);
9022
+ 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, z), gt(this.h, 14, S, P);
9023
9023
  };
9024
9024
  et.prototype._digest = function(e) {
9025
9025
  return e === "hex" ? H0.toHex32(this.h, "big") : H0.split32(this.h, "big");
@@ -10844,7 +10844,7 @@ var Kn = { exports: {} };
10844
10844
  function k(l, _, m, s) {
10845
10845
  return R(l, _, m, s, 16);
10846
10846
  }
10847
- function q(l, _, m, s) {
10847
+ function z(l, _, m, s) {
10848
10848
  return R(l, _, m, s, 32);
10849
10849
  }
10850
10850
  function S(l, _, m, s) {
@@ -10985,7 +10985,7 @@ var Kn = { exports: {} };
10985
10985
  for (m = 0; m < 16; m++)
10986
10986
  l[m] = _[m] | 0;
10987
10987
  }
10988
- function z(l) {
10988
+ function q(l) {
10989
10989
  var _, m, s = 1;
10990
10990
  for (_ = 0; _ < 16; _++)
10991
10991
  m = l[_] + s + 65535, s = Math.floor(m / 65536), l[_] = m - s * 65536;
@@ -10999,7 +10999,7 @@ var Kn = { exports: {} };
10999
10999
  var m, s, M, p = t(), I = t();
11000
11000
  for (m = 0; m < 16; m++)
11001
11001
  I[m] = _[m];
11002
- for (z(I), z(I), z(I), s = 0; s < 2; s++) {
11002
+ for (q(I), q(I), q(I), s = 0; s < 2; s++) {
11003
11003
  for (p[0] = I[0] - 65517, m = 1; m < 15; m++)
11004
11004
  p[m] = I[m] - 65535 - (p[m - 1] >> 16 & 1), p[m - 1] &= 65535;
11005
11005
  p[15] = I[15] - 32767 - (p[14] >> 16 & 1), M = p[15] >> 16 & 1, p[14] &= 65535, N(I, p, 1 - M);
@@ -11009,7 +11009,7 @@ var Kn = { exports: {} };
11009
11009
  }
11010
11010
  function h(l, _) {
11011
11011
  var m = new Uint8Array(32), s = new Uint8Array(32);
11012
- return D(m, l), D(s, _), q(m, 0, s, 0);
11012
+ return D(m, l), D(s, _), z(m, 0, s, 0);
11013
11013
  }
11014
11014
  function E(l) {
11015
11015
  var _ = new Uint8Array(32);
@@ -11350,7 +11350,7 @@ var Kn = { exports: {} };
11350
11350
  l[M] = _[M];
11351
11351
  for (M = 0; M < 32; M++)
11352
11352
  l[M + 32] = s[M];
11353
- if (ze(I, l, m), u0(I), F0(L, V, I), Je(V, _.subarray(32)), O0(L, V), Se(p, L), m -= 64, q(_, 0, p, 0)) {
11353
+ if (ze(I, l, m), u0(I), F0(L, V, I), Je(V, _.subarray(32)), O0(L, V), Se(p, L), m -= 64, z(_, 0, p, 0)) {
11354
11354
  for (M = 0; M < m; M++)
11355
11355
  l[M] = 0;
11356
11356
  return -1;
@@ -11369,7 +11369,7 @@ var Kn = { exports: {} };
11369
11369
  crypto_onetimeauth: n,
11370
11370
  crypto_onetimeauth_verify: d,
11371
11371
  crypto_verify_16: k,
11372
- crypto_verify_32: q,
11372
+ crypto_verify_32: z,
11373
11373
  crypto_secretbox: g,
11374
11374
  crypto_secretbox_open: C,
11375
11375
  crypto_scalarmult: Me,
@@ -14020,9 +14020,9 @@ class b1 {
14020
14020
 
14021
14021
  Nonce: ${r}`, await this.sendMessage(e, t);
14022
14022
  const { publicKey: i, signature: y, address: x, network: u } = await this.getAccountCrypto();
14023
- if (!jn.xphereVerify(t, i, y))
14023
+ if (console.log("msg2: ", t), console.log("pub2: ", i), console.log("sig2: ", y), !jn.xphereVerify(t, i, y))
14024
14024
  throw new Error("Verification failed");
14025
- return { address: x, network: u };
14025
+ return { address: x, network: u, signature: y, publicKey: i };
14026
14026
  } else
14027
14027
  throw new Error("Verification failed");
14028
14028
  } catch (a) {
@@ -14067,12 +14067,19 @@ const oa = new y1(), ca = "data:image/svg+xml,%3csvg%20width='167'%20height='166
14067
14067
  (async () => {
14068
14068
  try {
14069
14069
  console.log("roomId", B);
14070
- const R = await p1.qrLogin(B, r, v), k = {
14070
+ const R = await p1.qrLogin(B, r, v), k = `${r}
14071
+
14072
+ Nonce: ${v}`, z = {
14073
+ publicKey: R.publicKey,
14074
+ message: k
14075
+ }, S = {
14071
14076
  isSuccess: !0,
14072
14077
  address: R.address,
14073
- network: R.network
14078
+ network: R.network,
14079
+ signature: R.signature,
14080
+ payload: z
14074
14081
  };
14075
- i(k);
14082
+ i(S);
14076
14083
  } catch {
14077
14084
  i({
14078
14085
  isSuccess: !1