zigap-utils 0.0.468 → 0.0.469
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.
- package/dist/index.cjs.js +7 -7
- package/dist/index.es.js +713 -693
- package/dist/zigap/index.d.ts +5 -2
- package/dist/zigap/useZigap.d.ts +4 -0
- package/package.json +1 -1
package/dist/index.es.js
CHANGED
|
@@ -3,7 +3,7 @@ var da = Object.defineProperty;
|
|
|
3
3
|
var ha = (f, e, t) => e in f ? da(f, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : f[e] = t;
|
|
4
4
|
var wt = (f, e, t) => (ha(f, typeof e != "symbol" ? e + "" : e, t), t);
|
|
5
5
|
import * as ua from "react";
|
|
6
|
-
import ar, { useRef as fi, useState as
|
|
6
|
+
import ar, { useRef as fi, useState as _r, useEffect as Ft } from "react";
|
|
7
7
|
var Pe = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
|
|
8
8
|
function cn(f) {
|
|
9
9
|
return f && f.__esModule && Object.prototype.hasOwnProperty.call(f, "default") ? f.default : f;
|
|
@@ -29,7 +29,7 @@ function dn(f) {
|
|
|
29
29
|
});
|
|
30
30
|
}), t;
|
|
31
31
|
}
|
|
32
|
-
var
|
|
32
|
+
var Sf = { exports: {} }, Xt = {};
|
|
33
33
|
const hn = /* @__PURE__ */ dn(ua);
|
|
34
34
|
/**
|
|
35
35
|
* @license React
|
|
@@ -79,7 +79,7 @@ function xa() {
|
|
|
79
79
|
return typeof I == "function" ? I : null;
|
|
80
80
|
}
|
|
81
81
|
var z = f.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;
|
|
82
|
-
function
|
|
82
|
+
function F(p) {
|
|
83
83
|
{
|
|
84
84
|
for (var I = arguments.length, L = new Array(I > 1 ? I - 1 : 0), V = 1; V < I; V++)
|
|
85
85
|
L[V - 1] = arguments[V];
|
|
@@ -118,7 +118,7 @@ function xa() {
|
|
|
118
118
|
function d(p) {
|
|
119
119
|
if (p == null)
|
|
120
120
|
return null;
|
|
121
|
-
if (typeof p.tag == "number" &&
|
|
121
|
+
if (typeof p.tag == "number" && F("Received an unexpected object in getComponentNameFromType(). This is likely a bug in React. Please file an issue."), typeof p == "function")
|
|
122
122
|
return p.displayName || p.name || null;
|
|
123
123
|
if (typeof p == "string")
|
|
124
124
|
return p;
|
|
@@ -160,14 +160,14 @@ function xa() {
|
|
|
160
160
|
}
|
|
161
161
|
return null;
|
|
162
162
|
}
|
|
163
|
-
var g = Object.assign, C = 0,
|
|
163
|
+
var g = Object.assign, C = 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
169
|
if (C === 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,
|
|
173
173
|
enumerable: !0,
|
|
@@ -197,7 +197,7 @@ function xa() {
|
|
|
197
197
|
};
|
|
198
198
|
Object.defineProperties(console, {
|
|
199
199
|
log: g({}, p, {
|
|
200
|
-
value:
|
|
200
|
+
value: S
|
|
201
201
|
}),
|
|
202
202
|
info: g({}, p, {
|
|
203
203
|
value: N
|
|
@@ -219,7 +219,7 @@ function xa() {
|
|
|
219
219
|
})
|
|
220
220
|
});
|
|
221
221
|
}
|
|
222
|
-
C < 0 &&
|
|
222
|
+
C < 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;
|
|
@@ -236,16 +236,16 @@ function xa() {
|
|
|
236
236
|
` + we + p;
|
|
237
237
|
}
|
|
238
238
|
}
|
|
239
|
-
var Me = !1,
|
|
239
|
+
var Me = !1, Se;
|
|
240
240
|
{
|
|
241
241
|
var G0 = typeof WeakMap == "function" ? WeakMap : Map;
|
|
242
|
-
|
|
242
|
+
Se = new G0();
|
|
243
243
|
}
|
|
244
244
|
function We(p, I) {
|
|
245
245
|
if (!p || Me)
|
|
246
246
|
return "";
|
|
247
247
|
{
|
|
248
|
-
var L =
|
|
248
|
+
var L = Se.get(p);
|
|
249
249
|
if (L !== void 0)
|
|
250
250
|
return L;
|
|
251
251
|
}
|
|
@@ -300,7 +300,7 @@ function xa() {
|
|
|
300
300
|
if (ue--, ve--, ve < 0 || te[ue] !== xe[ve]) {
|
|
301
301
|
var ge = `
|
|
302
302
|
` + te[ue].replace(" at new ", " at ");
|
|
303
|
-
return p.displayName && ge.includes("<anonymous>") && (ge = ge.replace("<anonymous>", p.displayName)), typeof p == "function" &&
|
|
303
|
+
return p.displayName && ge.includes("<anonymous>") && (ge = ge.replace("<anonymous>", p.displayName)), typeof p == "function" && Se.set(p, ge), ge;
|
|
304
304
|
}
|
|
305
305
|
while (ue >= 1 && ve >= 0);
|
|
306
306
|
break;
|
|
@@ -310,7 +310,7 @@ function xa() {
|
|
|
310
310
|
Me = !1, ce.current = fe, re(), Error.prepareStackTrace = ne;
|
|
311
311
|
}
|
|
312
312
|
var me = p ? p.displayName || p.name : "", _e = me ? Ae(me) : "";
|
|
313
|
-
return typeof p == "function" &&
|
|
313
|
+
return typeof p == "function" && Se.set(p, _e), _e;
|
|
314
314
|
}
|
|
315
315
|
function Oe(p, I, L) {
|
|
316
316
|
return We(p, !1);
|
|
@@ -371,15 +371,15 @@ function xa() {
|
|
|
371
371
|
} catch (ue) {
|
|
372
372
|
te = ue;
|
|
373
373
|
}
|
|
374
|
-
te && !(te instanceof Error) && (ze(ne),
|
|
374
|
+
te && !(te instanceof Error) && (ze(ne), F("%s: type specification of %s `%s` is invalid; the type checker function must return `null` or an `Error` but returned a %s. You may have forgotten to pass an argument to the type checker creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and shape all require an argument).", V || "React class", L, he, typeof te), ze(null)), te instanceof Error && !(te.message in $0) && ($0[te.message] = !0, ze(ne), F("Failed %s type: %s", L, te.message), ze(null));
|
|
375
375
|
}
|
|
376
376
|
}
|
|
377
377
|
}
|
|
378
378
|
var Ne = Array.isArray;
|
|
379
|
-
function
|
|
379
|
+
function Fe(p) {
|
|
380
380
|
return Ne(p);
|
|
381
381
|
}
|
|
382
|
-
function
|
|
382
|
+
function S0(p) {
|
|
383
383
|
{
|
|
384
384
|
var I = typeof Symbol == "function" && Symbol.toStringTag, L = I && p[Symbol.toStringTag] || p.constructor.name || "Object";
|
|
385
385
|
return L;
|
|
@@ -395,9 +395,9 @@ function xa() {
|
|
|
395
395
|
function f0(p) {
|
|
396
396
|
return "" + p;
|
|
397
397
|
}
|
|
398
|
-
function
|
|
398
|
+
function F0(p) {
|
|
399
399
|
if (Je(p))
|
|
400
|
-
return
|
|
400
|
+
return F("The provided key is an unsupported type %s. This value must be coerced to a string before before using it here.", S0(p)), f0(p);
|
|
401
401
|
}
|
|
402
402
|
var qe = z.ReactCurrentOwner, u0 = {
|
|
403
403
|
key: !0,
|
|
@@ -425,13 +425,13 @@ function xa() {
|
|
|
425
425
|
function r0(p, I) {
|
|
426
426
|
if (typeof p.ref == "string" && qe.current && I && qe.current.stateNode !== I) {
|
|
427
427
|
var L = d(qe.current.type);
|
|
428
|
-
He[L] || (
|
|
428
|
+
He[L] || (F('Component "%s" contains the string ref "%s". Support for string refs will be removed in a future major release. This case cannot be automatically converted to an arrow function. We ask you to manually fix this case by using useRef() or createRef() instead. Learn more about using refs safely here: https://reactjs.org/link/strict-mode-string-ref', d(qe.current.type), p.ref), He[L] = !0);
|
|
429
429
|
}
|
|
430
430
|
}
|
|
431
431
|
function q0(p, I) {
|
|
432
432
|
{
|
|
433
433
|
var L = function() {
|
|
434
|
-
Q0 || (Q0 = !0,
|
|
434
|
+
Q0 || (Q0 = !0, F("%s: `key` is not a prop. Trying to access it will result in `undefined` being returned. If you need to access the same value within the child component, you should pass it as a different prop. (https://reactjs.org/link/special-props)", I));
|
|
435
435
|
};
|
|
436
436
|
L.isReactWarning = !0, Object.defineProperty(p, "key", {
|
|
437
437
|
get: L,
|
|
@@ -442,7 +442,7 @@ function xa() {
|
|
|
442
442
|
function i0(p, I) {
|
|
443
443
|
{
|
|
444
444
|
var L = function() {
|
|
445
|
-
l0 || (l0 = !0,
|
|
445
|
+
l0 || (l0 = !0, F("%s: `ref` is not a prop. Trying to access it will result in `undefined` being returned. If you need to access the same value within the child component, you should pass it as a different prop. (https://reactjs.org/link/special-props)", I));
|
|
446
446
|
};
|
|
447
447
|
L.isReactWarning = !0, Object.defineProperty(p, "ref", {
|
|
448
448
|
get: L,
|
|
@@ -482,7 +482,7 @@ function xa() {
|
|
|
482
482
|
function W0(p, I, L, V, ne) {
|
|
483
483
|
{
|
|
484
484
|
var fe, he = {}, te = null, xe = null;
|
|
485
|
-
L !== void 0 && (
|
|
485
|
+
L !== void 0 && (F0(L), te = "" + L), a0(I) && (F0(I.key), te = "" + I.key), N0(I) && (xe = I.ref, r0(I, ne));
|
|
486
486
|
for (fe in I)
|
|
487
487
|
Ke.call(I, fe) && !u0.hasOwnProperty(fe) && (he[fe] = I[fe]);
|
|
488
488
|
if (p && p.defaultProps) {
|
|
@@ -548,14 +548,14 @@ Check the top-level render call using <` + L + ">.");
|
|
|
548
548
|
return;
|
|
549
549
|
Ve[L] = !0;
|
|
550
550
|
var V = "";
|
|
551
|
-
p && p._owner && p._owner !== e0.current && (V = " It was passed a child from " + d(p._owner.type) + "."), L0(p),
|
|
551
|
+
p && p._owner && p._owner !== e0.current && (V = " It was passed a child from " + d(p._owner.type) + "."), L0(p), F('Each child in a list should have a unique "key" prop.%s%s See https://reactjs.org/link/warning-keys for more information.', L, V), L0(null);
|
|
552
552
|
}
|
|
553
553
|
}
|
|
554
554
|
function d0(p, I) {
|
|
555
555
|
{
|
|
556
556
|
if (typeof p != "object")
|
|
557
557
|
return;
|
|
558
|
-
if (
|
|
558
|
+
if (Fe(p))
|
|
559
559
|
for (var L = 0; L < p.length; L++) {
|
|
560
560
|
var V = p[L];
|
|
561
561
|
x0(V) && c0(V, I);
|
|
@@ -590,9 +590,9 @@ Check the top-level render call using <` + L + ">.");
|
|
|
590
590
|
} else if (I.PropTypes !== void 0 && !o0) {
|
|
591
591
|
o0 = !0;
|
|
592
592
|
var ne = d(I);
|
|
593
|
-
|
|
593
|
+
F("Component %s declared `PropTypes` instead of `propTypes`. Did you misspell the property assignment?", ne || "Unknown");
|
|
594
594
|
}
|
|
595
|
-
typeof I.getDefaultProps == "function" && !I.getDefaultProps.isReactClassApproved &&
|
|
595
|
+
typeof I.getDefaultProps == "function" && !I.getDefaultProps.isReactClassApproved && F("getDefaultProps is only used on classic React.createClass definitions. Use a static property named `defaultProps` instead.");
|
|
596
596
|
}
|
|
597
597
|
}
|
|
598
598
|
function Ie(p) {
|
|
@@ -600,11 +600,11 @@ Check the top-level render call using <` + L + ">.");
|
|
|
600
600
|
for (var I = Object.keys(p.props), L = 0; L < I.length; L++) {
|
|
601
601
|
var V = I[L];
|
|
602
602
|
if (V !== "children" && V !== "key") {
|
|
603
|
-
L0(p),
|
|
603
|
+
L0(p), F("Invalid prop `%s` supplied to `React.Fragment`. React.Fragment can only have `key` and `children` props.", V), L0(null);
|
|
604
604
|
break;
|
|
605
605
|
}
|
|
606
606
|
}
|
|
607
|
-
p.ref !== null && (L0(p),
|
|
607
|
+
p.ref !== null && (L0(p), F("Invalid attribute `ref` supplied to `React.Fragment`."), L0(null));
|
|
608
608
|
}
|
|
609
609
|
}
|
|
610
610
|
var Re = {};
|
|
@@ -617,7 +617,7 @@ Check the top-level render call using <` + L + ">.");
|
|
|
617
617
|
var xe = t0();
|
|
618
618
|
xe ? te += xe : te += D0();
|
|
619
619
|
var ue;
|
|
620
|
-
p === null ? ue = "null" :
|
|
620
|
+
p === null ? ue = "null" : Fe(p) ? ue = "array" : p !== void 0 && p.$$typeof === e ? (ue = "<" + (d(p.type) || "Unknown") + " />", te = " Did you accidentally export a JSX literal instead of a component?") : ue = typeof p, F("React.jsx: type is invalid -- expected a string (for built-in components) or a class/function (for composite components) but got: %s.%s", ue, te);
|
|
621
621
|
}
|
|
622
622
|
var ve = W0(p, I, L, ne, fe);
|
|
623
623
|
if (ve == null)
|
|
@@ -626,12 +626,12 @@ Check the top-level render call using <` + L + ">.");
|
|
|
626
626
|
var ge = I.children;
|
|
627
627
|
if (ge !== void 0)
|
|
628
628
|
if (V)
|
|
629
|
-
if (
|
|
629
|
+
if (Fe(ge)) {
|
|
630
630
|
for (var me = 0; me < ge.length; me++)
|
|
631
631
|
d0(ge[me], p);
|
|
632
632
|
Object.freeze && Object.freeze(ge);
|
|
633
633
|
} else
|
|
634
|
-
|
|
634
|
+
F("React.jsx: Static children should always be an array. You are likely explicitly calling React.jsxs or React.jsxDEV. Use the Babel transform instead.");
|
|
635
635
|
else
|
|
636
636
|
d0(ge, p);
|
|
637
637
|
}
|
|
@@ -641,7 +641,7 @@ Check the top-level render call using <` + L + ">.");
|
|
|
641
641
|
}), de = pe.length > 0 ? "{key: someKey, " + pe.join(": ..., ") + ": ...}" : "{key: someKey}";
|
|
642
642
|
if (!Re[_e + de]) {
|
|
643
643
|
var ye = pe.length > 0 ? "{" + pe.join(": ..., ") + ": ...}" : "{}";
|
|
644
|
-
|
|
644
|
+
F(`A props object containing a "key" prop is being spread into JSX:
|
|
645
645
|
let props = %s;
|
|
646
646
|
<%s {...props} />
|
|
647
647
|
React keys must be passed directly to JSX without using spread:
|
|
@@ -662,8 +662,8 @@ React keys must be passed directly to JSX without using spread:
|
|
|
662
662
|
Zt.Fragment = r, Zt.jsx = s, Zt.jsxs = M;
|
|
663
663
|
}()), Zt;
|
|
664
664
|
}
|
|
665
|
-
process.env.NODE_ENV === "production" ?
|
|
666
|
-
var vr =
|
|
665
|
+
process.env.NODE_ENV === "production" ? Sf.exports = la() : Sf.exports = xa();
|
|
666
|
+
var vr = Sf.exports, va = Object.defineProperty, br = Object.getOwnPropertySymbols, un = Object.prototype.hasOwnProperty, ln = Object.prototype.propertyIsEnumerable, ai = (f, e, t) => e in f ? va(f, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : f[e] = t, si = (f, e) => {
|
|
667
667
|
for (var t in e || (e = {}))
|
|
668
668
|
un.call(e, t) && ai(f, t, e[t]);
|
|
669
669
|
if (br)
|
|
@@ -684,7 +684,7 @@ var vr = Mf.exports, va = Object.defineProperty, br = Object.getOwnPropertySymbo
|
|
|
684
684
|
* Copyright (c) Project Nayuki.
|
|
685
685
|
* SPDX-License-Identifier: MIT
|
|
686
686
|
*/
|
|
687
|
-
var
|
|
687
|
+
var Dt;
|
|
688
688
|
((f) => {
|
|
689
689
|
const e = class {
|
|
690
690
|
constructor(u, o, c, v) {
|
|
@@ -744,10 +744,10 @@ var St;
|
|
|
744
744
|
i(k.length <= z), r(0, Math.min(4, z - k.length), k), r(0, (8 - k.length % 8) % 8, k), i(k.length % 8 == 0);
|
|
745
745
|
for (let P = 236; k.length < z; P ^= 253)
|
|
746
746
|
r(P, 8, k);
|
|
747
|
-
let
|
|
748
|
-
for (;
|
|
749
|
-
|
|
750
|
-
return k.forEach((P, T) =>
|
|
747
|
+
let F = [];
|
|
748
|
+
for (; F.length * 8 < k.length; )
|
|
749
|
+
F.push(0);
|
|
750
|
+
return k.forEach((P, T) => F[T >>> 3] |= P << 7 - (T & 7)), new e(w, o, F, b);
|
|
751
751
|
}
|
|
752
752
|
getModule(u, o) {
|
|
753
753
|
return 0 <= u && u < this.size && 0 <= o && o < this.size && this.modules[o][u];
|
|
@@ -824,12 +824,12 @@ var St;
|
|
|
824
824
|
const $ = e.reedSolomonComputeRemainder(H, z);
|
|
825
825
|
P < w && H.push(0), k.push(H.concat($));
|
|
826
826
|
}
|
|
827
|
-
let
|
|
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) &&
|
|
830
|
+
(P != R - b || H >= w) && F.push(T[P]);
|
|
831
831
|
});
|
|
832
|
-
return i(
|
|
832
|
+
return i(F.length == B), F;
|
|
833
833
|
}
|
|
834
834
|
drawCodewords(u) {
|
|
835
835
|
if (u.length != Math.floor(e.getNumRawDataModules(this.version) / 8))
|
|
@@ -1078,7 +1078,7 @@ var St;
|
|
|
1078
1078
|
};
|
|
1079
1079
|
let x = y;
|
|
1080
1080
|
x.NUMERIC_REGEX = /^[0-9]*$/, x.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, x.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:", f.QrSegment = x;
|
|
1081
|
-
})(
|
|
1081
|
+
})(Dt || (Dt = {}));
|
|
1082
1082
|
((f) => {
|
|
1083
1083
|
((e) => {
|
|
1084
1084
|
const t = class {
|
|
@@ -1089,7 +1089,7 @@ var St;
|
|
|
1089
1089
|
let r = t;
|
|
1090
1090
|
r.LOW = new t(0, 1), r.MEDIUM = new t(1, 0), r.QUARTILE = new t(2, 3), r.HIGH = new t(3, 2), e.Ecc = r;
|
|
1091
1091
|
})(f.QrCode || (f.QrCode = {}));
|
|
1092
|
-
})(
|
|
1092
|
+
})(Dt || (Dt = {}));
|
|
1093
1093
|
((f) => {
|
|
1094
1094
|
((e) => {
|
|
1095
1095
|
const t = class {
|
|
@@ -1103,8 +1103,8 @@ var St;
|
|
|
1103
1103
|
let r = t;
|
|
1104
1104
|
r.NUMERIC = new t(1, [10, 12, 14]), r.ALPHANUMERIC = new t(2, [9, 11, 13]), r.BYTE = new t(4, [8, 16, 16]), r.KANJI = new t(8, [8, 10, 12]), r.ECI = new t(7, [0, 0, 0]), e.Mode = r;
|
|
1105
1105
|
})(f.QrSegment || (f.QrSegment = {}));
|
|
1106
|
-
})(
|
|
1107
|
-
var tr =
|
|
1106
|
+
})(Dt || (Dt = {}));
|
|
1107
|
+
var tr = Dt;
|
|
1108
1108
|
/**
|
|
1109
1109
|
* @license qrcode.react
|
|
1110
1110
|
* Copyright (c) Paul O'Shannessy
|
|
@@ -1176,17 +1176,17 @@ 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] =
|
|
1180
|
-
|
|
1179
|
+
]), v = o == null ? void 0 : o.src, b = fi(null), B = fi(null), [w, R] = _r(!1);
|
|
1180
|
+
Ft(() => {
|
|
1181
1181
|
if (b.current != null) {
|
|
1182
|
-
const
|
|
1182
|
+
const F = b.current, P = F.getContext("2d");
|
|
1183
1183
|
if (!P)
|
|
1184
1184
|
return;
|
|
1185
1185
|
let T = tr.QrCode.encodeText(t, pa[a]).getModules();
|
|
1186
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;
|
|
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
1192
|
n.forEach(function(g, C) {
|
|
@@ -1194,7 +1194,7 @@ function vn(f) {
|
|
|
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
1199
|
}, [v]);
|
|
1200
1200
|
const k = si({ height: r, width: r }, u);
|
|
@@ -1218,11 +1218,11 @@ var bn = { exports: {} };
|
|
|
1218
1218
|
function pn(f) {
|
|
1219
1219
|
throw new Error('Could not dynamically require "' + f + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
|
|
1220
1220
|
}
|
|
1221
|
-
var
|
|
1222
|
-
const
|
|
1221
|
+
var Or = { exports: {} };
|
|
1222
|
+
const Sa = {}, Fa = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
1223
1223
|
__proto__: null,
|
|
1224
|
-
default:
|
|
1225
|
-
}, Symbol.toStringTag, { value: "Module" })),
|
|
1224
|
+
default: Sa
|
|
1225
|
+
}, Symbol.toStringTag, { value: "Module" })), Ar = /* @__PURE__ */ dn(Fa);
|
|
1226
1226
|
var oi;
|
|
1227
1227
|
function $e() {
|
|
1228
1228
|
return oi || (oi = 1, function(f, e) {
|
|
@@ -1233,7 +1233,7 @@ function $e() {
|
|
|
1233
1233
|
var i;
|
|
1234
1234
|
if (typeof window < "u" && window.crypto && (i = window.crypto), typeof self < "u" && self.crypto && (i = self.crypto), typeof globalThis < "u" && globalThis.crypto && (i = globalThis.crypto), !i && typeof window < "u" && window.msCrypto && (i = window.msCrypto), !i && typeof Pe < "u" && Pe.crypto && (i = Pe.crypto), !i && typeof pn == "function")
|
|
1235
1235
|
try {
|
|
1236
|
-
i =
|
|
1236
|
+
i = Ar;
|
|
1237
1237
|
} catch {
|
|
1238
1238
|
}
|
|
1239
1239
|
var y = function() {
|
|
@@ -1251,11 +1251,11 @@ function $e() {
|
|
|
1251
1251
|
}
|
|
1252
1252
|
throw new Error("Native crypto module could not be used to get secure random number.");
|
|
1253
1253
|
}, x = Object.create || /* @__PURE__ */ function() {
|
|
1254
|
-
function
|
|
1254
|
+
function F() {
|
|
1255
1255
|
}
|
|
1256
1256
|
return function(P) {
|
|
1257
1257
|
var T;
|
|
1258
|
-
return
|
|
1258
|
+
return F.prototype = P, T = new F(), F.prototype = null, T;
|
|
1259
1259
|
};
|
|
1260
1260
|
}(), u = {}, o = u.lib = {}, c = o.Base = /* @__PURE__ */ function() {
|
|
1261
1261
|
return {
|
|
@@ -1277,9 +1277,9 @@ function $e() {
|
|
|
1277
1277
|
* }
|
|
1278
1278
|
* });
|
|
1279
1279
|
*/
|
|
1280
|
-
extend: function(
|
|
1280
|
+
extend: function(F) {
|
|
1281
1281
|
var P = x(this);
|
|
1282
|
-
return
|
|
1282
|
+
return F && P.mixIn(F), (!P.hasOwnProperty("init") || this.init === P.init) && (P.init = function() {
|
|
1283
1283
|
P.$super.init.apply(this, arguments);
|
|
1284
1284
|
}), P.init.prototype = P, P.$super = this, P;
|
|
1285
1285
|
},
|
|
@@ -1296,8 +1296,8 @@ function $e() {
|
|
|
1296
1296
|
* var instance = MyType.create();
|
|
1297
1297
|
*/
|
|
1298
1298
|
create: function() {
|
|
1299
|
-
var
|
|
1300
|
-
return
|
|
1299
|
+
var F = this.extend();
|
|
1300
|
+
return F.init.apply(F, arguments), F;
|
|
1301
1301
|
},
|
|
1302
1302
|
/**
|
|
1303
1303
|
* Initializes a newly created object.
|
|
@@ -1324,10 +1324,10 @@ function $e() {
|
|
|
1324
1324
|
* field: 'value'
|
|
1325
1325
|
* });
|
|
1326
1326
|
*/
|
|
1327
|
-
mixIn: function(
|
|
1328
|
-
for (var P in
|
|
1329
|
-
|
|
1330
|
-
|
|
1327
|
+
mixIn: function(F) {
|
|
1328
|
+
for (var P in F)
|
|
1329
|
+
F.hasOwnProperty(P) && (this[P] = F[P]);
|
|
1330
|
+
F.hasOwnProperty("toString") && (this.toString = F.toString);
|
|
1331
1331
|
},
|
|
1332
1332
|
/**
|
|
1333
1333
|
* Creates a copy of this object.
|
|
@@ -1355,8 +1355,8 @@ function $e() {
|
|
|
1355
1355
|
* var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]);
|
|
1356
1356
|
* var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);
|
|
1357
1357
|
*/
|
|
1358
|
-
init: function(
|
|
1359
|
-
|
|
1358
|
+
init: function(F, P) {
|
|
1359
|
+
F = this.words = F || [], P != a ? this.sigBytes = P : this.sigBytes = F.length * 4;
|
|
1360
1360
|
},
|
|
1361
1361
|
/**
|
|
1362
1362
|
* Converts this word array to a string.
|
|
@@ -1371,8 +1371,8 @@ function $e() {
|
|
|
1371
1371
|
* var string = wordArray.toString();
|
|
1372
1372
|
* var string = wordArray.toString(CryptoJS.enc.Utf8);
|
|
1373
1373
|
*/
|
|
1374
|
-
toString: function(
|
|
1375
|
-
return (
|
|
1374
|
+
toString: function(F) {
|
|
1375
|
+
return (F || B).stringify(this);
|
|
1376
1376
|
},
|
|
1377
1377
|
/**
|
|
1378
1378
|
* Concatenates a word array to this word array.
|
|
@@ -1385,8 +1385,8 @@ function $e() {
|
|
|
1385
1385
|
*
|
|
1386
1386
|
* wordArray1.concat(wordArray2);
|
|
1387
1387
|
*/
|
|
1388
|
-
concat: function(
|
|
1389
|
-
var P = this.words, T =
|
|
1388
|
+
concat: function(F) {
|
|
1389
|
+
var P = this.words, T = F.words, H = this.sigBytes, $ = F.sigBytes;
|
|
1390
1390
|
if (this.clamp(), H % 4)
|
|
1391
1391
|
for (var Y = 0; Y < $; Y++) {
|
|
1392
1392
|
var X = T[Y >>> 2] >>> 24 - Y % 4 * 8 & 255;
|
|
@@ -1405,8 +1405,8 @@ function $e() {
|
|
|
1405
1405
|
* wordArray.clamp();
|
|
1406
1406
|
*/
|
|
1407
1407
|
clamp: function() {
|
|
1408
|
-
var
|
|
1409
|
-
|
|
1408
|
+
var F = this.words, P = this.sigBytes;
|
|
1409
|
+
F[P >>> 2] &= 4294967295 << 32 - P % 4 * 8, F.length = r.ceil(P / 4);
|
|
1410
1410
|
},
|
|
1411
1411
|
/**
|
|
1412
1412
|
* Creates a copy of this word array.
|
|
@@ -1418,8 +1418,8 @@ function $e() {
|
|
|
1418
1418
|
* var clone = wordArray.clone();
|
|
1419
1419
|
*/
|
|
1420
1420
|
clone: function() {
|
|
1421
|
-
var
|
|
1422
|
-
return
|
|
1421
|
+
var F = c.clone.call(this);
|
|
1422
|
+
return F.words = this.words.slice(0), F;
|
|
1423
1423
|
},
|
|
1424
1424
|
/**
|
|
1425
1425
|
* Creates a word array filled with random bytes.
|
|
@@ -1434,10 +1434,10 @@ function $e() {
|
|
|
1434
1434
|
*
|
|
1435
1435
|
* var wordArray = CryptoJS.lib.WordArray.random(16);
|
|
1436
1436
|
*/
|
|
1437
|
-
random: function(
|
|
1438
|
-
for (var P = [], T = 0; T <
|
|
1437
|
+
random: function(F) {
|
|
1438
|
+
for (var P = [], T = 0; T < F; T += 4)
|
|
1439
1439
|
P.push(y());
|
|
1440
|
-
return new v.init(P,
|
|
1440
|
+
return new v.init(P, F);
|
|
1441
1441
|
}
|
|
1442
1442
|
}), b = u.enc = {}, B = b.Hex = {
|
|
1443
1443
|
/**
|
|
@@ -1453,8 +1453,8 @@ function $e() {
|
|
|
1453
1453
|
*
|
|
1454
1454
|
* var hexString = CryptoJS.enc.Hex.stringify(wordArray);
|
|
1455
1455
|
*/
|
|
1456
|
-
stringify: function(
|
|
1457
|
-
for (var P =
|
|
1456
|
+
stringify: function(F) {
|
|
1457
|
+
for (var P = F.words, T = F.sigBytes, H = [], $ = 0; $ < T; $++) {
|
|
1458
1458
|
var Y = P[$ >>> 2] >>> 24 - $ % 4 * 8 & 255;
|
|
1459
1459
|
H.push((Y >>> 4).toString(16)), H.push((Y & 15).toString(16));
|
|
1460
1460
|
}
|
|
@@ -1473,9 +1473,9 @@ function $e() {
|
|
|
1473
1473
|
*
|
|
1474
1474
|
* var wordArray = CryptoJS.enc.Hex.parse(hexString);
|
|
1475
1475
|
*/
|
|
1476
|
-
parse: function(
|
|
1477
|
-
for (var P =
|
|
1478
|
-
T[H >>> 3] |= parseInt(
|
|
1476
|
+
parse: function(F) {
|
|
1477
|
+
for (var P = F.length, T = [], H = 0; H < P; H += 2)
|
|
1478
|
+
T[H >>> 3] |= parseInt(F.substr(H, 2), 16) << 24 - H % 8 * 4;
|
|
1479
1479
|
return new v.init(T, P / 2);
|
|
1480
1480
|
}
|
|
1481
1481
|
}, w = b.Latin1 = {
|
|
@@ -1492,8 +1492,8 @@ function $e() {
|
|
|
1492
1492
|
*
|
|
1493
1493
|
* var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);
|
|
1494
1494
|
*/
|
|
1495
|
-
stringify: function(
|
|
1496
|
-
for (var P =
|
|
1495
|
+
stringify: function(F) {
|
|
1496
|
+
for (var P = F.words, T = F.sigBytes, H = [], $ = 0; $ < T; $++) {
|
|
1497
1497
|
var Y = P[$ >>> 2] >>> 24 - $ % 4 * 8 & 255;
|
|
1498
1498
|
H.push(String.fromCharCode(Y));
|
|
1499
1499
|
}
|
|
@@ -1512,9 +1512,9 @@ function $e() {
|
|
|
1512
1512
|
*
|
|
1513
1513
|
* var wordArray = CryptoJS.enc.Latin1.parse(latin1String);
|
|
1514
1514
|
*/
|
|
1515
|
-
parse: function(
|
|
1516
|
-
for (var P =
|
|
1517
|
-
T[H >>> 2] |= (
|
|
1515
|
+
parse: function(F) {
|
|
1516
|
+
for (var P = F.length, T = [], H = 0; H < P; H++)
|
|
1517
|
+
T[H >>> 2] |= (F.charCodeAt(H) & 255) << 24 - H % 4 * 8;
|
|
1518
1518
|
return new v.init(T, P);
|
|
1519
1519
|
}
|
|
1520
1520
|
}, R = b.Utf8 = {
|
|
@@ -1531,9 +1531,9 @@ function $e() {
|
|
|
1531
1531
|
*
|
|
1532
1532
|
* var utf8String = CryptoJS.enc.Utf8.stringify(wordArray);
|
|
1533
1533
|
*/
|
|
1534
|
-
stringify: function(
|
|
1534
|
+
stringify: function(F) {
|
|
1535
1535
|
try {
|
|
1536
|
-
return decodeURIComponent(escape(w.stringify(
|
|
1536
|
+
return decodeURIComponent(escape(w.stringify(F)));
|
|
1537
1537
|
} catch {
|
|
1538
1538
|
throw new Error("Malformed UTF-8 data");
|
|
1539
1539
|
}
|
|
@@ -1551,8 +1551,8 @@ function $e() {
|
|
|
1551
1551
|
*
|
|
1552
1552
|
* var wordArray = CryptoJS.enc.Utf8.parse(utf8String);
|
|
1553
1553
|
*/
|
|
1554
|
-
parse: function(
|
|
1555
|
-
return w.parse(unescape(encodeURIComponent(
|
|
1554
|
+
parse: function(F) {
|
|
1555
|
+
return w.parse(unescape(encodeURIComponent(F)));
|
|
1556
1556
|
}
|
|
1557
1557
|
}, k = o.BufferedBlockAlgorithm = c.extend({
|
|
1558
1558
|
/**
|
|
@@ -1575,8 +1575,8 @@ function $e() {
|
|
|
1575
1575
|
* bufferedBlockAlgorithm._append('data');
|
|
1576
1576
|
* bufferedBlockAlgorithm._append(wordArray);
|
|
1577
1577
|
*/
|
|
1578
|
-
_append: function(
|
|
1579
|
-
typeof
|
|
1578
|
+
_append: function(F) {
|
|
1579
|
+
typeof F == "string" && (F = R.parse(F)), this._data.concat(F), this._nDataBytes += F.sigBytes;
|
|
1580
1580
|
},
|
|
1581
1581
|
/**
|
|
1582
1582
|
* Processes available data blocks.
|
|
@@ -1592,9 +1592,9 @@ function $e() {
|
|
|
1592
1592
|
* var processedData = bufferedBlockAlgorithm._process();
|
|
1593
1593
|
* var processedData = bufferedBlockAlgorithm._process(!!'flush');
|
|
1594
1594
|
*/
|
|
1595
|
-
_process: function(
|
|
1595
|
+
_process: function(F) {
|
|
1596
1596
|
var P, T = this._data, H = T.words, $ = T.sigBytes, Y = this.blockSize, X = Y * 4, Q = $ / X;
|
|
1597
|
-
|
|
1597
|
+
F ? Q = r.ceil(Q) : Q = r.max((Q | 0) - this._minBufferSize, 0);
|
|
1598
1598
|
var U = Q * Y, A = r.min(U * 4, $);
|
|
1599
1599
|
if (U) {
|
|
1600
1600
|
for (var n = 0; n < U; n += Y)
|
|
@@ -1613,8 +1613,8 @@ function $e() {
|
|
|
1613
1613
|
* var clone = bufferedBlockAlgorithm.clone();
|
|
1614
1614
|
*/
|
|
1615
1615
|
clone: function() {
|
|
1616
|
-
var
|
|
1617
|
-
return
|
|
1616
|
+
var F = c.clone.call(this);
|
|
1617
|
+
return F._data = this._data.clone(), F;
|
|
1618
1618
|
},
|
|
1619
1619
|
_minBufferSize: 0
|
|
1620
1620
|
});
|
|
@@ -1632,8 +1632,8 @@ function $e() {
|
|
|
1632
1632
|
*
|
|
1633
1633
|
* var hasher = CryptoJS.algo.SHA256.create();
|
|
1634
1634
|
*/
|
|
1635
|
-
init: function(
|
|
1636
|
-
this.cfg = this.cfg.extend(
|
|
1635
|
+
init: function(F) {
|
|
1636
|
+
this.cfg = this.cfg.extend(F), this.reset();
|
|
1637
1637
|
},
|
|
1638
1638
|
/**
|
|
1639
1639
|
* Resets this hasher to its initial state.
|
|
@@ -1657,8 +1657,8 @@ function $e() {
|
|
|
1657
1657
|
* hasher.update('message');
|
|
1658
1658
|
* hasher.update(wordArray);
|
|
1659
1659
|
*/
|
|
1660
|
-
update: function(
|
|
1661
|
-
return this._append(
|
|
1660
|
+
update: function(F) {
|
|
1661
|
+
return this._append(F), this._process(), this;
|
|
1662
1662
|
},
|
|
1663
1663
|
/**
|
|
1664
1664
|
* Finalizes the hash computation.
|
|
@@ -1674,8 +1674,8 @@ function $e() {
|
|
|
1674
1674
|
* var hash = hasher.finalize('message');
|
|
1675
1675
|
* var hash = hasher.finalize(wordArray);
|
|
1676
1676
|
*/
|
|
1677
|
-
finalize: function(
|
|
1678
|
-
|
|
1677
|
+
finalize: function(F) {
|
|
1678
|
+
F && this._append(F);
|
|
1679
1679
|
var P = this._doFinalize();
|
|
1680
1680
|
return P;
|
|
1681
1681
|
},
|
|
@@ -1693,9 +1693,9 @@ function $e() {
|
|
|
1693
1693
|
*
|
|
1694
1694
|
* var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);
|
|
1695
1695
|
*/
|
|
1696
|
-
_createHelper: function(
|
|
1696
|
+
_createHelper: function(F) {
|
|
1697
1697
|
return function(P, T) {
|
|
1698
|
-
return new
|
|
1698
|
+
return new F.init(T).finalize(P);
|
|
1699
1699
|
};
|
|
1700
1700
|
},
|
|
1701
1701
|
/**
|
|
@@ -1711,9 +1711,9 @@ function $e() {
|
|
|
1711
1711
|
*
|
|
1712
1712
|
* var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);
|
|
1713
1713
|
*/
|
|
1714
|
-
_createHmacHelper: function(
|
|
1714
|
+
_createHmacHelper: function(F) {
|
|
1715
1715
|
return function(P, T) {
|
|
1716
|
-
return new z.HMAC.init(
|
|
1716
|
+
return new z.HMAC.init(F, T).finalize(P);
|
|
1717
1717
|
};
|
|
1718
1718
|
}
|
|
1719
1719
|
});
|
|
@@ -1722,10 +1722,10 @@ function $e() {
|
|
|
1722
1722
|
}(Math);
|
|
1723
1723
|
return t;
|
|
1724
1724
|
});
|
|
1725
|
-
}(
|
|
1725
|
+
}(Or)), Or.exports;
|
|
1726
1726
|
}
|
|
1727
|
-
var
|
|
1728
|
-
function
|
|
1727
|
+
var zr = { exports: {} }, ci;
|
|
1728
|
+
function Er() {
|
|
1729
1729
|
return ci || (ci = 1, function(f, e) {
|
|
1730
1730
|
(function(t, r) {
|
|
1731
1731
|
f.exports = r($e());
|
|
@@ -1952,9 +1952,9 @@ function Ar() {
|
|
|
1952
1952
|
});
|
|
1953
1953
|
}(), t;
|
|
1954
1954
|
});
|
|
1955
|
-
}(
|
|
1955
|
+
}(zr)), zr.exports;
|
|
1956
1956
|
}
|
|
1957
|
-
var
|
|
1957
|
+
var Nr = { exports: {} }, di;
|
|
1958
1958
|
function Da() {
|
|
1959
1959
|
return di || (di = 1, function(f, e) {
|
|
1960
1960
|
(function(t, r) {
|
|
@@ -1974,9 +1974,9 @@ function Da() {
|
|
|
1974
1974
|
}
|
|
1975
1975
|
}(), t.lib.WordArray;
|
|
1976
1976
|
});
|
|
1977
|
-
}(
|
|
1977
|
+
}(Nr)), Nr.exports;
|
|
1978
1978
|
}
|
|
1979
|
-
var
|
|
1979
|
+
var qr = { exports: {} }, hi;
|
|
1980
1980
|
function Ra() {
|
|
1981
1981
|
return hi || (hi = 1, function(f, e) {
|
|
1982
1982
|
(function(t, r) {
|
|
@@ -2068,10 +2068,10 @@ function Ra() {
|
|
|
2068
2068
|
}
|
|
2069
2069
|
}(), t.enc.Utf16;
|
|
2070
2070
|
});
|
|
2071
|
-
}(
|
|
2071
|
+
}(qr)), qr.exports;
|
|
2072
2072
|
}
|
|
2073
|
-
var
|
|
2074
|
-
function
|
|
2073
|
+
var Lr = { exports: {} }, ui;
|
|
2074
|
+
function kt() {
|
|
2075
2075
|
return ui || (ui = 1, function(f, e) {
|
|
2076
2076
|
(function(t, r) {
|
|
2077
2077
|
f.exports = r($e());
|
|
@@ -2096,8 +2096,8 @@ function Rt() {
|
|
|
2096
2096
|
var o = u.words, c = u.sigBytes, v = this._map;
|
|
2097
2097
|
u.clamp();
|
|
2098
2098
|
for (var b = [], B = 0; B < c; B += 3)
|
|
2099
|
-
for (var w = o[B >>> 2] >>> 24 - B % 4 * 8 & 255, R = o[B + 1 >>> 2] >>> 24 - (B + 1) % 4 * 8 & 255, k = o[B + 2 >>> 2] >>> 24 - (B + 2) % 4 * 8 & 255, z = w << 16 | R << 8 | k,
|
|
2100
|
-
b.push(v.charAt(z >>> 6 * (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
2101
|
var P = v.charAt(64);
|
|
2102
2102
|
if (P)
|
|
2103
2103
|
for (; b.length % 4; )
|
|
@@ -2143,9 +2143,9 @@ function Rt() {
|
|
|
2143
2143
|
}
|
|
2144
2144
|
}(), t.enc.Base64;
|
|
2145
2145
|
});
|
|
2146
|
-
}(
|
|
2146
|
+
}(Lr)), Lr.exports;
|
|
2147
2147
|
}
|
|
2148
|
-
var
|
|
2148
|
+
var Hr = { exports: {} }, li;
|
|
2149
2149
|
function ka() {
|
|
2150
2150
|
return li || (li = 1, function(f, e) {
|
|
2151
2151
|
(function(t, r) {
|
|
@@ -2174,8 +2174,8 @@ function ka() {
|
|
|
2174
2174
|
var c = u.words, v = u.sigBytes, b = o ? this._safe_map : this._map;
|
|
2175
2175
|
u.clamp();
|
|
2176
2176
|
for (var B = [], w = 0; w < v; w += 3)
|
|
2177
|
-
for (var R = c[w >>> 2] >>> 24 - w % 4 * 8 & 255, k = c[w + 1 >>> 2] >>> 24 - (w + 1) % 4 * 8 & 255, z = c[w + 2 >>> 2] >>> 24 - (w + 2) % 4 * 8 & 255,
|
|
2178
|
-
B.push(b.charAt(
|
|
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
2179
|
var T = b.charAt(64);
|
|
2180
2180
|
if (T)
|
|
2181
2181
|
for (; B.length % 4; )
|
|
@@ -2225,10 +2225,10 @@ function ka() {
|
|
|
2225
2225
|
}
|
|
2226
2226
|
}(), t.enc.Base64url;
|
|
2227
2227
|
});
|
|
2228
|
-
}(
|
|
2228
|
+
}(Hr)), Hr.exports;
|
|
2229
2229
|
}
|
|
2230
|
-
var
|
|
2231
|
-
function
|
|
2230
|
+
var Ur = { exports: {} }, xi;
|
|
2231
|
+
function Pt() {
|
|
2232
2232
|
return xi || (xi = 1, function(f, e) {
|
|
2233
2233
|
(function(t, r) {
|
|
2234
2234
|
f.exports = r($e());
|
|
@@ -2250,17 +2250,17 @@ function kt() {
|
|
|
2250
2250
|
},
|
|
2251
2251
|
_doProcessBlock: function(R, k) {
|
|
2252
2252
|
for (var z = 0; z < 16; z++) {
|
|
2253
|
-
var
|
|
2254
|
-
R[
|
|
2253
|
+
var F = k + z, P = R[F];
|
|
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],
|
|
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,
|
|
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;
|
|
2258
2258
|
},
|
|
2259
2259
|
_doFinalize: function() {
|
|
2260
|
-
var R = this._data, k = R.words, z = this._nDataBytes * 8,
|
|
2261
|
-
k[
|
|
2260
|
+
var R = this._data, k = R.words, z = this._nDataBytes * 8, F = R.sigBytes * 8;
|
|
2261
|
+
k[F >>> 5] |= 128 << 24 - F % 32;
|
|
2262
2262
|
var P = r.floor(z / 4294967296), T = z;
|
|
2263
|
-
k[(
|
|
2263
|
+
k[(F + 64 >>> 9 << 4) + 15] = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360, k[(F + 64 >>> 9 << 4) + 14] = (T << 8 | T >>> 24) & 16711935 | (T << 24 | T >>> 8) & 4278255360, R.sigBytes = (k.length + 1) * 4, this._process();
|
|
2264
2264
|
for (var H = this._hash, $ = H.words, Y = 0; Y < 4; Y++) {
|
|
2265
2265
|
var X = $[Y];
|
|
2266
2266
|
$[Y] = (X << 8 | X >>> 24) & 16711935 | (X << 24 | X >>> 8) & 4278255360;
|
|
@@ -2272,28 +2272,28 @@ function kt() {
|
|
|
2272
2272
|
return R._hash = this._hash.clone(), R;
|
|
2273
2273
|
}
|
|
2274
2274
|
});
|
|
2275
|
-
function v(R, k, z,
|
|
2276
|
-
var $ = R + (k & z | ~k &
|
|
2275
|
+
function v(R, k, z, F, P, T, H) {
|
|
2276
|
+
var $ = R + (k & z | ~k & F) + P + H;
|
|
2277
2277
|
return ($ << T | $ >>> 32 - T) + k;
|
|
2278
2278
|
}
|
|
2279
|
-
function b(R, k, z,
|
|
2280
|
-
var $ = R + (k &
|
|
2279
|
+
function b(R, k, z, F, P, T, H) {
|
|
2280
|
+
var $ = R + (k & F | z & ~F) + P + H;
|
|
2281
2281
|
return ($ << T | $ >>> 32 - T) + k;
|
|
2282
2282
|
}
|
|
2283
|
-
function B(R, k, z,
|
|
2284
|
-
var $ = R + (k ^ z ^
|
|
2283
|
+
function B(R, k, z, F, P, T, H) {
|
|
2284
|
+
var $ = R + (k ^ z ^ F) + P + H;
|
|
2285
2285
|
return ($ << T | $ >>> 32 - T) + k;
|
|
2286
2286
|
}
|
|
2287
|
-
function w(R, k, z,
|
|
2288
|
-
var $ = R + (z ^ (k | ~
|
|
2287
|
+
function w(R, k, z, F, P, T, H) {
|
|
2288
|
+
var $ = R + (z ^ (k | ~F)) + P + H;
|
|
2289
2289
|
return ($ << T | $ >>> 32 - T) + k;
|
|
2290
2290
|
}
|
|
2291
2291
|
a.MD5 = x._createHelper(c), a.HmacMD5 = x._createHmacHelper(c);
|
|
2292
2292
|
}(Math), t.MD5;
|
|
2293
2293
|
});
|
|
2294
|
-
}(
|
|
2294
|
+
}(Ur)), Ur.exports;
|
|
2295
2295
|
}
|
|
2296
|
-
var
|
|
2296
|
+
var $r = { exports: {} }, vi;
|
|
2297
2297
|
function yn() {
|
|
2298
2298
|
return vi || (vi = 1, function(f, e) {
|
|
2299
2299
|
(function(t, r) {
|
|
@@ -2311,15 +2311,15 @@ function yn() {
|
|
|
2311
2311
|
]);
|
|
2312
2312
|
},
|
|
2313
2313
|
_doProcessBlock: function(c, v) {
|
|
2314
|
-
for (var b = this._hash.words, B = b[0], w = b[1], R = b[2], k = b[3], z = b[4],
|
|
2315
|
-
if (
|
|
2316
|
-
u[
|
|
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++) {
|
|
2315
|
+
if (F < 16)
|
|
2316
|
+
u[F] = c[v + F] | 0;
|
|
2317
2317
|
else {
|
|
2318
|
-
var P = u[
|
|
2319
|
-
u[
|
|
2318
|
+
var P = u[F - 3] ^ u[F - 8] ^ u[F - 14] ^ u[F - 16];
|
|
2319
|
+
u[F] = P << 1 | P >>> 31;
|
|
2320
2320
|
}
|
|
2321
|
-
var T = (B << 5 | B >>> 27) + z + u[
|
|
2322
|
-
|
|
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;
|
|
2323
2323
|
}
|
|
2324
2324
|
b[0] = b[0] + B | 0, b[1] = b[1] + w | 0, b[2] = b[2] + R | 0, b[3] = b[3] + k | 0, b[4] = b[4] + z | 0;
|
|
2325
2325
|
},
|
|
@@ -2335,9 +2335,9 @@ function yn() {
|
|
|
2335
2335
|
r.SHA1 = y._createHelper(o), r.HmacSHA1 = y._createHmacHelper(o);
|
|
2336
2336
|
}(), t.SHA1;
|
|
2337
2337
|
});
|
|
2338
|
-
}(
|
|
2338
|
+
}($r)), $r.exports;
|
|
2339
2339
|
}
|
|
2340
|
-
var
|
|
2340
|
+
var Wr = { exports: {} }, bi;
|
|
2341
2341
|
function Lf() {
|
|
2342
2342
|
return bi || (bi = 1, function(f, e) {
|
|
2343
2343
|
(function(t, r) {
|
|
@@ -2347,7 +2347,7 @@ function Lf() {
|
|
|
2347
2347
|
var a = t, i = a.lib, y = i.WordArray, x = i.Hasher, u = a.algo, o = [], c = [];
|
|
2348
2348
|
(function() {
|
|
2349
2349
|
function B(z) {
|
|
2350
|
-
for (var
|
|
2350
|
+
for (var F = r.sqrt(z), P = 2; P <= F; P++)
|
|
2351
2351
|
if (!(z % P))
|
|
2352
2352
|
return !1;
|
|
2353
2353
|
return !0;
|
|
@@ -2363,17 +2363,17 @@ function Lf() {
|
|
|
2363
2363
|
this._hash = new y.init(o.slice(0));
|
|
2364
2364
|
},
|
|
2365
2365
|
_doProcessBlock: function(B, w) {
|
|
2366
|
-
for (var R = this._hash.words, k = R[0], z = R[1],
|
|
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
2368
|
v[X] = B[w + X] | 0;
|
|
2369
2369
|
else {
|
|
2370
2370
|
var Q = v[X - 15], U = (Q << 25 | Q >>> 7) ^ (Q << 14 | Q >>> 18) ^ Q >>> 3, A = v[X - 2], n = (A << 15 | A >>> 17) ^ (A << 13 | A >>> 19) ^ A >>> 10;
|
|
2371
2371
|
v[X] = U + v[X - 7] + n + v[X - 16];
|
|
2372
2372
|
}
|
|
2373
|
-
var d = T & H ^ ~T & $, g = k & z ^ k &
|
|
2374
|
-
Y = $, $ = H, H = T, T = P + N | 0, P =
|
|
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;
|
|
2374
|
+
Y = $, $ = H, H = T, T = P + N | 0, P = F, F = z, z = k, k = N + q | 0;
|
|
2375
2375
|
}
|
|
2376
|
-
R[0] = R[0] + k | 0, R[1] = R[1] + z | 0, R[2] = R[2] +
|
|
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
2379
|
var B = this._data, w = B.words, R = this._nDataBytes * 8, k = B.sigBytes * 8;
|
|
@@ -2387,9 +2387,9 @@ function Lf() {
|
|
|
2387
2387
|
a.SHA256 = x._createHelper(b), a.HmacSHA256 = x._createHmacHelper(b);
|
|
2388
2388
|
}(Math), t.SHA256;
|
|
2389
2389
|
});
|
|
2390
|
-
}(
|
|
2390
|
+
}(Wr)), Wr.exports;
|
|
2391
2391
|
}
|
|
2392
|
-
var
|
|
2392
|
+
var Kr = { exports: {} }, pi;
|
|
2393
2393
|
function Pa() {
|
|
2394
2394
|
return pi || (pi = 1, function(f, e) {
|
|
2395
2395
|
(function(t, r, a) {
|
|
@@ -2417,13 +2417,13 @@ function Pa() {
|
|
|
2417
2417
|
r.SHA224 = x._createHelper(u), r.HmacSHA224 = x._createHmacHelper(u);
|
|
2418
2418
|
}(), t.SHA224;
|
|
2419
2419
|
});
|
|
2420
|
-
}(
|
|
2420
|
+
}(Kr)), Kr.exports;
|
|
2421
2421
|
}
|
|
2422
|
-
var
|
|
2422
|
+
var Yr = { exports: {} }, yi;
|
|
2423
2423
|
function gn() {
|
|
2424
2424
|
return yi || (yi = 1, function(f, e) {
|
|
2425
2425
|
(function(t, r, a) {
|
|
2426
|
-
f.exports = r($e(),
|
|
2426
|
+
f.exports = r($e(), Er());
|
|
2427
2427
|
})(Pe, function(t) {
|
|
2428
2428
|
return function() {
|
|
2429
2429
|
var r = t, a = r.lib, i = a.Hasher, y = r.x64, x = y.Word, u = y.WordArray, o = r.algo;
|
|
@@ -2530,24 +2530,24 @@ function gn() {
|
|
|
2530
2530
|
]);
|
|
2531
2531
|
},
|
|
2532
2532
|
_doProcessBlock: function(w, R) {
|
|
2533
|
-
for (var k = this._hash.words, z = k[0],
|
|
2534
|
-
var
|
|
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];
|
|
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],
|
|
2539
|
-
|
|
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;
|
|
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 &
|
|
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 =
|
|
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);
|
|
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 =
|
|
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);
|
|
2545
2545
|
},
|
|
2546
2546
|
_doFinalize: function() {
|
|
2547
2547
|
var w = this._data, R = w.words, k = this._nDataBytes * 8, z = w.sigBytes * 8;
|
|
2548
2548
|
R[z >>> 5] |= 128 << 24 - z % 32, R[(z + 128 >>> 10 << 5) + 30] = Math.floor(k / 4294967296), R[(z + 128 >>> 10 << 5) + 31] = k, w.sigBytes = R.length * 4, this._process();
|
|
2549
|
-
var
|
|
2550
|
-
return
|
|
2549
|
+
var F = this._hash.toX32();
|
|
2550
|
+
return F;
|
|
2551
2551
|
},
|
|
2552
2552
|
clone: function() {
|
|
2553
2553
|
var w = i.clone.call(this);
|
|
@@ -2558,13 +2558,13 @@ function gn() {
|
|
|
2558
2558
|
r.SHA512 = i._createHelper(B), r.HmacSHA512 = i._createHmacHelper(B);
|
|
2559
2559
|
}(), t.SHA512;
|
|
2560
2560
|
});
|
|
2561
|
-
}(
|
|
2561
|
+
}(Yr)), Yr.exports;
|
|
2562
2562
|
}
|
|
2563
|
-
var
|
|
2563
|
+
var jr = { exports: {} }, gi;
|
|
2564
2564
|
function Ia() {
|
|
2565
2565
|
return gi || (gi = 1, function(f, e) {
|
|
2566
2566
|
(function(t, r, a) {
|
|
2567
|
-
f.exports = r($e(),
|
|
2567
|
+
f.exports = r($e(), Er(), gn());
|
|
2568
2568
|
})(Pe, function(t) {
|
|
2569
2569
|
return function() {
|
|
2570
2570
|
var r = t, a = r.x64, i = a.Word, y = a.WordArray, x = r.algo, u = x.SHA512, o = x.SHA384 = u.extend({
|
|
@@ -2588,19 +2588,19 @@ function Ia() {
|
|
|
2588
2588
|
r.SHA384 = u._createHelper(o), r.HmacSHA384 = u._createHmacHelper(o);
|
|
2589
2589
|
}(), t.SHA384;
|
|
2590
2590
|
});
|
|
2591
|
-
}(
|
|
2591
|
+
}(jr)), jr.exports;
|
|
2592
2592
|
}
|
|
2593
|
-
var
|
|
2593
|
+
var Vr = { exports: {} }, mi;
|
|
2594
2594
|
function Ta() {
|
|
2595
2595
|
return mi || (mi = 1, function(f, e) {
|
|
2596
2596
|
(function(t, r, a) {
|
|
2597
|
-
f.exports = r($e(),
|
|
2597
|
+
f.exports = r($e(), Er());
|
|
2598
2598
|
})(Pe, function(t) {
|
|
2599
2599
|
return function(r) {
|
|
2600
2600
|
var a = t, i = a.lib, y = i.WordArray, x = i.Hasher, u = a.x64, o = u.Word, c = a.algo, v = [], b = [], B = [];
|
|
2601
2601
|
(function() {
|
|
2602
|
-
for (var k = 1, z = 0,
|
|
2603
|
-
v[k + 5 * z] = (
|
|
2602
|
+
for (var k = 1, z = 0, F = 0; F < 24; F++) {
|
|
2603
|
+
v[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
|
}
|
|
@@ -2641,48 +2641,48 @@ function Ta() {
|
|
|
2641
2641
|
this.blockSize = (1600 - 2 * this.cfg.outputLength) / 32;
|
|
2642
2642
|
},
|
|
2643
2643
|
_doProcessBlock: function(k, z) {
|
|
2644
|
-
for (var
|
|
2644
|
+
for (var F = this._state, P = this.blockSize / 2, T = 0; T < P; T++) {
|
|
2645
2645
|
var H = k[z + 2 * T], $ = k[z + 2 * T + 1];
|
|
2646
2646
|
H = (H << 8 | H >>> 24) & 16711935 | (H << 24 | H >>> 8) & 4278255360, $ = ($ << 8 | $ >>> 24) & 16711935 | ($ << 24 | $ >>> 8) & 4278255360;
|
|
2647
|
-
var Y =
|
|
2647
|
+
var Y = F[T];
|
|
2648
2648
|
Y.high ^= $, Y.low ^= H;
|
|
2649
2649
|
}
|
|
2650
2650
|
for (var X = 0; X < 24; X++) {
|
|
2651
2651
|
for (var Q = 0; Q < 5; Q++) {
|
|
2652
2652
|
for (var U = 0, A = 0, n = 0; n < 5; n++) {
|
|
2653
|
-
var Y =
|
|
2653
|
+
var Y = F[Q + 5 * n];
|
|
2654
2654
|
U ^= Y.high, A ^= Y.low;
|
|
2655
2655
|
}
|
|
2656
2656
|
var d = w[Q];
|
|
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],
|
|
2661
|
-
var Y =
|
|
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++) {
|
|
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 =
|
|
2665
|
+
var U, A, Y = F[q], D = Y.high, h = Y.low, E = v[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
2667
|
var j = w[b[q]];
|
|
2668
2668
|
j.high = U, j.low = A;
|
|
2669
2669
|
}
|
|
2670
|
-
var K = w[0], W =
|
|
2670
|
+
var K = w[0], W = F[0];
|
|
2671
2671
|
K.high = W.high, K.low = W.low;
|
|
2672
2672
|
for (var Q = 0; Q < 5; Q++)
|
|
2673
2673
|
for (var n = 0; n < 5; n++) {
|
|
2674
|
-
var q = Q + 5 * n, Y =
|
|
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 =
|
|
2677
|
+
var Y = F[0], Ae = B[X];
|
|
2678
2678
|
Y.high ^= Ae.high, Y.low ^= Ae.low;
|
|
2679
2679
|
}
|
|
2680
2680
|
},
|
|
2681
2681
|
_doFinalize: function() {
|
|
2682
2682
|
var k = this._data, z = k.words;
|
|
2683
2683
|
this._nDataBytes * 8;
|
|
2684
|
-
var
|
|
2685
|
-
z[
|
|
2684
|
+
var F = k.sigBytes * 8, P = this.blockSize * 32;
|
|
2685
|
+
z[F >>> 5] |= 1 << 24 - F % 32, z[(r.ceil((F + 1) / P) * P >>> 5) - 1] |= 128, k.sigBytes = z.length * 4, this._process();
|
|
2686
2686
|
for (var T = this._state, H = this.cfg.outputLength / 8, $ = H / 8, Y = [], X = 0; X < $; X++) {
|
|
2687
2687
|
var Q = T[X], U = Q.high, A = Q.low;
|
|
2688
2688
|
U = (U << 8 | U >>> 24) & 16711935 | (U << 24 | U >>> 8) & 4278255360, A = (A << 8 | A >>> 24) & 16711935 | (A << 24 | A >>> 8) & 4278255360, Y.push(A), Y.push(U);
|
|
@@ -2690,17 +2690,17 @@ function Ta() {
|
|
|
2690
2690
|
return new y.init(Y, H);
|
|
2691
2691
|
},
|
|
2692
2692
|
clone: function() {
|
|
2693
|
-
for (var k = x.clone.call(this), z = k._state = this._state.slice(0),
|
|
2694
|
-
z[
|
|
2693
|
+
for (var k = x.clone.call(this), z = k._state = this._state.slice(0), F = 0; F < 25; F++)
|
|
2694
|
+
z[F] = z[F].clone();
|
|
2695
2695
|
return k;
|
|
2696
2696
|
}
|
|
2697
2697
|
});
|
|
2698
2698
|
a.SHA3 = x._createHelper(R), a.HmacSHA3 = x._createHmacHelper(R);
|
|
2699
2699
|
}(Math), t.SHA3;
|
|
2700
2700
|
});
|
|
2701
|
-
}(
|
|
2701
|
+
}(Vr)), Vr.exports;
|
|
2702
2702
|
}
|
|
2703
|
-
var
|
|
2703
|
+
var Xr = { exports: {} }, _i;
|
|
2704
2704
|
function Oa() {
|
|
2705
2705
|
return _i || (_i = 1, function(f, e) {
|
|
2706
2706
|
(function(t, r) {
|
|
@@ -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,
|
|
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;
|
|
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 +=
|
|
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;
|
|
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() {
|
|
@@ -3076,7 +3076,7 @@ function Oa() {
|
|
|
3076
3076
|
function z($, Y, X) {
|
|
3077
3077
|
return $ & Y | ~$ & X;
|
|
3078
3078
|
}
|
|
3079
|
-
function
|
|
3079
|
+
function F($, Y, X) {
|
|
3080
3080
|
return ($ | ~Y) ^ X;
|
|
3081
3081
|
}
|
|
3082
3082
|
function P($, Y, X) {
|
|
@@ -3091,9 +3091,9 @@ function Oa() {
|
|
|
3091
3091
|
a.RIPEMD160 = x._createHelper(R), a.HmacRIPEMD160 = x._createHmacHelper(R);
|
|
3092
3092
|
}(), t.RIPEMD160;
|
|
3093
3093
|
});
|
|
3094
|
-
}(
|
|
3094
|
+
}(Xr)), Xr.exports;
|
|
3095
3095
|
}
|
|
3096
|
-
var
|
|
3096
|
+
var Zr = { exports: {} }, Ai;
|
|
3097
3097
|
function Hf() {
|
|
3098
3098
|
return Ai || (Ai = 1, function(f, e) {
|
|
3099
3099
|
(function(t, r) {
|
|
@@ -3169,9 +3169,9 @@ function Hf() {
|
|
|
3169
3169
|
});
|
|
3170
3170
|
})();
|
|
3171
3171
|
});
|
|
3172
|
-
}(
|
|
3172
|
+
}(Zr)), Zr.exports;
|
|
3173
3173
|
}
|
|
3174
|
-
var
|
|
3174
|
+
var Gr = { exports: {} }, Ei;
|
|
3175
3175
|
function za() {
|
|
3176
3176
|
return Ei || (Ei = 1, function(f, e) {
|
|
3177
3177
|
(function(t, r, a) {
|
|
@@ -3218,7 +3218,7 @@ function za() {
|
|
|
3218
3218
|
* var key = kdf.compute(password, salt);
|
|
3219
3219
|
*/
|
|
3220
3220
|
compute: function(v, b) {
|
|
3221
|
-
for (var B = this.cfg, w = o.create(B.hasher, v), R = y.create(), k = y.create([1]), z = R.words,
|
|
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
3222
|
var H = w.update(b).finalize(k);
|
|
3223
3223
|
w.reset();
|
|
3224
3224
|
for (var $ = H.words, Y = $.length, X = H, Q = 1; Q < T; Q++) {
|
|
@@ -3226,7 +3226,7 @@ function za() {
|
|
|
3226
3226
|
for (var U = X.words, A = 0; A < Y; A++)
|
|
3227
3227
|
$[A] ^= U[A];
|
|
3228
3228
|
}
|
|
3229
|
-
R.concat(H),
|
|
3229
|
+
R.concat(H), F[0]++;
|
|
3230
3230
|
}
|
|
3231
3231
|
return R.sigBytes = P * 4, R;
|
|
3232
3232
|
}
|
|
@@ -3236,9 +3236,9 @@ function za() {
|
|
|
3236
3236
|
};
|
|
3237
3237
|
}(), t.PBKDF2;
|
|
3238
3238
|
});
|
|
3239
|
-
}(
|
|
3239
|
+
}(Gr)), Gr.exports;
|
|
3240
3240
|
}
|
|
3241
|
-
var
|
|
3241
|
+
var Qr = { exports: {} }, wi;
|
|
3242
3242
|
function At() {
|
|
3243
3243
|
return wi || (wi = 1, function(f, e) {
|
|
3244
3244
|
(function(t, r, a) {
|
|
@@ -3285,9 +3285,9 @@ function At() {
|
|
|
3285
3285
|
* var key = kdf.compute(password, salt);
|
|
3286
3286
|
*/
|
|
3287
3287
|
compute: function(c, v) {
|
|
3288
|
-
for (var b, B = this.cfg, w = B.hasher.create(), R = y.create(), k = R.words, z = B.keySize,
|
|
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
3289
|
b && w.update(b), b = w.update(c).finalize(v), w.reset();
|
|
3290
|
-
for (var P = 1; P <
|
|
3290
|
+
for (var P = 1; P < F; P++)
|
|
3291
3291
|
b = w.finalize(b), w.reset();
|
|
3292
3292
|
R.concat(b);
|
|
3293
3293
|
}
|
|
@@ -3299,9 +3299,9 @@ function At() {
|
|
|
3299
3299
|
};
|
|
3300
3300
|
}(), t.EvpKDF;
|
|
3301
3301
|
});
|
|
3302
|
-
}(
|
|
3302
|
+
}(Qr)), Qr.exports;
|
|
3303
3303
|
}
|
|
3304
|
-
var
|
|
3304
|
+
var Jr = { exports: {} }, Bi;
|
|
3305
3305
|
function C0() {
|
|
3306
3306
|
return Bi || (Bi = 1, function(f, e) {
|
|
3307
3307
|
(function(t, r, a) {
|
|
@@ -3522,18 +3522,18 @@ 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,
|
|
3526
|
-
g.decryptBlock(n, d), A.call(this, n, d, C), this._prevBlock =
|
|
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;
|
|
3527
3527
|
}
|
|
3528
3528
|
});
|
|
3529
3529
|
function A(n, d, g) {
|
|
3530
|
-
var C,
|
|
3531
|
-
|
|
3530
|
+
var C, S = this._iv;
|
|
3531
|
+
S ? (C = S, this._iv = r) : C = this._prevBlock;
|
|
3532
3532
|
for (var N = 0; N < g; N++)
|
|
3533
3533
|
n[d + N] ^= C[N];
|
|
3534
3534
|
}
|
|
3535
3535
|
return U;
|
|
3536
|
-
}(), z = a.pad = {},
|
|
3536
|
+
}(), z = a.pad = {}, F = z.Pkcs7 = {
|
|
3537
3537
|
/**
|
|
3538
3538
|
* Pads data using the algorithm defined in PKCS #5/7.
|
|
3539
3539
|
*
|
|
@@ -3547,7 +3547,7 @@ 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 = [],
|
|
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
3551
|
C.push(g);
|
|
3552
3552
|
var N = x.create(C, d);
|
|
3553
3553
|
U.concat(N);
|
|
@@ -3577,7 +3577,7 @@ function C0() {
|
|
|
3577
3577
|
*/
|
|
3578
3578
|
cfg: B.cfg.extend({
|
|
3579
3579
|
mode: k,
|
|
3580
|
-
padding:
|
|
3580
|
+
padding: F
|
|
3581
3581
|
}),
|
|
3582
3582
|
reset: function() {
|
|
3583
3583
|
var U;
|
|
@@ -3699,14 +3699,14 @@ 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),
|
|
3702
|
+
var g = U.createEncryptor(n, d), C = g.finalize(A), S = g.cfg;
|
|
3703
3703
|
return P.create({
|
|
3704
3704
|
ciphertext: C,
|
|
3705
3705
|
key: n,
|
|
3706
|
-
iv:
|
|
3706
|
+
iv: S.iv,
|
|
3707
3707
|
algorithm: U,
|
|
3708
|
-
mode:
|
|
3709
|
-
padding:
|
|
3708
|
+
mode: S.mode,
|
|
3709
|
+
padding: S.padding,
|
|
3710
3710
|
blockSize: U.blockSize,
|
|
3711
3711
|
formatter: d.format
|
|
3712
3712
|
});
|
|
@@ -3774,8 +3774,8 @@ function C0() {
|
|
|
3774
3774
|
var C = b.create({ keySize: A + n, hasher: g }).compute(U, d);
|
|
3775
3775
|
else
|
|
3776
3776
|
var C = b.create({ keySize: A + n }).compute(U, d);
|
|
3777
|
-
var
|
|
3778
|
-
return C.sigBytes = A * 4, P.create({ key: C, iv:
|
|
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 });
|
|
3779
3779
|
}
|
|
3780
3780
|
}, Q = i.PasswordBasedCipher = $.extend({
|
|
3781
3781
|
/**
|
|
@@ -3837,9 +3837,9 @@ function C0() {
|
|
|
3837
3837
|
});
|
|
3838
3838
|
}();
|
|
3839
3839
|
});
|
|
3840
|
-
}(
|
|
3840
|
+
}(Jr)), Jr.exports;
|
|
3841
3841
|
}
|
|
3842
|
-
var
|
|
3842
|
+
var ef = { exports: {} }, Ci;
|
|
3843
3843
|
function Na() {
|
|
3844
3844
|
return Ci || (Ci = 1, function(f, e) {
|
|
3845
3845
|
(function(t, r, a) {
|
|
@@ -3867,9 +3867,9 @@ function Na() {
|
|
|
3867
3867
|
return r;
|
|
3868
3868
|
}(), t.mode.CFB;
|
|
3869
3869
|
});
|
|
3870
|
-
}(
|
|
3870
|
+
}(ef)), ef.exports;
|
|
3871
3871
|
}
|
|
3872
|
-
var
|
|
3872
|
+
var tf = { exports: {} }, Mi;
|
|
3873
3873
|
function qa() {
|
|
3874
3874
|
return Mi || (Mi = 1, function(f, e) {
|
|
3875
3875
|
(function(t, r, a) {
|
|
@@ -3889,11 +3889,11 @@ function qa() {
|
|
|
3889
3889
|
return r.Decryptor = a, r;
|
|
3890
3890
|
}(), t.mode.CTR;
|
|
3891
3891
|
});
|
|
3892
|
-
}(
|
|
3892
|
+
}(tf)), tf.exports;
|
|
3893
3893
|
}
|
|
3894
|
-
var
|
|
3894
|
+
var rf = { exports: {} }, Si;
|
|
3895
3895
|
function La() {
|
|
3896
|
-
return
|
|
3896
|
+
return Si || (Si = 1, function(f, e) {
|
|
3897
3897
|
(function(t, r, a) {
|
|
3898
3898
|
f.exports = r($e(), C0());
|
|
3899
3899
|
})(Pe, function(t) {
|
|
@@ -3928,11 +3928,11 @@ function La() {
|
|
|
3928
3928
|
return r.Decryptor = y, r;
|
|
3929
3929
|
}(), t.mode.CTRGladman;
|
|
3930
3930
|
});
|
|
3931
|
-
}(
|
|
3931
|
+
}(rf)), rf.exports;
|
|
3932
3932
|
}
|
|
3933
|
-
var
|
|
3933
|
+
var ff = { exports: {} }, Fi;
|
|
3934
3934
|
function Ha() {
|
|
3935
|
-
return
|
|
3935
|
+
return Fi || (Fi = 1, function(f, e) {
|
|
3936
3936
|
(function(t, r, a) {
|
|
3937
3937
|
f.exports = r($e(), C0());
|
|
3938
3938
|
})(Pe, function(t) {
|
|
@@ -3948,9 +3948,9 @@ function Ha() {
|
|
|
3948
3948
|
return r.Decryptor = a, r;
|
|
3949
3949
|
}(), t.mode.OFB;
|
|
3950
3950
|
});
|
|
3951
|
-
}(
|
|
3951
|
+
}(ff)), ff.exports;
|
|
3952
3952
|
}
|
|
3953
|
-
var
|
|
3953
|
+
var nf = { exports: {} }, Di;
|
|
3954
3954
|
function Ua() {
|
|
3955
3955
|
return Di || (Di = 1, function(f, e) {
|
|
3956
3956
|
(function(t, r, a) {
|
|
@@ -3969,9 +3969,9 @@ function Ua() {
|
|
|
3969
3969
|
}), r;
|
|
3970
3970
|
}(), t.mode.ECB;
|
|
3971
3971
|
});
|
|
3972
|
-
}(
|
|
3972
|
+
}(nf)), nf.exports;
|
|
3973
3973
|
}
|
|
3974
|
-
var
|
|
3974
|
+
var af = { exports: {} }, Ri;
|
|
3975
3975
|
function $a() {
|
|
3976
3976
|
return Ri || (Ri = 1, function(f, e) {
|
|
3977
3977
|
(function(t, r, a) {
|
|
@@ -3988,9 +3988,9 @@ function $a() {
|
|
|
3988
3988
|
}
|
|
3989
3989
|
}, t.pad.Ansix923;
|
|
3990
3990
|
});
|
|
3991
|
-
}(
|
|
3991
|
+
}(af)), af.exports;
|
|
3992
3992
|
}
|
|
3993
|
-
var
|
|
3993
|
+
var sf = { exports: {} }, ki;
|
|
3994
3994
|
function Wa() {
|
|
3995
3995
|
return ki || (ki = 1, function(f, e) {
|
|
3996
3996
|
(function(t, r, a) {
|
|
@@ -4007,9 +4007,9 @@ function Wa() {
|
|
|
4007
4007
|
}
|
|
4008
4008
|
}, t.pad.Iso10126;
|
|
4009
4009
|
});
|
|
4010
|
-
}(
|
|
4010
|
+
}(sf)), sf.exports;
|
|
4011
4011
|
}
|
|
4012
|
-
var
|
|
4012
|
+
var of = { exports: {} }, Pi;
|
|
4013
4013
|
function Ka() {
|
|
4014
4014
|
return Pi || (Pi = 1, function(f, e) {
|
|
4015
4015
|
(function(t, r, a) {
|
|
@@ -4024,9 +4024,9 @@ function Ka() {
|
|
|
4024
4024
|
}
|
|
4025
4025
|
}, t.pad.Iso97971;
|
|
4026
4026
|
});
|
|
4027
|
-
}(
|
|
4027
|
+
}(of)), of.exports;
|
|
4028
4028
|
}
|
|
4029
|
-
var
|
|
4029
|
+
var cf = { exports: {} }, Ii;
|
|
4030
4030
|
function Ya() {
|
|
4031
4031
|
return Ii || (Ii = 1, function(f, e) {
|
|
4032
4032
|
(function(t, r, a) {
|
|
@@ -4046,9 +4046,9 @@ function Ya() {
|
|
|
4046
4046
|
}
|
|
4047
4047
|
}, t.pad.ZeroPadding;
|
|
4048
4048
|
});
|
|
4049
|
-
}(
|
|
4049
|
+
}(cf)), cf.exports;
|
|
4050
4050
|
}
|
|
4051
|
-
var
|
|
4051
|
+
var df = { exports: {} }, Ti;
|
|
4052
4052
|
function ja() {
|
|
4053
4053
|
return Ti || (Ti = 1, function(f, e) {
|
|
4054
4054
|
(function(t, r, a) {
|
|
@@ -4061,9 +4061,9 @@ function ja() {
|
|
|
4061
4061
|
}
|
|
4062
4062
|
}, t.pad.NoPadding;
|
|
4063
4063
|
});
|
|
4064
|
-
}(
|
|
4064
|
+
}(df)), df.exports;
|
|
4065
4065
|
}
|
|
4066
|
-
var
|
|
4066
|
+
var hf = { exports: {} }, Oi;
|
|
4067
4067
|
function Va() {
|
|
4068
4068
|
return Oi || (Oi = 1, function(f, e) {
|
|
4069
4069
|
(function(t, r, a) {
|
|
@@ -4108,13 +4108,13 @@ function Va() {
|
|
|
4108
4108
|
};
|
|
4109
4109
|
}(), t.format.Hex;
|
|
4110
4110
|
});
|
|
4111
|
-
}(
|
|
4111
|
+
}(hf)), hf.exports;
|
|
4112
4112
|
}
|
|
4113
|
-
var
|
|
4113
|
+
var uf = { exports: {} }, zi;
|
|
4114
4114
|
function Xa() {
|
|
4115
4115
|
return zi || (zi = 1, function(f, e) {
|
|
4116
4116
|
(function(t, r, a) {
|
|
4117
|
-
f.exports = r($e(),
|
|
4117
|
+
f.exports = r($e(), kt(), Pt(), At(), C0());
|
|
4118
4118
|
})(Pe, function(t) {
|
|
4119
4119
|
return function() {
|
|
4120
4120
|
var r = t, a = r.lib, i = a.BlockCipher, y = r.algo, x = [], u = [], o = [], c = [], v = [], b = [], B = [], w = [], R = [], k = [];
|
|
@@ -4130,7 +4130,7 @@ function Xa() {
|
|
|
4130
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;
|
|
4131
4131
|
}
|
|
4132
4132
|
})();
|
|
4133
|
-
var z = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54],
|
|
4133
|
+
var z = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], F = y.AES = i.extend({
|
|
4134
4134
|
_doReset: function() {
|
|
4135
4135
|
var P;
|
|
4136
4136
|
if (!(this._nRounds && this._keyPriorReset === this._key)) {
|
|
@@ -4156,25 +4156,25 @@ function Xa() {
|
|
|
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],
|
|
4160
|
-
var q = $[n >>> 24] ^ Y[d >>> 16 & 255] ^ X[g >>> 8 & 255] ^ Q[C & 255] ^ H[
|
|
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
4161
|
n = q, d = D, g = h, C = E;
|
|
4162
4162
|
}
|
|
4163
|
-
var q = (U[n >>> 24] << 24 | U[d >>> 16 & 255] << 16 | U[g >>> 8 & 255] << 8 | U[C & 255]) ^ H[
|
|
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++];
|
|
4164
4164
|
P[T] = q, P[T + 1] = D, P[T + 2] = h, P[T + 3] = E;
|
|
4165
4165
|
},
|
|
4166
4166
|
keySize: 256 / 32
|
|
4167
4167
|
});
|
|
4168
|
-
r.AES = i._createHelper(
|
|
4168
|
+
r.AES = i._createHelper(F);
|
|
4169
4169
|
}(), t.AES;
|
|
4170
4170
|
});
|
|
4171
|
-
}(
|
|
4171
|
+
}(uf)), uf.exports;
|
|
4172
4172
|
}
|
|
4173
|
-
var
|
|
4173
|
+
var lf = { exports: {} }, Ni;
|
|
4174
4174
|
function Za() {
|
|
4175
4175
|
return Ni || (Ni = 1, function(f, e) {
|
|
4176
4176
|
(function(t, r, a) {
|
|
4177
|
-
f.exports = r($e(),
|
|
4177
|
+
f.exports = r($e(), kt(), Pt(), At(), C0());
|
|
4178
4178
|
})(Pe, function(t) {
|
|
4179
4179
|
return function() {
|
|
4180
4180
|
var r = t, a = r.lib, i = a.WordArray, y = a.BlockCipher, x = r.algo, u = [
|
|
@@ -4823,9 +4823,9 @@ function Za() {
|
|
|
4823
4823
|
2147483679
|
|
4824
4824
|
], B = x.DES = y.extend({
|
|
4825
4825
|
_doReset: function() {
|
|
4826
|
-
for (var z = this._key,
|
|
4826
|
+
for (var z = this._key, F = z.words, P = [], T = 0; T < 56; T++) {
|
|
4827
4827
|
var H = u[T] - 1;
|
|
4828
|
-
P[T] =
|
|
4828
|
+
P[T] = F[H >>> 5] >>> 31 - H % 32 & 1;
|
|
4829
4829
|
}
|
|
4830
4830
|
for (var $ = this._subKeys = [], Y = 0; Y < 16; Y++) {
|
|
4831
4831
|
for (var X = $[Y] = [], Q = c[Y], T = 0; T < 24; T++)
|
|
@@ -4838,48 +4838,48 @@ function Za() {
|
|
|
4838
4838
|
for (var U = this._invSubKeys = [], T = 0; T < 16; T++)
|
|
4839
4839
|
U[T] = $[15 - T];
|
|
4840
4840
|
},
|
|
4841
|
-
encryptBlock: function(z,
|
|
4842
|
-
this._doCryptBlock(z,
|
|
4841
|
+
encryptBlock: function(z, F) {
|
|
4842
|
+
this._doCryptBlock(z, F, this._subKeys);
|
|
4843
4843
|
},
|
|
4844
|
-
decryptBlock: function(z,
|
|
4845
|
-
this._doCryptBlock(z,
|
|
4844
|
+
decryptBlock: function(z, F) {
|
|
4845
|
+
this._doCryptBlock(z, F, this._invSubKeys);
|
|
4846
4846
|
},
|
|
4847
|
-
_doCryptBlock: function(z,
|
|
4848
|
-
this._lBlock = z[
|
|
4847
|
+
_doCryptBlock: function(z, F, P) {
|
|
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
4851
|
X |= v[Q][((Y ^ H[Q]) & b[Q]) >>> 0];
|
|
4852
4852
|
this._lBlock = Y, this._rBlock = $ ^ X;
|
|
4853
4853
|
}
|
|
4854
4854
|
var U = this._lBlock;
|
|
4855
|
-
this._lBlock = this._rBlock, this._rBlock = U, w.call(this, 1, 1431655765), R.call(this, 8, 16711935), R.call(this, 2, 858993459), w.call(this, 16, 65535), w.call(this, 4, 252645135), z[
|
|
4855
|
+
this._lBlock = this._rBlock, this._rBlock = U, w.call(this, 1, 1431655765), R.call(this, 8, 16711935), R.call(this, 2, 858993459), w.call(this, 16, 65535), w.call(this, 4, 252645135), z[F] = this._lBlock, z[F + 1] = this._rBlock;
|
|
4856
4856
|
},
|
|
4857
4857
|
keySize: 64 / 32,
|
|
4858
4858
|
ivSize: 64 / 32,
|
|
4859
4859
|
blockSize: 64 / 32
|
|
4860
4860
|
});
|
|
4861
|
-
function w(z,
|
|
4862
|
-
var P = (this._lBlock >>> z ^ this._rBlock) &
|
|
4861
|
+
function w(z, F) {
|
|
4862
|
+
var P = (this._lBlock >>> z ^ this._rBlock) & F;
|
|
4863
4863
|
this._rBlock ^= P, this._lBlock ^= P << z;
|
|
4864
4864
|
}
|
|
4865
|
-
function R(z,
|
|
4866
|
-
var P = (this._rBlock >>> z ^ this._lBlock) &
|
|
4865
|
+
function R(z, F) {
|
|
4866
|
+
var P = (this._rBlock >>> z ^ this._lBlock) & F;
|
|
4867
4867
|
this._lBlock ^= P, this._rBlock ^= P << z;
|
|
4868
4868
|
}
|
|
4869
4869
|
r.DES = y._createHelper(B);
|
|
4870
4870
|
var k = x.TripleDES = y.extend({
|
|
4871
4871
|
_doReset: function() {
|
|
4872
|
-
var z = this._key,
|
|
4873
|
-
if (
|
|
4872
|
+
var z = this._key, F = z.words;
|
|
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
|
-
var P =
|
|
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
4876
|
this._des1 = B.createEncryptor(i.create(P)), this._des2 = B.createEncryptor(i.create(T)), this._des3 = B.createEncryptor(i.create(H));
|
|
4877
4877
|
},
|
|
4878
|
-
encryptBlock: function(z,
|
|
4879
|
-
this._des1.encryptBlock(z,
|
|
4878
|
+
encryptBlock: function(z, F) {
|
|
4879
|
+
this._des1.encryptBlock(z, F), this._des2.decryptBlock(z, F), this._des3.encryptBlock(z, F);
|
|
4880
4880
|
},
|
|
4881
|
-
decryptBlock: function(z,
|
|
4882
|
-
this._des3.decryptBlock(z,
|
|
4881
|
+
decryptBlock: function(z, F) {
|
|
4882
|
+
this._des3.decryptBlock(z, F), this._des2.encryptBlock(z, F), this._des1.decryptBlock(z, F);
|
|
4883
4883
|
},
|
|
4884
4884
|
keySize: 192 / 32,
|
|
4885
4885
|
ivSize: 64 / 32,
|
|
@@ -4888,13 +4888,13 @@ function Za() {
|
|
|
4888
4888
|
r.TripleDES = y._createHelper(k);
|
|
4889
4889
|
}(), t.TripleDES;
|
|
4890
4890
|
});
|
|
4891
|
-
}(
|
|
4891
|
+
}(lf)), lf.exports;
|
|
4892
4892
|
}
|
|
4893
|
-
var
|
|
4893
|
+
var xf = { exports: {} }, qi;
|
|
4894
4894
|
function Ga() {
|
|
4895
4895
|
return qi || (qi = 1, function(f, e) {
|
|
4896
4896
|
(function(t, r, a) {
|
|
4897
|
-
f.exports = r($e(),
|
|
4897
|
+
f.exports = r($e(), kt(), Pt(), At(), C0());
|
|
4898
4898
|
})(Pe, function(t) {
|
|
4899
4899
|
return function() {
|
|
4900
4900
|
var r = t, a = r.lib, i = a.StreamCipher, y = r.algo, x = y.RC4 = i.extend({
|
|
@@ -4904,8 +4904,8 @@ function Ga() {
|
|
|
4904
4904
|
for (var w = 0, R = 0; w < 256; w++) {
|
|
4905
4905
|
var k = w % b, z = v[k >>> 2] >>> 24 - k % 4 * 8 & 255;
|
|
4906
4906
|
R = (R + B[w] + z) % 256;
|
|
4907
|
-
var
|
|
4908
|
-
B[w] = B[R], B[R] =
|
|
4907
|
+
var F = B[w];
|
|
4908
|
+
B[w] = B[R], B[R] = F;
|
|
4909
4909
|
}
|
|
4910
4910
|
this._i = this._j = 0;
|
|
4911
4911
|
},
|
|
@@ -4942,13 +4942,13 @@ function Ga() {
|
|
|
4942
4942
|
r.RC4Drop = i._createHelper(o);
|
|
4943
4943
|
}(), t.RC4;
|
|
4944
4944
|
});
|
|
4945
|
-
}(
|
|
4945
|
+
}(xf)), xf.exports;
|
|
4946
4946
|
}
|
|
4947
|
-
var
|
|
4947
|
+
var vf = { exports: {} }, Li;
|
|
4948
4948
|
function Qa() {
|
|
4949
4949
|
return Li || (Li = 1, function(f, e) {
|
|
4950
4950
|
(function(t, r, a) {
|
|
4951
|
-
f.exports = r($e(),
|
|
4951
|
+
f.exports = r($e(), kt(), Pt(), At(), C0());
|
|
4952
4952
|
})(Pe, function(t) {
|
|
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({
|
|
@@ -4980,7 +4980,7 @@ function Qa() {
|
|
|
4980
4980
|
for (var w = 0; w < 8; w++)
|
|
4981
4981
|
k[w] ^= R[w + 4 & 7];
|
|
4982
4982
|
if (B) {
|
|
4983
|
-
var z = B.words,
|
|
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;
|
|
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
4986
|
v.call(this);
|
|
@@ -5000,21 +5000,21 @@ function Qa() {
|
|
|
5000
5000
|
u[w] = B[w];
|
|
5001
5001
|
B[0] = B[0] + 1295307597 + this._b | 0, B[1] = B[1] + 3545052371 + (B[0] >>> 0 < u[0] >>> 0 ? 1 : 0) | 0, B[2] = B[2] + 886263092 + (B[1] >>> 0 < u[1] >>> 0 ? 1 : 0) | 0, B[3] = B[3] + 1295307597 + (B[2] >>> 0 < u[2] >>> 0 ? 1 : 0) | 0, B[4] = B[4] + 3545052371 + (B[3] >>> 0 < u[3] >>> 0 ? 1 : 0) | 0, B[5] = B[5] + 886263092 + (B[4] >>> 0 < u[4] >>> 0 ? 1 : 0) | 0, B[6] = B[6] + 1295307597 + (B[5] >>> 0 < u[5] >>> 0 ? 1 : 0) | 0, B[7] = B[7] + 3545052371 + (B[6] >>> 0 < u[6] >>> 0 ? 1 : 0) | 0, this._b = B[7] >>> 0 < u[7] >>> 0 ? 1 : 0;
|
|
5002
5002
|
for (var w = 0; w < 8; w++) {
|
|
5003
|
-
var R = b[w] + B[w], k = R & 65535, z = R >>> 16,
|
|
5004
|
-
o[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);
|
|
5004
|
+
o[w] = F ^ P;
|
|
5005
5005
|
}
|
|
5006
5006
|
b[0] = o[0] + (o[7] << 16 | o[7] >>> 16) + (o[6] << 16 | o[6] >>> 16) | 0, b[1] = o[1] + (o[0] << 8 | o[0] >>> 24) + o[7] | 0, b[2] = o[2] + (o[1] << 16 | o[1] >>> 16) + (o[0] << 16 | o[0] >>> 16) | 0, b[3] = o[3] + (o[2] << 8 | o[2] >>> 24) + o[1] | 0, b[4] = o[4] + (o[3] << 16 | o[3] >>> 16) + (o[2] << 16 | o[2] >>> 16) | 0, b[5] = o[5] + (o[4] << 8 | o[4] >>> 24) + o[3] | 0, b[6] = o[6] + (o[5] << 16 | o[5] >>> 16) + (o[4] << 16 | o[4] >>> 16) | 0, b[7] = o[7] + (o[6] << 8 | o[6] >>> 24) + o[5] | 0;
|
|
5007
5007
|
}
|
|
5008
5008
|
r.Rabbit = i._createHelper(c);
|
|
5009
5009
|
}(), t.Rabbit;
|
|
5010
5010
|
});
|
|
5011
|
-
}(
|
|
5011
|
+
}(vf)), vf.exports;
|
|
5012
5012
|
}
|
|
5013
|
-
var
|
|
5013
|
+
var bf = { exports: {} }, Hi;
|
|
5014
5014
|
function Ja() {
|
|
5015
5015
|
return Hi || (Hi = 1, function(f, e) {
|
|
5016
5016
|
(function(t, r, a) {
|
|
5017
|
-
f.exports = r($e(),
|
|
5017
|
+
f.exports = r($e(), kt(), Pt(), At(), C0());
|
|
5018
5018
|
})(Pe, function(t) {
|
|
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({
|
|
@@ -5044,7 +5044,7 @@ function Ja() {
|
|
|
5044
5044
|
for (var k = 0; k < 8; k++)
|
|
5045
5045
|
R[k] ^= w[k + 4 & 7];
|
|
5046
5046
|
if (B) {
|
|
5047
|
-
var z = B.words,
|
|
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;
|
|
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
5050
|
v.call(this);
|
|
@@ -5064,21 +5064,21 @@ function Ja() {
|
|
|
5064
5064
|
u[w] = B[w];
|
|
5065
5065
|
B[0] = B[0] + 1295307597 + this._b | 0, B[1] = B[1] + 3545052371 + (B[0] >>> 0 < u[0] >>> 0 ? 1 : 0) | 0, B[2] = B[2] + 886263092 + (B[1] >>> 0 < u[1] >>> 0 ? 1 : 0) | 0, B[3] = B[3] + 1295307597 + (B[2] >>> 0 < u[2] >>> 0 ? 1 : 0) | 0, B[4] = B[4] + 3545052371 + (B[3] >>> 0 < u[3] >>> 0 ? 1 : 0) | 0, B[5] = B[5] + 886263092 + (B[4] >>> 0 < u[4] >>> 0 ? 1 : 0) | 0, B[6] = B[6] + 1295307597 + (B[5] >>> 0 < u[5] >>> 0 ? 1 : 0) | 0, B[7] = B[7] + 3545052371 + (B[6] >>> 0 < u[6] >>> 0 ? 1 : 0) | 0, this._b = B[7] >>> 0 < u[7] >>> 0 ? 1 : 0;
|
|
5066
5066
|
for (var w = 0; w < 8; w++) {
|
|
5067
|
-
var R = b[w] + B[w], k = R & 65535, z = R >>> 16,
|
|
5068
|
-
o[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);
|
|
5068
|
+
o[w] = F ^ P;
|
|
5069
5069
|
}
|
|
5070
5070
|
b[0] = o[0] + (o[7] << 16 | o[7] >>> 16) + (o[6] << 16 | o[6] >>> 16) | 0, b[1] = o[1] + (o[0] << 8 | o[0] >>> 24) + o[7] | 0, b[2] = o[2] + (o[1] << 16 | o[1] >>> 16) + (o[0] << 16 | o[0] >>> 16) | 0, b[3] = o[3] + (o[2] << 8 | o[2] >>> 24) + o[1] | 0, b[4] = o[4] + (o[3] << 16 | o[3] >>> 16) + (o[2] << 16 | o[2] >>> 16) | 0, b[5] = o[5] + (o[4] << 8 | o[4] >>> 24) + o[3] | 0, b[6] = o[6] + (o[5] << 16 | o[5] >>> 16) + (o[4] << 16 | o[4] >>> 16) | 0, b[7] = o[7] + (o[6] << 8 | o[6] >>> 24) + o[5] | 0;
|
|
5071
5071
|
}
|
|
5072
5072
|
r.RabbitLegacy = i._createHelper(c);
|
|
5073
5073
|
}(), t.RabbitLegacy;
|
|
5074
5074
|
});
|
|
5075
|
-
}(
|
|
5075
|
+
}(bf)), bf.exports;
|
|
5076
5076
|
}
|
|
5077
|
-
var
|
|
5077
|
+
var pf = { exports: {} }, Ui;
|
|
5078
5078
|
function es() {
|
|
5079
5079
|
return Ui || (Ui = 1, function(f, e) {
|
|
5080
5080
|
(function(t, r, a) {
|
|
5081
|
-
f.exports = r($e(),
|
|
5081
|
+
f.exports = r($e(), kt(), Pt(), At(), C0());
|
|
5082
5082
|
})(Pe, function(t) {
|
|
5083
5083
|
return function() {
|
|
5084
5084
|
var r = t, a = r.lib, i = a.BlockCipher, y = r.algo;
|
|
@@ -6140,22 +6140,22 @@ function es() {
|
|
|
6140
6140
|
sbox: []
|
|
6141
6141
|
};
|
|
6142
6142
|
function v(k, z) {
|
|
6143
|
-
let
|
|
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,
|
|
6147
|
-
let P = z, T =
|
|
6146
|
+
function b(k, z, F) {
|
|
6147
|
+
let P = z, T = F, H;
|
|
6148
6148
|
for (let $ = 0; $ < x; ++$)
|
|
6149
6149
|
P = P ^ k.pbox[$], T = v(k, P) ^ T, H = P, P = T, T = H;
|
|
6150
6150
|
return H = P, P = T, T = H, T = T ^ k.pbox[x], P = P ^ k.pbox[x + 1], { left: P, right: T };
|
|
6151
6151
|
}
|
|
6152
|
-
function B(k, z,
|
|
6153
|
-
let P = z, T =
|
|
6152
|
+
function B(k, z, F) {
|
|
6153
|
+
let P = z, T = F, H;
|
|
6154
6154
|
for (let $ = x + 1; $ > 1; --$)
|
|
6155
6155
|
P = P ^ k.pbox[$], T = v(k, P) ^ T, H = P, P = T, T = H;
|
|
6156
6156
|
return H = P, P = T, T = H, T = T ^ k.pbox[1], P = P ^ k.pbox[0], { left: P, right: T };
|
|
6157
6157
|
}
|
|
6158
|
-
function w(k, z,
|
|
6158
|
+
function w(k, z, F) {
|
|
6159
6159
|
for (let Y = 0; Y < 4; Y++) {
|
|
6160
6160
|
k.sbox[Y] = [];
|
|
6161
6161
|
for (let X = 0; X < 256; X++)
|
|
@@ -6163,7 +6163,7 @@ function es() {
|
|
|
6163
6163
|
}
|
|
6164
6164
|
let P = 0;
|
|
6165
6165
|
for (let Y = 0; Y < x + 2; Y++)
|
|
6166
|
-
k.pbox[Y] = u[Y] ^ z[P], P++, P >=
|
|
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
6169
|
$ = b(k, T, H), T = $.left, H = $.right, k.pbox[Y] = T, k.pbox[Y + 1] = H;
|
|
@@ -6175,17 +6175,17 @@ function es() {
|
|
|
6175
6175
|
var R = y.Blowfish = i.extend({
|
|
6176
6176
|
_doReset: function() {
|
|
6177
6177
|
if (this._keyPriorReset !== this._key) {
|
|
6178
|
-
var k = this._keyPriorReset = this._key, z = k.words,
|
|
6179
|
-
w(c, z,
|
|
6178
|
+
var k = this._keyPriorReset = this._key, z = k.words, F = k.sigBytes / 4;
|
|
6179
|
+
w(c, z, F);
|
|
6180
6180
|
}
|
|
6181
6181
|
},
|
|
6182
6182
|
encryptBlock: function(k, z) {
|
|
6183
|
-
var
|
|
6184
|
-
k[z] =
|
|
6183
|
+
var F = b(c, k[z], k[z + 1]);
|
|
6184
|
+
k[z] = F.left, k[z + 1] = F.right;
|
|
6185
6185
|
},
|
|
6186
6186
|
decryptBlock: function(k, z) {
|
|
6187
|
-
var
|
|
6188
|
-
k[z] =
|
|
6187
|
+
var F = B(c, k[z], k[z + 1]);
|
|
6188
|
+
k[z] = F.left, k[z + 1] = F.right;
|
|
6189
6189
|
},
|
|
6190
6190
|
blockSize: 64 / 32,
|
|
6191
6191
|
keySize: 128 / 32,
|
|
@@ -6194,11 +6194,11 @@ function es() {
|
|
|
6194
6194
|
r.Blowfish = i._createHelper(R);
|
|
6195
6195
|
}(), t.Blowfish;
|
|
6196
6196
|
});
|
|
6197
|
-
}(
|
|
6197
|
+
}(pf)), pf.exports;
|
|
6198
6198
|
}
|
|
6199
6199
|
(function(f, e) {
|
|
6200
6200
|
(function(t, r, a) {
|
|
6201
|
-
f.exports = r($e(),
|
|
6201
|
+
f.exports = r($e(), Er(), Da(), Ra(), kt(), ka(), Pt(), yn(), Lf(), Pa(), gn(), Ia(), Ta(), Oa(), Hf(), za(), At(), C0(), Na(), qa(), La(), Ha(), Ua(), $a(), Wa(), Ka(), Ya(), ja(), Va(), Xa(), Za(), Ga(), Qa(), Ja(), es());
|
|
6202
6202
|
})(Pe, function(t) {
|
|
6203
6203
|
return t;
|
|
6204
6204
|
});
|
|
@@ -6284,7 +6284,7 @@ Uf.exports;
|
|
|
6284
6284
|
typeof e == "object" ? e.exports = i : t.BN = i, i.BN = i, i.wordSize = 26;
|
|
6285
6285
|
var y;
|
|
6286
6286
|
try {
|
|
6287
|
-
typeof window < "u" && typeof window.Buffer < "u" ? y = window.Buffer : y =
|
|
6287
|
+
typeof window < "u" && typeof window.Buffer < "u" ? y = window.Buffer : y = Ar.Buffer;
|
|
6288
6288
|
} catch {
|
|
6289
6289
|
}
|
|
6290
6290
|
i.isBN = function(n) {
|
|
@@ -6316,13 +6316,13 @@ Uf.exports;
|
|
|
6316
6316
|
this.length = Math.ceil(n.length / 3), this.words = new Array(this.length);
|
|
6317
6317
|
for (var C = 0; C < this.length; C++)
|
|
6318
6318
|
this.words[C] = 0;
|
|
6319
|
-
var
|
|
6319
|
+
var S, N, q = 0;
|
|
6320
6320
|
if (g === "be")
|
|
6321
|
-
for (C = n.length - 1,
|
|
6322
|
-
N = n[C] | n[C - 1] << 8 | n[C - 2] << 16, this.words[
|
|
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++);
|
|
6323
6323
|
else if (g === "le")
|
|
6324
|
-
for (C = 0,
|
|
6325
|
-
N = n[C] | n[C + 1] << 8 | n[C + 2] << 16, this.words[
|
|
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++);
|
|
6326
6326
|
return this.strip();
|
|
6327
6327
|
};
|
|
6328
6328
|
function x(A, n) {
|
|
@@ -6337,19 +6337,19 @@ Uf.exports;
|
|
|
6337
6337
|
this.length = Math.ceil((n.length - d) / 6), this.words = new Array(this.length);
|
|
6338
6338
|
for (var C = 0; C < this.length; C++)
|
|
6339
6339
|
this.words[C] = 0;
|
|
6340
|
-
var
|
|
6340
|
+
var S = 0, N = 0, q;
|
|
6341
6341
|
if (g === "be")
|
|
6342
6342
|
for (C = n.length - 1; C >= d; C -= 2)
|
|
6343
|
-
q = u(n, d, C) <<
|
|
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;
|
|
6344
6344
|
else {
|
|
6345
6345
|
var D = n.length - d;
|
|
6346
6346
|
for (C = D % 2 === 0 ? d + 1 : d; C < n.length; C += 2)
|
|
6347
|
-
q = u(n, d, C) <<
|
|
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;
|
|
6348
6348
|
}
|
|
6349
6349
|
this.strip();
|
|
6350
6350
|
};
|
|
6351
6351
|
function o(A, n, d, g) {
|
|
6352
|
-
for (var C = 0,
|
|
6352
|
+
for (var C = 0, S = Math.min(A.length, d), N = n; N < S; N++) {
|
|
6353
6353
|
var q = A.charCodeAt(N) - 48;
|
|
6354
6354
|
C *= g, q >= 49 ? C += q - 49 + 10 : q >= 17 ? C += q - 17 + 10 : C += q;
|
|
6355
6355
|
}
|
|
@@ -6357,11 +6357,11 @@ Uf.exports;
|
|
|
6357
6357
|
}
|
|
6358
6358
|
i.prototype._parseBase = function(n, d, g) {
|
|
6359
6359
|
this.words = [0], this.length = 1;
|
|
6360
|
-
for (var C = 0,
|
|
6360
|
+
for (var C = 0, S = 1; S <= 67108863; S *= d)
|
|
6361
6361
|
C++;
|
|
6362
|
-
C--,
|
|
6362
|
+
C--, S = S / d | 0;
|
|
6363
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(
|
|
6364
|
+
h = o(n, E, E + C, 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++)
|
|
@@ -6499,11 +6499,11 @@ Uf.exports;
|
|
|
6499
6499
|
var g;
|
|
6500
6500
|
if (n === 16 || n === "hex") {
|
|
6501
6501
|
g = "";
|
|
6502
|
-
for (var C = 0,
|
|
6503
|
-
var q = this.words[N], D = ((q << C |
|
|
6504
|
-
|
|
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--);
|
|
6505
6505
|
}
|
|
6506
|
-
for (
|
|
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
|
}
|
|
@@ -6530,19 +6530,19 @@ 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(),
|
|
6534
|
-
r(C <=
|
|
6535
|
-
var N = d === "le", q = new n(
|
|
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();
|
|
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++)
|
|
6538
6538
|
D = E.andln(255), E.iushrn(8), q[h] = D;
|
|
6539
|
-
for (; h <
|
|
6539
|
+
for (; h < S; h++)
|
|
6540
6540
|
q[h] = 0;
|
|
6541
6541
|
} else {
|
|
6542
|
-
for (h = 0; h <
|
|
6542
|
+
for (h = 0; h < S - C; h++)
|
|
6543
6543
|
q[h] = 0;
|
|
6544
6544
|
for (h = 0; !E.isZero(); h++)
|
|
6545
|
-
D = E.andln(255), E.iushrn(8), q[
|
|
6545
|
+
D = E.andln(255), E.iushrn(8), q[S - h - 1] = D;
|
|
6546
6546
|
}
|
|
6547
6547
|
return q;
|
|
6548
6548
|
}, Math.clz32 ? i.prototype._countBits = function(n) {
|
|
@@ -6647,12 +6647,12 @@ Uf.exports;
|
|
|
6647
6647
|
return n.negative = 0, d = this.isub(n), n.negative = 1, d._normSign();
|
|
6648
6648
|
var g, C;
|
|
6649
6649
|
this.length > n.length ? (g = this, C = n) : (g = n, C = this);
|
|
6650
|
-
for (var
|
|
6651
|
-
d = (g.words[N] | 0) + (C.words[N] | 0) +
|
|
6652
|
-
for (;
|
|
6653
|
-
d = (g.words[N] | 0) +
|
|
6654
|
-
if (this.length = g.length,
|
|
6655
|
-
this.words[this.length] =
|
|
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;
|
|
6652
|
+
for (; S !== 0 && N < g.length; N++)
|
|
6653
|
+
d = (g.words[N] | 0) + S, this.words[N] = d & 67108863, S = d >>> 26;
|
|
6654
|
+
if (this.length = g.length, S !== 0)
|
|
6655
|
+
this.words[this.length] = S, this.length++;
|
|
6656
6656
|
else if (g !== this)
|
|
6657
6657
|
for (; N < g.length; N++)
|
|
6658
6658
|
this.words[N] = g.words[N];
|
|
@@ -6670,10 +6670,10 @@ 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,
|
|
6674
|
-
g > 0 ? (C = this,
|
|
6675
|
-
for (var N = 0, q = 0; q <
|
|
6676
|
-
d = (C.words[q] | 0) - (
|
|
6673
|
+
var C, S;
|
|
6674
|
+
g > 0 ? (C = this, S = n) : (C = n, S = this);
|
|
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
6677
|
for (; N !== 0 && q < C.length; q++)
|
|
6678
6678
|
d = (C.words[q] | 0) + N, N = d >> 26, this.words[q] = d & 67108863;
|
|
6679
6679
|
if (N === 0 && q < C.length && C !== this)
|
|
@@ -6687,50 +6687,50 @@ 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,
|
|
6690
|
+
var C = A.words[0] | 0, S = n.words[0] | 0, N = C * 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,
|
|
6695
|
+
C = A.words[re] | 0, S = n.words[W] | 0, N = C * 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,
|
|
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;
|
|
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;
|
|
6706
6706
|
var fe = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6707
|
-
q = (E + (h >>> 13) | 0) + (fe >>> 26) | 0, fe &= 67108863, D = Math.imul(Me, a0), h = Math.imul(Me, r0), h = h + Math.imul(
|
|
6707
|
+
q = (E + (h >>> 13) | 0) + (fe >>> 26) | 0, fe &= 67108863, D = Math.imul(Me, a0), h = Math.imul(Me, r0), h = h + Math.imul(Se, a0) | 0, E = Math.imul(Se, r0), D = D + Math.imul(ce, i0) | 0, h = h + Math.imul(ce, s0) | 0, h = h + Math.imul(we, i0) | 0, E = E + Math.imul(we, s0) | 0, D = D + Math.imul(K, e0) | 0, h = h + Math.imul(K, n0) | 0, h = h + Math.imul(W, e0) | 0, E = E + Math.imul(W, n0) | 0;
|
|
6708
6708
|
var he = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6709
|
-
q = (E + (h >>> 13) | 0) + (he >>> 26) | 0, he &= 67108863, D = Math.imul(We, a0), h = Math.imul(We, r0), h = h + Math.imul(Oe, a0) | 0, E = Math.imul(Oe, r0), D = D + Math.imul(Me, i0) | 0, h = h + Math.imul(Me, s0) | 0, h = h + Math.imul(
|
|
6709
|
+
q = (E + (h >>> 13) | 0) + (he >>> 26) | 0, he &= 67108863, D = Math.imul(We, a0), h = Math.imul(We, r0), h = h + Math.imul(Oe, a0) | 0, E = Math.imul(Oe, r0), D = D + Math.imul(Me, i0) | 0, h = h + Math.imul(Me, s0) | 0, h = h + Math.imul(Se, i0) | 0, E = E + Math.imul(Se, s0) | 0, D = D + Math.imul(ce, e0) | 0, h = h + Math.imul(ce, n0) | 0, h = h + Math.imul(we, e0) | 0, E = E + Math.imul(we, n0) | 0, D = D + Math.imul(K, o0) | 0, h = h + Math.imul(K, x0) | 0, h = h + Math.imul(W, o0) | 0, E = E + Math.imul(W, x0) | 0;
|
|
6710
6710
|
var te = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6711
|
-
q = (E + (h >>> 13) | 0) + (te >>> 26) | 0, te &= 67108863, D = Math.imul(Ge, a0), h = Math.imul(Ge, r0), h = h + Math.imul(Ke, a0) | 0, E = Math.imul(Ke, r0), D = D + Math.imul(We, i0) | 0, h = h + Math.imul(We, s0) | 0, h = h + Math.imul(Oe, i0) | 0, E = E + Math.imul(Oe, s0) | 0, D = D + Math.imul(Me, e0) | 0, h = h + Math.imul(Me, n0) | 0, h = h + Math.imul(
|
|
6711
|
+
q = (E + (h >>> 13) | 0) + (te >>> 26) | 0, te &= 67108863, D = Math.imul(Ge, a0), h = Math.imul(Ge, r0), h = h + Math.imul(Ke, a0) | 0, E = Math.imul(Ke, r0), D = D + Math.imul(We, i0) | 0, h = h + Math.imul(We, s0) | 0, h = h + Math.imul(Oe, i0) | 0, E = E + Math.imul(Oe, s0) | 0, D = D + Math.imul(Me, e0) | 0, h = h + Math.imul(Me, n0) | 0, h = h + Math.imul(Se, e0) | 0, E = E + Math.imul(Se, n0) | 0, D = D + Math.imul(ce, o0) | 0, h = h + Math.imul(ce, x0) | 0, h = h + Math.imul(we, o0) | 0, E = E + Math.imul(we, x0) | 0, D = D + Math.imul(K, t0) | 0, h = h + Math.imul(K, Ve) | 0, h = h + Math.imul(W, t0) | 0, E = E + Math.imul(W, Ve) | 0;
|
|
6712
6712
|
var xe = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6713
|
-
q = (E + (h >>> 13) | 0) + (xe >>> 26) | 0, xe &= 67108863, D = Math.imul(Qe, a0), h = Math.imul(Qe, r0), h = h + Math.imul(ze, a0) | 0, E = Math.imul(ze, r0), D = D + Math.imul(Ge, i0) | 0, h = h + Math.imul(Ge, s0) | 0, h = h + Math.imul(Ke, i0) | 0, E = E + Math.imul(Ke, s0) | 0, D = D + Math.imul(We, e0) | 0, h = h + Math.imul(We, n0) | 0, h = h + Math.imul(Oe, e0) | 0, E = E + Math.imul(Oe, n0) | 0, D = D + Math.imul(Me, o0) | 0, h = h + Math.imul(Me, x0) | 0, h = h + Math.imul(
|
|
6713
|
+
q = (E + (h >>> 13) | 0) + (xe >>> 26) | 0, xe &= 67108863, D = Math.imul(Qe, a0), h = Math.imul(Qe, r0), h = h + Math.imul(ze, a0) | 0, E = Math.imul(ze, r0), D = D + Math.imul(Ge, i0) | 0, h = h + Math.imul(Ge, s0) | 0, h = h + Math.imul(Ke, i0) | 0, E = E + Math.imul(Ke, s0) | 0, D = D + Math.imul(We, e0) | 0, h = h + Math.imul(We, n0) | 0, h = h + Math.imul(Oe, e0) | 0, E = E + Math.imul(Oe, n0) | 0, D = D + Math.imul(Me, o0) | 0, h = h + Math.imul(Me, x0) | 0, h = h + Math.imul(Se, o0) | 0, E = E + Math.imul(Se, x0) | 0, D = D + Math.imul(ce, t0) | 0, h = h + Math.imul(ce, Ve) | 0, h = h + Math.imul(we, t0) | 0, E = E + Math.imul(we, Ve) | 0, D = D + Math.imul(K, c0) | 0, h = h + Math.imul(K, d0) | 0, h = h + Math.imul(W, c0) | 0, E = E + Math.imul(W, d0) | 0;
|
|
6714
6714
|
var ue = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6715
|
-
q = (E + (h >>> 13) | 0) + (ue >>> 26) | 0, ue &= 67108863, D = Math.imul(Ne, a0), h = Math.imul(Ne, r0), h = h + Math.imul(
|
|
6715
|
+
q = (E + (h >>> 13) | 0) + (ue >>> 26) | 0, ue &= 67108863, D = Math.imul(Ne, a0), h = Math.imul(Ne, r0), h = h + Math.imul(Fe, a0) | 0, E = Math.imul(Fe, r0), D = D + Math.imul(Qe, i0) | 0, h = h + Math.imul(Qe, s0) | 0, h = h + Math.imul(ze, i0) | 0, E = E + Math.imul(ze, s0) | 0, D = D + Math.imul(Ge, e0) | 0, h = h + Math.imul(Ge, n0) | 0, h = h + Math.imul(Ke, e0) | 0, E = E + Math.imul(Ke, n0) | 0, D = D + Math.imul(We, o0) | 0, h = h + Math.imul(We, x0) | 0, h = h + Math.imul(Oe, o0) | 0, E = E + Math.imul(Oe, x0) | 0, D = D + Math.imul(Me, t0) | 0, h = h + Math.imul(Me, Ve) | 0, h = h + Math.imul(Se, t0) | 0, E = E + Math.imul(Se, Ve) | 0, D = D + Math.imul(ce, c0) | 0, h = h + Math.imul(ce, d0) | 0, h = h + Math.imul(we, c0) | 0, E = E + Math.imul(we, d0) | 0, D = D + Math.imul(K, Ie) | 0, h = h + Math.imul(K, Re) | 0, h = h + Math.imul(W, Ie) | 0, E = E + Math.imul(W, Re) | 0;
|
|
6716
6716
|
var ve = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6717
|
-
q = (E + (h >>> 13) | 0) + (ve >>> 26) | 0, ve &= 67108863, D = Math.imul(Je, a0), h = Math.imul(Je, r0), h = h + Math.imul(f0, a0) | 0, E = Math.imul(f0, r0), D = D + Math.imul(Ne, i0) | 0, h = h + Math.imul(Ne, s0) | 0, h = h + Math.imul(
|
|
6717
|
+
q = (E + (h >>> 13) | 0) + (ve >>> 26) | 0, ve &= 67108863, D = Math.imul(Je, a0), h = Math.imul(Je, r0), h = h + Math.imul(f0, a0) | 0, E = Math.imul(f0, r0), D = D + Math.imul(Ne, i0) | 0, h = h + Math.imul(Ne, s0) | 0, h = h + Math.imul(Fe, i0) | 0, E = E + Math.imul(Fe, s0) | 0, D = D + Math.imul(Qe, e0) | 0, h = h + Math.imul(Qe, n0) | 0, h = h + Math.imul(ze, e0) | 0, E = E + Math.imul(ze, n0) | 0, D = D + Math.imul(Ge, o0) | 0, h = h + Math.imul(Ge, x0) | 0, h = h + Math.imul(Ke, o0) | 0, E = E + Math.imul(Ke, x0) | 0, D = D + Math.imul(We, t0) | 0, h = h + Math.imul(We, Ve) | 0, h = h + Math.imul(Oe, t0) | 0, E = E + Math.imul(Oe, Ve) | 0, D = D + Math.imul(Me, c0) | 0, h = h + Math.imul(Me, d0) | 0, h = h + Math.imul(Se, c0) | 0, E = E + Math.imul(Se, d0) | 0, D = D + Math.imul(ce, Ie) | 0, h = h + Math.imul(ce, Re) | 0, h = h + Math.imul(we, Ie) | 0, E = E + Math.imul(we, Re) | 0, D = D + Math.imul(K, _) | 0, h = h + Math.imul(K, m) | 0, h = h + Math.imul(W, _) | 0, E = E + Math.imul(W, m) | 0;
|
|
6718
6718
|
var ge = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6719
|
-
q = (E + (h >>> 13) | 0) + (ge >>> 26) | 0, ge &= 67108863, D = Math.imul(qe, a0), h = Math.imul(qe, r0), h = h + Math.imul(u0, a0) | 0, E = Math.imul(u0, r0), D = D + Math.imul(Je, i0) | 0, h = h + Math.imul(Je, s0) | 0, h = h + Math.imul(f0, i0) | 0, E = E + Math.imul(f0, s0) | 0, D = D + Math.imul(Ne, e0) | 0, h = h + Math.imul(Ne, n0) | 0, h = h + Math.imul(
|
|
6719
|
+
q = (E + (h >>> 13) | 0) + (ge >>> 26) | 0, ge &= 67108863, D = Math.imul(qe, a0), h = Math.imul(qe, r0), h = h + Math.imul(u0, a0) | 0, E = Math.imul(u0, r0), D = D + Math.imul(Je, i0) | 0, h = h + Math.imul(Je, s0) | 0, h = h + Math.imul(f0, i0) | 0, E = E + Math.imul(f0, s0) | 0, D = D + Math.imul(Ne, e0) | 0, h = h + Math.imul(Ne, n0) | 0, h = h + Math.imul(Fe, e0) | 0, E = E + Math.imul(Fe, n0) | 0, D = D + Math.imul(Qe, o0) | 0, h = h + Math.imul(Qe, x0) | 0, h = h + Math.imul(ze, o0) | 0, E = E + Math.imul(ze, x0) | 0, D = D + Math.imul(Ge, t0) | 0, h = h + Math.imul(Ge, Ve) | 0, h = h + Math.imul(Ke, t0) | 0, E = E + Math.imul(Ke, Ve) | 0, D = D + Math.imul(We, c0) | 0, h = h + Math.imul(We, d0) | 0, h = h + Math.imul(Oe, c0) | 0, E = E + Math.imul(Oe, d0) | 0, D = D + Math.imul(Me, Ie) | 0, h = h + Math.imul(Me, Re) | 0, h = h + Math.imul(Se, Ie) | 0, E = E + Math.imul(Se, Re) | 0, D = D + Math.imul(ce, _) | 0, h = h + Math.imul(ce, m) | 0, h = h + Math.imul(we, _) | 0, E = E + Math.imul(we, m) | 0, D = D + Math.imul(K, M) | 0, h = h + Math.imul(K, p) | 0, h = h + Math.imul(W, M) | 0, E = E + Math.imul(W, p) | 0;
|
|
6720
6720
|
var me = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6721
|
-
q = (E + (h >>> 13) | 0) + (me >>> 26) | 0, me &= 67108863, D = Math.imul(l0, a0), h = Math.imul(l0, r0), h = h + Math.imul(He, a0) | 0, E = Math.imul(He, r0), D = D + Math.imul(qe, i0) | 0, h = h + Math.imul(qe, s0) | 0, h = h + Math.imul(u0, i0) | 0, E = E + Math.imul(u0, s0) | 0, D = D + Math.imul(Je, e0) | 0, h = h + Math.imul(Je, n0) | 0, h = h + Math.imul(f0, e0) | 0, E = E + Math.imul(f0, n0) | 0, D = D + Math.imul(Ne, o0) | 0, h = h + Math.imul(Ne, x0) | 0, h = h + Math.imul(
|
|
6721
|
+
q = (E + (h >>> 13) | 0) + (me >>> 26) | 0, me &= 67108863, D = Math.imul(l0, a0), h = Math.imul(l0, r0), h = h + Math.imul(He, a0) | 0, E = Math.imul(He, r0), D = D + Math.imul(qe, i0) | 0, h = h + Math.imul(qe, s0) | 0, h = h + Math.imul(u0, i0) | 0, E = E + Math.imul(u0, s0) | 0, D = D + Math.imul(Je, e0) | 0, h = h + Math.imul(Je, n0) | 0, h = h + Math.imul(f0, e0) | 0, E = E + Math.imul(f0, n0) | 0, D = D + Math.imul(Ne, o0) | 0, h = h + Math.imul(Ne, x0) | 0, h = h + Math.imul(Fe, o0) | 0, E = E + Math.imul(Fe, x0) | 0, D = D + Math.imul(Qe, t0) | 0, h = h + Math.imul(Qe, Ve) | 0, h = h + Math.imul(ze, t0) | 0, E = E + Math.imul(ze, Ve) | 0, D = D + Math.imul(Ge, c0) | 0, h = h + Math.imul(Ge, d0) | 0, h = h + Math.imul(Ke, c0) | 0, E = E + Math.imul(Ke, d0) | 0, D = D + Math.imul(We, Ie) | 0, h = h + Math.imul(We, Re) | 0, h = h + Math.imul(Oe, Ie) | 0, E = E + Math.imul(Oe, Re) | 0, D = D + Math.imul(Me, _) | 0, h = h + Math.imul(Me, m) | 0, h = h + Math.imul(Se, _) | 0, E = E + Math.imul(Se, m) | 0, D = D + Math.imul(ce, M) | 0, h = h + Math.imul(ce, p) | 0, h = h + Math.imul(we, M) | 0, E = E + Math.imul(we, p) | 0, D = D + Math.imul(K, L) | 0, h = h + Math.imul(K, V) | 0, h = h + Math.imul(W, L) | 0, E = E + Math.imul(W, V) | 0;
|
|
6722
6722
|
var _e = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6723
|
-
q = (E + (h >>> 13) | 0) + (_e >>> 26) | 0, _e &= 67108863, D = Math.imul(l0, i0), h = Math.imul(l0, s0), h = h + Math.imul(He, i0) | 0, E = Math.imul(He, s0), D = D + Math.imul(qe, e0) | 0, h = h + Math.imul(qe, n0) | 0, h = h + Math.imul(u0, e0) | 0, E = E + Math.imul(u0, n0) | 0, D = D + Math.imul(Je, o0) | 0, h = h + Math.imul(Je, x0) | 0, h = h + Math.imul(f0, o0) | 0, E = E + Math.imul(f0, x0) | 0, D = D + Math.imul(Ne, t0) | 0, h = h + Math.imul(Ne, Ve) | 0, h = h + Math.imul(
|
|
6723
|
+
q = (E + (h >>> 13) | 0) + (_e >>> 26) | 0, _e &= 67108863, D = Math.imul(l0, i0), h = Math.imul(l0, s0), h = h + Math.imul(He, i0) | 0, E = Math.imul(He, s0), D = D + Math.imul(qe, e0) | 0, h = h + Math.imul(qe, n0) | 0, h = h + Math.imul(u0, e0) | 0, E = E + Math.imul(u0, n0) | 0, D = D + Math.imul(Je, o0) | 0, h = h + Math.imul(Je, x0) | 0, h = h + Math.imul(f0, o0) | 0, E = E + Math.imul(f0, x0) | 0, D = D + Math.imul(Ne, t0) | 0, h = h + Math.imul(Ne, Ve) | 0, h = h + Math.imul(Fe, t0) | 0, E = E + Math.imul(Fe, Ve) | 0, D = D + Math.imul(Qe, c0) | 0, h = h + Math.imul(Qe, d0) | 0, h = h + Math.imul(ze, c0) | 0, E = E + Math.imul(ze, d0) | 0, D = D + Math.imul(Ge, Ie) | 0, h = h + Math.imul(Ge, Re) | 0, h = h + Math.imul(Ke, Ie) | 0, E = E + Math.imul(Ke, Re) | 0, D = D + Math.imul(We, _) | 0, h = h + Math.imul(We, m) | 0, h = h + Math.imul(Oe, _) | 0, E = E + Math.imul(Oe, m) | 0, D = D + Math.imul(Me, M) | 0, h = h + Math.imul(Me, p) | 0, h = h + Math.imul(Se, M) | 0, E = E + Math.imul(Se, p) | 0, D = D + Math.imul(ce, L) | 0, h = h + Math.imul(ce, V) | 0, h = h + Math.imul(we, L) | 0, E = E + Math.imul(we, V) | 0;
|
|
6724
6724
|
var pe = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6725
|
-
q = (E + (h >>> 13) | 0) + (pe >>> 26) | 0, pe &= 67108863, D = Math.imul(l0, e0), h = Math.imul(l0, n0), h = h + Math.imul(He, e0) | 0, E = Math.imul(He, n0), D = D + Math.imul(qe, o0) | 0, h = h + Math.imul(qe, x0) | 0, h = h + Math.imul(u0, o0) | 0, E = E + Math.imul(u0, x0) | 0, D = D + Math.imul(Je, t0) | 0, h = h + Math.imul(Je, Ve) | 0, h = h + Math.imul(f0, t0) | 0, E = E + Math.imul(f0, Ve) | 0, D = D + Math.imul(Ne, c0) | 0, h = h + Math.imul(Ne, d0) | 0, h = h + Math.imul(
|
|
6725
|
+
q = (E + (h >>> 13) | 0) + (pe >>> 26) | 0, pe &= 67108863, D = Math.imul(l0, e0), h = Math.imul(l0, n0), h = h + Math.imul(He, e0) | 0, E = Math.imul(He, n0), D = D + Math.imul(qe, o0) | 0, h = h + Math.imul(qe, x0) | 0, h = h + Math.imul(u0, o0) | 0, E = E + Math.imul(u0, x0) | 0, D = D + Math.imul(Je, t0) | 0, h = h + Math.imul(Je, Ve) | 0, h = h + Math.imul(f0, t0) | 0, E = E + Math.imul(f0, Ve) | 0, D = D + Math.imul(Ne, c0) | 0, h = h + Math.imul(Ne, d0) | 0, h = h + Math.imul(Fe, c0) | 0, E = E + Math.imul(Fe, d0) | 0, D = D + Math.imul(Qe, Ie) | 0, h = h + Math.imul(Qe, Re) | 0, h = h + Math.imul(ze, Ie) | 0, E = E + Math.imul(ze, Re) | 0, D = D + Math.imul(Ge, _) | 0, h = h + Math.imul(Ge, m) | 0, h = h + Math.imul(Ke, _) | 0, E = E + Math.imul(Ke, m) | 0, D = D + Math.imul(We, M) | 0, h = h + Math.imul(We, p) | 0, h = h + Math.imul(Oe, M) | 0, E = E + Math.imul(Oe, p) | 0, D = D + Math.imul(Me, L) | 0, h = h + Math.imul(Me, V) | 0, h = h + Math.imul(Se, L) | 0, E = E + Math.imul(Se, V) | 0;
|
|
6726
6726
|
var de = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6727
|
-
q = (E + (h >>> 13) | 0) + (de >>> 26) | 0, de &= 67108863, D = Math.imul(l0, o0), h = Math.imul(l0, x0), h = h + Math.imul(He, o0) | 0, E = Math.imul(He, x0), D = D + Math.imul(qe, t0) | 0, h = h + Math.imul(qe, Ve) | 0, h = h + Math.imul(u0, t0) | 0, E = E + Math.imul(u0, Ve) | 0, D = D + Math.imul(Je, c0) | 0, h = h + Math.imul(Je, d0) | 0, h = h + Math.imul(f0, c0) | 0, E = E + Math.imul(f0, d0) | 0, D = D + Math.imul(Ne, Ie) | 0, h = h + Math.imul(Ne, Re) | 0, h = h + Math.imul(
|
|
6727
|
+
q = (E + (h >>> 13) | 0) + (de >>> 26) | 0, de &= 67108863, D = Math.imul(l0, o0), h = Math.imul(l0, x0), h = h + Math.imul(He, o0) | 0, E = Math.imul(He, x0), D = D + Math.imul(qe, t0) | 0, h = h + Math.imul(qe, Ve) | 0, h = h + Math.imul(u0, t0) | 0, E = E + Math.imul(u0, Ve) | 0, D = D + Math.imul(Je, c0) | 0, h = h + Math.imul(Je, d0) | 0, h = h + Math.imul(f0, c0) | 0, E = E + Math.imul(f0, d0) | 0, D = D + Math.imul(Ne, Ie) | 0, h = h + Math.imul(Ne, Re) | 0, h = h + Math.imul(Fe, Ie) | 0, E = E + Math.imul(Fe, Re) | 0, D = D + Math.imul(Qe, _) | 0, h = h + Math.imul(Qe, m) | 0, h = h + Math.imul(ze, _) | 0, E = E + Math.imul(ze, m) | 0, D = D + Math.imul(Ge, M) | 0, h = h + Math.imul(Ge, p) | 0, h = h + Math.imul(Ke, M) | 0, E = E + Math.imul(Ke, p) | 0, D = D + Math.imul(We, L) | 0, h = h + Math.imul(We, V) | 0, h = h + Math.imul(Oe, L) | 0, E = E + Math.imul(Oe, V) | 0;
|
|
6728
6728
|
var ye = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6729
|
-
q = (E + (h >>> 13) | 0) + (ye >>> 26) | 0, ye &= 67108863, D = Math.imul(l0, t0), h = Math.imul(l0, Ve), h = h + Math.imul(He, t0) | 0, E = Math.imul(He, Ve), D = D + Math.imul(qe, c0) | 0, h = h + Math.imul(qe, d0) | 0, h = h + Math.imul(u0, c0) | 0, E = E + Math.imul(u0, d0) | 0, D = D + Math.imul(Je, Ie) | 0, h = h + Math.imul(Je, Re) | 0, h = h + Math.imul(f0, Ie) | 0, E = E + Math.imul(f0, Re) | 0, D = D + Math.imul(Ne, _) | 0, h = h + Math.imul(Ne, m) | 0, h = h + Math.imul(
|
|
6729
|
+
q = (E + (h >>> 13) | 0) + (ye >>> 26) | 0, ye &= 67108863, D = Math.imul(l0, t0), h = Math.imul(l0, Ve), h = h + Math.imul(He, t0) | 0, E = Math.imul(He, Ve), D = D + Math.imul(qe, c0) | 0, h = h + Math.imul(qe, d0) | 0, h = h + Math.imul(u0, c0) | 0, E = E + Math.imul(u0, d0) | 0, D = D + Math.imul(Je, Ie) | 0, h = h + Math.imul(Je, Re) | 0, h = h + Math.imul(f0, Ie) | 0, E = E + Math.imul(f0, Re) | 0, D = D + Math.imul(Ne, _) | 0, h = h + Math.imul(Ne, m) | 0, h = h + Math.imul(Fe, _) | 0, E = E + Math.imul(Fe, m) | 0, D = D + Math.imul(Qe, M) | 0, h = h + Math.imul(Qe, p) | 0, h = h + Math.imul(ze, M) | 0, E = E + Math.imul(ze, p) | 0, D = D + Math.imul(Ge, L) | 0, h = h + Math.imul(Ge, V) | 0, h = h + Math.imul(Ke, L) | 0, E = E + Math.imul(Ke, V) | 0;
|
|
6730
6730
|
var oe = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6731
|
-
q = (E + (h >>> 13) | 0) + (oe >>> 26) | 0, oe &= 67108863, D = Math.imul(l0, c0), h = Math.imul(l0, d0), h = h + Math.imul(He, c0) | 0, E = Math.imul(He, d0), D = D + Math.imul(qe, Ie) | 0, h = h + Math.imul(qe, Re) | 0, h = h + Math.imul(u0, Ie) | 0, E = E + Math.imul(u0, Re) | 0, D = D + Math.imul(Je, _) | 0, h = h + Math.imul(Je, m) | 0, h = h + Math.imul(f0, _) | 0, E = E + Math.imul(f0, m) | 0, D = D + Math.imul(Ne, M) | 0, h = h + Math.imul(Ne, p) | 0, h = h + Math.imul(
|
|
6731
|
+
q = (E + (h >>> 13) | 0) + (oe >>> 26) | 0, oe &= 67108863, D = Math.imul(l0, c0), h = Math.imul(l0, d0), h = h + Math.imul(He, c0) | 0, E = Math.imul(He, d0), D = D + Math.imul(qe, Ie) | 0, h = h + Math.imul(qe, Re) | 0, h = h + Math.imul(u0, Ie) | 0, E = E + Math.imul(u0, Re) | 0, D = D + Math.imul(Je, _) | 0, h = h + Math.imul(Je, m) | 0, h = h + Math.imul(f0, _) | 0, E = E + Math.imul(f0, m) | 0, D = D + Math.imul(Ne, M) | 0, h = h + Math.imul(Ne, p) | 0, h = h + Math.imul(Fe, M) | 0, E = E + Math.imul(Fe, p) | 0, D = D + Math.imul(Qe, L) | 0, h = h + Math.imul(Qe, V) | 0, h = h + Math.imul(ze, L) | 0, E = E + Math.imul(ze, V) | 0;
|
|
6732
6732
|
var le = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6733
|
-
q = (E + (h >>> 13) | 0) + (le >>> 26) | 0, le &= 67108863, D = Math.imul(l0, Ie), h = Math.imul(l0, Re), h = h + Math.imul(He, Ie) | 0, E = Math.imul(He, Re), D = D + Math.imul(qe, _) | 0, h = h + Math.imul(qe, m) | 0, h = h + Math.imul(u0, _) | 0, E = E + Math.imul(u0, m) | 0, D = D + Math.imul(Je, M) | 0, h = h + Math.imul(Je, p) | 0, h = h + Math.imul(f0, M) | 0, E = E + Math.imul(f0, p) | 0, D = D + Math.imul(Ne, L) | 0, h = h + Math.imul(Ne, V) | 0, h = h + Math.imul(
|
|
6733
|
+
q = (E + (h >>> 13) | 0) + (le >>> 26) | 0, le &= 67108863, D = Math.imul(l0, Ie), h = Math.imul(l0, Re), h = h + Math.imul(He, Ie) | 0, E = Math.imul(He, Re), D = D + Math.imul(qe, _) | 0, h = h + Math.imul(qe, m) | 0, h = h + Math.imul(u0, _) | 0, E = E + Math.imul(u0, m) | 0, D = D + Math.imul(Je, M) | 0, h = h + Math.imul(Je, p) | 0, h = h + Math.imul(f0, M) | 0, E = E + Math.imul(f0, p) | 0, D = D + Math.imul(Ne, L) | 0, h = h + Math.imul(Ne, V) | 0, h = h + Math.imul(Fe, L) | 0, E = E + Math.imul(Fe, V) | 0;
|
|
6734
6734
|
var be = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6735
6735
|
q = (E + (h >>> 13) | 0) + (be >>> 26) | 0, be &= 67108863, D = Math.imul(l0, _), h = Math.imul(l0, m), h = h + Math.imul(He, _) | 0, E = Math.imul(He, m), D = D + Math.imul(qe, M) | 0, h = h + Math.imul(qe, p) | 0, h = h + Math.imul(u0, M) | 0, E = E + Math.imul(u0, p) | 0, D = D + Math.imul(Je, L) | 0, h = h + Math.imul(Je, V) | 0, h = h + Math.imul(f0, L) | 0, E = E + Math.imul(f0, V) | 0;
|
|
6736
6736
|
var se = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
@@ -6743,84 +6743,84 @@ 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,
|
|
6746
|
+
for (var g = 0, C = 0, S = 0; S < d.length - 1; S++) {
|
|
6747
6747
|
var N = C;
|
|
6748
6748
|
C = 0;
|
|
6749
|
-
for (var q = g & 67108863, D = Math.min(
|
|
6750
|
-
var E =
|
|
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
|
+
var E = S - h, j = A.words[E] | 0, K = n.words[h] | 0, W = j * K, re = W & 67108863;
|
|
6751
6751
|
N = N + (W / 67108864 | 0) | 0, re = re + q | 0, q = re & 67108863, N = N + (re >>> 26) | 0, C += N >>> 26, N &= 67108863;
|
|
6752
6752
|
}
|
|
6753
|
-
d.words[
|
|
6753
|
+
d.words[S] = q, g = N, N = C;
|
|
6754
6754
|
}
|
|
6755
|
-
return g !== 0 ? d.words[
|
|
6755
|
+
return g !== 0 ? d.words[S] = g : d.length--, d.strip();
|
|
6756
6756
|
}
|
|
6757
6757
|
function z(A, n, d) {
|
|
6758
|
-
var g = new
|
|
6758
|
+
var g = new F();
|
|
6759
6759
|
return g.mulp(A, n, d);
|
|
6760
6760
|
}
|
|
6761
6761
|
i.prototype.mulTo = function(n, d) {
|
|
6762
6762
|
var g, C = this.length + n.length;
|
|
6763
6763
|
return this.length === 10 && n.length === 10 ? g = R(this, n, d) : C < 63 ? g = w(this, n, d) : C < 1024 ? g = k(this, n, d) : g = z(this, n, d), g;
|
|
6764
6764
|
};
|
|
6765
|
-
function
|
|
6765
|
+
function F(A, n) {
|
|
6766
6766
|
this.x = A, this.y = n;
|
|
6767
6767
|
}
|
|
6768
|
-
|
|
6768
|
+
F.prototype.makeRBT = function(n) {
|
|
6769
6769
|
for (var d = new Array(n), g = i.prototype._countBits(n) - 1, C = 0; C < n; C++)
|
|
6770
6770
|
d[C] = this.revBin(C, 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,
|
|
6776
|
-
C |= (n & 1) << d -
|
|
6775
|
+
for (var C = 0, S = 0; S < d; S++)
|
|
6776
|
+
C |= (n & 1) << d - S - 1, n >>= 1;
|
|
6777
6777
|
return C;
|
|
6778
|
-
},
|
|
6778
|
+
}, F.prototype.permute = function(n, d, g, C, S, N) {
|
|
6779
6779
|
for (var q = 0; q < N; q++)
|
|
6780
|
-
C[q] = d[n[q]],
|
|
6781
|
-
},
|
|
6782
|
-
this.permute(N, n, d, g, C,
|
|
6783
|
-
for (var q = 1; q <
|
|
6784
|
-
for (var D = q << 1, h = Math.cos(2 * Math.PI / D), E = Math.sin(2 * Math.PI / D), j = 0; j <
|
|
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);
|
|
6783
|
+
for (var q = 1; q < S; q <<= 1)
|
|
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],
|
|
6787
|
-
Me = K * Me + W * Ae, Ae =
|
|
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);
|
|
6788
6788
|
}
|
|
6789
|
-
},
|
|
6790
|
-
var g = Math.max(d, n) | 1, C = g & 1,
|
|
6789
|
+
}, F.prototype.guessLen13b = function(n, d) {
|
|
6790
|
+
var g = Math.max(d, n) | 1, C = g & 1, S = 0;
|
|
6791
6791
|
for (g = g / 2 | 0; g; g = g >>> 1)
|
|
6792
|
-
|
|
6793
|
-
return 1 <<
|
|
6794
|
-
},
|
|
6792
|
+
S++;
|
|
6793
|
+
return 1 << S + 1 + C;
|
|
6794
|
+
}, F.prototype.conjugate = function(n, d, g) {
|
|
6795
6795
|
if (!(g <= 1))
|
|
6796
6796
|
for (var C = 0; C < g / 2; C++) {
|
|
6797
|
-
var
|
|
6798
|
-
n[C] = n[g - C - 1], n[g - C - 1] =
|
|
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;
|
|
6799
6799
|
}
|
|
6800
|
-
},
|
|
6800
|
+
}, F.prototype.normalize13b = function(n, d) {
|
|
6801
6801
|
for (var g = 0, C = 0; C < d / 2; C++) {
|
|
6802
|
-
var
|
|
6803
|
-
n[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;
|
|
6804
6804
|
}
|
|
6805
6805
|
return n;
|
|
6806
|
-
},
|
|
6807
|
-
for (var
|
|
6808
|
-
|
|
6806
|
+
}, F.prototype.convert13b = function(n, d, g, C) {
|
|
6807
|
+
for (var S = 0, N = 0; N < d; N++)
|
|
6808
|
+
S = S + (n[N] | 0), g[2 * N] = S & 8191, S = S >>> 13, g[2 * N + 1] = S & 8191, S = S >>> 13;
|
|
6809
6809
|
for (N = 2 * d; N < C; ++N)
|
|
6810
6810
|
g[N] = 0;
|
|
6811
|
-
r(
|
|
6812
|
-
},
|
|
6811
|
+
r(S === 0), r((S & -8192) === 0);
|
|
6812
|
+
}, F.prototype.stub = function(n) {
|
|
6813
6813
|
for (var d = new Array(n), g = 0; g < n; g++)
|
|
6814
6814
|
d[g] = 0;
|
|
6815
6815
|
return d;
|
|
6816
|
-
},
|
|
6817
|
-
var C = 2 * this.guessLen13b(n.length, d.length),
|
|
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,
|
|
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
6819
|
for (var re = 0; re < C; 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,
|
|
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();
|
|
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,
|
|
6836
|
-
d >>= 26, d += C / 67108864 | 0, d +=
|
|
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;
|
|
6837
6837
|
}
|
|
6838
6838
|
return d !== 0 && (this.words[g] = d, this.length++), this;
|
|
6839
6839
|
}, i.prototype.muln = function(n) {
|
|
@@ -6849,25 +6849,25 @@ Uf.exports;
|
|
|
6849
6849
|
for (var g = this, C = 0; C < d.length && d[C] === 0; C++, g = g.sqr())
|
|
6850
6850
|
;
|
|
6851
6851
|
if (++C < d.length)
|
|
6852
|
-
for (var
|
|
6853
|
-
d[C] !== 0 && (g = g.mul(
|
|
6852
|
+
for (var S = g.sqr(); C < d.length; C++, S = S.sqr())
|
|
6853
|
+
d[C] !== 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,
|
|
6857
|
+
var d = n % 26, g = (n - d) / 26, C = 67108863 >>> 26 - d << 26 - d, S;
|
|
6858
6858
|
if (d !== 0) {
|
|
6859
6859
|
var N = 0;
|
|
6860
|
-
for (
|
|
6861
|
-
var q = this.words[
|
|
6862
|
-
this.words[
|
|
6860
|
+
for (S = 0; S < this.length; S++) {
|
|
6861
|
+
var q = this.words[S] & C, D = (this.words[S] | 0) - q << d;
|
|
6862
|
+
this.words[S] = D | N, N = q >>> 26 - d;
|
|
6863
6863
|
}
|
|
6864
|
-
N && (this.words[
|
|
6864
|
+
N && (this.words[S] = N, this.length++);
|
|
6865
6865
|
}
|
|
6866
6866
|
if (g !== 0) {
|
|
6867
|
-
for (
|
|
6868
|
-
this.words[
|
|
6869
|
-
for (
|
|
6870
|
-
this.words[
|
|
6867
|
+
for (S = this.length - 1; S >= 0; S--)
|
|
6868
|
+
this.words[S + g] = this.words[S];
|
|
6869
|
+
for (S = 0; S < g; S++)
|
|
6870
|
+
this.words[S] = 0;
|
|
6871
6871
|
this.length += g;
|
|
6872
6872
|
}
|
|
6873
6873
|
return this.strip();
|
|
@@ -6877,7 +6877,7 @@ Uf.exports;
|
|
|
6877
6877
|
r(typeof n == "number" && n >= 0);
|
|
6878
6878
|
var C;
|
|
6879
6879
|
d ? C = (d - d % 26) / 26 : C = 0;
|
|
6880
|
-
var
|
|
6880
|
+
var S = n % 26, N = Math.min((n - S) / 26, this.length), q = 67108863 ^ 67108863 >>> S << S, D = g;
|
|
6881
6881
|
if (C -= N, C = Math.max(0, C), D) {
|
|
6882
6882
|
for (var h = 0; h < N; h++)
|
|
6883
6883
|
D.words[h] = this.words[h];
|
|
@@ -6892,7 +6892,7 @@ Uf.exports;
|
|
|
6892
6892
|
var E = 0;
|
|
6893
6893
|
for (h = this.length - 1; h >= 0 && (E !== 0 || h >= C); h--) {
|
|
6894
6894
|
var j = this.words[h] | 0;
|
|
6895
|
-
this.words[h] = E << 26 -
|
|
6895
|
+
this.words[h] = E << 26 - S | j >>> S, E = j & q;
|
|
6896
6896
|
}
|
|
6897
6897
|
return D && E !== 0 && (D.words[D.length++] = E), this.length === 0 && (this.words[0] = 0, this.length = 1), this.strip();
|
|
6898
6898
|
}, i.prototype.ishrn = function(n, d, g) {
|
|
@@ -6910,8 +6910,8 @@ Uf.exports;
|
|
|
6910
6910
|
var d = n % 26, g = (n - d) / 26, C = 1 << d;
|
|
6911
6911
|
if (this.length <= g)
|
|
6912
6912
|
return !1;
|
|
6913
|
-
var
|
|
6914
|
-
return !!(
|
|
6913
|
+
var S = this.words[g];
|
|
6914
|
+
return !!(S & C);
|
|
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;
|
|
@@ -6951,36 +6951,36 @@ 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,
|
|
6954
|
+
var C = n.length + g, S;
|
|
6955
6955
|
this._expand(C);
|
|
6956
6956
|
var N, q = 0;
|
|
6957
|
-
for (
|
|
6958
|
-
N = (this.words[
|
|
6959
|
-
var D = (n.words[
|
|
6960
|
-
N -= D & 67108863, q = (N >> 26) - (D / 67108864 | 0), this.words[
|
|
6957
|
+
for (S = 0; S < n.length; S++) {
|
|
6958
|
+
N = (this.words[S + g] | 0) + q;
|
|
6959
|
+
var D = (n.words[S] | 0) * d;
|
|
6960
|
+
N -= D & 67108863, q = (N >> 26) - (D / 67108864 | 0), this.words[S + g] = N & 67108863;
|
|
6961
6961
|
}
|
|
6962
|
-
for (;
|
|
6963
|
-
N = (this.words[
|
|
6962
|
+
for (; S < this.length - g; S++)
|
|
6963
|
+
N = (this.words[S + g] | 0) + q, q = N >> 26, this.words[S + g] = N & 67108863;
|
|
6964
6964
|
if (q === 0)
|
|
6965
6965
|
return this.strip();
|
|
6966
|
-
for (r(q === -1), q = 0,
|
|
6967
|
-
N = -(this.words[
|
|
6966
|
+
for (r(q === -1), q = 0, S = 0; S < this.length; S++)
|
|
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(),
|
|
6971
|
-
g = 26 - q, g !== 0 && (
|
|
6972
|
-
var D = C.length -
|
|
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;
|
|
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(
|
|
6978
|
+
var j = C.clone()._ishlnsubmul(S, 1, D);
|
|
6979
6979
|
j.negative === 0 && (C = j, h && (h.words[D] = 1));
|
|
6980
6980
|
for (var K = D - 1; K >= 0; K--) {
|
|
6981
|
-
var W = (C.words[
|
|
6982
|
-
for (W = Math.min(W / N | 0, 67108863), C._ishlnsubmul(
|
|
6983
|
-
W--, C.negative = 0, C._ishlnsubmul(
|
|
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);
|
|
6984
6984
|
h && (h.words[K] = W);
|
|
6985
6985
|
}
|
|
6986
6986
|
return h && h.strip(), C.strip(), d !== "div" && g !== 0 && C.iushrn(g), {
|
|
@@ -6993,16 +6993,16 @@ Uf.exports;
|
|
|
6993
6993
|
div: new i(0),
|
|
6994
6994
|
mod: new i(0)
|
|
6995
6995
|
};
|
|
6996
|
-
var C,
|
|
6997
|
-
return this.negative !== 0 && n.negative === 0 ? (N = this.neg().divmod(n, d), d !== "mod" && (C = N.div.neg()), d !== "div" && (
|
|
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
6998
|
div: C,
|
|
6999
|
-
mod:
|
|
6999
|
+
mod: S
|
|
7000
7000
|
}) : this.negative === 0 && n.negative !== 0 ? (N = this.divmod(n.neg(), d), d !== "mod" && (C = N.div.neg()), {
|
|
7001
7001
|
div: C,
|
|
7002
7002
|
mod: N.mod
|
|
7003
|
-
}) : this.negative & n.negative ? (N = this.neg().divmod(n.neg(), d), d !== "div" && (
|
|
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,
|
|
7005
|
-
mod:
|
|
7005
|
+
mod: S
|
|
7006
7006
|
}) : n.length > this.length || this.cmp(n) < 0 ? {
|
|
7007
7007
|
div: new i(0),
|
|
7008
7008
|
mod: this
|
|
@@ -7026,8 +7026,8 @@ 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),
|
|
7030
|
-
return N < 0 ||
|
|
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);
|
|
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
7033
|
for (var d = (1 << 26) % n, g = 0, C = this.length - 1; C >= 0; C--)
|
|
@@ -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),
|
|
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(); )
|
|
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() ||
|
|
7056
|
+
(C.isOdd() || S.isOdd()) && (C.iadd(h), S.isub(E)), C.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),
|
|
7062
|
+
d.cmp(g) >= 0 ? (d.isub(g), C.isub(N), S.isub(q)) : (g.isub(d), N.isub(C), q.isub(S));
|
|
7063
7063
|
}
|
|
7064
7064
|
return {
|
|
7065
7065
|
a: N,
|
|
@@ -7070,7 +7070,7 @@ 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),
|
|
7073
|
+
for (var C = 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)
|
|
@@ -7080,11 +7080,11 @@ Uf.exports;
|
|
|
7080
7080
|
;
|
|
7081
7081
|
if (h > 0)
|
|
7082
7082
|
for (g.iushrn(h); h-- > 0; )
|
|
7083
|
-
|
|
7084
|
-
d.cmp(g) >= 0 ? (d.isub(g), C.isub(
|
|
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));
|
|
7085
7085
|
}
|
|
7086
7086
|
var j;
|
|
7087
|
-
return d.cmpn(1) === 0 ? j = C : j =
|
|
7087
|
+
return d.cmpn(1) === 0 ? j = C : 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();
|
|
@@ -7099,11 +7099,11 @@ Uf.exports;
|
|
|
7099
7099
|
d.iushrn(1);
|
|
7100
7100
|
for (; g.isEven(); )
|
|
7101
7101
|
g.iushrn(1);
|
|
7102
|
-
var
|
|
7103
|
-
if (
|
|
7102
|
+
var S = d.cmp(g);
|
|
7103
|
+
if (S < 0) {
|
|
7104
7104
|
var N = d;
|
|
7105
7105
|
d = g, g = N;
|
|
7106
|
-
} else if (
|
|
7106
|
+
} else if (S === 0 || g.cmpn(1) === 0)
|
|
7107
7107
|
break;
|
|
7108
7108
|
d.isub(g);
|
|
7109
7109
|
} while (!0);
|
|
@@ -7121,11 +7121,11 @@ Uf.exports;
|
|
|
7121
7121
|
var d = n % 26, g = (n - d) / 26, C = 1 << d;
|
|
7122
7122
|
if (this.length <= g)
|
|
7123
7123
|
return this._expand(g + 1), this.words[g] |= C, this;
|
|
7124
|
-
for (var
|
|
7124
|
+
for (var S = C, N = g; S !== 0 && N < this.length; N++) {
|
|
7125
7125
|
var q = this.words[N] | 0;
|
|
7126
|
-
q +=
|
|
7126
|
+
q += S, S = q >>> 26, q &= 67108863, this.words[N] = q;
|
|
7127
7127
|
}
|
|
7128
|
-
return
|
|
7128
|
+
return S !== 0 && (this.words[N] = S, this.length++), this;
|
|
7129
7129
|
}, i.prototype.isZero = function() {
|
|
7130
7130
|
return this.length === 1 && this.words[0] === 0;
|
|
7131
7131
|
}, i.prototype.cmpn = function(n) {
|
|
@@ -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,
|
|
7161
|
-
if (C !==
|
|
7162
|
-
C <
|
|
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);
|
|
7163
7163
|
break;
|
|
7164
7164
|
}
|
|
7165
7165
|
}
|
|
@@ -7253,18 +7253,18 @@ 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),
|
|
7257
|
-
d.words[
|
|
7256
|
+
for (var g = 4194303, C = Math.min(n.length, 9), S = 0; S < C; S++)
|
|
7257
|
+
d.words[S] = n.words[S];
|
|
7258
7258
|
if (d.length = C, n.length <= 9) {
|
|
7259
7259
|
n.words[0] = 0, n.length = 1;
|
|
7260
7260
|
return;
|
|
7261
7261
|
}
|
|
7262
7262
|
var N = n.words[9];
|
|
7263
|
-
for (d.words[d.length++] = N & g,
|
|
7264
|
-
var q = n.words[
|
|
7265
|
-
n.words[
|
|
7263
|
+
for (d.words[d.length++] = N & g, S = 10; S < n.length; S++) {
|
|
7264
|
+
var q = n.words[S] | 0;
|
|
7265
|
+
n.words[S - 10] = (q & g) << 4 | N >>> 22, N = q;
|
|
7266
7266
|
}
|
|
7267
|
-
N >>>= 22, n.words[
|
|
7267
|
+
N >>>= 22, n.words[S - 10] = N, N === 0 && n.length > 10 ? n.length -= 10 : n.length -= 9;
|
|
7268
7268
|
}, H.prototype.imulK = function(n) {
|
|
7269
7269
|
n.words[n.length] = 0, n.words[n.length + 1] = 0, n.length += 2;
|
|
7270
7270
|
for (var d = 0, g = 0; g < n.length; g++) {
|
|
@@ -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,
|
|
7302
|
-
C >>>= 26, n.words[g] =
|
|
7301
|
+
var C = (n.words[g] | 0) * 19 + d, S = C & 67108863;
|
|
7302
|
+
C >>>= 26, n.words[g] = S, d = C;
|
|
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),
|
|
7374
|
-
|
|
7373
|
+
for (var C = this.m.subn(1), S = 0; !C.isZero() && C.andln(1) === 0; )
|
|
7374
|
+
S++, C.iushrn(1);
|
|
7375
7375
|
r(!C.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 =
|
|
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; ) {
|
|
7380
7380
|
for (var re = K, ce = 0; re.cmp(N) !== 0; ce++)
|
|
7381
7381
|
re = re.redSqr();
|
|
7382
7382
|
r(ce < W);
|
|
@@ -7394,17 +7394,17 @@ Uf.exports;
|
|
|
7394
7394
|
return n.clone();
|
|
7395
7395
|
var g = 4, C = new Array(1 << g);
|
|
7396
7396
|
C[0] = new i(1).toRed(this), C[1] = n;
|
|
7397
|
-
for (var
|
|
7398
|
-
C[
|
|
7397
|
+
for (var S = 2; S < C.length; S++)
|
|
7398
|
+
C[S] = this.mul(C[S - 1], n);
|
|
7399
7399
|
var N = C[0], q = 0, D = 0, h = d.bitLength() % 26;
|
|
7400
|
-
for (h === 0 && (h = 26),
|
|
7401
|
-
for (var E = d.words[
|
|
7400
|
+
for (h === 0 && (h = 26), S = d.length - 1; S >= 0; S--) {
|
|
7401
|
+
for (var E = d.words[S], j = h - 1; j >= 0; j--) {
|
|
7402
7402
|
var K = E >> j & 1;
|
|
7403
7403
|
if (N !== C[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 && (
|
|
7407
|
+
q <<= 1, q |= K, D++, !(D !== g && (S !== 0 || j !== 0)) && (N = this.mul(N, C[q]), D = 0, q = 0);
|
|
7408
7408
|
}
|
|
7409
7409
|
h = 26;
|
|
7410
7410
|
}
|
|
@@ -7429,20 +7429,20 @@ 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),
|
|
7433
|
-
return
|
|
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;
|
|
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),
|
|
7438
|
-
return
|
|
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;
|
|
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));
|
|
7441
7441
|
return d._forceRed(this);
|
|
7442
7442
|
};
|
|
7443
7443
|
})(f, Pe);
|
|
7444
7444
|
})(Uf);
|
|
7445
|
-
var pt = Uf.exports,
|
|
7445
|
+
var pt = Uf.exports, It = _n;
|
|
7446
7446
|
function _n(f, e) {
|
|
7447
7447
|
if (!f)
|
|
7448
7448
|
throw new Error(e || "Assertion failed");
|
|
@@ -7491,7 +7491,7 @@ var $f = {};
|
|
|
7491
7491
|
};
|
|
7492
7492
|
})($f);
|
|
7493
7493
|
(function(f) {
|
|
7494
|
-
var e = f, t = pt, r =
|
|
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
7496
|
function i(c, v, b) {
|
|
7497
7497
|
var B = new Array(Math.max(c.bitLength(), b) + 1), w;
|
|
@@ -7499,8 +7499,8 @@ var $f = {};
|
|
|
7499
7499
|
B[w] = 0;
|
|
7500
7500
|
var R = 1 << v + 1, k = c.clone();
|
|
7501
7501
|
for (w = 0; w < B.length; w++) {
|
|
7502
|
-
var z,
|
|
7503
|
-
k.isOdd() ? (
|
|
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);
|
|
7504
7504
|
}
|
|
7505
7505
|
return B;
|
|
7506
7506
|
}
|
|
@@ -7514,10 +7514,10 @@ var $f = {};
|
|
|
7514
7514
|
for (var B = 0, w = 0, R; c.cmpn(-B) > 0 || v.cmpn(-w) > 0; ) {
|
|
7515
7515
|
var k = c.andln(3) + B & 3, z = v.andln(3) + w & 3;
|
|
7516
7516
|
k === 3 && (k = -1), z === 3 && (z = -1);
|
|
7517
|
-
var
|
|
7518
|
-
k & 1 ? (R = c.andln(7) + B & 7, (R === 3 || R === 5) && z === 2 ?
|
|
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);
|
|
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 ===
|
|
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);
|
|
7521
7521
|
}
|
|
7522
7522
|
return b;
|
|
7523
7523
|
}
|
|
@@ -7538,9 +7538,9 @@ var $f = {};
|
|
|
7538
7538
|
}
|
|
7539
7539
|
e.intFromLE = o;
|
|
7540
7540
|
})(Y0);
|
|
7541
|
-
var Wf = { exports: {} },
|
|
7541
|
+
var Wf = { exports: {} }, yf;
|
|
7542
7542
|
Wf.exports = function(e) {
|
|
7543
|
-
return
|
|
7543
|
+
return yf || (yf = new mt(null)), yf.generate(e);
|
|
7544
7544
|
};
|
|
7545
7545
|
function mt(f) {
|
|
7546
7546
|
this.rand = f;
|
|
@@ -7568,7 +7568,7 @@ if (typeof self == "object")
|
|
|
7568
7568
|
});
|
|
7569
7569
|
else
|
|
7570
7570
|
try {
|
|
7571
|
-
var $i =
|
|
7571
|
+
var $i = Ar;
|
|
7572
7572
|
if (typeof $i.randomBytes != "function")
|
|
7573
7573
|
throw new Error("Not supported");
|
|
7574
7574
|
mt.prototype._rand = function(e) {
|
|
@@ -7582,7 +7582,7 @@ function Et(f, e) {
|
|
|
7582
7582
|
var t = this.n && this.p.div(this.n);
|
|
7583
7583
|
!t || t.cmpn(100) > 0 ? this.redN = null : (this._maxwellTrick = !0, this.redN = this.n.toRed(this.red));
|
|
7584
7584
|
}
|
|
7585
|
-
var
|
|
7585
|
+
var wr = Et;
|
|
7586
7586
|
Et.prototype.point = function() {
|
|
7587
7587
|
throw new Error("Not implemented");
|
|
7588
7588
|
};
|
|
@@ -7663,9 +7663,9 @@ Et.prototype._wnafMulAdd = function(e, t, r, a, i) {
|
|
|
7663
7663
|
/* 1 0 */
|
|
7664
7664
|
3
|
|
7665
7665
|
/* 1 1 */
|
|
7666
|
-
],
|
|
7667
|
-
for (o = Math.max(
|
|
7668
|
-
var P =
|
|
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
7669
|
u[w][v] = z[(P + 1) * 3 + (T + 1)], u[R][v] = 0, x[w] = k;
|
|
7670
7670
|
}
|
|
7671
7671
|
}
|
|
@@ -7789,7 +7789,7 @@ typeof Object.create == "function" ? Ff.exports = function(e, t) {
|
|
|
7789
7789
|
r.prototype = t.prototype, e.prototype = new r(), e.prototype.constructor = e;
|
|
7790
7790
|
}
|
|
7791
7791
|
};
|
|
7792
|
-
var
|
|
7792
|
+
var Br = Ff.exports, ys = Y0, g0 = pt, Yf = Br, Ut = wr, gs = ys.assert;
|
|
7793
7793
|
function Z0(f) {
|
|
7794
7794
|
Ut.call(this, "short", f), this.a = new g0(f.a, 16).toRed(this.red), this.b = new g0(f.b, 16).toRed(this.red), this.tinv = this.two.redInvm(), this.zeroA = this.a.fromRed().cmpn(0) === 0, this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0, this.endo = this._getEndomorphism(f), this._endoWnafT1 = new Array(4), this._endoWnafT2 = new Array(4);
|
|
7795
7795
|
}
|
|
@@ -7828,17 +7828,17 @@ 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,
|
|
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; ) {
|
|
7832
7832
|
var P = a.div(r);
|
|
7833
|
-
z = a.sub(P.mul(r)),
|
|
7833
|
+
z = a.sub(P.mul(r)), F = x.sub(P.mul(i));
|
|
7834
7834
|
var T = u.sub(P.mul(y));
|
|
7835
7835
|
if (!v && z.cmp(t) < 0)
|
|
7836
|
-
o = R.neg(), c = i, v = z.neg(), b =
|
|
7836
|
+
o = R.neg(), c = i, v = z.neg(), b = F;
|
|
7837
7837
|
else if (v && ++k === 2)
|
|
7838
7838
|
break;
|
|
7839
|
-
R = z, a = r, r = z, x = i, i =
|
|
7839
|
+
R = z, a = r, r = z, x = i, i = F, u = y, y = T;
|
|
7840
7840
|
}
|
|
7841
|
-
B = z.neg(), w =
|
|
7841
|
+
B = z.neg(), w = F;
|
|
7842
7842
|
var H = v.sqr().add(b.sqr()), $ = B.sqr().add(w.sqr());
|
|
7843
7843
|
return $.cmp(H) >= 0 && (B = o, w = c), v.negative && (v = v.neg(), b = b.neg()), B.negative && (B = B.neg(), w = w.neg()), [
|
|
7844
7844
|
{ a: v, b },
|
|
@@ -8072,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),
|
|
8076
|
-
|
|
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);
|
|
8077
8077
|
var P = c.redMul(u);
|
|
8078
|
-
t + 1 < e && (o = o.redMul(B)), y = k, u = P, c =
|
|
8078
|
+
t + 1 < e && (o = o.redMul(B)), y = k, u = P, c = F;
|
|
8079
8079
|
}
|
|
8080
8080
|
return this.curve.jpoint(y, c.redMul(i), u);
|
|
8081
8081
|
};
|
|
@@ -8173,20 +8173,20 @@ R0.prototype.inspect = function() {
|
|
|
8173
8173
|
R0.prototype.isInfinity = function() {
|
|
8174
8174
|
return this.z.cmpn(0) === 0;
|
|
8175
8175
|
};
|
|
8176
|
-
var
|
|
8176
|
+
var zt = pt, En = Br, Cr = wr, _s = Y0;
|
|
8177
8177
|
function $t(f) {
|
|
8178
|
-
|
|
8178
|
+
Cr.call(this, "mont", f), this.a = new zt(f.a, 16).toRed(this.red), this.b = new zt(f.b, 16).toRed(this.red), this.i4 = new zt(4).toRed(this.red).redInvm(), this.two = new zt(2).toRed(this.red), this.a24 = this.i4.redMul(this.a.redAdd(this.two));
|
|
8179
8179
|
}
|
|
8180
|
-
En($t,
|
|
8180
|
+
En($t, Cr);
|
|
8181
8181
|
var As = $t;
|
|
8182
8182
|
$t.prototype.validate = function(e) {
|
|
8183
8183
|
var t = e.normalize().x, r = t.redSqr(), a = r.redMul(t).redAdd(r.redMul(this.a)).redAdd(t), i = a.redSqrt();
|
|
8184
8184
|
return i.redSqr().cmp(a) === 0;
|
|
8185
8185
|
};
|
|
8186
8186
|
function B0(f, e, t) {
|
|
8187
|
-
|
|
8187
|
+
Cr.BasePoint.call(this, f, "projective"), e === null && t === null ? (this.x = this.curve.one, this.z = this.curve.zero) : (this.x = new zt(e, 16), this.z = new zt(t, 16), this.x.red || (this.x = this.x.toRed(this.curve.red)), this.z.red || (this.z = this.z.toRed(this.curve.red)));
|
|
8188
8188
|
}
|
|
8189
|
-
En(B0,
|
|
8189
|
+
En(B0, Cr.BasePoint);
|
|
8190
8190
|
$t.prototype.decodePoint = function(e, t) {
|
|
8191
8191
|
return this.point(_s.toArray(e, t), 1);
|
|
8192
8192
|
};
|
|
@@ -8243,11 +8243,11 @@ B0.prototype.normalize = function() {
|
|
|
8243
8243
|
B0.prototype.getX = function() {
|
|
8244
8244
|
return this.normalize(), this.x.fromRed();
|
|
8245
8245
|
};
|
|
8246
|
-
var Es = Y0, lt = pt, wn =
|
|
8246
|
+
var Es = Y0, lt = pt, wn = Br, Mr = wr, ws = Es.assert;
|
|
8247
8247
|
function ht(f) {
|
|
8248
|
-
this.twisted = (f.a | 0) !== 1, this.mOneA = this.twisted && (f.a | 0) === -1, this.extended = this.mOneA,
|
|
8248
|
+
this.twisted = (f.a | 0) !== 1, this.mOneA = this.twisted && (f.a | 0) === -1, this.extended = this.mOneA, Mr.call(this, "edwards", f), this.a = new lt(f.a, 16).umod(this.red.m), this.a = this.a.toRed(this.red), this.c = new lt(f.c, 16).toRed(this.red), this.c2 = this.c.redSqr(), this.d = new lt(f.d, 16).toRed(this.red), this.dd = this.d.redAdd(this.d), ws(!this.twisted || this.c.fromRed().cmpn(1) === 0), this.oneC = (f.c | 0) === 1;
|
|
8249
8249
|
}
|
|
8250
|
-
wn(ht,
|
|
8250
|
+
wn(ht, Mr);
|
|
8251
8251
|
var Bs = ht;
|
|
8252
8252
|
ht.prototype._mulA = function(e) {
|
|
8253
8253
|
return this.mOneA ? e.redNeg() : this.a.redMul(e);
|
|
@@ -8287,9 +8287,9 @@ ht.prototype.validate = function(e) {
|
|
|
8287
8287
|
return a.cmp(i) === 0;
|
|
8288
8288
|
};
|
|
8289
8289
|
function v0(f, e, t, r, a) {
|
|
8290
|
-
|
|
8290
|
+
Mr.BasePoint.call(this, f, "projective"), e === null && t === null && r === null ? (this.x = this.curve.zero, this.y = this.curve.one, this.z = this.curve.one, this.t = this.curve.zero, this.zOne = !0) : (this.x = new lt(e, 16), this.y = new lt(t, 16), this.z = r ? new lt(r, 16) : this.curve.one, this.t = a && new lt(a, 16), this.x.red || (this.x = this.x.toRed(this.curve.red)), this.y.red || (this.y = this.y.toRed(this.curve.red)), this.z.red || (this.z = this.z.toRed(this.curve.red)), this.t && !this.t.red && (this.t = this.t.toRed(this.curve.red)), this.zOne = this.z === this.curve.one, this.curve.extended && !this.t && (this.t = this.x.redMul(this.y), this.zOne || (this.t = this.t.redMul(this.z.redInvm()))));
|
|
8291
8291
|
}
|
|
8292
|
-
wn(v0,
|
|
8292
|
+
wn(v0, Mr.BasePoint);
|
|
8293
8293
|
ht.prototype.pointFromJSON = function(e) {
|
|
8294
8294
|
return v0.fromJSON(this, e);
|
|
8295
8295
|
};
|
|
@@ -8382,14 +8382,14 @@ v0.prototype.toP = v0.prototype.normalize;
|
|
|
8382
8382
|
v0.prototype.mixedAdd = v0.prototype.add;
|
|
8383
8383
|
(function(f) {
|
|
8384
8384
|
var e = f;
|
|
8385
|
-
e.base =
|
|
8385
|
+
e.base = wr, e.short = ms, e.mont = As, e.edwards = Bs;
|
|
8386
8386
|
})(Kf);
|
|
8387
|
-
var
|
|
8387
|
+
var Sr = {}, Fr = {}, Le = {}, Cs = It, Ms = Br;
|
|
8388
8388
|
Le.inherits = Ms;
|
|
8389
|
-
function
|
|
8389
|
+
function Ss(f, e) {
|
|
8390
8390
|
return (f.charCodeAt(e) & 64512) !== 55296 || e < 0 || e + 1 >= f.length ? !1 : (f.charCodeAt(e + 1) & 64512) === 56320;
|
|
8391
8391
|
}
|
|
8392
|
-
function
|
|
8392
|
+
function Fs(f, e) {
|
|
8393
8393
|
if (Array.isArray(f))
|
|
8394
8394
|
return f.slice();
|
|
8395
8395
|
if (!f)
|
|
@@ -8403,14 +8403,14 @@ function Ss(f, e) {
|
|
|
8403
8403
|
} else
|
|
8404
8404
|
for (var r = 0, a = 0; a < f.length; a++) {
|
|
8405
8405
|
var i = f.charCodeAt(a);
|
|
8406
|
-
i < 128 ? t[r++] = i : i < 2048 ? (t[r++] = i >> 6 | 192, t[r++] = i & 63 | 128) :
|
|
8406
|
+
i < 128 ? t[r++] = i : i < 2048 ? (t[r++] = i >> 6 | 192, t[r++] = i & 63 | 128) : Ss(f, a) ? (i = 65536 + ((i & 1023) << 10) + (f.charCodeAt(++a) & 1023), t[r++] = i >> 18 | 240, t[r++] = i >> 12 & 63 | 128, t[r++] = i >> 6 & 63 | 128, t[r++] = i & 63 | 128) : (t[r++] = i >> 12 | 224, t[r++] = i >> 6 & 63 | 128, t[r++] = i & 63 | 128);
|
|
8407
8407
|
}
|
|
8408
8408
|
else
|
|
8409
8409
|
for (a = 0; a < f.length; a++)
|
|
8410
8410
|
t[a] = f[a] | 0;
|
|
8411
8411
|
return t;
|
|
8412
8412
|
}
|
|
8413
|
-
Le.toArray =
|
|
8413
|
+
Le.toArray = Fs;
|
|
8414
8414
|
function Ds(f) {
|
|
8415
8415
|
for (var e = "", t = 0; t < f.length; t++)
|
|
8416
8416
|
e += Cn(f[t].toString(16));
|
|
@@ -8538,12 +8538,12 @@ function Zs(f, e, t) {
|
|
|
8538
8538
|
return r >>> 0;
|
|
8539
8539
|
}
|
|
8540
8540
|
Le.shr64_lo = Zs;
|
|
8541
|
-
var Wt = {}, Wi = Le, Gs =
|
|
8542
|
-
function
|
|
8541
|
+
var Wt = {}, Wi = Le, Gs = It;
|
|
8542
|
+
function Dr() {
|
|
8543
8543
|
this.pending = null, this.pendingTotal = 0, this.blockSize = this.constructor.blockSize, this.outSize = this.constructor.outSize, this.hmacStrength = this.constructor.hmacStrength, this.padLength = this.constructor.padLength / 8, this.endian = "big", this._delta8 = this.blockSize / 8, this._delta32 = this.blockSize / 32;
|
|
8544
8544
|
}
|
|
8545
|
-
Wt.BlockHash =
|
|
8546
|
-
|
|
8545
|
+
Wt.BlockHash = Dr;
|
|
8546
|
+
Dr.prototype.update = function(e, t) {
|
|
8547
8547
|
if (e = Wi.toArray(e, t), this.pending ? this.pending = this.pending.concat(e) : this.pending = e, this.pendingTotal += e.length, this.pending.length >= this._delta8) {
|
|
8548
8548
|
e = this.pending;
|
|
8549
8549
|
var r = e.length % this._delta8;
|
|
@@ -8553,10 +8553,10 @@ Sr.prototype.update = function(e, t) {
|
|
|
8553
8553
|
}
|
|
8554
8554
|
return this;
|
|
8555
8555
|
};
|
|
8556
|
-
|
|
8556
|
+
Dr.prototype.digest = function(e) {
|
|
8557
8557
|
return this.update(this._pad()), Gs(this.pending === null), this._digest(e);
|
|
8558
8558
|
};
|
|
8559
|
-
|
|
8559
|
+
Dr.prototype._pad = function() {
|
|
8560
8560
|
var e = this.pendingTotal, t = this._delta8, r = t - (e + this.padLength) % t, a = new Array(r + this.padLength);
|
|
8561
8561
|
a[0] = 128;
|
|
8562
8562
|
for (var i = 1; i < r; i++)
|
|
@@ -8573,21 +8573,21 @@ Sr.prototype._pad = function() {
|
|
|
8573
8573
|
var Kt = {}, ut = {}, Qs = Le, ft = Qs.rotr32;
|
|
8574
8574
|
function Js(f, e, t, r) {
|
|
8575
8575
|
if (f === 0)
|
|
8576
|
-
return
|
|
8576
|
+
return Sn(e, t, r);
|
|
8577
8577
|
if (f === 1 || f === 3)
|
|
8578
8578
|
return Dn(e, t, r);
|
|
8579
8579
|
if (f === 2)
|
|
8580
|
-
return
|
|
8580
|
+
return Fn(e, t, r);
|
|
8581
8581
|
}
|
|
8582
8582
|
ut.ft_1 = Js;
|
|
8583
|
-
function
|
|
8583
|
+
function Sn(f, e, t) {
|
|
8584
8584
|
return f & e ^ ~f & t;
|
|
8585
8585
|
}
|
|
8586
|
-
ut.ch32 =
|
|
8587
|
-
function
|
|
8586
|
+
ut.ch32 = Sn;
|
|
8587
|
+
function Fn(f, e, t) {
|
|
8588
8588
|
return f & e ^ f & t ^ e & t;
|
|
8589
8589
|
}
|
|
8590
|
-
ut.maj32 =
|
|
8590
|
+
ut.maj32 = Fn;
|
|
8591
8591
|
function Dn(f, e, t) {
|
|
8592
8592
|
return f ^ e ^ t;
|
|
8593
8593
|
}
|
|
@@ -8608,7 +8608,7 @@ function fo(f) {
|
|
|
8608
8608
|
return ft(f, 17) ^ ft(f, 19) ^ f >>> 10;
|
|
8609
8609
|
}
|
|
8610
8610
|
ut.g1_256 = fo;
|
|
8611
|
-
var Nt = Le, io = Wt, no = ut,
|
|
8611
|
+
var Nt = Le, io = Wt, no = ut, gf = Nt.rotl32, Gt = Nt.sum32, ao = Nt.sum32_5, so = no.ft_1, Rn = io.BlockHash, oo = [
|
|
8612
8612
|
1518500249,
|
|
8613
8613
|
1859775393,
|
|
8614
8614
|
2400959708,
|
|
@@ -8635,18 +8635,18 @@ st.prototype._update = function(e, t) {
|
|
|
8635
8635
|
for (var r = this.W, a = 0; a < 16; a++)
|
|
8636
8636
|
r[a] = e[t + a];
|
|
8637
8637
|
for (; a < r.length; a++)
|
|
8638
|
-
r[a] =
|
|
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(
|
|
8642
|
-
o = u, u = x, x =
|
|
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;
|
|
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
|
};
|
|
8646
8646
|
st.prototype._digest = function(e) {
|
|
8647
8647
|
return e === "hex" ? Nt.toHex32(this.h, "big") : Nt.split32(this.h, "big");
|
|
8648
8648
|
};
|
|
8649
|
-
var qt = Le, ho = Wt, Yt = ut, uo =
|
|
8649
|
+
var qt = Le, ho = Wt, Yt = ut, uo = It, J0 = qt.sum32, lo = qt.sum32_4, xo = qt.sum32_5, vo = Yt.ch32, bo = Yt.maj32, po = Yt.s0_256, yo = Yt.s1_256, go = Yt.g0_256, mo = Yt.g1_256, kn = ho.BlockHash, _o = [
|
|
8650
8650
|
1116352408,
|
|
8651
8651
|
1899447441,
|
|
8652
8652
|
3049323471,
|
|
@@ -8747,7 +8747,7 @@ ot.prototype._update = function(e, t) {
|
|
|
8747
8747
|
ot.prototype._digest = function(e) {
|
|
8748
8748
|
return e === "hex" ? qt.toHex32(this.h, "big") : qt.split32(this.h, "big");
|
|
8749
8749
|
};
|
|
8750
|
-
var
|
|
8750
|
+
var Df = Le, In = Pn;
|
|
8751
8751
|
function vt() {
|
|
8752
8752
|
if (!(this instanceof vt))
|
|
8753
8753
|
return new vt();
|
|
@@ -8762,16 +8762,16 @@ function vt() {
|
|
|
8762
8762
|
3204075428
|
|
8763
8763
|
];
|
|
8764
8764
|
}
|
|
8765
|
-
|
|
8765
|
+
Df.inherits(vt, In);
|
|
8766
8766
|
var Ao = vt;
|
|
8767
8767
|
vt.blockSize = 512;
|
|
8768
8768
|
vt.outSize = 224;
|
|
8769
8769
|
vt.hmacStrength = 192;
|
|
8770
8770
|
vt.padLength = 64;
|
|
8771
8771
|
vt.prototype._digest = function(e) {
|
|
8772
|
-
return e === "hex" ?
|
|
8772
|
+
return e === "hex" ? Df.toHex32(this.h.slice(0, 7), "big") : Df.split32(this.h.slice(0, 7), "big");
|
|
8773
8773
|
};
|
|
8774
|
-
var H0 = Le, Eo = Wt, wo =
|
|
8774
|
+
var H0 = Le, Eo = Wt, wo = It, it = H0.rotr64_hi, nt = H0.rotr64_lo, Tn = H0.shr64_hi, On = H0.shr64_lo, gt = H0.sum64, mf = H0.sum64_hi, _f = H0.sum64_lo, Bo = H0.sum64_4_hi, Co = H0.sum64_4_lo, Mo = H0.sum64_5_hi, So = H0.sum64_5_lo, zn = Eo.BlockHash, Fo = [
|
|
8775
8775
|
1116352408,
|
|
8776
8776
|
3609767458,
|
|
8777
8777
|
1899447441,
|
|
@@ -8953,7 +8953,7 @@ function tt() {
|
|
|
8953
8953
|
4215389547,
|
|
8954
8954
|
1541459225,
|
|
8955
8955
|
327033209
|
|
8956
|
-
], this.k =
|
|
8956
|
+
], this.k = Fo, this.W = new Array(160);
|
|
8957
8957
|
}
|
|
8958
8958
|
H0.inherits(tt, zn);
|
|
8959
8959
|
var Nn = tt;
|
|
@@ -8989,10 +8989,10 @@ tt.prototype._prepareBlock = function(e, t) {
|
|
|
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],
|
|
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];
|
|
8993
8993
|
wo(this.k.length === r.length);
|
|
8994
8994
|
for (var T = 0; T < r.length; T += 2) {
|
|
8995
|
-
var H =
|
|
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(
|
|
8996
8996
|
H,
|
|
8997
8997
|
$,
|
|
8998
8998
|
Y,
|
|
@@ -9003,7 +9003,7 @@ tt.prototype._update = function(e, t) {
|
|
|
9003
9003
|
n,
|
|
9004
9004
|
d,
|
|
9005
9005
|
g
|
|
9006
|
-
),
|
|
9006
|
+
), S = So(
|
|
9007
9007
|
H,
|
|
9008
9008
|
$,
|
|
9009
9009
|
Y,
|
|
@@ -9016,10 +9016,10 @@ tt.prototype._update = function(e, t) {
|
|
|
9016
9016
|
g
|
|
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
|
-
var N =
|
|
9020
|
-
|
|
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);
|
|
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,
|
|
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);
|
|
9023
9023
|
};
|
|
9024
9024
|
tt.prototype._digest = function(e) {
|
|
9025
9025
|
return e === "hex" ? H0.toHex32(this.h, "big") : H0.split32(this.h, "big");
|
|
@@ -9072,7 +9072,7 @@ function Ho(f, e) {
|
|
|
9072
9072
|
var t = nt(f, e, 19), r = nt(e, f, 29), a = On(f, e, 6), i = t ^ r ^ a;
|
|
9073
9073
|
return i < 0 && (i += 4294967296), i;
|
|
9074
9074
|
}
|
|
9075
|
-
var
|
|
9075
|
+
var Rf = Le, qn = Nn;
|
|
9076
9076
|
function bt() {
|
|
9077
9077
|
if (!(this instanceof bt))
|
|
9078
9078
|
return new bt();
|
|
@@ -9095,27 +9095,27 @@ function bt() {
|
|
|
9095
9095
|
3204075428
|
|
9096
9096
|
];
|
|
9097
9097
|
}
|
|
9098
|
-
|
|
9098
|
+
Rf.inherits(bt, qn);
|
|
9099
9099
|
var Uo = bt;
|
|
9100
9100
|
bt.blockSize = 1024;
|
|
9101
9101
|
bt.outSize = 384;
|
|
9102
9102
|
bt.hmacStrength = 192;
|
|
9103
9103
|
bt.padLength = 128;
|
|
9104
9104
|
bt.prototype._digest = function(e) {
|
|
9105
|
-
return e === "hex" ?
|
|
9105
|
+
return e === "hex" ? Rf.toHex32(this.h.slice(0, 12), "big") : Rf.split32(this.h.slice(0, 12), "big");
|
|
9106
9106
|
};
|
|
9107
9107
|
Kt.sha1 = co;
|
|
9108
9108
|
Kt.sha224 = Ao;
|
|
9109
9109
|
Kt.sha256 = Pn;
|
|
9110
9110
|
Kt.sha384 = Uo;
|
|
9111
9111
|
Kt.sha512 = Nn;
|
|
9112
|
-
var Ln = {},
|
|
9112
|
+
var Ln = {}, Rt = Le, $o = Wt, sr = Rt.rotl32, Ki = Rt.sum32, Qt = Rt.sum32_3, Yi = Rt.sum32_4, Hn = $o.BlockHash;
|
|
9113
9113
|
function ct() {
|
|
9114
9114
|
if (!(this instanceof ct))
|
|
9115
9115
|
return new ct();
|
|
9116
9116
|
Hn.call(this), this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], this.endian = "little";
|
|
9117
9117
|
}
|
|
9118
|
-
|
|
9118
|
+
Rt.inherits(ct, Hn);
|
|
9119
9119
|
Ln.ripemd160 = ct;
|
|
9120
9120
|
ct.blockSize = 512;
|
|
9121
9121
|
ct.outSize = 160;
|
|
@@ -9141,7 +9141,7 @@ ct.prototype._update = function(e, t) {
|
|
|
9141
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;
|
|
9142
9142
|
};
|
|
9143
9143
|
ct.prototype._digest = function(e) {
|
|
9144
|
-
return e === "hex" ?
|
|
9144
|
+
return e === "hex" ? Rt.toHex32(this.h, "little") : Rt.split32(this.h, "little");
|
|
9145
9145
|
};
|
|
9146
9146
|
function ji(f, e, t, r) {
|
|
9147
9147
|
return f <= 15 ? e ^ t ^ r : f <= 31 ? e & t | ~e & r : f <= 47 ? (e | ~t) ^ r : f <= 63 ? e & r | t & ~r : e ^ (t | ~r);
|
|
@@ -9476,7 +9476,7 @@ var Yo = [
|
|
|
9476
9476
|
13,
|
|
9477
9477
|
11,
|
|
9478
9478
|
11
|
|
9479
|
-
], Zo = Le, Go =
|
|
9479
|
+
], Zo = Le, Go = It;
|
|
9480
9480
|
function Lt(f, e, t) {
|
|
9481
9481
|
if (!(this instanceof Lt))
|
|
9482
9482
|
return new Lt(f, e, t);
|
|
@@ -9503,9 +9503,9 @@ Lt.prototype.digest = function(e) {
|
|
|
9503
9503
|
var e = f;
|
|
9504
9504
|
e.utils = Le, e.common = Wt, e.sha = Kt, e.ripemd = Ln, e.hmac = Qo, e.sha1 = e.sha.sha1, e.sha256 = e.sha.sha256, e.sha224 = e.sha.sha224, e.sha384 = e.sha.sha384, e.sha512 = e.sha.sha512, e.ripemd160 = e.ripemd.ripemd160;
|
|
9505
9505
|
})(Fr);
|
|
9506
|
-
var
|
|
9506
|
+
var Af, Vi;
|
|
9507
9507
|
function Jo() {
|
|
9508
|
-
return Vi || (Vi = 1,
|
|
9508
|
+
return Vi || (Vi = 1, Af = {
|
|
9509
9509
|
doubles: {
|
|
9510
9510
|
step: 4,
|
|
9511
9511
|
points: [
|
|
@@ -10284,7 +10284,7 @@ function Jo() {
|
|
|
10284
10284
|
]
|
|
10285
10285
|
]
|
|
10286
10286
|
}
|
|
10287
|
-
}),
|
|
10287
|
+
}), Af;
|
|
10288
10288
|
}
|
|
10289
10289
|
(function(f) {
|
|
10290
10290
|
var e = f, t = Fr, r = Kf, a = Y0, i = a.assert;
|
|
@@ -10435,8 +10435,8 @@ function Jo() {
|
|
|
10435
10435
|
u
|
|
10436
10436
|
]
|
|
10437
10437
|
});
|
|
10438
|
-
})(
|
|
10439
|
-
var ec = Fr, Mt = $f, Un =
|
|
10438
|
+
})(Sr);
|
|
10439
|
+
var ec = Fr, Mt = $f, Un = It;
|
|
10440
10440
|
function _t(f) {
|
|
10441
10441
|
if (!(this instanceof _t))
|
|
10442
10442
|
return new _t(f);
|
|
@@ -10477,7 +10477,7 @@ _t.prototype.generate = function(e, t, r, a) {
|
|
|
10477
10477
|
var y = i.slice(0, e);
|
|
10478
10478
|
return this._update(r), this._reseed++, Mt.encode(y, t);
|
|
10479
10479
|
};
|
|
10480
|
-
var rc = pt, fc = Y0,
|
|
10480
|
+
var rc = pt, fc = Y0, kf = fc.assert;
|
|
10481
10481
|
function T0(f, e) {
|
|
10482
10482
|
this.ec = f, this.priv = null, this.pub = null, e.priv && this._importPrivate(e.priv, e.privEnc), e.pub && this._importPublic(e.pub, e.pubEnc);
|
|
10483
10483
|
}
|
|
@@ -10509,13 +10509,13 @@ T0.prototype._importPrivate = function(e, t) {
|
|
|
10509
10509
|
};
|
|
10510
10510
|
T0.prototype._importPublic = function(e, t) {
|
|
10511
10511
|
if (e.x || e.y) {
|
|
10512
|
-
this.ec.curve.type === "mont" ?
|
|
10512
|
+
this.ec.curve.type === "mont" ? kf(e.x, "Need x coordinate") : (this.ec.curve.type === "short" || this.ec.curve.type === "edwards") && kf(e.x && e.y, "Need both x and y coordinate"), this.pub = this.ec.curve.point(e.x, e.y);
|
|
10513
10513
|
return;
|
|
10514
10514
|
}
|
|
10515
10515
|
this.pub = this.ec.curve.decodePoint(e, t);
|
|
10516
10516
|
};
|
|
10517
10517
|
T0.prototype.derive = function(e) {
|
|
10518
|
-
return e.validate() ||
|
|
10518
|
+
return e.validate() || kf(e.validate(), "public point not validated"), e.mul(this.priv).getX();
|
|
10519
10519
|
};
|
|
10520
10520
|
T0.prototype.sign = function(e, t, r) {
|
|
10521
10521
|
return this.ec.sign(e, this, t, r);
|
|
@@ -10527,16 +10527,16 @@ T0.prototype.inspect = function() {
|
|
|
10527
10527
|
return "<Key priv: " + (this.priv && this.priv.toString(16, 2)) + " pub: " + (this.pub && this.pub.inspect()) + " >";
|
|
10528
10528
|
};
|
|
10529
10529
|
var gr = pt, jf = Y0, nc = jf.assert;
|
|
10530
|
-
function
|
|
10531
|
-
if (f instanceof
|
|
10530
|
+
function Rr(f, e) {
|
|
10531
|
+
if (f instanceof Rr)
|
|
10532
10532
|
return f;
|
|
10533
10533
|
this._importDER(f, e) || (nc(f.r && f.s, "Signature without r or s"), this.r = new gr(f.r, 16), this.s = new gr(f.s, 16), f.recoveryParam === void 0 ? this.recoveryParam = null : this.recoveryParam = f.recoveryParam);
|
|
10534
10534
|
}
|
|
10535
|
-
var ac =
|
|
10535
|
+
var ac = Rr;
|
|
10536
10536
|
function sc() {
|
|
10537
10537
|
this.place = 0;
|
|
10538
10538
|
}
|
|
10539
|
-
function
|
|
10539
|
+
function Ef(f, e) {
|
|
10540
10540
|
var t = f[e.place++];
|
|
10541
10541
|
if (!(t & 128))
|
|
10542
10542
|
return t;
|
|
@@ -10552,21 +10552,21 @@ function Xi(f) {
|
|
|
10552
10552
|
e++;
|
|
10553
10553
|
return e === 0 ? f : f.slice(e);
|
|
10554
10554
|
}
|
|
10555
|
-
|
|
10555
|
+
Rr.prototype._importDER = function(e, t) {
|
|
10556
10556
|
e = jf.toArray(e, t);
|
|
10557
10557
|
var r = new sc();
|
|
10558
10558
|
if (e[r.place++] !== 48)
|
|
10559
10559
|
return !1;
|
|
10560
|
-
var a =
|
|
10560
|
+
var a = Ef(e, r);
|
|
10561
10561
|
if (a === !1 || a + r.place !== e.length || e[r.place++] !== 2)
|
|
10562
10562
|
return !1;
|
|
10563
|
-
var i =
|
|
10563
|
+
var i = Ef(e, r);
|
|
10564
10564
|
if (i === !1)
|
|
10565
10565
|
return !1;
|
|
10566
10566
|
var y = e.slice(r.place, i + r.place);
|
|
10567
10567
|
if (r.place += i, e[r.place++] !== 2)
|
|
10568
10568
|
return !1;
|
|
10569
|
-
var x =
|
|
10569
|
+
var x = Ef(e, r);
|
|
10570
10570
|
if (x === !1 || e.length !== x + r.place)
|
|
10571
10571
|
return !1;
|
|
10572
10572
|
var u = e.slice(r.place, x + r.place);
|
|
@@ -10582,7 +10582,7 @@ Dr.prototype._importDER = function(e, t) {
|
|
|
10582
10582
|
return !1;
|
|
10583
10583
|
return this.r = new gr(y), this.s = new gr(u), this.recoveryParam = null, !0;
|
|
10584
10584
|
};
|
|
10585
|
-
function
|
|
10585
|
+
function wf(f, e) {
|
|
10586
10586
|
if (e < 128) {
|
|
10587
10587
|
f.push(e);
|
|
10588
10588
|
return;
|
|
@@ -10592,23 +10592,23 @@ function Ef(f, e) {
|
|
|
10592
10592
|
f.push(e >>> (t << 3) & 255);
|
|
10593
10593
|
f.push(e);
|
|
10594
10594
|
}
|
|
10595
|
-
|
|
10595
|
+
Rr.prototype.toDER = function(e) {
|
|
10596
10596
|
var t = this.r.toArray(), r = this.s.toArray();
|
|
10597
10597
|
for (t[0] & 128 && (t = [0].concat(t)), r[0] & 128 && (r = [0].concat(r)), t = Xi(t), r = Xi(r); !r[0] && !(r[1] & 128); )
|
|
10598
10598
|
r = r.slice(1);
|
|
10599
10599
|
var a = [2];
|
|
10600
|
-
|
|
10600
|
+
wf(a, t.length), a = a.concat(t), a.push(2), wf(a, r.length);
|
|
10601
10601
|
var i = a.concat(r), y = [48];
|
|
10602
|
-
return
|
|
10602
|
+
return wf(y, i.length), y = y.concat(i), jf.encode(y, e);
|
|
10603
10603
|
};
|
|
10604
|
-
var
|
|
10604
|
+
var St = pt, $n = tc, oc = Y0, Bf = Sr, cc = An, Wn = oc.assert, Vf = ic, kr = ac;
|
|
10605
10605
|
function V0(f) {
|
|
10606
10606
|
if (!(this instanceof V0))
|
|
10607
10607
|
return new V0(f);
|
|
10608
10608
|
typeof f == "string" && (Wn(
|
|
10609
|
-
Object.prototype.hasOwnProperty.call(
|
|
10609
|
+
Object.prototype.hasOwnProperty.call(Bf, f),
|
|
10610
10610
|
"Unknown curve " + f
|
|
10611
|
-
), f =
|
|
10611
|
+
), f = Bf[f]), f instanceof Bf.PresetCurve && (f = { curve: f }), this.curve = f.curve.curve, this.n = this.curve.n, this.nh = this.n.ushrn(1), this.g = this.curve.g, this.g = f.curve.g, this.g.precompute(f.curve.n.bitLength() + 1), this.hash = f.hash || f.curve.hash;
|
|
10612
10612
|
}
|
|
10613
10613
|
var dc = V0;
|
|
10614
10614
|
V0.prototype.keyPair = function(e) {
|
|
@@ -10629,8 +10629,8 @@ V0.prototype.genKeyPair = function(e) {
|
|
|
10629
10629
|
entropy: e.entropy || cc(this.hash.hmacStrength),
|
|
10630
10630
|
entropyEnc: e.entropy && e.entropyEnc || "utf8",
|
|
10631
10631
|
nonce: this.n.toArray()
|
|
10632
|
-
}), r = this.n.byteLength(), a = this.n.sub(new
|
|
10633
|
-
var i = new
|
|
10632
|
+
}), r = this.n.byteLength(), a = this.n.sub(new St(2)); ; ) {
|
|
10633
|
+
var i = new St(t.generate(r));
|
|
10634
10634
|
if (!(i.cmp(a) > 0))
|
|
10635
10635
|
return i.iaddn(1), this.keyFromPrivate(i);
|
|
10636
10636
|
}
|
|
@@ -10640,15 +10640,15 @@ V0.prototype._truncateToN = function(e, t) {
|
|
|
10640
10640
|
return r > 0 && (e = e.ushrn(r)), !t && e.cmp(this.n) >= 0 ? e.sub(this.n) : e;
|
|
10641
10641
|
};
|
|
10642
10642
|
V0.prototype.sign = function(e, t, r, a) {
|
|
10643
|
-
typeof r == "object" && (a = r, r = null), a || (a = {}), t = this.keyFromPrivate(t, r), e = this._truncateToN(new
|
|
10643
|
+
typeof r == "object" && (a = r, r = null), a || (a = {}), t = this.keyFromPrivate(t, r), e = this._truncateToN(new St(e, 16));
|
|
10644
10644
|
for (var i = this.n.byteLength(), y = t.getPrivate().toArray("be", i), x = e.toArray("be", i), u = new $n({
|
|
10645
10645
|
hash: this.hash,
|
|
10646
10646
|
entropy: y,
|
|
10647
10647
|
nonce: x,
|
|
10648
10648
|
pers: a.pers,
|
|
10649
10649
|
persEnc: a.persEnc || "utf8"
|
|
10650
|
-
}), o = this.n.sub(new
|
|
10651
|
-
var v = a.k ? a.k(c) : new
|
|
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
10652
|
if (v = this._truncateToN(v, !0), !(v.cmpn(1) <= 0 || v.cmp(o) >= 0)) {
|
|
10653
10653
|
var b = this.g.mul(v);
|
|
10654
10654
|
if (!b.isInfinity()) {
|
|
@@ -10657,7 +10657,7 @@ V0.prototype.sign = function(e, t, r, a) {
|
|
|
10657
10657
|
var R = v.invm(this.n).mul(w.mul(t.getPrivate()).iadd(e));
|
|
10658
10658
|
if (R = R.umod(this.n), R.cmpn(0) !== 0) {
|
|
10659
10659
|
var k = (b.getY().isOdd() ? 1 : 0) | (B.cmp(w) !== 0 ? 2 : 0);
|
|
10660
|
-
return a.canonical && R.cmp(this.nh) > 0 && (R = this.n.sub(R), k ^= 1), new
|
|
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
|
}
|
|
10663
10663
|
}
|
|
@@ -10665,7 +10665,7 @@ V0.prototype.sign = function(e, t, r, a) {
|
|
|
10665
10665
|
}
|
|
10666
10666
|
};
|
|
10667
10667
|
V0.prototype.verify = function(e, t, r, a) {
|
|
10668
|
-
e = this._truncateToN(new
|
|
10668
|
+
e = this._truncateToN(new St(e, 16)), r = this.keyFromPublic(r, a), t = new kr(t, "hex");
|
|
10669
10669
|
var i = t.r, y = t.s;
|
|
10670
10670
|
if (i.cmpn(1) < 0 || i.cmp(this.n) >= 0 || y.cmpn(1) < 0 || y.cmp(this.n) >= 0)
|
|
10671
10671
|
return !1;
|
|
@@ -10673,8 +10673,8 @@ V0.prototype.verify = function(e, t, r, a) {
|
|
|
10673
10673
|
return this.curve._maxwellTrick ? (c = this.g.jmulAdd(u, r.getPublic(), o), c.isInfinity() ? !1 : c.eqXToP(i)) : (c = this.g.mulAdd(u, r.getPublic(), o), c.isInfinity() ? !1 : c.getX().umod(this.n).cmp(i) === 0);
|
|
10674
10674
|
};
|
|
10675
10675
|
V0.prototype.recoverPubKey = function(f, e, t, r) {
|
|
10676
|
-
Wn((3 & t) === t, "The recovery param is more than two bits"), e = new
|
|
10677
|
-
var a = this.n, i = new
|
|
10676
|
+
Wn((3 & t) === t, "The recovery param is more than two bits"), e = new kr(e, r);
|
|
10677
|
+
var a = this.n, i = new St(f), y = e.r, x = e.s, u = t & 1, o = t >> 1;
|
|
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);
|
|
@@ -10682,7 +10682,7 @@ V0.prototype.recoverPubKey = function(f, e, t, r) {
|
|
|
10682
10682
|
return this.g.mulAdd(v, y, b);
|
|
10683
10683
|
};
|
|
10684
10684
|
V0.prototype.getKeyRecoveryParam = function(f, e, t, r) {
|
|
10685
|
-
if (e = new
|
|
10685
|
+
if (e = new kr(e, r), e.recoveryParam !== null)
|
|
10686
10686
|
return e.recoveryParam;
|
|
10687
10687
|
for (var a = 0; a < 4; a++) {
|
|
10688
10688
|
var i;
|
|
@@ -10740,32 +10740,32 @@ w0.prototype.getSecret = function(e) {
|
|
|
10740
10740
|
w0.prototype.getPublic = function(e) {
|
|
10741
10741
|
return nr.encode(this.pubBytes(), e);
|
|
10742
10742
|
};
|
|
10743
|
-
var hc = w0, uc = pt,
|
|
10744
|
-
function
|
|
10743
|
+
var hc = w0, uc = pt, Pr = Y0, lc = Pr.assert, Ir = Pr.cachedProperty, xc = Pr.parseBytes;
|
|
10744
|
+
function Tt(f, e) {
|
|
10745
10745
|
this.eddsa = f, typeof e != "object" && (e = xc(e)), Array.isArray(e) && (e = {
|
|
10746
10746
|
R: e.slice(0, f.encodingLength),
|
|
10747
10747
|
S: e.slice(f.encodingLength)
|
|
10748
10748
|
}), lc(e.R && e.S, "Signature without R or S"), f.isPoint(e.R) && (this._R = e.R), e.S instanceof uc && (this._S = e.S), this._Rencoded = Array.isArray(e.R) ? e.R : e.Rencoded, this._Sencoded = Array.isArray(e.S) ? e.S : e.Sencoded;
|
|
10749
10749
|
}
|
|
10750
|
-
|
|
10750
|
+
Ir(Tt, "S", function() {
|
|
10751
10751
|
return this.eddsa.decodeInt(this.Sencoded());
|
|
10752
10752
|
});
|
|
10753
|
-
|
|
10753
|
+
Ir(Tt, "R", function() {
|
|
10754
10754
|
return this.eddsa.decodePoint(this.Rencoded());
|
|
10755
10755
|
});
|
|
10756
|
-
|
|
10756
|
+
Ir(Tt, "Rencoded", function() {
|
|
10757
10757
|
return this.eddsa.encodePoint(this.R());
|
|
10758
10758
|
});
|
|
10759
|
-
|
|
10759
|
+
Ir(Tt, "Sencoded", function() {
|
|
10760
10760
|
return this.eddsa.encodeInt(this.S());
|
|
10761
10761
|
});
|
|
10762
|
-
|
|
10762
|
+
Tt.prototype.toBytes = function() {
|
|
10763
10763
|
return this.Rencoded().concat(this.Sencoded());
|
|
10764
10764
|
};
|
|
10765
|
-
|
|
10766
|
-
return
|
|
10765
|
+
Tt.prototype.toHex = function() {
|
|
10766
|
+
return Pr.encode(this.toBytes(), "hex").toUpperCase();
|
|
10767
10767
|
};
|
|
10768
|
-
var vc =
|
|
10768
|
+
var vc = Tt, bc = Fr, pc = Sr, Ht = Y0, yc = Ht.assert, Yn = Ht.parseBytes, jn = hc, Gi = vc;
|
|
10769
10769
|
function U0(f) {
|
|
10770
10770
|
if (yc(f === "ed25519", "only tested with ed25519 so far"), !(this instanceof U0))
|
|
10771
10771
|
return new U0(f);
|
|
@@ -10816,7 +10816,7 @@ U0.prototype.isPoint = function(e) {
|
|
|
10816
10816
|
};
|
|
10817
10817
|
(function(f) {
|
|
10818
10818
|
var e = f;
|
|
10819
|
-
e.version = bs.version, e.utils = Y0, e.rand = An, e.curve = Kf, e.curves =
|
|
10819
|
+
e.version = bs.version, e.utils = Y0, e.rand = An, e.curve = Kf, e.curves = Sr, e.ec = dc, e.eddsa = gc;
|
|
10820
10820
|
})(mn);
|
|
10821
10821
|
var Vn = { exports: {} };
|
|
10822
10822
|
(function(f) {
|
|
@@ -10847,7 +10847,7 @@ var Vn = { exports: {} };
|
|
|
10847
10847
|
function z(l, _, m, s) {
|
|
10848
10848
|
return R(l, _, m, s, 32);
|
|
10849
10849
|
}
|
|
10850
|
-
function
|
|
10850
|
+
function F(l, _, m, s) {
|
|
10851
10851
|
for (var M = s[0] & 255 | (s[1] & 255) << 8 | (s[2] & 255) << 16 | (s[3] & 255) << 24, p = m[0] & 255 | (m[1] & 255) << 8 | (m[2] & 255) << 16 | (m[3] & 255) << 24, I = m[4] & 255 | (m[5] & 255) << 8 | (m[6] & 255) << 16 | (m[7] & 255) << 24, L = m[8] & 255 | (m[9] & 255) << 8 | (m[10] & 255) << 16 | (m[11] & 255) << 24, V = m[12] & 255 | (m[13] & 255) << 8 | (m[14] & 255) << 16 | (m[15] & 255) << 24, ne = s[4] & 255 | (s[5] & 255) << 8 | (s[6] & 255) << 16 | (s[7] & 255) << 24, fe = _[0] & 255 | (_[1] & 255) << 8 | (_[2] & 255) << 16 | (_[3] & 255) << 24, he = _[4] & 255 | (_[5] & 255) << 8 | (_[6] & 255) << 16 | (_[7] & 255) << 24, te = _[8] & 255 | (_[9] & 255) << 8 | (_[10] & 255) << 16 | (_[11] & 255) << 24, xe = _[12] & 255 | (_[13] & 255) << 8 | (_[14] & 255) << 16 | (_[15] & 255) << 24, ue = s[8] & 255 | (s[9] & 255) << 8 | (s[10] & 255) << 16 | (s[11] & 255) << 24, ve = m[16] & 255 | (m[17] & 255) << 8 | (m[18] & 255) << 16 | (m[19] & 255) << 24, ge = m[20] & 255 | (m[21] & 255) << 8 | (m[22] & 255) << 16 | (m[23] & 255) << 24, me = m[24] & 255 | (m[25] & 255) << 8 | (m[26] & 255) << 16 | (m[27] & 255) << 24, _e = m[28] & 255 | (m[29] & 255) << 8 | (m[30] & 255) << 16 | (m[31] & 255) << 24, pe = s[12] & 255 | (s[13] & 255) << 8 | (s[14] & 255) << 16 | (s[15] & 255) << 24, de = M, ye = p, oe = I, le = L, be = V, se = ne, Z = fe, G = he, ie = te, J = xe, ee = ue, ae = ve, Ee = ge, Be = me, De = _e, Ce = pe, O, Te = 0; Te < 20; Te += 2)
|
|
10852
10852
|
O = de + Ee | 0, be ^= O << 7 | O >>> 25, O = be + de | 0, ie ^= O << 9 | O >>> 23, O = ie + be | 0, Ee ^= O << 13 | O >>> 19, O = Ee + ie | 0, de ^= O << 18 | O >>> 14, O = se + ye | 0, J ^= O << 7 | O >>> 25, O = J + se | 0, Be ^= O << 9 | O >>> 23, O = Be + J | 0, ye ^= O << 13 | O >>> 19, O = ye + Be | 0, se ^= O << 18 | O >>> 14, O = ee + Z | 0, De ^= O << 7 | O >>> 25, O = De + ee | 0, oe ^= O << 9 | O >>> 23, O = oe + De | 0, Z ^= O << 13 | O >>> 19, O = Z + oe | 0, ee ^= O << 18 | O >>> 14, O = Ce + ae | 0, le ^= O << 7 | O >>> 25, O = le + Ce | 0, G ^= O << 9 | O >>> 23, O = G + le | 0, ae ^= O << 13 | O >>> 19, O = ae + G | 0, Ce ^= O << 18 | O >>> 14, O = de + le | 0, ye ^= O << 7 | O >>> 25, O = ye + de | 0, oe ^= O << 9 | O >>> 23, O = oe + ye | 0, le ^= O << 13 | O >>> 19, O = le + oe | 0, de ^= O << 18 | O >>> 14, O = se + be | 0, Z ^= O << 7 | O >>> 25, O = Z + se | 0, G ^= O << 9 | O >>> 23, O = G + Z | 0, be ^= O << 13 | O >>> 19, O = be + G | 0, se ^= O << 18 | O >>> 14, O = ee + J | 0, ae ^= O << 7 | O >>> 25, O = ae + ee | 0, ie ^= O << 9 | O >>> 23, O = ie + ae | 0, J ^= O << 13 | O >>> 19, O = J + ie | 0, ee ^= O << 18 | O >>> 14, O = Ce + De | 0, Ee ^= O << 7 | O >>> 25, O = Ee + Ce | 0, Be ^= O << 9 | O >>> 23, O = Be + Ee | 0, De ^= O << 13 | O >>> 19, O = De + Be | 0, Ce ^= O << 18 | O >>> 14;
|
|
10853
10853
|
de = de + M | 0, ye = ye + p | 0, oe = oe + I | 0, le = le + L | 0, be = be + V | 0, se = se + ne | 0, Z = Z + fe | 0, G = G + he | 0, ie = ie + te | 0, J = J + xe | 0, ee = ee + ue | 0, ae = ae + ve | 0, Ee = Ee + ge | 0, Be = Be + me | 0, De = De + _e | 0, Ce = Ce + pe | 0, l[0] = de >>> 0 & 255, l[1] = de >>> 8 & 255, l[2] = de >>> 16 & 255, l[3] = de >>> 24 & 255, l[4] = ye >>> 0 & 255, l[5] = ye >>> 8 & 255, l[6] = ye >>> 16 & 255, l[7] = ye >>> 24 & 255, l[8] = oe >>> 0 & 255, l[9] = oe >>> 8 & 255, l[10] = oe >>> 16 & 255, l[11] = oe >>> 24 & 255, l[12] = le >>> 0 & 255, l[13] = le >>> 8 & 255, l[14] = le >>> 16 & 255, l[15] = le >>> 24 & 255, l[16] = be >>> 0 & 255, l[17] = be >>> 8 & 255, l[18] = be >>> 16 & 255, l[19] = be >>> 24 & 255, l[20] = se >>> 0 & 255, l[21] = se >>> 8 & 255, l[22] = se >>> 16 & 255, l[23] = se >>> 24 & 255, l[24] = Z >>> 0 & 255, l[25] = Z >>> 8 & 255, l[26] = Z >>> 16 & 255, l[27] = Z >>> 24 & 255, l[28] = G >>> 0 & 255, l[29] = G >>> 8 & 255, l[30] = G >>> 16 & 255, l[31] = G >>> 24 & 255, l[32] = ie >>> 0 & 255, l[33] = ie >>> 8 & 255, l[34] = ie >>> 16 & 255, l[35] = ie >>> 24 & 255, l[36] = J >>> 0 & 255, l[37] = J >>> 8 & 255, l[38] = J >>> 16 & 255, l[39] = J >>> 24 & 255, l[40] = ee >>> 0 & 255, l[41] = ee >>> 8 & 255, l[42] = ee >>> 16 & 255, l[43] = ee >>> 24 & 255, l[44] = ae >>> 0 & 255, l[45] = ae >>> 8 & 255, l[46] = ae >>> 16 & 255, l[47] = ae >>> 24 & 255, l[48] = Ee >>> 0 & 255, l[49] = Ee >>> 8 & 255, l[50] = Ee >>> 16 & 255, l[51] = Ee >>> 24 & 255, l[52] = Be >>> 0 & 255, l[53] = Be >>> 8 & 255, l[54] = Be >>> 16 & 255, l[55] = Be >>> 24 & 255, l[56] = De >>> 0 & 255, l[57] = De >>> 8 & 255, l[58] = De >>> 16 & 255, l[59] = De >>> 24 & 255, l[60] = Ce >>> 0 & 255, l[61] = Ce >>> 8 & 255, l[62] = Ce >>> 16 & 255, l[63] = Ce >>> 24 & 255;
|
|
@@ -10858,7 +10858,7 @@ var Vn = { exports: {} };
|
|
|
10858
10858
|
l[0] = de >>> 0 & 255, l[1] = de >>> 8 & 255, l[2] = de >>> 16 & 255, l[3] = de >>> 24 & 255, l[4] = se >>> 0 & 255, l[5] = se >>> 8 & 255, l[6] = se >>> 16 & 255, l[7] = se >>> 24 & 255, l[8] = ee >>> 0 & 255, l[9] = ee >>> 8 & 255, l[10] = ee >>> 16 & 255, l[11] = ee >>> 24 & 255, l[12] = Ce >>> 0 & 255, l[13] = Ce >>> 8 & 255, l[14] = Ce >>> 16 & 255, l[15] = Ce >>> 24 & 255, l[16] = Z >>> 0 & 255, l[17] = Z >>> 8 & 255, l[18] = Z >>> 16 & 255, l[19] = Z >>> 24 & 255, l[20] = G >>> 0 & 255, l[21] = G >>> 8 & 255, l[22] = G >>> 16 & 255, l[23] = G >>> 24 & 255, l[24] = ie >>> 0 & 255, l[25] = ie >>> 8 & 255, l[26] = ie >>> 16 & 255, l[27] = ie >>> 24 & 255, l[28] = J >>> 0 & 255, l[29] = J >>> 8 & 255, l[30] = J >>> 16 & 255, l[31] = J >>> 24 & 255;
|
|
10859
10859
|
}
|
|
10860
10860
|
function T(l, _, m, s) {
|
|
10861
|
-
|
|
10861
|
+
F(l, _, m, s);
|
|
10862
10862
|
}
|
|
10863
10863
|
function H(l, _, m, s) {
|
|
10864
10864
|
P(l, _, m, s);
|
|
@@ -10980,7 +10980,7 @@ var Vn = { exports: {} };
|
|
|
10980
10980
|
l[p] = 0;
|
|
10981
10981
|
return 0;
|
|
10982
10982
|
}
|
|
10983
|
-
function
|
|
10983
|
+
function S(l, _) {
|
|
10984
10984
|
var m;
|
|
10985
10985
|
for (m = 0; m < 16; m++)
|
|
10986
10986
|
l[m] = _[m] | 0;
|
|
@@ -11067,11 +11067,11 @@ var Vn = { exports: {} };
|
|
|
11067
11067
|
var xe = M.subarray(32), ue = M.subarray(16);
|
|
11068
11068
|
return we(xe, xe), re(ue, ue, xe), D(l, ue), 0;
|
|
11069
11069
|
}
|
|
11070
|
-
function
|
|
11070
|
+
function Se(l, _) {
|
|
11071
11071
|
return Me(l, _, i);
|
|
11072
11072
|
}
|
|
11073
11073
|
function G0(l, _) {
|
|
11074
|
-
return r(_, 32),
|
|
11074
|
+
return r(_, 32), Se(l, _);
|
|
11075
11075
|
}
|
|
11076
11076
|
function We(l, _, m) {
|
|
11077
11077
|
var s = new Uint8Array(32);
|
|
@@ -11277,37 +11277,37 @@ var Vn = { exports: {} };
|
|
|
11277
11277
|
for (s = 0; s < 4; s++)
|
|
11278
11278
|
q(l[s], _[s], m);
|
|
11279
11279
|
}
|
|
11280
|
-
function
|
|
11280
|
+
function Fe(l, _) {
|
|
11281
11281
|
var m = t(), s = t(), M = t();
|
|
11282
11282
|
we(M, _[2]), re(m, _[0], M), re(s, _[1], M), D(l, s), l[31] ^= E(m) << 7;
|
|
11283
11283
|
}
|
|
11284
|
-
function
|
|
11284
|
+
function S0(l, _, m) {
|
|
11285
11285
|
var s, M;
|
|
11286
|
-
for (
|
|
11286
|
+
for (S(l[0], y), S(l[1], x), S(l[2], x), S(l[3], y), M = 255; M >= 0; --M)
|
|
11287
11287
|
s = m[M / 8 | 0] >> (M & 7) & 1, Ne(l, _, s), O0(_, l), O0(l, l), Ne(l, _, s);
|
|
11288
11288
|
}
|
|
11289
11289
|
function Je(l, _) {
|
|
11290
11290
|
var m = [t(), t(), t(), t()];
|
|
11291
|
-
|
|
11291
|
+
S(m[0], v), S(m[1], b), S(m[2], x), re(m[3], v, b), S0(l, m, _);
|
|
11292
11292
|
}
|
|
11293
11293
|
function f0(l, _, m) {
|
|
11294
11294
|
var s = new Uint8Array(64), M = [t(), t(), t(), t()], p;
|
|
11295
|
-
for (m || r(_, 32), ze(s, _, 32), s[0] &= 248, s[31] &= 127, s[31] |= 64, Je(M, s),
|
|
11295
|
+
for (m || r(_, 32), ze(s, _, 32), s[0] &= 248, s[31] &= 127, s[31] |= 64, Je(M, s), Fe(l, M), p = 0; p < 32; p++)
|
|
11296
11296
|
_[p + 32] = l[p];
|
|
11297
11297
|
return 0;
|
|
11298
11298
|
}
|
|
11299
|
-
var
|
|
11299
|
+
var F0 = new Float64Array([237, 211, 245, 92, 26, 99, 18, 88, 214, 156, 247, 162, 222, 249, 222, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16]);
|
|
11300
11300
|
function qe(l, _) {
|
|
11301
11301
|
var m, s, M, p;
|
|
11302
11302
|
for (s = 63; s >= 32; --s) {
|
|
11303
11303
|
for (m = 0, M = s - 32, p = s - 12; M < p; ++M)
|
|
11304
|
-
_[M] += m - 16 * _[s] *
|
|
11304
|
+
_[M] += m - 16 * _[s] * F0[M - (s - 32)], m = Math.floor((_[M] + 128) / 256), _[M] -= m * 256;
|
|
11305
11305
|
_[M] += m, _[s] = 0;
|
|
11306
11306
|
}
|
|
11307
11307
|
for (m = 0, M = 0; M < 32; M++)
|
|
11308
|
-
_[M] += m - (_[31] >> 4) *
|
|
11308
|
+
_[M] += m - (_[31] >> 4) * F0[M], m = _[M] >> 8, _[M] &= 255;
|
|
11309
11309
|
for (M = 0; M < 32; M++)
|
|
11310
|
-
_[M] -= m *
|
|
11310
|
+
_[M] -= m * F0[M];
|
|
11311
11311
|
for (s = 0; s < 32; s++)
|
|
11312
11312
|
_[s + 1] += _[s] >> 8, l[s] = _[s] & 255;
|
|
11313
11313
|
}
|
|
@@ -11327,7 +11327,7 @@ var Vn = { exports: {} };
|
|
|
11327
11327
|
l[64 + L] = _[L];
|
|
11328
11328
|
for (L = 0; L < 32; L++)
|
|
11329
11329
|
l[32 + L] = M[32 + L];
|
|
11330
|
-
for (ze(I, l.subarray(32), m + 32), u0(I), Je(fe, I),
|
|
11330
|
+
for (ze(I, l.subarray(32), m + 32), u0(I), Je(fe, I), Fe(l, fe), L = 32; L < 64; L++)
|
|
11331
11331
|
l[L] = s[L];
|
|
11332
11332
|
for (ze(p, l, m + 64), u0(p), L = 0; L < 64; L++)
|
|
11333
11333
|
ne[L] = 0;
|
|
@@ -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
|
|
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);
|
|
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()];
|
|
@@ -11350,7 +11350,7 @@ var Vn = { exports: {} };
|
|
|
11350
11350
|
l[M] = _[M];
|
|
11351
11351
|
for (M = 0; M < 32; M++)
|
|
11352
11352
|
l[M + 32] = s[M];
|
|
11353
|
-
if (ze(I, l, m), u0(I),
|
|
11353
|
+
if (ze(I, l, m), u0(I), S0(L, V, I), Je(V, _.subarray(32)), O0(L, V), Fe(p, L), m -= 64, z(_, 0, p, 0)) {
|
|
11354
11354
|
for (M = 0; M < m; M++)
|
|
11355
11355
|
l[M] = 0;
|
|
11356
11356
|
return -1;
|
|
@@ -11373,7 +11373,7 @@ var Vn = { exports: {} };
|
|
|
11373
11373
|
crypto_secretbox: g,
|
|
11374
11374
|
crypto_secretbox_open: C,
|
|
11375
11375
|
crypto_scalarmult: Me,
|
|
11376
|
-
crypto_scalarmult_base:
|
|
11376
|
+
crypto_scalarmult_base: Se,
|
|
11377
11377
|
crypto_box_beforenm: We,
|
|
11378
11378
|
crypto_box_afternm: Oe,
|
|
11379
11379
|
crypto_box: Ge,
|
|
@@ -11402,7 +11402,7 @@ var Vn = { exports: {} };
|
|
|
11402
11402
|
crypto_hash_BYTES: c0,
|
|
11403
11403
|
gf: t,
|
|
11404
11404
|
D: o,
|
|
11405
|
-
L:
|
|
11405
|
+
L: F0,
|
|
11406
11406
|
pack25519: D,
|
|
11407
11407
|
unpack25519: j,
|
|
11408
11408
|
M: re,
|
|
@@ -11411,9 +11411,9 @@ var Vn = { exports: {} };
|
|
|
11411
11411
|
Z: W,
|
|
11412
11412
|
pow2523: Ae,
|
|
11413
11413
|
add: O0,
|
|
11414
|
-
set25519:
|
|
11414
|
+
set25519: S,
|
|
11415
11415
|
modL: qe,
|
|
11416
|
-
scalarmult:
|
|
11416
|
+
scalarmult: S0,
|
|
11417
11417
|
scalarbase: Je
|
|
11418
11418
|
};
|
|
11419
11419
|
function d0(l, _) {
|
|
@@ -11461,7 +11461,7 @@ var Vn = { exports: {} };
|
|
|
11461
11461
|
if (Ie(l), l.length !== s0)
|
|
11462
11462
|
throw new Error("bad n size");
|
|
11463
11463
|
var _ = new Uint8Array(i0);
|
|
11464
|
-
return
|
|
11464
|
+
return Se(_, l), _;
|
|
11465
11465
|
}, e.scalarMult.scalarLength = s0, e.scalarMult.groupElementLength = i0, e.box = function(l, _, m, s) {
|
|
11466
11466
|
var M = e.box.before(m, s);
|
|
11467
11467
|
return e.secretbox(l, _, M);
|
|
@@ -11479,7 +11479,7 @@ var Vn = { exports: {} };
|
|
|
11479
11479
|
if (Ie(l), l.length !== e0)
|
|
11480
11480
|
throw new Error("bad secret key size");
|
|
11481
11481
|
var _ = new Uint8Array(W0);
|
|
11482
|
-
return
|
|
11482
|
+
return Se(_, l), { publicKey: _, secretKey: new Uint8Array(l) };
|
|
11483
11483
|
}, e.box.publicKeyLength = W0, e.box.secretKeyLength = e0, e.box.sharedKeyLength = n0, e.box.nonceLength = L0, e.box.overheadLength = e.secretbox.overheadLength, e.sign = function(l, _) {
|
|
11484
11484
|
if (Ie(l, _), _.length !== Ve)
|
|
11485
11485
|
throw new Error("bad secret key size");
|
|
@@ -11545,7 +11545,7 @@ var Vn = { exports: {} };
|
|
|
11545
11545
|
Re(p);
|
|
11546
11546
|
});
|
|
11547
11547
|
} else
|
|
11548
|
-
typeof pn < "u" && (l =
|
|
11548
|
+
typeof pn < "u" && (l = Ar, l && l.randomBytes && e.setPRNG(function(m, s) {
|
|
11549
11549
|
var M, p = l.randomBytes(s);
|
|
11550
11550
|
for (M = 0; M < s; M++)
|
|
11551
11551
|
m[M] = p[M];
|
|
@@ -11697,7 +11697,7 @@ const ur = /* @__PURE__ */ Object.create(null);
|
|
|
11697
11697
|
Object.keys(dt).forEach((f) => {
|
|
11698
11698
|
ur[dt[f]] = f;
|
|
11699
11699
|
});
|
|
11700
|
-
const
|
|
11700
|
+
const Pf = { type: "error", data: "parser error" }, Xn = typeof Blob == "function" || typeof Blob < "u" && Object.prototype.toString.call(Blob) === "[object BlobConstructor]", Zn = typeof ArrayBuffer == "function", Gn = (f) => typeof ArrayBuffer.isView == "function" ? ArrayBuffer.isView(f) : f && f.buffer instanceof ArrayBuffer, Zf = ({ type: f, data: e }, t, r) => Xn && e instanceof Blob ? t ? r(e) : Qi(e, r) : Zn && (e instanceof ArrayBuffer || Gn(e)) ? t ? r(e) : Qi(new Blob([e]), r) : r(dt[f] + (e || "")), Qi = (f, e) => {
|
|
11701
11701
|
const t = new FileReader();
|
|
11702
11702
|
return t.onload = function() {
|
|
11703
11703
|
const r = t.result.split(",")[1];
|
|
@@ -11707,14 +11707,14 @@ const kf = { type: "error", data: "parser error" }, Xn = typeof Blob == "functio
|
|
|
11707
11707
|
function Ji(f) {
|
|
11708
11708
|
return f instanceof Uint8Array ? f : f instanceof ArrayBuffer ? new Uint8Array(f) : new Uint8Array(f.buffer, f.byteOffset, f.byteLength);
|
|
11709
11709
|
}
|
|
11710
|
-
let
|
|
11710
|
+
let Cf;
|
|
11711
11711
|
function Bc(f, e) {
|
|
11712
11712
|
if (Xn && f.data instanceof Blob)
|
|
11713
11713
|
return f.data.arrayBuffer().then(Ji).then(e);
|
|
11714
11714
|
if (Zn && (f.data instanceof ArrayBuffer || Gn(f.data)))
|
|
11715
11715
|
return e(Ji(f.data));
|
|
11716
11716
|
Zf(f, !1, (t) => {
|
|
11717
|
-
|
|
11717
|
+
Cf || (Cf = new TextEncoder()), e(Cf.encode(t));
|
|
11718
11718
|
});
|
|
11719
11719
|
}
|
|
11720
11720
|
const en = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", fr = typeof Uint8Array > "u" ? [] : new Uint8Array(256);
|
|
@@ -11736,14 +11736,14 @@ const Cc = (f) => {
|
|
|
11736
11736
|
const t = f.charAt(0);
|
|
11737
11737
|
return t === "b" ? {
|
|
11738
11738
|
type: "message",
|
|
11739
|
-
data:
|
|
11739
|
+
data: Sc(f.substring(1), e)
|
|
11740
11740
|
} : ur[t] ? f.length > 1 ? {
|
|
11741
11741
|
type: ur[t],
|
|
11742
11742
|
data: f.substring(1)
|
|
11743
11743
|
} : {
|
|
11744
11744
|
type: ur[t]
|
|
11745
|
-
} :
|
|
11746
|
-
},
|
|
11745
|
+
} : Pf;
|
|
11746
|
+
}, Sc = (f, e) => {
|
|
11747
11747
|
if (Mc) {
|
|
11748
11748
|
const t = Cc(f);
|
|
11749
11749
|
return Qn(t, e);
|
|
@@ -11757,7 +11757,7 @@ const Cc = (f) => {
|
|
|
11757
11757
|
default:
|
|
11758
11758
|
return f instanceof ArrayBuffer ? f : f.buffer;
|
|
11759
11759
|
}
|
|
11760
|
-
}, Jn = "",
|
|
11760
|
+
}, Jn = "", Fc = (f, e) => {
|
|
11761
11761
|
const t = f.length, r = new Array(t);
|
|
11762
11762
|
let a = 0;
|
|
11763
11763
|
f.forEach((i, y) => {
|
|
@@ -11796,7 +11796,7 @@ function Rc() {
|
|
|
11796
11796
|
}
|
|
11797
11797
|
});
|
|
11798
11798
|
}
|
|
11799
|
-
let
|
|
11799
|
+
let Mf;
|
|
11800
11800
|
function or(f) {
|
|
11801
11801
|
return f.reduce((e, t) => e + t.length, 0);
|
|
11802
11802
|
}
|
|
@@ -11810,7 +11810,7 @@ function cr(f, e) {
|
|
|
11810
11810
|
return f.length && r < f[0].length && (f[0] = f[0].slice(r)), t;
|
|
11811
11811
|
}
|
|
11812
11812
|
function kc(f, e) {
|
|
11813
|
-
|
|
11813
|
+
Mf || (Mf = new TextDecoder());
|
|
11814
11814
|
const t = [];
|
|
11815
11815
|
let r = 0, a = -1, i = !1;
|
|
11816
11816
|
return new TransformStream({
|
|
@@ -11831,7 +11831,7 @@ function kc(f, e) {
|
|
|
11831
11831
|
break;
|
|
11832
11832
|
const u = cr(t, 8), o = new DataView(u.buffer, u.byteOffset, u.length), c = o.getUint32(0);
|
|
11833
11833
|
if (c > Math.pow(2, 21) - 1) {
|
|
11834
|
-
x.enqueue(
|
|
11834
|
+
x.enqueue(Pf);
|
|
11835
11835
|
break;
|
|
11836
11836
|
}
|
|
11837
11837
|
a = c * Math.pow(2, 32) + o.getUint32(4), r = 3;
|
|
@@ -11839,10 +11839,10 @@ function kc(f, e) {
|
|
|
11839
11839
|
if (or(t) < a)
|
|
11840
11840
|
break;
|
|
11841
11841
|
const u = cr(t, a);
|
|
11842
|
-
x.enqueue(Gf(i ? u :
|
|
11842
|
+
x.enqueue(Gf(i ? u : Mf.decode(u), e)), r = 0;
|
|
11843
11843
|
}
|
|
11844
11844
|
if (a === 0 || a > f) {
|
|
11845
|
-
x.enqueue(
|
|
11845
|
+
x.enqueue(Pf);
|
|
11846
11846
|
break;
|
|
11847
11847
|
}
|
|
11848
11848
|
}
|
|
@@ -11906,7 +11906,7 @@ function ta(f, ...e) {
|
|
|
11906
11906
|
return e.reduce((t, r) => (f.hasOwnProperty(r) && (t[r] = f[r]), t), {});
|
|
11907
11907
|
}
|
|
11908
11908
|
const Ic = j0.setTimeout, Tc = j0.clearTimeout;
|
|
11909
|
-
function
|
|
11909
|
+
function Tr(f, e) {
|
|
11910
11910
|
e.useNativeTimers ? (f.setTimeoutFn = Ic.bind(j0), f.clearTimeoutFn = Tc.bind(j0)) : (f.setTimeoutFn = j0.setTimeout.bind(j0), f.clearTimeoutFn = j0.clearTimeout.bind(j0));
|
|
11911
11911
|
}
|
|
11912
11912
|
const Oc = 1.33;
|
|
@@ -11946,7 +11946,7 @@ class Qf extends A0 {
|
|
|
11946
11946
|
* @protected
|
|
11947
11947
|
*/
|
|
11948
11948
|
constructor(e) {
|
|
11949
|
-
super(), this.writable = !1,
|
|
11949
|
+
super(), this.writable = !1, Tr(this, e), this.opts = e, this.query = e.query, this.socket = e.socket;
|
|
11950
11950
|
}
|
|
11951
11951
|
/**
|
|
11952
11952
|
* Emits an error.
|
|
@@ -12036,12 +12036,12 @@ class Qf extends A0 {
|
|
|
12036
12036
|
return t.length ? "?" + t : "";
|
|
12037
12037
|
}
|
|
12038
12038
|
}
|
|
12039
|
-
const ra = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_".split(""),
|
|
12039
|
+
const ra = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_".split(""), If = 64, Uc = {};
|
|
12040
12040
|
let tn = 0, dr = 0, rn;
|
|
12041
12041
|
function fn(f) {
|
|
12042
12042
|
let e = "";
|
|
12043
12043
|
do
|
|
12044
|
-
e = ra[f %
|
|
12044
|
+
e = ra[f % If] + e, f = Math.floor(f / If);
|
|
12045
12045
|
while (f > 0);
|
|
12046
12046
|
return e;
|
|
12047
12047
|
}
|
|
@@ -12049,7 +12049,7 @@ function fa() {
|
|
|
12049
12049
|
const f = fn(+/* @__PURE__ */ new Date());
|
|
12050
12050
|
return f !== rn ? (tn = 0, rn = f) : f + "." + fn(tn++);
|
|
12051
12051
|
}
|
|
12052
|
-
for (; dr <
|
|
12052
|
+
for (; dr < If; dr++)
|
|
12053
12053
|
Uc[ra[dr]] = dr;
|
|
12054
12054
|
let ia = !1;
|
|
12055
12055
|
try {
|
|
@@ -12165,7 +12165,7 @@ class Yc extends Qf {
|
|
|
12165
12165
|
* @protected
|
|
12166
12166
|
*/
|
|
12167
12167
|
write(e) {
|
|
12168
|
-
this.writable = !1,
|
|
12168
|
+
this.writable = !1, Fc(e, (t) => {
|
|
12169
12169
|
this.doWrite(t, () => {
|
|
12170
12170
|
this.writable = !0, this.emitReserved("drain");
|
|
12171
12171
|
});
|
|
@@ -12225,7 +12225,7 @@ class at extends A0 {
|
|
|
12225
12225
|
* @package
|
|
12226
12226
|
*/
|
|
12227
12227
|
constructor(e, t) {
|
|
12228
|
-
super(),
|
|
12228
|
+
super(), Tr(this, t), this.opts = t, this.method = t.method || "GET", this.uri = e, this.data = t.data !== void 0 ? t.data : null, this.create();
|
|
12229
12229
|
}
|
|
12230
12230
|
/**
|
|
12231
12231
|
* Creates the XHR object and sends the request.
|
|
@@ -12463,7 +12463,7 @@ const Zc = {
|
|
|
12463
12463
|
"query",
|
|
12464
12464
|
"anchor"
|
|
12465
12465
|
];
|
|
12466
|
-
function
|
|
12466
|
+
function Tf(f) {
|
|
12467
12467
|
if (f.length > 2e3)
|
|
12468
12468
|
throw "URI too long";
|
|
12469
12469
|
const e = f, t = f.indexOf("["), r = f.indexOf("]");
|
|
@@ -12483,7 +12483,7 @@ function e1(f, e) {
|
|
|
12483
12483
|
a && (t[a] = i);
|
|
12484
12484
|
}), t;
|
|
12485
12485
|
}
|
|
12486
|
-
let aa = class
|
|
12486
|
+
let aa = class Ot extends A0 {
|
|
12487
12487
|
/**
|
|
12488
12488
|
* Socket constructor.
|
|
12489
12489
|
*
|
|
@@ -12491,7 +12491,7 @@ let aa = class Tt extends A0 {
|
|
|
12491
12491
|
* @param {Object} opts - options
|
|
12492
12492
|
*/
|
|
12493
12493
|
constructor(e, t = {}) {
|
|
12494
|
-
super(), this.binaryType = jc, this.writeBuffer = [], e && typeof e == "object" && (t = e, e = null), e ? (e =
|
|
12494
|
+
super(), this.binaryType = jc, this.writeBuffer = [], e && typeof e == "object" && (t = e, e = null), e ? (e = Tf(e), t.hostname = e.host, t.secure = e.protocol === "https" || e.protocol === "wss", t.port = e.port, e.query && (t.query = e.query)) : t.host && (t.hostname = Tf(t.host).host), Tr(this, t), this.secure = t.secure != null ? t.secure : typeof location < "u" && location.protocol === "https:", t.hostname && !t.port && (t.port = this.secure ? "443" : "80"), this.hostname = t.hostname || (typeof location < "u" ? location.hostname : "localhost"), this.port = t.port || (typeof location < "u" && location.port ? location.port : this.secure ? "443" : "80"), this.transports = t.transports || [
|
|
12495
12495
|
"polling",
|
|
12496
12496
|
"websocket",
|
|
12497
12497
|
"webtransport"
|
|
@@ -12543,7 +12543,7 @@ let aa = class Tt extends A0 {
|
|
|
12543
12543
|
*/
|
|
12544
12544
|
open() {
|
|
12545
12545
|
let e;
|
|
12546
|
-
if (this.opts.rememberUpgrade &&
|
|
12546
|
+
if (this.opts.rememberUpgrade && Ot.priorWebsocketSuccess && this.transports.indexOf("websocket") !== -1)
|
|
12547
12547
|
e = "websocket";
|
|
12548
12548
|
else if (this.transports.length === 0) {
|
|
12549
12549
|
this.setTimeoutFn(() => {
|
|
@@ -12577,14 +12577,14 @@ let aa = class Tt extends A0 {
|
|
|
12577
12577
|
*/
|
|
12578
12578
|
probe(e) {
|
|
12579
12579
|
let t = this.createTransport(e), r = !1;
|
|
12580
|
-
|
|
12580
|
+
Ot.priorWebsocketSuccess = !1;
|
|
12581
12581
|
const a = () => {
|
|
12582
12582
|
r || (t.send([{ type: "ping", data: "probe" }]), t.once("packet", (v) => {
|
|
12583
12583
|
if (!r)
|
|
12584
12584
|
if (v.type === "pong" && v.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 {
|
|
@@ -12622,7 +12622,7 @@ let aa = class Tt extends A0 {
|
|
|
12622
12622
|
* @private
|
|
12623
12623
|
*/
|
|
12624
12624
|
onOpen() {
|
|
12625
|
-
if (this.readyState = "open",
|
|
12625
|
+
if (this.readyState = "open", Ot.priorWebsocketSuccess = this.transport.name === "websocket", this.emitReserved("open"), this.flush(), this.readyState === "open" && this.opts.upgrade) {
|
|
12626
12626
|
let e = 0;
|
|
12627
12627
|
const t = this.upgrades.length;
|
|
12628
12628
|
for (; e < t; e++)
|
|
@@ -12763,7 +12763,7 @@ let aa = class Tt extends A0 {
|
|
|
12763
12763
|
* @private
|
|
12764
12764
|
*/
|
|
12765
12765
|
onError(e) {
|
|
12766
|
-
|
|
12766
|
+
Ot.priorWebsocketSuccess = !1, this.emitReserved("error", e), this.onClose("transport error", e);
|
|
12767
12767
|
}
|
|
12768
12768
|
/**
|
|
12769
12769
|
* Called upon transport close.
|
|
@@ -12791,7 +12791,7 @@ let aa = class Tt extends A0 {
|
|
|
12791
12791
|
aa.protocol = ea;
|
|
12792
12792
|
function t1(f, e = "", t) {
|
|
12793
12793
|
let r = f;
|
|
12794
|
-
t = t || typeof location < "u" && location, f == null && (f = t.protocol + "//" + t.host), typeof f == "string" && (f.charAt(0) === "/" && (f.charAt(1) === "/" ? f = t.protocol + f : f = t.host + f), /^(https?|wss?):\/\//.test(f) || (typeof t < "u" ? f = t.protocol + "//" + f : f = "https://" + f), r =
|
|
12794
|
+
t = t || typeof location < "u" && location, f == null && (f = t.protocol + "//" + t.host), typeof f == "string" && (f.charAt(0) === "/" && (f.charAt(1) === "/" ? f = t.protocol + f : f = t.host + f), /^(https?|wss?):\/\//.test(f) || (typeof t < "u" ? f = t.protocol + "//" + f : f = "https://" + f), r = Tf(f)), r.port || (/^(http|ws)$/.test(r.protocol) ? r.port = "80" : /^(http|ws)s$/.test(r.protocol) && (r.port = "443")), r.path = r.path || "/";
|
|
12795
12795
|
const i = r.host.indexOf(":") !== -1 ? "[" + r.host + "]" : r.host;
|
|
12796
12796
|
return r.id = r.protocol + "://" + i + ":" + r.port + e, r.href = r.protocol + "://" + i + (t && t.port === r.port ? "" : ":" + r.port), r;
|
|
12797
12797
|
}
|
|
@@ -12819,9 +12819,9 @@ function lr(f, e) {
|
|
|
12819
12819
|
}
|
|
12820
12820
|
function a1(f) {
|
|
12821
12821
|
const e = [], t = f.data, r = f;
|
|
12822
|
-
return r.data =
|
|
12822
|
+
return r.data = Of(t, e), r.attachments = e.length, { packet: r, buffers: e };
|
|
12823
12823
|
}
|
|
12824
|
-
function
|
|
12824
|
+
function Of(f, e) {
|
|
12825
12825
|
if (!f)
|
|
12826
12826
|
return f;
|
|
12827
12827
|
if (ei(f)) {
|
|
@@ -12830,20 +12830,20 @@ function Tf(f, e) {
|
|
|
12830
12830
|
} else if (Array.isArray(f)) {
|
|
12831
12831
|
const t = new Array(f.length);
|
|
12832
12832
|
for (let r = 0; r < f.length; r++)
|
|
12833
|
-
t[r] =
|
|
12833
|
+
t[r] = Of(f[r], e);
|
|
12834
12834
|
return t;
|
|
12835
12835
|
} else if (typeof f == "object" && !(f instanceof Date)) {
|
|
12836
12836
|
const t = {};
|
|
12837
12837
|
for (const r in f)
|
|
12838
|
-
Object.prototype.hasOwnProperty.call(f, r) && (t[r] =
|
|
12838
|
+
Object.prototype.hasOwnProperty.call(f, r) && (t[r] = Of(f[r], e));
|
|
12839
12839
|
return t;
|
|
12840
12840
|
}
|
|
12841
12841
|
return f;
|
|
12842
12842
|
}
|
|
12843
12843
|
function s1(f, e) {
|
|
12844
|
-
return f.data =
|
|
12844
|
+
return f.data = zf(f.data, e), delete f.attachments, f;
|
|
12845
12845
|
}
|
|
12846
|
-
function
|
|
12846
|
+
function zf(f, e) {
|
|
12847
12847
|
if (!f)
|
|
12848
12848
|
return f;
|
|
12849
12849
|
if (f && f._placeholder === !0) {
|
|
@@ -12852,10 +12852,10 @@ function Of(f, e) {
|
|
|
12852
12852
|
throw new Error("illegal attachments");
|
|
12853
12853
|
} else if (Array.isArray(f))
|
|
12854
12854
|
for (let t = 0; t < f.length; t++)
|
|
12855
|
-
f[t] =
|
|
12855
|
+
f[t] = zf(f[t], e);
|
|
12856
12856
|
else if (typeof f == "object")
|
|
12857
12857
|
for (const t in f)
|
|
12858
|
-
Object.prototype.hasOwnProperty.call(f, t) && (f[t] =
|
|
12858
|
+
Object.prototype.hasOwnProperty.call(f, t) && (f[t] = zf(f[t], e));
|
|
12859
12859
|
return f;
|
|
12860
12860
|
}
|
|
12861
12861
|
const o1 = [
|
|
@@ -13689,10 +13689,10 @@ Vt.prototype.setMax = function(f) {
|
|
|
13689
13689
|
Vt.prototype.setJitter = function(f) {
|
|
13690
13690
|
this.jitter = f;
|
|
13691
13691
|
};
|
|
13692
|
-
class
|
|
13692
|
+
class Nf extends A0 {
|
|
13693
13693
|
constructor(e, t) {
|
|
13694
13694
|
var r;
|
|
13695
|
-
super(), this.nsps = {}, this.subs = [], e && typeof e == "object" && (t = e, e = void 0), t = t || {}, t.path = t.path || "/socket.io", this.opts = t,
|
|
13695
|
+
super(), this.nsps = {}, this.subs = [], e && typeof e == "object" && (t = e, e = void 0), t = t || {}, t.path = t.path || "/socket.io", this.opts = t, Tr(this, t), this.reconnection(t.reconnection !== !1), this.reconnectionAttempts(t.reconnectionAttempts || 1 / 0), this.reconnectionDelay(t.reconnectionDelay || 1e3), this.reconnectionDelayMax(t.reconnectionDelayMax || 5e3), this.randomizationFactor((r = t.randomizationFactor) !== null && r !== void 0 ? r : 0.5), this.backoff = new Vt({
|
|
13696
13696
|
min: this.reconnectionDelay(),
|
|
13697
13697
|
max: this.reconnectionDelayMax(),
|
|
13698
13698
|
jitter: this.randomizationFactor()
|
|
@@ -13920,10 +13920,10 @@ function xr(f, e) {
|
|
|
13920
13920
|
typeof f == "object" && (e = f, f = void 0), e = e || {};
|
|
13921
13921
|
const t = t1(f, e.path || "/socket.io"), r = t.source, a = t.id, i = t.path, y = er[a] && i in er[a].nsps, x = e.forceNew || e["force new connection"] || e.multiplex === !1 || y;
|
|
13922
13922
|
let u;
|
|
13923
|
-
return x ? u = new
|
|
13923
|
+
return x ? u = new Nf(r, e) : (er[a] || (er[a] = new Nf(r, e)), u = er[a]), t.query && !e.query && (e.query = t.queryKey), u.socket(t.path, e);
|
|
13924
13924
|
}
|
|
13925
13925
|
Object.assign(xr, {
|
|
13926
|
-
Manager:
|
|
13926
|
+
Manager: Nf,
|
|
13927
13927
|
Socket: oa,
|
|
13928
13928
|
io: xr,
|
|
13929
13929
|
connect: xr
|
|
@@ -13938,11 +13938,11 @@ const x1 = "https://ws.zigap.io", Ct = class Ct {
|
|
|
13938
13938
|
}
|
|
13939
13939
|
};
|
|
13940
13940
|
wt(Ct, "instance");
|
|
13941
|
-
let
|
|
13941
|
+
let qf = Ct;
|
|
13942
13942
|
class v1 {
|
|
13943
13943
|
constructor() {
|
|
13944
13944
|
wt(this, "socketInstance");
|
|
13945
|
-
this.socketInstance =
|
|
13945
|
+
this.socketInstance = qf.getInstance();
|
|
13946
13946
|
}
|
|
13947
13947
|
joinRoom(e) {
|
|
13948
13948
|
this.socketInstance.socket.emit("joinRoom", e);
|
|
@@ -14043,7 +14043,13 @@ class y1 {
|
|
|
14043
14043
|
};
|
|
14044
14044
|
}
|
|
14045
14045
|
}
|
|
14046
|
-
const ri = new y1(),
|
|
14046
|
+
const ri = new y1(), g1 = "loginRes", m1 = () => {
|
|
14047
|
+
const [f, e] = _r(void 0);
|
|
14048
|
+
return Ft(() => {
|
|
14049
|
+
const t = localStorage.getItem("loginRes");
|
|
14050
|
+
t && e(JSON.parse(t));
|
|
14051
|
+
}, []), f;
|
|
14052
|
+
}, 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 = ({
|
|
14047
14053
|
availableNetworks: f,
|
|
14048
14054
|
dapp: e,
|
|
14049
14055
|
url: t,
|
|
@@ -14054,8 +14060,8 @@ const ri = new y1(), ca = "data:image/svg+xml,%3csvg%20width='167'%20height='166
|
|
|
14054
14060
|
logoSize: x = 30,
|
|
14055
14061
|
...u
|
|
14056
14062
|
}) => {
|
|
14057
|
-
const [o, c] =
|
|
14058
|
-
return
|
|
14063
|
+
const [o, c] = _r(!0), v = Xf.generateNonce(16), { qrCode: b, roomId: B } = ri.generateQrCode("login", e, t, f);
|
|
14064
|
+
return Ft(() => {
|
|
14059
14065
|
const w = setTimeout(
|
|
14060
14066
|
() => {
|
|
14061
14067
|
xt.leaveRoom(B), c(!1);
|
|
@@ -14063,26 +14069,40 @@ const ri = new y1(), ca = "data:image/svg+xml,%3csvg%20width='167'%20height='166
|
|
|
14063
14069
|
a * 60 * 1e3
|
|
14064
14070
|
);
|
|
14065
14071
|
return () => clearTimeout(w);
|
|
14066
|
-
}, [B, a]),
|
|
14072
|
+
}, [B, a]), Ft(() => {
|
|
14067
14073
|
(async () => {
|
|
14068
14074
|
try {
|
|
14069
14075
|
console.log("roomId", B);
|
|
14070
|
-
const R =
|
|
14076
|
+
const R = {
|
|
14077
|
+
isSuccess: !0,
|
|
14078
|
+
account: {
|
|
14079
|
+
address: "aaa",
|
|
14080
|
+
network: "bbb",
|
|
14081
|
+
nickName: "ccc"
|
|
14082
|
+
},
|
|
14083
|
+
payload: {
|
|
14084
|
+
publicKey: "ddd",
|
|
14085
|
+
message: "eee"
|
|
14086
|
+
},
|
|
14087
|
+
signature: "fff"
|
|
14088
|
+
};
|
|
14089
|
+
localStorage.setItem(g1, JSON.stringify(R));
|
|
14090
|
+
const k = await p1.qrLogin(B, r, v), z = `${r}
|
|
14071
14091
|
|
|
14072
|
-
Nonce: ${v}`,
|
|
14073
|
-
publicKey:
|
|
14074
|
-
message:
|
|
14075
|
-
},
|
|
14092
|
+
Nonce: ${v}`, F = {
|
|
14093
|
+
publicKey: k.publicKey,
|
|
14094
|
+
message: z
|
|
14095
|
+
}, T = {
|
|
14076
14096
|
isSuccess: !0,
|
|
14077
14097
|
account: {
|
|
14078
|
-
address:
|
|
14079
|
-
network:
|
|
14080
|
-
nickName:
|
|
14098
|
+
address: k.address,
|
|
14099
|
+
network: k.network,
|
|
14100
|
+
nickName: k.nickName
|
|
14081
14101
|
},
|
|
14082
|
-
payload:
|
|
14083
|
-
signature:
|
|
14102
|
+
payload: F,
|
|
14103
|
+
signature: k.signature
|
|
14084
14104
|
};
|
|
14085
|
-
i(
|
|
14105
|
+
i(T);
|
|
14086
14106
|
} catch {
|
|
14087
14107
|
i({
|
|
14088
14108
|
isSuccess: !1
|
|
@@ -14098,7 +14118,7 @@ Nonce: ${v}`, z = {
|
|
|
14098
14118
|
}
|
|
14099
14119
|
) : /* @__PURE__ */ vr.jsx("div", { children: "QR loading error" });
|
|
14100
14120
|
};
|
|
14101
|
-
class
|
|
14121
|
+
class _1 {
|
|
14102
14122
|
// 타입 가드 함수
|
|
14103
14123
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any
|
|
14104
14124
|
isAccountType(e) {
|
|
@@ -14121,7 +14141,7 @@ class g1 {
|
|
|
14121
14141
|
}
|
|
14122
14142
|
}
|
|
14123
14143
|
}
|
|
14124
|
-
const
|
|
14144
|
+
const A1 = new _1(), F1 = ({
|
|
14125
14145
|
availableNetworks: f,
|
|
14126
14146
|
dapp: e,
|
|
14127
14147
|
url: t,
|
|
@@ -14131,8 +14151,8 @@ const m1 = new g1(), C1 = ({
|
|
|
14131
14151
|
logoSize: y = 30,
|
|
14132
14152
|
...x
|
|
14133
14153
|
}) => {
|
|
14134
|
-
const [u, o] =
|
|
14135
|
-
return
|
|
14154
|
+
const [u, o] = _r(!0), { qrCode: c, roomId: v } = ri.generateQrCode("provide", e, t, f);
|
|
14155
|
+
return Ft(() => {
|
|
14136
14156
|
const b = setTimeout(
|
|
14137
14157
|
() => {
|
|
14138
14158
|
xt.leaveRoom(v), o(!1);
|
|
@@ -14140,11 +14160,11 @@ const m1 = new g1(), C1 = ({
|
|
|
14140
14160
|
r * 60 * 1e3
|
|
14141
14161
|
);
|
|
14142
14162
|
return () => clearTimeout(b);
|
|
14143
|
-
}, [v, r]),
|
|
14163
|
+
}, [v, r]), Ft(() => {
|
|
14144
14164
|
(async () => {
|
|
14145
14165
|
try {
|
|
14146
14166
|
console.log("roomId22", v);
|
|
14147
|
-
const B = await
|
|
14167
|
+
const B = await A1.qrAddressProvide(v), w = {
|
|
14148
14168
|
isSuccess: !0,
|
|
14149
14169
|
address: B.address,
|
|
14150
14170
|
network: B.network,
|
|
@@ -14166,7 +14186,7 @@ const m1 = new g1(), C1 = ({
|
|
|
14166
14186
|
}
|
|
14167
14187
|
) : /* @__PURE__ */ vr.jsx("div", { children: "QR loading error" });
|
|
14168
14188
|
};
|
|
14169
|
-
class
|
|
14189
|
+
class E1 {
|
|
14170
14190
|
// Base64URL 인코딩 함수
|
|
14171
14191
|
base64url(e) {
|
|
14172
14192
|
return K0.enc.Base64.stringify(K0.enc.Utf8.parse(e)).replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
|
|
@@ -14187,17 +14207,17 @@ class _1 {
|
|
|
14187
14207
|
return mr.address(e);
|
|
14188
14208
|
}
|
|
14189
14209
|
}
|
|
14190
|
-
const
|
|
14210
|
+
const w1 = new E1(), D1 = {
|
|
14191
14211
|
Enc: rr,
|
|
14192
14212
|
Sign: mr,
|
|
14193
14213
|
Util: z0,
|
|
14194
|
-
Validation:
|
|
14195
|
-
},
|
|
14214
|
+
Validation: w1
|
|
14215
|
+
}, B1 = {
|
|
14196
14216
|
Qr: ri
|
|
14197
|
-
};
|
|
14217
|
+
}, R1 = { Zigap: B1, useZigap: m1 };
|
|
14198
14218
|
export {
|
|
14199
|
-
|
|
14200
|
-
|
|
14201
|
-
|
|
14202
|
-
|
|
14219
|
+
F1 as AddressProvideQR,
|
|
14220
|
+
S1 as LoginQR,
|
|
14221
|
+
D1 as Xphere,
|
|
14222
|
+
R1 as Zigap
|
|
14203
14223
|
};
|