zigap-utils 0.0.41 → 0.0.42
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 +11 -11
- package/dist/index.es.js +496 -390
- package/dist/util/addressProvide.d.ts +3 -3
- package/dist/util/index.d.ts +1 -2
- package/dist/util/qrService/index.d.ts +1 -0
- package/dist/util/{qrService.d.ts → qrService/qrService.d.ts} +1 -1
- package/dist/util/types.d.ts +4 -1
- package/dist/xphere/validation.d.ts +10 -0
- package/package.json +1 -15
- package/dist/util/socketService.d.ts +0 -11
- package/dist/validation/hashing.d.ts +0 -2
- package/dist/validation/token.d.ts +0 -5
package/dist/index.es.js
CHANGED
|
@@ -1,22 +1,24 @@
|
|
|
1
1
|
"use client";
|
|
2
2
|
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
|
-
var wt = (f, e, t) => ha(f, typeof e != "symbol" ? e + "" : e, t);
|
|
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;
|
|
10
10
|
}
|
|
11
11
|
function on(f) {
|
|
12
|
-
if (f.__esModule)
|
|
12
|
+
if (f.__esModule)
|
|
13
|
+
return f;
|
|
13
14
|
var e = f.default;
|
|
14
15
|
if (typeof e == "function") {
|
|
15
16
|
var t = function r() {
|
|
16
17
|
return this instanceof r ? Reflect.construct(e, arguments, this.constructor) : e.apply(this, arguments);
|
|
17
18
|
};
|
|
18
19
|
t.prototype = e.prototype;
|
|
19
|
-
} else
|
|
20
|
+
} else
|
|
21
|
+
t = {};
|
|
20
22
|
return Object.defineProperty(t, "__esModule", { value: !0 }), Object.keys(f).forEach(function(r) {
|
|
21
23
|
var a = Object.getOwnPropertyDescriptor(f, r);
|
|
22
24
|
Object.defineProperty(t, r, a.get ? a : {
|
|
@@ -40,14 +42,18 @@ const cn = /* @__PURE__ */ on(ua);
|
|
|
40
42
|
*/
|
|
41
43
|
var ti;
|
|
42
44
|
function la() {
|
|
43
|
-
if (ti)
|
|
45
|
+
if (ti)
|
|
46
|
+
return Xt;
|
|
44
47
|
ti = 1;
|
|
45
48
|
var f = cn, e = Symbol.for("react.element"), t = Symbol.for("react.fragment"), r = Object.prototype.hasOwnProperty, a = f.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner, i = { key: !0, ref: !0, __self: !0, __source: !0 };
|
|
46
49
|
function y(x, u, o) {
|
|
47
50
|
var c, v = {}, b = null, B = null;
|
|
48
51
|
o !== void 0 && (b = "" + o), u.key !== void 0 && (b = "" + u.key), u.ref !== void 0 && (B = u.ref);
|
|
49
|
-
for (c in u)
|
|
50
|
-
|
|
52
|
+
for (c in u)
|
|
53
|
+
r.call(u, c) && !i.hasOwnProperty(c) && (v[c] = u[c]);
|
|
54
|
+
if (x && x.defaultProps)
|
|
55
|
+
for (c in u = x.defaultProps, u)
|
|
56
|
+
v[c] === void 0 && (v[c] = u[c]);
|
|
51
57
|
return { $$typeof: e, type: x, key: b, ref: B, props: v, _owner: a.current };
|
|
52
58
|
}
|
|
53
59
|
return Xt.Fragment = t, Xt.jsx = y, Xt.jsxs = y, Xt;
|
|
@@ -154,14 +160,14 @@ function xa() {
|
|
|
154
160
|
}
|
|
155
161
|
return null;
|
|
156
162
|
}
|
|
157
|
-
var g = Object.assign, C = 0, F,
|
|
163
|
+
var g = Object.assign, C = 0, F, N, q, D, h, E, j;
|
|
158
164
|
function Y() {
|
|
159
165
|
}
|
|
160
166
|
Y.__reactDisabledLog = !0;
|
|
161
167
|
function W() {
|
|
162
168
|
{
|
|
163
169
|
if (C === 0) {
|
|
164
|
-
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;
|
|
165
171
|
var p = {
|
|
166
172
|
configurable: !0,
|
|
167
173
|
enumerable: !0,
|
|
@@ -194,10 +200,10 @@ function xa() {
|
|
|
194
200
|
value: F
|
|
195
201
|
}),
|
|
196
202
|
info: g({}, p, {
|
|
197
|
-
value:
|
|
203
|
+
value: N
|
|
198
204
|
}),
|
|
199
205
|
warn: g({}, p, {
|
|
200
|
-
value:
|
|
206
|
+
value: q
|
|
201
207
|
}),
|
|
202
208
|
error: g({}, p, {
|
|
203
209
|
value: D
|
|
@@ -369,9 +375,9 @@ function xa() {
|
|
|
369
375
|
}
|
|
370
376
|
}
|
|
371
377
|
}
|
|
372
|
-
var
|
|
378
|
+
var Ne = Array.isArray;
|
|
373
379
|
function Se(p) {
|
|
374
|
-
return
|
|
380
|
+
return Ne(p);
|
|
375
381
|
}
|
|
376
382
|
function F0(p) {
|
|
377
383
|
{
|
|
@@ -393,7 +399,7 @@ function xa() {
|
|
|
393
399
|
if (Je(p))
|
|
394
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);
|
|
395
401
|
}
|
|
396
|
-
var
|
|
402
|
+
var qe = z.ReactCurrentOwner, u0 = {
|
|
397
403
|
key: !0,
|
|
398
404
|
ref: !0,
|
|
399
405
|
__self: !0,
|
|
@@ -417,12 +423,12 @@ function xa() {
|
|
|
417
423
|
return p.key !== void 0;
|
|
418
424
|
}
|
|
419
425
|
function r0(p, I) {
|
|
420
|
-
if (typeof p.ref == "string" &&
|
|
421
|
-
var L = d(
|
|
422
|
-
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);
|
|
423
429
|
}
|
|
424
430
|
}
|
|
425
|
-
function
|
|
431
|
+
function N0(p, I) {
|
|
426
432
|
{
|
|
427
433
|
var L = function() {
|
|
428
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));
|
|
@@ -486,13 +492,13 @@ function xa() {
|
|
|
486
492
|
}
|
|
487
493
|
if (te || xe) {
|
|
488
494
|
var ve = typeof p == "function" ? p.displayName || p.name || "Unknown" : p;
|
|
489
|
-
te &&
|
|
495
|
+
te && N0(he, ve), xe && i0(he, ve);
|
|
490
496
|
}
|
|
491
|
-
return s0(p, te, xe, ne, V,
|
|
497
|
+
return s0(p, te, xe, ne, V, qe.current, he);
|
|
492
498
|
}
|
|
493
499
|
}
|
|
494
500
|
var e0 = z.ReactCurrentOwner, n0 = z.ReactDebugCurrentFrame;
|
|
495
|
-
function
|
|
501
|
+
function q0(p) {
|
|
496
502
|
if (p) {
|
|
497
503
|
var I = p._owner, L = Ge(p.type, p._source, I ? I.type : null);
|
|
498
504
|
n0.setExtraStackFrame(L);
|
|
@@ -542,7 +548,7 @@ Check the top-level render call using <` + L + ">.");
|
|
|
542
548
|
return;
|
|
543
549
|
Ve[L] = !0;
|
|
544
550
|
var V = "";
|
|
545
|
-
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);
|
|
546
552
|
}
|
|
547
553
|
}
|
|
548
554
|
function d0(p, I) {
|
|
@@ -594,11 +600,11 @@ Check the top-level render call using <` + L + ">.");
|
|
|
594
600
|
for (var I = Object.keys(p.props), L = 0; L < I.length; L++) {
|
|
595
601
|
var V = I[L];
|
|
596
602
|
if (V !== "children" && V !== "key") {
|
|
597
|
-
|
|
603
|
+
q0(p), S("Invalid prop `%s` supplied to `React.Fragment`. React.Fragment can only have `key` and `children` props.", V), q0(null);
|
|
598
604
|
break;
|
|
599
605
|
}
|
|
600
606
|
}
|
|
601
|
-
p.ref !== null && (
|
|
607
|
+
p.ref !== null && (q0(p), S("Invalid attribute `ref` supplied to `React.Fragment`."), q0(null));
|
|
602
608
|
}
|
|
603
609
|
}
|
|
604
610
|
var Re = {};
|
|
@@ -1170,7 +1176,7 @@ function ln(f) {
|
|
|
1170
1176
|
"includeMargin",
|
|
1171
1177
|
"style",
|
|
1172
1178
|
"imageSettings"
|
|
1173
|
-
]), 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);
|
|
1174
1180
|
zt(() => {
|
|
1175
1181
|
if (b.current != null) {
|
|
1176
1182
|
const S = b.current, P = S.getContext("2d");
|
|
@@ -2064,7 +2070,7 @@ function Ra() {
|
|
|
2064
2070
|
});
|
|
2065
2071
|
}(zr)), zr.exports;
|
|
2066
2072
|
}
|
|
2067
|
-
var
|
|
2073
|
+
var Nr = { exports: {} }, ci;
|
|
2068
2074
|
function Rt() {
|
|
2069
2075
|
return ci || (ci = 1, function(f, e) {
|
|
2070
2076
|
(function(t, r) {
|
|
@@ -2137,9 +2143,9 @@ function Rt() {
|
|
|
2137
2143
|
}
|
|
2138
2144
|
}(), t.enc.Base64;
|
|
2139
2145
|
});
|
|
2140
|
-
}(
|
|
2146
|
+
}(Nr)), Nr.exports;
|
|
2141
2147
|
}
|
|
2142
|
-
var
|
|
2148
|
+
var qr = { exports: {} }, di;
|
|
2143
2149
|
function ka() {
|
|
2144
2150
|
return di || (di = 1, function(f, e) {
|
|
2145
2151
|
(function(t, r) {
|
|
@@ -2219,7 +2225,7 @@ function ka() {
|
|
|
2219
2225
|
}
|
|
2220
2226
|
}(), t.enc.Base64url;
|
|
2221
2227
|
});
|
|
2222
|
-
}(
|
|
2228
|
+
}(qr)), qr.exports;
|
|
2223
2229
|
}
|
|
2224
2230
|
var Lr = { exports: {} }, hi;
|
|
2225
2231
|
function kt() {
|
|
@@ -2247,8 +2253,8 @@ function kt() {
|
|
|
2247
2253
|
var S = k + z, P = R[S];
|
|
2248
2254
|
R[S] = (P << 8 | P >>> 24) & 16711935 | (P << 24 | P >>> 8) & 4278255360;
|
|
2249
2255
|
}
|
|
2250
|
-
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],
|
|
2251
|
-
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;
|
|
2252
2258
|
},
|
|
2253
2259
|
_doFinalize: function() {
|
|
2254
2260
|
var R = this._data, k = R.words, z = this._nDataBytes * 8, S = R.sigBytes * 8;
|
|
@@ -2332,7 +2338,7 @@ function bn() {
|
|
|
2332
2338
|
}(Hr)), Hr.exports;
|
|
2333
2339
|
}
|
|
2334
2340
|
var Ur = { exports: {} }, li;
|
|
2335
|
-
function
|
|
2341
|
+
function qf() {
|
|
2336
2342
|
return li || (li = 1, function(f, e) {
|
|
2337
2343
|
(function(t, r) {
|
|
2338
2344
|
f.exports = r($e());
|
|
@@ -2364,8 +2370,8 @@ function Nf() {
|
|
|
2364
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;
|
|
2365
2371
|
v[X] = U + v[X - 7] + n + v[X - 16];
|
|
2366
2372
|
}
|
|
2367
|
-
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),
|
|
2368
|
-
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;
|
|
2369
2375
|
}
|
|
2370
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;
|
|
2371
2377
|
},
|
|
@@ -2387,7 +2393,7 @@ var $r = { exports: {} }, xi;
|
|
|
2387
2393
|
function Pa() {
|
|
2388
2394
|
return xi || (xi = 1, function(f, e) {
|
|
2389
2395
|
(function(t, r, a) {
|
|
2390
|
-
f.exports = r($e(),
|
|
2396
|
+
f.exports = r($e(), qf());
|
|
2391
2397
|
})(Pe, function(t) {
|
|
2392
2398
|
return function() {
|
|
2393
2399
|
var r = t, a = r.lib, i = a.WordArray, y = r.algo, x = y.SHA256, u = y.SHA224 = x.extend({
|
|
@@ -2524,18 +2530,18 @@ function pn() {
|
|
|
2524
2530
|
]);
|
|
2525
2531
|
},
|
|
2526
2532
|
_doProcessBlock: function(w, R) {
|
|
2527
|
-
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,
|
|
2528
|
-
var Se, F0, Je = b[
|
|
2529
|
-
if (
|
|
2530
|
-
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;
|
|
2531
2537
|
else {
|
|
2532
|
-
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;
|
|
2533
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;
|
|
2534
2540
|
}
|
|
2535
|
-
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);
|
|
2536
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;
|
|
2537
2543
|
}
|
|
2538
|
-
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);
|
|
2539
2545
|
},
|
|
2540
2546
|
_doFinalize: function() {
|
|
2541
2547
|
var w = this._data, R = w.words, k = this._nDataBytes * 8, z = w.sigBytes * 8;
|
|
@@ -2651,21 +2657,21 @@ function Ta() {
|
|
|
2651
2657
|
d.high = U, d.low = A;
|
|
2652
2658
|
}
|
|
2653
2659
|
for (var Q = 0; Q < 5; Q++)
|
|
2654
|
-
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++) {
|
|
2655
2661
|
var K = S[Q + 5 * n];
|
|
2656
2662
|
K.high ^= U, K.low ^= A;
|
|
2657
2663
|
}
|
|
2658
|
-
for (var
|
|
2659
|
-
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];
|
|
2660
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);
|
|
2661
|
-
var j = w[b[
|
|
2667
|
+
var j = w[b[q]];
|
|
2662
2668
|
j.high = U, j.low = A;
|
|
2663
2669
|
}
|
|
2664
2670
|
var Y = w[0], W = S[0];
|
|
2665
2671
|
Y.high = W.high, Y.low = W.low;
|
|
2666
2672
|
for (var Q = 0; Q < 5; Q++)
|
|
2667
2673
|
for (var n = 0; n < 5; n++) {
|
|
2668
|
-
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];
|
|
2669
2675
|
K.high = re.high ^ ~ce.high & we.high, K.low = re.low ^ ~ce.low & we.low;
|
|
2670
2676
|
}
|
|
2671
2677
|
var K = S[0], Ae = B[X];
|
|
@@ -3044,11 +3050,11 @@ function Oa() {
|
|
|
3044
3050
|
var Q = K + X, U = $[Q];
|
|
3045
3051
|
$[Q] = (U << 8 | U >>> 24) & 16711935 | (U << 24 | U >>> 8) & 4278255360;
|
|
3046
3052
|
}
|
|
3047
|
-
var A = this._hash.words, n = B.words, d = w.words, g = o.words, C = c.words, F = v.words,
|
|
3048
|
-
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];
|
|
3049
3055
|
for (var Ae, X = 0; X < 80; X += 1)
|
|
3050
|
-
Ae =
|
|
3051
|
-
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;
|
|
3052
3058
|
},
|
|
3053
3059
|
_doFinalize: function() {
|
|
3054
3060
|
var $ = this._data, K = $.words, X = this._nDataBytes * 8, Q = $.sigBytes * 8;
|
|
@@ -3169,7 +3175,7 @@ var Xr = { exports: {} }, mi;
|
|
|
3169
3175
|
function za() {
|
|
3170
3176
|
return mi || (mi = 1, function(f, e) {
|
|
3171
3177
|
(function(t, r, a) {
|
|
3172
|
-
f.exports = r($e(),
|
|
3178
|
+
f.exports = r($e(), qf(), Lf());
|
|
3173
3179
|
})(Pe, function(t) {
|
|
3174
3180
|
return function() {
|
|
3175
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({
|
|
@@ -3523,8 +3529,8 @@ function C0() {
|
|
|
3523
3529
|
function A(n, d, g) {
|
|
3524
3530
|
var C, F = this._iv;
|
|
3525
3531
|
F ? (C = F, this._iv = r) : C = this._prevBlock;
|
|
3526
|
-
for (var
|
|
3527
|
-
n[d +
|
|
3532
|
+
for (var N = 0; N < g; N++)
|
|
3533
|
+
n[d + N] ^= C[N];
|
|
3528
3534
|
}
|
|
3529
3535
|
return U;
|
|
3530
3536
|
}(), z = a.pad = {}, S = z.Pkcs7 = {
|
|
@@ -3543,8 +3549,8 @@ function C0() {
|
|
|
3543
3549
|
pad: function(U, A) {
|
|
3544
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)
|
|
3545
3551
|
C.push(g);
|
|
3546
|
-
var
|
|
3547
|
-
U.concat(
|
|
3552
|
+
var N = x.create(C, d);
|
|
3553
|
+
U.concat(N);
|
|
3548
3554
|
},
|
|
3549
3555
|
/**
|
|
3550
3556
|
* Unpads data that had been padded using the algorithm defined in PKCS #5/7.
|
|
@@ -3834,7 +3840,7 @@ function C0() {
|
|
|
3834
3840
|
}(Gr)), Gr.exports;
|
|
3835
3841
|
}
|
|
3836
3842
|
var Qr = { exports: {} }, Ei;
|
|
3837
|
-
function
|
|
3843
|
+
function Na() {
|
|
3838
3844
|
return Ei || (Ei = 1, function(f, e) {
|
|
3839
3845
|
(function(t, r, a) {
|
|
3840
3846
|
f.exports = r($e(), C0());
|
|
@@ -3864,7 +3870,7 @@ function qa() {
|
|
|
3864
3870
|
}(Qr)), Qr.exports;
|
|
3865
3871
|
}
|
|
3866
3872
|
var Jr = { exports: {} }, wi;
|
|
3867
|
-
function
|
|
3873
|
+
function qa() {
|
|
3868
3874
|
return wi || (wi = 1, function(f, e) {
|
|
3869
3875
|
(function(t, r, a) {
|
|
3870
3876
|
f.exports = r($e(), C0());
|
|
@@ -4150,12 +4156,12 @@ function Xa() {
|
|
|
4150
4156
|
P[T + 1] = P[T + 3], P[T + 3] = H;
|
|
4151
4157
|
},
|
|
4152
4158
|
_doCryptBlock: function(P, T, H, $, K, X, Q, U) {
|
|
4153
|
-
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,
|
|
4154
|
-
var
|
|
4155
|
-
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;
|
|
4156
4162
|
}
|
|
4157
|
-
var
|
|
4158
|
-
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;
|
|
4159
4165
|
},
|
|
4160
4166
|
keySize: 256 / 32
|
|
4161
4167
|
});
|
|
@@ -5004,9 +5010,9 @@ function Qa() {
|
|
|
5004
5010
|
});
|
|
5005
5011
|
}(lf)), lf.exports;
|
|
5006
5012
|
}
|
|
5007
|
-
var xf = { exports: {} },
|
|
5013
|
+
var xf = { exports: {} }, Ni;
|
|
5008
5014
|
function Ja() {
|
|
5009
|
-
return
|
|
5015
|
+
return Ni || (Ni = 1, function(f, e) {
|
|
5010
5016
|
(function(t, r, a) {
|
|
5011
5017
|
f.exports = r($e(), Rt(), kt(), At(), C0());
|
|
5012
5018
|
})(Pe, function(t) {
|
|
@@ -5068,9 +5074,9 @@ function Ja() {
|
|
|
5068
5074
|
});
|
|
5069
5075
|
}(xf)), xf.exports;
|
|
5070
5076
|
}
|
|
5071
|
-
var vf = { exports: {} },
|
|
5077
|
+
var vf = { exports: {} }, qi;
|
|
5072
5078
|
function es() {
|
|
5073
|
-
return
|
|
5079
|
+
return qi || (qi = 1, function(f, e) {
|
|
5074
5080
|
(function(t, r, a) {
|
|
5075
5081
|
f.exports = r($e(), Rt(), kt(), At(), C0());
|
|
5076
5082
|
})(Pe, function(t) {
|
|
@@ -6192,7 +6198,7 @@ function es() {
|
|
|
6192
6198
|
}
|
|
6193
6199
|
(function(f, e) {
|
|
6194
6200
|
(function(t, r, a) {
|
|
6195
|
-
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());
|
|
6196
6202
|
})(Pe, function(t) {
|
|
6197
6203
|
return t;
|
|
6198
6204
|
});
|
|
@@ -6261,7 +6267,8 @@ Hf.exports;
|
|
|
6261
6267
|
(function(f) {
|
|
6262
6268
|
(function(e, t) {
|
|
6263
6269
|
function r(A, n) {
|
|
6264
|
-
if (!A)
|
|
6270
|
+
if (!A)
|
|
6271
|
+
throw new Error(n || "Assertion failed");
|
|
6265
6272
|
}
|
|
6266
6273
|
function a(A, n) {
|
|
6267
6274
|
A.super_ = n;
|
|
@@ -6309,13 +6316,13 @@ Hf.exports;
|
|
|
6309
6316
|
this.length = Math.ceil(n.length / 3), this.words = new Array(this.length);
|
|
6310
6317
|
for (var C = 0; C < this.length; C++)
|
|
6311
6318
|
this.words[C] = 0;
|
|
6312
|
-
var F,
|
|
6319
|
+
var F, N, q = 0;
|
|
6313
6320
|
if (g === "be")
|
|
6314
6321
|
for (C = n.length - 1, F = 0; C >= 0; C -= 3)
|
|
6315
|
-
|
|
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++);
|
|
6316
6323
|
else if (g === "le")
|
|
6317
6324
|
for (C = 0, F = 0; C < n.length; C += 3)
|
|
6318
|
-
|
|
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++);
|
|
6319
6326
|
return this.strip();
|
|
6320
6327
|
};
|
|
6321
6328
|
function x(A, n) {
|
|
@@ -6330,21 +6337,21 @@ Hf.exports;
|
|
|
6330
6337
|
this.length = Math.ceil((n.length - d) / 6), this.words = new Array(this.length);
|
|
6331
6338
|
for (var C = 0; C < this.length; C++)
|
|
6332
6339
|
this.words[C] = 0;
|
|
6333
|
-
var F = 0,
|
|
6340
|
+
var F = 0, N = 0, q;
|
|
6334
6341
|
if (g === "be")
|
|
6335
6342
|
for (C = n.length - 1; C >= d; C -= 2)
|
|
6336
|
-
|
|
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;
|
|
6337
6344
|
else {
|
|
6338
6345
|
var D = n.length - d;
|
|
6339
6346
|
for (C = D % 2 === 0 ? d + 1 : d; C < n.length; C += 2)
|
|
6340
|
-
|
|
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;
|
|
6341
6348
|
}
|
|
6342
6349
|
this.strip();
|
|
6343
6350
|
};
|
|
6344
6351
|
function o(A, n, d, g) {
|
|
6345
|
-
for (var C = 0, F = Math.min(A.length, d),
|
|
6346
|
-
var
|
|
6347
|
-
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;
|
|
6348
6355
|
}
|
|
6349
6356
|
return C;
|
|
6350
6357
|
}
|
|
@@ -6353,11 +6360,11 @@ Hf.exports;
|
|
|
6353
6360
|
for (var C = 0, F = 1; F <= 67108863; F *= d)
|
|
6354
6361
|
C++;
|
|
6355
6362
|
C--, F = F / d | 0;
|
|
6356
|
-
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)
|
|
6357
6364
|
h = o(n, E, E + C, d), this.imuln(F), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
|
|
6358
|
-
if (
|
|
6365
|
+
if (q !== 0) {
|
|
6359
6366
|
var j = 1;
|
|
6360
|
-
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++)
|
|
6361
6368
|
j *= d;
|
|
6362
6369
|
this.imuln(j), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
|
|
6363
6370
|
}
|
|
@@ -6492,9 +6499,9 @@ Hf.exports;
|
|
|
6492
6499
|
var g;
|
|
6493
6500
|
if (n === 16 || n === "hex") {
|
|
6494
6501
|
g = "";
|
|
6495
|
-
for (var C = 0, F = 0,
|
|
6496
|
-
var
|
|
6497
|
-
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--);
|
|
6498
6505
|
}
|
|
6499
6506
|
for (F !== 0 && (g = F.toString(16) + g); g.length % d !== 0; )
|
|
6500
6507
|
g = "0" + g;
|
|
@@ -6525,26 +6532,27 @@ Hf.exports;
|
|
|
6525
6532
|
}, i.prototype.toArrayLike = function(n, d, g) {
|
|
6526
6533
|
var C = this.byteLength(), F = g || Math.max(1, C);
|
|
6527
6534
|
r(C <= F, "byte array longer than desired length"), r(F > 0, "Requested array length <= 0"), this.strip();
|
|
6528
|
-
var
|
|
6529
|
-
if (
|
|
6535
|
+
var N = d === "le", q = new n(F), D, h, E = this.clone();
|
|
6536
|
+
if (N) {
|
|
6530
6537
|
for (h = 0; !E.isZero(); h++)
|
|
6531
|
-
D = E.andln(255), E.iushrn(8),
|
|
6538
|
+
D = E.andln(255), E.iushrn(8), q[h] = D;
|
|
6532
6539
|
for (; h < F; h++)
|
|
6533
|
-
|
|
6540
|
+
q[h] = 0;
|
|
6534
6541
|
} else {
|
|
6535
6542
|
for (h = 0; h < F - C; h++)
|
|
6536
|
-
|
|
6543
|
+
q[h] = 0;
|
|
6537
6544
|
for (h = 0; !E.isZero(); h++)
|
|
6538
|
-
D = E.andln(255), E.iushrn(8),
|
|
6545
|
+
D = E.andln(255), E.iushrn(8), q[F - h - 1] = D;
|
|
6539
6546
|
}
|
|
6540
|
-
return
|
|
6547
|
+
return q;
|
|
6541
6548
|
}, Math.clz32 ? i.prototype._countBits = function(n) {
|
|
6542
6549
|
return 32 - Math.clz32(n);
|
|
6543
6550
|
} : i.prototype._countBits = function(n) {
|
|
6544
6551
|
var d = n, g = 0;
|
|
6545
6552
|
return d >= 4096 && (g += 13, d >>>= 13), d >= 64 && (g += 7, d >>>= 7), d >= 8 && (g += 4, d >>>= 4), d >= 2 && (g += 2, d >>>= 2), g + d;
|
|
6546
6553
|
}, i.prototype._zeroBits = function(n) {
|
|
6547
|
-
if (n === 0)
|
|
6554
|
+
if (n === 0)
|
|
6555
|
+
return 26;
|
|
6548
6556
|
var d = n, g = 0;
|
|
6549
6557
|
return d & 8191 || (g += 13, d >>>= 13), d & 127 || (g += 7, d >>>= 7), d & 15 || (g += 4, d >>>= 4), d & 3 || (g += 2, d >>>= 2), d & 1 || g++, g;
|
|
6550
6558
|
}, i.prototype.bitLength = function() {
|
|
@@ -6559,10 +6567,12 @@ Hf.exports;
|
|
|
6559
6567
|
return n;
|
|
6560
6568
|
}
|
|
6561
6569
|
i.prototype.zeroBits = function() {
|
|
6562
|
-
if (this.isZero())
|
|
6570
|
+
if (this.isZero())
|
|
6571
|
+
return 0;
|
|
6563
6572
|
for (var n = 0, d = 0; d < this.length; d++) {
|
|
6564
6573
|
var g = this._zeroBits(this.words[d]);
|
|
6565
|
-
if (n += g, g !== 26)
|
|
6574
|
+
if (n += g, g !== 26)
|
|
6575
|
+
break;
|
|
6566
6576
|
}
|
|
6567
6577
|
return n;
|
|
6568
6578
|
}, i.prototype.byteLength = function() {
|
|
@@ -6637,15 +6647,15 @@ Hf.exports;
|
|
|
6637
6647
|
return n.negative = 0, d = this.isub(n), n.negative = 1, d._normSign();
|
|
6638
6648
|
var g, C;
|
|
6639
6649
|
this.length > n.length ? (g = this, C = n) : (g = n, C = this);
|
|
6640
|
-
for (var F = 0,
|
|
6641
|
-
d = (g.words[
|
|
6642
|
-
for (; F !== 0 &&
|
|
6643
|
-
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;
|
|
6644
6654
|
if (this.length = g.length, F !== 0)
|
|
6645
6655
|
this.words[this.length] = F, this.length++;
|
|
6646
6656
|
else if (g !== this)
|
|
6647
|
-
for (;
|
|
6648
|
-
this.words[
|
|
6657
|
+
for (; N < g.length; N++)
|
|
6658
|
+
this.words[N] = g.words[N];
|
|
6649
6659
|
return this;
|
|
6650
6660
|
}, i.prototype.add = function(n) {
|
|
6651
6661
|
var d;
|
|
@@ -6662,14 +6672,14 @@ Hf.exports;
|
|
|
6662
6672
|
return this.negative = 0, this.length = 1, this.words[0] = 0, this;
|
|
6663
6673
|
var C, F;
|
|
6664
6674
|
g > 0 ? (C = this, F = n) : (C = n, F = this);
|
|
6665
|
-
for (var
|
|
6666
|
-
d = (C.words[
|
|
6667
|
-
for (;
|
|
6668
|
-
d = (C.words[
|
|
6669
|
-
if (
|
|
6670
|
-
for (;
|
|
6671
|
-
this.words[
|
|
6672
|
-
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();
|
|
6673
6683
|
}, i.prototype.sub = function(n) {
|
|
6674
6684
|
return this.clone().isub(n);
|
|
6675
6685
|
};
|
|
@@ -6677,70 +6687,70 @@ Hf.exports;
|
|
|
6677
6687
|
d.negative = n.negative ^ A.negative;
|
|
6678
6688
|
var g = A.length + n.length | 0;
|
|
6679
6689
|
d.length = g, g = g - 1 | 0;
|
|
6680
|
-
var C = A.words[0] | 0, F = n.words[0] | 0,
|
|
6681
|
-
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;
|
|
6682
6692
|
for (var h = 1; h < g; h++) {
|
|
6683
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++) {
|
|
6684
6694
|
var re = h - W | 0;
|
|
6685
|
-
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;
|
|
6686
6696
|
}
|
|
6687
6697
|
d.words[h] = j | 0, D = E | 0;
|
|
6688
6698
|
}
|
|
6689
6699
|
return D !== 0 ? d.words[h] = D | 0 : d.length--, d.strip();
|
|
6690
6700
|
}
|
|
6691
6701
|
var R = function(n, d, g) {
|
|
6692
|
-
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;
|
|
6693
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);
|
|
6694
|
-
var ne = (
|
|
6695
|
-
|
|
6696
|
-
var fe = (
|
|
6697
|
-
|
|
6698
|
-
var he = (
|
|
6699
|
-
|
|
6700
|
-
var te = (
|
|
6701
|
-
|
|
6702
|
-
var xe = (
|
|
6703
|
-
|
|
6704
|
-
var ue = (
|
|
6705
|
-
|
|
6706
|
-
var ve = (
|
|
6707
|
-
|
|
6708
|
-
var ge = (
|
|
6709
|
-
|
|
6710
|
-
var me = (
|
|
6711
|
-
|
|
6712
|
-
var _e = (
|
|
6713
|
-
|
|
6714
|
-
var pe = (
|
|
6715
|
-
|
|
6716
|
-
var de = (
|
|
6717
|
-
|
|
6718
|
-
var ye = (
|
|
6719
|
-
|
|
6720
|
-
var oe = (
|
|
6721
|
-
|
|
6722
|
-
var le = (
|
|
6723
|
-
|
|
6724
|
-
var be = (
|
|
6725
|
-
|
|
6726
|
-
var se = (
|
|
6727
|
-
|
|
6728
|
-
var Z = (
|
|
6729
|
-
|
|
6730
|
-
var G = (
|
|
6731
|
-
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;
|
|
6732
6742
|
};
|
|
6733
6743
|
Math.imul || (R = w);
|
|
6734
6744
|
function k(A, n, d) {
|
|
6735
6745
|
d.negative = n.negative ^ A.negative, d.length = A.length + n.length;
|
|
6736
6746
|
for (var g = 0, C = 0, F = 0; F < d.length - 1; F++) {
|
|
6737
|
-
var
|
|
6747
|
+
var N = C;
|
|
6738
6748
|
C = 0;
|
|
6739
|
-
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++) {
|
|
6740
6750
|
var E = F - h, j = A.words[E] | 0, Y = n.words[h] | 0, W = j * Y, re = W & 67108863;
|
|
6741
|
-
|
|
6751
|
+
N = N + (W / 67108864 | 0) | 0, re = re + q | 0, q = re & 67108863, N = N + (re >>> 26) | 0, C += N >>> 26, N &= 67108863;
|
|
6742
6752
|
}
|
|
6743
|
-
d.words[F] =
|
|
6753
|
+
d.words[F] = q, g = N, N = C;
|
|
6744
6754
|
}
|
|
6745
6755
|
return g !== 0 ? d.words[F] = g : d.length--, d.strip();
|
|
6746
6756
|
}
|
|
@@ -6760,20 +6770,21 @@ Hf.exports;
|
|
|
6760
6770
|
d[C] = this.revBin(C, g, n);
|
|
6761
6771
|
return d;
|
|
6762
6772
|
}, S.prototype.revBin = function(n, d, g) {
|
|
6763
|
-
if (n === 0 || n === g - 1)
|
|
6773
|
+
if (n === 0 || n === g - 1)
|
|
6774
|
+
return n;
|
|
6764
6775
|
for (var C = 0, F = 0; F < d; F++)
|
|
6765
6776
|
C |= (n & 1) << d - F - 1, n >>= 1;
|
|
6766
6777
|
return C;
|
|
6767
|
-
}, S.prototype.permute = function(n, d, g, C, F,
|
|
6768
|
-
for (var
|
|
6769
|
-
C[
|
|
6770
|
-
}, S.prototype.transform = function(n, d, g, C, F,
|
|
6771
|
-
this.permute(
|
|
6772
|
-
for (var
|
|
6773
|
-
for (var D =
|
|
6774
|
-
for (var Y = h, W = E, re = 0; re <
|
|
6775
|
-
var ce = g[j + re], we = C[j + re], Ae = g[j + re +
|
|
6776
|
-
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);
|
|
6777
6788
|
}
|
|
6778
6789
|
}, S.prototype.guessLen13b = function(n, d) {
|
|
6779
6790
|
var g = Math.max(d, n) | 1, C = g & 1, F = 0;
|
|
@@ -6793,23 +6804,23 @@ Hf.exports;
|
|
|
6793
6804
|
}
|
|
6794
6805
|
return n;
|
|
6795
6806
|
}, S.prototype.convert13b = function(n, d, g, C) {
|
|
6796
|
-
for (var F = 0,
|
|
6797
|
-
F = F + (n[
|
|
6798
|
-
for (
|
|
6799
|
-
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;
|
|
6800
6811
|
r(F === 0), r((F & -8192) === 0);
|
|
6801
6812
|
}, S.prototype.stub = function(n) {
|
|
6802
6813
|
for (var d = new Array(n), g = 0; g < n; g++)
|
|
6803
6814
|
d[g] = 0;
|
|
6804
6815
|
return d;
|
|
6805
6816
|
}, S.prototype.mulp = function(n, d, g) {
|
|
6806
|
-
var C = 2 * this.guessLen13b(n.length, d.length), F = this.makeRBT(C),
|
|
6807
|
-
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);
|
|
6808
6819
|
for (var re = 0; re < C; re++) {
|
|
6809
6820
|
var ce = D[re] * j[re] - h[re] * Y[re];
|
|
6810
6821
|
h[re] = D[re] * Y[re] + h[re] * j[re], D[re] = ce;
|
|
6811
6822
|
}
|
|
6812
|
-
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();
|
|
6813
6824
|
}, i.prototype.mul = function(n) {
|
|
6814
6825
|
var d = new i(null);
|
|
6815
6826
|
return d.words = new Array(this.length + n.length), this.mulTo(n, d);
|
|
@@ -6833,7 +6844,8 @@ Hf.exports;
|
|
|
6833
6844
|
return this.imul(this.clone());
|
|
6834
6845
|
}, i.prototype.pow = function(n) {
|
|
6835
6846
|
var d = B(n);
|
|
6836
|
-
if (d.length === 0)
|
|
6847
|
+
if (d.length === 0)
|
|
6848
|
+
return new i(1);
|
|
6837
6849
|
for (var g = this, C = 0; C < d.length && d[C] === 0; C++, g = g.sqr())
|
|
6838
6850
|
;
|
|
6839
6851
|
if (++C < d.length)
|
|
@@ -6844,12 +6856,12 @@ Hf.exports;
|
|
|
6844
6856
|
r(typeof n == "number" && n >= 0);
|
|
6845
6857
|
var d = n % 26, g = (n - d) / 26, C = 67108863 >>> 26 - d << 26 - d, F;
|
|
6846
6858
|
if (d !== 0) {
|
|
6847
|
-
var
|
|
6859
|
+
var N = 0;
|
|
6848
6860
|
for (F = 0; F < this.length; F++) {
|
|
6849
|
-
var
|
|
6850
|
-
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;
|
|
6851
6863
|
}
|
|
6852
|
-
|
|
6864
|
+
N && (this.words[F] = N, this.length++);
|
|
6853
6865
|
}
|
|
6854
6866
|
if (g !== 0) {
|
|
6855
6867
|
for (F = this.length - 1; F >= 0; F--)
|
|
@@ -6865,21 +6877,22 @@ Hf.exports;
|
|
|
6865
6877
|
r(typeof n == "number" && n >= 0);
|
|
6866
6878
|
var C;
|
|
6867
6879
|
d ? C = (d - d % 26) / 26 : C = 0;
|
|
6868
|
-
var F = n % 26,
|
|
6869
|
-
if (C -=
|
|
6870
|
-
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++)
|
|
6871
6883
|
D.words[h] = this.words[h];
|
|
6872
|
-
D.length =
|
|
6884
|
+
D.length = N;
|
|
6873
6885
|
}
|
|
6874
|
-
if (
|
|
6875
|
-
|
|
6876
|
-
this.
|
|
6877
|
-
|
|
6878
|
-
|
|
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
|
+
else
|
|
6891
|
+
this.words[0] = 0, this.length = 1;
|
|
6879
6892
|
var E = 0;
|
|
6880
6893
|
for (h = this.length - 1; h >= 0 && (E !== 0 || h >= C); h--) {
|
|
6881
6894
|
var j = this.words[h] | 0;
|
|
6882
|
-
this.words[h] = E << 26 - F | j >>> F, E = j &
|
|
6895
|
+
this.words[h] = E << 26 - F | j >>> F, E = j & q;
|
|
6883
6896
|
}
|
|
6884
6897
|
return D && E !== 0 && (D.words[D.length++] = E), this.length === 0 && (this.words[0] = 0, this.length = 1), this.strip();
|
|
6885
6898
|
}, i.prototype.ishrn = function(n, d, g) {
|
|
@@ -6895,7 +6908,8 @@ Hf.exports;
|
|
|
6895
6908
|
}, i.prototype.testn = function(n) {
|
|
6896
6909
|
r(typeof n == "number" && n >= 0);
|
|
6897
6910
|
var d = n % 26, g = (n - d) / 26, C = 1 << d;
|
|
6898
|
-
if (this.length <= g)
|
|
6911
|
+
if (this.length <= g)
|
|
6912
|
+
return !1;
|
|
6899
6913
|
var F = this.words[g];
|
|
6900
6914
|
return !!(F & C);
|
|
6901
6915
|
}, i.prototype.imaskn = function(n) {
|
|
@@ -6918,7 +6932,8 @@ Hf.exports;
|
|
|
6918
6932
|
this.words[d] -= 67108864, d === this.length - 1 ? this.words[d + 1] = 1 : this.words[d + 1]++;
|
|
6919
6933
|
return this.length = Math.max(this.length, d + 1), this;
|
|
6920
6934
|
}, i.prototype.isubn = function(n) {
|
|
6921
|
-
if (r(typeof n == "number"), r(n < 67108864), n < 0)
|
|
6935
|
+
if (r(typeof n == "number"), r(n < 67108864), n < 0)
|
|
6936
|
+
return this.iaddn(-n);
|
|
6922
6937
|
if (this.negative !== 0)
|
|
6923
6938
|
return this.negative = 0, this.iaddn(n), this.negative = 1, this;
|
|
6924
6939
|
if (this.words[0] -= n, this.length === 1 && this.words[0] < 0)
|
|
@@ -6938,21 +6953,22 @@ Hf.exports;
|
|
|
6938
6953
|
}, i.prototype._ishlnsubmul = function(n, d, g) {
|
|
6939
6954
|
var C = n.length + g, F;
|
|
6940
6955
|
this._expand(C);
|
|
6941
|
-
var
|
|
6956
|
+
var N, q = 0;
|
|
6942
6957
|
for (F = 0; F < n.length; F++) {
|
|
6943
|
-
|
|
6958
|
+
N = (this.words[F + g] | 0) + q;
|
|
6944
6959
|
var D = (n.words[F] | 0) * d;
|
|
6945
|
-
|
|
6960
|
+
N -= D & 67108863, q = (N >> 26) - (D / 67108864 | 0), this.words[F + g] = N & 67108863;
|
|
6946
6961
|
}
|
|
6947
6962
|
for (; F < this.length - g; F++)
|
|
6948
|
-
|
|
6949
|
-
if (
|
|
6950
|
-
|
|
6951
|
-
|
|
6963
|
+
N = (this.words[F + g] | 0) + q, q = N >> 26, this.words[F + g] = N & 67108863;
|
|
6964
|
+
if (q === 0)
|
|
6965
|
+
return this.strip();
|
|
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;
|
|
6952
6968
|
return this.negative = 1, this.strip();
|
|
6953
6969
|
}, i.prototype._wordDiv = function(n, d) {
|
|
6954
|
-
var g = this.length - n.length, C = this.clone(), F = n,
|
|
6955
|
-
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);
|
|
6956
6972
|
var D = C.length - F.length, h;
|
|
6957
6973
|
if (d !== "mod") {
|
|
6958
6974
|
h = new i(null), h.length = D + 1, h.words = new Array(h.length);
|
|
@@ -6963,7 +6979,7 @@ Hf.exports;
|
|
|
6963
6979
|
j.negative === 0 && (C = j, h && (h.words[D] = 1));
|
|
6964
6980
|
for (var Y = D - 1; Y >= 0; Y--) {
|
|
6965
6981
|
var W = (C.words[F.length + Y] | 0) * 67108864 + (C.words[F.length + Y - 1] | 0);
|
|
6966
|
-
for (W = Math.min(W /
|
|
6982
|
+
for (W = Math.min(W / N | 0, 67108863), C._ishlnsubmul(F, W, Y); C.negative !== 0; )
|
|
6967
6983
|
W--, C.negative = 0, C._ishlnsubmul(F, 1, Y), C.isZero() || (C.negative ^= 1);
|
|
6968
6984
|
h && (h.words[Y] = W);
|
|
6969
6985
|
}
|
|
@@ -6977,15 +6993,15 @@ Hf.exports;
|
|
|
6977
6993
|
div: new i(0),
|
|
6978
6994
|
mod: new i(0)
|
|
6979
6995
|
};
|
|
6980
|
-
var C, F,
|
|
6981
|
-
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)), {
|
|
6982
6998
|
div: C,
|
|
6983
6999
|
mod: F
|
|
6984
|
-
}) : 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()), {
|
|
6985
7001
|
div: C,
|
|
6986
|
-
mod:
|
|
6987
|
-
}) : this.negative & n.negative ? (
|
|
6988
|
-
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,
|
|
6989
7005
|
mod: F
|
|
6990
7006
|
}) : n.length > this.length || this.cmp(n) < 0 ? {
|
|
6991
7007
|
div: new i(0),
|
|
@@ -7008,9 +7024,10 @@ Hf.exports;
|
|
|
7008
7024
|
return this.divmod(n, "mod", !0).mod;
|
|
7009
7025
|
}, i.prototype.divRound = function(n) {
|
|
7010
7026
|
var d = this.divmod(n);
|
|
7011
|
-
if (d.mod.isZero())
|
|
7012
|
-
|
|
7013
|
-
|
|
7027
|
+
if (d.mod.isZero())
|
|
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), 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);
|
|
7014
7031
|
}, i.prototype.modn = function(n) {
|
|
7015
7032
|
r(n <= 67108863);
|
|
7016
7033
|
for (var d = (1 << 26) % n, g = 0, C = this.length - 1; C >= 0; C--)
|
|
@@ -7029,44 +7046,50 @@ Hf.exports;
|
|
|
7029
7046
|
r(n.negative === 0), r(!n.isZero());
|
|
7030
7047
|
var d = this, g = n.clone();
|
|
7031
7048
|
d.negative !== 0 ? d = d.umod(n) : d = d.clone();
|
|
7032
|
-
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(); )
|
|
7033
7050
|
d.iushrn(1), g.iushrn(1), ++D;
|
|
7034
7051
|
for (var h = g.clone(), E = d.clone(); !d.isZero(); ) {
|
|
7035
|
-
for (var j = 0, Y = 1; !(d.words[0] & Y) && j < 26; ++j, Y <<= 1)
|
|
7052
|
+
for (var j = 0, Y = 1; !(d.words[0] & Y) && j < 26; ++j, Y <<= 1)
|
|
7053
|
+
;
|
|
7036
7054
|
if (j > 0)
|
|
7037
7055
|
for (d.iushrn(j); j-- > 0; )
|
|
7038
7056
|
(C.isOdd() || F.isOdd()) && (C.iadd(h), F.isub(E)), C.iushrn(1), F.iushrn(1);
|
|
7039
|
-
for (var W = 0, re = 1; !(g.words[0] & re) && W < 26; ++W, re <<= 1)
|
|
7057
|
+
for (var W = 0, re = 1; !(g.words[0] & re) && W < 26; ++W, re <<= 1)
|
|
7058
|
+
;
|
|
7040
7059
|
if (W > 0)
|
|
7041
7060
|
for (g.iushrn(W); W-- > 0; )
|
|
7042
|
-
(
|
|
7043
|
-
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));
|
|
7044
7063
|
}
|
|
7045
7064
|
return {
|
|
7046
|
-
a:
|
|
7047
|
-
b:
|
|
7065
|
+
a: N,
|
|
7066
|
+
b: q,
|
|
7048
7067
|
gcd: g.iushln(D)
|
|
7049
7068
|
};
|
|
7050
7069
|
}, i.prototype._invmp = function(n) {
|
|
7051
7070
|
r(n.negative === 0), r(!n.isZero());
|
|
7052
7071
|
var d = this, g = n.clone();
|
|
7053
7072
|
d.negative !== 0 ? d = d.umod(n) : d = d.clone();
|
|
7054
|
-
for (var C = new i(1), F = new i(0),
|
|
7055
|
-
for (var
|
|
7056
|
-
|
|
7057
|
-
|
|
7058
|
-
|
|
7059
|
-
|
|
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
|
+
;
|
|
7076
|
+
if (q > 0)
|
|
7077
|
+
for (d.iushrn(q); q-- > 0; )
|
|
7078
|
+
C.isOdd() && C.iadd(N), C.iushrn(1);
|
|
7079
|
+
for (var h = 0, E = 1; !(g.words[0] & E) && h < 26; ++h, E <<= 1)
|
|
7080
|
+
;
|
|
7060
7081
|
if (h > 0)
|
|
7061
7082
|
for (g.iushrn(h); h-- > 0; )
|
|
7062
|
-
F.isOdd() && F.iadd(
|
|
7083
|
+
F.isOdd() && F.iadd(N), F.iushrn(1);
|
|
7063
7084
|
d.cmp(g) >= 0 ? (d.isub(g), C.isub(F)) : (g.isub(d), F.isub(C));
|
|
7064
7085
|
}
|
|
7065
7086
|
var j;
|
|
7066
7087
|
return d.cmpn(1) === 0 ? j = C : j = F, j.cmpn(0) < 0 && j.iadd(n), j;
|
|
7067
7088
|
}, i.prototype.gcd = function(n) {
|
|
7068
|
-
if (this.isZero())
|
|
7069
|
-
|
|
7089
|
+
if (this.isZero())
|
|
7090
|
+
return n.abs();
|
|
7091
|
+
if (n.isZero())
|
|
7092
|
+
return this.abs();
|
|
7070
7093
|
var d = this.clone(), g = n.clone();
|
|
7071
7094
|
d.negative = 0, g.negative = 0;
|
|
7072
7095
|
for (var C = 0; d.isEven() && g.isEven(); C++)
|
|
@@ -7078,8 +7101,8 @@ Hf.exports;
|
|
|
7078
7101
|
g.iushrn(1);
|
|
7079
7102
|
var F = d.cmp(g);
|
|
7080
7103
|
if (F < 0) {
|
|
7081
|
-
var
|
|
7082
|
-
d = g, g =
|
|
7104
|
+
var N = d;
|
|
7105
|
+
d = g, g = N;
|
|
7083
7106
|
} else if (F === 0 || g.cmpn(1) === 0)
|
|
7084
7107
|
break;
|
|
7085
7108
|
d.isub(g);
|
|
@@ -7098,17 +7121,19 @@ Hf.exports;
|
|
|
7098
7121
|
var d = n % 26, g = (n - d) / 26, C = 1 << d;
|
|
7099
7122
|
if (this.length <= g)
|
|
7100
7123
|
return this._expand(g + 1), this.words[g] |= C, this;
|
|
7101
|
-
for (var F = C,
|
|
7102
|
-
var
|
|
7103
|
-
|
|
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;
|
|
7104
7127
|
}
|
|
7105
|
-
return F !== 0 && (this.words[
|
|
7128
|
+
return F !== 0 && (this.words[N] = F, this.length++), this;
|
|
7106
7129
|
}, i.prototype.isZero = function() {
|
|
7107
7130
|
return this.length === 1 && this.words[0] === 0;
|
|
7108
7131
|
}, i.prototype.cmpn = function(n) {
|
|
7109
7132
|
var d = n < 0;
|
|
7110
|
-
if (this.negative !== 0 && !d)
|
|
7111
|
-
|
|
7133
|
+
if (this.negative !== 0 && !d)
|
|
7134
|
+
return -1;
|
|
7135
|
+
if (this.negative === 0 && d)
|
|
7136
|
+
return 1;
|
|
7112
7137
|
this.strip();
|
|
7113
7138
|
var g;
|
|
7114
7139
|
if (this.length > 1)
|
|
@@ -7120,13 +7145,17 @@ Hf.exports;
|
|
|
7120
7145
|
}
|
|
7121
7146
|
return this.negative !== 0 ? -g | 0 : g;
|
|
7122
7147
|
}, i.prototype.cmp = function(n) {
|
|
7123
|
-
if (this.negative !== 0 && n.negative === 0)
|
|
7124
|
-
|
|
7148
|
+
if (this.negative !== 0 && n.negative === 0)
|
|
7149
|
+
return -1;
|
|
7150
|
+
if (this.negative === 0 && n.negative !== 0)
|
|
7151
|
+
return 1;
|
|
7125
7152
|
var d = this.ucmp(n);
|
|
7126
7153
|
return this.negative !== 0 ? -d | 0 : d;
|
|
7127
7154
|
}, i.prototype.ucmp = function(n) {
|
|
7128
|
-
if (this.length > n.length)
|
|
7129
|
-
|
|
7155
|
+
if (this.length > n.length)
|
|
7156
|
+
return 1;
|
|
7157
|
+
if (this.length < n.length)
|
|
7158
|
+
return -1;
|
|
7130
7159
|
for (var d = 0, g = this.length - 1; g >= 0; g--) {
|
|
7131
7160
|
var C = this.words[g] | 0, F = n.words[g] | 0;
|
|
7132
7161
|
if (C !== F) {
|
|
@@ -7230,12 +7259,12 @@ Hf.exports;
|
|
|
7230
7259
|
n.words[0] = 0, n.length = 1;
|
|
7231
7260
|
return;
|
|
7232
7261
|
}
|
|
7233
|
-
var
|
|
7234
|
-
for (d.words[d.length++] =
|
|
7235
|
-
var
|
|
7236
|
-
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;
|
|
7237
7266
|
}
|
|
7238
|
-
|
|
7267
|
+
N >>>= 22, n.words[F - 10] = N, N === 0 && n.length > 10 ? n.length -= 10 : n.length -= 9;
|
|
7239
7268
|
}, H.prototype.imulK = function(n) {
|
|
7240
7269
|
n.words[n.length] = 0, n.words[n.length + 1] = 0, n.length += 2;
|
|
7241
7270
|
for (var d = 0, g = 0; g < n.length; g++) {
|
|
@@ -7274,7 +7303,8 @@ Hf.exports;
|
|
|
7274
7303
|
}
|
|
7275
7304
|
return d !== 0 && (n.words[n.length++] = d), n;
|
|
7276
7305
|
}, i._prime = function(n) {
|
|
7277
|
-
if (P[n])
|
|
7306
|
+
if (P[n])
|
|
7307
|
+
return P[n];
|
|
7278
7308
|
var d;
|
|
7279
7309
|
if (n === "k256")
|
|
7280
7310
|
d = new H();
|
|
@@ -7333,7 +7363,8 @@ Hf.exports;
|
|
|
7333
7363
|
}, Q.prototype.sqr = function(n) {
|
|
7334
7364
|
return this.mul(n, n);
|
|
7335
7365
|
}, Q.prototype.sqrt = function(n) {
|
|
7336
|
-
if (n.isZero())
|
|
7366
|
+
if (n.isZero())
|
|
7367
|
+
return n.clone();
|
|
7337
7368
|
var d = this.m.andln(3);
|
|
7338
7369
|
if (r(d % 2 === 1), d === 3) {
|
|
7339
7370
|
var g = this.m.add(new i(1)).iushrn(2);
|
|
@@ -7342,11 +7373,11 @@ Hf.exports;
|
|
|
7342
7373
|
for (var C = this.m.subn(1), F = 0; !C.isZero() && C.andln(1) === 0; )
|
|
7343
7374
|
F++, C.iushrn(1);
|
|
7344
7375
|
r(!C.isZero());
|
|
7345
|
-
var
|
|
7346
|
-
for (h = new i(2 * h * h).toRed(this); this.pow(h, D).cmp(
|
|
7347
|
-
h.redIAdd(
|
|
7348
|
-
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(
|
|
7349
|
-
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++)
|
|
7350
7381
|
re = re.redSqr();
|
|
7351
7382
|
r(ce < W);
|
|
7352
7383
|
var we = this.pow(E, new i(1).iushln(W - ce - 1));
|
|
@@ -7357,25 +7388,27 @@ Hf.exports;
|
|
|
7357
7388
|
var d = n._invmp(this.m);
|
|
7358
7389
|
return d.negative !== 0 ? (d.negative = 0, this.imod(d).redNeg()) : this.imod(d);
|
|
7359
7390
|
}, Q.prototype.pow = function(n, d) {
|
|
7360
|
-
if (d.isZero())
|
|
7361
|
-
|
|
7391
|
+
if (d.isZero())
|
|
7392
|
+
return new i(1).toRed(this);
|
|
7393
|
+
if (d.cmpn(1) === 0)
|
|
7394
|
+
return n.clone();
|
|
7362
7395
|
var g = 4, C = new Array(1 << g);
|
|
7363
7396
|
C[0] = new i(1).toRed(this), C[1] = n;
|
|
7364
7397
|
for (var F = 2; F < C.length; F++)
|
|
7365
7398
|
C[F] = this.mul(C[F - 1], n);
|
|
7366
|
-
var
|
|
7399
|
+
var N = C[0], q = 0, D = 0, h = d.bitLength() % 26;
|
|
7367
7400
|
for (h === 0 && (h = 26), F = d.length - 1; F >= 0; F--) {
|
|
7368
7401
|
for (var E = d.words[F], j = h - 1; j >= 0; j--) {
|
|
7369
7402
|
var Y = E >> j & 1;
|
|
7370
|
-
if (
|
|
7403
|
+
if (N !== C[0] && (N = this.sqr(N)), Y === 0 && q === 0) {
|
|
7371
7404
|
D = 0;
|
|
7372
7405
|
continue;
|
|
7373
7406
|
}
|
|
7374
|
-
|
|
7407
|
+
q <<= 1, q |= Y, D++, !(D !== g && (F !== 0 || j !== 0)) && (N = this.mul(N, C[q]), D = 0, q = 0);
|
|
7375
7408
|
}
|
|
7376
7409
|
h = 26;
|
|
7377
7410
|
}
|
|
7378
|
-
return
|
|
7411
|
+
return N;
|
|
7379
7412
|
}, Q.prototype.convertTo = function(n) {
|
|
7380
7413
|
var d = n.umod(this.m);
|
|
7381
7414
|
return d === n ? d.clone() : d;
|
|
@@ -7396,12 +7429,13 @@ Hf.exports;
|
|
|
7396
7429
|
}, U.prototype.imul = function(n, d) {
|
|
7397
7430
|
if (n.isZero() || d.isZero())
|
|
7398
7431
|
return n.words[0] = 0, n.length = 1, n;
|
|
7399
|
-
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),
|
|
7400
|
-
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);
|
|
7401
7434
|
}, U.prototype.mul = function(n, d) {
|
|
7402
|
-
if (n.isZero() || d.isZero())
|
|
7403
|
-
|
|
7404
|
-
|
|
7435
|
+
if (n.isZero() || d.isZero())
|
|
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), 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);
|
|
7405
7439
|
}, U.prototype.invm = function(n) {
|
|
7406
7440
|
var d = this.imod(n._invmp(this.m).mul(this.r2));
|
|
7407
7441
|
return d._forceRed(this);
|
|
@@ -8366,10 +8400,11 @@ function Ss(f, e) {
|
|
|
8366
8400
|
if (e === "hex")
|
|
8367
8401
|
for (f = f.replace(/[^a-z0-9]+/ig, ""), f.length % 2 !== 0 && (f = "0" + f), a = 0; a < f.length; a += 2)
|
|
8368
8402
|
t.push(parseInt(f[a] + f[a + 1], 16));
|
|
8369
|
-
} else
|
|
8370
|
-
var
|
|
8371
|
-
|
|
8372
|
-
|
|
8403
|
+
} else
|
|
8404
|
+
for (var r = 0, a = 0; a < f.length; a++) {
|
|
8405
|
+
var i = f.charCodeAt(a);
|
|
8406
|
+
i < 128 ? t[r++] = i : i < 2048 ? (t[r++] = i >> 6 | 192, t[r++] = i & 63 | 128) : Fs(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
|
+
}
|
|
8373
8408
|
else
|
|
8374
8409
|
for (a = 0; a < f.length; a++)
|
|
8375
8410
|
t[a] = f[a] | 0;
|
|
@@ -8437,14 +8472,14 @@ function zs(f, e, t) {
|
|
|
8437
8472
|
return f + e + t >>> 0;
|
|
8438
8473
|
}
|
|
8439
8474
|
Le.sum32_3 = zs;
|
|
8440
|
-
function
|
|
8475
|
+
function Ns(f, e, t, r) {
|
|
8441
8476
|
return f + e + t + r >>> 0;
|
|
8442
8477
|
}
|
|
8443
|
-
Le.sum32_4 =
|
|
8444
|
-
function
|
|
8478
|
+
Le.sum32_4 = Ns;
|
|
8479
|
+
function qs(f, e, t, r, a) {
|
|
8445
8480
|
return f + e + t + r + a >>> 0;
|
|
8446
8481
|
}
|
|
8447
|
-
Le.sum32_5 =
|
|
8482
|
+
Le.sum32_5 = qs;
|
|
8448
8483
|
function Ls(f, e, t, r) {
|
|
8449
8484
|
var a = f[e], i = f[e + 1], y = r + i >>> 0, x = (y < r ? 1 : 0) + t + a;
|
|
8450
8485
|
f[e] = x >>> 0, f[e + 1] = y;
|
|
@@ -8573,7 +8608,7 @@ function fo(f) {
|
|
|
8573
8608
|
return rt(f, 17) ^ rt(f, 19) ^ f >>> 10;
|
|
8574
8609
|
}
|
|
8575
8610
|
ht.g1_256 = fo;
|
|
8576
|
-
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 = [
|
|
8577
8612
|
1518500249,
|
|
8578
8613
|
1859775393,
|
|
8579
8614
|
2400959708,
|
|
@@ -8590,7 +8625,7 @@ function at() {
|
|
|
8590
8625
|
3285377520
|
|
8591
8626
|
], this.W = new Array(80);
|
|
8592
8627
|
}
|
|
8593
|
-
|
|
8628
|
+
Nt.inherits(at, Sn);
|
|
8594
8629
|
var co = at;
|
|
8595
8630
|
at.blockSize = 512;
|
|
8596
8631
|
at.outSize = 160;
|
|
@@ -8609,9 +8644,9 @@ at.prototype._update = function(e, t) {
|
|
|
8609
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);
|
|
8610
8645
|
};
|
|
8611
8646
|
at.prototype._digest = function(e) {
|
|
8612
|
-
return e === "hex" ?
|
|
8647
|
+
return e === "hex" ? Nt.toHex32(this.h, "big") : Nt.split32(this.h, "big");
|
|
8613
8648
|
};
|
|
8614
|
-
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 = [
|
|
8615
8650
|
1116352408,
|
|
8616
8651
|
1899447441,
|
|
8617
8652
|
3049323471,
|
|
@@ -8691,7 +8726,7 @@ function st() {
|
|
|
8691
8726
|
1541459225
|
|
8692
8727
|
], this.k = _o, this.W = new Array(64);
|
|
8693
8728
|
}
|
|
8694
|
-
|
|
8729
|
+
qt.inherits(st, Dn);
|
|
8695
8730
|
var Rn = st;
|
|
8696
8731
|
st.blockSize = 512;
|
|
8697
8732
|
st.outSize = 256;
|
|
@@ -8710,7 +8745,7 @@ st.prototype._update = function(e, t) {
|
|
|
8710
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);
|
|
8711
8746
|
};
|
|
8712
8747
|
st.prototype._digest = function(e) {
|
|
8713
|
-
return e === "hex" ?
|
|
8748
|
+
return e === "hex" ? qt.toHex32(this.h, "big") : qt.split32(this.h, "big");
|
|
8714
8749
|
};
|
|
8715
8750
|
var Ff = Le, kn = Rn;
|
|
8716
8751
|
function vt() {
|
|
@@ -8930,7 +8965,7 @@ et.prototype._prepareBlock = function(e, t) {
|
|
|
8930
8965
|
for (var r = this.W, a = 0; a < 32; a++)
|
|
8931
8966
|
r[a] = e[t + a];
|
|
8932
8967
|
for (; a < r.length; a += 2) {
|
|
8933
|
-
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];
|
|
8934
8969
|
r[a] = Bo(
|
|
8935
8970
|
i,
|
|
8936
8971
|
y,
|
|
@@ -8981,8 +9016,8 @@ et.prototype._update = function(e, t) {
|
|
|
8981
9016
|
g
|
|
8982
9017
|
);
|
|
8983
9018
|
H = Io(a, i), $ = To(a, i), K = ko(a, i, y, x, u), X = Po(a, i, y, x, u, o);
|
|
8984
|
-
var
|
|
8985
|
-
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);
|
|
8986
9021
|
}
|
|
8987
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);
|
|
8988
9023
|
};
|
|
@@ -9021,11 +9056,11 @@ function zo(f, e) {
|
|
|
9021
9056
|
var t = it(f, e, 14), r = it(f, e, 18), a = it(e, f, 9), i = t ^ r ^ a;
|
|
9022
9057
|
return i < 0 && (i += 4294967296), i;
|
|
9023
9058
|
}
|
|
9024
|
-
function
|
|
9059
|
+
function No(f, e) {
|
|
9025
9060
|
var t = ft(f, e, 1), r = ft(f, e, 8), a = Pn(f, e, 7), i = t ^ r ^ a;
|
|
9026
9061
|
return i < 0 && (i += 4294967296), i;
|
|
9027
9062
|
}
|
|
9028
|
-
function
|
|
9063
|
+
function qo(f, e) {
|
|
9029
9064
|
var t = it(f, e, 1), r = it(f, e, 8), a = In(f, e, 7), i = t ^ r ^ a;
|
|
9030
9065
|
return i < 0 && (i += 4294967296), i;
|
|
9031
9066
|
}
|
|
@@ -9074,14 +9109,14 @@ Yt.sha224 = Ao;
|
|
|
9074
9109
|
Yt.sha256 = Rn;
|
|
9075
9110
|
Yt.sha384 = Uo;
|
|
9076
9111
|
Yt.sha512 = On;
|
|
9077
|
-
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;
|
|
9078
9113
|
function ot() {
|
|
9079
9114
|
if (!(this instanceof ot))
|
|
9080
9115
|
return new ot();
|
|
9081
|
-
|
|
9116
|
+
qn.call(this), this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], this.endian = "little";
|
|
9082
9117
|
}
|
|
9083
|
-
Dt.inherits(ot,
|
|
9084
|
-
|
|
9118
|
+
Dt.inherits(ot, qn);
|
|
9119
|
+
Nn.ripemd160 = ot;
|
|
9085
9120
|
ot.blockSize = 512;
|
|
9086
9121
|
ot.outSize = 160;
|
|
9087
9122
|
ot.hmacStrength = 192;
|
|
@@ -9466,7 +9501,7 @@ Lt.prototype.digest = function(e) {
|
|
|
9466
9501
|
};
|
|
9467
9502
|
(function(f) {
|
|
9468
9503
|
var e = f;
|
|
9469
|
-
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;
|
|
9470
9505
|
})(Mr);
|
|
9471
9506
|
var mf, Yi;
|
|
9472
9507
|
function Jo() {
|
|
@@ -10788,7 +10823,9 @@ var Kn = { exports: {} };
|
|
|
10788
10823
|
(function(e) {
|
|
10789
10824
|
var t = function(l) {
|
|
10790
10825
|
var _, m = new Float64Array(16);
|
|
10791
|
-
if (l)
|
|
10826
|
+
if (l)
|
|
10827
|
+
for (_ = 0; _ < l.length; _++)
|
|
10828
|
+
m[_] = l[_];
|
|
10792
10829
|
return m;
|
|
10793
10830
|
}, r = function() {
|
|
10794
10831
|
throw new Error("no PRNG");
|
|
@@ -10800,7 +10837,8 @@ var Kn = { exports: {} };
|
|
|
10800
10837
|
}
|
|
10801
10838
|
function R(l, _, m, s, M) {
|
|
10802
10839
|
var p, I = 0;
|
|
10803
|
-
for (p = 0; p < M; p++)
|
|
10840
|
+
for (p = 0; p < M; p++)
|
|
10841
|
+
I |= l[_ + p] ^ m[s + p];
|
|
10804
10842
|
return (1 & I - 1 >>> 8) - 1;
|
|
10805
10843
|
}
|
|
10806
10844
|
function k(l, _, m, s) {
|
|
@@ -10828,42 +10866,52 @@ var Kn = { exports: {} };
|
|
|
10828
10866
|
var $ = new Uint8Array([101, 120, 112, 97, 110, 100, 32, 51, 50, 45, 98, 121, 116, 101, 32, 107]);
|
|
10829
10867
|
function K(l, _, m, s, M, p, I) {
|
|
10830
10868
|
var L = new Uint8Array(16), V = new Uint8Array(64), ne, fe;
|
|
10831
|
-
for (fe = 0; fe < 16; fe++)
|
|
10832
|
-
|
|
10869
|
+
for (fe = 0; fe < 16; fe++)
|
|
10870
|
+
L[fe] = 0;
|
|
10871
|
+
for (fe = 0; fe < 8; fe++)
|
|
10872
|
+
L[fe] = p[fe];
|
|
10833
10873
|
for (; M >= 64; ) {
|
|
10834
|
-
for (T(V, L, I, $), fe = 0; fe < 64; fe++)
|
|
10874
|
+
for (T(V, L, I, $), fe = 0; fe < 64; fe++)
|
|
10875
|
+
l[_ + fe] = m[s + fe] ^ V[fe];
|
|
10835
10876
|
for (ne = 1, fe = 8; fe < 16; fe++)
|
|
10836
10877
|
ne = ne + (L[fe] & 255) | 0, L[fe] = ne & 255, ne >>>= 8;
|
|
10837
10878
|
M -= 64, _ += 64, s += 64;
|
|
10838
10879
|
}
|
|
10839
10880
|
if (M > 0)
|
|
10840
|
-
for (T(V, L, I, $), fe = 0; fe < M; fe++)
|
|
10881
|
+
for (T(V, L, I, $), fe = 0; fe < M; fe++)
|
|
10882
|
+
l[_ + fe] = m[s + fe] ^ V[fe];
|
|
10841
10883
|
return 0;
|
|
10842
10884
|
}
|
|
10843
10885
|
function X(l, _, m, s, M) {
|
|
10844
10886
|
var p = new Uint8Array(16), I = new Uint8Array(64), L, V;
|
|
10845
|
-
for (V = 0; V < 16; V++)
|
|
10846
|
-
|
|
10887
|
+
for (V = 0; V < 16; V++)
|
|
10888
|
+
p[V] = 0;
|
|
10889
|
+
for (V = 0; V < 8; V++)
|
|
10890
|
+
p[V] = s[V];
|
|
10847
10891
|
for (; m >= 64; ) {
|
|
10848
|
-
for (T(I, p, M, $), V = 0; V < 64; V++)
|
|
10892
|
+
for (T(I, p, M, $), V = 0; V < 64; V++)
|
|
10893
|
+
l[_ + V] = I[V];
|
|
10849
10894
|
for (L = 1, V = 8; V < 16; V++)
|
|
10850
10895
|
L = L + (p[V] & 255) | 0, p[V] = L & 255, L >>>= 8;
|
|
10851
10896
|
m -= 64, _ += 64;
|
|
10852
10897
|
}
|
|
10853
10898
|
if (m > 0)
|
|
10854
|
-
for (T(I, p, M, $), V = 0; V < m; V++)
|
|
10899
|
+
for (T(I, p, M, $), V = 0; V < m; V++)
|
|
10900
|
+
l[_ + V] = I[V];
|
|
10855
10901
|
return 0;
|
|
10856
10902
|
}
|
|
10857
10903
|
function Q(l, _, m, s, M) {
|
|
10858
10904
|
var p = new Uint8Array(32);
|
|
10859
10905
|
H(p, s, M, $);
|
|
10860
|
-
for (var I = new Uint8Array(8), L = 0; L < 8; L++)
|
|
10906
|
+
for (var I = new Uint8Array(8), L = 0; L < 8; L++)
|
|
10907
|
+
I[L] = s[L + 16];
|
|
10861
10908
|
return X(l, _, m, I, p);
|
|
10862
10909
|
}
|
|
10863
10910
|
function U(l, _, m, s, M, p, I) {
|
|
10864
10911
|
var L = new Uint8Array(32);
|
|
10865
10912
|
H(L, p, I, $);
|
|
10866
|
-
for (var V = new Uint8Array(8), ne = 0; ne < 8; ne++)
|
|
10913
|
+
for (var V = new Uint8Array(8), ne = 0; ne < 8; ne++)
|
|
10914
|
+
V[ne] = p[ne + 16];
|
|
10867
10915
|
return K(l, _, m, s, M, V, L);
|
|
10868
10916
|
}
|
|
10869
10917
|
var A = function(l) {
|
|
@@ -10878,15 +10926,18 @@ var Kn = { exports: {} };
|
|
|
10878
10926
|
}, A.prototype.finish = function(l, _) {
|
|
10879
10927
|
var m = new Uint16Array(10), s, M, p, I;
|
|
10880
10928
|
if (this.leftover) {
|
|
10881
|
-
for (I = this.leftover, this.buffer[I++] = 1; I < 16; I++)
|
|
10929
|
+
for (I = this.leftover, this.buffer[I++] = 1; I < 16; I++)
|
|
10930
|
+
this.buffer[I] = 0;
|
|
10882
10931
|
this.fin = 1, this.blocks(this.buffer, 0, 16);
|
|
10883
10932
|
}
|
|
10884
10933
|
for (s = this.h[1] >>> 13, this.h[1] &= 8191, I = 2; I < 10; I++)
|
|
10885
10934
|
this.h[I] += s, s = this.h[I] >>> 13, this.h[I] &= 8191;
|
|
10886
10935
|
for (this.h[0] += s * 5, s = this.h[0] >>> 13, this.h[0] &= 8191, this.h[1] += s, s = this.h[1] >>> 13, this.h[1] &= 8191, this.h[2] += s, m[0] = this.h[0] + 5, s = m[0] >>> 13, m[0] &= 8191, I = 1; I < 10; I++)
|
|
10887
10936
|
m[I] = this.h[I] + s, s = m[I] >>> 13, m[I] &= 8191;
|
|
10888
|
-
for (m[9] -= 8192, M = (s ^ 1) - 1, I = 0; I < 10; I++)
|
|
10889
|
-
|
|
10937
|
+
for (m[9] -= 8192, M = (s ^ 1) - 1, I = 0; I < 10; I++)
|
|
10938
|
+
m[I] &= M;
|
|
10939
|
+
for (M = ~M, I = 0; I < 10; I++)
|
|
10940
|
+
this.h[I] = this.h[I] & M | m[I];
|
|
10890
10941
|
for (this.h[0] = (this.h[0] | this.h[1] << 13) & 65535, this.h[1] = (this.h[1] >>> 3 | this.h[2] << 10) & 65535, this.h[2] = (this.h[2] >>> 6 | this.h[3] << 7) & 65535, this.h[3] = (this.h[3] >>> 9 | this.h[4] << 4) & 65535, this.h[4] = (this.h[4] >>> 12 | this.h[5] << 1 | this.h[6] << 14) & 65535, this.h[5] = (this.h[6] >>> 2 | this.h[7] << 11) & 65535, this.h[6] = (this.h[7] >>> 5 | this.h[8] << 8) & 65535, this.h[7] = (this.h[8] >>> 8 | this.h[9] << 5) & 65535, p = this.h[0] + this.pad[0], this.h[0] = p & 65535, I = 1; I < 8; I++)
|
|
10891
10942
|
p = (this.h[I] + this.pad[I] | 0) + (p >>> 16) | 0, this.h[I] = p & 65535;
|
|
10892
10943
|
l[_ + 0] = this.h[0] >>> 0 & 255, l[_ + 1] = this.h[0] >>> 8 & 255, l[_ + 2] = this.h[1] >>> 0 & 255, l[_ + 3] = this.h[1] >>> 8 & 255, l[_ + 4] = this.h[2] >>> 0 & 255, l[_ + 5] = this.h[2] >>> 8 & 255, l[_ + 6] = this.h[3] >>> 0 & 255, l[_ + 7] = this.h[3] >>> 8 & 255, l[_ + 8] = this.h[4] >>> 0 & 255, l[_ + 9] = this.h[4] >>> 8 & 255, l[_ + 10] = this.h[5] >>> 0 & 255, l[_ + 11] = this.h[5] >>> 8 & 255, l[_ + 12] = this.h[6] >>> 0 & 255, l[_ + 13] = this.h[6] >>> 8 & 255, l[_ + 14] = this.h[7] >>> 0 & 255, l[_ + 15] = this.h[7] >>> 8 & 255;
|
|
@@ -10915,37 +10966,43 @@ var Kn = { exports: {} };
|
|
|
10915
10966
|
}
|
|
10916
10967
|
function g(l, _, m, s, M) {
|
|
10917
10968
|
var p;
|
|
10918
|
-
if (m < 32)
|
|
10919
|
-
|
|
10969
|
+
if (m < 32)
|
|
10970
|
+
return -1;
|
|
10971
|
+
for (U(l, 0, _, 0, m, s, M), n(l, 16, l, 32, m - 32, l), p = 0; p < 16; p++)
|
|
10972
|
+
l[p] = 0;
|
|
10920
10973
|
return 0;
|
|
10921
10974
|
}
|
|
10922
10975
|
function C(l, _, m, s, M) {
|
|
10923
10976
|
var p, I = new Uint8Array(32);
|
|
10924
|
-
if (m < 32 || (Q(I, 0, 32, s, M), d(_, 16, _, 32, m - 32, I) !== 0))
|
|
10925
|
-
|
|
10977
|
+
if (m < 32 || (Q(I, 0, 32, s, M), d(_, 16, _, 32, m - 32, I) !== 0))
|
|
10978
|
+
return -1;
|
|
10979
|
+
for (U(l, 0, _, 0, m, s, M), p = 0; p < 32; p++)
|
|
10980
|
+
l[p] = 0;
|
|
10926
10981
|
return 0;
|
|
10927
10982
|
}
|
|
10928
10983
|
function F(l, _) {
|
|
10929
10984
|
var m;
|
|
10930
|
-
for (m = 0; m < 16; m++)
|
|
10985
|
+
for (m = 0; m < 16; m++)
|
|
10986
|
+
l[m] = _[m] | 0;
|
|
10931
10987
|
}
|
|
10932
|
-
function
|
|
10988
|
+
function N(l) {
|
|
10933
10989
|
var _, m, s = 1;
|
|
10934
10990
|
for (_ = 0; _ < 16; _++)
|
|
10935
10991
|
m = l[_] + s + 65535, s = Math.floor(m / 65536), l[_] = m - s * 65536;
|
|
10936
10992
|
l[0] += s - 1 + 37 * (s - 1);
|
|
10937
10993
|
}
|
|
10938
|
-
function
|
|
10994
|
+
function q(l, _, m) {
|
|
10939
10995
|
for (var s, M = ~(m - 1), p = 0; p < 16; p++)
|
|
10940
10996
|
s = M & (l[p] ^ _[p]), l[p] ^= s, _[p] ^= s;
|
|
10941
10997
|
}
|
|
10942
10998
|
function D(l, _) {
|
|
10943
10999
|
var m, s, M, p = t(), I = t();
|
|
10944
|
-
for (m = 0; m < 16; m++)
|
|
10945
|
-
|
|
11000
|
+
for (m = 0; m < 16; m++)
|
|
11001
|
+
I[m] = _[m];
|
|
11002
|
+
for (N(I), N(I), N(I), s = 0; s < 2; s++) {
|
|
10946
11003
|
for (p[0] = I[0] - 65517, m = 1; m < 15; m++)
|
|
10947
11004
|
p[m] = I[m] - 65535 - (p[m - 1] >> 16 & 1), p[m - 1] &= 65535;
|
|
10948
|
-
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);
|
|
10949
11006
|
}
|
|
10950
11007
|
for (m = 0; m < 16; m++)
|
|
10951
11008
|
l[2 * m] = I[m] & 255, l[2 * m + 1] = I[m] >> 8;
|
|
@@ -10960,14 +11017,17 @@ var Kn = { exports: {} };
|
|
|
10960
11017
|
}
|
|
10961
11018
|
function j(l, _) {
|
|
10962
11019
|
var m;
|
|
10963
|
-
for (m = 0; m < 16; m++)
|
|
11020
|
+
for (m = 0; m < 16; m++)
|
|
11021
|
+
l[m] = _[2 * m] + (_[2 * m + 1] << 8);
|
|
10964
11022
|
l[15] &= 32767;
|
|
10965
11023
|
}
|
|
10966
11024
|
function Y(l, _, m) {
|
|
10967
|
-
for (var s = 0; s < 16; s++)
|
|
11025
|
+
for (var s = 0; s < 16; s++)
|
|
11026
|
+
l[s] = _[s] + m[s];
|
|
10968
11027
|
}
|
|
10969
11028
|
function W(l, _, m) {
|
|
10970
|
-
for (var s = 0; s < 16; s++)
|
|
11029
|
+
for (var s = 0; s < 16; s++)
|
|
11030
|
+
l[s] = _[s] - m[s];
|
|
10971
11031
|
}
|
|
10972
11032
|
function re(l, _, m) {
|
|
10973
11033
|
var s, M, p = 0, I = 0, L = 0, V = 0, ne = 0, fe = 0, he = 0, te = 0, xe = 0, ue = 0, ve = 0, ge = 0, me = 0, _e = 0, pe = 0, de = 0, ye = 0, oe = 0, le = 0, be = 0, se = 0, Z = 0, G = 0, ie = 0, J = 0, ee = 0, ae = 0, Ee = 0, Be = 0, De = 0, Ce = 0, O = m[0], Te = m[1], Xe = m[2], Ze = m[3], ke = m[4], Ke = m[5], je = m[6], m0 = m[7], h0 = m[8], b0 = m[9], p0 = m[10], y0 = m[11], E0 = m[12], k0 = m[13], P0 = m[14], I0 = m[15];
|
|
@@ -10978,25 +11038,30 @@ var Kn = { exports: {} };
|
|
|
10978
11038
|
}
|
|
10979
11039
|
function we(l, _) {
|
|
10980
11040
|
var m = t(), s;
|
|
10981
|
-
for (s = 0; s < 16; s++)
|
|
11041
|
+
for (s = 0; s < 16; s++)
|
|
11042
|
+
m[s] = _[s];
|
|
10982
11043
|
for (s = 253; s >= 0; s--)
|
|
10983
11044
|
ce(m, m), s !== 2 && s !== 4 && re(m, m, _);
|
|
10984
|
-
for (s = 0; s < 16; s++)
|
|
11045
|
+
for (s = 0; s < 16; s++)
|
|
11046
|
+
l[s] = m[s];
|
|
10985
11047
|
}
|
|
10986
11048
|
function Ae(l, _) {
|
|
10987
11049
|
var m = t(), s;
|
|
10988
|
-
for (s = 0; s < 16; s++)
|
|
11050
|
+
for (s = 0; s < 16; s++)
|
|
11051
|
+
m[s] = _[s];
|
|
10989
11052
|
for (s = 250; s >= 0; s--)
|
|
10990
11053
|
ce(m, m), s !== 1 && re(m, m, _);
|
|
10991
|
-
for (s = 0; s < 16; s++)
|
|
11054
|
+
for (s = 0; s < 16; s++)
|
|
11055
|
+
l[s] = m[s];
|
|
10992
11056
|
}
|
|
10993
11057
|
function Me(l, _, m) {
|
|
10994
11058
|
var s = new Uint8Array(32), M = new Float64Array(80), p, I, L = t(), V = t(), ne = t(), fe = t(), he = t(), te = t();
|
|
10995
|
-
for (I = 0; I < 31; I++)
|
|
11059
|
+
for (I = 0; I < 31; I++)
|
|
11060
|
+
s[I] = _[I];
|
|
10996
11061
|
for (s[31] = _[31] & 127 | 64, s[0] &= 248, j(M, m), I = 0; I < 16; I++)
|
|
10997
11062
|
V[I] = M[I], fe[I] = L[I] = ne[I] = 0;
|
|
10998
11063
|
for (L[0] = fe[0] = 1, I = 254; I >= 0; --I)
|
|
10999
|
-
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);
|
|
11000
11065
|
for (I = 0; I < 16; I++)
|
|
11001
11066
|
M[I + 16] = L[I], M[I + 32] = ne[I], M[I + 48] = V[I], M[I + 64] = fe[I];
|
|
11002
11067
|
var xe = M.subarray(32), ue = M.subarray(16);
|
|
@@ -11197,18 +11262,20 @@ var Kn = { exports: {} };
|
|
|
11197
11262
|
}
|
|
11198
11263
|
function ze(l, _, m) {
|
|
11199
11264
|
var s = new Int32Array(8), M = new Int32Array(8), p = new Uint8Array(256), I, L = m;
|
|
11200
|
-
for (s[0] = 1779033703, s[1] = 3144134277, s[2] = 1013904242, s[3] = 2773480762, s[4] = 1359893119, s[5] = 2600822924, s[6] = 528734635, s[7] = 1541459225, M[0] = 4089235720, M[1] = 2227873595, M[2] = 4271175723, M[3] = 1595750129, M[4] = 2917565137, M[5] = 725511199, M[6] = 4215389547, M[7] = 327033209, Qe(s, M, _, m), m %= 128, I = 0; I < m; I++)
|
|
11201
|
-
|
|
11265
|
+
for (s[0] = 1779033703, s[1] = 3144134277, s[2] = 1013904242, s[3] = 2773480762, s[4] = 1359893119, s[5] = 2600822924, s[6] = 528734635, s[7] = 1541459225, M[0] = 4089235720, M[1] = 2227873595, M[2] = 4271175723, M[3] = 1595750129, M[4] = 2917565137, M[5] = 725511199, M[6] = 4215389547, M[7] = 327033209, Qe(s, M, _, m), m %= 128, I = 0; I < m; I++)
|
|
11266
|
+
p[I] = _[L - m + I];
|
|
11267
|
+
for (p[m] = 128, m = 256 - 128 * (m < 112 ? 1 : 0), p[m - 9] = 0, w(p, m - 8, L / 536870912 | 0, L << 3), Qe(s, M, p, m), I = 0; I < 8; I++)
|
|
11268
|
+
w(l, 8 * I, s[I], M[I]);
|
|
11202
11269
|
return 0;
|
|
11203
11270
|
}
|
|
11204
11271
|
function O0(l, _) {
|
|
11205
11272
|
var m = t(), s = t(), M = t(), p = t(), I = t(), L = t(), V = t(), ne = t(), fe = t();
|
|
11206
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);
|
|
11207
11274
|
}
|
|
11208
|
-
function
|
|
11275
|
+
function Ne(l, _, m) {
|
|
11209
11276
|
var s;
|
|
11210
11277
|
for (s = 0; s < 4; s++)
|
|
11211
|
-
|
|
11278
|
+
q(l[s], _[s], m);
|
|
11212
11279
|
}
|
|
11213
11280
|
function Se(l, _) {
|
|
11214
11281
|
var m = t(), s = t(), M = t();
|
|
@@ -11217,7 +11284,7 @@ var Kn = { exports: {} };
|
|
|
11217
11284
|
function F0(l, _, m) {
|
|
11218
11285
|
var s, M;
|
|
11219
11286
|
for (F(l[0], y), F(l[1], x), F(l[2], x), F(l[3], y), M = 255; M >= 0; --M)
|
|
11220
|
-
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);
|
|
11221
11288
|
}
|
|
11222
11289
|
function Je(l, _) {
|
|
11223
11290
|
var m = [t(), t(), t(), t()];
|
|
@@ -11225,11 +11292,12 @@ var Kn = { exports: {} };
|
|
|
11225
11292
|
}
|
|
11226
11293
|
function f0(l, _, m) {
|
|
11227
11294
|
var s = new Uint8Array(64), M = [t(), t(), t(), t()], p;
|
|
11228
|
-
for (m || r(_, 32), ze(s, _, 32), s[0] &= 248, s[31] &= 127, s[31] |= 64, Je(M, s), Se(l, M), p = 0; p < 32; p++)
|
|
11295
|
+
for (m || r(_, 32), ze(s, _, 32), s[0] &= 248, s[31] &= 127, s[31] |= 64, Je(M, s), Se(l, M), p = 0; p < 32; p++)
|
|
11296
|
+
_[p + 32] = l[p];
|
|
11229
11297
|
return 0;
|
|
11230
11298
|
}
|
|
11231
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]);
|
|
11232
|
-
function
|
|
11300
|
+
function qe(l, _) {
|
|
11233
11301
|
var m, s, M, p;
|
|
11234
11302
|
for (s = 63; s >= 32; --s) {
|
|
11235
11303
|
for (m = 0, M = s - 32, p = s - 12; M < p; ++M)
|
|
@@ -11238,29 +11306,37 @@ var Kn = { exports: {} };
|
|
|
11238
11306
|
}
|
|
11239
11307
|
for (m = 0, M = 0; M < 32; M++)
|
|
11240
11308
|
_[M] += m - (_[31] >> 4) * S0[M], m = _[M] >> 8, _[M] &= 255;
|
|
11241
|
-
for (M = 0; M < 32; M++)
|
|
11309
|
+
for (M = 0; M < 32; M++)
|
|
11310
|
+
_[M] -= m * S0[M];
|
|
11242
11311
|
for (s = 0; s < 32; s++)
|
|
11243
11312
|
_[s + 1] += _[s] >> 8, l[s] = _[s] & 255;
|
|
11244
11313
|
}
|
|
11245
11314
|
function u0(l) {
|
|
11246
11315
|
var _ = new Float64Array(64), m;
|
|
11247
|
-
for (m = 0; m < 64; m++)
|
|
11248
|
-
|
|
11249
|
-
|
|
11316
|
+
for (m = 0; m < 64; m++)
|
|
11317
|
+
_[m] = l[m];
|
|
11318
|
+
for (m = 0; m < 64; m++)
|
|
11319
|
+
l[m] = 0;
|
|
11320
|
+
qe(l, _);
|
|
11250
11321
|
}
|
|
11251
11322
|
function G0(l, _, m, s) {
|
|
11252
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()];
|
|
11253
11324
|
ze(M, s, 32), M[0] &= 248, M[31] &= 127, M[31] |= 64;
|
|
11254
11325
|
var he = m + 64;
|
|
11255
|
-
for (L = 0; L < m; L++)
|
|
11256
|
-
|
|
11257
|
-
for (
|
|
11258
|
-
|
|
11259
|
-
for (L =
|
|
11326
|
+
for (L = 0; L < m; L++)
|
|
11327
|
+
l[64 + L] = _[L];
|
|
11328
|
+
for (L = 0; L < 32; L++)
|
|
11329
|
+
l[32 + L] = M[32 + L];
|
|
11330
|
+
for (ze(I, l.subarray(32), m + 32), u0(I), Je(fe, I), Se(l, fe), L = 32; L < 64; L++)
|
|
11331
|
+
l[L] = s[L];
|
|
11332
|
+
for (ze(p, l, m + 64), u0(p), L = 0; L < 64; L++)
|
|
11333
|
+
ne[L] = 0;
|
|
11334
|
+
for (L = 0; L < 32; L++)
|
|
11335
|
+
ne[L] = I[L];
|
|
11260
11336
|
for (L = 0; L < 32; L++)
|
|
11261
11337
|
for (V = 0; V < 32; V++)
|
|
11262
11338
|
ne[L + V] += p[L] * M[V];
|
|
11263
|
-
return
|
|
11339
|
+
return qe(l.subarray(32), ne), he;
|
|
11264
11340
|
}
|
|
11265
11341
|
function l0(l, _) {
|
|
11266
11342
|
var m = t(), s = t(), M = t(), p = t(), I = t(), L = t(), V = t();
|
|
@@ -11268,17 +11344,22 @@ var Kn = { exports: {} };
|
|
|
11268
11344
|
}
|
|
11269
11345
|
function He(l, _, m, s) {
|
|
11270
11346
|
var M, p = new Uint8Array(32), I = new Uint8Array(64), L = [t(), t(), t(), t()], V = [t(), t(), t(), t()];
|
|
11271
|
-
if (m < 64 || l0(V, s))
|
|
11272
|
-
|
|
11273
|
-
for (M = 0; M <
|
|
11347
|
+
if (m < 64 || l0(V, s))
|
|
11348
|
+
return -1;
|
|
11349
|
+
for (M = 0; M < m; M++)
|
|
11350
|
+
l[M] = _[M];
|
|
11351
|
+
for (M = 0; M < 32; M++)
|
|
11352
|
+
l[M + 32] = s[M];
|
|
11274
11353
|
if (ze(I, l, m), u0(I), F0(L, V, I), Je(V, _.subarray(32)), O0(L, V), Se(p, L), m -= 64, z(_, 0, p, 0)) {
|
|
11275
|
-
for (M = 0; M < m; M++)
|
|
11354
|
+
for (M = 0; M < m; M++)
|
|
11355
|
+
l[M] = 0;
|
|
11276
11356
|
return -1;
|
|
11277
11357
|
}
|
|
11278
|
-
for (M = 0; M < m; M++)
|
|
11358
|
+
for (M = 0; M < m; M++)
|
|
11359
|
+
l[M] = _[M + 64];
|
|
11279
11360
|
return m;
|
|
11280
11361
|
}
|
|
11281
|
-
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;
|
|
11282
11363
|
e.lowlevel = {
|
|
11283
11364
|
crypto_core_hsalsa20: H,
|
|
11284
11365
|
crypto_stream_xor: U,
|
|
@@ -11305,13 +11386,13 @@ var Kn = { exports: {} };
|
|
|
11305
11386
|
crypto_secretbox_KEYBYTES: z0,
|
|
11306
11387
|
crypto_secretbox_NONCEBYTES: a0,
|
|
11307
11388
|
crypto_secretbox_ZEROBYTES: r0,
|
|
11308
|
-
crypto_secretbox_BOXZEROBYTES:
|
|
11389
|
+
crypto_secretbox_BOXZEROBYTES: N0,
|
|
11309
11390
|
crypto_scalarmult_BYTES: i0,
|
|
11310
11391
|
crypto_scalarmult_SCALARBYTES: s0,
|
|
11311
11392
|
crypto_box_PUBLICKEYBYTES: W0,
|
|
11312
11393
|
crypto_box_SECRETKEYBYTES: e0,
|
|
11313
11394
|
crypto_box_BEFORENMBYTES: n0,
|
|
11314
|
-
crypto_box_NONCEBYTES:
|
|
11395
|
+
crypto_box_NONCEBYTES: q0,
|
|
11315
11396
|
crypto_box_ZEROBYTES: o0,
|
|
11316
11397
|
crypto_box_BOXZEROBYTES: x0,
|
|
11317
11398
|
crypto_sign_BYTES: D0,
|
|
@@ -11331,17 +11412,21 @@ var Kn = { exports: {} };
|
|
|
11331
11412
|
pow2523: Ae,
|
|
11332
11413
|
add: O0,
|
|
11333
11414
|
set25519: F,
|
|
11334
|
-
modL:
|
|
11415
|
+
modL: qe,
|
|
11335
11416
|
scalarmult: F0,
|
|
11336
11417
|
scalarbase: Je
|
|
11337
11418
|
};
|
|
11338
11419
|
function d0(l, _) {
|
|
11339
|
-
if (l.length !== z0)
|
|
11340
|
-
|
|
11420
|
+
if (l.length !== z0)
|
|
11421
|
+
throw new Error("bad key size");
|
|
11422
|
+
if (_.length !== a0)
|
|
11423
|
+
throw new Error("bad nonce size");
|
|
11341
11424
|
}
|
|
11342
11425
|
function yt(l, _) {
|
|
11343
|
-
if (l.length !== W0)
|
|
11344
|
-
|
|
11426
|
+
if (l.length !== W0)
|
|
11427
|
+
throw new Error("bad public key size");
|
|
11428
|
+
if (_.length !== e0)
|
|
11429
|
+
throw new Error("bad secret key size");
|
|
11345
11430
|
}
|
|
11346
11431
|
function Ie() {
|
|
11347
11432
|
for (var l = 0; l < arguments.length; l++)
|
|
@@ -11349,26 +11434,32 @@ var Kn = { exports: {} };
|
|
|
11349
11434
|
throw new TypeError("unexpected type, use Uint8Array");
|
|
11350
11435
|
}
|
|
11351
11436
|
function Re(l) {
|
|
11352
|
-
for (var _ = 0; _ < l.length; _++)
|
|
11437
|
+
for (var _ = 0; _ < l.length; _++)
|
|
11438
|
+
l[_] = 0;
|
|
11353
11439
|
}
|
|
11354
11440
|
e.randomBytes = function(l) {
|
|
11355
11441
|
var _ = new Uint8Array(l);
|
|
11356
11442
|
return r(_, l), _;
|
|
11357
11443
|
}, e.secretbox = function(l, _, m) {
|
|
11358
11444
|
Ie(l, _, m), d0(m, _);
|
|
11359
|
-
for (var s = new Uint8Array(r0 + l.length), M = new Uint8Array(s.length), p = 0; p < l.length; p++)
|
|
11360
|
-
|
|
11445
|
+
for (var s = new Uint8Array(r0 + l.length), M = new Uint8Array(s.length), p = 0; p < l.length; p++)
|
|
11446
|
+
s[p + r0] = l[p];
|
|
11447
|
+
return g(M, s, s.length, _, m), M.subarray(N0);
|
|
11361
11448
|
}, e.secretbox.open = function(l, _, m) {
|
|
11362
11449
|
Ie(l, _, m), d0(m, _);
|
|
11363
|
-
for (var s = new Uint8Array(
|
|
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];
|
|
11364
11452
|
return s.length < 32 || C(M, s, s.length, _, m) !== 0 ? null : M.subarray(r0);
|
|
11365
|
-
}, e.secretbox.keyLength = z0, e.secretbox.nonceLength = a0, e.secretbox.overheadLength =
|
|
11366
|
-
if (Ie(l, _), l.length !== s0)
|
|
11367
|
-
|
|
11453
|
+
}, e.secretbox.keyLength = z0, e.secretbox.nonceLength = a0, e.secretbox.overheadLength = N0, e.scalarMult = function(l, _) {
|
|
11454
|
+
if (Ie(l, _), l.length !== s0)
|
|
11455
|
+
throw new Error("bad n size");
|
|
11456
|
+
if (_.length !== i0)
|
|
11457
|
+
throw new Error("bad p size");
|
|
11368
11458
|
var m = new Uint8Array(i0);
|
|
11369
11459
|
return Me(m, l, _), m;
|
|
11370
11460
|
}, e.scalarMult.base = function(l) {
|
|
11371
|
-
if (Ie(l), l.length !== s0)
|
|
11461
|
+
if (Ie(l), l.length !== s0)
|
|
11462
|
+
throw new Error("bad n size");
|
|
11372
11463
|
var _ = new Uint8Array(i0);
|
|
11373
11464
|
return Fe(_, l), _;
|
|
11374
11465
|
}, e.scalarMult.scalarLength = s0, e.scalarMult.groupElementLength = i0, e.box = function(l, _, m, s) {
|
|
@@ -11389,7 +11480,7 @@ var Kn = { exports: {} };
|
|
|
11389
11480
|
throw new Error("bad secret key size");
|
|
11390
11481
|
var _ = new Uint8Array(W0);
|
|
11391
11482
|
return Fe(_, l), { publicKey: _, secretKey: new Uint8Array(l) };
|
|
11392
|
-
}, 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, _) {
|
|
11393
11484
|
if (Ie(l, _), _.length !== Ve)
|
|
11394
11485
|
throw new Error("bad secret key size");
|
|
11395
11486
|
var m = new Uint8Array(D0 + l.length);
|
|
@@ -11398,11 +11489,14 @@ var Kn = { exports: {} };
|
|
|
11398
11489
|
if (Ie(l, _), _.length !== t0)
|
|
11399
11490
|
throw new Error("bad public key size");
|
|
11400
11491
|
var m = new Uint8Array(l.length), s = He(m, l, l.length, _);
|
|
11401
|
-
if (s < 0)
|
|
11402
|
-
|
|
11492
|
+
if (s < 0)
|
|
11493
|
+
return null;
|
|
11494
|
+
for (var M = new Uint8Array(s), p = 0; p < M.length; p++)
|
|
11495
|
+
M[p] = m[p];
|
|
11403
11496
|
return M;
|
|
11404
11497
|
}, e.sign.detached = function(l, _) {
|
|
11405
|
-
for (var m = e.sign(l, _), s = new Uint8Array(D0), M = 0; M < s.length; M++)
|
|
11498
|
+
for (var m = e.sign(l, _), s = new Uint8Array(D0), M = 0; M < s.length; M++)
|
|
11499
|
+
s[M] = m[M];
|
|
11406
11500
|
return s;
|
|
11407
11501
|
}, e.sign.detached.verify = function(l, _, m) {
|
|
11408
11502
|
if (Ie(l, _, m), _.length !== D0)
|
|
@@ -11410,8 +11504,10 @@ var Kn = { exports: {} };
|
|
|
11410
11504
|
if (m.length !== t0)
|
|
11411
11505
|
throw new Error("bad public key size");
|
|
11412
11506
|
var s = new Uint8Array(D0 + l.length), M = new Uint8Array(D0 + l.length), p;
|
|
11413
|
-
for (p = 0; p < D0; p++)
|
|
11414
|
-
|
|
11507
|
+
for (p = 0; p < D0; p++)
|
|
11508
|
+
s[p] = _[p];
|
|
11509
|
+
for (p = 0; p < l.length; p++)
|
|
11510
|
+
s[p + D0] = l[p];
|
|
11415
11511
|
return He(M, s, s.length, m) >= 0;
|
|
11416
11512
|
}, e.sign.keyPair = function() {
|
|
11417
11513
|
var l = new Uint8Array(t0), _ = new Uint8Array(Ve);
|
|
@@ -11419,12 +11515,14 @@ var Kn = { exports: {} };
|
|
|
11419
11515
|
}, e.sign.keyPair.fromSecretKey = function(l) {
|
|
11420
11516
|
if (Ie(l), l.length !== Ve)
|
|
11421
11517
|
throw new Error("bad secret key size");
|
|
11422
|
-
for (var _ = new Uint8Array(t0), m = 0; m < _.length; m++)
|
|
11518
|
+
for (var _ = new Uint8Array(t0), m = 0; m < _.length; m++)
|
|
11519
|
+
_[m] = l[32 + m];
|
|
11423
11520
|
return { publicKey: _, secretKey: new Uint8Array(l) };
|
|
11424
11521
|
}, e.sign.keyPair.fromSeed = function(l) {
|
|
11425
11522
|
if (Ie(l), l.length !== tt)
|
|
11426
11523
|
throw new Error("bad seed size");
|
|
11427
|
-
for (var _ = new Uint8Array(t0), m = new Uint8Array(Ve), s = 0; s < 32; s++)
|
|
11524
|
+
for (var _ = new Uint8Array(t0), m = new Uint8Array(Ve), s = 0; s < 32; s++)
|
|
11525
|
+
m[s] = l[s];
|
|
11428
11526
|
return f0(_, m, !0), { publicKey: _, secretKey: m };
|
|
11429
11527
|
}, e.sign.publicKeyLength = t0, e.sign.secretKeyLength = Ve, e.sign.seedLength = tt, e.sign.signatureLength = D0, e.hash = function(l) {
|
|
11430
11528
|
Ie(l);
|
|
@@ -11442,14 +11540,17 @@ var Kn = { exports: {} };
|
|
|
11442
11540
|
var M, p = new Uint8Array(s);
|
|
11443
11541
|
for (M = 0; M < s; M += _)
|
|
11444
11542
|
l.getRandomValues(p.subarray(M, M + Math.min(s - M, _)));
|
|
11445
|
-
for (M = 0; M < s; M++)
|
|
11543
|
+
for (M = 0; M < s; M++)
|
|
11544
|
+
m[M] = p[M];
|
|
11446
11545
|
Re(p);
|
|
11447
11546
|
});
|
|
11448
|
-
} else
|
|
11449
|
-
|
|
11450
|
-
|
|
11451
|
-
|
|
11452
|
-
|
|
11547
|
+
} else
|
|
11548
|
+
typeof vn < "u" && (l = mr, l && l.randomBytes && e.setPRNG(function(m, s) {
|
|
11549
|
+
var M, p = l.randomBytes(s);
|
|
11550
|
+
for (M = 0; M < s; M++)
|
|
11551
|
+
m[M] = p[M];
|
|
11552
|
+
Re(p);
|
|
11553
|
+
}));
|
|
11453
11554
|
}();
|
|
11454
11555
|
})(f.exports ? f.exports : self.nacl = self.nacl || {});
|
|
11455
11556
|
})(Kn);
|
|
@@ -11750,7 +11851,8 @@ function kc(f, e) {
|
|
|
11750
11851
|
}
|
|
11751
11852
|
const Jn = 4;
|
|
11752
11853
|
function A0(f) {
|
|
11753
|
-
if (f)
|
|
11854
|
+
if (f)
|
|
11855
|
+
return Pc(f);
|
|
11754
11856
|
}
|
|
11755
11857
|
function Pc(f) {
|
|
11756
11858
|
for (var e in A0.prototype)
|
|
@@ -11770,7 +11872,8 @@ A0.prototype.off = A0.prototype.removeListener = A0.prototype.removeAllListeners
|
|
|
11770
11872
|
if (this._callbacks = this._callbacks || {}, arguments.length == 0)
|
|
11771
11873
|
return this._callbacks = {}, this;
|
|
11772
11874
|
var t = this._callbacks["$" + f];
|
|
11773
|
-
if (!t)
|
|
11875
|
+
if (!t)
|
|
11876
|
+
return this;
|
|
11774
11877
|
if (arguments.length == 1)
|
|
11775
11878
|
return delete this._callbacks["$" + f], this;
|
|
11776
11879
|
for (var r, a = 0; a < t.length; a++)
|
|
@@ -11808,15 +11911,15 @@ function Pr(f, e) {
|
|
|
11808
11911
|
}
|
|
11809
11912
|
const Oc = 1.33;
|
|
11810
11913
|
function zc(f) {
|
|
11811
|
-
return typeof f == "string" ?
|
|
11914
|
+
return typeof f == "string" ? Nc(f) : Math.ceil((f.byteLength || f.size) * Oc);
|
|
11812
11915
|
}
|
|
11813
|
-
function
|
|
11916
|
+
function Nc(f) {
|
|
11814
11917
|
let e = 0, t = 0;
|
|
11815
11918
|
for (let r = 0, a = f.length; r < a; r++)
|
|
11816
11919
|
e = f.charCodeAt(r), e < 128 ? t += 1 : e < 2048 ? t += 2 : e < 55296 || e >= 57344 ? t += 3 : (r++, t += 4);
|
|
11817
11920
|
return t;
|
|
11818
11921
|
}
|
|
11819
|
-
function
|
|
11922
|
+
function qc(f) {
|
|
11820
11923
|
let e = "";
|
|
11821
11924
|
for (let t in f)
|
|
11822
11925
|
f.hasOwnProperty(t) && (e.length && (e += "&"), e += encodeURIComponent(t) + "=" + encodeURIComponent(f[t]));
|
|
@@ -11929,7 +12032,7 @@ class Zf extends A0 {
|
|
|
11929
12032
|
return this.opts.port && (this.opts.secure && +(this.opts.port !== 443) || !this.opts.secure && Number(this.opts.port) !== 80) ? ":" + this.opts.port : "";
|
|
11930
12033
|
}
|
|
11931
12034
|
_query(e) {
|
|
11932
|
-
const t =
|
|
12035
|
+
const t = qc(e);
|
|
11933
12036
|
return t.length ? "?" + t : "";
|
|
11934
12037
|
}
|
|
11935
12038
|
}
|
|
@@ -13869,7 +13972,7 @@ class b1 {
|
|
|
13869
13972
|
// 타입 가드 함수
|
|
13870
13973
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any
|
|
13871
13974
|
isAccountCryptoType(e) {
|
|
13872
|
-
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";
|
|
13873
13976
|
}
|
|
13874
13977
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any
|
|
13875
13978
|
// private isSignature(obj: any): obj is SignatureType {
|
|
@@ -13916,10 +14019,10 @@ class b1 {
|
|
|
13916
14019
|
t = `${t}
|
|
13917
14020
|
|
|
13918
14021
|
Nonce: ${r}`, await this.sendMessage(e, t);
|
|
13919
|
-
const { publicKey: i, signature: y, address: x, network: u } = await this.getAccountCrypto();
|
|
13920
|
-
if (
|
|
14022
|
+
const { publicKey: i, signature: y, address: x, network: u, nickName: o } = await this.getAccountCrypto();
|
|
14023
|
+
if (!jn.xphereVerify(t, i, y))
|
|
13921
14024
|
throw new Error("Verification failed");
|
|
13922
|
-
return { address: x, network: u, signature: y, publicKey: i };
|
|
14025
|
+
return { address: x, network: u, signature: y, publicKey: i, nickName: o };
|
|
13923
14026
|
} else
|
|
13924
14027
|
throw new Error("Verification failed");
|
|
13925
14028
|
} catch (a) {
|
|
@@ -13951,7 +14054,7 @@ const oa = new y1(), ca = "data:image/svg+xml,%3csvg%20width='167'%20height='166
|
|
|
13951
14054
|
logoSize: x = 30,
|
|
13952
14055
|
...u
|
|
13953
14056
|
}) => {
|
|
13954
|
-
const [o, c] =
|
|
14057
|
+
const [o, c] = Nf(!0), v = jn.generateNonce(16), { qrCode: b, roomId: B } = oa.generateQrCode("login", e, t, f);
|
|
13955
14058
|
return zt(() => {
|
|
13956
14059
|
const w = setTimeout(
|
|
13957
14060
|
() => {
|
|
@@ -13969,14 +14072,17 @@ const oa = new y1(), ca = "data:image/svg+xml,%3csvg%20width='167'%20height='166
|
|
|
13969
14072
|
Nonce: ${v}`, z = {
|
|
13970
14073
|
publicKey: R.publicKey,
|
|
13971
14074
|
message: k
|
|
13972
|
-
},
|
|
14075
|
+
}, P = {
|
|
13973
14076
|
isSuccess: !0,
|
|
13974
|
-
|
|
13975
|
-
|
|
13976
|
-
|
|
13977
|
-
|
|
14077
|
+
account: {
|
|
14078
|
+
address: R.address,
|
|
14079
|
+
network: R.network,
|
|
14080
|
+
nickName: R.nickName
|
|
14081
|
+
},
|
|
14082
|
+
payload: z,
|
|
14083
|
+
signature: R.signature
|
|
13978
14084
|
};
|
|
13979
|
-
i(
|
|
14085
|
+
i(P);
|
|
13980
14086
|
} catch {
|
|
13981
14087
|
i({
|
|
13982
14088
|
isSuccess: !1
|
|
@@ -13996,7 +14102,7 @@ class g1 {
|
|
|
13996
14102
|
// 타입 가드 함수
|
|
13997
14103
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any
|
|
13998
14104
|
isAccountType(e) {
|
|
13999
|
-
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";
|
|
14000
14106
|
}
|
|
14001
14107
|
getAccount() {
|
|
14002
14108
|
return new Promise((e, t) => {
|
|
@@ -14025,7 +14131,7 @@ const m1 = new g1(), w1 = ({
|
|
|
14025
14131
|
logoSize: y = 30,
|
|
14026
14132
|
...x
|
|
14027
14133
|
}) => {
|
|
14028
|
-
const [u, o] =
|
|
14134
|
+
const [u, o] = Nf(!0), { qrCode: c, roomId: v } = oa.generateQrCode("provide", e, t, f);
|
|
14029
14135
|
return zt(() => {
|
|
14030
14136
|
const b = setTimeout(
|
|
14031
14137
|
() => {
|
|
@@ -14041,7 +14147,8 @@ const m1 = new g1(), w1 = ({
|
|
|
14041
14147
|
const B = await m1.qrAddressProvide(v), w = {
|
|
14042
14148
|
isSuccess: !0,
|
|
14043
14149
|
address: B.address,
|
|
14044
|
-
network: B.network
|
|
14150
|
+
network: B.network,
|
|
14151
|
+
nickName: B.nickName
|
|
14045
14152
|
};
|
|
14046
14153
|
a(w);
|
|
14047
14154
|
} catch {
|
|
@@ -14062,6 +14169,5 @@ const m1 = new g1(), w1 = ({
|
|
|
14062
14169
|
export {
|
|
14063
14170
|
w1 as AddressProvideQR,
|
|
14064
14171
|
E1 as LoginQR,
|
|
14065
|
-
m1 as addressProvice,
|
|
14066
14172
|
oa as qrService
|
|
14067
14173
|
};
|