zigap-utils 0.0.31 → 0.0.32
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/components/AddressProvideQR/AddressProvideQR.types.d.ts +1 -0
- package/dist/components/LoginQR/LoginQR.types.d.ts +7 -3
- package/dist/index.cjs.js +8 -8
- package/dist/index.es.js +289 -285
- package/dist/util/addressProvide.d.ts +3 -3
- package/dist/util/index.d.ts +6 -0
- package/dist/util/types.d.ts +4 -1
- 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 nr, { useRef as ei, useState as
|
|
6
|
+
import nr, { useRef as ei, useState as Nf, useEffect as zt } 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 sn(f) {
|
|
9
9
|
return f && f.__esModule && Object.prototype.hasOwnProperty.call(f, "default") ? f.default : f;
|
|
@@ -160,14 +160,14 @@ function xa() {
|
|
|
160
160
|
}
|
|
161
161
|
return null;
|
|
162
162
|
}
|
|
163
|
-
var g = Object.assign, C = 0, F,
|
|
163
|
+
var g = Object.assign, C = 0, F, N, q, D, h, E, j;
|
|
164
164
|
function Y() {
|
|
165
165
|
}
|
|
166
166
|
Y.__reactDisabledLog = !0;
|
|
167
167
|
function W() {
|
|
168
168
|
{
|
|
169
169
|
if (C === 0) {
|
|
170
|
-
F = console.log,
|
|
170
|
+
F = 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,
|
|
@@ -200,10 +200,10 @@ function xa() {
|
|
|
200
200
|
value: F
|
|
201
201
|
}),
|
|
202
202
|
info: g({}, p, {
|
|
203
|
-
value:
|
|
203
|
+
value: N
|
|
204
204
|
}),
|
|
205
205
|
warn: g({}, p, {
|
|
206
|
-
value:
|
|
206
|
+
value: q
|
|
207
207
|
}),
|
|
208
208
|
error: g({}, p, {
|
|
209
209
|
value: D
|
|
@@ -375,9 +375,9 @@ function xa() {
|
|
|
375
375
|
}
|
|
376
376
|
}
|
|
377
377
|
}
|
|
378
|
-
var
|
|
378
|
+
var Ne = Array.isArray;
|
|
379
379
|
function Se(p) {
|
|
380
|
-
return
|
|
380
|
+
return Ne(p);
|
|
381
381
|
}
|
|
382
382
|
function F0(p) {
|
|
383
383
|
{
|
|
@@ -399,7 +399,7 @@ function xa() {
|
|
|
399
399
|
if (Je(p))
|
|
400
400
|
return S("The provided key is an unsupported type %s. This value must be coerced to a string before before using it here.", F0(p)), f0(p);
|
|
401
401
|
}
|
|
402
|
-
var
|
|
402
|
+
var qe = z.ReactCurrentOwner, u0 = {
|
|
403
403
|
key: !0,
|
|
404
404
|
ref: !0,
|
|
405
405
|
__self: !0,
|
|
@@ -423,12 +423,12 @@ function xa() {
|
|
|
423
423
|
return p.key !== void 0;
|
|
424
424
|
}
|
|
425
425
|
function r0(p, I) {
|
|
426
|
-
if (typeof p.ref == "string" &&
|
|
427
|
-
var L = d(
|
|
428
|
-
He[L] || (S('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(
|
|
426
|
+
if (typeof p.ref == "string" && qe.current && I && qe.current.stateNode !== I) {
|
|
427
|
+
var L = d(qe.current.type);
|
|
428
|
+
He[L] || (S('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
|
-
function
|
|
431
|
+
function N0(p, I) {
|
|
432
432
|
{
|
|
433
433
|
var L = function() {
|
|
434
434
|
G0 || (G0 = !0, S("%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));
|
|
@@ -492,13 +492,13 @@ function xa() {
|
|
|
492
492
|
}
|
|
493
493
|
if (te || xe) {
|
|
494
494
|
var ve = typeof p == "function" ? p.displayName || p.name || "Unknown" : p;
|
|
495
|
-
te &&
|
|
495
|
+
te && N0(he, ve), xe && i0(he, ve);
|
|
496
496
|
}
|
|
497
|
-
return s0(p, te, xe, ne, V,
|
|
497
|
+
return s0(p, te, xe, ne, V, qe.current, he);
|
|
498
498
|
}
|
|
499
499
|
}
|
|
500
500
|
var e0 = z.ReactCurrentOwner, n0 = z.ReactDebugCurrentFrame;
|
|
501
|
-
function
|
|
501
|
+
function q0(p) {
|
|
502
502
|
if (p) {
|
|
503
503
|
var I = p._owner, L = Ge(p.type, p._source, I ? I.type : null);
|
|
504
504
|
n0.setExtraStackFrame(L);
|
|
@@ -548,7 +548,7 @@ 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) + "."),
|
|
551
|
+
p && p._owner && p._owner !== e0.current && (V = " It was passed a child from " + d(p._owner.type) + "."), q0(p), S('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), q0(null);
|
|
552
552
|
}
|
|
553
553
|
}
|
|
554
554
|
function d0(p, I) {
|
|
@@ -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
|
-
|
|
603
|
+
q0(p), S("Invalid prop `%s` supplied to `React.Fragment`. React.Fragment can only have `key` and `children` props.", V), q0(null);
|
|
604
604
|
break;
|
|
605
605
|
}
|
|
606
606
|
}
|
|
607
|
-
p.ref !== null && (
|
|
607
|
+
p.ref !== null && (q0(p), S("Invalid attribute `ref` supplied to `React.Fragment`."), q0(null));
|
|
608
608
|
}
|
|
609
609
|
}
|
|
610
610
|
var Re = {};
|
|
@@ -1176,7 +1176,7 @@ function ln(f) {
|
|
|
1176
1176
|
"includeMargin",
|
|
1177
1177
|
"style",
|
|
1178
1178
|
"imageSettings"
|
|
1179
|
-
]), v = o == null ? void 0 : o.src, b = ei(null), B = ei(null), [w, R] =
|
|
1179
|
+
]), v = o == null ? void 0 : o.src, b = ei(null), B = ei(null), [w, R] = Nf(!1);
|
|
1180
1180
|
zt(() => {
|
|
1181
1181
|
if (b.current != null) {
|
|
1182
1182
|
const S = b.current, P = S.getContext("2d");
|
|
@@ -2070,7 +2070,7 @@ function Ra() {
|
|
|
2070
2070
|
});
|
|
2071
2071
|
}(zr)), zr.exports;
|
|
2072
2072
|
}
|
|
2073
|
-
var
|
|
2073
|
+
var Nr = { exports: {} }, ci;
|
|
2074
2074
|
function Rt() {
|
|
2075
2075
|
return ci || (ci = 1, function(f, e) {
|
|
2076
2076
|
(function(t, r) {
|
|
@@ -2143,9 +2143,9 @@ function Rt() {
|
|
|
2143
2143
|
}
|
|
2144
2144
|
}(), t.enc.Base64;
|
|
2145
2145
|
});
|
|
2146
|
-
}(
|
|
2146
|
+
}(Nr)), Nr.exports;
|
|
2147
2147
|
}
|
|
2148
|
-
var
|
|
2148
|
+
var qr = { exports: {} }, di;
|
|
2149
2149
|
function ka() {
|
|
2150
2150
|
return di || (di = 1, function(f, e) {
|
|
2151
2151
|
(function(t, r) {
|
|
@@ -2225,7 +2225,7 @@ function ka() {
|
|
|
2225
2225
|
}
|
|
2226
2226
|
}(), t.enc.Base64url;
|
|
2227
2227
|
});
|
|
2228
|
-
}(
|
|
2228
|
+
}(qr)), qr.exports;
|
|
2229
2229
|
}
|
|
2230
2230
|
var Lr = { exports: {} }, hi;
|
|
2231
2231
|
function kt() {
|
|
@@ -2253,8 +2253,8 @@ function kt() {
|
|
|
2253
2253
|
var S = k + z, P = R[S];
|
|
2254
2254
|
R[S] = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360;
|
|
2255
2255
|
}
|
|
2256
|
-
var T = this._hash.words, H = R[k + 0], $ = R[k + 1], K = R[k + 2], X = R[k + 3], Q = R[k + 4], U = R[k + 5], A = R[k + 6], n = R[k + 7], d = R[k + 8], g = R[k + 9], C = R[k + 10], F = R[k + 11],
|
|
2257
|
-
E = v(E, j, Y, W, H, 7, o[0]), W = v(W, E, j, Y, $, 12, o[1]), Y = v(Y, W, E, j, K, 17, o[2]), j = v(j, Y, W, E, X, 22, o[3]), E = v(E, j, Y, W, Q, 7, o[4]), W = v(W, E, j, Y, U, 12, o[5]), Y = v(Y, W, E, j, A, 17, o[6]), j = v(j, Y, W, E, n, 22, o[7]), E = v(E, j, Y, W, d, 7, o[8]), W = v(W, E, j, Y, g, 12, o[9]), Y = v(Y, W, E, j, C, 17, o[10]), j = v(j, Y, W, E, F, 22, o[11]), E = v(E, j, Y, W,
|
|
2256
|
+
var T = this._hash.words, H = R[k + 0], $ = R[k + 1], K = R[k + 2], X = R[k + 3], Q = R[k + 4], U = R[k + 5], A = R[k + 6], n = R[k + 7], d = R[k + 8], g = R[k + 9], C = R[k + 10], F = R[k + 11], N = R[k + 12], q = R[k + 13], D = R[k + 14], h = R[k + 15], E = T[0], j = T[1], Y = T[2], W = T[3];
|
|
2257
|
+
E = v(E, j, Y, W, H, 7, o[0]), W = v(W, E, j, Y, $, 12, o[1]), Y = v(Y, W, E, j, K, 17, o[2]), j = v(j, Y, W, E, X, 22, o[3]), E = v(E, j, Y, W, Q, 7, o[4]), W = v(W, E, j, Y, U, 12, o[5]), Y = v(Y, W, E, j, A, 17, o[6]), j = v(j, Y, W, E, n, 22, o[7]), E = v(E, j, Y, W, d, 7, o[8]), W = v(W, E, j, Y, g, 12, o[9]), Y = v(Y, W, E, j, C, 17, o[10]), j = v(j, Y, W, E, F, 22, o[11]), E = v(E, j, Y, W, N, 7, o[12]), W = v(W, E, j, Y, q, 12, o[13]), Y = v(Y, W, E, j, D, 17, o[14]), j = v(j, Y, W, E, h, 22, o[15]), E = b(E, j, Y, W, $, 5, o[16]), W = b(W, E, j, Y, A, 9, o[17]), Y = b(Y, W, E, j, F, 14, o[18]), j = b(j, Y, W, E, H, 20, o[19]), E = b(E, j, Y, W, U, 5, o[20]), W = b(W, E, j, Y, C, 9, o[21]), Y = b(Y, W, E, j, h, 14, o[22]), j = b(j, Y, W, E, Q, 20, o[23]), E = b(E, j, Y, W, g, 5, o[24]), W = b(W, E, j, Y, D, 9, o[25]), Y = b(Y, W, E, j, X, 14, o[26]), j = b(j, Y, W, E, d, 20, o[27]), E = b(E, j, Y, W, q, 5, o[28]), W = b(W, E, j, Y, K, 9, o[29]), Y = b(Y, W, E, j, n, 14, o[30]), j = b(j, Y, W, E, N, 20, o[31]), E = B(E, j, Y, W, U, 4, o[32]), W = B(W, E, j, Y, d, 11, o[33]), Y = B(Y, W, E, j, F, 16, o[34]), j = B(j, Y, W, E, D, 23, o[35]), E = B(E, j, Y, W, $, 4, o[36]), W = B(W, E, j, Y, Q, 11, o[37]), Y = B(Y, W, E, j, n, 16, o[38]), j = B(j, Y, W, E, C, 23, o[39]), E = B(E, j, Y, W, q, 4, o[40]), W = B(W, E, j, Y, H, 11, o[41]), Y = B(Y, W, E, j, X, 16, o[42]), j = B(j, Y, W, E, A, 23, o[43]), E = B(E, j, Y, W, g, 4, o[44]), W = B(W, E, j, Y, N, 11, o[45]), Y = B(Y, W, E, j, h, 16, o[46]), j = B(j, Y, W, E, K, 23, o[47]), E = w(E, j, Y, W, H, 6, o[48]), W = w(W, E, j, Y, n, 10, o[49]), Y = w(Y, W, E, j, D, 15, o[50]), j = w(j, Y, W, E, U, 21, o[51]), E = w(E, j, Y, W, N, 6, o[52]), W = w(W, E, j, Y, X, 10, o[53]), Y = w(Y, W, E, j, C, 15, o[54]), j = w(j, Y, W, E, $, 21, o[55]), E = w(E, j, Y, W, d, 6, o[56]), W = w(W, E, j, Y, h, 10, o[57]), Y = w(Y, W, E, j, A, 15, o[58]), j = w(j, Y, W, E, q, 21, o[59]), E = w(E, j, Y, W, Q, 6, o[60]), W = w(W, E, j, Y, F, 10, o[61]), Y = w(Y, W, E, j, K, 15, o[62]), j = w(j, Y, W, E, g, 21, o[63]), T[0] = T[0] + E | 0, T[1] = T[1] + j | 0, T[2] = T[2] + Y | 0, T[3] = T[3] + W | 0;
|
|
2258
2258
|
},
|
|
2259
2259
|
_doFinalize: function() {
|
|
2260
2260
|
var R = this._data, k = R.words, z = this._nDataBytes * 8, S = R.sigBytes * 8;
|
|
@@ -2338,7 +2338,7 @@ function bn() {
|
|
|
2338
2338
|
}(Hr)), Hr.exports;
|
|
2339
2339
|
}
|
|
2340
2340
|
var Ur = { exports: {} }, li;
|
|
2341
|
-
function
|
|
2341
|
+
function qf() {
|
|
2342
2342
|
return li || (li = 1, function(f, e) {
|
|
2343
2343
|
(function(t, r) {
|
|
2344
2344
|
f.exports = r($e());
|
|
@@ -2370,8 +2370,8 @@ function Nf() {
|
|
|
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 & S ^ z & S, C = (k << 30 | k >>> 2) ^ (k << 19 | k >>> 13) ^ (k << 10 | k >>> 22), F = (T << 26 | T >>> 6) ^ (T << 21 | T >>> 11) ^ (T << 7 | T >>> 25),
|
|
2374
|
-
K = $, $ = H, H = T, T = P +
|
|
2373
|
+
var d = T & H ^ ~T & $, g = k & z ^ k & S ^ z & S, C = (k << 30 | k >>> 2) ^ (k << 19 | k >>> 13) ^ (k << 10 | k >>> 22), F = (T << 26 | T >>> 6) ^ (T << 21 | T >>> 11) ^ (T << 7 | T >>> 25), N = K + F + d + c[X] + v[X], q = C + g;
|
|
2374
|
+
K = $, $ = H, H = T, T = P + N | 0, P = S, S = z, z = k, k = N + q | 0;
|
|
2375
2375
|
}
|
|
2376
2376
|
R[0] = R[0] + k | 0, R[1] = R[1] + z | 0, R[2] = R[2] + S | 0, R[3] = R[3] + P | 0, R[4] = R[4] + T | 0, R[5] = R[5] + H | 0, R[6] = R[6] + $ | 0, R[7] = R[7] + K | 0;
|
|
2377
2377
|
},
|
|
@@ -2393,7 +2393,7 @@ var $r = { exports: {} }, xi;
|
|
|
2393
2393
|
function Pa() {
|
|
2394
2394
|
return xi || (xi = 1, function(f, e) {
|
|
2395
2395
|
(function(t, r, a) {
|
|
2396
|
-
f.exports = r($e(),
|
|
2396
|
+
f.exports = r($e(), qf());
|
|
2397
2397
|
})(Pe, function(t) {
|
|
2398
2398
|
return function() {
|
|
2399
2399
|
var r = t, a = r.lib, i = a.WordArray, y = r.algo, x = y.SHA256, u = y.SHA224 = x.extend({
|
|
@@ -2530,18 +2530,18 @@ function pn() {
|
|
|
2530
2530
|
]);
|
|
2531
2531
|
},
|
|
2532
2532
|
_doProcessBlock: function(w, R) {
|
|
2533
|
-
for (var k = this._hash.words, z = k[0], S = k[1], P = k[2], T = k[3], H = k[4], $ = k[5], K = k[6], X = k[7], Q = z.high, U = z.low, A = S.high, n = S.low, d = P.high, g = P.low, C = T.high, F = T.low,
|
|
2534
|
-
var Se, F0, Je = b[
|
|
2535
|
-
if (
|
|
2536
|
-
F0 = Je.high = w[R +
|
|
2533
|
+
for (var k = this._hash.words, z = k[0], S = k[1], P = k[2], T = k[3], H = k[4], $ = k[5], K = k[6], X = k[7], Q = z.high, U = z.low, A = S.high, n = S.low, d = P.high, g = P.low, C = T.high, F = T.low, N = H.high, q = H.low, D = $.high, h = $.low, E = K.high, j = K.low, Y = X.high, W = X.low, re = Q, ce = U, we = A, Ae = n, Me = d, Fe = g, Z0 = C, We = F, Oe = N, _0 = q, Ge = D, Ye = h, $0 = E, Qe = j, ze = Y, O0 = W, Ne = 0; Ne < 80; Ne++) {
|
|
2534
|
+
var Se, F0, Je = b[Ne];
|
|
2535
|
+
if (Ne < 16)
|
|
2536
|
+
F0 = Je.high = w[R + Ne * 2] | 0, Se = Je.low = w[R + Ne * 2 + 1] | 0;
|
|
2537
2537
|
else {
|
|
2538
|
-
var f0 = b[
|
|
2538
|
+
var f0 = b[Ne - 15], S0 = f0.high, qe = f0.low, u0 = (S0 >>> 1 | qe << 31) ^ (S0 >>> 8 | qe << 24) ^ S0 >>> 7, G0 = (qe >>> 1 | S0 << 31) ^ (qe >>> 8 | S0 << 24) ^ (qe >>> 7 | S0 << 25), l0 = b[Ne - 2], He = l0.high, z0 = l0.low, a0 = (He >>> 19 | z0 << 13) ^ (He << 3 | z0 >>> 29) ^ He >>> 6, r0 = (z0 >>> 19 | He << 13) ^ (z0 << 3 | He >>> 29) ^ (z0 >>> 6 | He << 26), N0 = b[Ne - 7], i0 = N0.high, s0 = N0.low, W0 = b[Ne - 16], e0 = W0.high, n0 = W0.low;
|
|
2539
2539
|
Se = G0 + s0, F0 = u0 + i0 + (Se >>> 0 < G0 >>> 0 ? 1 : 0), Se = Se + r0, F0 = F0 + a0 + (Se >>> 0 < r0 >>> 0 ? 1 : 0), Se = Se + n0, F0 = F0 + e0 + (Se >>> 0 < n0 >>> 0 ? 1 : 0), Je.high = F0, Je.low = Se;
|
|
2540
2540
|
}
|
|
2541
|
-
var
|
|
2541
|
+
var q0 = Oe & Ge ^ ~Oe & $0, o0 = _0 & Ye ^ ~_0 & Qe, x0 = re & we ^ re & Me ^ we & Me, D0 = ce & Ae ^ ce & Fe ^ Ae & Fe, t0 = (re >>> 28 | ce << 4) ^ (re << 30 | ce >>> 2) ^ (re << 25 | ce >>> 7), Ve = (ce >>> 28 | re << 4) ^ (ce << 30 | re >>> 2) ^ (ce << 25 | re >>> 7), tt = (Oe >>> 14 | _0 << 18) ^ (Oe >>> 18 | _0 << 14) ^ (Oe << 23 | _0 >>> 9), c0 = (_0 >>> 14 | Oe << 18) ^ (_0 >>> 18 | Oe << 14) ^ (_0 << 23 | Oe >>> 9), d0 = v[Ne], yt = d0.high, Ie = d0.low, Re = O0 + c0, l = ze + tt + (Re >>> 0 < O0 >>> 0 ? 1 : 0), Re = Re + o0, l = l + q0 + (Re >>> 0 < o0 >>> 0 ? 1 : 0), Re = Re + Ie, l = l + yt + (Re >>> 0 < Ie >>> 0 ? 1 : 0), Re = Re + Se, l = l + F0 + (Re >>> 0 < Se >>> 0 ? 1 : 0), _ = Ve + D0, m = t0 + x0 + (_ >>> 0 < Ve >>> 0 ? 1 : 0);
|
|
2542
2542
|
ze = $0, O0 = Qe, $0 = Ge, Qe = Ye, Ge = Oe, Ye = _0, _0 = We + Re | 0, Oe = Z0 + l + (_0 >>> 0 < We >>> 0 ? 1 : 0) | 0, Z0 = Me, We = Fe, Me = we, Fe = Ae, we = re, Ae = ce, ce = Re + _ | 0, re = l + m + (ce >>> 0 < Re >>> 0 ? 1 : 0) | 0;
|
|
2543
2543
|
}
|
|
2544
|
-
U = z.low = U + ce, z.high = Q + re + (U >>> 0 < ce >>> 0 ? 1 : 0), n = S.low = n + Ae, S.high = A + we + (n >>> 0 < Ae >>> 0 ? 1 : 0), g = P.low = g + Fe, P.high = d + Me + (g >>> 0 < Fe >>> 0 ? 1 : 0), F = T.low = F + We, T.high = C + Z0 + (F >>> 0 < We >>> 0 ? 1 : 0),
|
|
2544
|
+
U = z.low = U + ce, z.high = Q + re + (U >>> 0 < ce >>> 0 ? 1 : 0), n = S.low = n + Ae, S.high = A + we + (n >>> 0 < Ae >>> 0 ? 1 : 0), g = P.low = g + Fe, P.high = d + Me + (g >>> 0 < Fe >>> 0 ? 1 : 0), F = T.low = F + We, T.high = C + Z0 + (F >>> 0 < We >>> 0 ? 1 : 0), q = H.low = q + _0, H.high = N + Oe + (q >>> 0 < _0 >>> 0 ? 1 : 0), h = $.low = h + Ye, $.high = D + Ge + (h >>> 0 < Ye >>> 0 ? 1 : 0), j = K.low = j + Qe, K.high = E + $0 + (j >>> 0 < Qe >>> 0 ? 1 : 0), W = X.low = W + O0, X.high = Y + ze + (W >>> 0 < O0 >>> 0 ? 1 : 0);
|
|
2545
2545
|
},
|
|
2546
2546
|
_doFinalize: function() {
|
|
2547
2547
|
var w = this._data, R = w.words, k = this._nDataBytes * 8, z = w.sigBytes * 8;
|
|
@@ -2657,21 +2657,21 @@ function Ta() {
|
|
|
2657
2657
|
d.high = U, d.low = A;
|
|
2658
2658
|
}
|
|
2659
2659
|
for (var Q = 0; Q < 5; Q++)
|
|
2660
|
-
for (var g = w[(Q + 4) % 5], C = w[(Q + 1) % 5], F = C.high,
|
|
2660
|
+
for (var g = w[(Q + 4) % 5], C = w[(Q + 1) % 5], F = C.high, N = C.low, U = g.high ^ (F << 1 | N >>> 31), A = g.low ^ (N << 1 | F >>> 31), n = 0; n < 5; n++) {
|
|
2661
2661
|
var K = S[Q + 5 * n];
|
|
2662
2662
|
K.high ^= U, K.low ^= A;
|
|
2663
2663
|
}
|
|
2664
|
-
for (var
|
|
2665
|
-
var U, A, K = S[
|
|
2664
|
+
for (var q = 1; q < 25; q++) {
|
|
2665
|
+
var U, A, K = S[q], D = K.high, h = K.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
|
-
var j = w[b[
|
|
2667
|
+
var j = w[b[q]];
|
|
2668
2668
|
j.high = U, j.low = A;
|
|
2669
2669
|
}
|
|
2670
2670
|
var Y = w[0], W = S[0];
|
|
2671
2671
|
Y.high = W.high, Y.low = W.low;
|
|
2672
2672
|
for (var Q = 0; Q < 5; Q++)
|
|
2673
2673
|
for (var n = 0; n < 5; n++) {
|
|
2674
|
-
var
|
|
2674
|
+
var q = Q + 5 * n, K = S[q], re = w[q], ce = w[(Q + 1) % 5 + 5 * n], we = w[(Q + 2) % 5 + 5 * n];
|
|
2675
2675
|
K.high = re.high ^ ~ce.high & we.high, K.low = re.low ^ ~ce.low & we.low;
|
|
2676
2676
|
}
|
|
2677
2677
|
var K = S[0], Ae = B[X];
|
|
@@ -3050,11 +3050,11 @@ function Oa() {
|
|
|
3050
3050
|
var Q = K + X, U = $[Q];
|
|
3051
3051
|
$[Q] = (U << 8 | U >>> 24) & 16711935 | (U << 24 | U >>> 8) & 4278255360;
|
|
3052
3052
|
}
|
|
3053
|
-
var A = this._hash.words, n = B.words, d = w.words, g = o.words, C = c.words, F = v.words,
|
|
3054
|
-
Y =
|
|
3053
|
+
var A = this._hash.words, n = B.words, d = w.words, g = o.words, C = c.words, F = v.words, N = b.words, q, D, h, E, j, Y, W, re, ce, we;
|
|
3054
|
+
Y = 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 =
|
|
3057
|
-
Ae = A[1] + h + ce | 0, A[1] = A[2] + E + we | 0, A[2] = A[3] + j + Y | 0, A[3] = A[4] +
|
|
3056
|
+
Ae = q + $[K + g[X]] | 0, X < 16 ? Ae += k(D, h, E) + n[0] : X < 32 ? Ae += z(D, h, E) + n[1] : X < 48 ? Ae += S(D, h, E) + n[2] : X < 64 ? Ae += P(D, h, E) + n[3] : Ae += T(D, h, E) + n[4], Ae = Ae | 0, Ae = H(Ae, F[X]), Ae = Ae + j | 0, q = j, j = E, E = H(h, 10), h = D, D = Ae, Ae = Y + $[K + C[X]] | 0, X < 16 ? Ae += T(W, re, ce) + d[0] : X < 32 ? Ae += P(W, re, ce) + d[1] : X < 48 ? Ae += S(W, re, ce) + d[2] : X < 64 ? Ae += z(W, re, ce) + d[3] : Ae += k(W, re, ce) + d[4], Ae = Ae | 0, Ae = H(Ae, N[X]), Ae = Ae + we | 0, Y = we, we = ce, ce = H(re, 10), re = W, W = Ae;
|
|
3057
|
+
Ae = A[1] + h + ce | 0, A[1] = A[2] + E + we | 0, A[2] = A[3] + j + Y | 0, A[3] = A[4] + q + W | 0, A[4] = A[0] + D + re | 0, A[0] = Ae;
|
|
3058
3058
|
},
|
|
3059
3059
|
_doFinalize: function() {
|
|
3060
3060
|
var $ = this._data, K = $.words, X = this._nDataBytes * 8, Q = $.sigBytes * 8;
|
|
@@ -3175,7 +3175,7 @@ var Xr = { exports: {} }, mi;
|
|
|
3175
3175
|
function za() {
|
|
3176
3176
|
return mi || (mi = 1, function(f, e) {
|
|
3177
3177
|
(function(t, r, a) {
|
|
3178
|
-
f.exports = r($e(),
|
|
3178
|
+
f.exports = r($e(), qf(), Lf());
|
|
3179
3179
|
})(Pe, function(t) {
|
|
3180
3180
|
return function() {
|
|
3181
3181
|
var r = t, a = r.lib, i = a.Base, y = a.WordArray, x = r.algo, u = x.SHA256, o = x.HMAC, c = x.PBKDF2 = i.extend({
|
|
@@ -3529,8 +3529,8 @@ function C0() {
|
|
|
3529
3529
|
function A(n, d, g) {
|
|
3530
3530
|
var C, F = this._iv;
|
|
3531
3531
|
F ? (C = F, this._iv = r) : C = this._prevBlock;
|
|
3532
|
-
for (var
|
|
3533
|
-
n[d +
|
|
3532
|
+
for (var N = 0; N < g; N++)
|
|
3533
|
+
n[d + N] ^= C[N];
|
|
3534
3534
|
}
|
|
3535
3535
|
return U;
|
|
3536
3536
|
}(), z = a.pad = {}, S = z.Pkcs7 = {
|
|
@@ -3549,8 +3549,8 @@ function C0() {
|
|
|
3549
3549
|
pad: function(U, A) {
|
|
3550
3550
|
for (var n = A * 4, d = n - U.sigBytes % n, g = d << 24 | d << 16 | d << 8 | d, C = [], F = 0; F < d; F += 4)
|
|
3551
3551
|
C.push(g);
|
|
3552
|
-
var
|
|
3553
|
-
U.concat(
|
|
3552
|
+
var N = x.create(C, d);
|
|
3553
|
+
U.concat(N);
|
|
3554
3554
|
},
|
|
3555
3555
|
/**
|
|
3556
3556
|
* Unpads data that had been padded using the algorithm defined in PKCS #5/7.
|
|
@@ -3840,7 +3840,7 @@ function C0() {
|
|
|
3840
3840
|
}(Gr)), Gr.exports;
|
|
3841
3841
|
}
|
|
3842
3842
|
var Qr = { exports: {} }, Ei;
|
|
3843
|
-
function
|
|
3843
|
+
function Na() {
|
|
3844
3844
|
return Ei || (Ei = 1, function(f, e) {
|
|
3845
3845
|
(function(t, r, a) {
|
|
3846
3846
|
f.exports = r($e(), C0());
|
|
@@ -3870,7 +3870,7 @@ function qa() {
|
|
|
3870
3870
|
}(Qr)), Qr.exports;
|
|
3871
3871
|
}
|
|
3872
3872
|
var Jr = { exports: {} }, wi;
|
|
3873
|
-
function
|
|
3873
|
+
function qa() {
|
|
3874
3874
|
return wi || (wi = 1, function(f, e) {
|
|
3875
3875
|
(function(t, r, a) {
|
|
3876
3876
|
f.exports = r($e(), C0());
|
|
@@ -4156,12 +4156,12 @@ function Xa() {
|
|
|
4156
4156
|
P[T + 1] = P[T + 3], P[T + 3] = H;
|
|
4157
4157
|
},
|
|
4158
4158
|
_doCryptBlock: function(P, T, H, $, K, X, Q, U) {
|
|
4159
|
-
for (var A = this._nRounds, n = P[T] ^ H[0], d = P[T + 1] ^ H[1], g = P[T + 2] ^ H[2], C = P[T + 3] ^ H[3], F = 4,
|
|
4160
|
-
var
|
|
4161
|
-
n =
|
|
4159
|
+
for (var A = this._nRounds, n = P[T] ^ H[0], d = P[T + 1] ^ H[1], g = P[T + 2] ^ H[2], C = P[T + 3] ^ H[3], F = 4, N = 1; N < A; N++) {
|
|
4160
|
+
var q = $[n >>> 24] ^ K[d >>> 16 & 255] ^ X[g >>> 8 & 255] ^ Q[C & 255] ^ H[F++], D = $[d >>> 24] ^ K[g >>> 16 & 255] ^ X[C >>> 8 & 255] ^ Q[n & 255] ^ H[F++], h = $[g >>> 24] ^ K[C >>> 16 & 255] ^ X[n >>> 8 & 255] ^ Q[d & 255] ^ H[F++], E = $[C >>> 24] ^ K[n >>> 16 & 255] ^ X[d >>> 8 & 255] ^ Q[g & 255] ^ H[F++];
|
|
4161
|
+
n = q, d = D, g = h, C = E;
|
|
4162
4162
|
}
|
|
4163
|
-
var
|
|
4164
|
-
P[T] =
|
|
4163
|
+
var q = (U[n >>> 24] << 24 | U[d >>> 16 & 255] << 16 | U[g >>> 8 & 255] << 8 | U[C & 255]) ^ H[F++], D = (U[d >>> 24] << 24 | U[g >>> 16 & 255] << 16 | U[C >>> 8 & 255] << 8 | U[n & 255]) ^ H[F++], h = (U[g >>> 24] << 24 | U[C >>> 16 & 255] << 16 | U[n >>> 8 & 255] << 8 | U[d & 255]) ^ H[F++], E = (U[C >>> 24] << 24 | U[n >>> 16 & 255] << 16 | U[d >>> 8 & 255] << 8 | U[g & 255]) ^ H[F++];
|
|
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
|
});
|
|
@@ -5010,9 +5010,9 @@ function Qa() {
|
|
|
5010
5010
|
});
|
|
5011
5011
|
}(lf)), lf.exports;
|
|
5012
5012
|
}
|
|
5013
|
-
var xf = { exports: {} },
|
|
5013
|
+
var xf = { exports: {} }, Ni;
|
|
5014
5014
|
function Ja() {
|
|
5015
|
-
return
|
|
5015
|
+
return Ni || (Ni = 1, function(f, e) {
|
|
5016
5016
|
(function(t, r, a) {
|
|
5017
5017
|
f.exports = r($e(), Rt(), kt(), At(), C0());
|
|
5018
5018
|
})(Pe, function(t) {
|
|
@@ -5074,9 +5074,9 @@ function Ja() {
|
|
|
5074
5074
|
});
|
|
5075
5075
|
}(xf)), xf.exports;
|
|
5076
5076
|
}
|
|
5077
|
-
var vf = { exports: {} },
|
|
5077
|
+
var vf = { exports: {} }, qi;
|
|
5078
5078
|
function es() {
|
|
5079
|
-
return
|
|
5079
|
+
return qi || (qi = 1, function(f, e) {
|
|
5080
5080
|
(function(t, r, a) {
|
|
5081
5081
|
f.exports = r($e(), Rt(), kt(), At(), C0());
|
|
5082
5082
|
})(Pe, function(t) {
|
|
@@ -6198,7 +6198,7 @@ function es() {
|
|
|
6198
6198
|
}
|
|
6199
6199
|
(function(f, e) {
|
|
6200
6200
|
(function(t, r, a) {
|
|
6201
|
-
f.exports = r($e(), _r(), Da(), Ra(), Rt(), ka(), kt(), bn(),
|
|
6201
|
+
f.exports = r($e(), _r(), Da(), Ra(), Rt(), ka(), kt(), bn(), qf(), Pa(), pn(), Ia(), Ta(), Oa(), Lf(), za(), At(), C0(), Na(), qa(), La(), Ha(), Ua(), $a(), Wa(), Ya(), Ka(), ja(), Va(), Xa(), Za(), Ga(), Qa(), Ja(), es());
|
|
6202
6202
|
})(Pe, function(t) {
|
|
6203
6203
|
return t;
|
|
6204
6204
|
});
|
|
@@ -6316,13 +6316,13 @@ Hf.exports;
|
|
|
6316
6316
|
this.length = Math.ceil(n.length / 3), this.words = new Array(this.length);
|
|
6317
6317
|
for (var C = 0; C < this.length; C++)
|
|
6318
6318
|
this.words[C] = 0;
|
|
6319
|
-
var F,
|
|
6319
|
+
var F, N, q = 0;
|
|
6320
6320
|
if (g === "be")
|
|
6321
6321
|
for (C = n.length - 1, F = 0; C >= 0; C -= 3)
|
|
6322
|
-
|
|
6322
|
+
N = n[C] | n[C - 1] << 8 | n[C - 2] << 16, this.words[F] |= N << q & 67108863, this.words[F + 1] = N >>> 26 - q & 67108863, q += 24, q >= 26 && (q -= 26, F++);
|
|
6323
6323
|
else if (g === "le")
|
|
6324
6324
|
for (C = 0, F = 0; C < n.length; C += 3)
|
|
6325
|
-
|
|
6325
|
+
N = n[C] | n[C + 1] << 8 | n[C + 2] << 16, this.words[F] |= N << q & 67108863, this.words[F + 1] = N >>> 26 - q & 67108863, q += 24, q >= 26 && (q -= 26, F++);
|
|
6326
6326
|
return this.strip();
|
|
6327
6327
|
};
|
|
6328
6328
|
function x(A, n) {
|
|
@@ -6337,21 +6337,21 @@ Hf.exports;
|
|
|
6337
6337
|
this.length = Math.ceil((n.length - d) / 6), this.words = new Array(this.length);
|
|
6338
6338
|
for (var C = 0; C < this.length; C++)
|
|
6339
6339
|
this.words[C] = 0;
|
|
6340
|
-
var F = 0,
|
|
6340
|
+
var F = 0, N = 0, q;
|
|
6341
6341
|
if (g === "be")
|
|
6342
6342
|
for (C = n.length - 1; C >= d; C -= 2)
|
|
6343
|
-
|
|
6343
|
+
q = u(n, d, C) << F, this.words[N] |= q & 67108863, F >= 18 ? (F -= 18, N += 1, this.words[N] |= q >>> 26) : F += 8;
|
|
6344
6344
|
else {
|
|
6345
6345
|
var D = n.length - d;
|
|
6346
6346
|
for (C = D % 2 === 0 ? d + 1 : d; C < n.length; C += 2)
|
|
6347
|
-
|
|
6347
|
+
q = u(n, d, C) << F, this.words[N] |= q & 67108863, F >= 18 ? (F -= 18, N += 1, this.words[N] |= q >>> 26) : F += 8;
|
|
6348
6348
|
}
|
|
6349
6349
|
this.strip();
|
|
6350
6350
|
};
|
|
6351
6351
|
function o(A, n, d, g) {
|
|
6352
|
-
for (var C = 0, F = Math.min(A.length, d),
|
|
6353
|
-
var
|
|
6354
|
-
C *= g,
|
|
6352
|
+
for (var C = 0, F = Math.min(A.length, d), N = n; N < F; N++) {
|
|
6353
|
+
var q = A.charCodeAt(N) - 48;
|
|
6354
|
+
C *= g, q >= 49 ? C += q - 49 + 10 : q >= 17 ? C += q - 17 + 10 : C += q;
|
|
6355
6355
|
}
|
|
6356
6356
|
return C;
|
|
6357
6357
|
}
|
|
@@ -6360,11 +6360,11 @@ Hf.exports;
|
|
|
6360
6360
|
for (var C = 0, F = 1; F <= 67108863; F *= d)
|
|
6361
6361
|
C++;
|
|
6362
6362
|
C--, F = F / d | 0;
|
|
6363
|
-
for (var
|
|
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
6364
|
h = o(n, E, E + C, d), this.imuln(F), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
|
|
6365
|
-
if (
|
|
6365
|
+
if (q !== 0) {
|
|
6366
6366
|
var j = 1;
|
|
6367
|
-
for (h = o(n, E, n.length, d), E = 0; E <
|
|
6367
|
+
for (h = o(n, E, n.length, d), E = 0; E < q; E++)
|
|
6368
6368
|
j *= d;
|
|
6369
6369
|
this.imuln(j), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
|
|
6370
6370
|
}
|
|
@@ -6499,9 +6499,9 @@ Hf.exports;
|
|
|
6499
6499
|
var g;
|
|
6500
6500
|
if (n === 16 || n === "hex") {
|
|
6501
6501
|
g = "";
|
|
6502
|
-
for (var C = 0, F = 0,
|
|
6503
|
-
var
|
|
6504
|
-
F =
|
|
6502
|
+
for (var C = 0, F = 0, N = 0; N < this.length; N++) {
|
|
6503
|
+
var q = this.words[N], D = ((q << C | F) & 16777215).toString(16);
|
|
6504
|
+
F = q >>> 24 - C & 16777215, F !== 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
6506
|
for (F !== 0 && (g = F.toString(16) + g); g.length % d !== 0; )
|
|
6507
6507
|
g = "0" + g;
|
|
@@ -6532,19 +6532,19 @@ Hf.exports;
|
|
|
6532
6532
|
}, i.prototype.toArrayLike = function(n, d, g) {
|
|
6533
6533
|
var C = this.byteLength(), F = g || Math.max(1, C);
|
|
6534
6534
|
r(C <= F, "byte array longer than desired length"), r(F > 0, "Requested array length <= 0"), this.strip();
|
|
6535
|
-
var
|
|
6536
|
-
if (
|
|
6535
|
+
var N = d === "le", q = new n(F), D, h, E = this.clone();
|
|
6536
|
+
if (N) {
|
|
6537
6537
|
for (h = 0; !E.isZero(); h++)
|
|
6538
|
-
D = E.andln(255), E.iushrn(8),
|
|
6538
|
+
D = E.andln(255), E.iushrn(8), q[h] = D;
|
|
6539
6539
|
for (; h < F; h++)
|
|
6540
|
-
|
|
6540
|
+
q[h] = 0;
|
|
6541
6541
|
} else {
|
|
6542
6542
|
for (h = 0; h < F - C; h++)
|
|
6543
|
-
|
|
6543
|
+
q[h] = 0;
|
|
6544
6544
|
for (h = 0; !E.isZero(); h++)
|
|
6545
|
-
D = E.andln(255), E.iushrn(8),
|
|
6545
|
+
D = E.andln(255), E.iushrn(8), q[F - h - 1] = D;
|
|
6546
6546
|
}
|
|
6547
|
-
return
|
|
6547
|
+
return q;
|
|
6548
6548
|
}, Math.clz32 ? i.prototype._countBits = function(n) {
|
|
6549
6549
|
return 32 - Math.clz32(n);
|
|
6550
6550
|
} : i.prototype._countBits = function(n) {
|
|
@@ -6647,15 +6647,15 @@ Hf.exports;
|
|
|
6647
6647
|
return n.negative = 0, d = this.isub(n), n.negative = 1, d._normSign();
|
|
6648
6648
|
var g, C;
|
|
6649
6649
|
this.length > n.length ? (g = this, C = n) : (g = n, C = this);
|
|
6650
|
-
for (var F = 0,
|
|
6651
|
-
d = (g.words[
|
|
6652
|
-
for (; F !== 0 &&
|
|
6653
|
-
d = (g.words[
|
|
6650
|
+
for (var F = 0, N = 0; N < C.length; N++)
|
|
6651
|
+
d = (g.words[N] | 0) + (C.words[N] | 0) + F, this.words[N] = d & 67108863, F = d >>> 26;
|
|
6652
|
+
for (; F !== 0 && N < g.length; N++)
|
|
6653
|
+
d = (g.words[N] | 0) + F, this.words[N] = d & 67108863, F = d >>> 26;
|
|
6654
6654
|
if (this.length = g.length, F !== 0)
|
|
6655
6655
|
this.words[this.length] = F, this.length++;
|
|
6656
6656
|
else if (g !== this)
|
|
6657
|
-
for (;
|
|
6658
|
-
this.words[
|
|
6657
|
+
for (; N < g.length; N++)
|
|
6658
|
+
this.words[N] = g.words[N];
|
|
6659
6659
|
return this;
|
|
6660
6660
|
}, i.prototype.add = function(n) {
|
|
6661
6661
|
var d;
|
|
@@ -6672,14 +6672,14 @@ Hf.exports;
|
|
|
6672
6672
|
return this.negative = 0, this.length = 1, this.words[0] = 0, this;
|
|
6673
6673
|
var C, F;
|
|
6674
6674
|
g > 0 ? (C = this, F = n) : (C = n, F = this);
|
|
6675
|
-
for (var
|
|
6676
|
-
d = (C.words[
|
|
6677
|
-
for (;
|
|
6678
|
-
d = (C.words[
|
|
6679
|
-
if (
|
|
6680
|
-
for (;
|
|
6681
|
-
this.words[
|
|
6682
|
-
return this.length = Math.max(this.length,
|
|
6675
|
+
for (var N = 0, q = 0; q < F.length; q++)
|
|
6676
|
+
d = (C.words[q] | 0) - (F.words[q] | 0) + N, N = d >> 26, this.words[q] = d & 67108863;
|
|
6677
|
+
for (; N !== 0 && q < C.length; q++)
|
|
6678
|
+
d = (C.words[q] | 0) + N, N = d >> 26, this.words[q] = d & 67108863;
|
|
6679
|
+
if (N === 0 && q < C.length && C !== this)
|
|
6680
|
+
for (; q < C.length; q++)
|
|
6681
|
+
this.words[q] = C.words[q];
|
|
6682
|
+
return this.length = Math.max(this.length, q), C !== this && (this.negative = 1), this.strip();
|
|
6683
6683
|
}, i.prototype.sub = function(n) {
|
|
6684
6684
|
return this.clone().isub(n);
|
|
6685
6685
|
};
|
|
@@ -6687,70 +6687,70 @@ Hf.exports;
|
|
|
6687
6687
|
d.negative = n.negative ^ A.negative;
|
|
6688
6688
|
var g = A.length + n.length | 0;
|
|
6689
6689
|
d.length = g, g = g - 1 | 0;
|
|
6690
|
-
var C = A.words[0] | 0, F = n.words[0] | 0,
|
|
6691
|
-
d.words[0] =
|
|
6690
|
+
var C = A.words[0] | 0, F = n.words[0] | 0, N = C * F, q = N & 67108863, D = N / 67108864 | 0;
|
|
6691
|
+
d.words[0] = q;
|
|
6692
6692
|
for (var h = 1; h < g; h++) {
|
|
6693
6693
|
for (var E = D >>> 26, j = D & 67108863, Y = Math.min(h, n.length - 1), W = Math.max(0, h - A.length + 1); W <= Y; W++) {
|
|
6694
6694
|
var re = h - W | 0;
|
|
6695
|
-
C = A.words[re] | 0, F = n.words[W] | 0,
|
|
6695
|
+
C = A.words[re] | 0, F = n.words[W] | 0, N = C * F + 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, F = d.words,
|
|
6702
|
+
var C = n.words, F = d.words, N = g.words, q = 0, D, h, E, j = C[0] | 0, Y = j & 8191, W = j >>> 13, re = C[1] | 0, ce = re & 8191, we = re >>> 13, Ae = C[2] | 0, Me = Ae & 8191, Fe = Ae >>> 13, Z0 = C[3] | 0, We = Z0 & 8191, Oe = Z0 >>> 13, _0 = C[4] | 0, Ge = _0 & 8191, Ye = _0 >>> 13, $0 = C[5] | 0, Qe = $0 & 8191, ze = $0 >>> 13, O0 = C[6] | 0, Ne = O0 & 8191, Se = O0 >>> 13, F0 = C[7] | 0, Je = F0 & 8191, f0 = F0 >>> 13, S0 = C[8] | 0, qe = S0 & 8191, u0 = S0 >>> 13, G0 = C[9] | 0, l0 = G0 & 8191, He = G0 >>> 13, z0 = F[0] | 0, a0 = z0 & 8191, r0 = z0 >>> 13, N0 = F[1] | 0, i0 = N0 & 8191, s0 = N0 >>> 13, W0 = F[2] | 0, e0 = W0 & 8191, n0 = W0 >>> 13, q0 = F[3] | 0, o0 = q0 & 8191, x0 = q0 >>> 13, D0 = F[4] | 0, t0 = D0 & 8191, Ve = D0 >>> 13, tt = F[5] | 0, c0 = tt & 8191, d0 = tt >>> 13, yt = F[6] | 0, Ie = yt & 8191, Re = yt >>> 13, l = F[7] | 0, _ = l & 8191, m = l >>> 13, s = F[8] | 0, M = s & 8191, p = s >>> 13, I = F[9] | 0, L = I & 8191, V = I >>> 13;
|
|
6703
6703
|
g.negative = n.negative ^ d.negative, g.length = 19, D = Math.imul(Y, a0), h = Math.imul(Y, r0), h = h + Math.imul(W, a0) | 0, E = Math.imul(W, r0);
|
|
6704
|
-
var ne = (
|
|
6705
|
-
|
|
6706
|
-
var fe = (
|
|
6707
|
-
|
|
6708
|
-
var he = (
|
|
6709
|
-
|
|
6710
|
-
var te = (
|
|
6711
|
-
|
|
6712
|
-
var xe = (
|
|
6713
|
-
|
|
6714
|
-
var ue = (
|
|
6715
|
-
|
|
6716
|
-
var ve = (
|
|
6717
|
-
|
|
6718
|
-
var ge = (
|
|
6719
|
-
|
|
6720
|
-
var me = (
|
|
6721
|
-
|
|
6722
|
-
var _e = (
|
|
6723
|
-
|
|
6724
|
-
var pe = (
|
|
6725
|
-
|
|
6726
|
-
var de = (
|
|
6727
|
-
|
|
6728
|
-
var ye = (
|
|
6729
|
-
|
|
6730
|
-
var oe = (
|
|
6731
|
-
|
|
6732
|
-
var le = (
|
|
6733
|
-
|
|
6734
|
-
var be = (
|
|
6735
|
-
|
|
6736
|
-
var se = (
|
|
6737
|
-
|
|
6738
|
-
var Z = (
|
|
6739
|
-
|
|
6740
|
-
var G = (
|
|
6741
|
-
return
|
|
6704
|
+
var ne = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
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(Y, i0) | 0, h = h + Math.imul(Y, s0) | 0, h = h + Math.imul(W, i0) | 0, E = E + Math.imul(W, s0) | 0;
|
|
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(Fe, a0) | 0, E = Math.imul(Fe, 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(Y, e0) | 0, h = h + Math.imul(Y, n0) | 0, h = h + Math.imul(W, e0) | 0, E = E + Math.imul(W, n0) | 0;
|
|
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(Fe, i0) | 0, E = E + Math.imul(Fe, 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(Y, o0) | 0, h = h + Math.imul(Y, x0) | 0, h = h + Math.imul(W, o0) | 0, E = E + Math.imul(W, x0) | 0;
|
|
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(Ye, a0) | 0, E = Math.imul(Ye, 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(Fe, e0) | 0, E = E + Math.imul(Fe, 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(Y, t0) | 0, h = h + Math.imul(Y, Ve) | 0, h = h + Math.imul(W, t0) | 0, E = E + Math.imul(W, Ve) | 0;
|
|
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(Ye, i0) | 0, E = E + Math.imul(Ye, 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(Fe, o0) | 0, E = E + Math.imul(Fe, 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(Y, c0) | 0, h = h + Math.imul(Y, d0) | 0, h = h + Math.imul(W, c0) | 0, E = E + Math.imul(W, d0) | 0;
|
|
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(Se, a0) | 0, E = Math.imul(Se, 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(Ye, e0) | 0, E = E + Math.imul(Ye, 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(Fe, t0) | 0, E = E + Math.imul(Fe, 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(Y, Ie) | 0, h = h + Math.imul(Y, Re) | 0, h = h + Math.imul(W, Ie) | 0, E = E + Math.imul(W, Re) | 0;
|
|
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(Se, i0) | 0, E = E + Math.imul(Se, 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(Ye, o0) | 0, E = E + Math.imul(Ye, 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(Fe, c0) | 0, E = E + Math.imul(Fe, 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(Y, _) | 0, h = h + Math.imul(Y, m) | 0, h = h + Math.imul(W, _) | 0, E = E + Math.imul(W, m) | 0;
|
|
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(Se, e0) | 0, E = E + Math.imul(Se, 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(Ye, t0) | 0, E = E + Math.imul(Ye, 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(Fe, Ie) | 0, E = E + Math.imul(Fe, 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(Y, M) | 0, h = h + Math.imul(Y, p) | 0, h = h + Math.imul(W, M) | 0, E = E + Math.imul(W, p) | 0;
|
|
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(Se, o0) | 0, E = E + Math.imul(Se, 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(Ye, c0) | 0, E = E + Math.imul(Ye, 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(Fe, _) | 0, E = E + Math.imul(Fe, 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(Y, L) | 0, h = h + Math.imul(Y, V) | 0, h = h + Math.imul(W, L) | 0, E = E + Math.imul(W, V) | 0;
|
|
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(Se, t0) | 0, E = E + Math.imul(Se, 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(Ye, Ie) | 0, E = E + Math.imul(Ye, 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(Fe, M) | 0, E = E + Math.imul(Fe, 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
|
+
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(Se, c0) | 0, E = E + Math.imul(Se, 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(Ye, _) | 0, E = E + Math.imul(Ye, 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(Fe, L) | 0, E = E + Math.imul(Fe, V) | 0;
|
|
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(Se, Ie) | 0, E = E + Math.imul(Se, 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(Ye, M) | 0, E = E + Math.imul(Ye, 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
|
+
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(Se, _) | 0, E = E + Math.imul(Se, 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(Ye, L) | 0, E = E + Math.imul(Ye, V) | 0;
|
|
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(Se, M) | 0, E = E + Math.imul(Se, 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
|
+
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(Se, L) | 0, E = E + Math.imul(Se, V) | 0;
|
|
6734
|
+
var be = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
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
|
+
var se = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6737
|
+
q = (E + (h >>> 13) | 0) + (se >>> 26) | 0, se &= 67108863, D = Math.imul(l0, M), h = Math.imul(l0, p), h = h + Math.imul(He, M) | 0, E = Math.imul(He, p), D = D + Math.imul(qe, L) | 0, h = h + Math.imul(qe, V) | 0, h = h + Math.imul(u0, L) | 0, E = E + Math.imul(u0, V) | 0;
|
|
6738
|
+
var Z = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6739
|
+
q = (E + (h >>> 13) | 0) + (Z >>> 26) | 0, Z &= 67108863, D = Math.imul(l0, L), h = Math.imul(l0, V), h = h + Math.imul(He, L) | 0, E = Math.imul(He, V);
|
|
6740
|
+
var G = (q + D | 0) + ((h & 8191) << 13) | 0;
|
|
6741
|
+
return q = (E + (h >>> 13) | 0) + (G >>> 26) | 0, G &= 67108863, N[0] = ne, N[1] = fe, N[2] = he, N[3] = te, N[4] = xe, N[5] = ue, N[6] = ve, N[7] = ge, N[8] = me, N[9] = _e, N[10] = pe, N[11] = de, N[12] = ye, N[13] = oe, N[14] = le, N[15] = be, N[16] = se, N[17] = Z, N[18] = G, q !== 0 && (N[19] = q, g.length++), g;
|
|
6742
6742
|
};
|
|
6743
6743
|
Math.imul || (R = w);
|
|
6744
6744
|
function k(A, n, d) {
|
|
6745
6745
|
d.negative = n.negative ^ A.negative, d.length = A.length + n.length;
|
|
6746
6746
|
for (var g = 0, C = 0, F = 0; F < d.length - 1; F++) {
|
|
6747
|
-
var
|
|
6747
|
+
var N = C;
|
|
6748
6748
|
C = 0;
|
|
6749
|
-
for (var
|
|
6749
|
+
for (var q = g & 67108863, D = Math.min(F, n.length - 1), h = Math.max(0, F - A.length + 1); h <= D; h++) {
|
|
6750
6750
|
var E = F - h, j = A.words[E] | 0, Y = n.words[h] | 0, W = j * Y, re = W & 67108863;
|
|
6751
|
-
|
|
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[F] =
|
|
6753
|
+
d.words[F] = q, g = N, N = C;
|
|
6754
6754
|
}
|
|
6755
6755
|
return g !== 0 ? d.words[F] = g : d.length--, d.strip();
|
|
6756
6756
|
}
|
|
@@ -6775,16 +6775,16 @@ Hf.exports;
|
|
|
6775
6775
|
for (var C = 0, F = 0; F < d; F++)
|
|
6776
6776
|
C |= (n & 1) << d - F - 1, n >>= 1;
|
|
6777
6777
|
return C;
|
|
6778
|
-
}, S.prototype.permute = function(n, d, g, C, F,
|
|
6779
|
-
for (var
|
|
6780
|
-
C[
|
|
6781
|
-
}, S.prototype.transform = function(n, d, g, C, F,
|
|
6782
|
-
this.permute(
|
|
6783
|
-
for (var
|
|
6784
|
-
for (var D =
|
|
6785
|
-
for (var Y = h, W = E, re = 0; re <
|
|
6786
|
-
var ce = g[j + re], we = C[j + re], Ae = g[j + re +
|
|
6787
|
-
Me = Y * Me + W * Ae, Ae = Fe, g[j + re] = ce + Ae, C[j + re] = we + Me, g[j + re +
|
|
6778
|
+
}, S.prototype.permute = function(n, d, g, C, F, N) {
|
|
6779
|
+
for (var q = 0; q < N; q++)
|
|
6780
|
+
C[q] = d[n[q]], F[q] = g[n[q]];
|
|
6781
|
+
}, S.prototype.transform = function(n, d, g, C, F, N) {
|
|
6782
|
+
this.permute(N, n, d, g, C, F);
|
|
6783
|
+
for (var q = 1; q < F; 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 < F; j += D)
|
|
6785
|
+
for (var Y = 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], Fe = Y * Ae - W * Me;
|
|
6787
|
+
Me = Y * Me + W * Ae, Ae = Fe, g[j + re] = ce + Ae, C[j + re] = we + Me, g[j + re + q] = ce - Ae, C[j + re + q] = we - Me, re !== D && (Fe = h * Y - E * W, W = h * W + E * Y, Y = Fe);
|
|
6788
6788
|
}
|
|
6789
6789
|
}, S.prototype.guessLen13b = function(n, d) {
|
|
6790
6790
|
var g = Math.max(d, n) | 1, C = g & 1, F = 0;
|
|
@@ -6804,23 +6804,23 @@ Hf.exports;
|
|
|
6804
6804
|
}
|
|
6805
6805
|
return n;
|
|
6806
6806
|
}, S.prototype.convert13b = function(n, d, g, C) {
|
|
6807
|
-
for (var F = 0,
|
|
6808
|
-
F = F + (n[
|
|
6809
|
-
for (
|
|
6810
|
-
g[
|
|
6807
|
+
for (var F = 0, N = 0; N < d; N++)
|
|
6808
|
+
F = F + (n[N] | 0), g[2 * N] = F & 8191, F = F >>> 13, g[2 * N + 1] = F & 8191, F = F >>> 13;
|
|
6809
|
+
for (N = 2 * d; N < C; ++N)
|
|
6810
|
+
g[N] = 0;
|
|
6811
6811
|
r(F === 0), r((F & -8192) === 0);
|
|
6812
6812
|
}, S.prototype.stub = function(n) {
|
|
6813
6813
|
for (var d = new Array(n), g = 0; g < n; g++)
|
|
6814
6814
|
d[g] = 0;
|
|
6815
6815
|
return d;
|
|
6816
6816
|
}, S.prototype.mulp = function(n, d, g) {
|
|
6817
|
-
var C = 2 * this.guessLen13b(n.length, d.length), F = this.makeRBT(C),
|
|
6818
|
-
W.length = C, this.convert13b(n.words, n.length,
|
|
6817
|
+
var C = 2 * this.guessLen13b(n.length, d.length), F = 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), Y = 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, F), this.transform(E, N, j, Y, C, F);
|
|
6819
6819
|
for (var re = 0; re < C; re++) {
|
|
6820
6820
|
var ce = D[re] * j[re] - h[re] * Y[re];
|
|
6821
6821
|
h[re] = D[re] * Y[re] + h[re] * j[re], D[re] = ce;
|
|
6822
6822
|
}
|
|
6823
|
-
return this.conjugate(D, h, C), this.transform(D, h, W,
|
|
6823
|
+
return this.conjugate(D, h, C), this.transform(D, h, W, N, C, F), 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);
|
|
@@ -6856,12 +6856,12 @@ Hf.exports;
|
|
|
6856
6856
|
r(typeof n == "number" && n >= 0);
|
|
6857
6857
|
var d = n % 26, g = (n - d) / 26, C = 67108863 >>> 26 - d << 26 - d, F;
|
|
6858
6858
|
if (d !== 0) {
|
|
6859
|
-
var
|
|
6859
|
+
var N = 0;
|
|
6860
6860
|
for (F = 0; F < this.length; F++) {
|
|
6861
|
-
var
|
|
6862
|
-
this.words[F] = D |
|
|
6861
|
+
var q = this.words[F] & C, D = (this.words[F] | 0) - q << d;
|
|
6862
|
+
this.words[F] = D | N, N = q >>> 26 - d;
|
|
6863
6863
|
}
|
|
6864
|
-
|
|
6864
|
+
N && (this.words[F] = N, this.length++);
|
|
6865
6865
|
}
|
|
6866
6866
|
if (g !== 0) {
|
|
6867
6867
|
for (F = this.length - 1; F >= 0; F--)
|
|
@@ -6877,22 +6877,22 @@ Hf.exports;
|
|
|
6877
6877
|
r(typeof n == "number" && n >= 0);
|
|
6878
6878
|
var C;
|
|
6879
6879
|
d ? C = (d - d % 26) / 26 : C = 0;
|
|
6880
|
-
var F = n % 26,
|
|
6881
|
-
if (C -=
|
|
6882
|
-
for (var h = 0; h <
|
|
6880
|
+
var F = n % 26, N = Math.min((n - F) / 26, this.length), q = 67108863 ^ 67108863 >>> F << F, D = g;
|
|
6881
|
+
if (C -= N, C = Math.max(0, C), D) {
|
|
6882
|
+
for (var h = 0; h < N; h++)
|
|
6883
6883
|
D.words[h] = this.words[h];
|
|
6884
|
-
D.length =
|
|
6884
|
+
D.length = N;
|
|
6885
6885
|
}
|
|
6886
|
-
if (
|
|
6887
|
-
if (this.length >
|
|
6888
|
-
for (this.length -=
|
|
6889
|
-
this.words[h] = this.words[h +
|
|
6886
|
+
if (N !== 0)
|
|
6887
|
+
if (this.length > N)
|
|
6888
|
+
for (this.length -= N, h = 0; h < this.length; h++)
|
|
6889
|
+
this.words[h] = this.words[h + N];
|
|
6890
6890
|
else
|
|
6891
6891
|
this.words[0] = 0, this.length = 1;
|
|
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 - F | j >>> F, E = j &
|
|
6895
|
+
this.words[h] = E << 26 - F | j >>> F, 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) {
|
|
@@ -6953,22 +6953,22 @@ Hf.exports;
|
|
|
6953
6953
|
}, i.prototype._ishlnsubmul = function(n, d, g) {
|
|
6954
6954
|
var C = n.length + g, F;
|
|
6955
6955
|
this._expand(C);
|
|
6956
|
-
var
|
|
6956
|
+
var N, q = 0;
|
|
6957
6957
|
for (F = 0; F < n.length; F++) {
|
|
6958
|
-
|
|
6958
|
+
N = (this.words[F + g] | 0) + q;
|
|
6959
6959
|
var D = (n.words[F] | 0) * d;
|
|
6960
|
-
|
|
6960
|
+
N -= D & 67108863, q = (N >> 26) - (D / 67108864 | 0), this.words[F + g] = N & 67108863;
|
|
6961
6961
|
}
|
|
6962
6962
|
for (; F < this.length - g; F++)
|
|
6963
|
-
|
|
6964
|
-
if (
|
|
6963
|
+
N = (this.words[F + g] | 0) + q, q = N >> 26, this.words[F + g] = N & 67108863;
|
|
6964
|
+
if (q === 0)
|
|
6965
6965
|
return this.strip();
|
|
6966
|
-
for (r(
|
|
6967
|
-
|
|
6966
|
+
for (r(q === -1), q = 0, F = 0; F < this.length; F++)
|
|
6967
|
+
N = -(this.words[F] | 0) + q, q = N >> 26, this.words[F] = 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(), F = n,
|
|
6971
|
-
g = 26 -
|
|
6970
|
+
var g = this.length - n.length, C = this.clone(), F = n, N = F.words[F.length - 1] | 0, q = this._countBits(N);
|
|
6971
|
+
g = 26 - q, g !== 0 && (F = F.ushln(g), C.iushln(g), N = F.words[F.length - 1] | 0);
|
|
6972
6972
|
var D = C.length - F.length, h;
|
|
6973
6973
|
if (d !== "mod") {
|
|
6974
6974
|
h = new i(null), h.length = D + 1, h.words = new Array(h.length);
|
|
@@ -6979,7 +6979,7 @@ Hf.exports;
|
|
|
6979
6979
|
j.negative === 0 && (C = j, h && (h.words[D] = 1));
|
|
6980
6980
|
for (var Y = D - 1; Y >= 0; Y--) {
|
|
6981
6981
|
var W = (C.words[F.length + Y] | 0) * 67108864 + (C.words[F.length + Y - 1] | 0);
|
|
6982
|
-
for (W = Math.min(W /
|
|
6982
|
+
for (W = Math.min(W / N | 0, 67108863), C._ishlnsubmul(F, W, Y); C.negative !== 0; )
|
|
6983
6983
|
W--, C.negative = 0, C._ishlnsubmul(F, 1, Y), C.isZero() || (C.negative ^= 1);
|
|
6984
6984
|
h && (h.words[Y] = W);
|
|
6985
6985
|
}
|
|
@@ -6993,15 +6993,15 @@ Hf.exports;
|
|
|
6993
6993
|
div: new i(0),
|
|
6994
6994
|
mod: new i(0)
|
|
6995
6995
|
};
|
|
6996
|
-
var C, F,
|
|
6997
|
-
return this.negative !== 0 && n.negative === 0 ? (
|
|
6996
|
+
var C, F, N;
|
|
6997
|
+
return this.negative !== 0 && n.negative === 0 ? (N = this.neg().divmod(n, d), d !== "mod" && (C = N.div.neg()), d !== "div" && (F = N.mod.neg(), g && F.negative !== 0 && F.iadd(n)), {
|
|
6998
6998
|
div: C,
|
|
6999
6999
|
mod: F
|
|
7000
|
-
}) : this.negative === 0 && n.negative !== 0 ? (
|
|
7000
|
+
}) : this.negative === 0 && n.negative !== 0 ? (N = this.divmod(n.neg(), d), d !== "mod" && (C = N.div.neg()), {
|
|
7001
7001
|
div: C,
|
|
7002
|
-
mod:
|
|
7003
|
-
}) : this.negative & n.negative ? (
|
|
7004
|
-
div:
|
|
7002
|
+
mod: N.mod
|
|
7003
|
+
}) : this.negative & n.negative ? (N = this.neg().divmod(n.neg(), d), d !== "div" && (F = N.mod.neg(), g && F.negative !== 0 && F.isub(n)), {
|
|
7004
|
+
div: N.div,
|
|
7005
7005
|
mod: F
|
|
7006
7006
|
}) : n.length > this.length || this.cmp(n) < 0 ? {
|
|
7007
7007
|
div: new i(0),
|
|
@@ -7026,8 +7026,8 @@ Hf.exports;
|
|
|
7026
7026
|
var d = this.divmod(n);
|
|
7027
7027
|
if (d.mod.isZero())
|
|
7028
7028
|
return d.div;
|
|
7029
|
-
var g = d.div.negative !== 0 ? d.mod.isub(n) : d.mod, C = n.ushrn(1), F = n.andln(1),
|
|
7030
|
-
return
|
|
7029
|
+
var g = d.div.negative !== 0 ? d.mod.isub(n) : d.mod, C = n.ushrn(1), F = n.andln(1), N = g.cmp(C);
|
|
7030
|
+
return N < 0 || F === 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,7 +7046,7 @@ Hf.exports;
|
|
|
7046
7046
|
r(n.negative === 0), r(!n.isZero());
|
|
7047
7047
|
var d = this, g = n.clone();
|
|
7048
7048
|
d.negative !== 0 ? d = d.umod(n) : d = d.clone();
|
|
7049
|
-
for (var C = new i(1), F = new i(0),
|
|
7049
|
+
for (var C = new i(1), F = 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, Y = 1; !(d.words[0] & Y) && j < 26; ++j, Y <<= 1)
|
|
@@ -7058,29 +7058,29 @@ Hf.exports;
|
|
|
7058
7058
|
;
|
|
7059
7059
|
if (W > 0)
|
|
7060
7060
|
for (g.iushrn(W); W-- > 0; )
|
|
7061
|
-
(
|
|
7062
|
-
d.cmp(g) >= 0 ? (d.isub(g), C.isub(
|
|
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), F.isub(q)) : (g.isub(d), N.isub(C), q.isub(F));
|
|
7063
7063
|
}
|
|
7064
7064
|
return {
|
|
7065
|
-
a:
|
|
7066
|
-
b:
|
|
7065
|
+
a: N,
|
|
7066
|
+
b: q,
|
|
7067
7067
|
gcd: g.iushln(D)
|
|
7068
7068
|
};
|
|
7069
7069
|
}, i.prototype._invmp = function(n) {
|
|
7070
7070
|
r(n.negative === 0), r(!n.isZero());
|
|
7071
7071
|
var d = this, g = n.clone();
|
|
7072
7072
|
d.negative !== 0 ? d = d.umod(n) : d = d.clone();
|
|
7073
|
-
for (var C = new i(1), F = new i(0),
|
|
7074
|
-
for (var
|
|
7073
|
+
for (var C = new i(1), F = new i(0), N = g.clone(); d.cmpn(1) > 0 && g.cmpn(1) > 0; ) {
|
|
7074
|
+
for (var q = 0, D = 1; !(d.words[0] & D) && q < 26; ++q, D <<= 1)
|
|
7075
7075
|
;
|
|
7076
|
-
if (
|
|
7077
|
-
for (d.iushrn(
|
|
7078
|
-
C.isOdd() && C.iadd(
|
|
7076
|
+
if (q > 0)
|
|
7077
|
+
for (d.iushrn(q); q-- > 0; )
|
|
7078
|
+
C.isOdd() && C.iadd(N), C.iushrn(1);
|
|
7079
7079
|
for (var h = 0, E = 1; !(g.words[0] & E) && h < 26; ++h, E <<= 1)
|
|
7080
7080
|
;
|
|
7081
7081
|
if (h > 0)
|
|
7082
7082
|
for (g.iushrn(h); h-- > 0; )
|
|
7083
|
-
F.isOdd() && F.iadd(
|
|
7083
|
+
F.isOdd() && F.iadd(N), F.iushrn(1);
|
|
7084
7084
|
d.cmp(g) >= 0 ? (d.isub(g), C.isub(F)) : (g.isub(d), F.isub(C));
|
|
7085
7085
|
}
|
|
7086
7086
|
var j;
|
|
@@ -7101,8 +7101,8 @@ Hf.exports;
|
|
|
7101
7101
|
g.iushrn(1);
|
|
7102
7102
|
var F = d.cmp(g);
|
|
7103
7103
|
if (F < 0) {
|
|
7104
|
-
var
|
|
7105
|
-
d = g, g =
|
|
7104
|
+
var N = d;
|
|
7105
|
+
d = g, g = N;
|
|
7106
7106
|
} else if (F === 0 || g.cmpn(1) === 0)
|
|
7107
7107
|
break;
|
|
7108
7108
|
d.isub(g);
|
|
@@ -7121,11 +7121,11 @@ Hf.exports;
|
|
|
7121
7121
|
var d = n % 26, g = (n - d) / 26, C = 1 << d;
|
|
7122
7122
|
if (this.length <= g)
|
|
7123
7123
|
return this._expand(g + 1), this.words[g] |= C, this;
|
|
7124
|
-
for (var F = C,
|
|
7125
|
-
var
|
|
7126
|
-
|
|
7124
|
+
for (var F = C, N = g; F !== 0 && N < this.length; N++) {
|
|
7125
|
+
var q = this.words[N] | 0;
|
|
7126
|
+
q += F, F = q >>> 26, q &= 67108863, this.words[N] = q;
|
|
7127
7127
|
}
|
|
7128
|
-
return F !== 0 && (this.words[
|
|
7128
|
+
return F !== 0 && (this.words[N] = F, this.length++), this;
|
|
7129
7129
|
}, i.prototype.isZero = function() {
|
|
7130
7130
|
return this.length === 1 && this.words[0] === 0;
|
|
7131
7131
|
}, i.prototype.cmpn = function(n) {
|
|
@@ -7259,12 +7259,12 @@ Hf.exports;
|
|
|
7259
7259
|
n.words[0] = 0, n.length = 1;
|
|
7260
7260
|
return;
|
|
7261
7261
|
}
|
|
7262
|
-
var
|
|
7263
|
-
for (d.words[d.length++] =
|
|
7264
|
-
var
|
|
7265
|
-
n.words[F - 10] = (
|
|
7262
|
+
var N = n.words[9];
|
|
7263
|
+
for (d.words[d.length++] = N & g, F = 10; F < n.length; F++) {
|
|
7264
|
+
var q = n.words[F] | 0;
|
|
7265
|
+
n.words[F - 10] = (q & g) << 4 | N >>> 22, N = q;
|
|
7266
7266
|
}
|
|
7267
|
-
|
|
7267
|
+
N >>>= 22, n.words[F - 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++) {
|
|
@@ -7373,11 +7373,11 @@ Hf.exports;
|
|
|
7373
7373
|
for (var C = this.m.subn(1), F = 0; !C.isZero() && C.andln(1) === 0; )
|
|
7374
7374
|
F++, C.iushrn(1);
|
|
7375
7375
|
r(!C.isZero());
|
|
7376
|
-
var
|
|
7377
|
-
for (h = new i(2 * h * h).toRed(this); this.pow(h, D).cmp(
|
|
7378
|
-
h.redIAdd(
|
|
7379
|
-
for (var E = this.pow(h, C), j = this.pow(n, C.addn(1).iushrn(1)), Y = this.pow(n, C), W = F; Y.cmp(
|
|
7380
|
-
for (var re = Y, ce = 0; re.cmp(
|
|
7376
|
+
var N = new i(1).toRed(this), q = N.redNeg(), D = this.m.subn(1).iushrn(1), h = this.m.bitLength();
|
|
7377
|
+
for (h = new i(2 * h * h).toRed(this); this.pow(h, D).cmp(q) !== 0; )
|
|
7378
|
+
h.redIAdd(q);
|
|
7379
|
+
for (var E = this.pow(h, C), j = this.pow(n, C.addn(1).iushrn(1)), Y = this.pow(n, C), W = F; Y.cmp(N) !== 0; ) {
|
|
7380
|
+
for (var re = Y, ce = 0; re.cmp(N) !== 0; ce++)
|
|
7381
7381
|
re = re.redSqr();
|
|
7382
7382
|
r(ce < W);
|
|
7383
7383
|
var we = this.pow(E, new i(1).iushln(W - ce - 1));
|
|
@@ -7396,19 +7396,19 @@ Hf.exports;
|
|
|
7396
7396
|
C[0] = new i(1).toRed(this), C[1] = n;
|
|
7397
7397
|
for (var F = 2; F < C.length; F++)
|
|
7398
7398
|
C[F] = this.mul(C[F - 1], n);
|
|
7399
|
-
var
|
|
7399
|
+
var N = C[0], q = 0, D = 0, h = d.bitLength() % 26;
|
|
7400
7400
|
for (h === 0 && (h = 26), F = d.length - 1; F >= 0; F--) {
|
|
7401
7401
|
for (var E = d.words[F], j = h - 1; j >= 0; j--) {
|
|
7402
7402
|
var Y = E >> j & 1;
|
|
7403
|
-
if (
|
|
7403
|
+
if (N !== C[0] && (N = this.sqr(N)), Y === 0 && q === 0) {
|
|
7404
7404
|
D = 0;
|
|
7405
7405
|
continue;
|
|
7406
7406
|
}
|
|
7407
|
-
|
|
7407
|
+
q <<= 1, q |= Y, D++, !(D !== g && (F !== 0 || j !== 0)) && (N = this.mul(N, C[q]), D = 0, q = 0);
|
|
7408
7408
|
}
|
|
7409
7409
|
h = 26;
|
|
7410
7410
|
}
|
|
7411
|
-
return
|
|
7411
|
+
return N;
|
|
7412
7412
|
}, Q.prototype.convertTo = function(n) {
|
|
7413
7413
|
var d = n.umod(this.m);
|
|
7414
7414
|
return d === n ? d.clone() : d;
|
|
@@ -7429,13 +7429,13 @@ Hf.exports;
|
|
|
7429
7429
|
}, U.prototype.imul = function(n, d) {
|
|
7430
7430
|
if (n.isZero() || d.isZero())
|
|
7431
7431
|
return n.words[0] = 0, n.length = 1, n;
|
|
7432
|
-
var g = n.imul(d), C = g.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), F = g.isub(C).iushrn(this.shift),
|
|
7433
|
-
return F.cmp(this.m) >= 0 ?
|
|
7432
|
+
var g = n.imul(d), C = g.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), F = g.isub(C).iushrn(this.shift), N = F;
|
|
7433
|
+
return F.cmp(this.m) >= 0 ? N = F.isub(this.m) : F.cmpn(0) < 0 && (N = F.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), F = g.isub(C).iushrn(this.shift),
|
|
7438
|
-
return F.cmp(this.m) >= 0 ?
|
|
7437
|
+
var g = n.mul(d), C = g.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), F = g.isub(C).iushrn(this.shift), N = F;
|
|
7438
|
+
return F.cmp(this.m) >= 0 ? N = F.isub(this.m) : F.cmpn(0) < 0 && (N = F.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);
|
|
@@ -8472,14 +8472,14 @@ function zs(f, e, t) {
|
|
|
8472
8472
|
return f + e + t >>> 0;
|
|
8473
8473
|
}
|
|
8474
8474
|
Le.sum32_3 = zs;
|
|
8475
|
-
function
|
|
8475
|
+
function Ns(f, e, t, r) {
|
|
8476
8476
|
return f + e + t + r >>> 0;
|
|
8477
8477
|
}
|
|
8478
|
-
Le.sum32_4 =
|
|
8479
|
-
function
|
|
8478
|
+
Le.sum32_4 = Ns;
|
|
8479
|
+
function qs(f, e, t, r, a) {
|
|
8480
8480
|
return f + e + t + r + a >>> 0;
|
|
8481
8481
|
}
|
|
8482
|
-
Le.sum32_5 =
|
|
8482
|
+
Le.sum32_5 = qs;
|
|
8483
8483
|
function Ls(f, e, t, r) {
|
|
8484
8484
|
var a = f[e], i = f[e + 1], y = r + i >>> 0, x = (y < r ? 1 : 0) + t + a;
|
|
8485
8485
|
f[e] = x >>> 0, f[e + 1] = y;
|
|
@@ -8608,7 +8608,7 @@ function fo(f) {
|
|
|
8608
8608
|
return rt(f, 17) ^ rt(f, 19) ^ f >>> 10;
|
|
8609
8609
|
}
|
|
8610
8610
|
ht.g1_256 = fo;
|
|
8611
|
-
var
|
|
8611
|
+
var Nt = Le, io = Wt, no = ht, pf = Nt.rotl32, Gt = Nt.sum32, ao = Nt.sum32_5, so = no.ft_1, Sn = io.BlockHash, oo = [
|
|
8612
8612
|
1518500249,
|
|
8613
8613
|
1859775393,
|
|
8614
8614
|
2400959708,
|
|
@@ -8625,7 +8625,7 @@ function at() {
|
|
|
8625
8625
|
3285377520
|
|
8626
8626
|
], this.W = new Array(80);
|
|
8627
8627
|
}
|
|
8628
|
-
|
|
8628
|
+
Nt.inherits(at, Sn);
|
|
8629
8629
|
var co = at;
|
|
8630
8630
|
at.blockSize = 512;
|
|
8631
8631
|
at.outSize = 160;
|
|
@@ -8644,9 +8644,9 @@ at.prototype._update = function(e, t) {
|
|
|
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
|
at.prototype._digest = function(e) {
|
|
8647
|
-
return e === "hex" ?
|
|
8647
|
+
return e === "hex" ? Nt.toHex32(this.h, "big") : Nt.split32(this.h, "big");
|
|
8648
8648
|
};
|
|
8649
|
-
var
|
|
8649
|
+
var qt = Le, ho = Wt, Kt = ht, uo = Pt, Q0 = qt.sum32, lo = qt.sum32_4, xo = qt.sum32_5, vo = Kt.ch32, bo = Kt.maj32, po = Kt.s0_256, yo = Kt.s1_256, go = Kt.g0_256, mo = Kt.g1_256, Dn = ho.BlockHash, _o = [
|
|
8650
8650
|
1116352408,
|
|
8651
8651
|
1899447441,
|
|
8652
8652
|
3049323471,
|
|
@@ -8726,7 +8726,7 @@ function st() {
|
|
|
8726
8726
|
1541459225
|
|
8727
8727
|
], this.k = _o, this.W = new Array(64);
|
|
8728
8728
|
}
|
|
8729
|
-
|
|
8729
|
+
qt.inherits(st, Dn);
|
|
8730
8730
|
var Rn = st;
|
|
8731
8731
|
st.blockSize = 512;
|
|
8732
8732
|
st.outSize = 256;
|
|
@@ -8745,7 +8745,7 @@ st.prototype._update = function(e, t) {
|
|
|
8745
8745
|
this.h[0] = Q0(this.h[0], i), this.h[1] = Q0(this.h[1], y), this.h[2] = Q0(this.h[2], x), this.h[3] = Q0(this.h[3], u), this.h[4] = Q0(this.h[4], o), this.h[5] = Q0(this.h[5], c), this.h[6] = Q0(this.h[6], v), this.h[7] = Q0(this.h[7], b);
|
|
8746
8746
|
};
|
|
8747
8747
|
st.prototype._digest = function(e) {
|
|
8748
|
-
return e === "hex" ?
|
|
8748
|
+
return e === "hex" ? qt.toHex32(this.h, "big") : qt.split32(this.h, "big");
|
|
8749
8749
|
};
|
|
8750
8750
|
var Ff = Le, kn = Rn;
|
|
8751
8751
|
function vt() {
|
|
@@ -8965,7 +8965,7 @@ et.prototype._prepareBlock = function(e, t) {
|
|
|
8965
8965
|
for (var r = this.W, a = 0; a < 32; a++)
|
|
8966
8966
|
r[a] = e[t + a];
|
|
8967
8967
|
for (; a < r.length; a += 2) {
|
|
8968
|
-
var i = Lo(r[a - 4], r[a - 3]), y = Ho(r[a - 4], r[a - 3]), x = r[a - 14], u = r[a - 13], o =
|
|
8968
|
+
var i = Lo(r[a - 4], r[a - 3]), y = Ho(r[a - 4], r[a - 3]), x = r[a - 14], u = r[a - 13], o = No(r[a - 30], r[a - 29]), c = qo(r[a - 30], r[a - 29]), v = r[a - 32], b = r[a - 31];
|
|
8969
8969
|
r[a] = Bo(
|
|
8970
8970
|
i,
|
|
8971
8971
|
y,
|
|
@@ -9016,8 +9016,8 @@ et.prototype._update = function(e, t) {
|
|
|
9016
9016
|
g
|
|
9017
9017
|
);
|
|
9018
9018
|
H = Io(a, i), $ = To(a, i), K = ko(a, i, y, x, u), X = Po(a, i, y, x, u, o);
|
|
9019
|
-
var
|
|
9020
|
-
S = k, P = z, k = w, z = R, w = b, R = B, b = yf(c, v, C, F), B = gf(v, v, C, F), c = u, v = o, u = y, o = x, y = a, x = i, a = yf(C, F,
|
|
9019
|
+
var N = yf(H, $, K, X), q = gf(H, $, K, X);
|
|
9020
|
+
S = k, P = z, k = w, z = R, w = b, R = B, b = yf(c, v, C, F), B = gf(v, v, C, F), c = u, v = o, u = y, o = x, y = a, x = i, a = yf(C, F, N, q), i = gf(C, F, N, q);
|
|
9021
9021
|
}
|
|
9022
9022
|
gt(this.h, 0, a, i), gt(this.h, 2, y, x), gt(this.h, 4, u, o), gt(this.h, 6, c, v), gt(this.h, 8, b, B), gt(this.h, 10, w, R), gt(this.h, 12, k, z), gt(this.h, 14, S, P);
|
|
9023
9023
|
};
|
|
@@ -9056,11 +9056,11 @@ function zo(f, e) {
|
|
|
9056
9056
|
var t = it(f, e, 14), r = it(f, e, 18), a = it(e, f, 9), i = t ^ r ^ a;
|
|
9057
9057
|
return i < 0 && (i += 4294967296), i;
|
|
9058
9058
|
}
|
|
9059
|
-
function
|
|
9059
|
+
function No(f, e) {
|
|
9060
9060
|
var t = ft(f, e, 1), r = ft(f, e, 8), a = Pn(f, e, 7), i = t ^ r ^ a;
|
|
9061
9061
|
return i < 0 && (i += 4294967296), i;
|
|
9062
9062
|
}
|
|
9063
|
-
function
|
|
9063
|
+
function qo(f, e) {
|
|
9064
9064
|
var t = it(f, e, 1), r = it(f, e, 8), a = In(f, e, 7), i = t ^ r ^ a;
|
|
9065
9065
|
return i < 0 && (i += 4294967296), i;
|
|
9066
9066
|
}
|
|
@@ -9109,14 +9109,14 @@ Yt.sha224 = Ao;
|
|
|
9109
9109
|
Yt.sha256 = Rn;
|
|
9110
9110
|
Yt.sha384 = Uo;
|
|
9111
9111
|
Yt.sha512 = On;
|
|
9112
|
-
var
|
|
9112
|
+
var Nn = {}, Dt = Le, $o = Wt, ar = Dt.rotl32, Ui = Dt.sum32, Qt = Dt.sum32_3, $i = Dt.sum32_4, qn = $o.BlockHash;
|
|
9113
9113
|
function ot() {
|
|
9114
9114
|
if (!(this instanceof ot))
|
|
9115
9115
|
return new ot();
|
|
9116
|
-
|
|
9116
|
+
qn.call(this), this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], this.endian = "little";
|
|
9117
9117
|
}
|
|
9118
|
-
Dt.inherits(ot,
|
|
9119
|
-
|
|
9118
|
+
Dt.inherits(ot, qn);
|
|
9119
|
+
Nn.ripemd160 = ot;
|
|
9120
9120
|
ot.blockSize = 512;
|
|
9121
9121
|
ot.outSize = 160;
|
|
9122
9122
|
ot.hmacStrength = 192;
|
|
@@ -9501,7 +9501,7 @@ Lt.prototype.digest = function(e) {
|
|
|
9501
9501
|
};
|
|
9502
9502
|
(function(f) {
|
|
9503
9503
|
var e = f;
|
|
9504
|
-
e.utils = Le, e.common = Wt, e.sha = Yt, e.ripemd =
|
|
9504
|
+
e.utils = Le, e.common = Wt, e.sha = Yt, e.ripemd = Nn, 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
|
})(Mr);
|
|
9506
9506
|
var mf, Yi;
|
|
9507
9507
|
function Jo() {
|
|
@@ -10985,13 +10985,13 @@ var Kn = { exports: {} };
|
|
|
10985
10985
|
for (m = 0; m < 16; m++)
|
|
10986
10986
|
l[m] = _[m] | 0;
|
|
10987
10987
|
}
|
|
10988
|
-
function
|
|
10988
|
+
function N(l) {
|
|
10989
10989
|
var _, m, s = 1;
|
|
10990
10990
|
for (_ = 0; _ < 16; _++)
|
|
10991
10991
|
m = l[_] + s + 65535, s = Math.floor(m / 65536), l[_] = m - s * 65536;
|
|
10992
10992
|
l[0] += s - 1 + 37 * (s - 1);
|
|
10993
10993
|
}
|
|
10994
|
-
function
|
|
10994
|
+
function q(l, _, m) {
|
|
10995
10995
|
for (var s, M = ~(m - 1), p = 0; p < 16; p++)
|
|
10996
10996
|
s = M & (l[p] ^ _[p]), l[p] ^= s, _[p] ^= s;
|
|
10997
10997
|
}
|
|
@@ -10999,10 +10999,10 @@ var Kn = { exports: {} };
|
|
|
10999
10999
|
var m, s, M, p = t(), I = t();
|
|
11000
11000
|
for (m = 0; m < 16; m++)
|
|
11001
11001
|
I[m] = _[m];
|
|
11002
|
-
for (
|
|
11002
|
+
for (N(I), N(I), N(I), s = 0; s < 2; s++) {
|
|
11003
11003
|
for (p[0] = I[0] - 65517, m = 1; m < 15; m++)
|
|
11004
11004
|
p[m] = I[m] - 65535 - (p[m - 1] >> 16 & 1), p[m - 1] &= 65535;
|
|
11005
|
-
p[15] = I[15] - 32767 - (p[14] >> 16 & 1), M = p[15] >> 16 & 1, p[14] &= 65535,
|
|
11005
|
+
p[15] = I[15] - 32767 - (p[14] >> 16 & 1), M = p[15] >> 16 & 1, p[14] &= 65535, q(I, p, 1 - M);
|
|
11006
11006
|
}
|
|
11007
11007
|
for (m = 0; m < 16; m++)
|
|
11008
11008
|
l[2 * m] = I[m] & 255, l[2 * m + 1] = I[m] >> 8;
|
|
@@ -11061,7 +11061,7 @@ var Kn = { exports: {} };
|
|
|
11061
11061
|
for (s[31] = _[31] & 127 | 64, s[0] &= 248, j(M, m), I = 0; I < 16; I++)
|
|
11062
11062
|
V[I] = M[I], fe[I] = L[I] = ne[I] = 0;
|
|
11063
11063
|
for (L[0] = fe[0] = 1, I = 254; I >= 0; --I)
|
|
11064
|
-
p = s[I >>> 3] >>> (I & 7) & 1,
|
|
11064
|
+
p = s[I >>> 3] >>> (I & 7) & 1, q(L, V, p), q(ne, fe, p), Y(he, L, ne), W(L, L, ne), Y(ne, V, fe), W(V, V, fe), ce(fe, he), ce(te, L), re(L, ne, L), re(ne, V, he), Y(he, L, ne), W(L, L, ne), ce(V, L), W(ne, fe, te), re(L, ne, u), Y(L, L, fe), re(ne, ne, L), re(L, fe, te), re(fe, V, M), ce(V, he), q(L, V, p), q(ne, fe, p);
|
|
11065
11065
|
for (I = 0; I < 16; I++)
|
|
11066
11066
|
M[I + 16] = L[I], M[I + 32] = ne[I], M[I + 48] = V[I], M[I + 64] = fe[I];
|
|
11067
11067
|
var xe = M.subarray(32), ue = M.subarray(16);
|
|
@@ -11272,10 +11272,10 @@ var Kn = { exports: {} };
|
|
|
11272
11272
|
var m = t(), s = t(), M = t(), p = t(), I = t(), L = t(), V = t(), ne = t(), fe = t();
|
|
11273
11273
|
W(m, l[1], l[0]), W(fe, _[1], _[0]), re(m, m, fe), Y(s, l[0], l[1]), Y(fe, _[0], _[1]), re(s, s, fe), re(M, l[3], _[3]), re(M, M, c), re(p, l[2], _[2]), Y(p, p, p), W(I, s, m), W(L, p, M), Y(V, p, M), Y(ne, s, m), re(l[0], I, L), re(l[1], ne, V), re(l[2], V, L), re(l[3], I, ne);
|
|
11274
11274
|
}
|
|
11275
|
-
function
|
|
11275
|
+
function Ne(l, _, m) {
|
|
11276
11276
|
var s;
|
|
11277
11277
|
for (s = 0; s < 4; s++)
|
|
11278
|
-
|
|
11278
|
+
q(l[s], _[s], m);
|
|
11279
11279
|
}
|
|
11280
11280
|
function Se(l, _) {
|
|
11281
11281
|
var m = t(), s = t(), M = t();
|
|
@@ -11284,7 +11284,7 @@ var Kn = { exports: {} };
|
|
|
11284
11284
|
function F0(l, _, m) {
|
|
11285
11285
|
var s, M;
|
|
11286
11286
|
for (F(l[0], y), F(l[1], x), F(l[2], x), F(l[3], y), M = 255; M >= 0; --M)
|
|
11287
|
-
s = m[M / 8 | 0] >> (M & 7) & 1,
|
|
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()];
|
|
@@ -11297,7 +11297,7 @@ var Kn = { exports: {} };
|
|
|
11297
11297
|
return 0;
|
|
11298
11298
|
}
|
|
11299
11299
|
var S0 = 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
|
-
function
|
|
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)
|
|
@@ -11317,7 +11317,7 @@ var Kn = { exports: {} };
|
|
|
11317
11317
|
_[m] = l[m];
|
|
11318
11318
|
for (m = 0; m < 64; m++)
|
|
11319
11319
|
l[m] = 0;
|
|
11320
|
-
|
|
11320
|
+
qe(l, _);
|
|
11321
11321
|
}
|
|
11322
11322
|
function G0(l, _, m, s) {
|
|
11323
11323
|
var M = new Uint8Array(64), p = new Uint8Array(64), I = new Uint8Array(64), L, V, ne = new Float64Array(64), fe = [t(), t(), t(), t()];
|
|
@@ -11336,7 +11336,7 @@ var Kn = { exports: {} };
|
|
|
11336
11336
|
for (L = 0; L < 32; L++)
|
|
11337
11337
|
for (V = 0; V < 32; V++)
|
|
11338
11338
|
ne[L + V] += p[L] * M[V];
|
|
11339
|
-
return
|
|
11339
|
+
return qe(l.subarray(32), ne), he;
|
|
11340
11340
|
}
|
|
11341
11341
|
function l0(l, _) {
|
|
11342
11342
|
var m = t(), s = t(), M = t(), p = t(), I = t(), L = t(), V = t();
|
|
@@ -11359,7 +11359,7 @@ var Kn = { exports: {} };
|
|
|
11359
11359
|
l[M] = _[M + 64];
|
|
11360
11360
|
return m;
|
|
11361
11361
|
}
|
|
11362
|
-
var z0 = 32, a0 = 24, r0 = 32,
|
|
11362
|
+
var z0 = 32, a0 = 24, r0 = 32, N0 = 16, i0 = 32, s0 = 32, W0 = 32, e0 = 32, n0 = 32, q0 = a0, o0 = r0, x0 = N0, D0 = 64, t0 = 32, Ve = 64, tt = 32, c0 = 64;
|
|
11363
11363
|
e.lowlevel = {
|
|
11364
11364
|
crypto_core_hsalsa20: H,
|
|
11365
11365
|
crypto_stream_xor: U,
|
|
@@ -11386,13 +11386,13 @@ var Kn = { exports: {} };
|
|
|
11386
11386
|
crypto_secretbox_KEYBYTES: z0,
|
|
11387
11387
|
crypto_secretbox_NONCEBYTES: a0,
|
|
11388
11388
|
crypto_secretbox_ZEROBYTES: r0,
|
|
11389
|
-
crypto_secretbox_BOXZEROBYTES:
|
|
11389
|
+
crypto_secretbox_BOXZEROBYTES: N0,
|
|
11390
11390
|
crypto_scalarmult_BYTES: i0,
|
|
11391
11391
|
crypto_scalarmult_SCALARBYTES: s0,
|
|
11392
11392
|
crypto_box_PUBLICKEYBYTES: W0,
|
|
11393
11393
|
crypto_box_SECRETKEYBYTES: e0,
|
|
11394
11394
|
crypto_box_BEFORENMBYTES: n0,
|
|
11395
|
-
crypto_box_NONCEBYTES:
|
|
11395
|
+
crypto_box_NONCEBYTES: q0,
|
|
11396
11396
|
crypto_box_ZEROBYTES: o0,
|
|
11397
11397
|
crypto_box_BOXZEROBYTES: x0,
|
|
11398
11398
|
crypto_sign_BYTES: D0,
|
|
@@ -11412,7 +11412,7 @@ var Kn = { exports: {} };
|
|
|
11412
11412
|
pow2523: Ae,
|
|
11413
11413
|
add: O0,
|
|
11414
11414
|
set25519: F,
|
|
11415
|
-
modL:
|
|
11415
|
+
modL: qe,
|
|
11416
11416
|
scalarmult: F0,
|
|
11417
11417
|
scalarbase: Je
|
|
11418
11418
|
};
|
|
@@ -11444,13 +11444,13 @@ var Kn = { exports: {} };
|
|
|
11444
11444
|
Ie(l, _, m), d0(m, _);
|
|
11445
11445
|
for (var s = new Uint8Array(r0 + l.length), M = new Uint8Array(s.length), p = 0; p < l.length; p++)
|
|
11446
11446
|
s[p + r0] = l[p];
|
|
11447
|
-
return g(M, s, s.length, _, m), M.subarray(
|
|
11447
|
+
return g(M, s, s.length, _, m), M.subarray(N0);
|
|
11448
11448
|
}, e.secretbox.open = function(l, _, m) {
|
|
11449
11449
|
Ie(l, _, m), d0(m, _);
|
|
11450
|
-
for (var s = new Uint8Array(
|
|
11451
|
-
s[p +
|
|
11450
|
+
for (var s = new Uint8Array(N0 + l.length), M = new Uint8Array(s.length), p = 0; p < l.length; p++)
|
|
11451
|
+
s[p + N0] = l[p];
|
|
11452
11452
|
return s.length < 32 || C(M, s, s.length, _, m) !== 0 ? null : M.subarray(r0);
|
|
11453
|
-
}, e.secretbox.keyLength = z0, e.secretbox.nonceLength = a0, e.secretbox.overheadLength =
|
|
11453
|
+
}, e.secretbox.keyLength = z0, e.secretbox.nonceLength = a0, e.secretbox.overheadLength = N0, e.scalarMult = function(l, _) {
|
|
11454
11454
|
if (Ie(l, _), l.length !== s0)
|
|
11455
11455
|
throw new Error("bad n size");
|
|
11456
11456
|
if (_.length !== i0)
|
|
@@ -11480,7 +11480,7 @@ var Kn = { exports: {} };
|
|
|
11480
11480
|
throw new Error("bad secret key size");
|
|
11481
11481
|
var _ = new Uint8Array(W0);
|
|
11482
11482
|
return Fe(_, l), { publicKey: _, secretKey: new Uint8Array(l) };
|
|
11483
|
-
}, e.box.publicKeyLength = W0, e.box.secretKeyLength = e0, e.box.sharedKeyLength = n0, e.box.nonceLength =
|
|
11483
|
+
}, e.box.publicKeyLength = W0, e.box.secretKeyLength = e0, e.box.sharedKeyLength = n0, e.box.nonceLength = q0, 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");
|
|
11486
11486
|
var m = new Uint8Array(D0 + l.length);
|
|
@@ -11911,15 +11911,15 @@ function Pr(f, e) {
|
|
|
11911
11911
|
}
|
|
11912
11912
|
const Oc = 1.33;
|
|
11913
11913
|
function zc(f) {
|
|
11914
|
-
return typeof f == "string" ?
|
|
11914
|
+
return typeof f == "string" ? Nc(f) : Math.ceil((f.byteLength || f.size) * Oc);
|
|
11915
11915
|
}
|
|
11916
|
-
function
|
|
11916
|
+
function Nc(f) {
|
|
11917
11917
|
let e = 0, t = 0;
|
|
11918
11918
|
for (let r = 0, a = f.length; r < a; r++)
|
|
11919
11919
|
e = f.charCodeAt(r), e < 128 ? t += 1 : e < 2048 ? t += 2 : e < 55296 || e >= 57344 ? t += 3 : (r++, t += 4);
|
|
11920
11920
|
return t;
|
|
11921
11921
|
}
|
|
11922
|
-
function
|
|
11922
|
+
function qc(f) {
|
|
11923
11923
|
let e = "";
|
|
11924
11924
|
for (let t in f)
|
|
11925
11925
|
f.hasOwnProperty(t) && (e.length && (e += "&"), e += encodeURIComponent(t) + "=" + encodeURIComponent(f[t]));
|
|
@@ -12032,7 +12032,7 @@ class Zf extends A0 {
|
|
|
12032
12032
|
return this.opts.port && (this.opts.secure && +(this.opts.port !== 443) || !this.opts.secure && Number(this.opts.port) !== 80) ? ":" + this.opts.port : "";
|
|
12033
12033
|
}
|
|
12034
12034
|
_query(e) {
|
|
12035
|
-
const t =
|
|
12035
|
+
const t = qc(e);
|
|
12036
12036
|
return t.length ? "?" + t : "";
|
|
12037
12037
|
}
|
|
12038
12038
|
}
|
|
@@ -13972,7 +13972,7 @@ class b1 {
|
|
|
13972
13972
|
// 타입 가드 함수
|
|
13973
13973
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any
|
|
13974
13974
|
isAccountCryptoType(e) {
|
|
13975
|
-
return typeof e == "object" && e !== null && typeof e.signature == "string" && typeof e.publicKey == "string" && typeof e.address == "string" && typeof e.network == "string" && typeof e.etc == "string";
|
|
13975
|
+
return typeof e == "object" && e !== null && typeof e.signature == "string" && typeof e.publicKey == "string" && typeof e.address == "string" && typeof e.network == "string" && typeof e.nickName == "string" && typeof e.etc == "string";
|
|
13976
13976
|
}
|
|
13977
13977
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any
|
|
13978
13978
|
// private isSignature(obj: any): obj is SignatureType {
|
|
@@ -14019,10 +14019,10 @@ class b1 {
|
|
|
14019
14019
|
t = `${t}
|
|
14020
14020
|
|
|
14021
14021
|
Nonce: ${r}`, await this.sendMessage(e, t);
|
|
14022
|
-
const { publicKey: i, signature: y, address: x, network: u } = await this.getAccountCrypto();
|
|
14023
|
-
if (
|
|
14022
|
+
const { publicKey: i, signature: y, address: x, network: u, nickName: o } = await this.getAccountCrypto();
|
|
14023
|
+
if (!jn.xphereVerify(t, i, y))
|
|
14024
14024
|
throw new Error("Verification failed");
|
|
14025
|
-
return { address: x, network: u, signature: y, publicKey: i };
|
|
14025
|
+
return { address: x, network: u, signature: y, publicKey: i, nickName: o };
|
|
14026
14026
|
} else
|
|
14027
14027
|
throw new Error("Verification failed");
|
|
14028
14028
|
} catch (a) {
|
|
@@ -14054,7 +14054,7 @@ const oa = new y1(), ca = "data:image/svg+xml,%3csvg%20width='167'%20height='166
|
|
|
14054
14054
|
logoSize: x = 30,
|
|
14055
14055
|
...u
|
|
14056
14056
|
}) => {
|
|
14057
|
-
const [o, c] =
|
|
14057
|
+
const [o, c] = Nf(!0), v = jn.generateNonce(16), { qrCode: b, roomId: B } = oa.generateQrCode("login", e, t, f);
|
|
14058
14058
|
return zt(() => {
|
|
14059
14059
|
const w = setTimeout(
|
|
14060
14060
|
() => {
|
|
@@ -14072,14 +14072,17 @@ const oa = new y1(), ca = "data:image/svg+xml,%3csvg%20width='167'%20height='166
|
|
|
14072
14072
|
Nonce: ${v}`, z = {
|
|
14073
14073
|
publicKey: R.publicKey,
|
|
14074
14074
|
message: k
|
|
14075
|
-
},
|
|
14075
|
+
}, P = {
|
|
14076
14076
|
isSuccess: !0,
|
|
14077
|
-
|
|
14078
|
-
|
|
14079
|
-
|
|
14080
|
-
|
|
14077
|
+
account: {
|
|
14078
|
+
address: R.address,
|
|
14079
|
+
network: R.network,
|
|
14080
|
+
nickName: R.nickName
|
|
14081
|
+
},
|
|
14082
|
+
payload: z,
|
|
14083
|
+
signature: R.signature
|
|
14081
14084
|
};
|
|
14082
|
-
i(
|
|
14085
|
+
i(P);
|
|
14083
14086
|
} catch {
|
|
14084
14087
|
i({
|
|
14085
14088
|
isSuccess: !1
|
|
@@ -14099,7 +14102,7 @@ class g1 {
|
|
|
14099
14102
|
// 타입 가드 함수
|
|
14100
14103
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any
|
|
14101
14104
|
isAccountType(e) {
|
|
14102
|
-
return typeof e == "object" && e !== null && typeof e.address == "string" && typeof e.network == "string";
|
|
14105
|
+
return typeof e == "object" && e !== null && typeof e.address == "string" && typeof e.network == "string" && typeof e.nickName == "string";
|
|
14103
14106
|
}
|
|
14104
14107
|
getAccount() {
|
|
14105
14108
|
return new Promise((e, t) => {
|
|
@@ -14128,7 +14131,7 @@ const m1 = new g1(), w1 = ({
|
|
|
14128
14131
|
logoSize: y = 30,
|
|
14129
14132
|
...x
|
|
14130
14133
|
}) => {
|
|
14131
|
-
const [u, o] =
|
|
14134
|
+
const [u, o] = Nf(!0), { qrCode: c, roomId: v } = oa.generateQrCode("provide", e, t, f);
|
|
14132
14135
|
return zt(() => {
|
|
14133
14136
|
const b = setTimeout(
|
|
14134
14137
|
() => {
|
|
@@ -14144,7 +14147,8 @@ const m1 = new g1(), w1 = ({
|
|
|
14144
14147
|
const B = await m1.qrAddressProvide(v), w = {
|
|
14145
14148
|
isSuccess: !0,
|
|
14146
14149
|
address: B.address,
|
|
14147
|
-
network: B.network
|
|
14150
|
+
network: B.network,
|
|
14151
|
+
nickName: B.nickName
|
|
14148
14152
|
};
|
|
14149
14153
|
a(w);
|
|
14150
14154
|
} catch {
|