zigap-utils 0.0.477 → 0.0.479

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 (8) hide show
  1. package/dist/components/AddressProvideQR/AddressProvideQR.d.ts +1 -1
  2. package/dist/components/AddressProvideQR/AddressProvideQR.types.d.ts +0 -1
  3. package/dist/components/LoginQR/LoginQR.d.ts +1 -1
  4. package/dist/components/LoginQR/LoginQR.types.d.ts +4 -5
  5. package/dist/hooks/useZigap.d.ts +5 -5
  6. package/dist/index.cjs.js +12 -12
  7. package/dist/index.es.js +799 -818
  8. package/package.json +1 -1
package/dist/index.es.js CHANGED
@@ -47,14 +47,14 @@ function la() {
47
47
  ii = 1;
48
48
  var f = hn, 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 };
49
49
  function y(x, u, o) {
50
- var c, v = {}, b = null, B = null;
51
- o !== void 0 && (b = "" + o), u.key !== void 0 && (b = "" + u.key), u.ref !== void 0 && (B = u.ref);
50
+ var c, b = {}, v = null, C = null;
51
+ o !== void 0 && (v = "" + o), u.key !== void 0 && (v = "" + u.key), u.ref !== void 0 && (C = u.ref);
52
52
  for (c in u)
53
- r.call(u, c) && !i.hasOwnProperty(c) && (v[c] = u[c]);
53
+ r.call(u, c) && !i.hasOwnProperty(c) && (b[c] = u[c]);
54
54
  if (x && x.defaultProps)
55
55
  for (c in u = x.defaultProps, u)
56
- v[c] === void 0 && (v[c] = u[c]);
57
- return { $$typeof: e, type: x, key: b, ref: B, props: v, _owner: a.current };
56
+ b[c] === void 0 && (b[c] = u[c]);
57
+ return { $$typeof: e, type: x, key: v, ref: C, props: b, _owner: a.current };
58
58
  }
59
59
  return Xt.Fragment = t, Xt.jsx = y, Xt.jsxs = y, Xt;
60
60
  }
@@ -71,7 +71,7 @@ var Zt = {};
71
71
  var ni;
72
72
  function xa() {
73
73
  return ni || (ni = 1, process.env.NODE_ENV !== "production" && function() {
74
- var f = hn, 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";
74
+ var f = hn, 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"), b = Symbol.for("react.memo"), v = Symbol.for("react.lazy"), C = Symbol.for("react.offscreen"), w = Symbol.iterator, R = "@@iterator";
75
75
  function k(p) {
76
76
  if (p === null || typeof p != "object")
77
77
  return null;
@@ -99,7 +99,7 @@ function xa() {
99
99
  var T = !1, H = !1, $ = !1, Y = !1, X = !1, Q;
100
100
  Q = Symbol.for("react.module.reference");
101
101
  function U(p) {
102
- return !!(typeof p == "string" || typeof p == "function" || p === r || p === i || X || p === a || p === o || p === c || Y || 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
102
+ return !!(typeof p == "string" || typeof p == "function" || p === r || p === i || X || p === a || p === o || p === c || Y || p === C || T || H || $ || typeof p == "object" && p !== null && (p.$$typeof === v || p.$$typeof === b || p.$$typeof === y || p.$$typeof === x || p.$$typeof === u || // This needs to include all possible module reference object
103
103
  // types supported by any Flight configuration anywhere since
104
104
  // we don't know which Flight build this will end up being used
105
105
  // with.
@@ -146,10 +146,10 @@ function xa() {
146
146
  return n(L._context) + ".Provider";
147
147
  case u:
148
148
  return A(p, p.render, "ForwardRef");
149
- case v:
149
+ case b:
150
150
  var V = p.displayName || null;
151
151
  return V !== null ? V : d(p.type) || "Memo";
152
- case b: {
152
+ case v: {
153
153
  var ne = p, fe = ne._payload, he = ne._init;
154
154
  try {
155
155
  return d(he(fe));
@@ -160,13 +160,13 @@ function xa() {
160
160
  }
161
161
  return null;
162
162
  }
163
- var g = Object.assign, C = 0, S, N, q, D, h, E, j;
163
+ var g = Object.assign, B = 0, S, N, q, D, h, E, j;
164
164
  function K() {
165
165
  }
166
166
  K.__reactDisabledLog = !0;
167
167
  function W() {
168
168
  {
169
- if (C === 0) {
169
+ if (B === 0) {
170
170
  S = console.log, N = console.info, q = console.warn, D = console.error, h = console.group, E = console.groupCollapsed, j = console.groupEnd;
171
171
  var p = {
172
172
  configurable: !0,
@@ -184,12 +184,12 @@ function xa() {
184
184
  groupEnd: p
185
185
  });
186
186
  }
187
- C++;
187
+ B++;
188
188
  }
189
189
  }
190
190
  function re() {
191
191
  {
192
- if (C--, C === 0) {
192
+ if (B--, B === 0) {
193
193
  var p = {
194
194
  configurable: !0,
195
195
  enumerable: !0,
@@ -219,7 +219,7 @@ function xa() {
219
219
  })
220
220
  });
221
221
  }
222
- C < 0 && F("disabledDepth fell below zero. This is a bug in React. Please file an issue.");
222
+ B < 0 && F("disabledDepth fell below zero. This is a bug in React. Please file an issue.");
223
223
  }
224
224
  }
225
225
  var ce = z.ReactCurrentDispatcher, we;
@@ -336,9 +336,9 @@ function xa() {
336
336
  switch (p.$$typeof) {
337
337
  case u:
338
338
  return Oe(p.render);
339
- case v:
339
+ case b:
340
340
  return Ge(p.type, I, L);
341
- case b: {
341
+ case v: {
342
342
  var V = p, ne = V._payload, fe = V._init;
343
343
  try {
344
344
  return Ge(fe(ne), I, L);
@@ -580,7 +580,7 @@ Check the top-level render call using <` + L + ">.");
580
580
  L = I.propTypes;
581
581
  else if (typeof I == "object" && (I.$$typeof === u || // Note: Memo only checks outer props here.
582
582
  // Inner props are checked in the reconciler.
583
- I.$$typeof === v))
583
+ I.$$typeof === b))
584
584
  L = I.propTypes;
585
585
  else
586
586
  return;
@@ -687,28 +687,28 @@ var vr = Sf.exports, va = Object.defineProperty, br = Object.getOwnPropertySymbo
687
687
  var Dt;
688
688
  ((f) => {
689
689
  const e = class {
690
- constructor(u, o, c, v) {
690
+ constructor(u, o, c, b) {
691
691
  if (this.version = u, this.errorCorrectionLevel = o, this.modules = [], this.isFunction = [], u < e.MIN_VERSION || u > e.MAX_VERSION)
692
692
  throw new RangeError("Version value out of range");
693
- if (v < -1 || v > 7)
693
+ if (b < -1 || b > 7)
694
694
  throw new RangeError("Mask value out of range");
695
695
  this.size = u * 4 + 17;
696
- let b = [];
696
+ let v = [];
697
697
  for (let w = 0; w < this.size; w++)
698
- b.push(!1);
698
+ v.push(!1);
699
699
  for (let w = 0; w < this.size; w++)
700
- this.modules.push(b.slice()), this.isFunction.push(b.slice());
700
+ this.modules.push(v.slice()), this.isFunction.push(v.slice());
701
701
  this.drawFunctionPatterns();
702
- const B = this.addEccAndInterleave(c);
703
- if (this.drawCodewords(B), v == -1) {
702
+ const C = this.addEccAndInterleave(c);
703
+ if (this.drawCodewords(C), b == -1) {
704
704
  let w = 1e9;
705
705
  for (let R = 0; R < 8; R++) {
706
706
  this.applyMask(R), this.drawFormatBits(R);
707
707
  const k = this.getPenaltyScore();
708
- k < w && (v = R, w = k), this.applyMask(R);
708
+ k < w && (b = R, w = k), this.applyMask(R);
709
709
  }
710
710
  }
711
- i(0 <= v && v <= 7), this.mask = v, this.applyMask(v), this.drawFormatBits(v), this.isFunction = [];
711
+ i(0 <= b && b <= 7), this.mask = b, this.applyMask(b), this.drawFormatBits(b), this.isFunction = [];
712
712
  }
713
713
  static encodeText(u, o) {
714
714
  const c = f.QrSegment.makeSegments(u);
@@ -718,8 +718,8 @@ var Dt;
718
718
  const c = f.QrSegment.makeBytes(u);
719
719
  return e.encodeSegments([c], o);
720
720
  }
721
- static encodeSegments(u, o, c = 1, v = 40, b = -1, B = !0) {
722
- if (!(e.MIN_VERSION <= c && c <= v && v <= e.MAX_VERSION) || b < -1 || b > 7)
721
+ static encodeSegments(u, o, c = 1, b = 40, v = -1, C = !0) {
722
+ if (!(e.MIN_VERSION <= c && c <= b && b <= e.MAX_VERSION) || v < -1 || v > 7)
723
723
  throw new RangeError("Invalid value");
724
724
  let w, R;
725
725
  for (w = c; ; w++) {
@@ -728,11 +728,11 @@ var Dt;
728
728
  R = T;
729
729
  break;
730
730
  }
731
- if (w >= v)
731
+ if (w >= b)
732
732
  throw new RangeError("Data too long");
733
733
  }
734
734
  for (const P of [e.Ecc.MEDIUM, e.Ecc.QUARTILE, e.Ecc.HIGH])
735
- B && R <= e.getNumDataCodewords(w, P) * 8 && (o = P);
735
+ C && R <= e.getNumDataCodewords(w, P) * 8 && (o = P);
736
736
  let k = [];
737
737
  for (const P of u) {
738
738
  r(P.mode.modeBits, 4, k), r(P.numChars, P.mode.numCharCountBits(w), k);
@@ -747,7 +747,7 @@ var Dt;
747
747
  let F = [];
748
748
  for (; F.length * 8 < k.length; )
749
749
  F.push(0);
750
- return k.forEach((P, T) => F[T >>> 3] |= P << 7 - (T & 7)), new e(w, o, F, b);
750
+ return k.forEach((P, T) => F[T >>> 3] |= P << 7 - (T & 7)), new e(w, o, F, v);
751
751
  }
752
752
  getModule(u, o) {
753
753
  return 0 <= u && u < this.size && 0 <= o && o < this.size && this.modules[o][u];
@@ -761,26 +761,26 @@ var Dt;
761
761
  this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
762
762
  const u = this.getAlignmentPatternPositions(), o = u.length;
763
763
  for (let c = 0; c < o; c++)
764
- for (let v = 0; v < o; v++)
765
- c == 0 && v == 0 || c == 0 && v == o - 1 || c == o - 1 && v == 0 || this.drawAlignmentPattern(u[c], u[v]);
764
+ for (let b = 0; b < o; b++)
765
+ c == 0 && b == 0 || c == 0 && b == o - 1 || c == o - 1 && b == 0 || this.drawAlignmentPattern(u[c], u[b]);
766
766
  this.drawFormatBits(0), this.drawVersion();
767
767
  }
768
768
  drawFormatBits(u) {
769
769
  const o = this.errorCorrectionLevel.formatBits << 3 | u;
770
770
  let c = o;
771
- for (let b = 0; b < 10; b++)
771
+ for (let v = 0; v < 10; v++)
772
772
  c = c << 1 ^ (c >>> 9) * 1335;
773
- const v = (o << 10 | c) ^ 21522;
774
- i(v >>> 15 == 0);
775
- for (let b = 0; b <= 5; b++)
776
- this.setFunctionModule(8, b, a(v, b));
777
- this.setFunctionModule(8, 7, a(v, 6)), this.setFunctionModule(8, 8, a(v, 7)), this.setFunctionModule(7, 8, a(v, 8));
778
- for (let b = 9; b < 15; b++)
779
- this.setFunctionModule(14 - b, 8, a(v, b));
780
- for (let b = 0; b < 8; b++)
781
- this.setFunctionModule(this.size - 1 - b, 8, a(v, b));
782
- for (let b = 8; b < 15; b++)
783
- this.setFunctionModule(8, this.size - 15 + b, a(v, b));
773
+ const b = (o << 10 | c) ^ 21522;
774
+ i(b >>> 15 == 0);
775
+ for (let v = 0; v <= 5; v++)
776
+ this.setFunctionModule(8, v, a(b, v));
777
+ this.setFunctionModule(8, 7, a(b, 6)), this.setFunctionModule(8, 8, a(b, 7)), this.setFunctionModule(7, 8, a(b, 8));
778
+ for (let v = 9; v < 15; v++)
779
+ this.setFunctionModule(14 - v, 8, a(b, v));
780
+ for (let v = 0; v < 8; v++)
781
+ this.setFunctionModule(this.size - 1 - v, 8, a(b, v));
782
+ for (let v = 8; v < 15; v++)
783
+ this.setFunctionModule(8, this.size - 15 + v, a(b, v));
784
784
  this.setFunctionModule(8, this.size - 8, !0);
785
785
  }
786
786
  drawVersion() {
@@ -792,21 +792,21 @@ var Dt;
792
792
  const o = this.version << 12 | u;
793
793
  i(o >>> 18 == 0);
794
794
  for (let c = 0; c < 18; c++) {
795
- const v = a(o, c), b = this.size - 11 + c % 3, B = Math.floor(c / 3);
796
- this.setFunctionModule(b, B, v), this.setFunctionModule(B, b, v);
795
+ const b = a(o, c), v = this.size - 11 + c % 3, C = Math.floor(c / 3);
796
+ this.setFunctionModule(v, C, b), this.setFunctionModule(C, v, b);
797
797
  }
798
798
  }
799
799
  drawFinderPattern(u, o) {
800
800
  for (let c = -4; c <= 4; c++)
801
- for (let v = -4; v <= 4; v++) {
802
- const b = Math.max(Math.abs(v), Math.abs(c)), B = u + v, w = o + c;
803
- 0 <= B && B < this.size && 0 <= w && w < this.size && this.setFunctionModule(B, w, b != 2 && b != 4);
801
+ for (let b = -4; b <= 4; b++) {
802
+ const v = Math.max(Math.abs(b), Math.abs(c)), C = u + b, w = o + c;
803
+ 0 <= C && C < this.size && 0 <= w && w < this.size && this.setFunctionModule(C, w, v != 2 && v != 4);
804
804
  }
805
805
  }
806
806
  drawAlignmentPattern(u, o) {
807
807
  for (let c = -2; c <= 2; c++)
808
- for (let v = -2; v <= 2; v++)
809
- this.setFunctionModule(u + v, o + c, Math.max(Math.abs(v), Math.abs(c)) != 1);
808
+ for (let b = -2; b <= 2; b++)
809
+ this.setFunctionModule(u + b, o + c, Math.max(Math.abs(b), Math.abs(c)) != 1);
810
810
  }
811
811
  setFunctionModule(u, o, c) {
812
812
  this.modules[o][u] = c, this.isFunction[o][u] = !0;
@@ -815,11 +815,11 @@ var Dt;
815
815
  const o = this.version, c = this.errorCorrectionLevel;
816
816
  if (u.length != e.getNumDataCodewords(o, c))
817
817
  throw new RangeError("Invalid argument");
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);
818
+ const b = e.NUM_ERROR_CORRECTION_BLOCKS[c.ordinal][o], v = e.ECC_CODEWORDS_PER_BLOCK[c.ordinal][o], C = Math.floor(e.getNumRawDataModules(o) / 8), w = b - C % b, R = Math.floor(C / b);
819
819
  let k = [];
820
- const z = e.reedSolomonComputeDivisor(b);
821
- for (let P = 0, T = 0; P < v; P++) {
822
- let H = u.slice(T, T + R - b + (P < w ? 0 : 1));
820
+ const z = e.reedSolomonComputeDivisor(v);
821
+ for (let P = 0, T = 0; P < b; P++) {
822
+ let H = u.slice(T, T + R - v + (P < w ? 0 : 1));
823
823
  T += H.length;
824
824
  const $ = e.reedSolomonComputeRemainder(H, z);
825
825
  P < w && H.push(0), k.push(H.concat($));
@@ -827,9 +827,9 @@ var Dt;
827
827
  let F = [];
828
828
  for (let P = 0; P < k[0].length; P++)
829
829
  k.forEach((T, H) => {
830
- (P != R - b || H >= w) && F.push(T[P]);
830
+ (P != R - v || H >= w) && F.push(T[P]);
831
831
  });
832
- return i(F.length == B), F;
832
+ return i(F.length == C), F;
833
833
  }
834
834
  drawCodewords(u) {
835
835
  if (u.length != Math.floor(e.getNumRawDataModules(this.version) / 8))
@@ -837,10 +837,10 @@ var Dt;
837
837
  let o = 0;
838
838
  for (let c = this.size - 1; c >= 1; c -= 2) {
839
839
  c == 6 && (c = 5);
840
- for (let v = 0; v < this.size; v++)
841
- for (let b = 0; b < 2; b++) {
842
- const B = c - b, R = (c + 1 & 2) == 0 ? this.size - 1 - v : v;
843
- !this.isFunction[R][B] && o < u.length * 8 && (this.modules[R][B] = a(u[o >>> 3], 7 - (o & 7)), o++);
840
+ for (let b = 0; b < this.size; b++)
841
+ for (let v = 0; v < 2; v++) {
842
+ const C = c - v, R = (c + 1 & 2) == 0 ? this.size - 1 - b : b;
843
+ !this.isFunction[R][C] && o < u.length * 8 && (this.modules[R][C] = a(u[o >>> 3], 7 - (o & 7)), o++);
844
844
  }
845
845
  }
846
846
  i(o == u.length * 8);
@@ -850,62 +850,62 @@ var Dt;
850
850
  throw new RangeError("Mask value out of range");
851
851
  for (let o = 0; o < this.size; o++)
852
852
  for (let c = 0; c < this.size; c++) {
853
- let v;
853
+ let b;
854
854
  switch (u) {
855
855
  case 0:
856
- v = (c + o) % 2 == 0;
856
+ b = (c + o) % 2 == 0;
857
857
  break;
858
858
  case 1:
859
- v = o % 2 == 0;
859
+ b = o % 2 == 0;
860
860
  break;
861
861
  case 2:
862
- v = c % 3 == 0;
862
+ b = c % 3 == 0;
863
863
  break;
864
864
  case 3:
865
- v = (c + o) % 3 == 0;
865
+ b = (c + o) % 3 == 0;
866
866
  break;
867
867
  case 4:
868
- v = (Math.floor(c / 3) + Math.floor(o / 2)) % 2 == 0;
868
+ b = (Math.floor(c / 3) + Math.floor(o / 2)) % 2 == 0;
869
869
  break;
870
870
  case 5:
871
- v = c * o % 2 + c * o % 3 == 0;
871
+ b = c * o % 2 + c * o % 3 == 0;
872
872
  break;
873
873
  case 6:
874
- v = (c * o % 2 + c * o % 3) % 2 == 0;
874
+ b = (c * o % 2 + c * o % 3) % 2 == 0;
875
875
  break;
876
876
  case 7:
877
- v = ((c + o) % 2 + c * o % 3) % 2 == 0;
877
+ b = ((c + o) % 2 + c * o % 3) % 2 == 0;
878
878
  break;
879
879
  default:
880
880
  throw new Error("Unreachable");
881
881
  }
882
- !this.isFunction[o][c] && v && (this.modules[o][c] = !this.modules[o][c]);
882
+ !this.isFunction[o][c] && b && (this.modules[o][c] = !this.modules[o][c]);
883
883
  }
884
884
  }
885
885
  getPenaltyScore() {
886
886
  let u = 0;
887
- for (let b = 0; b < this.size; b++) {
888
- let B = !1, w = 0, R = [0, 0, 0, 0, 0, 0, 0];
887
+ for (let v = 0; v < this.size; v++) {
888
+ let C = !1, w = 0, R = [0, 0, 0, 0, 0, 0, 0];
889
889
  for (let k = 0; k < this.size; k++)
890
- 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);
891
- u += this.finderPenaltyTerminateAndCount(B, w, R) * e.PENALTY_N3;
890
+ this.modules[v][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[v][k], w = 1);
891
+ u += this.finderPenaltyTerminateAndCount(C, w, R) * e.PENALTY_N3;
892
892
  }
893
- for (let b = 0; b < this.size; b++) {
894
- let B = !1, w = 0, R = [0, 0, 0, 0, 0, 0, 0];
893
+ for (let v = 0; v < this.size; v++) {
894
+ let C = !1, w = 0, R = [0, 0, 0, 0, 0, 0, 0];
895
895
  for (let k = 0; k < this.size; k++)
896
- 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);
897
- u += this.finderPenaltyTerminateAndCount(B, w, R) * e.PENALTY_N3;
896
+ this.modules[k][v] == 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][v], w = 1);
897
+ u += this.finderPenaltyTerminateAndCount(C, w, R) * e.PENALTY_N3;
898
898
  }
899
- for (let b = 0; b < this.size - 1; b++)
900
- for (let B = 0; B < this.size - 1; B++) {
901
- const w = this.modules[b][B];
902
- w == this.modules[b][B + 1] && w == this.modules[b + 1][B] && w == this.modules[b + 1][B + 1] && (u += e.PENALTY_N2);
899
+ for (let v = 0; v < this.size - 1; v++)
900
+ for (let C = 0; C < this.size - 1; C++) {
901
+ const w = this.modules[v][C];
902
+ w == this.modules[v][C + 1] && w == this.modules[v + 1][C] && w == this.modules[v + 1][C + 1] && (u += e.PENALTY_N2);
903
903
  }
904
904
  let o = 0;
905
- for (const b of this.modules)
906
- o = b.reduce((B, w) => B + (w ? 1 : 0), o);
907
- const c = this.size * this.size, v = Math.ceil(Math.abs(o * 20 - c * 10) / c) - 1;
908
- return i(0 <= v && v <= 9), u += v * e.PENALTY_N4, i(0 <= u && u <= 2568888), u;
905
+ for (const v of this.modules)
906
+ o = v.reduce((C, w) => C + (w ? 1 : 0), o);
907
+ const c = this.size * this.size, b = Math.ceil(Math.abs(o * 20 - c * 10) / c) - 1;
908
+ return i(0 <= b && b <= 9), u += b * e.PENALTY_N4, i(0 <= u && u <= 2568888), u;
909
909
  }
910
910
  getAlignmentPatternPositions() {
911
911
  if (this.version == 1)
@@ -913,8 +913,8 @@ var Dt;
913
913
  {
914
914
  const u = Math.floor(this.version / 7) + 2, o = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (u * 2 - 2)) * 2;
915
915
  let c = [6];
916
- for (let v = this.size - 7; c.length < u; v -= o)
917
- c.splice(1, 0, v);
916
+ for (let b = this.size - 7; c.length < u; b -= o)
917
+ c.splice(1, 0, b);
918
918
  return c;
919
919
  }
920
920
  }
@@ -935,22 +935,22 @@ var Dt;
935
935
  if (u < 1 || u > 255)
936
936
  throw new RangeError("Degree out of range");
937
937
  let o = [];
938
- for (let v = 0; v < u - 1; v++)
938
+ for (let b = 0; b < u - 1; b++)
939
939
  o.push(0);
940
940
  o.push(1);
941
941
  let c = 1;
942
- for (let v = 0; v < u; v++) {
943
- for (let b = 0; b < o.length; b++)
944
- o[b] = e.reedSolomonMultiply(o[b], c), b + 1 < o.length && (o[b] ^= o[b + 1]);
942
+ for (let b = 0; b < u; b++) {
943
+ for (let v = 0; v < o.length; v++)
944
+ o[v] = e.reedSolomonMultiply(o[v], c), v + 1 < o.length && (o[v] ^= o[v + 1]);
945
945
  c = e.reedSolomonMultiply(c, 2);
946
946
  }
947
947
  return o;
948
948
  }
949
949
  static reedSolomonComputeRemainder(u, o) {
950
- let c = o.map((v) => 0);
951
- for (const v of u) {
952
- const b = v ^ c.shift();
953
- c.push(0), o.forEach((B, w) => c[w] ^= e.reedSolomonMultiply(B, b));
950
+ let c = o.map((b) => 0);
951
+ for (const b of u) {
952
+ const v = b ^ c.shift();
953
+ c.push(0), o.forEach((C, w) => c[w] ^= e.reedSolomonMultiply(C, v));
954
954
  }
955
955
  return c;
956
956
  }
@@ -958,8 +958,8 @@ var Dt;
958
958
  if (u >>> 8 || o >>> 8)
959
959
  throw new RangeError("Byte out of range");
960
960
  let c = 0;
961
- for (let v = 7; v >= 0; v--)
962
- c = c << 1 ^ (c >>> 7) * 285, c ^= (o >>> v & 1) * u;
961
+ for (let b = 7; b >= 0; b--)
962
+ c = c << 1 ^ (c >>> 7) * 285, c ^= (o >>> b & 1) * u;
963
963
  return i(c >>> 8 == 0), c;
964
964
  }
965
965
  finderPenaltyCountPatterns(u) {
@@ -990,8 +990,8 @@ var Dt;
990
990
  function r(u, o, c) {
991
991
  if (o < 0 || o > 31 || u >>> o)
992
992
  throw new RangeError("Value out of range");
993
- for (let v = o - 1; v >= 0; v--)
994
- c.push(u >>> v & 1);
993
+ for (let b = o - 1; b >= 0; b--)
994
+ c.push(u >>> b & 1);
995
995
  }
996
996
  function a(u, o) {
997
997
  return (u >>> o & 1) != 0;
@@ -1017,8 +1017,8 @@ var Dt;
1017
1017
  throw new RangeError("String contains non-numeric characters");
1018
1018
  let o = [];
1019
1019
  for (let c = 0; c < u.length; ) {
1020
- const v = Math.min(u.length - c, 3);
1021
- r(parseInt(u.substr(c, v), 10), v * 3 + 1, o), c += v;
1020
+ const b = Math.min(u.length - c, 3);
1021
+ r(parseInt(u.substr(c, b), 10), b * 3 + 1, o), c += b;
1022
1022
  }
1023
1023
  return new y(y.Mode.NUMERIC, u.length, o);
1024
1024
  }
@@ -1027,8 +1027,8 @@ var Dt;
1027
1027
  throw new RangeError("String contains unencodable characters in alphanumeric mode");
1028
1028
  let o = [], c;
1029
1029
  for (c = 0; c + 2 <= u.length; c += 2) {
1030
- let v = y.ALPHANUMERIC_CHARSET.indexOf(u.charAt(c)) * 45;
1031
- v += y.ALPHANUMERIC_CHARSET.indexOf(u.charAt(c + 1)), r(v, 11, o);
1030
+ let b = y.ALPHANUMERIC_CHARSET.indexOf(u.charAt(c)) * 45;
1031
+ b += y.ALPHANUMERIC_CHARSET.indexOf(u.charAt(c + 1)), r(b, 11, o);
1032
1032
  }
1033
1033
  return c < u.length && r(y.ALPHANUMERIC_CHARSET.indexOf(u.charAt(c)), 6, o), new y(y.Mode.ALPHANUMERIC, u.length, o);
1034
1034
  }
@@ -1060,11 +1060,11 @@ var Dt;
1060
1060
  }
1061
1061
  static getTotalBits(u, o) {
1062
1062
  let c = 0;
1063
- for (const v of u) {
1064
- const b = v.mode.numCharCountBits(o);
1065
- if (v.numChars >= 1 << b)
1063
+ for (const b of u) {
1064
+ const v = b.mode.numCharCountBits(o);
1065
+ if (b.numChars >= 1 << v)
1066
1066
  return 1 / 0;
1067
- c += 4 + b + v.bitData.length;
1067
+ c += 4 + v + b.bitData.length;
1068
1068
  }
1069
1069
  return c;
1070
1070
  }
@@ -1141,13 +1141,13 @@ function Ba(f, e) {
1141
1141
  function Ca(f, e, t, r) {
1142
1142
  if (r == null)
1143
1143
  return null;
1144
- const a = t ? xn : 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;
1145
- let b = null;
1144
+ const a = t ? xn : 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, b = r.y == null ? f.length / 2 - o / 2 : r.y * x;
1145
+ let v = null;
1146
1146
  if (r.excavate) {
1147
- let B = Math.floor(c), w = Math.floor(v), R = Math.ceil(u + c - B), k = Math.ceil(o + v - w);
1148
- b = { x: B, y: w, w: R, h: k };
1147
+ let C = Math.floor(c), w = Math.floor(b), R = Math.ceil(u + c - C), k = Math.ceil(o + b - w);
1148
+ v = { x: C, y: w, w: R, h: k };
1149
1149
  }
1150
- return { x: c, y: v, h: o, w: u, excavation: b };
1150
+ return { x: c, y: b, h: o, w: u, excavation: v };
1151
1151
  }
1152
1152
  var Ma = function() {
1153
1153
  try {
@@ -1176,42 +1176,42 @@ function vn(f) {
1176
1176
  "includeMargin",
1177
1177
  "style",
1178
1178
  "imageSettings"
1179
- ]), v = o == null ? void 0 : o.src, b = fi(null), B = fi(null), [w, R] = _r(!1);
1179
+ ]), b = o == null ? void 0 : o.src, v = fi(null), C = fi(null), [w, R] = _r(!1);
1180
1180
  Ft(() => {
1181
- if (b.current != null) {
1182
- const F = b.current, P = F.getContext("2d");
1181
+ if (v.current != null) {
1182
+ const F = v.current, P = F.getContext("2d");
1183
1183
  if (!P)
1184
1184
  return;
1185
1185
  let T = tr.QrCode.encodeText(t, pa[a]).getModules();
1186
- const H = x ? xn : 0, $ = T.length + H * 2, Y = Ca(T, r, x, o), X = B.current, Q = Y != null && X !== null && X.complete && X.naturalHeight !== 0 && X.naturalWidth !== 0;
1186
+ const H = x ? xn : 0, $ = T.length + H * 2, Y = Ca(T, r, x, o), X = C.current, Q = Y != null && X !== null && X.complete && X.naturalHeight !== 0 && X.naturalWidth !== 0;
1187
1187
  Q && Y.excavation != null && (T = Ba(T, Y.excavation));
1188
1188
  const U = window.devicePixelRatio || 1;
1189
1189
  F.height = F.width = r * U;
1190
1190
  const A = r / $ * U;
1191
1191
  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) {
1192
- n.forEach(function(g, C) {
1193
- g && P.fillRect(C + H, d + H, 1, 1);
1192
+ n.forEach(function(g, B) {
1193
+ g && P.fillRect(B + H, d + H, 1, 1);
1194
1194
  });
1195
1195
  }), Q && P.drawImage(X, Y.x + H, Y.y + H, Y.w, Y.h);
1196
1196
  }
1197
1197
  }), Ft(() => {
1198
1198
  R(!1);
1199
- }, [v]);
1199
+ }, [b]);
1200
1200
  const k = si({ height: r, width: r }, u);
1201
1201
  let z = null;
1202
- return v != null && (z = /* @__PURE__ */ ar.createElement("img", {
1203
- src: v,
1204
- key: v,
1202
+ return b != null && (z = /* @__PURE__ */ ar.createElement("img", {
1203
+ src: b,
1204
+ key: b,
1205
1205
  style: { display: "none" },
1206
1206
  onLoad: () => {
1207
1207
  R(!0);
1208
1208
  },
1209
- ref: B
1209
+ ref: C
1210
1210
  })), /* @__PURE__ */ ar.createElement(ar.Fragment, null, /* @__PURE__ */ ar.createElement("canvas", si({
1211
1211
  style: k,
1212
1212
  height: r,
1213
1213
  width: r,
1214
- ref: b
1214
+ ref: v
1215
1215
  }, c)), z);
1216
1216
  }
1217
1217
  var bn = { exports: {} };
@@ -1342,7 +1342,7 @@ function $e() {
1342
1342
  return this.init.prototype.extend(this);
1343
1343
  }
1344
1344
  };
1345
- }(), v = o.WordArray = c.extend({
1345
+ }(), b = o.WordArray = c.extend({
1346
1346
  /**
1347
1347
  * Initializes a newly created word array.
1348
1348
  *
@@ -1372,7 +1372,7 @@ function $e() {
1372
1372
  * var string = wordArray.toString(CryptoJS.enc.Utf8);
1373
1373
  */
1374
1374
  toString: function(F) {
1375
- return (F || B).stringify(this);
1375
+ return (F || C).stringify(this);
1376
1376
  },
1377
1377
  /**
1378
1378
  * Concatenates a word array to this word array.
@@ -1437,9 +1437,9 @@ function $e() {
1437
1437
  random: function(F) {
1438
1438
  for (var P = [], T = 0; T < F; T += 4)
1439
1439
  P.push(y());
1440
- return new v.init(P, F);
1440
+ return new b.init(P, F);
1441
1441
  }
1442
- }), b = u.enc = {}, B = b.Hex = {
1442
+ }), v = u.enc = {}, C = v.Hex = {
1443
1443
  /**
1444
1444
  * Converts a word array to a hex string.
1445
1445
  *
@@ -1476,9 +1476,9 @@ function $e() {
1476
1476
  parse: function(F) {
1477
1477
  for (var P = F.length, T = [], H = 0; H < P; H += 2)
1478
1478
  T[H >>> 3] |= parseInt(F.substr(H, 2), 16) << 24 - H % 8 * 4;
1479
- return new v.init(T, P / 2);
1479
+ return new b.init(T, P / 2);
1480
1480
  }
1481
- }, w = b.Latin1 = {
1481
+ }, w = v.Latin1 = {
1482
1482
  /**
1483
1483
  * Converts a word array to a Latin1 string.
1484
1484
  *
@@ -1515,9 +1515,9 @@ function $e() {
1515
1515
  parse: function(F) {
1516
1516
  for (var P = F.length, T = [], H = 0; H < P; H++)
1517
1517
  T[H >>> 2] |= (F.charCodeAt(H) & 255) << 24 - H % 4 * 8;
1518
- return new v.init(T, P);
1518
+ return new b.init(T, P);
1519
1519
  }
1520
- }, R = b.Utf8 = {
1520
+ }, R = v.Utf8 = {
1521
1521
  /**
1522
1522
  * Converts a word array to a UTF-8 string.
1523
1523
  *
@@ -1563,7 +1563,7 @@ function $e() {
1563
1563
  * bufferedBlockAlgorithm.reset();
1564
1564
  */
1565
1565
  reset: function() {
1566
- this._data = new v.init(), this._nDataBytes = 0;
1566
+ this._data = new b.init(), this._nDataBytes = 0;
1567
1567
  },
1568
1568
  /**
1569
1569
  * Adds new data to this block algorithm's buffer.
@@ -1601,7 +1601,7 @@ function $e() {
1601
1601
  this._doProcessBlock(H, n);
1602
1602
  P = H.splice(0, U), T.sigBytes -= A;
1603
1603
  }
1604
- return new v.init(P, A);
1604
+ return new b.init(P, A);
1605
1605
  },
1606
1606
  /**
1607
1607
  * Creates a copy of this object.
@@ -1929,11 +1929,11 @@ function Er() {
1929
1929
  * var x32WordArray = x64WordArray.toX32();
1930
1930
  */
1931
1931
  toX32: function() {
1932
- for (var o = this.words, c = o.length, v = [], b = 0; b < c; b++) {
1933
- var B = o[b];
1934
- v.push(B.high), v.push(B.low);
1932
+ for (var o = this.words, c = o.length, b = [], v = 0; v < c; v++) {
1933
+ var C = o[v];
1934
+ b.push(C.high), b.push(C.low);
1935
1935
  }
1936
- return x.create(v, this.sigBytes);
1936
+ return x.create(b, this.sigBytes);
1937
1937
  },
1938
1938
  /**
1939
1939
  * Creates a copy of this word array.
@@ -1945,8 +1945,8 @@ function Er() {
1945
1945
  * var clone = x64WordArray.clone();
1946
1946
  */
1947
1947
  clone: function() {
1948
- for (var o = y.clone.call(this), c = o.words = this.words.slice(0), v = c.length, b = 0; b < v; b++)
1949
- c[b] = c[b].clone();
1948
+ for (var o = y.clone.call(this), c = o.words = this.words.slice(0), b = c.length, v = 0; v < b; v++)
1949
+ c[v] = c[v].clone();
1950
1950
  return o;
1951
1951
  }
1952
1952
  });
@@ -1964,8 +1964,8 @@ function Da() {
1964
1964
  if (typeof ArrayBuffer == "function") {
1965
1965
  var r = t, a = r.lib, i = a.WordArray, y = i.init, x = i.init = function(u) {
1966
1966
  if (u instanceof ArrayBuffer && (u = new Uint8Array(u)), (u instanceof Int8Array || typeof Uint8ClampedArray < "u" && u instanceof Uint8ClampedArray || u instanceof Int16Array || u instanceof Uint16Array || u instanceof Int32Array || u instanceof Uint32Array || u instanceof Float32Array || u instanceof Float64Array) && (u = new Uint8Array(u.buffer, u.byteOffset, u.byteLength)), u instanceof Uint8Array) {
1967
- for (var o = u.byteLength, c = [], v = 0; v < o; v++)
1968
- c[v >>> 2] |= u[v] << 24 - v % 4 * 8;
1967
+ for (var o = u.byteLength, c = [], b = 0; b < o; b++)
1968
+ c[b >>> 2] |= u[b] << 24 - b % 4 * 8;
1969
1969
  y.call(this, c, o);
1970
1970
  } else
1971
1971
  y.apply(this, arguments);
@@ -1999,11 +1999,11 @@ function Ra() {
1999
1999
  * var utf16String = CryptoJS.enc.Utf16.stringify(wordArray);
2000
2000
  */
2001
2001
  stringify: function(u) {
2002
- for (var o = u.words, c = u.sigBytes, v = [], b = 0; b < c; b += 2) {
2003
- var B = o[b >>> 2] >>> 16 - b % 4 * 8 & 65535;
2004
- v.push(String.fromCharCode(B));
2002
+ for (var o = u.words, c = u.sigBytes, b = [], v = 0; v < c; v += 2) {
2003
+ var C = o[v >>> 2] >>> 16 - v % 4 * 8 & 65535;
2004
+ b.push(String.fromCharCode(C));
2005
2005
  }
2006
- return v.join("");
2006
+ return b.join("");
2007
2007
  },
2008
2008
  /**
2009
2009
  * Converts a UTF-16 BE string to a word array.
@@ -2019,8 +2019,8 @@ function Ra() {
2019
2019
  * var wordArray = CryptoJS.enc.Utf16.parse(utf16String);
2020
2020
  */
2021
2021
  parse: function(u) {
2022
- for (var o = u.length, c = [], v = 0; v < o; v++)
2023
- c[v >>> 1] |= u.charCodeAt(v) << 16 - v % 2 * 16;
2022
+ for (var o = u.length, c = [], b = 0; b < o; b++)
2023
+ c[b >>> 1] |= u.charCodeAt(b) << 16 - b % 2 * 16;
2024
2024
  return i.create(c, o * 2);
2025
2025
  }
2026
2026
  }, y.Utf16LE = {
@@ -2038,11 +2038,11 @@ function Ra() {
2038
2038
  * var utf16Str = CryptoJS.enc.Utf16LE.stringify(wordArray);
2039
2039
  */
2040
2040
  stringify: function(u) {
2041
- for (var o = u.words, c = u.sigBytes, v = [], b = 0; b < c; b += 2) {
2042
- var B = x(o[b >>> 2] >>> 16 - b % 4 * 8 & 65535);
2043
- v.push(String.fromCharCode(B));
2041
+ for (var o = u.words, c = u.sigBytes, b = [], v = 0; v < c; v += 2) {
2042
+ var C = x(o[v >>> 2] >>> 16 - v % 4 * 8 & 65535);
2043
+ b.push(String.fromCharCode(C));
2044
2044
  }
2045
- return v.join("");
2045
+ return b.join("");
2046
2046
  },
2047
2047
  /**
2048
2048
  * Converts a UTF-16 LE string to a word array.
@@ -2058,8 +2058,8 @@ function Ra() {
2058
2058
  * var wordArray = CryptoJS.enc.Utf16LE.parse(utf16Str);
2059
2059
  */
2060
2060
  parse: function(u) {
2061
- for (var o = u.length, c = [], v = 0; v < o; v++)
2062
- c[v >>> 1] |= x(u.charCodeAt(v) << 16 - v % 2 * 16);
2061
+ for (var o = u.length, c = [], b = 0; b < o; b++)
2062
+ c[b >>> 1] |= x(u.charCodeAt(b) << 16 - b % 2 * 16);
2063
2063
  return i.create(c, o * 2);
2064
2064
  }
2065
2065
  };
@@ -2093,16 +2093,16 @@ function kt() {
2093
2093
  * var base64String = CryptoJS.enc.Base64.stringify(wordArray);
2094
2094
  */
2095
2095
  stringify: function(u) {
2096
- var o = u.words, c = u.sigBytes, v = this._map;
2096
+ var o = u.words, c = u.sigBytes, b = this._map;
2097
2097
  u.clamp();
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, z = w << 16 | R << 8 | k, F = 0; F < 4 && B + F * 0.75 < c; F++)
2100
- b.push(v.charAt(z >>> 6 * (3 - F) & 63));
2101
- var P = v.charAt(64);
2098
+ for (var v = [], C = 0; C < c; C += 3)
2099
+ 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, z = w << 16 | R << 8 | k, F = 0; F < 4 && C + F * 0.75 < c; F++)
2100
+ v.push(b.charAt(z >>> 6 * (3 - F) & 63));
2101
+ var P = b.charAt(64);
2102
2102
  if (P)
2103
- for (; b.length % 4; )
2104
- b.push(P);
2105
- return b.join("");
2103
+ for (; v.length % 4; )
2104
+ v.push(P);
2105
+ return v.join("");
2106
2106
  },
2107
2107
  /**
2108
2108
  * Converts a Base64 string to a word array.
@@ -2118,28 +2118,28 @@ function kt() {
2118
2118
  * var wordArray = CryptoJS.enc.Base64.parse(base64String);
2119
2119
  */
2120
2120
  parse: function(u) {
2121
- var o = u.length, c = this._map, v = this._reverseMap;
2122
- if (!v) {
2123
- v = this._reverseMap = [];
2124
- for (var b = 0; b < c.length; b++)
2125
- v[c.charCodeAt(b)] = b;
2121
+ var o = u.length, c = this._map, b = this._reverseMap;
2122
+ if (!b) {
2123
+ b = this._reverseMap = [];
2124
+ for (var v = 0; v < c.length; v++)
2125
+ b[c.charCodeAt(v)] = v;
2126
2126
  }
2127
- var B = c.charAt(64);
2128
- if (B) {
2129
- var w = u.indexOf(B);
2127
+ var C = c.charAt(64);
2128
+ if (C) {
2129
+ var w = u.indexOf(C);
2130
2130
  w !== -1 && (o = w);
2131
2131
  }
2132
- return x(u, o, v);
2132
+ return x(u, o, b);
2133
2133
  },
2134
2134
  _map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
2135
2135
  };
2136
2136
  function x(u, o, c) {
2137
- for (var v = [], b = 0, B = 0; B < o; B++)
2138
- if (B % 4) {
2139
- var w = c[u.charCodeAt(B - 1)] << B % 4 * 2, R = c[u.charCodeAt(B)] >>> 6 - B % 4 * 2, k = w | R;
2140
- v[b >>> 2] |= k << 24 - b % 4 * 8, b++;
2137
+ for (var b = [], v = 0, C = 0; C < o; C++)
2138
+ if (C % 4) {
2139
+ var w = c[u.charCodeAt(C - 1)] << C % 4 * 2, R = c[u.charCodeAt(C)] >>> 6 - C % 4 * 2, k = w | R;
2140
+ b[v >>> 2] |= k << 24 - v % 4 * 8, v++;
2141
2141
  }
2142
- return i.create(v, b);
2142
+ return i.create(b, v);
2143
2143
  }
2144
2144
  }(), t.enc.Base64;
2145
2145
  });
@@ -2171,16 +2171,16 @@ function ka() {
2171
2171
  */
2172
2172
  stringify: function(u, o) {
2173
2173
  o === void 0 && (o = !0);
2174
- var c = u.words, v = u.sigBytes, b = o ? this._safe_map : this._map;
2174
+ var c = u.words, b = u.sigBytes, v = o ? this._safe_map : this._map;
2175
2175
  u.clamp();
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, z = c[w + 2 >>> 2] >>> 24 - (w + 2) % 4 * 8 & 255, F = R << 16 | k << 8 | z, P = 0; P < 4 && w + P * 0.75 < v; P++)
2178
- B.push(b.charAt(F >>> 6 * (3 - P) & 63));
2179
- var T = b.charAt(64);
2176
+ for (var C = [], w = 0; w < b; 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, z = c[w + 2 >>> 2] >>> 24 - (w + 2) % 4 * 8 & 255, F = R << 16 | k << 8 | z, P = 0; P < 4 && w + P * 0.75 < b; P++)
2178
+ C.push(v.charAt(F >>> 6 * (3 - P) & 63));
2179
+ var T = v.charAt(64);
2180
2180
  if (T)
2181
- for (; B.length % 4; )
2182
- B.push(T);
2183
- return B.join("");
2181
+ for (; C.length % 4; )
2182
+ C.push(T);
2183
+ return C.join("");
2184
2184
  },
2185
2185
  /**
2186
2186
  * Converts a Base64url string to a word array.
@@ -2199,29 +2199,29 @@ function ka() {
2199
2199
  */
2200
2200
  parse: function(u, o) {
2201
2201
  o === void 0 && (o = !0);
2202
- var c = u.length, v = o ? this._safe_map : this._map, b = this._reverseMap;
2203
- if (!b) {
2204
- b = this._reverseMap = [];
2205
- for (var B = 0; B < v.length; B++)
2206
- b[v.charCodeAt(B)] = B;
2202
+ var c = u.length, b = o ? this._safe_map : this._map, v = this._reverseMap;
2203
+ if (!v) {
2204
+ v = this._reverseMap = [];
2205
+ for (var C = 0; C < b.length; C++)
2206
+ v[b.charCodeAt(C)] = C;
2207
2207
  }
2208
- var w = v.charAt(64);
2208
+ var w = b.charAt(64);
2209
2209
  if (w) {
2210
2210
  var R = u.indexOf(w);
2211
2211
  R !== -1 && (c = R);
2212
2212
  }
2213
- return x(u, c, b);
2213
+ return x(u, c, v);
2214
2214
  },
2215
2215
  _map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
2216
2216
  _safe_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
2217
2217
  };
2218
2218
  function x(u, o, c) {
2219
- for (var v = [], b = 0, B = 0; B < o; B++)
2220
- if (B % 4) {
2221
- var w = c[u.charCodeAt(B - 1)] << B % 4 * 2, R = c[u.charCodeAt(B)] >>> 6 - B % 4 * 2, k = w | R;
2222
- v[b >>> 2] |= k << 24 - b % 4 * 8, b++;
2219
+ for (var b = [], v = 0, C = 0; C < o; C++)
2220
+ if (C % 4) {
2221
+ var w = c[u.charCodeAt(C - 1)] << C % 4 * 2, R = c[u.charCodeAt(C)] >>> 6 - C % 4 * 2, k = w | R;
2222
+ b[v >>> 2] |= k << 24 - v % 4 * 8, v++;
2223
2223
  }
2224
- return i.create(v, b);
2224
+ return i.create(b, v);
2225
2225
  }
2226
2226
  }(), t.enc.Base64url;
2227
2227
  });
@@ -2253,8 +2253,8 @@ function Pt() {
2253
2253
  var F = k + z, P = R[F];
2254
2254
  R[F] = (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], Y = 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], S = R[k + 11], N = R[k + 12], q = R[k + 13], D = R[k + 14], h = R[k + 15], E = T[0], j = T[1], K = T[2], W = T[3];
2257
- E = v(E, j, K, W, H, 7, o[0]), W = v(W, E, j, K, $, 12, o[1]), K = v(K, W, E, j, Y, 17, o[2]), j = v(j, K, W, E, X, 22, o[3]), E = v(E, j, K, W, Q, 7, o[4]), W = v(W, E, j, K, U, 12, o[5]), K = v(K, W, E, j, A, 17, o[6]), j = v(j, K, W, E, n, 22, o[7]), E = v(E, j, K, W, d, 7, o[8]), W = v(W, E, j, K, g, 12, o[9]), K = v(K, W, E, j, C, 17, o[10]), j = v(j, K, W, E, S, 22, o[11]), E = v(E, j, K, W, N, 7, o[12]), W = v(W, E, j, K, q, 12, o[13]), K = v(K, W, E, j, D, 17, o[14]), j = v(j, K, W, E, h, 22, o[15]), E = b(E, j, K, W, $, 5, o[16]), W = b(W, E, j, K, A, 9, o[17]), K = b(K, W, E, j, S, 14, o[18]), j = b(j, K, W, E, H, 20, o[19]), E = b(E, j, K, W, U, 5, o[20]), W = b(W, E, j, K, C, 9, o[21]), K = b(K, W, E, j, h, 14, o[22]), j = b(j, K, W, E, Q, 20, o[23]), E = b(E, j, K, W, g, 5, o[24]), W = b(W, E, j, K, D, 9, o[25]), K = b(K, W, E, j, X, 14, o[26]), j = b(j, K, W, E, d, 20, o[27]), E = b(E, j, K, W, q, 5, o[28]), W = b(W, E, j, K, Y, 9, o[29]), K = b(K, W, E, j, n, 14, o[30]), j = b(j, K, W, E, N, 20, o[31]), E = B(E, j, K, W, U, 4, o[32]), W = B(W, E, j, K, d, 11, o[33]), K = B(K, W, E, j, S, 16, o[34]), j = B(j, K, W, E, D, 23, o[35]), E = B(E, j, K, W, $, 4, o[36]), W = B(W, E, j, K, Q, 11, o[37]), K = B(K, W, E, j, n, 16, o[38]), j = B(j, K, W, E, C, 23, o[39]), E = B(E, j, K, W, q, 4, o[40]), W = B(W, E, j, K, H, 11, o[41]), K = B(K, W, E, j, X, 16, o[42]), j = B(j, K, W, E, A, 23, o[43]), E = B(E, j, K, W, g, 4, o[44]), W = B(W, E, j, K, N, 11, o[45]), K = B(K, W, E, j, h, 16, o[46]), j = B(j, K, W, E, Y, 23, o[47]), E = w(E, j, K, W, H, 6, o[48]), W = w(W, E, j, K, n, 10, o[49]), K = w(K, W, E, j, D, 15, o[50]), j = w(j, K, W, E, U, 21, o[51]), E = w(E, j, K, W, N, 6, o[52]), W = w(W, E, j, K, X, 10, o[53]), K = w(K, W, E, j, C, 15, o[54]), j = w(j, K, W, E, $, 21, o[55]), E = w(E, j, K, W, d, 6, o[56]), W = w(W, E, j, K, h, 10, o[57]), K = w(K, W, E, j, A, 15, o[58]), j = w(j, K, W, E, q, 21, o[59]), E = w(E, j, K, W, Q, 6, o[60]), W = w(W, E, j, K, S, 10, o[61]), K = w(K, W, E, j, Y, 15, o[62]), j = w(j, K, W, E, g, 21, o[63]), T[0] = T[0] + E | 0, T[1] = T[1] + j | 0, T[2] = T[2] + K | 0, T[3] = T[3] + W | 0;
2256
+ var T = this._hash.words, H = R[k + 0], $ = R[k + 1], Y = 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], S = R[k + 11], N = R[k + 12], q = R[k + 13], D = R[k + 14], h = R[k + 15], E = T[0], j = T[1], K = T[2], W = T[3];
2257
+ E = b(E, j, K, W, H, 7, o[0]), W = b(W, E, j, K, $, 12, o[1]), K = b(K, W, E, j, Y, 17, o[2]), j = b(j, K, W, E, X, 22, o[3]), E = b(E, j, K, W, Q, 7, o[4]), W = b(W, E, j, K, U, 12, o[5]), K = b(K, W, E, j, A, 17, o[6]), j = b(j, K, W, E, n, 22, o[7]), E = b(E, j, K, W, d, 7, o[8]), W = b(W, E, j, K, g, 12, o[9]), K = b(K, W, E, j, B, 17, o[10]), j = b(j, K, W, E, S, 22, o[11]), E = b(E, j, K, W, N, 7, o[12]), W = b(W, E, j, K, q, 12, o[13]), K = b(K, W, E, j, D, 17, o[14]), j = b(j, K, W, E, h, 22, o[15]), E = v(E, j, K, W, $, 5, o[16]), W = v(W, E, j, K, A, 9, o[17]), K = v(K, W, E, j, S, 14, o[18]), j = v(j, K, W, E, H, 20, o[19]), E = v(E, j, K, W, U, 5, o[20]), W = v(W, E, j, K, B, 9, o[21]), K = v(K, W, E, j, h, 14, o[22]), j = v(j, K, W, E, Q, 20, o[23]), E = v(E, j, K, W, g, 5, o[24]), W = v(W, E, j, K, D, 9, o[25]), K = v(K, W, E, j, X, 14, o[26]), j = v(j, K, W, E, d, 20, o[27]), E = v(E, j, K, W, q, 5, o[28]), W = v(W, E, j, K, Y, 9, o[29]), K = v(K, W, E, j, n, 14, o[30]), j = v(j, K, W, E, N, 20, o[31]), E = C(E, j, K, W, U, 4, o[32]), W = C(W, E, j, K, d, 11, o[33]), K = C(K, W, E, j, S, 16, o[34]), j = C(j, K, W, E, D, 23, o[35]), E = C(E, j, K, W, $, 4, o[36]), W = C(W, E, j, K, Q, 11, o[37]), K = C(K, W, E, j, n, 16, o[38]), j = C(j, K, W, E, B, 23, o[39]), E = C(E, j, K, W, q, 4, o[40]), W = C(W, E, j, K, H, 11, o[41]), K = C(K, W, E, j, X, 16, o[42]), j = C(j, K, W, E, A, 23, o[43]), E = C(E, j, K, W, g, 4, o[44]), W = C(W, E, j, K, N, 11, o[45]), K = C(K, W, E, j, h, 16, o[46]), j = C(j, K, W, E, Y, 23, o[47]), E = w(E, j, K, W, H, 6, o[48]), W = w(W, E, j, K, n, 10, o[49]), K = w(K, W, E, j, D, 15, o[50]), j = w(j, K, W, E, U, 21, o[51]), E = w(E, j, K, W, N, 6, o[52]), W = w(W, E, j, K, X, 10, o[53]), K = w(K, W, E, j, B, 15, o[54]), j = w(j, K, W, E, $, 21, o[55]), E = w(E, j, K, W, d, 6, o[56]), W = w(W, E, j, K, h, 10, o[57]), K = w(K, W, E, j, A, 15, o[58]), j = w(j, K, W, E, q, 21, o[59]), E = w(E, j, K, W, Q, 6, o[60]), W = w(W, E, j, K, S, 10, o[61]), K = w(K, W, E, j, Y, 15, o[62]), j = w(j, K, W, E, g, 21, o[63]), T[0] = T[0] + E | 0, T[1] = T[1] + j | 0, T[2] = T[2] + K | 0, T[3] = T[3] + W | 0;
2258
2258
  },
2259
2259
  _doFinalize: function() {
2260
2260
  var R = this._data, k = R.words, z = this._nDataBytes * 8, F = R.sigBytes * 8;
@@ -2272,15 +2272,15 @@ function Pt() {
2272
2272
  return R._hash = this._hash.clone(), R;
2273
2273
  }
2274
2274
  });
2275
- function v(R, k, z, F, P, T, H) {
2275
+ function b(R, k, z, F, P, T, H) {
2276
2276
  var $ = R + (k & z | ~k & F) + P + H;
2277
2277
  return ($ << T | $ >>> 32 - T) + k;
2278
2278
  }
2279
- function b(R, k, z, F, P, T, H) {
2279
+ function v(R, k, z, F, P, T, H) {
2280
2280
  var $ = R + (k & F | z & ~F) + P + H;
2281
2281
  return ($ << T | $ >>> 32 - T) + k;
2282
2282
  }
2283
- function B(R, k, z, F, P, T, H) {
2283
+ function C(R, k, z, F, P, T, H) {
2284
2284
  var $ = R + (k ^ z ^ F) + P + H;
2285
2285
  return ($ << T | $ >>> 32 - T) + k;
2286
2286
  }
@@ -2310,22 +2310,22 @@ function yn() {
2310
2310
  3285377520
2311
2311
  ]);
2312
2312
  },
2313
- _doProcessBlock: function(c, v) {
2314
- for (var b = this._hash.words, B = b[0], w = b[1], R = b[2], k = b[3], z = b[4], F = 0; F < 80; F++) {
2313
+ _doProcessBlock: function(c, b) {
2314
+ for (var v = this._hash.words, C = v[0], w = v[1], R = v[2], k = v[3], z = v[4], F = 0; F < 80; F++) {
2315
2315
  if (F < 16)
2316
- u[F] = c[v + F] | 0;
2316
+ u[F] = c[b + F] | 0;
2317
2317
  else {
2318
2318
  var P = u[F - 3] ^ u[F - 8] ^ u[F - 14] ^ u[F - 16];
2319
2319
  u[F] = P << 1 | P >>> 31;
2320
2320
  }
2321
- var T = (B << 5 | B >>> 27) + z + u[F];
2322
- F < 20 ? T += (w & R | ~w & k) + 1518500249 : F < 40 ? T += (w ^ R ^ k) + 1859775393 : F < 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;
2321
+ var T = (C << 5 | C >>> 27) + z + u[F];
2322
+ F < 20 ? T += (w & R | ~w & k) + 1518500249 : F < 40 ? T += (w ^ R ^ k) + 1859775393 : F < 60 ? T += (w & R | w & k | R & k) - 1894007588 : T += (w ^ R ^ k) - 899497514, z = k, k = R, R = w << 30 | w >>> 2, w = C, C = 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] + z | 0;
2324
+ v[0] = v[0] + C | 0, v[1] = v[1] + w | 0, v[2] = v[2] + R | 0, v[3] = v[3] + k | 0, v[4] = v[4] + z | 0;
2325
2325
  },
2326
2326
  _doFinalize: function() {
2327
- var c = this._data, v = c.words, b = this._nDataBytes * 8, B = c.sigBytes * 8;
2328
- 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;
2327
+ var c = this._data, b = c.words, v = this._nDataBytes * 8, C = c.sigBytes * 8;
2328
+ return b[C >>> 5] |= 128 << 24 - C % 32, b[(C + 64 >>> 9 << 4) + 14] = Math.floor(v / 4294967296), b[(C + 64 >>> 9 << 4) + 15] = v, c.sigBytes = b.length * 4, this._process(), this._hash;
2329
2329
  },
2330
2330
  clone: function() {
2331
2331
  var c = y.clone.call(this);
@@ -2346,7 +2346,7 @@ function Lf() {
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(z) {
2349
+ function C(z) {
2350
2350
  for (var F = r.sqrt(z), P = 2; P <= F; P++)
2351
2351
  if (!(z % P))
2352
2352
  return !1;
@@ -2356,35 +2356,35 @@ function Lf() {
2356
2356
  return (z - (z | 0)) * 4294967296 | 0;
2357
2357
  }
2358
2358
  for (var R = 2, k = 0; k < 64; )
2359
- B(R) && (k < 8 && (o[k] = w(r.pow(R, 1 / 2))), c[k] = w(r.pow(R, 1 / 3)), k++), R++;
2359
+ C(R) && (k < 8 && (o[k] = w(r.pow(R, 1 / 2))), c[k] = w(r.pow(R, 1 / 3)), k++), R++;
2360
2360
  })();
2361
- var v = [], b = u.SHA256 = x.extend({
2361
+ var b = [], v = u.SHA256 = x.extend({
2362
2362
  _doReset: function() {
2363
2363
  this._hash = new y.init(o.slice(0));
2364
2364
  },
2365
- _doProcessBlock: function(B, w) {
2365
+ _doProcessBlock: function(C, w) {
2366
2366
  for (var R = this._hash.words, k = R[0], z = R[1], F = R[2], P = R[3], T = R[4], H = R[5], $ = R[6], Y = R[7], X = 0; X < 64; X++) {
2367
2367
  if (X < 16)
2368
- v[X] = B[w + X] | 0;
2368
+ b[X] = C[w + X] | 0;
2369
2369
  else {
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
- v[X] = U + v[X - 7] + n + v[X - 16];
2370
+ var Q = b[X - 15], U = (Q << 25 | Q >>> 7) ^ (Q << 14 | Q >>> 18) ^ Q >>> 3, A = b[X - 2], n = (A << 15 | A >>> 17) ^ (A << 13 | A >>> 19) ^ A >>> 10;
2371
+ b[X] = U + b[X - 7] + n + b[X - 16];
2372
2372
  }
2373
- var d = T & H ^ ~T & $, g = k & z ^ k & F ^ z & F, C = (k << 30 | k >>> 2) ^ (k << 19 | k >>> 13) ^ (k << 10 | k >>> 22), S = (T << 26 | T >>> 6) ^ (T << 21 | T >>> 11) ^ (T << 7 | T >>> 25), N = Y + S + d + c[X] + v[X], q = C + g;
2373
+ var d = T & H ^ ~T & $, g = k & z ^ k & F ^ z & F, B = (k << 30 | k >>> 2) ^ (k << 19 | k >>> 13) ^ (k << 10 | k >>> 22), S = (T << 26 | T >>> 6) ^ (T << 21 | T >>> 11) ^ (T << 7 | T >>> 25), N = Y + S + d + c[X] + b[X], q = B + g;
2374
2374
  Y = $, $ = H, H = T, T = P + N | 0, P = F, F = z, z = k, k = N + q | 0;
2375
2375
  }
2376
2376
  R[0] = R[0] + k | 0, R[1] = R[1] + z | 0, R[2] = R[2] + F | 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] + Y | 0;
2377
2377
  },
2378
2378
  _doFinalize: function() {
2379
- var B = this._data, w = B.words, R = this._nDataBytes * 8, k = B.sigBytes * 8;
2380
- 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;
2379
+ var C = this._data, w = C.words, R = this._nDataBytes * 8, k = C.sigBytes * 8;
2380
+ 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;
2381
2381
  },
2382
2382
  clone: function() {
2383
- var B = x.clone.call(this);
2384
- return B._hash = this._hash.clone(), B;
2383
+ var C = x.clone.call(this);
2384
+ return C._hash = this._hash.clone(), C;
2385
2385
  }
2386
2386
  });
2387
- a.SHA256 = x._createHelper(b), a.HmacSHA256 = x._createHmacHelper(b);
2387
+ a.SHA256 = x._createHelper(v), a.HmacSHA256 = x._createHmacHelper(v);
2388
2388
  }(Math), t.SHA256;
2389
2389
  });
2390
2390
  }(Wr)), Wr.exports;
@@ -2430,7 +2430,7 @@ function gn() {
2430
2430
  function c() {
2431
2431
  return x.create.apply(x, arguments);
2432
2432
  }
2433
- var v = [
2433
+ var b = [
2434
2434
  c(1116352408, 3609767458),
2435
2435
  c(1899447441, 602891725),
2436
2436
  c(3049323471, 3964484399),
@@ -2511,12 +2511,12 @@ function gn() {
2511
2511
  c(1501505948, 4234509866),
2512
2512
  c(1607167915, 987167468),
2513
2513
  c(1816402316, 1246189591)
2514
- ], b = [];
2514
+ ], v = [];
2515
2515
  (function() {
2516
2516
  for (var w = 0; w < 80; w++)
2517
- b[w] = c();
2517
+ v[w] = c();
2518
2518
  })();
2519
- var B = o.SHA512 = i.extend({
2519
+ var C = o.SHA512 = i.extend({
2520
2520
  _doReset: function() {
2521
2521
  this._hash = new u.init([
2522
2522
  new x.init(1779033703, 4089235720),
@@ -2530,18 +2530,18 @@ function gn() {
2530
2530
  ]);
2531
2531
  },
2532
2532
  _doProcessBlock: function(w, R) {
2533
- for (var k = this._hash.words, z = k[0], F = k[1], P = k[2], T = k[3], H = k[4], $ = k[5], Y = k[6], X = k[7], Q = z.high, U = z.low, A = F.high, n = F.low, d = P.high, g = P.low, C = T.high, S = T.low, N = H.high, q = H.low, D = $.high, h = $.low, E = Y.high, j = Y.low, K = X.high, W = X.low, re = Q, ce = U, we = A, Ae = n, Me = d, Se = g, G0 = C, We = S, Oe = N, _0 = q, Ge = D, Ke = h, $0 = E, Qe = j, ze = K, O0 = W, Ne = 0; Ne < 80; Ne++) {
2534
- var Fe, S0, Je = b[Ne];
2533
+ for (var k = this._hash.words, z = k[0], F = k[1], P = k[2], T = k[3], H = k[4], $ = k[5], Y = k[6], X = k[7], Q = z.high, U = z.low, A = F.high, n = F.low, d = P.high, g = P.low, B = T.high, S = T.low, N = H.high, q = H.low, D = $.high, h = $.low, E = Y.high, j = Y.low, K = X.high, W = X.low, re = Q, ce = U, we = A, Ae = n, Me = d, Se = g, G0 = B, We = S, Oe = N, _0 = q, Ge = D, Ke = h, $0 = E, Qe = j, ze = K, O0 = W, Ne = 0; Ne < 80; Ne++) {
2534
+ var Fe, S0, Je = v[Ne];
2535
2535
  if (Ne < 16)
2536
2536
  S0 = Je.high = w[R + Ne * 2] | 0, Fe = Je.low = w[R + Ne * 2 + 1] | 0;
2537
2537
  else {
2538
- var f0 = b[Ne - 15], F0 = f0.high, qe = f0.low, u0 = (F0 >>> 1 | qe << 31) ^ (F0 >>> 8 | qe << 24) ^ F0 >>> 7, Q0 = (qe >>> 1 | F0 << 31) ^ (qe >>> 8 | F0 << 24) ^ (qe >>> 7 | F0 << 25), l0 = b[Ne - 2], He = l0.high, N0 = l0.low, a0 = (He >>> 19 | N0 << 13) ^ (He << 3 | N0 >>> 29) ^ He >>> 6, r0 = (N0 >>> 19 | He << 13) ^ (N0 << 3 | He >>> 29) ^ (N0 >>> 6 | He << 26), q0 = b[Ne - 7], i0 = q0.high, s0 = q0.low, W0 = b[Ne - 16], e0 = W0.high, n0 = W0.low;
2538
+ var f0 = v[Ne - 15], F0 = f0.high, qe = f0.low, u0 = (F0 >>> 1 | qe << 31) ^ (F0 >>> 8 | qe << 24) ^ F0 >>> 7, Q0 = (qe >>> 1 | F0 << 31) ^ (qe >>> 8 | F0 << 24) ^ (qe >>> 7 | F0 << 25), l0 = v[Ne - 2], He = l0.high, N0 = l0.low, a0 = (He >>> 19 | N0 << 13) ^ (He << 3 | N0 >>> 29) ^ He >>> 6, r0 = (N0 >>> 19 | He << 13) ^ (N0 << 3 | He >>> 29) ^ (N0 >>> 6 | He << 26), q0 = v[Ne - 7], i0 = q0.high, s0 = q0.low, W0 = v[Ne - 16], e0 = W0.high, n0 = W0.low;
2539
2539
  Fe = Q0 + s0, S0 = u0 + i0 + (Fe >>> 0 < Q0 >>> 0 ? 1 : 0), Fe = Fe + r0, S0 = S0 + a0 + (Fe >>> 0 < r0 >>> 0 ? 1 : 0), Fe = Fe + n0, S0 = S0 + e0 + (Fe >>> 0 < n0 >>> 0 ? 1 : 0), Je.high = S0, Je.low = Fe;
2540
2540
  }
2541
- var L0 = Oe & Ge ^ ~Oe & $0, o0 = _0 & Ke ^ ~_0 & Qe, x0 = re & we ^ re & Me ^ we & Me, D0 = ce & Ae ^ ce & Se ^ Ae & Se, 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), rt = (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[Ne], yt = d0.high, Ie = d0.low, Re = O0 + c0, l = ze + rt + (Re >>> 0 < O0 >>> 0 ? 1 : 0), Re = Re + o0, l = l + L0 + (Re >>> 0 < o0 >>> 0 ? 1 : 0), Re = Re + Ie, l = l + yt + (Re >>> 0 < Ie >>> 0 ? 1 : 0), Re = Re + Fe, l = l + S0 + (Re >>> 0 < Fe >>> 0 ? 1 : 0), _ = Ve + D0, m = t0 + x0 + (_ >>> 0 < Ve >>> 0 ? 1 : 0);
2541
+ var L0 = Oe & Ge ^ ~Oe & $0, o0 = _0 & Ke ^ ~_0 & Qe, x0 = re & we ^ re & Me ^ we & Me, D0 = ce & Ae ^ ce & Se ^ Ae & Se, 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), rt = (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 = b[Ne], yt = d0.high, Ie = d0.low, Re = O0 + c0, l = ze + rt + (Re >>> 0 < O0 >>> 0 ? 1 : 0), Re = Re + o0, l = l + L0 + (Re >>> 0 < o0 >>> 0 ? 1 : 0), Re = Re + Ie, l = l + yt + (Re >>> 0 < Ie >>> 0 ? 1 : 0), Re = Re + Fe, l = l + S0 + (Re >>> 0 < Fe >>> 0 ? 1 : 0), _ = Ve + D0, m = t0 + x0 + (_ >>> 0 < Ve >>> 0 ? 1 : 0);
2542
2542
  ze = $0, O0 = Qe, $0 = Ge, Qe = Ke, Ge = Oe, Ke = _0, _0 = We + Re | 0, Oe = G0 + l + (_0 >>> 0 < We >>> 0 ? 1 : 0) | 0, G0 = Me, We = Se, Me = we, Se = Ae, we = re, Ae = ce, ce = Re + _ | 0, re = l + m + (ce >>> 0 < Re >>> 0 ? 1 : 0) | 0;
2543
2543
  }
2544
- U = z.low = U + ce, z.high = Q + re + (U >>> 0 < ce >>> 0 ? 1 : 0), n = F.low = n + Ae, F.high = A + we + (n >>> 0 < Ae >>> 0 ? 1 : 0), g = P.low = g + Se, P.high = d + Me + (g >>> 0 < Se >>> 0 ? 1 : 0), S = T.low = S + We, T.high = C + G0 + (S >>> 0 < We >>> 0 ? 1 : 0), q = H.low = q + _0, H.high = N + Oe + (q >>> 0 < _0 >>> 0 ? 1 : 0), h = $.low = h + Ke, $.high = D + Ge + (h >>> 0 < Ke >>> 0 ? 1 : 0), j = Y.low = j + Qe, Y.high = E + $0 + (j >>> 0 < Qe >>> 0 ? 1 : 0), W = X.low = W + O0, X.high = K + ze + (W >>> 0 < O0 >>> 0 ? 1 : 0);
2544
+ U = z.low = U + ce, z.high = Q + re + (U >>> 0 < ce >>> 0 ? 1 : 0), n = F.low = n + Ae, F.high = A + we + (n >>> 0 < Ae >>> 0 ? 1 : 0), g = P.low = g + Se, P.high = d + Me + (g >>> 0 < Se >>> 0 ? 1 : 0), S = T.low = S + We, T.high = B + G0 + (S >>> 0 < We >>> 0 ? 1 : 0), q = H.low = q + _0, H.high = N + Oe + (q >>> 0 < _0 >>> 0 ? 1 : 0), h = $.low = h + Ke, $.high = D + Ge + (h >>> 0 < Ke >>> 0 ? 1 : 0), j = Y.low = j + Qe, Y.high = E + $0 + (j >>> 0 < Qe >>> 0 ? 1 : 0), W = X.low = W + O0, X.high = K + ze + (W >>> 0 < O0 >>> 0 ? 1 : 0);
2545
2545
  },
2546
2546
  _doFinalize: function() {
2547
2547
  var w = this._data, R = w.words, k = this._nDataBytes * 8, z = w.sigBytes * 8;
@@ -2555,7 +2555,7 @@ function gn() {
2555
2555
  },
2556
2556
  blockSize: 1024 / 32
2557
2557
  });
2558
- r.SHA512 = i._createHelper(B), r.HmacSHA512 = i._createHmacHelper(B);
2558
+ r.SHA512 = i._createHelper(C), r.HmacSHA512 = i._createHmacHelper(C);
2559
2559
  }(), t.SHA512;
2560
2560
  });
2561
2561
  }(Yr)), Yr.exports;
@@ -2597,16 +2597,16 @@ function Ta() {
2597
2597
  f.exports = r($e(), Er());
2598
2598
  })(Pe, function(t) {
2599
2599
  return function(r) {
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 = [];
2600
+ var a = t, i = a.lib, y = i.WordArray, x = i.Hasher, u = a.x64, o = u.Word, c = a.algo, b = [], v = [], C = [];
2601
2601
  (function() {
2602
2602
  for (var k = 1, z = 0, F = 0; F < 24; F++) {
2603
- v[k + 5 * z] = (F + 1) * (F + 2) / 2 % 64;
2603
+ b[k + 5 * z] = (F + 1) * (F + 2) / 2 % 64;
2604
2604
  var P = z % 5, T = (2 * k + 3 * z) % 5;
2605
2605
  k = P, z = T;
2606
2606
  }
2607
2607
  for (var k = 0; k < 5; k++)
2608
2608
  for (var z = 0; z < 5; z++)
2609
- b[k + 5 * z] = z + (2 * k + 3 * z) % 5 * 5;
2609
+ v[k + 5 * z] = z + (2 * k + 3 * z) % 5 * 5;
2610
2610
  for (var H = 1, $ = 0; $ < 24; $++) {
2611
2611
  for (var Y = 0, X = 0, Q = 0; Q < 7; Q++) {
2612
2612
  if (H & 1) {
@@ -2615,7 +2615,7 @@ function Ta() {
2615
2615
  }
2616
2616
  H & 128 ? H = H << 1 ^ 113 : H <<= 1;
2617
2617
  }
2618
- B[$] = o.create(Y, X);
2618
+ C[$] = o.create(Y, X);
2619
2619
  }
2620
2620
  })();
2621
2621
  var w = [];
@@ -2657,14 +2657,14 @@ 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], S = C.high, N = C.low, U = g.high ^ (S << 1 | N >>> 31), A = g.low ^ (N << 1 | S >>> 31), n = 0; n < 5; n++) {
2660
+ for (var g = w[(Q + 4) % 5], B = w[(Q + 1) % 5], S = B.high, N = B.low, U = g.high ^ (S << 1 | N >>> 31), A = g.low ^ (N << 1 | S >>> 31), n = 0; n < 5; n++) {
2661
2661
  var Y = F[Q + 5 * n];
2662
2662
  Y.high ^= U, Y.low ^= A;
2663
2663
  }
2664
2664
  for (var q = 1; q < 25; q++) {
2665
- var U, A, Y = F[q], D = Y.high, h = Y.low, E = v[q];
2665
+ var U, A, Y = F[q], D = Y.high, h = Y.low, E = b[q];
2666
2666
  E < 32 ? (U = D << E | h >>> 32 - E, A = h << E | D >>> 32 - E) : (U = h << E - 32 | D >>> 64 - E, A = D << E - 32 | h >>> 64 - E);
2667
- var j = w[b[q]];
2667
+ var j = w[v[q]];
2668
2668
  j.high = U, j.low = A;
2669
2669
  }
2670
2670
  var K = w[0], W = F[0];
@@ -2674,7 +2674,7 @@ function Ta() {
2674
2674
  var q = Q + 5 * n, Y = F[q], re = w[q], ce = w[(Q + 1) % 5 + 5 * n], we = w[(Q + 2) % 5 + 5 * n];
2675
2675
  Y.high = re.high ^ ~ce.high & we.high, Y.low = re.low ^ ~ce.low & we.low;
2676
2676
  }
2677
- var Y = F[0], Ae = B[X];
2677
+ var Y = F[0], Ae = C[X];
2678
2678
  Y.high ^= Ae.high, Y.low ^= Ae.low;
2679
2679
  }
2680
2680
  },
@@ -2879,7 +2879,7 @@ function Oa() {
2879
2879
  3,
2880
2880
  9,
2881
2881
  11
2882
- ]), v = y.create([
2882
+ ]), b = y.create([
2883
2883
  11,
2884
2884
  14,
2885
2885
  15,
@@ -2960,7 +2960,7 @@ function Oa() {
2960
2960
  8,
2961
2961
  5,
2962
2962
  6
2963
- ]), b = y.create([
2963
+ ]), v = y.create([
2964
2964
  8,
2965
2965
  9,
2966
2966
  9,
@@ -3041,7 +3041,7 @@ function Oa() {
3041
3041
  13,
3042
3042
  11,
3043
3043
  11
3044
- ]), B = y.create([0, 1518500249, 1859775393, 2400959708, 2840853838]), w = y.create([1352829926, 1548603684, 1836072691, 2053994217, 0]), R = u.RIPEMD160 = x.extend({
3044
+ ]), C = y.create([0, 1518500249, 1859775393, 2400959708, 2840853838]), w = y.create([1352829926, 1548603684, 1836072691, 2053994217, 0]), R = u.RIPEMD160 = x.extend({
3045
3045
  _doReset: function() {
3046
3046
  this._hash = y.create([1732584193, 4023233417, 2562383102, 271733878, 3285377520]);
3047
3047
  },
@@ -3050,10 +3050,10 @@ function Oa() {
3050
3050
  var Q = Y + 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, S = v.words, N = b.words, q, D, h, E, j, K, W, re, ce, we;
3053
+ var A = this._hash.words, n = C.words, d = w.words, g = o.words, B = c.words, S = b.words, N = v.words, q, D, h, E, j, K, W, re, ce, we;
3054
3054
  K = q = 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 = q + $[Y + g[X]] | 0, X < 16 ? Ae += k(D, h, E) + n[0] : X < 32 ? Ae += z(D, h, E) + n[1] : X < 48 ? Ae += F(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, S[X]), Ae = Ae + j | 0, q = j, j = E, E = H(h, 10), h = D, D = Ae, Ae = K + $[Y + C[X]] | 0, X < 16 ? Ae += T(W, re, ce) + d[0] : X < 32 ? Ae += P(W, re, ce) + d[1] : X < 48 ? Ae += F(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, N[X]), Ae = Ae + we | 0, K = we, we = ce, ce = H(re, 10), re = W, W = Ae;
3056
+ Ae = q + $[Y + g[X]] | 0, X < 16 ? Ae += k(D, h, E) + n[0] : X < 32 ? Ae += z(D, h, E) + n[1] : X < 48 ? Ae += F(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, S[X]), Ae = Ae + j | 0, q = j, j = E, E = H(h, 10), h = D, D = Ae, Ae = K + $[Y + B[X]] | 0, X < 16 ? Ae += T(W, re, ce) + d[0] : X < 32 ? Ae += P(W, re, ce) + d[1] : X < 48 ? Ae += F(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, N[X]), Ae = Ae + we | 0, K = 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 + K | 0, A[3] = A[4] + q + W | 0, A[4] = A[0] + D + re | 0, A[0] = Ae;
3058
3058
  },
3059
3059
  _doFinalize: function() {
@@ -3114,11 +3114,11 @@ function Hf() {
3114
3114
  */
3115
3115
  init: function(o, c) {
3116
3116
  o = this._hasher = new o.init(), typeof c == "string" && (c = x.parse(c));
3117
- var v = o.blockSize, b = v * 4;
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, z = 0; z < v; z++)
3117
+ var b = o.blockSize, v = b * 4;
3118
+ c.sigBytes > v && (c = o.finalize(c)), c.clamp();
3119
+ for (var C = this._oKey = c.clone(), w = this._iKey = c.clone(), R = C.words, k = w.words, z = 0; z < b; z++)
3120
3120
  R[z] ^= 1549556828, k[z] ^= 909522486;
3121
- B.sigBytes = w.sigBytes = b, this.reset();
3121
+ C.sigBytes = w.sigBytes = v, this.reset();
3122
3122
  },
3123
3123
  /**
3124
3124
  * Resets this HMAC to its initial state.
@@ -3161,10 +3161,10 @@ function Hf() {
3161
3161
  * var hmac = hmacHasher.finalize(wordArray);
3162
3162
  */
3163
3163
  finalize: function(o) {
3164
- var c = this._hasher, v = c.finalize(o);
3164
+ var c = this._hasher, b = c.finalize(o);
3165
3165
  c.reset();
3166
- var b = c.finalize(this._oKey.clone().concat(v));
3167
- return b;
3166
+ var v = c.finalize(this._oKey.clone().concat(b));
3167
+ return v;
3168
3168
  }
3169
3169
  });
3170
3170
  })();
@@ -3202,8 +3202,8 @@ function za() {
3202
3202
  * var kdf = CryptoJS.algo.PBKDF2.create({ keySize: 8 });
3203
3203
  * var kdf = CryptoJS.algo.PBKDF2.create({ keySize: 8, iterations: 1000 });
3204
3204
  */
3205
- init: function(v) {
3206
- this.cfg = this.cfg.extend(v);
3205
+ init: function(b) {
3206
+ this.cfg = this.cfg.extend(b);
3207
3207
  },
3208
3208
  /**
3209
3209
  * Computes the Password-Based Key Derivation Function 2.
@@ -3217,9 +3217,9 @@ function za() {
3217
3217
  *
3218
3218
  * var key = kdf.compute(password, salt);
3219
3219
  */
3220
- compute: function(v, b) {
3221
- for (var B = this.cfg, w = o.create(B.hasher, v), R = y.create(), k = y.create([1]), z = R.words, F = k.words, P = B.keySize, T = B.iterations; z.length < P; ) {
3222
- var H = w.update(b).finalize(k);
3220
+ compute: function(b, v) {
3221
+ for (var C = this.cfg, w = o.create(C.hasher, b), R = y.create(), k = y.create([1]), z = R.words, F = k.words, P = C.keySize, T = C.iterations; z.length < P; ) {
3222
+ var H = w.update(v).finalize(k);
3223
3223
  w.reset();
3224
3224
  for (var $ = H.words, Y = $.length, X = H, Q = 1; Q < T; Q++) {
3225
3225
  X = w.finalize(X), w.reset();
@@ -3231,8 +3231,8 @@ function za() {
3231
3231
  return R.sigBytes = P * 4, R;
3232
3232
  }
3233
3233
  });
3234
- r.PBKDF2 = function(v, b, B) {
3235
- return c.create(B).compute(v, b);
3234
+ r.PBKDF2 = function(b, v, C) {
3235
+ return c.create(C).compute(b, v);
3236
3236
  };
3237
3237
  }(), t.PBKDF2;
3238
3238
  });
@@ -3284,18 +3284,18 @@ function At() {
3284
3284
  *
3285
3285
  * var key = kdf.compute(password, salt);
3286
3286
  */
3287
- compute: function(c, v) {
3288
- for (var b, B = this.cfg, w = B.hasher.create(), R = y.create(), k = R.words, z = B.keySize, F = B.iterations; k.length < z; ) {
3289
- b && w.update(b), b = w.update(c).finalize(v), w.reset();
3287
+ compute: function(c, b) {
3288
+ for (var v, C = this.cfg, w = C.hasher.create(), R = y.create(), k = R.words, z = C.keySize, F = C.iterations; k.length < z; ) {
3289
+ v && w.update(v), v = w.update(c).finalize(b), w.reset();
3290
3290
  for (var P = 1; P < F; P++)
3291
- b = w.finalize(b), w.reset();
3292
- R.concat(b);
3291
+ v = w.finalize(v), w.reset();
3292
+ R.concat(v);
3293
3293
  }
3294
3294
  return R.sigBytes = z * 4, R;
3295
3295
  }
3296
3296
  });
3297
- r.EvpKDF = function(c, v, b) {
3298
- return o.create(b).compute(c, v);
3297
+ r.EvpKDF = function(c, b, v) {
3298
+ return o.create(v).compute(c, b);
3299
3299
  };
3300
3300
  }(), t.EvpKDF;
3301
3301
  });
@@ -3310,7 +3310,7 @@ function C0() {
3310
3310
  t.lib.Cipher || function(r) {
3311
3311
  var a = t, i = a.lib, y = i.Base, x = i.WordArray, u = i.BufferedBlockAlgorithm, o = a.enc;
3312
3312
  o.Utf8;
3313
- var c = o.Base64, v = a.algo, b = v.EvpKDF, B = i.Cipher = u.extend({
3313
+ var c = o.Base64, b = a.algo, v = b.EvpKDF, C = i.Cipher = u.extend({
3314
3314
  /**
3315
3315
  * Configuration options.
3316
3316
  *
@@ -3442,7 +3442,7 @@ function C0() {
3442
3442
  };
3443
3443
  }()
3444
3444
  });
3445
- i.StreamCipher = B.extend({
3445
+ i.StreamCipher = C.extend({
3446
3446
  _doFinalize: function() {
3447
3447
  var U = this._process(!0);
3448
3448
  return U;
@@ -3507,8 +3507,8 @@ function C0() {
3507
3507
  * mode.processBlock(data.words, offset);
3508
3508
  */
3509
3509
  processBlock: function(n, d) {
3510
- var g = this._cipher, C = g.blockSize;
3511
- A.call(this, n, d, C), g.encryptBlock(n, d), this._prevBlock = n.slice(d, d + C);
3510
+ var g = this._cipher, B = g.blockSize;
3511
+ A.call(this, n, d, B), g.encryptBlock(n, d), this._prevBlock = n.slice(d, d + B);
3512
3512
  }
3513
3513
  }), U.Decryptor = U.extend({
3514
3514
  /**
@@ -3522,15 +3522,15 @@ function C0() {
3522
3522
  * mode.processBlock(data.words, offset);
3523
3523
  */
3524
3524
  processBlock: function(n, d) {
3525
- var g = this._cipher, C = g.blockSize, S = n.slice(d, d + C);
3526
- g.decryptBlock(n, d), A.call(this, n, d, C), this._prevBlock = S;
3525
+ var g = this._cipher, B = g.blockSize, S = n.slice(d, d + B);
3526
+ g.decryptBlock(n, d), A.call(this, n, d, B), this._prevBlock = S;
3527
3527
  }
3528
3528
  });
3529
3529
  function A(n, d, g) {
3530
- var C, S = this._iv;
3531
- S ? (C = S, this._iv = r) : C = this._prevBlock;
3530
+ var B, S = this._iv;
3531
+ S ? (B = S, this._iv = r) : B = this._prevBlock;
3532
3532
  for (var N = 0; N < g; N++)
3533
- n[d + N] ^= C[N];
3533
+ n[d + N] ^= B[N];
3534
3534
  }
3535
3535
  return U;
3536
3536
  }(), z = a.pad = {}, F = z.Pkcs7 = {
@@ -3547,9 +3547,9 @@ function C0() {
3547
3547
  * CryptoJS.pad.Pkcs7.pad(wordArray, 4);
3548
3548
  */
3549
3549
  pad: function(U, A) {
3550
- for (var n = A * 4, d = n - U.sigBytes % n, g = d << 24 | d << 16 | d << 8 | d, C = [], S = 0; S < d; S += 4)
3551
- C.push(g);
3552
- var N = x.create(C, d);
3550
+ for (var n = A * 4, d = n - U.sigBytes % n, g = d << 24 | d << 16 | d << 8 | d, B = [], S = 0; S < d; S += 4)
3551
+ B.push(g);
3552
+ var N = x.create(B, d);
3553
3553
  U.concat(N);
3554
3554
  },
3555
3555
  /**
@@ -3568,20 +3568,20 @@ function C0() {
3568
3568
  U.sigBytes -= A;
3569
3569
  }
3570
3570
  };
3571
- i.BlockCipher = B.extend({
3571
+ i.BlockCipher = C.extend({
3572
3572
  /**
3573
3573
  * Configuration options.
3574
3574
  *
3575
3575
  * @property {Mode} mode The block mode to use. Default: CBC
3576
3576
  * @property {Padding} padding The padding strategy to use. Default: Pkcs7
3577
3577
  */
3578
- cfg: B.cfg.extend({
3578
+ cfg: C.cfg.extend({
3579
3579
  mode: k,
3580
3580
  padding: F
3581
3581
  }),
3582
3582
  reset: function() {
3583
3583
  var U;
3584
- B.reset.call(this);
3584
+ C.reset.call(this);
3585
3585
  var A = this.cfg, n = A.iv, d = A.mode;
3586
3586
  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);
3587
3587
  },
@@ -3699,9 +3699,9 @@ function C0() {
3699
3699
  */
3700
3700
  encrypt: function(U, A, n, d) {
3701
3701
  d = this.cfg.extend(d);
3702
- var g = U.createEncryptor(n, d), C = g.finalize(A), S = g.cfg;
3702
+ var g = U.createEncryptor(n, d), B = g.finalize(A), S = g.cfg;
3703
3703
  return P.create({
3704
- ciphertext: C,
3704
+ ciphertext: B,
3705
3705
  key: n,
3706
3706
  iv: S.iv,
3707
3707
  algorithm: U,
@@ -3771,11 +3771,11 @@ function C0() {
3771
3771
  */
3772
3772
  execute: function(U, A, n, d, g) {
3773
3773
  if (d || (d = x.random(64 / 8)), g)
3774
- var C = b.create({ keySize: A + n, hasher: g }).compute(U, d);
3774
+ var B = v.create({ keySize: A + n, hasher: g }).compute(U, d);
3775
3775
  else
3776
- var C = b.create({ keySize: A + n }).compute(U, d);
3777
- var S = x.create(C.words.slice(A), n * 4);
3778
- return C.sigBytes = A * 4, P.create({ key: C, iv: S, salt: d });
3776
+ var B = v.create({ keySize: A + n }).compute(U, d);
3777
+ var S = x.create(B.words.slice(A), n * 4);
3778
+ return B.sigBytes = A * 4, P.create({ key: B, iv: S, salt: d });
3779
3779
  }
3780
3780
  }, Q = i.PasswordBasedCipher = $.extend({
3781
3781
  /**
@@ -3807,8 +3807,8 @@ function C0() {
3807
3807
  d = this.cfg.extend(d);
3808
3808
  var g = d.kdf.execute(n, U.keySize, U.ivSize, d.salt, d.hasher);
3809
3809
  d.iv = g.iv;
3810
- var C = $.encrypt.call(this, U, A, g.key, d);
3811
- return C.mixIn(g), C;
3810
+ var B = $.encrypt.call(this, U, A, g.key, d);
3811
+ return B.mixIn(g), B;
3812
3812
  },
3813
3813
  /**
3814
3814
  * Decrypts serialized ciphertext using a password.
@@ -3831,8 +3831,8 @@ function C0() {
3831
3831
  d = this.cfg.extend(d), A = this._parse(A, d.format);
3832
3832
  var g = d.kdf.execute(n, U.keySize, U.ivSize, A.salt, d.hasher);
3833
3833
  d.iv = g.iv;
3834
- var C = $.decrypt.call(this, U, A, g.key, d);
3835
- return C;
3834
+ var B = $.decrypt.call(this, U, A, g.key, d);
3835
+ return B;
3836
3836
  }
3837
3837
  });
3838
3838
  }();
@@ -3861,8 +3861,8 @@ function Na() {
3861
3861
  function a(i, y, x, u) {
3862
3862
  var o, c = this._iv;
3863
3863
  c ? (o = c.slice(0), this._iv = void 0) : o = this._prevBlock, u.encryptBlock(o, 0);
3864
- for (var v = 0; v < x; v++)
3865
- i[y + v] ^= o[v];
3864
+ for (var b = 0; b < x; b++)
3865
+ i[y + b] ^= o[b];
3866
3866
  }
3867
3867
  return r;
3868
3868
  }(), t.mode.CFB;
@@ -3880,10 +3880,10 @@ function qa() {
3880
3880
  processBlock: function(i, y) {
3881
3881
  var x = this._cipher, u = x.blockSize, o = this._iv, c = this._counter;
3882
3882
  o && (c = this._counter = o.slice(0), this._iv = void 0);
3883
- var v = c.slice(0);
3884
- x.encryptBlock(v, 0), c[u - 1] = c[u - 1] + 1 | 0;
3885
- for (var b = 0; b < u; b++)
3886
- i[y + b] ^= v[b];
3883
+ var b = c.slice(0);
3884
+ x.encryptBlock(b, 0), c[u - 1] = c[u - 1] + 1 | 0;
3885
+ for (var v = 0; v < u; v++)
3886
+ i[y + v] ^= b[v];
3887
3887
  }
3888
3888
  });
3889
3889
  return r.Decryptor = a, r;
@@ -3917,12 +3917,12 @@ function La() {
3917
3917
  }
3918
3918
  var y = r.Encryptor = r.extend({
3919
3919
  processBlock: function(x, u) {
3920
- var o = this._cipher, c = o.blockSize, v = this._iv, b = this._counter;
3921
- v && (b = this._counter = v.slice(0), this._iv = void 0), i(b);
3922
- var B = b.slice(0);
3923
- o.encryptBlock(B, 0);
3920
+ var o = this._cipher, c = o.blockSize, b = this._iv, v = this._counter;
3921
+ b && (v = this._counter = b.slice(0), this._iv = void 0), i(v);
3922
+ var C = v.slice(0);
3923
+ o.encryptBlock(C, 0);
3924
3924
  for (var w = 0; w < c; w++)
3925
- x[u + w] ^= B[w];
3925
+ x[u + w] ^= C[w];
3926
3926
  }
3927
3927
  });
3928
3928
  return r.Decryptor = y, r;
@@ -3941,8 +3941,8 @@ function Ha() {
3941
3941
  processBlock: function(i, y) {
3942
3942
  var x = this._cipher, u = x.blockSize, o = this._iv, c = this._keystream;
3943
3943
  o && (c = this._keystream = o.slice(0), this._iv = void 0), x.encryptBlock(c, 0);
3944
- for (var v = 0; v < u; v++)
3945
- i[y + v] ^= c[v];
3944
+ for (var b = 0; b < u; b++)
3945
+ i[y + b] ^= c[b];
3946
3946
  }
3947
3947
  });
3948
3948
  return r.Decryptor = a, r;
@@ -4102,8 +4102,8 @@ function Va() {
4102
4102
  * var cipherParams = CryptoJS.format.Hex.parse(hexString);
4103
4103
  */
4104
4104
  parse: function(c) {
4105
- var v = u.parse(c);
4106
- return y.create({ ciphertext: v });
4105
+ var b = u.parse(c);
4106
+ return y.create({ ciphertext: b });
4107
4107
  }
4108
4108
  };
4109
4109
  }(), t.format.Hex;
@@ -4117,7 +4117,7 @@ function Xa() {
4117
4117
  f.exports = r($e(), kt(), Pt(), At(), C0());
4118
4118
  })(Pe, function(t) {
4119
4119
  return function() {
4120
- var r = t, a = r.lib, i = a.BlockCipher, y = r.algo, x = [], u = [], o = [], c = [], v = [], b = [], B = [], w = [], R = [], k = [];
4120
+ var r = t, a = r.lib, i = a.BlockCipher, y = r.algo, x = [], u = [], o = [], c = [], b = [], v = [], C = [], w = [], R = [], k = [];
4121
4121
  (function() {
4122
4122
  for (var P = [], T = 0; T < 256; T++)
4123
4123
  T < 128 ? P[T] = T << 1 : P[T] = T << 1 ^ 283;
@@ -4125,9 +4125,9 @@ function Xa() {
4125
4125
  var Y = $ ^ $ << 1 ^ $ << 2 ^ $ << 3 ^ $ << 4;
4126
4126
  Y = Y >>> 8 ^ Y & 255 ^ 99, x[H] = Y, u[Y] = H;
4127
4127
  var X = P[H], Q = P[X], U = P[Q], A = P[Y] * 257 ^ Y * 16843008;
4128
- o[H] = A << 24 | A >>> 8, c[H] = A << 16 | A >>> 16, v[H] = A << 8 | A >>> 24, b[H] = A;
4128
+ o[H] = A << 24 | A >>> 8, c[H] = A << 16 | A >>> 16, b[H] = A << 8 | A >>> 24, v[H] = A;
4129
4129
  var A = U * 16843009 ^ Q * 65537 ^ X * 257 ^ H * 16843008;
4130
- B[Y] = A << 24 | A >>> 8, w[Y] = A << 16 | A >>> 16, R[Y] = A << 8 | A >>> 24, k[Y] = A, H ? (H = X ^ P[P[P[U ^ X]]], $ ^= P[P[$]]) : H = $ = 1;
4130
+ C[Y] = A << 24 | A >>> 8, w[Y] = A << 16 | A >>> 16, R[Y] = A << 8 | A >>> 24, k[Y] = A, H ? (H = X ^ P[P[P[U ^ X]]], $ ^= P[P[$]]) : H = $ = 1;
4131
4131
  }
4132
4132
  })();
4133
4133
  var z = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], F = y.AES = i.extend({
@@ -4142,25 +4142,25 @@ function Xa() {
4142
4142
  var P = Q[U];
4143
4143
  else
4144
4144
  var P = Q[U - 4];
4145
- 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]];
4145
+ 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]];
4146
4146
  }
4147
4147
  }
4148
4148
  },
4149
4149
  encryptBlock: function(P, T) {
4150
- this._doCryptBlock(P, T, this._keySchedule, o, c, v, b, x);
4150
+ this._doCryptBlock(P, T, this._keySchedule, o, c, b, v, x);
4151
4151
  },
4152
4152
  decryptBlock: function(P, T) {
4153
4153
  var H = P[T + 1];
4154
- P[T + 1] = P[T + 3], P[T + 3] = H, this._doCryptBlock(P, T, this._invKeySchedule, B, w, R, k, u);
4154
+ P[T + 1] = P[T + 3], P[T + 3] = H, this._doCryptBlock(P, T, this._invKeySchedule, C, w, R, k, u);
4155
4155
  var H = P[T + 1];
4156
4156
  P[T + 1] = P[T + 3], P[T + 3] = H;
4157
4157
  },
4158
4158
  _doCryptBlock: function(P, T, H, $, Y, 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], S = 4, N = 1; N < A; N++) {
4160
- var q = $[n >>> 24] ^ Y[d >>> 16 & 255] ^ X[g >>> 8 & 255] ^ Q[C & 255] ^ H[S++], D = $[d >>> 24] ^ Y[g >>> 16 & 255] ^ X[C >>> 8 & 255] ^ Q[n & 255] ^ H[S++], h = $[g >>> 24] ^ Y[C >>> 16 & 255] ^ X[n >>> 8 & 255] ^ Q[d & 255] ^ H[S++], E = $[C >>> 24] ^ Y[n >>> 16 & 255] ^ X[d >>> 8 & 255] ^ Q[g & 255] ^ H[S++];
4161
- n = q, d = D, g = h, C = E;
4159
+ 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], S = 4, N = 1; N < A; N++) {
4160
+ var q = $[n >>> 24] ^ Y[d >>> 16 & 255] ^ X[g >>> 8 & 255] ^ Q[B & 255] ^ H[S++], D = $[d >>> 24] ^ Y[g >>> 16 & 255] ^ X[B >>> 8 & 255] ^ Q[n & 255] ^ H[S++], h = $[g >>> 24] ^ Y[B >>> 16 & 255] ^ X[n >>> 8 & 255] ^ Q[d & 255] ^ H[S++], E = $[B >>> 24] ^ Y[n >>> 16 & 255] ^ X[d >>> 8 & 255] ^ Q[g & 255] ^ H[S++];
4161
+ n = q, d = D, g = h, B = E;
4162
4162
  }
4163
- var q = (U[n >>> 24] << 24 | U[d >>> 16 & 255] << 16 | U[g >>> 8 & 255] << 8 | U[C & 255]) ^ H[S++], D = (U[d >>> 24] << 24 | U[g >>> 16 & 255] << 16 | U[C >>> 8 & 255] << 8 | U[n & 255]) ^ H[S++], h = (U[g >>> 24] << 24 | U[C >>> 16 & 255] << 16 | U[n >>> 8 & 255] << 8 | U[d & 255]) ^ H[S++], E = (U[C >>> 24] << 24 | U[n >>> 16 & 255] << 16 | U[d >>> 8 & 255] << 8 | U[g & 255]) ^ H[S++];
4163
+ var q = (U[n >>> 24] << 24 | U[d >>> 16 & 255] << 16 | U[g >>> 8 & 255] << 8 | U[B & 255]) ^ H[S++], D = (U[d >>> 24] << 24 | U[g >>> 16 & 255] << 16 | U[B >>> 8 & 255] << 8 | U[n & 255]) ^ H[S++], h = (U[g >>> 24] << 24 | U[B >>> 16 & 255] << 16 | U[n >>> 8 & 255] << 8 | U[d & 255]) ^ H[S++], E = (U[B >>> 24] << 24 | U[n >>> 16 & 255] << 16 | U[d >>> 8 & 255] << 8 | U[g & 255]) ^ H[S++];
4164
4164
  P[T] = q, P[T + 1] = D, P[T + 2] = h, P[T + 3] = E;
4165
4165
  },
4166
4166
  keySize: 256 / 32
@@ -4283,7 +4283,7 @@ function Za() {
4283
4283
  36,
4284
4284
  29,
4285
4285
  32
4286
- ], c = [1, 2, 4, 6, 8, 10, 12, 14, 15, 17, 19, 21, 23, 25, 27, 28], v = [
4286
+ ], c = [1, 2, 4, 6, 8, 10, 12, 14, 15, 17, 19, 21, 23, 25, 27, 28], b = [
4287
4287
  {
4288
4288
  0: 8421888,
4289
4289
  268435456: 32768,
@@ -4812,7 +4812,7 @@ function Za() {
4812
4812
  2147483678: 131104,
4813
4813
  2147483679: 134350848
4814
4814
  }
4815
- ], b = [
4815
+ ], v = [
4816
4816
  4160749569,
4817
4817
  528482304,
4818
4818
  33030144,
@@ -4821,7 +4821,7 @@ function Za() {
4821
4821
  8064,
4822
4822
  504,
4823
4823
  2147483679
4824
- ], B = x.DES = y.extend({
4824
+ ], C = x.DES = y.extend({
4825
4825
  _doReset: function() {
4826
4826
  for (var z = this._key, F = z.words, P = [], T = 0; T < 56; T++) {
4827
4827
  var H = u[T] - 1;
@@ -4848,7 +4848,7 @@ function Za() {
4848
4848
  this._lBlock = z[F], this._rBlock = z[F + 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, Y = this._rBlock, X = 0, Q = 0; Q < 8; Q++)
4851
- X |= v[Q][((Y ^ H[Q]) & b[Q]) >>> 0];
4851
+ X |= b[Q][((Y ^ H[Q]) & v[Q]) >>> 0];
4852
4852
  this._lBlock = Y, this._rBlock = $ ^ X;
4853
4853
  }
4854
4854
  var U = this._lBlock;
@@ -4866,14 +4866,14 @@ function Za() {
4866
4866
  var P = (this._rBlock >>> z ^ this._lBlock) & F;
4867
4867
  this._lBlock ^= P, this._rBlock ^= P << z;
4868
4868
  }
4869
- r.DES = y._createHelper(B);
4869
+ r.DES = y._createHelper(C);
4870
4870
  var k = x.TripleDES = y.extend({
4871
4871
  _doReset: function() {
4872
4872
  var z = this._key, F = z.words;
4873
4873
  if (F.length !== 2 && F.length !== 4 && F.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 = F.slice(0, 2), T = F.length < 4 ? F.slice(0, 2) : F.slice(2, 4), H = F.length < 6 ? F.slice(0, 2) : F.slice(4, 6);
4876
- this._des1 = B.createEncryptor(i.create(P)), this._des2 = B.createEncryptor(i.create(T)), this._des3 = B.createEncryptor(i.create(H));
4876
+ this._des1 = C.createEncryptor(i.create(P)), this._des2 = C.createEncryptor(i.create(T)), this._des3 = C.createEncryptor(i.create(H));
4877
4877
  },
4878
4878
  encryptBlock: function(z, F) {
4879
4879
  this._des1.encryptBlock(z, F), this._des2.decryptBlock(z, F), this._des3.encryptBlock(z, F);
@@ -4899,29 +4899,29 @@ function Ga() {
4899
4899
  return function() {
4900
4900
  var r = t, a = r.lib, i = a.StreamCipher, y = r.algo, x = y.RC4 = i.extend({
4901
4901
  _doReset: function() {
4902
- for (var c = this._key, v = c.words, b = c.sigBytes, B = this._S = [], w = 0; w < 256; w++)
4903
- B[w] = w;
4902
+ for (var c = this._key, b = c.words, v = c.sigBytes, C = this._S = [], w = 0; w < 256; w++)
4903
+ C[w] = w;
4904
4904
  for (var w = 0, R = 0; w < 256; w++) {
4905
- var k = w % b, z = v[k >>> 2] >>> 24 - k % 4 * 8 & 255;
4906
- R = (R + B[w] + z) % 256;
4907
- var F = B[w];
4908
- B[w] = B[R], B[R] = F;
4905
+ var k = w % v, z = b[k >>> 2] >>> 24 - k % 4 * 8 & 255;
4906
+ R = (R + C[w] + z) % 256;
4907
+ var F = C[w];
4908
+ C[w] = C[R], C[R] = F;
4909
4909
  }
4910
4910
  this._i = this._j = 0;
4911
4911
  },
4912
- _doProcessBlock: function(c, v) {
4913
- c[v] ^= u.call(this);
4912
+ _doProcessBlock: function(c, b) {
4913
+ c[b] ^= u.call(this);
4914
4914
  },
4915
4915
  keySize: 256 / 32,
4916
4916
  ivSize: 0
4917
4917
  });
4918
4918
  function u() {
4919
- for (var c = this._S, v = this._i, b = this._j, B = 0, w = 0; w < 4; w++) {
4920
- v = (v + 1) % 256, b = (b + c[v]) % 256;
4921
- var R = c[v];
4922
- c[v] = c[b], c[b] = R, B |= c[(c[v] + c[b]) % 256] << 24 - w * 8;
4919
+ for (var c = this._S, b = this._i, v = this._j, C = 0, w = 0; w < 4; w++) {
4920
+ b = (b + 1) % 256, v = (v + c[b]) % 256;
4921
+ var R = c[b];
4922
+ c[b] = c[v], c[v] = R, C |= c[(c[b] + c[v]) % 256] << 24 - w * 8;
4923
4923
  }
4924
- return this._i = v, this._j = b, B;
4924
+ return this._i = b, this._j = v, C;
4925
4925
  }
4926
4926
  r.RC4 = i._createHelper(x);
4927
4927
  var o = y.RC4Drop = x.extend({
@@ -4953,57 +4953,57 @@ function Qa() {
4953
4953
  return function() {
4954
4954
  var r = t, a = r.lib, i = a.StreamCipher, y = r.algo, x = [], u = [], o = [], c = y.Rabbit = i.extend({
4955
4955
  _doReset: function() {
4956
- for (var b = this._key.words, B = this.cfg.iv, w = 0; w < 4; w++)
4957
- b[w] = (b[w] << 8 | b[w] >>> 24) & 16711935 | (b[w] << 24 | b[w] >>> 8) & 4278255360;
4956
+ for (var v = this._key.words, C = this.cfg.iv, w = 0; w < 4; w++)
4957
+ v[w] = (v[w] << 8 | v[w] >>> 24) & 16711935 | (v[w] << 24 | v[w] >>> 8) & 4278255360;
4958
4958
  var R = this._X = [
4959
- b[0],
4960
- b[3] << 16 | b[2] >>> 16,
4961
- b[1],
4962
- b[0] << 16 | b[3] >>> 16,
4963
- b[2],
4964
- b[1] << 16 | b[0] >>> 16,
4965
- b[3],
4966
- b[2] << 16 | b[1] >>> 16
4959
+ v[0],
4960
+ v[3] << 16 | v[2] >>> 16,
4961
+ v[1],
4962
+ v[0] << 16 | v[3] >>> 16,
4963
+ v[2],
4964
+ v[1] << 16 | v[0] >>> 16,
4965
+ v[3],
4966
+ v[2] << 16 | v[1] >>> 16
4967
4967
  ], k = this._C = [
4968
- b[2] << 16 | b[2] >>> 16,
4969
- b[0] & 4294901760 | b[1] & 65535,
4970
- b[3] << 16 | b[3] >>> 16,
4971
- b[1] & 4294901760 | b[2] & 65535,
4972
- b[0] << 16 | b[0] >>> 16,
4973
- b[2] & 4294901760 | b[3] & 65535,
4974
- b[1] << 16 | b[1] >>> 16,
4975
- b[3] & 4294901760 | b[0] & 65535
4968
+ v[2] << 16 | v[2] >>> 16,
4969
+ v[0] & 4294901760 | v[1] & 65535,
4970
+ v[3] << 16 | v[3] >>> 16,
4971
+ v[1] & 4294901760 | v[2] & 65535,
4972
+ v[0] << 16 | v[0] >>> 16,
4973
+ v[2] & 4294901760 | v[3] & 65535,
4974
+ v[1] << 16 | v[1] >>> 16,
4975
+ v[3] & 4294901760 | v[0] & 65535
4976
4976
  ];
4977
4977
  this._b = 0;
4978
4978
  for (var w = 0; w < 4; w++)
4979
- v.call(this);
4979
+ b.call(this);
4980
4980
  for (var w = 0; w < 8; w++)
4981
4981
  k[w] ^= R[w + 4 & 7];
4982
- if (B) {
4983
- var z = B.words, F = z[0], P = z[1], T = (F << 8 | F >>> 24) & 16711935 | (F << 24 | F >>> 8) & 4278255360, H = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360, $ = T >>> 16 | H & 4294901760, Y = H << 16 | T & 65535;
4982
+ if (C) {
4983
+ var z = C.words, F = z[0], P = z[1], T = (F << 8 | F >>> 24) & 16711935 | (F << 24 | F >>> 8) & 4278255360, H = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360, $ = T >>> 16 | H & 4294901760, Y = H << 16 | T & 65535;
4984
4984
  k[0] ^= T, k[1] ^= $, k[2] ^= H, k[3] ^= Y, k[4] ^= T, k[5] ^= $, k[6] ^= H, k[7] ^= Y;
4985
4985
  for (var w = 0; w < 4; w++)
4986
- v.call(this);
4986
+ b.call(this);
4987
4987
  }
4988
4988
  },
4989
- _doProcessBlock: function(b, B) {
4989
+ _doProcessBlock: function(v, C) {
4990
4990
  var w = this._X;
4991
- 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;
4991
+ b.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;
4992
4992
  for (var R = 0; R < 4; R++)
4993
- x[R] = (x[R] << 8 | x[R] >>> 24) & 16711935 | (x[R] << 24 | x[R] >>> 8) & 4278255360, b[B + R] ^= x[R];
4993
+ x[R] = (x[R] << 8 | x[R] >>> 24) & 16711935 | (x[R] << 24 | x[R] >>> 8) & 4278255360, v[C + R] ^= x[R];
4994
4994
  },
4995
4995
  blockSize: 128 / 32,
4996
4996
  ivSize: 64 / 32
4997
4997
  });
4998
- function v() {
4999
- for (var b = this._X, B = this._C, w = 0; w < 8; w++)
5000
- u[w] = B[w];
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;
4998
+ function b() {
4999
+ for (var v = this._X, C = this._C, w = 0; w < 8; w++)
5000
+ u[w] = C[w];
5001
+ 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;
5002
5002
  for (var w = 0; w < 8; w++) {
5003
- var R = b[w] + B[w], k = R & 65535, z = R >>> 16, F = ((k * k >>> 17) + k * z >>> 15) + z * z, P = ((R & 4294901760) * R | 0) + ((R & 65535) * R | 0);
5003
+ var R = v[w] + C[w], k = R & 65535, z = R >>> 16, F = ((k * k >>> 17) + k * z >>> 15) + z * z, P = ((R & 4294901760) * R | 0) + ((R & 65535) * R | 0);
5004
5004
  o[w] = F ^ P;
5005
5005
  }
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;
5006
+ v[0] = o[0] + (o[7] << 16 | o[7] >>> 16) + (o[6] << 16 | o[6] >>> 16) | 0, v[1] = o[1] + (o[0] << 8 | o[0] >>> 24) + o[7] | 0, v[2] = o[2] + (o[1] << 16 | o[1] >>> 16) + (o[0] << 16 | o[0] >>> 16) | 0, v[3] = o[3] + (o[2] << 8 | o[2] >>> 24) + o[1] | 0, v[4] = o[4] + (o[3] << 16 | o[3] >>> 16) + (o[2] << 16 | o[2] >>> 16) | 0, v[5] = o[5] + (o[4] << 8 | o[4] >>> 24) + o[3] | 0, v[6] = o[6] + (o[5] << 16 | o[5] >>> 16) + (o[4] << 16 | o[4] >>> 16) | 0, v[7] = o[7] + (o[6] << 8 | o[6] >>> 24) + o[5] | 0;
5007
5007
  }
5008
5008
  r.Rabbit = i._createHelper(c);
5009
5009
  }(), t.Rabbit;
@@ -5019,55 +5019,55 @@ function Ja() {
5019
5019
  return function() {
5020
5020
  var r = t, a = r.lib, i = a.StreamCipher, y = r.algo, x = [], u = [], o = [], c = y.RabbitLegacy = i.extend({
5021
5021
  _doReset: function() {
5022
- var b = this._key.words, B = this.cfg.iv, w = this._X = [
5023
- b[0],
5024
- b[3] << 16 | b[2] >>> 16,
5025
- b[1],
5026
- b[0] << 16 | b[3] >>> 16,
5027
- b[2],
5028
- b[1] << 16 | b[0] >>> 16,
5029
- b[3],
5030
- b[2] << 16 | b[1] >>> 16
5022
+ var v = this._key.words, C = this.cfg.iv, w = this._X = [
5023
+ v[0],
5024
+ v[3] << 16 | v[2] >>> 16,
5025
+ v[1],
5026
+ v[0] << 16 | v[3] >>> 16,
5027
+ v[2],
5028
+ v[1] << 16 | v[0] >>> 16,
5029
+ v[3],
5030
+ v[2] << 16 | v[1] >>> 16
5031
5031
  ], R = this._C = [
5032
- b[2] << 16 | b[2] >>> 16,
5033
- b[0] & 4294901760 | b[1] & 65535,
5034
- b[3] << 16 | b[3] >>> 16,
5035
- b[1] & 4294901760 | b[2] & 65535,
5036
- b[0] << 16 | b[0] >>> 16,
5037
- b[2] & 4294901760 | b[3] & 65535,
5038
- b[1] << 16 | b[1] >>> 16,
5039
- b[3] & 4294901760 | b[0] & 65535
5032
+ v[2] << 16 | v[2] >>> 16,
5033
+ v[0] & 4294901760 | v[1] & 65535,
5034
+ v[3] << 16 | v[3] >>> 16,
5035
+ v[1] & 4294901760 | v[2] & 65535,
5036
+ v[0] << 16 | v[0] >>> 16,
5037
+ v[2] & 4294901760 | v[3] & 65535,
5038
+ v[1] << 16 | v[1] >>> 16,
5039
+ v[3] & 4294901760 | v[0] & 65535
5040
5040
  ];
5041
5041
  this._b = 0;
5042
5042
  for (var k = 0; k < 4; k++)
5043
- v.call(this);
5043
+ b.call(this);
5044
5044
  for (var k = 0; k < 8; k++)
5045
5045
  R[k] ^= w[k + 4 & 7];
5046
- if (B) {
5047
- var z = B.words, F = z[0], P = z[1], T = (F << 8 | F >>> 24) & 16711935 | (F << 24 | F >>> 8) & 4278255360, H = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360, $ = T >>> 16 | H & 4294901760, Y = H << 16 | T & 65535;
5046
+ if (C) {
5047
+ var z = C.words, F = z[0], P = z[1], T = (F << 8 | F >>> 24) & 16711935 | (F << 24 | F >>> 8) & 4278255360, H = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360, $ = T >>> 16 | H & 4294901760, Y = H << 16 | T & 65535;
5048
5048
  R[0] ^= T, R[1] ^= $, R[2] ^= H, R[3] ^= Y, R[4] ^= T, R[5] ^= $, R[6] ^= H, R[7] ^= Y;
5049
5049
  for (var k = 0; k < 4; k++)
5050
- v.call(this);
5050
+ b.call(this);
5051
5051
  }
5052
5052
  },
5053
- _doProcessBlock: function(b, B) {
5053
+ _doProcessBlock: function(v, C) {
5054
5054
  var w = this._X;
5055
- 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;
5055
+ b.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;
5056
5056
  for (var R = 0; R < 4; R++)
5057
- x[R] = (x[R] << 8 | x[R] >>> 24) & 16711935 | (x[R] << 24 | x[R] >>> 8) & 4278255360, b[B + R] ^= x[R];
5057
+ x[R] = (x[R] << 8 | x[R] >>> 24) & 16711935 | (x[R] << 24 | x[R] >>> 8) & 4278255360, v[C + R] ^= x[R];
5058
5058
  },
5059
5059
  blockSize: 128 / 32,
5060
5060
  ivSize: 64 / 32
5061
5061
  });
5062
- function v() {
5063
- for (var b = this._X, B = this._C, w = 0; w < 8; w++)
5064
- u[w] = B[w];
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;
5062
+ function b() {
5063
+ for (var v = this._X, C = this._C, w = 0; w < 8; w++)
5064
+ u[w] = C[w];
5065
+ 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;
5066
5066
  for (var w = 0; w < 8; w++) {
5067
- var R = b[w] + B[w], k = R & 65535, z = R >>> 16, F = ((k * k >>> 17) + k * z >>> 15) + z * z, P = ((R & 4294901760) * R | 0) + ((R & 65535) * R | 0);
5067
+ var R = v[w] + C[w], k = R & 65535, z = R >>> 16, F = ((k * k >>> 17) + k * z >>> 15) + z * z, P = ((R & 4294901760) * R | 0) + ((R & 65535) * R | 0);
5068
5068
  o[w] = F ^ P;
5069
5069
  }
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;
5070
+ v[0] = o[0] + (o[7] << 16 | o[7] >>> 16) + (o[6] << 16 | o[6] >>> 16) | 0, v[1] = o[1] + (o[0] << 8 | o[0] >>> 24) + o[7] | 0, v[2] = o[2] + (o[1] << 16 | o[1] >>> 16) + (o[0] << 16 | o[0] >>> 16) | 0, v[3] = o[3] + (o[2] << 8 | o[2] >>> 24) + o[1] | 0, v[4] = o[4] + (o[3] << 16 | o[3] >>> 16) + (o[2] << 16 | o[2] >>> 16) | 0, v[5] = o[5] + (o[4] << 8 | o[4] >>> 24) + o[3] | 0, v[6] = o[6] + (o[5] << 16 | o[5] >>> 16) + (o[4] << 16 | o[4] >>> 16) | 0, v[7] = o[7] + (o[6] << 8 | o[6] >>> 24) + o[5] | 0;
5071
5071
  }
5072
5072
  r.RabbitLegacy = i._createHelper(c);
5073
5073
  }(), t.RabbitLegacy;
@@ -6139,20 +6139,20 @@ function es() {
6139
6139
  pbox: [],
6140
6140
  sbox: []
6141
6141
  };
6142
- function v(k, z) {
6142
+ function b(k, z) {
6143
6143
  let F = z >> 24 & 255, P = z >> 16 & 255, T = z >> 8 & 255, H = z & 255, $ = k.sbox[0][F] + k.sbox[1][P];
6144
6144
  return $ = $ ^ k.sbox[2][T], $ = $ + k.sbox[3][H], $;
6145
6145
  }
6146
- function b(k, z, F) {
6146
+ function v(k, z, F) {
6147
6147
  let P = z, T = F, H;
6148
6148
  for (let $ = 0; $ < x; ++$)
6149
- P = P ^ k.pbox[$], T = v(k, P) ^ T, H = P, P = T, T = H;
6149
+ P = P ^ k.pbox[$], T = b(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, z, F) {
6152
+ function C(k, z, F) {
6153
6153
  let P = z, T = F, H;
6154
6154
  for (let $ = x + 1; $ > 1; --$)
6155
- P = P ^ k.pbox[$], T = v(k, P) ^ T, H = P, P = T, T = H;
6155
+ P = P ^ k.pbox[$], T = b(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
6158
  function w(k, z, F) {
@@ -6166,10 +6166,10 @@ function es() {
6166
6166
  k.pbox[Y] = u[Y] ^ z[P], P++, P >= F && (P = 0);
6167
6167
  let T = 0, H = 0, $ = 0;
6168
6168
  for (let Y = 0; Y < x + 2; Y += 2)
6169
- $ = b(k, T, H), T = $.left, H = $.right, k.pbox[Y] = T, k.pbox[Y + 1] = H;
6169
+ $ = v(k, T, H), T = $.left, H = $.right, k.pbox[Y] = T, k.pbox[Y + 1] = H;
6170
6170
  for (let Y = 0; Y < 4; Y++)
6171
6171
  for (let X = 0; X < 256; X += 2)
6172
- $ = b(k, T, H), T = $.left, H = $.right, k.sbox[Y][X] = T, k.sbox[Y][X + 1] = H;
6172
+ $ = v(k, T, H), T = $.left, H = $.right, k.sbox[Y][X] = T, k.sbox[Y][X + 1] = H;
6173
6173
  return !0;
6174
6174
  }
6175
6175
  var R = y.Blowfish = i.extend({
@@ -6180,11 +6180,11 @@ function es() {
6180
6180
  }
6181
6181
  },
6182
6182
  encryptBlock: function(k, z) {
6183
- var F = b(c, k[z], k[z + 1]);
6183
+ var F = v(c, k[z], k[z + 1]);
6184
6184
  k[z] = F.left, k[z + 1] = F.right;
6185
6185
  },
6186
6186
  decryptBlock: function(k, z) {
6187
- var F = B(c, k[z], k[z + 1]);
6187
+ var F = C(c, k[z], k[z + 1]);
6188
6188
  k[z] = F.left, k[z + 1] = F.right;
6189
6189
  },
6190
6190
  blockSize: 64 / 32,
@@ -6299,8 +6299,8 @@ Uf.exports;
6299
6299
  if (typeof n == "object")
6300
6300
  return this._initArray(n, d, g);
6301
6301
  d === "hex" && (d = 16), r(d === (d | 0) && d >= 2 && d <= 36), n = n.toString().replace(/\s+/g, "");
6302
- var C = 0;
6303
- 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)));
6302
+ var B = 0;
6303
+ 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)));
6304
6304
  }, i.prototype._initNumber = function(n, d, g) {
6305
6305
  n < 0 && (this.negative = 1, n = -n), n < 67108864 ? (this.words = [n & 67108863], this.length = 1) : n < 4503599627370496 ? (this.words = [
6306
6306
  n & 67108863,
@@ -6314,15 +6314,15 @@ Uf.exports;
6314
6314
  if (r(typeof n.length == "number"), n.length <= 0)
6315
6315
  return this.words = [0], this.length = 1, this;
6316
6316
  this.length = Math.ceil(n.length / 3), this.words = new Array(this.length);
6317
- for (var C = 0; C < this.length; C++)
6318
- this.words[C] = 0;
6317
+ for (var B = 0; B < this.length; B++)
6318
+ this.words[B] = 0;
6319
6319
  var S, N, q = 0;
6320
6320
  if (g === "be")
6321
- for (C = n.length - 1, S = 0; C >= 0; C -= 3)
6322
- N = n[C] | n[C - 1] << 8 | n[C - 2] << 16, this.words[S] |= N << q & 67108863, this.words[S + 1] = N >>> 26 - q & 67108863, q += 24, q >= 26 && (q -= 26, S++);
6321
+ for (B = n.length - 1, S = 0; B >= 0; B -= 3)
6322
+ N = n[B] | n[B - 1] << 8 | n[B - 2] << 16, this.words[S] |= N << q & 67108863, this.words[S + 1] = N >>> 26 - q & 67108863, q += 24, q >= 26 && (q -= 26, S++);
6323
6323
  else if (g === "le")
6324
- for (C = 0, S = 0; C < n.length; C += 3)
6325
- N = n[C] | n[C + 1] << 8 | n[C + 2] << 16, this.words[S] |= N << q & 67108863, this.words[S + 1] = N >>> 26 - q & 67108863, q += 24, q >= 26 && (q -= 26, S++);
6324
+ for (B = 0, S = 0; B < n.length; B += 3)
6325
+ N = n[B] | n[B + 1] << 8 | n[B + 2] << 16, this.words[S] |= N << q & 67108863, this.words[S + 1] = N >>> 26 - q & 67108863, q += 24, q >= 26 && (q -= 26, S++);
6326
6326
  return this.strip();
6327
6327
  };
6328
6328
  function x(A, n) {
@@ -6335,33 +6335,33 @@ Uf.exports;
6335
6335
  }
6336
6336
  i.prototype._parseHex = function(n, d, g) {
6337
6337
  this.length = Math.ceil((n.length - d) / 6), this.words = new Array(this.length);
6338
- for (var C = 0; C < this.length; C++)
6339
- this.words[C] = 0;
6338
+ for (var B = 0; B < this.length; B++)
6339
+ this.words[B] = 0;
6340
6340
  var S = 0, N = 0, q;
6341
6341
  if (g === "be")
6342
- for (C = n.length - 1; C >= d; C -= 2)
6343
- q = u(n, d, C) << S, this.words[N] |= q & 67108863, S >= 18 ? (S -= 18, N += 1, this.words[N] |= q >>> 26) : S += 8;
6342
+ for (B = n.length - 1; B >= d; B -= 2)
6343
+ q = u(n, d, B) << S, this.words[N] |= q & 67108863, S >= 18 ? (S -= 18, N += 1, this.words[N] |= q >>> 26) : S += 8;
6344
6344
  else {
6345
6345
  var D = n.length - d;
6346
- for (C = D % 2 === 0 ? d + 1 : d; C < n.length; C += 2)
6347
- q = u(n, d, C) << S, this.words[N] |= q & 67108863, S >= 18 ? (S -= 18, N += 1, this.words[N] |= q >>> 26) : S += 8;
6346
+ for (B = D % 2 === 0 ? d + 1 : d; B < n.length; B += 2)
6347
+ q = u(n, d, B) << S, this.words[N] |= q & 67108863, S >= 18 ? (S -= 18, N += 1, this.words[N] |= q >>> 26) : S += 8;
6348
6348
  }
6349
6349
  this.strip();
6350
6350
  };
6351
6351
  function o(A, n, d, g) {
6352
- for (var C = 0, S = Math.min(A.length, d), N = n; N < S; N++) {
6352
+ for (var B = 0, S = Math.min(A.length, d), N = n; N < S; N++) {
6353
6353
  var q = A.charCodeAt(N) - 48;
6354
- C *= g, q >= 49 ? C += q - 49 + 10 : q >= 17 ? C += q - 17 + 10 : C += q;
6354
+ B *= g, q >= 49 ? B += q - 49 + 10 : q >= 17 ? B += q - 17 + 10 : B += q;
6355
6355
  }
6356
- return C;
6356
+ return B;
6357
6357
  }
6358
6358
  i.prototype._parseBase = function(n, d, g) {
6359
6359
  this.words = [0], this.length = 1;
6360
- for (var C = 0, S = 1; S <= 67108863; S *= d)
6361
- C++;
6362
- C--, S = S / d | 0;
6363
- for (var N = n.length - g, q = N % C, D = Math.min(N, N - q) + g, h = 0, E = g; E < D; E += C)
6364
- h = o(n, E, E + C, d), this.imuln(S), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
6360
+ for (var B = 0, S = 1; S <= 67108863; S *= d)
6361
+ B++;
6362
+ B--, S = S / d | 0;
6363
+ for (var N = n.length - g, q = N % B, D = Math.min(N, N - q) + g, h = 0, E = g; E < D; E += B)
6364
+ h = o(n, E, E + B, d), this.imuln(S), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
6365
6365
  if (q !== 0) {
6366
6366
  var j = 1;
6367
6367
  for (h = o(n, E, n.length, d), E = 0; E < q; E++)
@@ -6417,7 +6417,7 @@ Uf.exports;
6417
6417
  "00000000000000000000000",
6418
6418
  "000000000000000000000000",
6419
6419
  "0000000000000000000000000"
6420
- ], v = [
6420
+ ], b = [
6421
6421
  0,
6422
6422
  0,
6423
6423
  25,
@@ -6455,7 +6455,7 @@ Uf.exports;
6455
6455
  5,
6456
6456
  5,
6457
6457
  5
6458
- ], b = [
6458
+ ], v = [
6459
6459
  0,
6460
6460
  0,
6461
6461
  33554432,
@@ -6499,16 +6499,16 @@ Uf.exports;
6499
6499
  var g;
6500
6500
  if (n === 16 || n === "hex") {
6501
6501
  g = "";
6502
- for (var C = 0, S = 0, N = 0; N < this.length; N++) {
6503
- var q = this.words[N], D = ((q << C | S) & 16777215).toString(16);
6504
- S = q >>> 24 - C & 16777215, S !== 0 || N !== this.length - 1 ? g = c[6 - D.length] + D + g : g = D + g, C += 2, C >= 26 && (C -= 26, N--);
6502
+ for (var B = 0, S = 0, N = 0; N < this.length; N++) {
6503
+ var q = this.words[N], D = ((q << B | S) & 16777215).toString(16);
6504
+ S = q >>> 24 - B & 16777215, S !== 0 || N !== this.length - 1 ? g = c[6 - D.length] + D + g : g = D + g, B += 2, B >= 26 && (B -= 26, N--);
6505
6505
  }
6506
6506
  for (S !== 0 && (g = S.toString(16) + g); g.length % d !== 0; )
6507
6507
  g = "0" + g;
6508
6508
  return this.negative !== 0 && (g = "-" + g), g;
6509
6509
  }
6510
6510
  if (n === (n | 0) && n >= 2 && n <= 36) {
6511
- var h = v[n], E = b[n];
6511
+ var h = b[n], E = v[n];
6512
6512
  g = "";
6513
6513
  var j = this.clone();
6514
6514
  for (j.negative = 0; !j.isZero(); ) {
@@ -6530,8 +6530,8 @@ Uf.exports;
6530
6530
  }, i.prototype.toArray = function(n, d) {
6531
6531
  return this.toArrayLike(Array, n, d);
6532
6532
  }, i.prototype.toArrayLike = function(n, d, g) {
6533
- var C = this.byteLength(), S = g || Math.max(1, C);
6534
- r(C <= S, "byte array longer than desired length"), r(S > 0, "Requested array length <= 0"), this.strip();
6533
+ var B = this.byteLength(), S = g || Math.max(1, B);
6534
+ r(B <= S, "byte array longer than desired length"), r(S > 0, "Requested array length <= 0"), this.strip();
6535
6535
  var N = d === "le", q = new n(S), D, h, E = this.clone();
6536
6536
  if (N) {
6537
6537
  for (h = 0; !E.isZero(); h++)
@@ -6539,7 +6539,7 @@ Uf.exports;
6539
6539
  for (; h < S; h++)
6540
6540
  q[h] = 0;
6541
6541
  } else {
6542
- for (h = 0; h < S - C; h++)
6542
+ for (h = 0; h < S - B; h++)
6543
6543
  q[h] = 0;
6544
6544
  for (h = 0; !E.isZero(); h++)
6545
6545
  D = E.andln(255), E.iushrn(8), q[S - h - 1] = D;
@@ -6559,10 +6559,10 @@ Uf.exports;
6559
6559
  var n = this.words[this.length - 1], d = this._countBits(n);
6560
6560
  return (this.length - 1) * 26 + d;
6561
6561
  };
6562
- function B(A) {
6562
+ function C(A) {
6563
6563
  for (var n = new Array(A.bitLength()), d = 0; d < n.length; d++) {
6564
- var g = d / 26 | 0, C = d % 26;
6565
- n[d] = (A.words[g] & 1 << C) >>> C;
6564
+ var g = d / 26 | 0, B = d % 26;
6565
+ n[d] = (A.words[g] & 1 << B) >>> B;
6566
6566
  }
6567
6567
  return n;
6568
6568
  }
@@ -6614,11 +6614,11 @@ Uf.exports;
6614
6614
  }, i.prototype.iuxor = function(n) {
6615
6615
  var d, g;
6616
6616
  this.length > n.length ? (d = this, g = n) : (d = n, g = this);
6617
- for (var C = 0; C < g.length; C++)
6618
- this.words[C] = d.words[C] ^ g.words[C];
6617
+ for (var B = 0; B < g.length; B++)
6618
+ this.words[B] = d.words[B] ^ g.words[B];
6619
6619
  if (this !== d)
6620
- for (; C < d.length; C++)
6621
- this.words[C] = d.words[C];
6620
+ for (; B < d.length; B++)
6621
+ this.words[B] = d.words[B];
6622
6622
  return this.length = d.length, this.strip();
6623
6623
  }, i.prototype.ixor = function(n) {
6624
6624
  return r((this.negative | n.negative) === 0), this.iuxor(n);
@@ -6630,25 +6630,25 @@ Uf.exports;
6630
6630
  r(typeof n == "number" && n >= 0);
6631
6631
  var d = Math.ceil(n / 26) | 0, g = n % 26;
6632
6632
  this._expand(d), g > 0 && d--;
6633
- for (var C = 0; C < d; C++)
6634
- this.words[C] = ~this.words[C] & 67108863;
6635
- return g > 0 && (this.words[C] = ~this.words[C] & 67108863 >> 26 - g), this.strip();
6633
+ for (var B = 0; B < d; B++)
6634
+ this.words[B] = ~this.words[B] & 67108863;
6635
+ return g > 0 && (this.words[B] = ~this.words[B] & 67108863 >> 26 - g), this.strip();
6636
6636
  }, i.prototype.notn = function(n) {
6637
6637
  return this.clone().inotn(n);
6638
6638
  }, i.prototype.setn = function(n, d) {
6639
6639
  r(typeof n == "number" && n >= 0);
6640
- var g = n / 26 | 0, C = n % 26;
6641
- return this._expand(g + 1), d ? this.words[g] = this.words[g] | 1 << C : this.words[g] = this.words[g] & ~(1 << C), this.strip();
6640
+ var g = n / 26 | 0, B = n % 26;
6641
+ return this._expand(g + 1), d ? this.words[g] = this.words[g] | 1 << B : this.words[g] = this.words[g] & ~(1 << B), this.strip();
6642
6642
  }, i.prototype.iadd = function(n) {
6643
6643
  var d;
6644
6644
  if (this.negative !== 0 && n.negative === 0)
6645
6645
  return this.negative = 0, d = this.isub(n), this.negative ^= 1, this._normSign();
6646
6646
  if (this.negative === 0 && n.negative !== 0)
6647
6647
  return n.negative = 0, d = this.isub(n), n.negative = 1, d._normSign();
6648
- var g, C;
6649
- this.length > n.length ? (g = this, C = n) : (g = n, C = this);
6650
- for (var S = 0, N = 0; N < C.length; N++)
6651
- d = (g.words[N] | 0) + (C.words[N] | 0) + S, this.words[N] = d & 67108863, S = d >>> 26;
6648
+ var g, B;
6649
+ this.length > n.length ? (g = this, B = n) : (g = n, B = this);
6650
+ for (var S = 0, N = 0; N < B.length; N++)
6651
+ d = (g.words[N] | 0) + (B.words[N] | 0) + S, this.words[N] = d & 67108863, S = d >>> 26;
6652
6652
  for (; S !== 0 && N < g.length; N++)
6653
6653
  d = (g.words[N] | 0) + S, this.words[N] = d & 67108863, S = d >>> 26;
6654
6654
  if (this.length = g.length, S !== 0)
@@ -6670,16 +6670,16 @@ Uf.exports;
6670
6670
  var g = this.cmp(n);
6671
6671
  if (g === 0)
6672
6672
  return this.negative = 0, this.length = 1, this.words[0] = 0, this;
6673
- var C, S;
6674
- g > 0 ? (C = this, S = n) : (C = n, S = this);
6673
+ var B, S;
6674
+ g > 0 ? (B = this, S = n) : (B = n, S = this);
6675
6675
  for (var N = 0, q = 0; q < S.length; q++)
6676
- d = (C.words[q] | 0) - (S.words[q] | 0) + N, N = d >> 26, this.words[q] = d & 67108863;
6677
- for (; N !== 0 && q < C.length; q++)
6678
- d = (C.words[q] | 0) + N, N = d >> 26, this.words[q] = d & 67108863;
6679
- if (N === 0 && q < C.length && C !== this)
6680
- for (; q < C.length; q++)
6681
- this.words[q] = C.words[q];
6682
- return this.length = Math.max(this.length, q), C !== this && (this.negative = 1), this.strip();
6676
+ d = (B.words[q] | 0) - (S.words[q] | 0) + N, N = d >> 26, this.words[q] = d & 67108863;
6677
+ for (; N !== 0 && q < B.length; q++)
6678
+ d = (B.words[q] | 0) + N, N = d >> 26, this.words[q] = d & 67108863;
6679
+ if (N === 0 && q < B.length && B !== this)
6680
+ for (; q < B.length; q++)
6681
+ this.words[q] = B.words[q];
6682
+ return this.length = Math.max(this.length, q), B !== this && (this.negative = 1), this.strip();
6683
6683
  }, i.prototype.sub = function(n) {
6684
6684
  return this.clone().isub(n);
6685
6685
  };
@@ -6687,19 +6687,19 @@ Uf.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, S = n.words[0] | 0, N = C * S, q = N & 67108863, D = N / 67108864 | 0;
6690
+ var B = A.words[0] | 0, S = n.words[0] | 0, N = B * S, q = N & 67108863, D = N / 67108864 | 0;
6691
6691
  d.words[0] = q;
6692
6692
  for (var h = 1; h < g; h++) {
6693
6693
  for (var E = D >>> 26, j = D & 67108863, K = Math.min(h, n.length - 1), W = Math.max(0, h - A.length + 1); W <= K; W++) {
6694
6694
  var re = h - W | 0;
6695
- C = A.words[re] | 0, S = n.words[W] | 0, N = C * S + j, E += N / 67108864 | 0, j = N & 67108863;
6695
+ B = A.words[re] | 0, S = n.words[W] | 0, N = B * S + j, E += N / 67108864 | 0, j = N & 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, S = d.words, N = g.words, q = 0, D, h, E, j = C[0] | 0, K = j & 8191, W = j >>> 13, re = C[1] | 0, ce = re & 8191, we = re >>> 13, Ae = C[2] | 0, Me = Ae & 8191, Se = Ae >>> 13, G0 = C[3] | 0, We = G0 & 8191, Oe = G0 >>> 13, _0 = C[4] | 0, Ge = _0 & 8191, Ke = _0 >>> 13, $0 = C[5] | 0, Qe = $0 & 8191, ze = $0 >>> 13, O0 = C[6] | 0, Ne = O0 & 8191, Fe = O0 >>> 13, S0 = C[7] | 0, Je = S0 & 8191, f0 = S0 >>> 13, F0 = C[8] | 0, qe = F0 & 8191, u0 = F0 >>> 13, Q0 = C[9] | 0, l0 = Q0 & 8191, He = Q0 >>> 13, N0 = S[0] | 0, a0 = N0 & 8191, r0 = N0 >>> 13, q0 = S[1] | 0, i0 = q0 & 8191, s0 = q0 >>> 13, W0 = S[2] | 0, e0 = W0 & 8191, n0 = W0 >>> 13, L0 = S[3] | 0, o0 = L0 & 8191, x0 = L0 >>> 13, D0 = S[4] | 0, t0 = D0 & 8191, Ve = D0 >>> 13, rt = S[5] | 0, c0 = rt & 8191, d0 = rt >>> 13, yt = S[6] | 0, Ie = yt & 8191, Re = yt >>> 13, l = S[7] | 0, _ = l & 8191, m = l >>> 13, s = S[8] | 0, M = s & 8191, p = s >>> 13, I = S[9] | 0, L = I & 8191, V = I >>> 13;
6702
+ var B = n.words, S = d.words, N = g.words, q = 0, D, h, E, j = B[0] | 0, K = j & 8191, W = j >>> 13, re = B[1] | 0, ce = re & 8191, we = re >>> 13, Ae = B[2] | 0, Me = Ae & 8191, Se = Ae >>> 13, G0 = B[3] | 0, We = G0 & 8191, Oe = G0 >>> 13, _0 = B[4] | 0, Ge = _0 & 8191, Ke = _0 >>> 13, $0 = B[5] | 0, Qe = $0 & 8191, ze = $0 >>> 13, O0 = B[6] | 0, Ne = O0 & 8191, Fe = O0 >>> 13, S0 = B[7] | 0, Je = S0 & 8191, f0 = S0 >>> 13, F0 = B[8] | 0, qe = F0 & 8191, u0 = F0 >>> 13, Q0 = B[9] | 0, l0 = Q0 & 8191, He = Q0 >>> 13, N0 = S[0] | 0, a0 = N0 & 8191, r0 = N0 >>> 13, q0 = S[1] | 0, i0 = q0 & 8191, s0 = q0 >>> 13, W0 = S[2] | 0, e0 = W0 & 8191, n0 = W0 >>> 13, L0 = S[3] | 0, o0 = L0 & 8191, x0 = L0 >>> 13, D0 = S[4] | 0, t0 = D0 & 8191, Ve = D0 >>> 13, rt = S[5] | 0, c0 = rt & 8191, d0 = rt >>> 13, yt = S[6] | 0, Ie = yt & 8191, Re = yt >>> 13, l = S[7] | 0, _ = l & 8191, m = l >>> 13, s = S[8] | 0, M = s & 8191, p = s >>> 13, I = S[9] | 0, L = I & 8191, V = I >>> 13;
6703
6703
  g.negative = n.negative ^ d.negative, g.length = 19, D = Math.imul(K, a0), h = Math.imul(K, r0), h = h + Math.imul(W, a0) | 0, E = Math.imul(W, r0);
6704
6704
  var ne = (q + D | 0) + ((h & 8191) << 13) | 0;
6705
6705
  q = (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(K, i0) | 0, h = h + Math.imul(K, s0) | 0, h = h + Math.imul(W, i0) | 0, E = E + Math.imul(W, s0) | 0;
@@ -6743,14 +6743,14 @@ Uf.exports;
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
- for (var g = 0, C = 0, S = 0; S < d.length - 1; S++) {
6747
- var N = C;
6748
- C = 0;
6746
+ for (var g = 0, B = 0, S = 0; S < d.length - 1; S++) {
6747
+ var N = B;
6748
+ B = 0;
6749
6749
  for (var q = g & 67108863, D = Math.min(S, n.length - 1), h = Math.max(0, S - A.length + 1); h <= D; h++) {
6750
6750
  var E = S - h, j = A.words[E] | 0, K = n.words[h] | 0, W = j * K, re = W & 67108863;
6751
- N = N + (W / 67108864 | 0) | 0, re = re + q | 0, q = re & 67108863, N = N + (re >>> 26) | 0, C += N >>> 26, N &= 67108863;
6751
+ N = N + (W / 67108864 | 0) | 0, re = re + q | 0, q = re & 67108863, N = N + (re >>> 26) | 0, B += N >>> 26, N &= 67108863;
6752
6752
  }
6753
- d.words[S] = q, g = N, N = C;
6753
+ d.words[S] = q, g = N, N = B;
6754
6754
  }
6755
6755
  return g !== 0 ? d.words[S] = g : d.length--, d.strip();
6756
6756
  }
@@ -6759,54 +6759,54 @@ Uf.exports;
6759
6759
  return g.mulp(A, n, d);
6760
6760
  }
6761
6761
  i.prototype.mulTo = function(n, d) {
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 = z(this, n, d), g;
6762
+ var g, B = this.length + n.length;
6763
+ 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 = z(this, n, d), g;
6764
6764
  };
6765
6765
  function F(A, n) {
6766
6766
  this.x = A, this.y = n;
6767
6767
  }
6768
6768
  F.prototype.makeRBT = function(n) {
6769
- for (var d = new Array(n), g = i.prototype._countBits(n) - 1, C = 0; C < n; C++)
6770
- d[C] = this.revBin(C, g, n);
6769
+ for (var d = new Array(n), g = i.prototype._countBits(n) - 1, B = 0; B < n; B++)
6770
+ d[B] = this.revBin(B, g, n);
6771
6771
  return d;
6772
6772
  }, F.prototype.revBin = function(n, d, g) {
6773
6773
  if (n === 0 || n === g - 1)
6774
6774
  return n;
6775
- for (var C = 0, S = 0; S < d; S++)
6776
- C |= (n & 1) << d - S - 1, n >>= 1;
6777
- return C;
6778
- }, F.prototype.permute = function(n, d, g, C, S, N) {
6775
+ for (var B = 0, S = 0; S < d; S++)
6776
+ B |= (n & 1) << d - S - 1, n >>= 1;
6777
+ return B;
6778
+ }, F.prototype.permute = function(n, d, g, B, S, N) {
6779
6779
  for (var q = 0; q < N; q++)
6780
- C[q] = d[n[q]], S[q] = g[n[q]];
6781
- }, F.prototype.transform = function(n, d, g, C, S, N) {
6782
- this.permute(N, n, d, g, C, S);
6780
+ B[q] = d[n[q]], S[q] = g[n[q]];
6781
+ }, F.prototype.transform = function(n, d, g, B, S, N) {
6782
+ this.permute(N, n, d, g, B, S);
6783
6783
  for (var q = 1; q < S; q <<= 1)
6784
6784
  for (var D = q << 1, h = Math.cos(2 * Math.PI / D), E = Math.sin(2 * Math.PI / D), j = 0; j < S; j += D)
6785
6785
  for (var K = h, W = E, re = 0; re < q; re++) {
6786
- var ce = g[j + re], we = C[j + re], Ae = g[j + re + q], Me = C[j + re + q], Se = K * Ae - W * Me;
6787
- Me = K * Me + W * Ae, Ae = Se, g[j + re] = ce + Ae, C[j + re] = we + Me, g[j + re + q] = ce - Ae, C[j + re + q] = we - Me, re !== D && (Se = h * K - E * W, W = h * W + E * K, K = Se);
6786
+ var ce = g[j + re], we = B[j + re], Ae = g[j + re + q], Me = B[j + re + q], Se = K * Ae - W * Me;
6787
+ Me = K * Me + W * Ae, Ae = Se, g[j + re] = ce + Ae, B[j + re] = we + Me, g[j + re + q] = ce - Ae, B[j + re + q] = we - Me, re !== D && (Se = h * K - E * W, W = h * W + E * K, K = Se);
6788
6788
  }
6789
6789
  }, F.prototype.guessLen13b = function(n, d) {
6790
- var g = Math.max(d, n) | 1, C = g & 1, S = 0;
6790
+ var g = Math.max(d, n) | 1, B = g & 1, S = 0;
6791
6791
  for (g = g / 2 | 0; g; g = g >>> 1)
6792
6792
  S++;
6793
- return 1 << S + 1 + C;
6793
+ return 1 << S + 1 + B;
6794
6794
  }, F.prototype.conjugate = function(n, d, g) {
6795
6795
  if (!(g <= 1))
6796
- for (var C = 0; C < g / 2; C++) {
6797
- var S = n[C];
6798
- n[C] = n[g - C - 1], n[g - C - 1] = S, S = d[C], d[C] = -d[g - C - 1], d[g - C - 1] = -S;
6796
+ for (var B = 0; B < g / 2; B++) {
6797
+ var S = n[B];
6798
+ n[B] = n[g - B - 1], n[g - B - 1] = S, S = d[B], d[B] = -d[g - B - 1], d[g - B - 1] = -S;
6799
6799
  }
6800
6800
  }, F.prototype.normalize13b = function(n, d) {
6801
- for (var g = 0, C = 0; C < d / 2; C++) {
6802
- var S = Math.round(n[2 * C + 1] / d) * 8192 + Math.round(n[2 * C] / d) + g;
6803
- n[C] = S & 67108863, S < 67108864 ? g = 0 : g = S / 67108864 | 0;
6801
+ for (var g = 0, B = 0; B < d / 2; B++) {
6802
+ var S = Math.round(n[2 * B + 1] / d) * 8192 + Math.round(n[2 * B] / d) + g;
6803
+ n[B] = S & 67108863, S < 67108864 ? g = 0 : g = S / 67108864 | 0;
6804
6804
  }
6805
6805
  return n;
6806
- }, F.prototype.convert13b = function(n, d, g, C) {
6806
+ }, F.prototype.convert13b = function(n, d, g, B) {
6807
6807
  for (var S = 0, N = 0; N < d; N++)
6808
6808
  S = S + (n[N] | 0), g[2 * N] = S & 8191, S = S >>> 13, g[2 * N + 1] = S & 8191, S = S >>> 13;
6809
- for (N = 2 * d; N < C; ++N)
6809
+ for (N = 2 * d; N < B; ++N)
6810
6810
  g[N] = 0;
6811
6811
  r(S === 0), r((S & -8192) === 0);
6812
6812
  }, F.prototype.stub = function(n) {
@@ -6814,13 +6814,13 @@ Uf.exports;
6814
6814
  d[g] = 0;
6815
6815
  return d;
6816
6816
  }, F.prototype.mulp = function(n, d, g) {
6817
- var C = 2 * this.guessLen13b(n.length, d.length), S = this.makeRBT(C), N = this.stub(C), q = new Array(C), D = new Array(C), h = new Array(C), E = new Array(C), j = new Array(C), K = new Array(C), W = g.words;
6818
- W.length = C, this.convert13b(n.words, n.length, q, C), this.convert13b(d.words, d.length, E, C), this.transform(q, N, D, h, C, S), this.transform(E, N, j, K, C, S);
6819
- for (var re = 0; re < C; re++) {
6817
+ var B = 2 * this.guessLen13b(n.length, d.length), S = this.makeRBT(B), N = this.stub(B), q = new Array(B), D = new Array(B), h = new Array(B), E = new Array(B), j = new Array(B), K = new Array(B), W = g.words;
6818
+ W.length = B, this.convert13b(n.words, n.length, q, B), this.convert13b(d.words, d.length, E, B), this.transform(q, N, D, h, B, S), this.transform(E, N, j, K, B, S);
6819
+ for (var re = 0; re < B; re++) {
6820
6820
  var ce = D[re] * j[re] - h[re] * K[re];
6821
6821
  h[re] = D[re] * K[re] + h[re] * j[re], D[re] = ce;
6822
6822
  }
6823
- return this.conjugate(D, h, C), this.transform(D, h, W, N, C, S), this.conjugate(W, N, 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, B), this.transform(D, h, W, N, B, S), this.conjugate(W, N, B), this.normalize13b(W, B), 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);
@@ -6832,8 +6832,8 @@ Uf.exports;
6832
6832
  }, i.prototype.imuln = function(n) {
6833
6833
  r(typeof n == "number"), r(n < 67108864);
6834
6834
  for (var d = 0, g = 0; g < this.length; g++) {
6835
- var C = (this.words[g] | 0) * n, S = (C & 67108863) + (d & 67108863);
6836
- d >>= 26, d += C / 67108864 | 0, d += S >>> 26, this.words[g] = S & 67108863;
6835
+ var B = (this.words[g] | 0) * n, S = (B & 67108863) + (d & 67108863);
6836
+ d >>= 26, d += B / 67108864 | 0, d += S >>> 26, this.words[g] = S & 67108863;
6837
6837
  }
6838
6838
  return d !== 0 && (this.words[g] = d, this.length++), this;
6839
6839
  }, i.prototype.muln = function(n) {
@@ -6843,22 +6843,22 @@ Uf.exports;
6843
6843
  }, i.prototype.isqr = function() {
6844
6844
  return this.imul(this.clone());
6845
6845
  }, i.prototype.pow = function(n) {
6846
- var d = B(n);
6846
+ var d = C(n);
6847
6847
  if (d.length === 0)
6848
6848
  return new i(1);
6849
- for (var g = this, C = 0; C < d.length && d[C] === 0; C++, g = g.sqr())
6849
+ for (var g = this, B = 0; B < d.length && d[B] === 0; B++, g = g.sqr())
6850
6850
  ;
6851
- if (++C < d.length)
6852
- for (var S = g.sqr(); C < d.length; C++, S = S.sqr())
6853
- d[C] !== 0 && (g = g.mul(S));
6851
+ if (++B < d.length)
6852
+ for (var S = g.sqr(); B < d.length; B++, S = S.sqr())
6853
+ d[B] !== 0 && (g = g.mul(S));
6854
6854
  return g;
6855
6855
  }, i.prototype.iushln = function(n) {
6856
6856
  r(typeof n == "number" && n >= 0);
6857
- var d = n % 26, g = (n - d) / 26, C = 67108863 >>> 26 - d << 26 - d, S;
6857
+ var d = n % 26, g = (n - d) / 26, B = 67108863 >>> 26 - d << 26 - d, S;
6858
6858
  if (d !== 0) {
6859
6859
  var N = 0;
6860
6860
  for (S = 0; S < this.length; S++) {
6861
- var q = this.words[S] & C, D = (this.words[S] | 0) - q << d;
6861
+ var q = this.words[S] & B, D = (this.words[S] | 0) - q << d;
6862
6862
  this.words[S] = D | N, N = q >>> 26 - d;
6863
6863
  }
6864
6864
  N && (this.words[S] = N, this.length++);
@@ -6875,10 +6875,10 @@ Uf.exports;
6875
6875
  return r(this.negative === 0), this.iushln(n);
6876
6876
  }, i.prototype.iushrn = function(n, d, g) {
6877
6877
  r(typeof n == "number" && n >= 0);
6878
- var C;
6879
- d ? C = (d - d % 26) / 26 : C = 0;
6878
+ var B;
6879
+ d ? B = (d - d % 26) / 26 : B = 0;
6880
6880
  var S = n % 26, N = Math.min((n - S) / 26, this.length), q = 67108863 ^ 67108863 >>> S << S, D = g;
6881
- if (C -= N, C = Math.max(0, C), D) {
6881
+ if (B -= N, B = Math.max(0, B), D) {
6882
6882
  for (var h = 0; h < N; h++)
6883
6883
  D.words[h] = this.words[h];
6884
6884
  D.length = N;
@@ -6890,7 +6890,7 @@ Uf.exports;
6890
6890
  else
6891
6891
  this.words[0] = 0, this.length = 1;
6892
6892
  var E = 0;
6893
- for (h = this.length - 1; h >= 0 && (E !== 0 || h >= C); h--) {
6893
+ for (h = this.length - 1; h >= 0 && (E !== 0 || h >= B); h--) {
6894
6894
  var j = this.words[h] | 0;
6895
6895
  this.words[h] = E << 26 - S | j >>> S, E = j & q;
6896
6896
  }
@@ -6907,19 +6907,19 @@ Uf.exports;
6907
6907
  return this.clone().iushrn(n);
6908
6908
  }, i.prototype.testn = function(n) {
6909
6909
  r(typeof n == "number" && n >= 0);
6910
- var d = n % 26, g = (n - d) / 26, C = 1 << d;
6910
+ var d = n % 26, g = (n - d) / 26, B = 1 << d;
6911
6911
  if (this.length <= g)
6912
6912
  return !1;
6913
6913
  var S = this.words[g];
6914
- return !!(S & C);
6914
+ return !!(S & B);
6915
6915
  }, i.prototype.imaskn = function(n) {
6916
6916
  r(typeof n == "number" && n >= 0);
6917
6917
  var d = n % 26, g = (n - d) / 26;
6918
6918
  if (r(this.negative === 0, "imaskn works only with positive numbers"), this.length <= g)
6919
6919
  return this;
6920
6920
  if (d !== 0 && g++, this.length = Math.min(g, this.length), d !== 0) {
6921
- var C = 67108863 ^ 67108863 >>> d << d;
6922
- this.words[this.length - 1] &= C;
6921
+ var B = 67108863 ^ 67108863 >>> d << d;
6922
+ this.words[this.length - 1] &= B;
6923
6923
  }
6924
6924
  return this.strip();
6925
6925
  }, i.prototype.maskn = function(n) {
@@ -6951,8 +6951,8 @@ Uf.exports;
6951
6951
  }, i.prototype.abs = function() {
6952
6952
  return this.clone().iabs();
6953
6953
  }, i.prototype._ishlnsubmul = function(n, d, g) {
6954
- var C = n.length + g, S;
6955
- this._expand(C);
6954
+ var B = n.length + g, S;
6955
+ this._expand(B);
6956
6956
  var N, q = 0;
6957
6957
  for (S = 0; S < n.length; S++) {
6958
6958
  N = (this.words[S + g] | 0) + q;
@@ -6967,25 +6967,25 @@ Uf.exports;
6967
6967
  N = -(this.words[S] | 0) + q, q = N >> 26, this.words[S] = N & 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(), S = n, N = S.words[S.length - 1] | 0, q = this._countBits(N);
6971
- g = 26 - q, g !== 0 && (S = S.ushln(g), C.iushln(g), N = S.words[S.length - 1] | 0);
6972
- var D = C.length - S.length, h;
6970
+ var g = this.length - n.length, B = this.clone(), S = n, N = S.words[S.length - 1] | 0, q = this._countBits(N);
6971
+ g = 26 - q, g !== 0 && (S = S.ushln(g), B.iushln(g), N = S.words[S.length - 1] | 0);
6972
+ var D = B.length - S.length, h;
6973
6973
  if (d !== "mod") {
6974
6974
  h = new i(null), h.length = D + 1, h.words = new Array(h.length);
6975
6975
  for (var E = 0; E < h.length; E++)
6976
6976
  h.words[E] = 0;
6977
6977
  }
6978
- var j = C.clone()._ishlnsubmul(S, 1, D);
6979
- j.negative === 0 && (C = j, h && (h.words[D] = 1));
6978
+ var j = B.clone()._ishlnsubmul(S, 1, D);
6979
+ j.negative === 0 && (B = j, h && (h.words[D] = 1));
6980
6980
  for (var K = D - 1; K >= 0; K--) {
6981
- var W = (C.words[S.length + K] | 0) * 67108864 + (C.words[S.length + K - 1] | 0);
6982
- for (W = Math.min(W / N | 0, 67108863), C._ishlnsubmul(S, W, K); C.negative !== 0; )
6983
- W--, C.negative = 0, C._ishlnsubmul(S, 1, K), C.isZero() || (C.negative ^= 1);
6981
+ var W = (B.words[S.length + K] | 0) * 67108864 + (B.words[S.length + K - 1] | 0);
6982
+ for (W = Math.min(W / N | 0, 67108863), B._ishlnsubmul(S, W, K); B.negative !== 0; )
6983
+ W--, B.negative = 0, B._ishlnsubmul(S, 1, K), B.isZero() || (B.negative ^= 1);
6984
6984
  h && (h.words[K] = W);
6985
6985
  }
6986
- return h && h.strip(), C.strip(), d !== "div" && g !== 0 && C.iushrn(g), {
6986
+ return h && h.strip(), B.strip(), d !== "div" && g !== 0 && B.iushrn(g), {
6987
6987
  div: h || null,
6988
- mod: C
6988
+ mod: B
6989
6989
  };
6990
6990
  }, i.prototype.divmod = function(n, d, g) {
6991
6991
  if (r(!n.isZero()), this.isZero())
@@ -6993,12 +6993,12 @@ Uf.exports;
6993
6993
  div: new i(0),
6994
6994
  mod: new i(0)
6995
6995
  };
6996
- var C, S, N;
6997
- return this.negative !== 0 && n.negative === 0 ? (N = this.neg().divmod(n, d), d !== "mod" && (C = N.div.neg()), d !== "div" && (S = N.mod.neg(), g && S.negative !== 0 && S.iadd(n)), {
6998
- div: C,
6996
+ var B, S, N;
6997
+ return this.negative !== 0 && n.negative === 0 ? (N = this.neg().divmod(n, d), d !== "mod" && (B = N.div.neg()), d !== "div" && (S = N.mod.neg(), g && S.negative !== 0 && S.iadd(n)), {
6998
+ div: B,
6999
6999
  mod: S
7000
- }) : this.negative === 0 && n.negative !== 0 ? (N = this.divmod(n.neg(), d), d !== "mod" && (C = N.div.neg()), {
7001
- div: C,
7000
+ }) : this.negative === 0 && n.negative !== 0 ? (N = this.divmod(n.neg(), d), d !== "mod" && (B = N.div.neg()), {
7001
+ div: B,
7002
7002
  mod: N.mod
7003
7003
  }) : this.negative & n.negative ? (N = this.neg().divmod(n.neg(), d), d !== "div" && (S = N.mod.neg(), g && S.negative !== 0 && S.isub(n)), {
7004
7004
  div: N.div,
@@ -7026,18 +7026,18 @@ Uf.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), S = n.andln(1), N = g.cmp(C);
7029
+ var g = d.div.negative !== 0 ? d.mod.isub(n) : d.mod, B = n.ushrn(1), S = n.andln(1), N = g.cmp(B);
7030
7030
  return N < 0 || S === 1 && N === 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
- for (var d = (1 << 26) % n, g = 0, C = this.length - 1; C >= 0; C--)
7034
- g = (d * g + (this.words[C] | 0)) % n;
7033
+ for (var d = (1 << 26) % n, g = 0, B = this.length - 1; B >= 0; B--)
7034
+ g = (d * g + (this.words[B] | 0)) % n;
7035
7035
  return g;
7036
7036
  }, i.prototype.idivn = function(n) {
7037
7037
  r(n <= 67108863);
7038
7038
  for (var d = 0, g = this.length - 1; g >= 0; g--) {
7039
- var C = (this.words[g] | 0) + d * 67108864;
7040
- this.words[g] = C / n | 0, d = C % n;
7039
+ var B = (this.words[g] | 0) + d * 67108864;
7040
+ this.words[g] = B / n | 0, d = B % n;
7041
7041
  }
7042
7042
  return this.strip();
7043
7043
  }, i.prototype.divn = function(n) {
@@ -7046,20 +7046,20 @@ Uf.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), S = new i(0), N = new i(0), q = new i(1), D = 0; d.isEven() && g.isEven(); )
7049
+ for (var B = new i(1), S = new i(0), N = new i(0), q = 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, K = 1; !(d.words[0] & K) && j < 26; ++j, K <<= 1)
7053
7053
  ;
7054
7054
  if (j > 0)
7055
7055
  for (d.iushrn(j); j-- > 0; )
7056
- (C.isOdd() || S.isOdd()) && (C.iadd(h), S.isub(E)), C.iushrn(1), S.iushrn(1);
7056
+ (B.isOdd() || S.isOdd()) && (B.iadd(h), S.isub(E)), B.iushrn(1), S.iushrn(1);
7057
7057
  for (var W = 0, re = 1; !(g.words[0] & re) && W < 26; ++W, re <<= 1)
7058
7058
  ;
7059
7059
  if (W > 0)
7060
7060
  for (g.iushrn(W); W-- > 0; )
7061
7061
  (N.isOdd() || q.isOdd()) && (N.iadd(h), q.isub(E)), N.iushrn(1), q.iushrn(1);
7062
- d.cmp(g) >= 0 ? (d.isub(g), C.isub(N), S.isub(q)) : (g.isub(d), N.isub(C), q.isub(S));
7062
+ d.cmp(g) >= 0 ? (d.isub(g), B.isub(N), S.isub(q)) : (g.isub(d), N.isub(B), q.isub(S));
7063
7063
  }
7064
7064
  return {
7065
7065
  a: N,
@@ -7070,21 +7070,21 @@ Uf.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), S = new i(0), N = g.clone(); d.cmpn(1) > 0 && g.cmpn(1) > 0; ) {
7073
+ for (var B = new i(1), S = new i(0), N = g.clone(); d.cmpn(1) > 0 && g.cmpn(1) > 0; ) {
7074
7074
  for (var q = 0, D = 1; !(d.words[0] & D) && q < 26; ++q, D <<= 1)
7075
7075
  ;
7076
7076
  if (q > 0)
7077
7077
  for (d.iushrn(q); q-- > 0; )
7078
- C.isOdd() && C.iadd(N), C.iushrn(1);
7078
+ B.isOdd() && B.iadd(N), B.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
7083
  S.isOdd() && S.iadd(N), S.iushrn(1);
7084
- d.cmp(g) >= 0 ? (d.isub(g), C.isub(S)) : (g.isub(d), S.isub(C));
7084
+ d.cmp(g) >= 0 ? (d.isub(g), B.isub(S)) : (g.isub(d), S.isub(B));
7085
7085
  }
7086
7086
  var j;
7087
- return d.cmpn(1) === 0 ? j = C : j = S, j.cmpn(0) < 0 && j.iadd(n), j;
7087
+ return d.cmpn(1) === 0 ? j = B : j = S, j.cmpn(0) < 0 && j.iadd(n), j;
7088
7088
  }, i.prototype.gcd = function(n) {
7089
7089
  if (this.isZero())
7090
7090
  return n.abs();
@@ -7092,7 +7092,7 @@ Uf.exports;
7092
7092
  return this.abs();
7093
7093
  var d = this.clone(), g = n.clone();
7094
7094
  d.negative = 0, g.negative = 0;
7095
- for (var C = 0; d.isEven() && g.isEven(); C++)
7095
+ for (var B = 0; d.isEven() && g.isEven(); B++)
7096
7096
  d.iushrn(1), g.iushrn(1);
7097
7097
  do {
7098
7098
  for (; d.isEven(); )
@@ -7107,7 +7107,7 @@ Uf.exports;
7107
7107
  break;
7108
7108
  d.isub(g);
7109
7109
  } while (!0);
7110
- return g.iushln(C);
7110
+ return g.iushln(B);
7111
7111
  }, i.prototype.invm = function(n) {
7112
7112
  return this.egcd(n).a.umod(n);
7113
7113
  }, i.prototype.isEven = function() {
@@ -7118,10 +7118,10 @@ Uf.exports;
7118
7118
  return this.words[0] & n;
7119
7119
  }, i.prototype.bincn = function(n) {
7120
7120
  r(typeof n == "number");
7121
- var d = n % 26, g = (n - d) / 26, C = 1 << d;
7121
+ var d = n % 26, g = (n - d) / 26, B = 1 << d;
7122
7122
  if (this.length <= g)
7123
- return this._expand(g + 1), this.words[g] |= C, this;
7124
- for (var S = C, N = g; S !== 0 && N < this.length; N++) {
7123
+ return this._expand(g + 1), this.words[g] |= B, this;
7124
+ for (var S = B, N = g; S !== 0 && N < this.length; N++) {
7125
7125
  var q = this.words[N] | 0;
7126
7126
  q += S, S = q >>> 26, q &= 67108863, this.words[N] = q;
7127
7127
  }
@@ -7140,8 +7140,8 @@ Uf.exports;
7140
7140
  g = 1;
7141
7141
  else {
7142
7142
  d && (n = -n), r(n <= 67108863, "Number is too big");
7143
- var C = this.words[0] | 0;
7144
- g = C === n ? 0 : C < n ? -1 : 1;
7143
+ var B = this.words[0] | 0;
7144
+ g = B === n ? 0 : B < n ? -1 : 1;
7145
7145
  }
7146
7146
  return this.negative !== 0 ? -g | 0 : g;
7147
7147
  }, i.prototype.cmp = function(n) {
@@ -7157,9 +7157,9 @@ Uf.exports;
7157
7157
  if (this.length < n.length)
7158
7158
  return -1;
7159
7159
  for (var d = 0, g = this.length - 1; g >= 0; g--) {
7160
- var C = this.words[g] | 0, S = n.words[g] | 0;
7161
- if (C !== S) {
7162
- C < S ? d = -1 : C > S && (d = 1);
7160
+ var B = this.words[g] | 0, S = n.words[g] | 0;
7161
+ if (B !== S) {
7162
+ B < S ? d = -1 : B > S && (d = 1);
7163
7163
  break;
7164
7164
  }
7165
7165
  }
@@ -7238,8 +7238,8 @@ Uf.exports;
7238
7238
  do
7239
7239
  this.split(d, this.tmp), d = this.imulK(d), d = d.iadd(this.tmp), g = d.bitLength();
7240
7240
  while (g > this.n);
7241
- var C = g < this.n ? -1 : d.ucmp(this.p);
7242
- 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;
7241
+ var B = g < this.n ? -1 : d.ucmp(this.p);
7242
+ 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;
7243
7243
  }, T.prototype.split = function(n, d) {
7244
7244
  n.iushrn(this.n, 0, d);
7245
7245
  }, T.prototype.imulK = function(n) {
@@ -7253,9 +7253,9 @@ Uf.exports;
7253
7253
  );
7254
7254
  }
7255
7255
  a(H, T), H.prototype.split = function(n, d) {
7256
- for (var g = 4194303, C = Math.min(n.length, 9), S = 0; S < C; S++)
7256
+ for (var g = 4194303, B = Math.min(n.length, 9), S = 0; S < B; S++)
7257
7257
  d.words[S] = n.words[S];
7258
- if (d.length = C, n.length <= 9) {
7258
+ if (d.length = B, n.length <= 9) {
7259
7259
  n.words[0] = 0, n.length = 1;
7260
7260
  return;
7261
7261
  }
@@ -7268,8 +7268,8 @@ Uf.exports;
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++) {
7271
- var C = n.words[g] | 0;
7272
- d += C * 977, n.words[g] = d & 67108863, d = C * 64 + (d / 67108864 | 0);
7271
+ var B = n.words[g] | 0;
7272
+ d += B * 977, n.words[g] = d & 67108863, d = B * 64 + (d / 67108864 | 0);
7273
7273
  }
7274
7274
  return n.words[n.length - 1] === 0 && (n.length--, n.words[n.length - 1] === 0 && n.length--), n;
7275
7275
  };
@@ -7298,8 +7298,8 @@ Uf.exports;
7298
7298
  }
7299
7299
  a(X, T), X.prototype.imulK = function(n) {
7300
7300
  for (var d = 0, g = 0; g < n.length; g++) {
7301
- var C = (n.words[g] | 0) * 19 + d, S = C & 67108863;
7302
- C >>>= 26, n.words[g] = S, d = C;
7301
+ var B = (n.words[g] | 0) * 19 + d, S = B & 67108863;
7302
+ B >>>= 26, n.words[g] = S, d = B;
7303
7303
  }
7304
7304
  return d !== 0 && (n.words[n.length++] = d), n;
7305
7305
  }, i._prime = function(n) {
@@ -7370,13 +7370,13 @@ Uf.exports;
7370
7370
  var g = this.m.add(new i(1)).iushrn(2);
7371
7371
  return this.pow(n, g);
7372
7372
  }
7373
- for (var C = this.m.subn(1), S = 0; !C.isZero() && C.andln(1) === 0; )
7374
- S++, C.iushrn(1);
7375
- r(!C.isZero());
7373
+ for (var B = this.m.subn(1), S = 0; !B.isZero() && B.andln(1) === 0; )
7374
+ S++, B.iushrn(1);
7375
+ r(!B.isZero());
7376
7376
  var N = new i(1).toRed(this), q = N.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(q) !== 0; )
7378
7378
  h.redIAdd(q);
7379
- for (var E = this.pow(h, C), j = this.pow(n, C.addn(1).iushrn(1)), K = this.pow(n, C), W = S; K.cmp(N) !== 0; ) {
7379
+ for (var E = this.pow(h, B), j = this.pow(n, B.addn(1).iushrn(1)), K = this.pow(n, B), W = S; K.cmp(N) !== 0; ) {
7380
7380
  for (var re = K, ce = 0; re.cmp(N) !== 0; ce++)
7381
7381
  re = re.redSqr();
7382
7382
  r(ce < W);
@@ -7392,19 +7392,19 @@ Uf.exports;
7392
7392
  return new i(1).toRed(this);
7393
7393
  if (d.cmpn(1) === 0)
7394
7394
  return n.clone();
7395
- var g = 4, C = new Array(1 << g);
7396
- C[0] = new i(1).toRed(this), C[1] = n;
7397
- for (var S = 2; S < C.length; S++)
7398
- C[S] = this.mul(C[S - 1], n);
7399
- var N = C[0], q = 0, D = 0, h = d.bitLength() % 26;
7395
+ var g = 4, B = new Array(1 << g);
7396
+ B[0] = new i(1).toRed(this), B[1] = n;
7397
+ for (var S = 2; S < B.length; S++)
7398
+ B[S] = this.mul(B[S - 1], n);
7399
+ var N = B[0], q = 0, D = 0, h = d.bitLength() % 26;
7400
7400
  for (h === 0 && (h = 26), S = d.length - 1; S >= 0; S--) {
7401
7401
  for (var E = d.words[S], j = h - 1; j >= 0; j--) {
7402
7402
  var K = E >> j & 1;
7403
- if (N !== C[0] && (N = this.sqr(N)), K === 0 && q === 0) {
7403
+ if (N !== B[0] && (N = this.sqr(N)), K === 0 && q === 0) {
7404
7404
  D = 0;
7405
7405
  continue;
7406
7406
  }
7407
- q <<= 1, q |= K, D++, !(D !== g && (S !== 0 || j !== 0)) && (N = this.mul(N, C[q]), D = 0, q = 0);
7407
+ q <<= 1, q |= K, D++, !(D !== g && (S !== 0 || j !== 0)) && (N = this.mul(N, B[q]), D = 0, q = 0);
7408
7408
  }
7409
7409
  h = 26;
7410
7410
  }
@@ -7429,12 +7429,12 @@ Uf.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), S = g.isub(C).iushrn(this.shift), N = S;
7432
+ var g = n.imul(d), B = g.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), S = g.isub(B).iushrn(this.shift), N = S;
7433
7433
  return S.cmp(this.m) >= 0 ? N = S.isub(this.m) : S.cmpn(0) < 0 && (N = S.iadd(this.m)), N._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), S = g.isub(C).iushrn(this.shift), N = S;
7437
+ var g = n.mul(d), B = g.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), S = g.isub(B).iushrn(this.shift), N = S;
7438
7438
  return S.cmp(this.m) >= 0 ? N = S.isub(this.m) : S.cmpn(0) < 0 && (N = S.iadd(this.m)), N._forceRed(this);
7439
7439
  }, U.prototype.invm = function(n) {
7440
7440
  var d = this.imod(n._invmp(this.m).mul(this.r2));
@@ -7471,8 +7471,8 @@ var $f = {};
7471
7471
  x.push(parseInt(i[u] + i[u + 1], 16));
7472
7472
  } else
7473
7473
  for (var u = 0; u < i.length; u++) {
7474
- var o = i.charCodeAt(u), c = o >> 8, v = o & 255;
7475
- c ? x.push(c, v) : x.push(v);
7474
+ var o = i.charCodeAt(u), c = o >> 8, b = o & 255;
7475
+ c ? x.push(c, b) : x.push(b);
7476
7476
  }
7477
7477
  return x;
7478
7478
  }
@@ -7493,39 +7493,39 @@ var $f = {};
7493
7493
  (function(f) {
7494
7494
  var e = f, t = pt, r = It, a = $f;
7495
7495
  e.assert = r, e.toArray = a.toArray, e.zero2 = a.zero2, e.toHex = a.toHex, e.encode = a.encode;
7496
- function i(c, v, b) {
7497
- var B = new Array(Math.max(c.bitLength(), b) + 1), w;
7498
- for (w = 0; w < B.length; w += 1)
7499
- B[w] = 0;
7500
- var R = 1 << v + 1, k = c.clone();
7501
- for (w = 0; w < B.length; w++) {
7496
+ function i(c, b, v) {
7497
+ var C = new Array(Math.max(c.bitLength(), v) + 1), w;
7498
+ for (w = 0; w < C.length; w += 1)
7499
+ C[w] = 0;
7500
+ var R = 1 << b + 1, k = c.clone();
7501
+ for (w = 0; w < C.length; w++) {
7502
7502
  var z, F = k.andln(R - 1);
7503
- k.isOdd() ? (F > (R >> 1) - 1 ? z = (R >> 1) - F : z = F, k.isubn(z)) : z = 0, B[w] = z, k.iushrn(1);
7503
+ k.isOdd() ? (F > (R >> 1) - 1 ? z = (R >> 1) - F : z = F, k.isubn(z)) : z = 0, C[w] = z, k.iushrn(1);
7504
7504
  }
7505
- return B;
7505
+ return C;
7506
7506
  }
7507
7507
  e.getNAF = i;
7508
- function y(c, v) {
7509
- var b = [
7508
+ function y(c, b) {
7509
+ var v = [
7510
7510
  [],
7511
7511
  []
7512
7512
  ];
7513
- c = c.clone(), v = v.clone();
7514
- for (var B = 0, w = 0, R; c.cmpn(-B) > 0 || v.cmpn(-w) > 0; ) {
7515
- var k = c.andln(3) + B & 3, z = v.andln(3) + w & 3;
7513
+ c = c.clone(), b = b.clone();
7514
+ for (var C = 0, w = 0, R; c.cmpn(-C) > 0 || b.cmpn(-w) > 0; ) {
7515
+ var k = c.andln(3) + C & 3, z = b.andln(3) + w & 3;
7516
7516
  k === 3 && (k = -1), z === 3 && (z = -1);
7517
7517
  var F;
7518
- k & 1 ? (R = c.andln(7) + B & 7, (R === 3 || R === 5) && z === 2 ? F = -k : F = k) : F = 0, b[0].push(F);
7518
+ k & 1 ? (R = c.andln(7) + C & 7, (R === 3 || R === 5) && z === 2 ? F = -k : F = k) : F = 0, v[0].push(F);
7519
7519
  var P;
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 === F + 1 && (B = 1 - B), 2 * w === P + 1 && (w = 1 - w), c.iushrn(1), v.iushrn(1);
7520
+ z & 1 ? (R = b.andln(7) + w & 7, (R === 3 || R === 5) && k === 2 ? P = -z : P = z) : P = 0, v[1].push(P), 2 * C === F + 1 && (C = 1 - C), 2 * w === P + 1 && (w = 1 - w), c.iushrn(1), b.iushrn(1);
7521
7521
  }
7522
- return b;
7522
+ return v;
7523
7523
  }
7524
7524
  e.getJSF = y;
7525
- function x(c, v, b) {
7526
- var B = "_" + v;
7527
- c.prototype[v] = function() {
7528
- return this[B] !== void 0 ? this[B] : this[B] = b.call(this);
7525
+ function x(c, b, v) {
7526
+ var C = "_" + b;
7527
+ c.prototype[b] = function() {
7528
+ return this[C] !== void 0 ? this[C] : this[C] = v.call(this);
7529
7529
  };
7530
7530
  }
7531
7531
  e.cachedProperty = x;
@@ -7600,10 +7600,10 @@ Et.prototype._fixedNafMul = function(e, t) {
7600
7600
  u = (u << 1) + a[o];
7601
7601
  y.push(u);
7602
7602
  }
7603
- for (var c = this.jpoint(null, null, null), v = this.jpoint(null, null, null), b = i; b > 0; b--) {
7603
+ for (var c = this.jpoint(null, null, null), b = this.jpoint(null, null, null), v = i; v > 0; v--) {
7604
7604
  for (x = 0; x < y.length; x++)
7605
- u = y[x], u === b ? v = v.mixedAdd(r.points[x]) : u === -b && (v = v.mixedAdd(r.points[x].neg()));
7606
- c = c.add(v);
7605
+ u = y[x], u === v ? b = b.mixedAdd(r.points[x]) : u === -v && (b = b.mixedAdd(r.points[x].neg()));
7606
+ c = c.add(b);
7607
7607
  }
7608
7608
  return c.toP();
7609
7609
  };
@@ -7621,11 +7621,11 @@ Et.prototype._wnafMul = function(e, t) {
7621
7621
  return e.type === "affine" ? x.toP() : x;
7622
7622
  };
7623
7623
  Et.prototype._wnafMulAdd = function(e, t, r, a, i) {
7624
- var y = this._wnafT1, x = this._wnafT2, u = this._wnafT3, o = 0, c, v, b;
7624
+ var y = this._wnafT1, x = this._wnafT2, u = this._wnafT3, o = 0, c, b, v;
7625
7625
  for (c = 0; c < a; c++) {
7626
- b = t[c];
7627
- var B = b._getNAFPoints(e);
7628
- y[c] = B.wnd, x[c] = B.points;
7626
+ v = t[c];
7627
+ var C = v._getNAFPoints(e);
7628
+ y[c] = C.wnd, x[c] = C.points;
7629
7629
  }
7630
7630
  for (c = a - 1; c >= 1; c -= 2) {
7631
7631
  var w = c - 1, R = c;
@@ -7664,26 +7664,26 @@ Et.prototype._wnafMulAdd = function(e, t, r, a, i) {
7664
7664
  3
7665
7665
  /* 1 1 */
7666
7666
  ], F = ps(r[w], r[R]);
7667
- for (o = Math.max(F[0].length, o), u[w] = new Array(o), u[R] = new Array(o), v = 0; v < o; v++) {
7668
- var P = F[0][v] | 0, T = F[1][v] | 0;
7669
- u[w][v] = z[(P + 1) * 3 + (T + 1)], u[R][v] = 0, x[w] = k;
7667
+ for (o = Math.max(F[0].length, o), u[w] = new Array(o), u[R] = new Array(o), b = 0; b < o; b++) {
7668
+ var P = F[0][b] | 0, T = F[1][b] | 0;
7669
+ u[w][b] = z[(P + 1) * 3 + (T + 1)], u[R][b] = 0, x[w] = k;
7670
7670
  }
7671
7671
  }
7672
7672
  var H = this.jpoint(null, null, null), $ = this._wnafT4;
7673
7673
  for (c = o; c >= 0; c--) {
7674
7674
  for (var Y = 0; c >= 0; ) {
7675
7675
  var X = !0;
7676
- for (v = 0; v < a; v++)
7677
- $[v] = u[v][c] | 0, $[v] !== 0 && (X = !1);
7676
+ for (b = 0; b < a; b++)
7677
+ $[b] = u[b][c] | 0, $[b] !== 0 && (X = !1);
7678
7678
  if (!X)
7679
7679
  break;
7680
7680
  Y++, c--;
7681
7681
  }
7682
7682
  if (c >= 0 && Y++, H = H.dblp(Y), c < 0)
7683
7683
  break;
7684
- for (v = 0; v < a; v++) {
7685
- var Q = $[v];
7686
- Q !== 0 && (Q > 0 ? b = x[v][Q - 1 >> 1] : Q < 0 && (b = x[v][-Q - 1 >> 1].neg()), b.type === "affine" ? H = H.mixedAdd(b) : H = H.add(b));
7684
+ for (b = 0; b < a; b++) {
7685
+ var Q = $[b];
7686
+ Q !== 0 && (Q > 0 ? v = x[b][Q - 1 >> 1] : Q < 0 && (v = x[b][-Q - 1 >> 1].neg()), v.type === "affine" ? H = H.mixedAdd(v) : H = H.add(v));
7687
7687
  }
7688
7688
  }
7689
7689
  for (c = 0; c < a; c++)
@@ -7828,26 +7828,26 @@ Z0.prototype._getEndoRoots = function(e) {
7828
7828
  return [y, x];
7829
7829
  };
7830
7830
  Z0.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, z, F; 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, b, v, C, w, R, k = 0, z, F; r.cmpn(0) !== 0; ) {
7832
7832
  var P = a.div(r);
7833
7833
  z = a.sub(P.mul(r)), F = x.sub(P.mul(i));
7834
7834
  var T = u.sub(P.mul(y));
7835
- if (!v && z.cmp(t) < 0)
7836
- o = R.neg(), c = i, v = z.neg(), b = F;
7837
- else if (v && ++k === 2)
7835
+ if (!b && z.cmp(t) < 0)
7836
+ o = R.neg(), c = i, b = z.neg(), v = F;
7837
+ else if (b && ++k === 2)
7838
7838
  break;
7839
7839
  R = z, a = r, r = z, x = i, i = F, u = y, y = T;
7840
7840
  }
7841
- B = z.neg(), w = F;
7842
- var H = v.sqr().add(b.sqr()), $ = B.sqr().add(w.sqr());
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
- { a: v, b },
7845
- { a: B, b: w }
7841
+ C = z.neg(), w = F;
7842
+ var H = b.sqr().add(v.sqr()), $ = C.sqr().add(w.sqr());
7843
+ return $.cmp(H) >= 0 && (C = o, w = c), b.negative && (b = b.neg(), v = v.neg()), C.negative && (C = C.neg(), w = w.neg()), [
7844
+ { a: b, b: v },
7845
+ { a: C, b: w }
7846
7846
  ];
7847
7847
  };
7848
7848
  Z0.prototype._endoSplit = function(e) {
7849
- var t = this.endo.basis, r = t[0], a = t[1], i = a.b.mul(e).divRound(this.n), y = r.b.neg().mul(e).divRound(this.n), x = i.mul(r.a), u = y.mul(a.a), o = i.mul(r.b), c = y.mul(a.b), v = e.sub(x).sub(u), b = o.add(c).neg();
7850
- return { k1: v, k2: b };
7849
+ var t = this.endo.basis, r = t[0], a = t[1], i = a.b.mul(e).divRound(this.n), y = r.b.neg().mul(e).divRound(this.n), x = i.mul(r.a), u = y.mul(a.a), o = i.mul(r.b), c = y.mul(a.b), b = e.sub(x).sub(u), v = o.add(c).neg();
7850
+ return { k1: b, k2: v };
7851
7851
  };
7852
7852
  Z0.prototype.pointFromX = function(e, t) {
7853
7853
  e = new g0(e, 16), e.red || (e = e.toRed(this.red));
@@ -7868,8 +7868,8 @@ Z0.prototype._endoWnafMulAdd = function(e, t, r) {
7868
7868
  var x = this._endoSplit(t[y]), u = e[y], o = u._getBeta();
7869
7869
  x.k1.negative && (x.k1.ineg(), u = u.neg(!0)), x.k2.negative && (x.k2.ineg(), o = o.neg(!0)), a[y * 2] = u, a[y * 2 + 1] = o, i[y * 2] = x.k1, i[y * 2 + 1] = x.k2;
7870
7870
  }
7871
- for (var c = this._wnafMulAdd(1, a, i, y * 2, r), v = 0; v < y * 2; v++)
7872
- a[v] = null, i[v] = null;
7871
+ for (var c = this._wnafMulAdd(1, a, i, y * 2, r), b = 0; b < y * 2; b++)
7872
+ a[b] = null, i[b] = null;
7873
7873
  return c;
7874
7874
  };
7875
7875
  function M0(f, e, t, r) {
@@ -8042,8 +8042,8 @@ R0.prototype.add = function(e) {
8042
8042
  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);
8043
8043
  if (u.cmpn(0) === 0)
8044
8044
  return o.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
8045
- 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);
8046
- return this.curve.jpoint(B, w, R);
8045
+ var c = u.redSqr(), b = c.redMul(u), v = a.redMul(c), C = o.redSqr().redIAdd(b).redISub(v).redISub(v), w = o.redMul(v.redISub(C)).redISub(y.redMul(b)), R = this.z.redMul(e.z).redMul(u);
8046
+ return this.curve.jpoint(C, w, R);
8047
8047
  };
8048
8048
  R0.prototype.mixedAdd = function(e) {
8049
8049
  if (this.isInfinity())
@@ -8053,8 +8053,8 @@ R0.prototype.mixedAdd = function(e) {
8053
8053
  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);
8054
8054
  if (x.cmpn(0) === 0)
8055
8055
  return u.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
8056
- 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);
8057
- return this.curve.jpoint(b, B, w);
8056
+ var o = x.redSqr(), c = o.redMul(x), b = r.redMul(o), v = u.redSqr().redIAdd(c).redISub(b).redISub(b), C = u.redMul(b.redISub(v)).redISub(i.redMul(c)), w = this.z.redMul(x);
8057
+ return this.curve.jpoint(v, C, w);
8058
8058
  };
8059
8059
  R0.prototype.dblp = function(e) {
8060
8060
  if (e === 0)
@@ -8072,10 +8072,10 @@ 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)), z = R.redISub(k), F = w.redMul(z);
8076
- F = F.redIAdd(F).redISub(B);
8075
+ var b = y.redSqr(), v = c.redSqr(), C = v.redSqr(), w = b.redAdd(b).redIAdd(b).redIAdd(a.redMul(o)), R = y.redMul(v), k = w.redSqr().redISub(R.redAdd(R)), z = R.redISub(k), F = w.redMul(z);
8076
+ F = F.redIAdd(F).redISub(C);
8077
8077
  var P = c.redMul(u);
8078
- t + 1 < e && (o = o.redMul(B)), y = k, u = P, c = F;
8078
+ t + 1 < e && (o = o.redMul(C)), y = k, u = P, c = F;
8079
8079
  }
8080
8080
  return this.curve.jpoint(y, c.redMul(i), u);
8081
8081
  };
@@ -8090,9 +8090,9 @@ R0.prototype._zeroDbl = function() {
8090
8090
  var u = a.redAdd(a).redIAdd(a), o = u.redSqr().redISub(x).redISub(x), c = y.redIAdd(y);
8091
8091
  c = c.redIAdd(c), c = c.redIAdd(c), e = o, t = u.redMul(x.redISub(o)).redISub(c), r = this.y.redAdd(this.y);
8092
8092
  } else {
8093
- var v = this.x.redSqr(), b = this.y.redSqr(), B = b.redSqr(), w = this.x.redAdd(b).redSqr().redISub(v).redISub(B);
8093
+ var b = this.x.redSqr(), v = this.y.redSqr(), C = v.redSqr(), w = this.x.redAdd(v).redSqr().redISub(b).redISub(C);
8094
8094
  w = w.redIAdd(w);
8095
- var R = v.redAdd(v).redIAdd(v), k = R.redSqr(), z = B.redIAdd(B);
8095
+ var R = b.redAdd(b).redIAdd(b), k = R.redSqr(), z = C.redIAdd(C);
8096
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);
@@ -8107,13 +8107,13 @@ R0.prototype._threeDbl = function() {
8107
8107
  var c = y.redIAdd(y);
8108
8108
  c = c.redIAdd(c), c = c.redIAdd(c), t = u.redMul(x.redISub(o)).redISub(c), r = this.y.redAdd(this.y);
8109
8109
  } else {
8110
- var v = this.z.redSqr(), b = this.y.redSqr(), B = this.x.redMul(b), w = this.x.redSub(v).redMul(this.x.redAdd(v));
8110
+ var b = this.z.redSqr(), v = this.y.redSqr(), C = this.x.redMul(v), w = this.x.redSub(b).redMul(this.x.redAdd(b));
8111
8111
  w = w.redAdd(w).redIAdd(w);
8112
- var R = B.redIAdd(B);
8112
+ var R = C.redIAdd(C);
8113
8113
  R = R.redIAdd(R);
8114
8114
  var k = R.redAdd(R);
8115
- e = w.redSqr().redISub(k), r = this.y.redAdd(this.z).redSqr().redISub(b).redISub(v);
8116
- var z = b.redSqr();
8115
+ e = w.redSqr().redISub(k), r = this.y.redAdd(this.z).redSqr().redISub(v).redISub(b);
8116
+ var z = v.redSqr();
8117
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);
@@ -8121,10 +8121,10 @@ R0.prototype._threeDbl = function() {
8121
8121
  R0.prototype._dbl = function() {
8122
8122
  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);
8123
8123
  o = o.redIAdd(o);
8124
- var c = o.redMul(x), v = u.redSqr().redISub(c.redAdd(c)), b = c.redISub(v), B = x.redSqr();
8125
- B = B.redIAdd(B), B = B.redIAdd(B), B = B.redIAdd(B);
8126
- var w = u.redMul(b).redISub(B), R = r.redAdd(r).redMul(a);
8127
- return this.curve.jpoint(v, w, R);
8124
+ var c = o.redMul(x), b = u.redSqr().redISub(c.redAdd(c)), v = c.redISub(b), C = x.redSqr();
8125
+ C = C.redIAdd(C), C = C.redIAdd(C), C = C.redIAdd(C);
8126
+ var w = u.redMul(v).redISub(C), R = r.redAdd(r).redMul(a);
8127
+ return this.curve.jpoint(b, w, R);
8128
8128
  };
8129
8129
  R0.prototype.trpl = function() {
8130
8130
  if (!this.curve.zeroA)
@@ -8133,14 +8133,14 @@ R0.prototype.trpl = function() {
8133
8133
  x = x.redIAdd(x), x = x.redAdd(x).redIAdd(x), x = x.redISub(y);
8134
8134
  var u = x.redSqr(), o = a.redIAdd(a);
8135
8135
  o = o.redIAdd(o), o = o.redIAdd(o), o = o.redIAdd(o);
8136
- var c = i.redIAdd(x).redSqr().redISub(y).redISub(u).redISub(o), v = t.redMul(c);
8137
- v = v.redIAdd(v), v = v.redIAdd(v);
8138
- var b = this.x.redMul(u).redISub(v);
8136
+ var c = i.redIAdd(x).redSqr().redISub(y).redISub(u).redISub(o), b = t.redMul(c);
8139
8137
  b = b.redIAdd(b), b = b.redIAdd(b);
8140
- var B = this.y.redMul(c.redMul(o.redISub(c)).redISub(x.redMul(u)));
8141
- B = B.redIAdd(B), B = B.redIAdd(B), B = B.redIAdd(B);
8138
+ var v = this.x.redMul(u).redISub(b);
8139
+ v = v.redIAdd(v), v = v.redIAdd(v);
8140
+ var C = this.y.redMul(c.redMul(o.redISub(c)).redISub(x.redMul(u)));
8141
+ C = C.redIAdd(C), C = C.redIAdd(C), C = C.redIAdd(C);
8142
8142
  var w = this.z.redAdd(x).redSqr().redISub(r).redISub(u);
8143
- return this.curve.jpoint(b, B, w);
8143
+ return this.curve.jpoint(v, C, w);
8144
8144
  };
8145
8145
  R0.prototype.mul = function(e, t) {
8146
8146
  return e = new g0(e, t), this.curve._wnafMul(this, e);
@@ -8308,8 +8308,8 @@ v0.prototype.isInfinity = function() {
8308
8308
  v0.prototype._extDbl = function() {
8309
8309
  var e = this.x.redSqr(), t = this.y.redSqr(), r = this.z.redSqr();
8310
8310
  r = r.redIAdd(r);
8311
- var a = this.curve._mulA(e), i = this.x.redAdd(this.y).redSqr().redISub(e).redISub(t), y = a.redAdd(t), x = y.redSub(r), u = a.redSub(t), o = i.redMul(x), c = y.redMul(u), v = i.redMul(u), b = x.redMul(y);
8312
- return this.curve.point(o, c, b, v);
8311
+ var a = this.curve._mulA(e), i = this.x.redAdd(this.y).redSqr().redISub(e).redISub(t), y = a.redAdd(t), x = y.redSub(r), u = a.redSub(t), o = i.redMul(x), c = y.redMul(u), b = i.redMul(u), v = x.redMul(y);
8312
+ return this.curve.point(o, c, v, b);
8313
8313
  };
8314
8314
  v0.prototype._projDbl = function() {
8315
8315
  var e = this.x.redAdd(this.y).redSqr(), t = this.x.redSqr(), r = this.y.redSqr(), a, i, y, x, u, o;
@@ -8325,12 +8325,12 @@ v0.prototype.dbl = function() {
8325
8325
  return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();
8326
8326
  };
8327
8327
  v0.prototype._extAdd = function(e) {
8328
- 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);
8329
- return this.curve.point(c, v, B, b);
8328
+ 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), b = u.redMul(o), v = y.redMul(o), C = x.redMul(u);
8329
+ return this.curve.point(c, b, C, v);
8330
8330
  };
8331
8331
  v0.prototype._projAdd = function(e) {
8332
- 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;
8333
- return this.curve.twisted ? (v = t.redMul(u).redMul(i.redSub(this.curve._mulA(a))), b = x.redMul(u)) : (v = t.redMul(u).redMul(i.redSub(a)), b = this.curve._mulC(x).redMul(u)), this.curve.point(c, v, b);
8332
+ 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), b, v;
8333
+ return this.curve.twisted ? (b = t.redMul(u).redMul(i.redSub(this.curve._mulA(a))), v = x.redMul(u)) : (b = t.redMul(u).redMul(i.redSub(a)), v = this.curve._mulC(x).redMul(u)), this.curve.point(c, b, v);
8334
8334
  };
8335
8335
  v0.prototype.add = function(e) {
8336
8336
  return this.isInfinity() ? e : e.isInfinity() ? this : this.curve.extended ? this._extAdd(e) : this._projAdd(e);
@@ -8508,10 +8508,10 @@ function Ws(f, e, t, r, a, i, y, x) {
8508
8508
  }
8509
8509
  Le.sum64_4_lo = Ws;
8510
8510
  function Ks(f, e, t, r, a, i, y, x, u, o) {
8511
- var c = 0, v = e;
8512
- v = v + r >>> 0, c += v < e ? 1 : 0, v = v + i >>> 0, c += v < i ? 1 : 0, v = v + x >>> 0, c += v < x ? 1 : 0, v = v + o >>> 0, c += v < o ? 1 : 0;
8513
- var b = f + t + a + y + u + c;
8514
- return b >>> 0;
8511
+ var c = 0, b = e;
8512
+ b = b + r >>> 0, c += b < e ? 1 : 0, b = b + i >>> 0, c += b < i ? 1 : 0, b = b + x >>> 0, c += b < x ? 1 : 0, b = b + o >>> 0, c += b < o ? 1 : 0;
8513
+ var v = f + t + a + y + u + c;
8514
+ return v >>> 0;
8515
8515
  }
8516
8516
  Le.sum64_5_hi = Ks;
8517
8517
  function Ys(f, e, t, r, a, i, y, x, u, o) {
@@ -8638,8 +8638,8 @@ st.prototype._update = function(e, t) {
8638
8638
  r[a] = gf(r[a - 3] ^ r[a - 8] ^ r[a - 14] ^ r[a - 16], 1);
8639
8639
  var i = this.h[0], y = this.h[1], x = this.h[2], u = this.h[3], o = this.h[4];
8640
8640
  for (a = 0; a < r.length; a++) {
8641
- var c = ~~(a / 20), v = ao(gf(i, 5), so(c, y, x, u), o, r[a], oo[c]);
8642
- o = u, u = x, x = gf(y, 30), y = i, i = v;
8641
+ var c = ~~(a / 20), b = ao(gf(i, 5), so(c, y, x, u), o, r[a], oo[c]);
8642
+ o = u, u = x, x = gf(y, 30), y = i, i = b;
8643
8643
  }
8644
8644
  this.h[0] = Gt(this.h[0], i), this.h[1] = Gt(this.h[1], y), this.h[2] = Gt(this.h[2], x), this.h[3] = Gt(this.h[3], u), this.h[4] = Gt(this.h[4], o);
8645
8645
  };
@@ -8737,12 +8737,12 @@ ot.prototype._update = function(e, t) {
8737
8737
  r[a] = e[t + a];
8738
8738
  for (; a < r.length; a++)
8739
8739
  r[a] = lo(mo(r[a - 2]), r[a - 7], go(r[a - 15]), r[a - 16]);
8740
- 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];
8740
+ 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], b = this.h[6], v = this.h[7];
8741
8741
  for (uo(this.k.length === r.length), a = 0; a < r.length; a++) {
8742
- var B = xo(b, yo(o), vo(o, c, v), this.k[a], r[a]), w = J0(po(i), bo(i, y, x));
8743
- b = v, v = c, c = o, o = J0(u, B), u = x, x = y, y = i, i = J0(B, w);
8742
+ var C = xo(v, yo(o), vo(o, c, b), this.k[a], r[a]), w = J0(po(i), bo(i, y, x));
8743
+ v = b, b = c, c = o, o = J0(u, C), u = x, x = y, y = i, i = J0(C, w);
8744
8744
  }
8745
- this.h[0] = J0(this.h[0], i), this.h[1] = J0(this.h[1], y), this.h[2] = J0(this.h[2], x), this.h[3] = J0(this.h[3], u), this.h[4] = J0(this.h[4], o), this.h[5] = J0(this.h[5], c), this.h[6] = J0(this.h[6], v), this.h[7] = J0(this.h[7], b);
8745
+ this.h[0] = J0(this.h[0], i), this.h[1] = J0(this.h[1], y), this.h[2] = J0(this.h[2], x), this.h[3] = J0(this.h[3], u), this.h[4] = J0(this.h[4], o), this.h[5] = J0(this.h[5], c), this.h[6] = J0(this.h[6], b), this.h[7] = J0(this.h[7], v);
8746
8746
  };
8747
8747
  ot.prototype._digest = function(e) {
8748
8748
  return e === "hex" ? qt.toHex32(this.h, "big") : qt.split32(this.h, "big");
@@ -8965,7 +8965,7 @@ tt.prototype._prepareBlock = function(e, t) {
8965
8965
  for (var r = this.W, a = 0; a < 32; a++)
8966
8966
  r[a] = e[t + a];
8967
8967
  for (; a < r.length; a += 2) {
8968
- var i = Lo(r[a - 4], r[a - 3]), y = Ho(r[a - 4], r[a - 3]), x = r[a - 14], u = r[a - 13], o = No(r[a - 30], r[a - 29]), c = qo(r[a - 30], r[a - 29]), v = r[a - 32], b = r[a - 31];
8968
+ var i = Lo(r[a - 4], r[a - 3]), y = Ho(r[a - 4], r[a - 3]), x = r[a - 14], u = r[a - 13], o = No(r[a - 30], r[a - 29]), c = qo(r[a - 30], r[a - 29]), b = r[a - 32], v = r[a - 31];
8969
8969
  r[a] = Bo(
8970
8970
  i,
8971
8971
  y,
@@ -8973,8 +8973,8 @@ tt.prototype._prepareBlock = function(e, t) {
8973
8973
  u,
8974
8974
  o,
8975
8975
  c,
8976
- v,
8977
- b
8976
+ b,
8977
+ v
8978
8978
  ), r[a + 1] = Co(
8979
8979
  i,
8980
8980
  y,
@@ -8982,17 +8982,17 @@ tt.prototype._prepareBlock = function(e, t) {
8982
8982
  u,
8983
8983
  o,
8984
8984
  c,
8985
- v,
8986
- b
8985
+ b,
8986
+ v
8987
8987
  );
8988
8988
  }
8989
8989
  };
8990
8990
  tt.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], z = this.h[13], F = 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], b = this.h[7], v = this.h[8], C = this.h[9], w = this.h[10], R = this.h[11], k = this.h[12], z = this.h[13], F = 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 = F, $ = P, Y = 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(
8995
+ var H = F, $ = P, Y = Oo(v, C), X = zo(v, C), Q = Do(v, C, w, R, k), U = Ro(v, C, w, R, k, z), A = this.k[T], n = this.k[T + 1], d = r[T], g = r[T + 1], B = Mo(
8996
8996
  H,
8997
8997
  $,
8998
8998
  Y,
@@ -9017,9 +9017,9 @@ tt.prototype._update = function(e, t) {
9017
9017
  );
9018
9018
  H = Io(a, i), $ = To(a, i), Y = ko(a, i, y, x, u), X = Po(a, i, y, x, u, o);
9019
9019
  var N = mf(H, $, Y, X), q = _f(H, $, Y, X);
9020
- F = k, P = z, k = w, z = R, w = b, R = B, b = mf(c, v, C, S), B = _f(v, v, C, S), c = u, v = o, u = y, o = x, y = a, x = i, a = mf(C, S, N, q), i = _f(C, S, N, q);
9020
+ F = k, P = z, k = w, z = R, w = v, R = C, v = mf(c, b, B, S), C = _f(b, b, B, S), c = u, b = o, u = y, o = x, y = a, x = i, a = mf(B, S, N, q), i = _f(B, S, N, q);
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, z), gt(this.h, 14, F, 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, b), gt(this.h, 8, v, C), gt(this.h, 10, w, R), gt(this.h, 12, k, z), gt(this.h, 14, F, P);
9023
9023
  };
9024
9024
  tt.prototype._digest = function(e) {
9025
9025
  return e === "hex" ? H0.toHex32(this.h, "big") : H0.split32(this.h, "big");
@@ -9122,23 +9122,23 @@ ct.outSize = 160;
9122
9122
  ct.hmacStrength = 192;
9123
9123
  ct.padLength = 64;
9124
9124
  ct.prototype._update = function(e, t) {
9125
- 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++) {
9125
+ 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, b = y, v = x, C = 0; C < 80; C++) {
9126
9126
  var w = Ki(
9127
9127
  sr(
9128
- Yi(r, ji(B, a, i, y), e[Yo[B] + t], Wo(B)),
9129
- Vo[B]
9128
+ Yi(r, ji(C, a, i, y), e[Yo[C] + t], Wo(C)),
9129
+ Vo[C]
9130
9130
  ),
9131
9131
  x
9132
9132
  );
9133
9133
  r = x, x = y, y = sr(i, 10), i = a, a = w, w = Ki(
9134
9134
  sr(
9135
- Yi(u, ji(79 - B, o, c, v), e[jo[B] + t], Ko(B)),
9136
- Xo[B]
9135
+ Yi(u, ji(79 - C, o, c, b), e[jo[C] + t], Ko(C)),
9136
+ Xo[C]
9137
9137
  ),
9138
- b
9139
- ), u = b, b = v, v = sr(c, 10), c = o, o = w;
9138
+ v
9139
+ ), u = v, v = b, b = sr(c, 10), c = o, o = w;
9140
9140
  }
9141
- w = Qt(this.h[1], i, v), this.h[1] = Qt(this.h[2], y, b), this.h[2] = Qt(this.h[3], x, u), this.h[3] = Qt(this.h[4], r, o), this.h[4] = Qt(this.h[0], a, c), this.h[0] = w;
9141
+ w = Qt(this.h[1], i, b), this.h[1] = Qt(this.h[2], y, v), this.h[2] = Qt(this.h[3], x, u), this.h[3] = Qt(this.h[4], r, o), this.h[4] = Qt(this.h[0], a, c), this.h[0] = w;
9142
9142
  };
9143
9143
  ct.prototype._digest = function(e) {
9144
9144
  return e === "hex" ? Rt.toHex32(this.h, "little") : Rt.split32(this.h, "little");
@@ -10297,12 +10297,12 @@ function Jo() {
10297
10297
  configurable: !0,
10298
10298
  enumerable: !0,
10299
10299
  get: function() {
10300
- var v = new y(c);
10300
+ var b = new y(c);
10301
10301
  return Object.defineProperty(e, o, {
10302
10302
  configurable: !0,
10303
10303
  enumerable: !0,
10304
- value: v
10305
- }), v;
10304
+ value: b
10305
+ }), b;
10306
10306
  }
10307
10307
  });
10308
10308
  }
@@ -10648,15 +10648,15 @@ V0.prototype.sign = function(e, t, r, a) {
10648
10648
  pers: a.pers,
10649
10649
  persEnc: a.persEnc || "utf8"
10650
10650
  }), o = this.n.sub(new St(1)), c = 0; ; c++) {
10651
- var v = a.k ? a.k(c) : new St(u.generate(this.n.byteLength()));
10652
- if (v = this._truncateToN(v, !0), !(v.cmpn(1) <= 0 || v.cmp(o) >= 0)) {
10653
- var b = this.g.mul(v);
10654
- if (!b.isInfinity()) {
10655
- var B = b.getX(), w = B.umod(this.n);
10651
+ var b = a.k ? a.k(c) : new St(u.generate(this.n.byteLength()));
10652
+ if (b = this._truncateToN(b, !0), !(b.cmpn(1) <= 0 || b.cmp(o) >= 0)) {
10653
+ var v = this.g.mul(b);
10654
+ if (!v.isInfinity()) {
10655
+ var C = v.getX(), w = C.umod(this.n);
10656
10656
  if (w.cmpn(0) !== 0) {
10657
- var R = v.invm(this.n).mul(w.mul(t.getPrivate()).iadd(e));
10657
+ var R = b.invm(this.n).mul(w.mul(t.getPrivate()).iadd(e));
10658
10658
  if (R = R.umod(this.n), R.cmpn(0) !== 0) {
10659
- var k = (b.getY().isOdd() ? 1 : 0) | (B.cmp(w) !== 0 ? 2 : 0);
10659
+ var k = (v.getY().isOdd() ? 1 : 0) | (C.cmp(w) !== 0 ? 2 : 0);
10660
10660
  return a.canonical && R.cmp(this.nh) > 0 && (R = this.n.sub(R), k ^= 1), new kr({ r: w, s: R, recoveryParam: k });
10661
10661
  }
10662
10662
  }
@@ -10678,8 +10678,8 @@ V0.prototype.recoverPubKey = function(f, e, t, r) {
10678
10678
  if (y.cmp(this.curve.p.umod(this.curve.n)) >= 0 && o)
10679
10679
  throw new Error("Unable to find sencond key candinate");
10680
10680
  o ? y = this.curve.pointFromX(y.add(this.curve.n), u) : y = this.curve.pointFromX(y, u);
10681
- var c = e.r.invm(a), v = a.sub(i).mul(c).umod(a), b = x.mul(c).umod(a);
10682
- return this.g.mulAdd(v, y, b);
10681
+ var c = e.r.invm(a), b = a.sub(i).mul(c).umod(a), v = x.mul(c).umod(a);
10682
+ return this.g.mulAdd(b, y, v);
10683
10683
  };
10684
10684
  V0.prototype.getKeyRecoveryParam = function(f, e, t, r) {
10685
10685
  if (e = new kr(e, r), e.recoveryParam !== null)
@@ -10831,7 +10831,7 @@ var Vn = { exports: {} };
10831
10831
  throw new Error("no PRNG");
10832
10832
  }, a = new Uint8Array(16), i = new Uint8Array(32);
10833
10833
  i[0] = 9;
10834
- 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]);
10834
+ 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]), b = t([54554, 36645, 11616, 51542, 42930, 38181, 51040, 26924, 56412, 64982, 57905, 49316, 21502, 52590, 14035, 8553]), v = 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]);
10835
10835
  function w(l, _, m, s) {
10836
10836
  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;
10837
10837
  }
@@ -10972,7 +10972,7 @@ var Vn = { exports: {} };
10972
10972
  l[p] = 0;
10973
10973
  return 0;
10974
10974
  }
10975
- function C(l, _, m, s, M) {
10975
+ function B(l, _, m, s, M) {
10976
10976
  var p, I = new Uint8Array(32);
10977
10977
  if (m < 32 || (Q(I, 0, 32, s, M), d(_, 16, _, 32, m - 32, I) !== 0))
10978
10978
  return -1;
@@ -11077,7 +11077,7 @@ var Vn = { exports: {} };
11077
11077
  var s = new Uint8Array(32);
11078
11078
  return Me(s, m, _), H(l, a, s, $);
11079
11079
  }
11080
- var Oe = g, _0 = C;
11080
+ var Oe = g, _0 = B;
11081
11081
  function Ge(l, _, m, s, M, p) {
11082
11082
  var I = new Uint8Array(32);
11083
11083
  return We(I, M, p), Oe(l, _, m, s, I);
@@ -11288,7 +11288,7 @@ var Vn = { exports: {} };
11288
11288
  }
11289
11289
  function Je(l, _) {
11290
11290
  var m = [t(), t(), t(), t()];
11291
- S(m[0], v), S(m[1], b), S(m[2], x), re(m[3], v, b), S0(l, m, _);
11291
+ S(m[0], b), S(m[1], v), S(m[2], x), re(m[3], b, v), S0(l, m, _);
11292
11292
  }
11293
11293
  function f0(l, _, m) {
11294
11294
  var s = new Uint8Array(64), M = [t(), t(), t(), t()], p;
@@ -11340,7 +11340,7 @@ var Vn = { exports: {} };
11340
11340
  }
11341
11341
  function l0(l, _) {
11342
11342
  var m = t(), s = t(), M = t(), p = t(), I = t(), L = t(), V = t();
11343
- return S(l[2], x), j(l[1], _), ce(M, l[1]), re(p, M, o), W(M, M, l[2]), K(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);
11343
+ return S(l[2], x), j(l[1], _), ce(M, l[1]), re(p, M, o), W(M, M, l[2]), K(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);
11344
11344
  }
11345
11345
  function He(l, _, m, s) {
11346
11346
  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 Vn = { exports: {} };
11371
11371
  crypto_verify_16: k,
11372
11372
  crypto_verify_32: z,
11373
11373
  crypto_secretbox: g,
11374
- crypto_secretbox_open: C,
11374
+ crypto_secretbox_open: B,
11375
11375
  crypto_scalarmult: Me,
11376
11376
  crypto_scalarmult_base: Se,
11377
11377
  crypto_box_beforenm: We,
@@ -11449,7 +11449,7 @@ var Vn = { exports: {} };
11449
11449
  Ie(l, _, m), d0(m, _);
11450
11450
  for (var s = new Uint8Array(q0 + l.length), M = new Uint8Array(s.length), p = 0; p < l.length; p++)
11451
11451
  s[p + q0] = l[p];
11452
- return s.length < 32 || C(M, s, s.length, _, m) !== 0 ? null : M.subarray(r0);
11452
+ return s.length < 32 || B(M, s, s.length, _, m) !== 0 ? null : M.subarray(r0);
11453
11453
  }, e.secretbox.keyLength = N0, e.secretbox.nonceLength = a0, e.secretbox.overheadLength = q0, e.scalarMult = function(l, _) {
11454
11454
  if (Ie(l, _), l.length !== s0)
11455
11455
  throw new Error("bad n size");
@@ -12579,26 +12579,26 @@ let aa = class Ot extends A0 {
12579
12579
  let t = this.createTransport(e), r = !1;
12580
12580
  Ot.priorWebsocketSuccess = !1;
12581
12581
  const a = () => {
12582
- r || (t.send([{ type: "ping", data: "probe" }]), t.once("packet", (v) => {
12582
+ r || (t.send([{ type: "ping", data: "probe" }]), t.once("packet", (b) => {
12583
12583
  if (!r)
12584
- if (v.type === "pong" && v.data === "probe") {
12584
+ if (b.type === "pong" && b.data === "probe") {
12585
12585
  if (this.upgrading = !0, this.emitReserved("upgrading", t), !t)
12586
12586
  return;
12587
12587
  Ot.priorWebsocketSuccess = t.name === "websocket", this.transport.pause(() => {
12588
12588
  r || this.readyState !== "closed" && (c(), this.setTransport(t), t.send([{ type: "upgrade" }]), this.emitReserved("upgrade", t), t = null, this.upgrading = !1, this.flush());
12589
12589
  });
12590
12590
  } else {
12591
- const b = new Error("probe error");
12592
- b.transport = t.name, this.emitReserved("upgradeError", b);
12591
+ const v = new Error("probe error");
12592
+ v.transport = t.name, this.emitReserved("upgradeError", v);
12593
12593
  }
12594
12594
  }));
12595
12595
  };
12596
12596
  function i() {
12597
12597
  r || (r = !0, c(), t.close(), t = null);
12598
12598
  }
12599
- const y = (v) => {
12600
- const b = new Error("probe error: " + v);
12601
- b.transport = t.name, i(), this.emitReserved("upgradeError", b);
12599
+ const y = (b) => {
12600
+ const v = new Error("probe error: " + b);
12601
+ v.transport = t.name, i(), this.emitReserved("upgradeError", v);
12602
12602
  };
12603
12603
  function x() {
12604
12604
  y("transport closed");
@@ -12606,8 +12606,8 @@ let aa = class Ot extends A0 {
12606
12606
  function u() {
12607
12607
  y("socket closed");
12608
12608
  }
12609
- function o(v) {
12610
- t && v.name !== t.name && i();
12609
+ function o(b) {
12610
+ t && b.name !== t.name && i();
12611
12611
  }
12612
12612
  const c = () => {
12613
12613
  t.removeListener("open", a), t.removeListener("error", y), t.removeListener("close", x), this.off("close", u), this.off("upgrading", o);
@@ -14043,89 +14043,101 @@ class y1 {
14043
14043
  };
14044
14044
  }
14045
14045
  }
14046
- const ri = new y1(), g1 = "loginRes", m1 = {
14047
- isLoggedIn: void 0,
14048
- account: void 0,
14049
- payload: void 0,
14050
- signature: void 0
14051
- }, M1 = () => {
14052
- const [f, e] = _r(m1), t = localStorage.getItem("loginRes");
14046
+ const ri = new y1(), g1 = "loginRes", M1 = () => {
14047
+ const [f, e] = _r(void 0), t = localStorage.getItem("loginRes");
14053
14048
  return Ft(() => {
14054
14049
  if (t) {
14055
- const r = JSON.parse(t), { isSuccess: a, ...i } = r;
14056
- e({ ...i, isLoggedIn: !!i.account });
14057
- }
14058
- }, []), f;
14059
- }, 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", S1 = ({
14050
+ const r = JSON.parse(t);
14051
+ e(r);
14052
+ }
14053
+ }, []), {
14054
+ address: (f == null ? void 0 : f.address) ?? void 0,
14055
+ network: (f == null ? void 0 : f.network) ?? void 0,
14056
+ nickName: (f == null ? void 0 : f.nickName) ?? void 0,
14057
+ token: (f == null ? void 0 : f.token) ?? void 0
14058
+ };
14059
+ }, 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";
14060
+ class m1 {
14061
+ // Base64URL 인코딩 함수
14062
+ base64url(e) {
14063
+ return K0.enc.Base64.stringify(K0.enc.Utf8.parse(e)).replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
14064
+ }
14065
+ // token 생성 함수
14066
+ createToken(e, t) {
14067
+ const r = { type: "token", alg: "XPSIG" }, a = this.base64url(JSON.stringify(r)), i = this.base64url(JSON.stringify(e));
14068
+ return `${a}.${i}.${t}`;
14069
+ }
14070
+ // token 검증 함수
14071
+ verifyToken(e) {
14072
+ const [t, r, a] = e.split("."), i = JSON.parse(K0.enc.Utf8.stringify(K0.enc.Base64.parse(r)));
14073
+ if (Xf.xphereVerify(i.message, i.publicKey, a))
14074
+ return i;
14075
+ throw new Error("Invalid token");
14076
+ }
14077
+ getAddress(e) {
14078
+ return mr.address(e);
14079
+ }
14080
+ }
14081
+ const _1 = new m1(), A1 = {
14082
+ Enc: rr,
14083
+ Sign: mr,
14084
+ Util: z0,
14085
+ Validation: _1
14086
+ }, S1 = ({
14060
14087
  availableNetworks: f,
14061
14088
  dapp: e,
14062
14089
  url: t,
14063
14090
  sigMessage: r,
14064
14091
  validTime: a,
14065
- onReceive: i,
14066
- isShowLogo: y = !1,
14067
- logoSize: x = 30,
14068
- ...u
14092
+ isShowLogo: i = !1,
14093
+ logoSize: y = 30,
14094
+ ...x
14069
14095
  }) => {
14070
- const [o, c] = _r(!0), v = Xf.generateNonce(16), { qrCode: b, roomId: B } = ri.generateQrCode("login", e, t, f);
14096
+ const [u, o] = _r(!0), c = Xf.generateNonce(16), { qrCode: b, roomId: v } = ri.generateQrCode("login", e, t, f);
14071
14097
  return Ft(() => {
14072
- const w = setTimeout(
14098
+ const C = setTimeout(
14073
14099
  () => {
14074
- xt.leaveRoom(B), c(!1);
14100
+ xt.leaveRoom(v), o(!1);
14075
14101
  },
14076
14102
  a * 60 * 1e3
14077
14103
  );
14078
- return () => clearTimeout(w);
14079
- }, [B, a]), Ft(() => {
14104
+ return () => clearTimeout(C);
14105
+ }, [v, a]), Ft(() => {
14080
14106
  (async () => {
14081
14107
  try {
14082
- console.log("roomId", B);
14083
- const R = {
14084
- isSuccess: !0,
14085
- account: {
14086
- address: "aaa",
14087
- network: "bbb",
14088
- nickName: "ccc"
14089
- },
14090
- payload: {
14091
- publicKey: "ddd",
14092
- message: "eee"
14093
- },
14094
- signature: "fff"
14108
+ console.log("roomId", v);
14109
+ const w = {
14110
+ address: "aaa",
14111
+ network: "bbb",
14112
+ nickName: "ccc",
14113
+ token: "ddd"
14095
14114
  };
14096
- localStorage.setItem(g1, JSON.stringify(R));
14097
- const k = await p1.qrLogin(B, r, v), z = `${r}
14115
+ localStorage.setItem(g1, JSON.stringify(w));
14116
+ const R = await p1.qrLogin(v, r, c), k = `${r}
14098
14117
 
14099
- Nonce: ${v}`, F = {
14100
- publicKey: k.publicKey,
14101
- message: z
14102
- }, T = {
14103
- isSuccess: !0,
14104
- account: {
14105
- address: k.address,
14106
- network: k.network,
14107
- nickName: k.nickName
14108
- },
14109
- payload: F,
14110
- signature: k.signature
14118
+ Nonce: ${c}`, z = {
14119
+ publicKey: R.publicKey,
14120
+ message: k
14121
+ }, F = {
14122
+ address: R.address,
14123
+ network: R.network,
14124
+ nickName: R.nickName,
14125
+ token: A1.Validation.createToken(z, R.signature)
14111
14126
  };
14112
- i(T);
14113
- } catch {
14114
- i({
14115
- isSuccess: !1
14116
- });
14127
+ } catch (w) {
14128
+ console.log("error", w);
14117
14129
  }
14118
14130
  })();
14119
- }, [i, r]), o ? /* @__PURE__ */ vr.jsx(
14131
+ }, [r]), u ? /* @__PURE__ */ vr.jsx(
14120
14132
  vn,
14121
14133
  {
14122
14134
  value: b,
14123
- ...y && { imageSettings: { src: ca, width: x, height: x, excavate: !1 } },
14124
- ...u
14135
+ ...i && { imageSettings: { src: ca, width: y, height: y, excavate: !1 } },
14136
+ ...x
14125
14137
  }
14126
14138
  ) : /* @__PURE__ */ vr.jsx("div", { children: "QR loading error" });
14127
14139
  };
14128
- class _1 {
14140
+ class E1 {
14129
14141
  // 타입 가드 함수
14130
14142
  // eslint-disable-next-line @typescript-eslint/no-explicit-any
14131
14143
  isAccountType(e) {
@@ -14148,84 +14160,53 @@ class _1 {
14148
14160
  }
14149
14161
  }
14150
14162
  }
14151
- const A1 = new _1(), F1 = ({
14163
+ const w1 = new E1(), F1 = ({
14152
14164
  availableNetworks: f,
14153
14165
  dapp: e,
14154
14166
  url: t,
14155
14167
  validTime: r,
14156
- onReceive: a,
14157
- isShowLogo: i = !1,
14158
- logoSize: y = 30,
14159
- ...x
14168
+ // onReceive,
14169
+ isShowLogo: a = !1,
14170
+ logoSize: i = 30,
14171
+ ...y
14160
14172
  }) => {
14161
- const [u, o] = _r(!0), { qrCode: c, roomId: v } = ri.generateQrCode("provide", e, t, f);
14173
+ const [x, u] = _r(!0), { qrCode: o, roomId: c } = ri.generateQrCode("provide", e, t, f);
14162
14174
  return Ft(() => {
14163
14175
  const b = setTimeout(
14164
14176
  () => {
14165
- xt.leaveRoom(v), o(!1);
14177
+ xt.leaveRoom(c), u(!1);
14166
14178
  },
14167
14179
  r * 60 * 1e3
14168
14180
  );
14169
14181
  return () => clearTimeout(b);
14170
- }, [v, r]), Ft(() => {
14182
+ }, [c, r]), Ft(() => {
14171
14183
  (async () => {
14172
14184
  try {
14173
- console.log("roomId22", v);
14174
- const B = await A1.qrAddressProvide(v), w = {
14185
+ console.log("roomId22", c);
14186
+ const v = await w1.qrAddressProvide(c), C = {
14175
14187
  isSuccess: !0,
14176
- address: B.address,
14177
- network: B.network,
14178
- nickName: B.nickName
14188
+ address: v.address,
14189
+ network: v.network,
14190
+ nickName: v.nickName
14179
14191
  };
14180
- a(w);
14181
14192
  } catch {
14182
- a({
14183
- isSuccess: !1
14184
- });
14185
14193
  }
14186
14194
  })();
14187
- }, [a]), u ? /* @__PURE__ */ vr.jsx(
14195
+ }, []), x ? /* @__PURE__ */ vr.jsx(
14188
14196
  vn,
14189
14197
  {
14190
- value: c,
14191
- ...i && { imageSettings: { src: ca, width: y, height: y, excavate: !1 } },
14192
- ...x
14198
+ value: o,
14199
+ ...a && { imageSettings: { src: ca, width: i, height: i, excavate: !1 } },
14200
+ ...y
14193
14201
  }
14194
14202
  ) : /* @__PURE__ */ vr.jsx("div", { children: "QR loading error" });
14195
- };
14196
- class E1 {
14197
- // Base64URL 인코딩 함수
14198
- base64url(e) {
14199
- return K0.enc.Base64.stringify(K0.enc.Utf8.parse(e)).replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
14200
- }
14201
- // token 생성 함수
14202
- createToken(e, t) {
14203
- const r = { type: "token", alg: "XPSIG" }, a = this.base64url(JSON.stringify(r)), i = this.base64url(JSON.stringify(e));
14204
- return `${a}.${i}.${t}`;
14205
- }
14206
- // token 검증 함수
14207
- verifyToken(e) {
14208
- const [t, r, a] = e.split("."), i = JSON.parse(K0.enc.Utf8.stringify(K0.enc.Base64.parse(r)));
14209
- if (Xf.xphereVerify(i.message, i.publicKey, a))
14210
- return i;
14211
- throw new Error("Invalid token");
14212
- }
14213
- getAddress(e) {
14214
- return mr.address(e);
14215
- }
14216
- }
14217
- const w1 = new E1(), D1 = {
14218
- Enc: rr,
14219
- Sign: mr,
14220
- Util: z0,
14221
- Validation: w1
14222
- }, R1 = {
14203
+ }, D1 = {
14223
14204
  Qr: ri
14224
14205
  };
14225
14206
  export {
14226
14207
  F1 as AddressProvideQR,
14227
14208
  S1 as LoginQR,
14228
- D1 as Xphere,
14229
- R1 as Zigap,
14209
+ A1 as Xphere,
14210
+ D1 as Zigap,
14230
14211
  M1 as useZigap
14231
14212
  };