zigap-utils 2.0.3 → 2.0.4
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/README.md +320 -188
- package/dist/components/LoginQR/LoginQR.types.d.ts +1 -1
- package/dist/components/SendTransactionQR/SendTransactionQR.types.d.ts +1 -1
- package/dist/components/SignatureQR/SignatureQR.types.d.ts +1 -1
- package/dist/index.es.js +834 -834
- package/dist/utils/payment.d.ts +10 -4
- package/dist/utils/sendTransaction.d.ts +2 -2
- package/dist/utils/types.d.ts +1 -1
- package/package.json +1 -1
package/dist/index.es.js
CHANGED
|
@@ -148,7 +148,7 @@ React keys must be passed directly to JSX without using spread:
|
|
|
148
148
|
else Z = j;
|
|
149
149
|
return ot && function(lt, kt) {
|
|
150
150
|
function Ft() {
|
|
151
|
-
|
|
151
|
+
c || (c = !0, console.error("%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://react.dev/link/special-props)", kt));
|
|
152
152
|
}
|
|
153
153
|
Ft.isReactWarning = !0, Object.defineProperty(lt, "key", { get: Ft, configurable: !0 });
|
|
154
154
|
}(Z, typeof N == "function" ? N.displayName || N.name || "Unknown" : N), function(lt, kt, Ft, Lt, se, Ke, Wt, te) {
|
|
@@ -158,11 +158,11 @@ React keys must be passed directly to JSX without using spread:
|
|
|
158
158
|
function o(N) {
|
|
159
159
|
typeof N == "object" && N !== null && N.$$typeof === h && N._store && (N._store.validated = 1);
|
|
160
160
|
}
|
|
161
|
-
var
|
|
161
|
+
var c, d = yf, h = Symbol.for("react.transitional.element"), l = Symbol.for("react.portal"), _ = Symbol.for("react.fragment"), v = Symbol.for("react.strict_mode"), A = Symbol.for("react.profiler"), I = Symbol.for("react.consumer"), x = Symbol.for("react.context"), M = Symbol.for("react.forward_ref"), k = Symbol.for("react.suspense"), O = Symbol.for("react.suspense_list"), E = Symbol.for("react.memo"), R = Symbol.for("react.lazy"), L = Symbol.for("react.activity"), z = Symbol.for("react.client.reference"), f = d.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE, p = Object.prototype.hasOwnProperty, g = Array.isArray, m = console.createTask ? console.createTask : function() {
|
|
162
162
|
return null;
|
|
163
|
-
}, u = {}, y = (
|
|
163
|
+
}, u = {}, y = (d = { "react-stack-bottom-frame": function(N) {
|
|
164
164
|
return N();
|
|
165
|
-
} })["react-stack-bottom-frame"].bind(
|
|
165
|
+
} })["react-stack-bottom-frame"].bind(d, i)(), w = m(n(i)), P = {};
|
|
166
166
|
Zi.Fragment = _, Zi.jsx = function(N, j, Z, $, V) {
|
|
167
167
|
var H = 1e4 > f.recentlyCreatedOwnerStacks++;
|
|
168
168
|
return a(N, j, Z, !1, 0, V, H ? Error("react-stack-top-frame") : y, H ? m(n(N)) : w);
|
|
@@ -173,7 +173,7 @@ React keys must be passed directly to JSX without using spread:
|
|
|
173
173
|
}()), Zi);
|
|
174
174
|
var Dt = yo.exports, $d = { exports: {} };
|
|
175
175
|
$d.exports = function() {
|
|
176
|
-
var e = 1e3, t = 6e4, r = 36e5, n = "millisecond", i = "second", s = "minute", a = "hour", o = "day",
|
|
176
|
+
var e = 1e3, t = 6e4, r = 36e5, n = "millisecond", i = "second", s = "minute", a = "hour", o = "day", c = "week", d = "month", h = "quarter", l = "year", _ = "date", v = "Invalid Date", A = /^(\d{4})[-/]?(\d{1,2})?[-/]?(\d{0,2})[Tt\s]*(\d{1,2})?:?(\d{1,2})?:?(\d{1,2})?[.:]?(\d+)?$/, I = /\[([^\]]+)]|Y{1,4}|M{1,4}|D{1,2}|d{1,4}|H{1,2}|h{1,2}|a|A|m{1,2}|s{1,2}|Z{1,2}|SSS/g, x = { name: "en", weekdays: "Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"), months: "January_February_March_April_May_June_July_August_September_October_November_December".split("_"), ordinal: function(u) {
|
|
177
177
|
var y = ["th", "st", "nd", "rd"], w = u % 100;
|
|
178
178
|
return "[" + u + (y[(w - 20) % 10] || y[w] || y[0]) + "]";
|
|
179
179
|
} }, M = function(u, y, w) {
|
|
@@ -184,12 +184,12 @@ $d.exports = function() {
|
|
|
184
184
|
return (y <= 0 ? "+" : "-") + M(P, 2, "0") + ":" + M(N, 2, "0");
|
|
185
185
|
}, m: function u(y, w) {
|
|
186
186
|
if (y.date() < w.date()) return -u(w, y);
|
|
187
|
-
var P = 12 * (w.year() - y.year()) + (w.month() - y.month()), N = y.clone().add(P,
|
|
187
|
+
var P = 12 * (w.year() - y.year()) + (w.month() - y.month()), N = y.clone().add(P, d), j = w - N < 0, Z = y.clone().add(P + (j ? -1 : 1), d);
|
|
188
188
|
return +(-(P + (w - N) / (j ? N - Z : Z - N)) || 0);
|
|
189
189
|
}, a: function(u) {
|
|
190
190
|
return u < 0 ? Math.ceil(u) || 0 : Math.floor(u);
|
|
191
191
|
}, p: function(u) {
|
|
192
|
-
return { M:
|
|
192
|
+
return { M: d, y: l, w: c, d: o, D: _, h: a, m: s, s: i, ms: n, Q: h }[u] || String(u || "").toLowerCase().replace(/s$/, "");
|
|
193
193
|
}, u: function(u) {
|
|
194
194
|
return u === void 0;
|
|
195
195
|
} }, O = "en", E = {};
|
|
@@ -267,9 +267,9 @@ $d.exports = function() {
|
|
|
267
267
|
switch (Z) {
|
|
268
268
|
case l:
|
|
269
269
|
return j ? $(1, 0) : $(31, 11);
|
|
270
|
-
case c:
|
|
271
|
-
return j ? $(1, D) : $(0, D + 1);
|
|
272
270
|
case d:
|
|
271
|
+
return j ? $(1, D) : $(0, D + 1);
|
|
272
|
+
case c:
|
|
273
273
|
var ot = this.$locale().weekStart || 0, mt = (H < ot ? H + 7 : H) - ot;
|
|
274
274
|
return $(j ? G - mt : G + (6 - mt), D);
|
|
275
275
|
case o:
|
|
@@ -287,8 +287,8 @@ $d.exports = function() {
|
|
|
287
287
|
}, y.endOf = function(w) {
|
|
288
288
|
return this.startOf(w, !1);
|
|
289
289
|
}, y.$set = function(w, P) {
|
|
290
|
-
var N, j = p.p(w), Z = "set" + (this.$u ? "UTC" : ""), $ = (N = {}, N[o] = Z + "Date", N[_] = Z + "Date", N[
|
|
291
|
-
if (j ===
|
|
290
|
+
var N, j = p.p(w), Z = "set" + (this.$u ? "UTC" : ""), $ = (N = {}, N[o] = Z + "Date", N[_] = Z + "Date", N[d] = Z + "Month", N[l] = Z + "FullYear", N[a] = Z + "Hours", N[s] = Z + "Minutes", N[i] = Z + "Seconds", N[n] = Z + "Milliseconds", N)[j], V = j === o ? this.$D + (P - this.$W) : P;
|
|
291
|
+
if (j === d || j === l) {
|
|
292
292
|
var H = this.clone().set(_, 1);
|
|
293
293
|
H.$d[$](V), H.init(), this.$d = H.set(_, Math.min(this.$D, H.daysInMonth())).$d;
|
|
294
294
|
} else $ && this.$d[$](V);
|
|
@@ -304,10 +304,10 @@ $d.exports = function() {
|
|
|
304
304
|
var G = f(j);
|
|
305
305
|
return p.w(G.date(G.date() + Math.round(D * w)), j);
|
|
306
306
|
};
|
|
307
|
-
if (Z ===
|
|
307
|
+
if (Z === d) return this.set(d, this.$M + w);
|
|
308
308
|
if (Z === l) return this.set(l, this.$y + w);
|
|
309
309
|
if (Z === o) return $(1);
|
|
310
|
-
if (Z ===
|
|
310
|
+
if (Z === c) return $(7);
|
|
311
311
|
var V = (N = {}, N[s] = t, N[a] = r, N[i] = e, N)[Z] || 1, H = this.$d.getTime() + w * V;
|
|
312
312
|
return p.w(H, this);
|
|
313
313
|
}, y.subtract = function(w, P) {
|
|
@@ -388,13 +388,13 @@ $d.exports = function() {
|
|
|
388
388
|
case l:
|
|
389
389
|
j = G() / 12;
|
|
390
390
|
break;
|
|
391
|
-
case
|
|
391
|
+
case d:
|
|
392
392
|
j = G();
|
|
393
393
|
break;
|
|
394
394
|
case h:
|
|
395
395
|
j = G() / 3;
|
|
396
396
|
break;
|
|
397
|
-
case
|
|
397
|
+
case c:
|
|
398
398
|
j = (D - H) / 6048e5;
|
|
399
399
|
break;
|
|
400
400
|
case o:
|
|
@@ -414,7 +414,7 @@ $d.exports = function() {
|
|
|
414
414
|
}
|
|
415
415
|
return N ? j : p.a(j);
|
|
416
416
|
}, y.daysInMonth = function() {
|
|
417
|
-
return this.endOf(
|
|
417
|
+
return this.endOf(d).$D;
|
|
418
418
|
}, y.$locale = function() {
|
|
419
419
|
return E[this.$L];
|
|
420
420
|
}, y.locale = function(w, P) {
|
|
@@ -433,7 +433,7 @@ $d.exports = function() {
|
|
|
433
433
|
return this.$d.toUTCString();
|
|
434
434
|
}, u;
|
|
435
435
|
}(), m = g.prototype;
|
|
436
|
-
return f.prototype = m, [["$ms", n], ["$s", i], ["$m", s], ["$H", a], ["$W", o], ["$M",
|
|
436
|
+
return f.prototype = m, [["$ms", n], ["$s", i], ["$m", s], ["$H", a], ["$W", o], ["$M", d], ["$y", l], ["$D", _]].forEach(function(u) {
|
|
437
437
|
m[u[1]] = function(y) {
|
|
438
438
|
return this.$g(y, u[0], u[1]);
|
|
439
439
|
};
|
|
@@ -451,10 +451,10 @@ var dn, Ua, gf = Object.defineProperty, ds = Object.getOwnPropertySymbols, qd =
|
|
|
451
451
|
};
|
|
452
452
|
((e) => {
|
|
453
453
|
const t = class {
|
|
454
|
-
constructor(
|
|
455
|
-
if (this.version =
|
|
454
|
+
constructor(c, d, h, l) {
|
|
455
|
+
if (this.version = c, this.errorCorrectionLevel = d, this.modules = [], this.isFunction = [], c < t.MIN_VERSION || c > t.MAX_VERSION) throw new RangeError("Version value out of range");
|
|
456
456
|
if (l < -1 || l > 7) throw new RangeError("Mask value out of range");
|
|
457
|
-
this.size = 4 *
|
|
457
|
+
this.size = 4 * c + 17;
|
|
458
458
|
let _ = [];
|
|
459
459
|
for (let A = 0; A < this.size; A++) _.push(!1);
|
|
460
460
|
for (let A = 0; A < this.size; A++) this.modules.push(_.slice()), this.isFunction.push(_.slice());
|
|
@@ -470,41 +470,41 @@ var dn, Ua, gf = Object.defineProperty, ds = Object.getOwnPropertySymbols, qd =
|
|
|
470
470
|
}
|
|
471
471
|
s(0 <= l && l <= 7), this.mask = l, this.applyMask(l), this.drawFormatBits(l), this.isFunction = [];
|
|
472
472
|
}
|
|
473
|
-
static encodeText(
|
|
474
|
-
const h = e.QrSegment.makeSegments(
|
|
475
|
-
return t.encodeSegments(h,
|
|
473
|
+
static encodeText(c, d) {
|
|
474
|
+
const h = e.QrSegment.makeSegments(c);
|
|
475
|
+
return t.encodeSegments(h, d);
|
|
476
476
|
}
|
|
477
|
-
static encodeBinary(
|
|
478
|
-
const h = e.QrSegment.makeBytes(
|
|
479
|
-
return t.encodeSegments([h],
|
|
477
|
+
static encodeBinary(c, d) {
|
|
478
|
+
const h = e.QrSegment.makeBytes(c);
|
|
479
|
+
return t.encodeSegments([h], d);
|
|
480
480
|
}
|
|
481
|
-
static encodeSegments(
|
|
481
|
+
static encodeSegments(c, d, h = 1, l = 40, _ = -1, v = !0) {
|
|
482
482
|
if (!(t.MIN_VERSION <= h && h <= l && l <= t.MAX_VERSION) || _ < -1 || _ > 7) throw new RangeError("Invalid value");
|
|
483
483
|
let A, I;
|
|
484
484
|
for (A = h; ; A++) {
|
|
485
|
-
const O = 8 * t.getNumDataCodewords(A,
|
|
485
|
+
const O = 8 * t.getNumDataCodewords(A, d), E = o.getTotalBits(c, A);
|
|
486
486
|
if (E <= O) {
|
|
487
487
|
I = E;
|
|
488
488
|
break;
|
|
489
489
|
}
|
|
490
490
|
if (A >= l) throw new RangeError("Data too long");
|
|
491
491
|
}
|
|
492
|
-
for (const O of [t.Ecc.MEDIUM, t.Ecc.QUARTILE, t.Ecc.HIGH]) v && I <= 8 * t.getNumDataCodewords(A, O) && (
|
|
492
|
+
for (const O of [t.Ecc.MEDIUM, t.Ecc.QUARTILE, t.Ecc.HIGH]) v && I <= 8 * t.getNumDataCodewords(A, O) && (d = O);
|
|
493
493
|
let x = [];
|
|
494
|
-
for (const O of
|
|
494
|
+
for (const O of c) {
|
|
495
495
|
n(O.mode.modeBits, 4, x), n(O.numChars, O.mode.numCharCountBits(A), x);
|
|
496
496
|
for (const E of O.getData()) x.push(E);
|
|
497
497
|
}
|
|
498
498
|
s(x.length == I);
|
|
499
|
-
const M = 8 * t.getNumDataCodewords(A,
|
|
499
|
+
const M = 8 * t.getNumDataCodewords(A, d);
|
|
500
500
|
s(x.length <= M), n(0, Math.min(4, M - x.length), x), n(0, (8 - x.length % 8) % 8, x), s(x.length % 8 == 0);
|
|
501
501
|
for (let O = 236; x.length < M; O ^= 253) n(O, 8, x);
|
|
502
502
|
let k = [];
|
|
503
503
|
for (; 8 * k.length < x.length; ) k.push(0);
|
|
504
|
-
return x.forEach((O, E) => k[E >>> 3] |= O << 7 - (7 & E)), new t(A,
|
|
504
|
+
return x.forEach((O, E) => k[E >>> 3] |= O << 7 - (7 & E)), new t(A, d, k, _);
|
|
505
505
|
}
|
|
506
|
-
getModule(
|
|
507
|
-
return 0 <=
|
|
506
|
+
getModule(c, d) {
|
|
507
|
+
return 0 <= c && c < this.size && 0 <= d && d < this.size && this.modules[d][c];
|
|
508
508
|
}
|
|
509
509
|
getModules() {
|
|
510
510
|
return this.modules;
|
|
@@ -512,15 +512,15 @@ var dn, Ua, gf = Object.defineProperty, ds = Object.getOwnPropertySymbols, qd =
|
|
|
512
512
|
drawFunctionPatterns() {
|
|
513
513
|
for (let h = 0; h < this.size; h++) this.setFunctionModule(6, h, h % 2 == 0), this.setFunctionModule(h, 6, h % 2 == 0);
|
|
514
514
|
this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
|
|
515
|
-
const
|
|
516
|
-
for (let h = 0; h <
|
|
515
|
+
const c = this.getAlignmentPatternPositions(), d = c.length;
|
|
516
|
+
for (let h = 0; h < d; h++) for (let l = 0; l < d; l++) h == 0 && l == 0 || h == 0 && l == d - 1 || h == d - 1 && l == 0 || this.drawAlignmentPattern(c[h], c[l]);
|
|
517
517
|
this.drawFormatBits(0), this.drawVersion();
|
|
518
518
|
}
|
|
519
|
-
drawFormatBits(
|
|
520
|
-
const
|
|
521
|
-
let h =
|
|
519
|
+
drawFormatBits(c) {
|
|
520
|
+
const d = this.errorCorrectionLevel.formatBits << 3 | c;
|
|
521
|
+
let h = d;
|
|
522
522
|
for (let _ = 0; _ < 10; _++) h = h << 1 ^ 1335 * (h >>> 9);
|
|
523
|
-
const l = 21522 ^ (
|
|
523
|
+
const l = 21522 ^ (d << 10 | h);
|
|
524
524
|
s(l >>> 15 == 0);
|
|
525
525
|
for (let _ = 0; _ <= 5; _++) this.setFunctionModule(8, _, i(l, _));
|
|
526
526
|
this.setFunctionModule(8, 7, i(l, 6)), this.setFunctionModule(8, 8, i(l, 7)), this.setFunctionModule(7, 8, i(l, 8));
|
|
@@ -531,35 +531,35 @@ var dn, Ua, gf = Object.defineProperty, ds = Object.getOwnPropertySymbols, qd =
|
|
|
531
531
|
}
|
|
532
532
|
drawVersion() {
|
|
533
533
|
if (this.version < 7) return;
|
|
534
|
-
let
|
|
535
|
-
for (let h = 0; h < 12; h++)
|
|
536
|
-
const
|
|
537
|
-
s(
|
|
534
|
+
let c = this.version;
|
|
535
|
+
for (let h = 0; h < 12; h++) c = c << 1 ^ 7973 * (c >>> 11);
|
|
536
|
+
const d = this.version << 12 | c;
|
|
537
|
+
s(d >>> 18 == 0);
|
|
538
538
|
for (let h = 0; h < 18; h++) {
|
|
539
|
-
const l = i(
|
|
539
|
+
const l = i(d, h), _ = this.size - 11 + h % 3, v = Math.floor(h / 3);
|
|
540
540
|
this.setFunctionModule(_, v, l), this.setFunctionModule(v, _, l);
|
|
541
541
|
}
|
|
542
542
|
}
|
|
543
|
-
drawFinderPattern(
|
|
543
|
+
drawFinderPattern(c, d) {
|
|
544
544
|
for (let h = -4; h <= 4; h++) for (let l = -4; l <= 4; l++) {
|
|
545
|
-
const _ = Math.max(Math.abs(l), Math.abs(h)), v =
|
|
545
|
+
const _ = Math.max(Math.abs(l), Math.abs(h)), v = c + l, A = d + h;
|
|
546
546
|
0 <= v && v < this.size && 0 <= A && A < this.size && this.setFunctionModule(v, A, _ != 2 && _ != 4);
|
|
547
547
|
}
|
|
548
548
|
}
|
|
549
|
-
drawAlignmentPattern(
|
|
550
|
-
for (let h = -2; h <= 2; h++) for (let l = -2; l <= 2; l++) this.setFunctionModule(
|
|
549
|
+
drawAlignmentPattern(c, d) {
|
|
550
|
+
for (let h = -2; h <= 2; h++) for (let l = -2; l <= 2; l++) this.setFunctionModule(c + l, d + h, Math.max(Math.abs(l), Math.abs(h)) != 1);
|
|
551
551
|
}
|
|
552
|
-
setFunctionModule(
|
|
553
|
-
this.modules[
|
|
552
|
+
setFunctionModule(c, d, h) {
|
|
553
|
+
this.modules[d][c] = h, this.isFunction[d][c] = !0;
|
|
554
554
|
}
|
|
555
|
-
addEccAndInterleave(
|
|
556
|
-
const
|
|
557
|
-
if (
|
|
558
|
-
const l = t.NUM_ERROR_CORRECTION_BLOCKS[h.ordinal][
|
|
555
|
+
addEccAndInterleave(c) {
|
|
556
|
+
const d = this.version, h = this.errorCorrectionLevel;
|
|
557
|
+
if (c.length != t.getNumDataCodewords(d, h)) throw new RangeError("Invalid argument");
|
|
558
|
+
const l = t.NUM_ERROR_CORRECTION_BLOCKS[h.ordinal][d], _ = t.ECC_CODEWORDS_PER_BLOCK[h.ordinal][d], v = Math.floor(t.getNumRawDataModules(d) / 8), A = l - v % l, I = Math.floor(v / l);
|
|
559
559
|
let x = [];
|
|
560
560
|
const M = t.reedSolomonComputeDivisor(_);
|
|
561
561
|
for (let O = 0, E = 0; O < l; O++) {
|
|
562
|
-
let R =
|
|
562
|
+
let R = c.slice(E, E + I - _ + (O < A ? 0 : 1));
|
|
563
563
|
E += R.length;
|
|
564
564
|
const L = t.reedSolomonComputeRemainder(R, M);
|
|
565
565
|
O < A && R.push(0), x.push(R.concat(L));
|
|
@@ -570,211 +570,211 @@ var dn, Ua, gf = Object.defineProperty, ds = Object.getOwnPropertySymbols, qd =
|
|
|
570
570
|
});
|
|
571
571
|
return s(k.length == v), k;
|
|
572
572
|
}
|
|
573
|
-
drawCodewords(
|
|
574
|
-
if (
|
|
575
|
-
let
|
|
573
|
+
drawCodewords(c) {
|
|
574
|
+
if (c.length != Math.floor(t.getNumRawDataModules(this.version) / 8)) throw new RangeError("Invalid argument");
|
|
575
|
+
let d = 0;
|
|
576
576
|
for (let h = this.size - 1; h >= 1; h -= 2) {
|
|
577
577
|
h == 6 && (h = 5);
|
|
578
578
|
for (let l = 0; l < this.size; l++) for (let _ = 0; _ < 2; _++) {
|
|
579
579
|
const v = h - _, A = h + 1 & 2 ? l : this.size - 1 - l;
|
|
580
|
-
!this.isFunction[A][v] &&
|
|
580
|
+
!this.isFunction[A][v] && d < 8 * c.length && (this.modules[A][v] = i(c[d >>> 3], 7 - (7 & d)), d++);
|
|
581
581
|
}
|
|
582
582
|
}
|
|
583
|
-
s(
|
|
583
|
+
s(d == 8 * c.length);
|
|
584
584
|
}
|
|
585
|
-
applyMask(
|
|
586
|
-
if (
|
|
587
|
-
for (let
|
|
585
|
+
applyMask(c) {
|
|
586
|
+
if (c < 0 || c > 7) throw new RangeError("Mask value out of range");
|
|
587
|
+
for (let d = 0; d < this.size; d++) for (let h = 0; h < this.size; h++) {
|
|
588
588
|
let l;
|
|
589
|
-
switch (
|
|
589
|
+
switch (c) {
|
|
590
590
|
case 0:
|
|
591
|
-
l = (h +
|
|
591
|
+
l = (h + d) % 2 == 0;
|
|
592
592
|
break;
|
|
593
593
|
case 1:
|
|
594
|
-
l =
|
|
594
|
+
l = d % 2 == 0;
|
|
595
595
|
break;
|
|
596
596
|
case 2:
|
|
597
597
|
l = h % 3 == 0;
|
|
598
598
|
break;
|
|
599
599
|
case 3:
|
|
600
|
-
l = (h +
|
|
600
|
+
l = (h + d) % 3 == 0;
|
|
601
601
|
break;
|
|
602
602
|
case 4:
|
|
603
|
-
l = (Math.floor(h / 3) + Math.floor(
|
|
603
|
+
l = (Math.floor(h / 3) + Math.floor(d / 2)) % 2 == 0;
|
|
604
604
|
break;
|
|
605
605
|
case 5:
|
|
606
|
-
l = h *
|
|
606
|
+
l = h * d % 2 + h * d % 3 == 0;
|
|
607
607
|
break;
|
|
608
608
|
case 6:
|
|
609
|
-
l = (h *
|
|
609
|
+
l = (h * d % 2 + h * d % 3) % 2 == 0;
|
|
610
610
|
break;
|
|
611
611
|
case 7:
|
|
612
|
-
l = ((h +
|
|
612
|
+
l = ((h + d) % 2 + h * d % 3) % 2 == 0;
|
|
613
613
|
break;
|
|
614
614
|
default:
|
|
615
615
|
throw new Error("Unreachable");
|
|
616
616
|
}
|
|
617
|
-
!this.isFunction[
|
|
617
|
+
!this.isFunction[d][h] && l && (this.modules[d][h] = !this.modules[d][h]);
|
|
618
618
|
}
|
|
619
619
|
}
|
|
620
620
|
getPenaltyScore() {
|
|
621
|
-
let
|
|
621
|
+
let c = 0;
|
|
622
622
|
for (let _ = 0; _ < this.size; _++) {
|
|
623
623
|
let v = !1, A = 0, I = [0, 0, 0, 0, 0, 0, 0];
|
|
624
|
-
for (let x = 0; x < this.size; x++) this.modules[_][x] == v ? (A++, A == 5 ?
|
|
625
|
-
|
|
624
|
+
for (let x = 0; x < this.size; x++) this.modules[_][x] == v ? (A++, A == 5 ? c += t.PENALTY_N1 : A > 5 && c++) : (this.finderPenaltyAddHistory(A, I), v || (c += this.finderPenaltyCountPatterns(I) * t.PENALTY_N3), v = this.modules[_][x], A = 1);
|
|
625
|
+
c += this.finderPenaltyTerminateAndCount(v, A, I) * t.PENALTY_N3;
|
|
626
626
|
}
|
|
627
627
|
for (let _ = 0; _ < this.size; _++) {
|
|
628
628
|
let v = !1, A = 0, I = [0, 0, 0, 0, 0, 0, 0];
|
|
629
|
-
for (let x = 0; x < this.size; x++) this.modules[x][_] == v ? (A++, A == 5 ?
|
|
630
|
-
|
|
629
|
+
for (let x = 0; x < this.size; x++) this.modules[x][_] == v ? (A++, A == 5 ? c += t.PENALTY_N1 : A > 5 && c++) : (this.finderPenaltyAddHistory(A, I), v || (c += this.finderPenaltyCountPatterns(I) * t.PENALTY_N3), v = this.modules[x][_], A = 1);
|
|
630
|
+
c += this.finderPenaltyTerminateAndCount(v, A, I) * t.PENALTY_N3;
|
|
631
631
|
}
|
|
632
632
|
for (let _ = 0; _ < this.size - 1; _++) for (let v = 0; v < this.size - 1; v++) {
|
|
633
633
|
const A = this.modules[_][v];
|
|
634
|
-
A == this.modules[_][v + 1] && A == this.modules[_ + 1][v] && A == this.modules[_ + 1][v + 1] && (
|
|
634
|
+
A == this.modules[_][v + 1] && A == this.modules[_ + 1][v] && A == this.modules[_ + 1][v + 1] && (c += t.PENALTY_N2);
|
|
635
635
|
}
|
|
636
|
-
let
|
|
637
|
-
for (const _ of this.modules)
|
|
638
|
-
const h = this.size * this.size, l = Math.ceil(Math.abs(20 *
|
|
639
|
-
return s(0 <= l && l <= 9),
|
|
636
|
+
let d = 0;
|
|
637
|
+
for (const _ of this.modules) d = _.reduce((v, A) => v + (A ? 1 : 0), d);
|
|
638
|
+
const h = this.size * this.size, l = Math.ceil(Math.abs(20 * d - 10 * h) / h) - 1;
|
|
639
|
+
return s(0 <= l && l <= 9), c += l * t.PENALTY_N4, s(0 <= c && c <= 2568888), c;
|
|
640
640
|
}
|
|
641
641
|
getAlignmentPatternPositions() {
|
|
642
642
|
if (this.version == 1) return [];
|
|
643
643
|
{
|
|
644
|
-
const
|
|
644
|
+
const c = Math.floor(this.version / 7) + 2, d = this.version == 32 ? 26 : 2 * Math.ceil((4 * this.version + 4) / (2 * c - 2));
|
|
645
645
|
let h = [6];
|
|
646
|
-
for (let l = this.size - 7; h.length <
|
|
646
|
+
for (let l = this.size - 7; h.length < c; l -= d) h.splice(1, 0, l);
|
|
647
647
|
return h;
|
|
648
648
|
}
|
|
649
649
|
}
|
|
650
|
-
static getNumRawDataModules(
|
|
651
|
-
if (
|
|
652
|
-
let
|
|
653
|
-
if (
|
|
654
|
-
const h = Math.floor(
|
|
655
|
-
|
|
650
|
+
static getNumRawDataModules(c) {
|
|
651
|
+
if (c < t.MIN_VERSION || c > t.MAX_VERSION) throw new RangeError("Version number out of range");
|
|
652
|
+
let d = (16 * c + 128) * c + 64;
|
|
653
|
+
if (c >= 2) {
|
|
654
|
+
const h = Math.floor(c / 7) + 2;
|
|
655
|
+
d -= (25 * h - 10) * h - 55, c >= 7 && (d -= 36);
|
|
656
656
|
}
|
|
657
|
-
return s(208 <=
|
|
657
|
+
return s(208 <= d && d <= 29648), d;
|
|
658
658
|
}
|
|
659
|
-
static getNumDataCodewords(
|
|
660
|
-
return Math.floor(t.getNumRawDataModules(
|
|
659
|
+
static getNumDataCodewords(c, d) {
|
|
660
|
+
return Math.floor(t.getNumRawDataModules(c) / 8) - t.ECC_CODEWORDS_PER_BLOCK[d.ordinal][c] * t.NUM_ERROR_CORRECTION_BLOCKS[d.ordinal][c];
|
|
661
661
|
}
|
|
662
|
-
static reedSolomonComputeDivisor(
|
|
663
|
-
if (
|
|
664
|
-
let
|
|
665
|
-
for (let l = 0; l <
|
|
666
|
-
|
|
662
|
+
static reedSolomonComputeDivisor(c) {
|
|
663
|
+
if (c < 1 || c > 255) throw new RangeError("Degree out of range");
|
|
664
|
+
let d = [];
|
|
665
|
+
for (let l = 0; l < c - 1; l++) d.push(0);
|
|
666
|
+
d.push(1);
|
|
667
667
|
let h = 1;
|
|
668
|
-
for (let l = 0; l <
|
|
669
|
-
for (let _ = 0; _ <
|
|
668
|
+
for (let l = 0; l < c; l++) {
|
|
669
|
+
for (let _ = 0; _ < d.length; _++) d[_] = t.reedSolomonMultiply(d[_], h), _ + 1 < d.length && (d[_] ^= d[_ + 1]);
|
|
670
670
|
h = t.reedSolomonMultiply(h, 2);
|
|
671
671
|
}
|
|
672
|
-
return
|
|
672
|
+
return d;
|
|
673
673
|
}
|
|
674
|
-
static reedSolomonComputeRemainder(
|
|
675
|
-
let h =
|
|
676
|
-
for (const l of
|
|
674
|
+
static reedSolomonComputeRemainder(c, d) {
|
|
675
|
+
let h = d.map((l) => 0);
|
|
676
|
+
for (const l of c) {
|
|
677
677
|
const _ = l ^ h.shift();
|
|
678
|
-
h.push(0),
|
|
678
|
+
h.push(0), d.forEach((v, A) => h[A] ^= t.reedSolomonMultiply(v, _));
|
|
679
679
|
}
|
|
680
680
|
return h;
|
|
681
681
|
}
|
|
682
|
-
static reedSolomonMultiply(
|
|
683
|
-
if (
|
|
682
|
+
static reedSolomonMultiply(c, d) {
|
|
683
|
+
if (c >>> 8 || d >>> 8) throw new RangeError("Byte out of range");
|
|
684
684
|
let h = 0;
|
|
685
|
-
for (let l = 7; l >= 0; l--) h = h << 1 ^ 285 * (h >>> 7), h ^= (
|
|
685
|
+
for (let l = 7; l >= 0; l--) h = h << 1 ^ 285 * (h >>> 7), h ^= (d >>> l & 1) * c;
|
|
686
686
|
return s(h >>> 8 == 0), h;
|
|
687
687
|
}
|
|
688
|
-
finderPenaltyCountPatterns(
|
|
689
|
-
const
|
|
690
|
-
s(
|
|
691
|
-
const h =
|
|
692
|
-
return (h &&
|
|
688
|
+
finderPenaltyCountPatterns(c) {
|
|
689
|
+
const d = c[1];
|
|
690
|
+
s(d <= 3 * this.size);
|
|
691
|
+
const h = d > 0 && c[2] == d && c[3] == 3 * d && c[4] == d && c[5] == d;
|
|
692
|
+
return (h && c[0] >= 4 * d && c[6] >= d ? 1 : 0) + (h && c[6] >= 4 * d && c[0] >= d ? 1 : 0);
|
|
693
693
|
}
|
|
694
|
-
finderPenaltyTerminateAndCount(
|
|
695
|
-
return
|
|
694
|
+
finderPenaltyTerminateAndCount(c, d, h) {
|
|
695
|
+
return c && (this.finderPenaltyAddHistory(d, h), d = 0), d += this.size, this.finderPenaltyAddHistory(d, h), this.finderPenaltyCountPatterns(h);
|
|
696
696
|
}
|
|
697
|
-
finderPenaltyAddHistory(
|
|
698
|
-
|
|
697
|
+
finderPenaltyAddHistory(c, d) {
|
|
698
|
+
d[0] == 0 && (c += this.size), d.pop(), d.unshift(c);
|
|
699
699
|
}
|
|
700
700
|
};
|
|
701
701
|
let r = t;
|
|
702
|
-
function n(
|
|
703
|
-
if (
|
|
704
|
-
for (let l =
|
|
702
|
+
function n(c, d, h) {
|
|
703
|
+
if (d < 0 || d > 31 || c >>> d) throw new RangeError("Value out of range");
|
|
704
|
+
for (let l = d - 1; l >= 0; l--) h.push(c >>> l & 1);
|
|
705
705
|
}
|
|
706
|
-
function i(
|
|
707
|
-
return !!(
|
|
706
|
+
function i(c, d) {
|
|
707
|
+
return !!(c >>> d & 1);
|
|
708
708
|
}
|
|
709
|
-
function s(
|
|
710
|
-
if (!
|
|
709
|
+
function s(c) {
|
|
710
|
+
if (!c) throw new Error("Assertion error");
|
|
711
711
|
}
|
|
712
712
|
r.MIN_VERSION = 1, r.MAX_VERSION = 40, r.PENALTY_N1 = 3, r.PENALTY_N2 = 3, r.PENALTY_N3 = 40, r.PENALTY_N4 = 10, r.ECC_CODEWORDS_PER_BLOCK = [[-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30], [-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28], [-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30], [-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]], r.NUM_ERROR_CORRECTION_BLOCKS = [[-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25], [-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49], [-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68], [-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81]], e.QrCode = r;
|
|
713
713
|
const a = class {
|
|
714
|
-
constructor(
|
|
715
|
-
if (this.mode =
|
|
714
|
+
constructor(c, d, h) {
|
|
715
|
+
if (this.mode = c, this.numChars = d, this.bitData = h, d < 0) throw new RangeError("Invalid argument");
|
|
716
716
|
this.bitData = h.slice();
|
|
717
717
|
}
|
|
718
|
-
static makeBytes(
|
|
719
|
-
let
|
|
720
|
-
for (const h of
|
|
721
|
-
return new a(a.Mode.BYTE,
|
|
722
|
-
}
|
|
723
|
-
static makeNumeric(
|
|
724
|
-
if (!a.isNumeric(
|
|
725
|
-
let
|
|
726
|
-
for (let h = 0; h <
|
|
727
|
-
const l = Math.min(
|
|
728
|
-
n(parseInt(
|
|
729
|
-
}
|
|
730
|
-
return new a(a.Mode.NUMERIC,
|
|
731
|
-
}
|
|
732
|
-
static makeAlphanumeric(
|
|
733
|
-
if (!a.isAlphanumeric(
|
|
734
|
-
let
|
|
735
|
-
for (
|
|
736
|
-
let l = 45 * a.ALPHANUMERIC_CHARSET.indexOf(
|
|
737
|
-
l += a.ALPHANUMERIC_CHARSET.indexOf(
|
|
738
|
-
}
|
|
739
|
-
return
|
|
740
|
-
}
|
|
741
|
-
static makeSegments(
|
|
742
|
-
return
|
|
743
|
-
}
|
|
744
|
-
static makeEci(
|
|
745
|
-
let
|
|
746
|
-
if (
|
|
747
|
-
if (
|
|
748
|
-
else if (
|
|
718
|
+
static makeBytes(c) {
|
|
719
|
+
let d = [];
|
|
720
|
+
for (const h of c) n(h, 8, d);
|
|
721
|
+
return new a(a.Mode.BYTE, c.length, d);
|
|
722
|
+
}
|
|
723
|
+
static makeNumeric(c) {
|
|
724
|
+
if (!a.isNumeric(c)) throw new RangeError("String contains non-numeric characters");
|
|
725
|
+
let d = [];
|
|
726
|
+
for (let h = 0; h < c.length; ) {
|
|
727
|
+
const l = Math.min(c.length - h, 3);
|
|
728
|
+
n(parseInt(c.substr(h, l), 10), 3 * l + 1, d), h += l;
|
|
729
|
+
}
|
|
730
|
+
return new a(a.Mode.NUMERIC, c.length, d);
|
|
731
|
+
}
|
|
732
|
+
static makeAlphanumeric(c) {
|
|
733
|
+
if (!a.isAlphanumeric(c)) throw new RangeError("String contains unencodable characters in alphanumeric mode");
|
|
734
|
+
let d, h = [];
|
|
735
|
+
for (d = 0; d + 2 <= c.length; d += 2) {
|
|
736
|
+
let l = 45 * a.ALPHANUMERIC_CHARSET.indexOf(c.charAt(d));
|
|
737
|
+
l += a.ALPHANUMERIC_CHARSET.indexOf(c.charAt(d + 1)), n(l, 11, h);
|
|
738
|
+
}
|
|
739
|
+
return d < c.length && n(a.ALPHANUMERIC_CHARSET.indexOf(c.charAt(d)), 6, h), new a(a.Mode.ALPHANUMERIC, c.length, h);
|
|
740
|
+
}
|
|
741
|
+
static makeSegments(c) {
|
|
742
|
+
return c == "" ? [] : a.isNumeric(c) ? [a.makeNumeric(c)] : a.isAlphanumeric(c) ? [a.makeAlphanumeric(c)] : [a.makeBytes(a.toUtf8ByteArray(c))];
|
|
743
|
+
}
|
|
744
|
+
static makeEci(c) {
|
|
745
|
+
let d = [];
|
|
746
|
+
if (c < 0) throw new RangeError("ECI assignment value out of range");
|
|
747
|
+
if (c < 128) n(c, 8, d);
|
|
748
|
+
else if (c < 16384) n(2, 2, d), n(c, 14, d);
|
|
749
749
|
else {
|
|
750
|
-
if (!(
|
|
751
|
-
n(6, 3,
|
|
750
|
+
if (!(c < 1e6)) throw new RangeError("ECI assignment value out of range");
|
|
751
|
+
n(6, 3, d), n(c, 21, d);
|
|
752
752
|
}
|
|
753
|
-
return new a(a.Mode.ECI, 0,
|
|
753
|
+
return new a(a.Mode.ECI, 0, d);
|
|
754
754
|
}
|
|
755
|
-
static isNumeric(
|
|
756
|
-
return a.NUMERIC_REGEX.test(
|
|
755
|
+
static isNumeric(c) {
|
|
756
|
+
return a.NUMERIC_REGEX.test(c);
|
|
757
757
|
}
|
|
758
|
-
static isAlphanumeric(
|
|
759
|
-
return a.ALPHANUMERIC_REGEX.test(
|
|
758
|
+
static isAlphanumeric(c) {
|
|
759
|
+
return a.ALPHANUMERIC_REGEX.test(c);
|
|
760
760
|
}
|
|
761
761
|
getData() {
|
|
762
762
|
return this.bitData.slice();
|
|
763
763
|
}
|
|
764
|
-
static getTotalBits(
|
|
764
|
+
static getTotalBits(c, d) {
|
|
765
765
|
let h = 0;
|
|
766
|
-
for (const l of
|
|
767
|
-
const _ = l.mode.numCharCountBits(
|
|
766
|
+
for (const l of c) {
|
|
767
|
+
const _ = l.mode.numCharCountBits(d);
|
|
768
768
|
if (l.numChars >= 1 << _) return 1 / 0;
|
|
769
769
|
h += 4 + _ + l.bitData.length;
|
|
770
770
|
}
|
|
771
771
|
return h;
|
|
772
772
|
}
|
|
773
|
-
static toUtf8ByteArray(
|
|
774
|
-
|
|
775
|
-
let
|
|
776
|
-
for (let h = 0; h <
|
|
777
|
-
return
|
|
773
|
+
static toUtf8ByteArray(c) {
|
|
774
|
+
c = encodeURI(c);
|
|
775
|
+
let d = [];
|
|
776
|
+
for (let h = 0; h < c.length; h++) c.charAt(h) != "%" ? d.push(c.charCodeAt(h)) : (d.push(parseInt(c.substr(h + 1, 2), 16)), h += 2);
|
|
777
|
+
return d;
|
|
778
778
|
}
|
|
779
779
|
};
|
|
780
780
|
let o = a;
|
|
@@ -816,12 +816,12 @@ var kf = function() {
|
|
|
816
816
|
return !0;
|
|
817
817
|
}();
|
|
818
818
|
function Xn(e) {
|
|
819
|
-
const t = e, { value: r, size: n = _f, level: i = wf, bgColor: s = xf, fgColor: a = Af, includeMargin: o = Sf, style:
|
|
819
|
+
const t = e, { value: r, size: n = _f, level: i = wf, bgColor: s = xf, fgColor: a = Af, includeMargin: o = Sf, style: c, imageSettings: d } = t, h = ((k, O) => {
|
|
820
820
|
var E = {};
|
|
821
821
|
for (var R in k) qd.call(k, R) && O.indexOf(R) < 0 && (E[R] = k[R]);
|
|
822
822
|
if (k != null && ds) for (var R of ds(k)) O.indexOf(R) < 0 && Ud.call(k, R) && (E[R] = k[R]);
|
|
823
823
|
return E;
|
|
824
|
-
})(t, ["value", "size", "level", "bgColor", "fgColor", "includeMargin", "style", "imageSettings"]), l =
|
|
824
|
+
})(t, ["value", "size", "level", "bgColor", "fgColor", "includeMargin", "style", "imageSettings"]), l = d == null ? void 0 : d.src, _ = Br.useRef(null), v = Br.useRef(null), [A, I] = Br.useState(!1);
|
|
825
825
|
Br.useEffect(() => {
|
|
826
826
|
if (_.current != null) {
|
|
827
827
|
const E = _.current, R = E.getContext("2d");
|
|
@@ -836,7 +836,7 @@ function Xn(e) {
|
|
|
836
836
|
mt = { x: Ut, y: lt, w: Math.ceil(D + Et - Ut), h: Math.ceil(G + ot - lt) };
|
|
837
837
|
}
|
|
838
838
|
return { x: Et, y: ot, h: G, w: D, excavation: mt };
|
|
839
|
-
}(L, n, o,
|
|
839
|
+
}(L, n, o, d), g = v.current, m = p != null && g !== null && g.complete && g.naturalHeight !== 0 && g.naturalWidth !== 0;
|
|
840
840
|
m && p.excavation != null && (k = L, O = p.excavation, L = k.slice().map((w, P) => P < O.y || P >= O.y + O.h ? w : w.map((N, j) => (j < O.x || j >= O.x + O.w) && N)));
|
|
841
841
|
const u = window.devicePixelRatio || 1;
|
|
842
842
|
E.height = E.width = n * u;
|
|
@@ -864,7 +864,7 @@ function Xn(e) {
|
|
|
864
864
|
}), Br.useEffect(() => {
|
|
865
865
|
I(!1);
|
|
866
866
|
}, [l]);
|
|
867
|
-
const x = Da({ height: n, width: n },
|
|
867
|
+
const x = Da({ height: n, width: n }, c);
|
|
868
868
|
let M = null;
|
|
869
869
|
return l != null && (M = Br.createElement("img", { src: l, key: l, style: { display: "none" }, onLoad: () => {
|
|
870
870
|
I(!0);
|
|
@@ -883,7 +883,7 @@ const bi = "userInfo", yi = "YYYY-MM-DD HH:mm:ss", E3 = () => {
|
|
|
883
883
|
}
|
|
884
884
|
}, []), Ze(() => {
|
|
885
885
|
if (r && r.expire.type !== "NONE") {
|
|
886
|
-
const { type: a, seconds: o } = r.expire,
|
|
886
|
+
const { type: a, seconds: o } = r.expire, c = mi().add(o, "seconds").format(yi), d = mi(r.issuedDateTime).add(o, "seconds").format(yi), h = a === "EXTEND" ? c : d;
|
|
887
887
|
s(h), mi().format(yi) > h && (localStorage.removeItem(bi), window.location.reload());
|
|
888
888
|
}
|
|
889
889
|
}, [r]), { userInfo: { address: (r == null ? void 0 : r.address) ?? void 0, network: (r == null ? void 0 : r.network) ?? void 0, nickName: (r == null ? void 0 : r.nickName) ?? void 0, token: (r == null ? void 0 : r.token) ?? void 0, issuedDateTime: (r == null ? void 0 : r.issuedDateTime) ?? void 0, expireDateTime: i }, logout: () => {
|
|
@@ -924,7 +924,7 @@ function Qt() {
|
|
|
924
924
|
var k;
|
|
925
925
|
return x.prototype = M, k = new x(), x.prototype = null, k;
|
|
926
926
|
};
|
|
927
|
-
}(), a = {}, o = a.lib = {},
|
|
927
|
+
}(), a = {}, o = a.lib = {}, c = o.Base = { extend: function(x) {
|
|
928
928
|
var M = s(this);
|
|
929
929
|
return x && M.mixIn(x), M.hasOwnProperty("init") && this.init !== M.init || (M.init = function() {
|
|
930
930
|
M.$super.init.apply(this, arguments);
|
|
@@ -938,7 +938,7 @@ function Qt() {
|
|
|
938
938
|
x.hasOwnProperty("toString") && (this.toString = x.toString);
|
|
939
939
|
}, clone: function() {
|
|
940
940
|
return this.init.prototype.extend(this);
|
|
941
|
-
} },
|
|
941
|
+
} }, d = o.WordArray = c.extend({ init: function(x, M) {
|
|
942
942
|
x = this.words = x || [], this.sigBytes = M != r ? M : 4 * x.length;
|
|
943
943
|
}, toString: function(x) {
|
|
944
944
|
return (x || l).stringify(this);
|
|
@@ -954,11 +954,11 @@ function Qt() {
|
|
|
954
954
|
var x = this.words, M = this.sigBytes;
|
|
955
955
|
x[M >>> 2] &= 4294967295 << 32 - M % 4 * 8, x.length = t.ceil(M / 4);
|
|
956
956
|
}, clone: function() {
|
|
957
|
-
var x =
|
|
957
|
+
var x = c.clone.call(this);
|
|
958
958
|
return x.words = this.words.slice(0), x;
|
|
959
959
|
}, random: function(x) {
|
|
960
960
|
for (var M = [], k = 0; k < x; k += 4) M.push(i());
|
|
961
|
-
return new
|
|
961
|
+
return new d.init(M, x);
|
|
962
962
|
} }), h = a.enc = {}, l = h.Hex = { stringify: function(x) {
|
|
963
963
|
for (var M = x.words, k = x.sigBytes, O = [], E = 0; E < k; E++) {
|
|
964
964
|
var R = M[E >>> 2] >>> 24 - E % 4 * 8 & 255;
|
|
@@ -967,7 +967,7 @@ function Qt() {
|
|
|
967
967
|
return O.join("");
|
|
968
968
|
}, parse: function(x) {
|
|
969
969
|
for (var M = x.length, k = [], O = 0; O < M; O += 2) k[O >>> 3] |= parseInt(x.substr(O, 2), 16) << 24 - O % 8 * 4;
|
|
970
|
-
return new
|
|
970
|
+
return new d.init(k, M / 2);
|
|
971
971
|
} }, _ = h.Latin1 = { stringify: function(x) {
|
|
972
972
|
for (var M = x.words, k = x.sigBytes, O = [], E = 0; E < k; E++) {
|
|
973
973
|
var R = M[E >>> 2] >>> 24 - E % 4 * 8 & 255;
|
|
@@ -976,7 +976,7 @@ function Qt() {
|
|
|
976
976
|
return O.join("");
|
|
977
977
|
}, parse: function(x) {
|
|
978
978
|
for (var M = x.length, k = [], O = 0; O < M; O++) k[O >>> 2] |= (255 & x.charCodeAt(O)) << 24 - O % 4 * 8;
|
|
979
|
-
return new
|
|
979
|
+
return new d.init(k, M);
|
|
980
980
|
} }, v = h.Utf8 = { stringify: function(x) {
|
|
981
981
|
try {
|
|
982
982
|
return decodeURIComponent(escape(_.stringify(x)));
|
|
@@ -985,8 +985,8 @@ function Qt() {
|
|
|
985
985
|
}
|
|
986
986
|
}, parse: function(x) {
|
|
987
987
|
return _.parse(unescape(encodeURIComponent(x)));
|
|
988
|
-
} }, A = o.BufferedBlockAlgorithm =
|
|
989
|
-
this._data = new
|
|
988
|
+
} }, A = o.BufferedBlockAlgorithm = c.extend({ reset: function() {
|
|
989
|
+
this._data = new d.init(), this._nDataBytes = 0;
|
|
990
990
|
}, _append: function(x) {
|
|
991
991
|
typeof x == "string" && (x = v.parse(x)), this._data.concat(x), this._nDataBytes += x.sigBytes;
|
|
992
992
|
}, _process: function(x) {
|
|
@@ -995,12 +995,12 @@ function Qt() {
|
|
|
995
995
|
for (var p = 0; p < z; p += R) this._doProcessBlock(O, p);
|
|
996
996
|
M = O.splice(0, z), k.sigBytes -= f;
|
|
997
997
|
}
|
|
998
|
-
return new
|
|
998
|
+
return new d.init(M, f);
|
|
999
999
|
}, clone: function() {
|
|
1000
|
-
var x =
|
|
1000
|
+
var x = c.clone.call(this);
|
|
1001
1001
|
return x._data = this._data.clone(), x;
|
|
1002
1002
|
}, _minBufferSize: 0 });
|
|
1003
|
-
o.Hasher = A.extend({ cfg:
|
|
1003
|
+
o.Hasher = A.extend({ cfg: c.extend(), init: function(x) {
|
|
1004
1004
|
this.cfg = this.cfg.extend(x), this.reset();
|
|
1005
1005
|
}, reset: function() {
|
|
1006
1006
|
A.reset.call(this), this._doReset();
|
|
@@ -1028,18 +1028,18 @@ function fs() {
|
|
|
1028
1028
|
return Va || (Va = 1, Ka.exports = function(e) {
|
|
1029
1029
|
return function(t) {
|
|
1030
1030
|
var r = e, n = r.lib, i = n.Base, s = n.WordArray, a = r.x64 = {};
|
|
1031
|
-
a.Word = i.extend({ init: function(o,
|
|
1032
|
-
this.high = o, this.low =
|
|
1033
|
-
} }), a.WordArray = i.extend({ init: function(o,
|
|
1034
|
-
o = this.words = o || [], this.sigBytes =
|
|
1031
|
+
a.Word = i.extend({ init: function(o, c) {
|
|
1032
|
+
this.high = o, this.low = c;
|
|
1033
|
+
} }), a.WordArray = i.extend({ init: function(o, c) {
|
|
1034
|
+
o = this.words = o || [], this.sigBytes = c != t ? c : 8 * o.length;
|
|
1035
1035
|
}, toX32: function() {
|
|
1036
|
-
for (var o = this.words,
|
|
1036
|
+
for (var o = this.words, c = o.length, d = [], h = 0; h < c; h++) {
|
|
1037
1037
|
var l = o[h];
|
|
1038
|
-
|
|
1038
|
+
d.push(l.high), d.push(l.low);
|
|
1039
1039
|
}
|
|
1040
|
-
return s.create(
|
|
1040
|
+
return s.create(d, this.sigBytes);
|
|
1041
1041
|
}, clone: function() {
|
|
1042
|
-
for (var o = i.clone.call(this),
|
|
1042
|
+
for (var o = i.clone.call(this), c = o.words = this.words.slice(0), d = c.length, h = 0; h < d; h++) c[h] = c[h].clone();
|
|
1043
1043
|
return o;
|
|
1044
1044
|
} });
|
|
1045
1045
|
}(), e;
|
|
@@ -1070,22 +1070,22 @@ function Mf() {
|
|
|
1070
1070
|
return s << 8 & 4278255360 | s >>> 8 & 16711935;
|
|
1071
1071
|
}
|
|
1072
1072
|
n.Utf16 = n.Utf16BE = { stringify: function(s) {
|
|
1073
|
-
for (var a = s.words, o = s.sigBytes,
|
|
1074
|
-
var h = a[
|
|
1075
|
-
|
|
1073
|
+
for (var a = s.words, o = s.sigBytes, c = [], d = 0; d < o; d += 2) {
|
|
1074
|
+
var h = a[d >>> 2] >>> 16 - d % 4 * 8 & 65535;
|
|
1075
|
+
c.push(String.fromCharCode(h));
|
|
1076
1076
|
}
|
|
1077
|
-
return
|
|
1077
|
+
return c.join("");
|
|
1078
1078
|
}, parse: function(s) {
|
|
1079
|
-
for (var a = s.length, o = [],
|
|
1079
|
+
for (var a = s.length, o = [], c = 0; c < a; c++) o[c >>> 1] |= s.charCodeAt(c) << 16 - c % 2 * 16;
|
|
1080
1080
|
return r.create(o, 2 * a);
|
|
1081
1081
|
} }, n.Utf16LE = { stringify: function(s) {
|
|
1082
|
-
for (var a = s.words, o = s.sigBytes,
|
|
1083
|
-
var h = i(a[
|
|
1084
|
-
|
|
1082
|
+
for (var a = s.words, o = s.sigBytes, c = [], d = 0; d < o; d += 2) {
|
|
1083
|
+
var h = i(a[d >>> 2] >>> 16 - d % 4 * 8 & 65535);
|
|
1084
|
+
c.push(String.fromCharCode(h));
|
|
1085
1085
|
}
|
|
1086
|
-
return
|
|
1086
|
+
return c.join("");
|
|
1087
1087
|
}, parse: function(s) {
|
|
1088
|
-
for (var a = s.length, o = [],
|
|
1088
|
+
for (var a = s.length, o = [], c = 0; c < a; c++) o[c >>> 1] |= i(s.charCodeAt(c) << 16 - c % 2 * 16);
|
|
1089
1089
|
return r.create(o, 2 * a);
|
|
1090
1090
|
} };
|
|
1091
1091
|
}(), e.enc.Utf16;
|
|
@@ -1097,28 +1097,28 @@ function un() {
|
|
|
1097
1097
|
return function() {
|
|
1098
1098
|
var t = e, r = t.lib.WordArray;
|
|
1099
1099
|
function n(i, s, a) {
|
|
1100
|
-
for (var o = [],
|
|
1101
|
-
var h = a[i.charCodeAt(
|
|
1102
|
-
o[
|
|
1100
|
+
for (var o = [], c = 0, d = 0; d < s; d++) if (d % 4) {
|
|
1101
|
+
var h = a[i.charCodeAt(d - 1)] << d % 4 * 2 | a[i.charCodeAt(d)] >>> 6 - d % 4 * 2;
|
|
1102
|
+
o[c >>> 2] |= h << 24 - c % 4 * 8, c++;
|
|
1103
1103
|
}
|
|
1104
|
-
return r.create(o,
|
|
1104
|
+
return r.create(o, c);
|
|
1105
1105
|
}
|
|
1106
1106
|
t.enc.Base64 = { stringify: function(i) {
|
|
1107
1107
|
var s = i.words, a = i.sigBytes, o = this._map;
|
|
1108
1108
|
i.clamp();
|
|
1109
|
-
for (var
|
|
1109
|
+
for (var c = [], d = 0; d < a; d += 3) for (var h = (s[d >>> 2] >>> 24 - d % 4 * 8 & 255) << 16 | (s[d + 1 >>> 2] >>> 24 - (d + 1) % 4 * 8 & 255) << 8 | s[d + 2 >>> 2] >>> 24 - (d + 2) % 4 * 8 & 255, l = 0; l < 4 && d + 0.75 * l < a; l++) c.push(o.charAt(h >>> 6 * (3 - l) & 63));
|
|
1110
1110
|
var _ = o.charAt(64);
|
|
1111
|
-
if (_) for (;
|
|
1112
|
-
return
|
|
1111
|
+
if (_) for (; c.length % 4; ) c.push(_);
|
|
1112
|
+
return c.join("");
|
|
1113
1113
|
}, parse: function(i) {
|
|
1114
1114
|
var s = i.length, a = this._map, o = this._reverseMap;
|
|
1115
1115
|
if (!o) {
|
|
1116
1116
|
o = this._reverseMap = [];
|
|
1117
|
-
for (var
|
|
1117
|
+
for (var c = 0; c < a.length; c++) o[a.charCodeAt(c)] = c;
|
|
1118
1118
|
}
|
|
1119
|
-
var
|
|
1120
|
-
if (
|
|
1121
|
-
var h = i.indexOf(
|
|
1119
|
+
var d = a.charAt(64);
|
|
1120
|
+
if (d) {
|
|
1121
|
+
var h = i.indexOf(d);
|
|
1122
1122
|
h !== -1 && (s = h);
|
|
1123
1123
|
}
|
|
1124
1124
|
return n(i, s, o);
|
|
@@ -1132,33 +1132,33 @@ function If() {
|
|
|
1132
1132
|
return function() {
|
|
1133
1133
|
var t = e, r = t.lib.WordArray;
|
|
1134
1134
|
function n(i, s, a) {
|
|
1135
|
-
for (var o = [],
|
|
1136
|
-
var h = a[i.charCodeAt(
|
|
1137
|
-
o[
|
|
1135
|
+
for (var o = [], c = 0, d = 0; d < s; d++) if (d % 4) {
|
|
1136
|
+
var h = a[i.charCodeAt(d - 1)] << d % 4 * 2 | a[i.charCodeAt(d)] >>> 6 - d % 4 * 2;
|
|
1137
|
+
o[c >>> 2] |= h << 24 - c % 4 * 8, c++;
|
|
1138
1138
|
}
|
|
1139
|
-
return r.create(o,
|
|
1139
|
+
return r.create(o, c);
|
|
1140
1140
|
}
|
|
1141
1141
|
t.enc.Base64url = { stringify: function(i, s) {
|
|
1142
1142
|
s === void 0 && (s = !0);
|
|
1143
|
-
var a = i.words, o = i.sigBytes,
|
|
1143
|
+
var a = i.words, o = i.sigBytes, c = s ? this._safe_map : this._map;
|
|
1144
1144
|
i.clamp();
|
|
1145
|
-
for (var
|
|
1146
|
-
var v =
|
|
1147
|
-
if (v) for (;
|
|
1148
|
-
return
|
|
1145
|
+
for (var d = [], h = 0; h < o; h += 3) for (var l = (a[h >>> 2] >>> 24 - h % 4 * 8 & 255) << 16 | (a[h + 1 >>> 2] >>> 24 - (h + 1) % 4 * 8 & 255) << 8 | a[h + 2 >>> 2] >>> 24 - (h + 2) % 4 * 8 & 255, _ = 0; _ < 4 && h + 0.75 * _ < o; _++) d.push(c.charAt(l >>> 6 * (3 - _) & 63));
|
|
1146
|
+
var v = c.charAt(64);
|
|
1147
|
+
if (v) for (; d.length % 4; ) d.push(v);
|
|
1148
|
+
return d.join("");
|
|
1149
1149
|
}, parse: function(i, s) {
|
|
1150
1150
|
s === void 0 && (s = !0);
|
|
1151
|
-
var a = i.length, o = s ? this._safe_map : this._map,
|
|
1152
|
-
if (!
|
|
1153
|
-
|
|
1154
|
-
for (var
|
|
1151
|
+
var a = i.length, o = s ? this._safe_map : this._map, c = this._reverseMap;
|
|
1152
|
+
if (!c) {
|
|
1153
|
+
c = this._reverseMap = [];
|
|
1154
|
+
for (var d = 0; d < o.length; d++) c[o.charCodeAt(d)] = d;
|
|
1155
1155
|
}
|
|
1156
1156
|
var h = o.charAt(64);
|
|
1157
1157
|
if (h) {
|
|
1158
1158
|
var l = i.indexOf(h);
|
|
1159
1159
|
l !== -1 && (a = l);
|
|
1160
1160
|
}
|
|
1161
|
-
return n(i, a,
|
|
1161
|
+
return n(i, a, c);
|
|
1162
1162
|
}, _map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", _safe_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_" };
|
|
1163
1163
|
}(), e.enc.Base64url;
|
|
1164
1164
|
}(Qt())), ec.exports;
|
|
@@ -1171,7 +1171,7 @@ function ln() {
|
|
|
1171
1171
|
(function() {
|
|
1172
1172
|
for (var v = 0; v < 64; v++) o[v] = 4294967296 * t.abs(t.sin(v + 1)) | 0;
|
|
1173
1173
|
})();
|
|
1174
|
-
var
|
|
1174
|
+
var c = a.MD5 = s.extend({ _doReset: function() {
|
|
1175
1175
|
this._hash = new i.init([1732584193, 4023233417, 2562383102, 271733878]);
|
|
1176
1176
|
}, _doProcessBlock: function(v, A) {
|
|
1177
1177
|
for (var I = 0; I < 16; I++) {
|
|
@@ -1179,7 +1179,7 @@ function ln() {
|
|
|
1179
1179
|
v[x] = 16711935 & (M << 8 | M >>> 24) | 4278255360 & (M << 24 | M >>> 8);
|
|
1180
1180
|
}
|
|
1181
1181
|
var k = this._hash.words, O = v[A + 0], E = v[A + 1], R = v[A + 2], L = v[A + 3], z = v[A + 4], f = v[A + 5], p = v[A + 6], g = v[A + 7], m = v[A + 8], u = v[A + 9], y = v[A + 10], w = v[A + 11], P = v[A + 12], N = v[A + 13], j = v[A + 14], Z = v[A + 15], $ = k[0], V = k[1], H = k[2], D = k[3];
|
|
1182
|
-
$ =
|
|
1182
|
+
$ = d($, V, H, D, O, 7, o[0]), D = d(D, $, V, H, E, 12, o[1]), H = d(H, D, $, V, R, 17, o[2]), V = d(V, H, D, $, L, 22, o[3]), $ = d($, V, H, D, z, 7, o[4]), D = d(D, $, V, H, f, 12, o[5]), H = d(H, D, $, V, p, 17, o[6]), V = d(V, H, D, $, g, 22, o[7]), $ = d($, V, H, D, m, 7, o[8]), D = d(D, $, V, H, u, 12, o[9]), H = d(H, D, $, V, y, 17, o[10]), V = d(V, H, D, $, w, 22, o[11]), $ = d($, V, H, D, P, 7, o[12]), D = d(D, $, V, H, N, 12, o[13]), H = d(H, D, $, V, j, 17, o[14]), $ = h($, V = d(V, H, D, $, Z, 22, o[15]), H, D, E, 5, o[16]), D = h(D, $, V, H, p, 9, o[17]), H = h(H, D, $, V, w, 14, o[18]), V = h(V, H, D, $, O, 20, o[19]), $ = h($, V, H, D, f, 5, o[20]), D = h(D, $, V, H, y, 9, o[21]), H = h(H, D, $, V, Z, 14, o[22]), V = h(V, H, D, $, z, 20, o[23]), $ = h($, V, H, D, u, 5, o[24]), D = h(D, $, V, H, j, 9, o[25]), H = h(H, D, $, V, L, 14, o[26]), V = h(V, H, D, $, m, 20, o[27]), $ = h($, V, H, D, N, 5, o[28]), D = h(D, $, V, H, R, 9, o[29]), H = h(H, D, $, V, g, 14, o[30]), $ = l($, V = h(V, H, D, $, P, 20, o[31]), H, D, f, 4, o[32]), D = l(D, $, V, H, m, 11, o[33]), H = l(H, D, $, V, w, 16, o[34]), V = l(V, H, D, $, j, 23, o[35]), $ = l($, V, H, D, E, 4, o[36]), D = l(D, $, V, H, z, 11, o[37]), H = l(H, D, $, V, g, 16, o[38]), V = l(V, H, D, $, y, 23, o[39]), $ = l($, V, H, D, N, 4, o[40]), D = l(D, $, V, H, O, 11, o[41]), H = l(H, D, $, V, L, 16, o[42]), V = l(V, H, D, $, p, 23, o[43]), $ = l($, V, H, D, u, 4, o[44]), D = l(D, $, V, H, P, 11, o[45]), H = l(H, D, $, V, Z, 16, o[46]), $ = _($, V = l(V, H, D, $, R, 23, o[47]), H, D, O, 6, o[48]), D = _(D, $, V, H, g, 10, o[49]), H = _(H, D, $, V, j, 15, o[50]), V = _(V, H, D, $, f, 21, o[51]), $ = _($, V, H, D, P, 6, o[52]), D = _(D, $, V, H, L, 10, o[53]), H = _(H, D, $, V, y, 15, o[54]), V = _(V, H, D, $, E, 21, o[55]), $ = _($, V, H, D, m, 6, o[56]), D = _(D, $, V, H, Z, 10, o[57]), H = _(H, D, $, V, p, 15, o[58]), V = _(V, H, D, $, N, 21, o[59]), $ = _($, V, H, D, z, 6, o[60]), D = _(D, $, V, H, w, 10, o[61]), H = _(H, D, $, V, R, 15, o[62]), V = _(V, H, D, $, u, 21, o[63]), k[0] = k[0] + $ | 0, k[1] = k[1] + V | 0, k[2] = k[2] + H | 0, k[3] = k[3] + D | 0;
|
|
1183
1183
|
}, _doFinalize: function() {
|
|
1184
1184
|
var v = this._data, A = v.words, I = 8 * this._nDataBytes, x = 8 * v.sigBytes;
|
|
1185
1185
|
A[x >>> 5] |= 128 << 24 - x % 32;
|
|
@@ -1194,7 +1194,7 @@ function ln() {
|
|
|
1194
1194
|
var v = s.clone.call(this);
|
|
1195
1195
|
return v._hash = this._hash.clone(), v;
|
|
1196
1196
|
} });
|
|
1197
|
-
function
|
|
1197
|
+
function d(v, A, I, x, M, k, O) {
|
|
1198
1198
|
var E = v + (A & I | ~A & x) + M + O;
|
|
1199
1199
|
return (E << k | E >>> 32 - k) + A;
|
|
1200
1200
|
}
|
|
@@ -1210,7 +1210,7 @@ function ln() {
|
|
|
1210
1210
|
var E = v + (I ^ (A | ~x)) + M + O;
|
|
1211
1211
|
return (E << k | E >>> 32 - k) + A;
|
|
1212
1212
|
}
|
|
1213
|
-
r.MD5 = s._createHelper(
|
|
1213
|
+
r.MD5 = s._createHelper(c), r.HmacMD5 = s._createHmacHelper(c);
|
|
1214
1214
|
}(Math), e.MD5;
|
|
1215
1215
|
}(Qt())), nc.exports;
|
|
1216
1216
|
}
|
|
@@ -1220,9 +1220,9 @@ function Fd() {
|
|
|
1220
1220
|
return function() {
|
|
1221
1221
|
var t = e, r = t.lib, n = r.WordArray, i = r.Hasher, s = t.algo, a = [], o = s.SHA1 = i.extend({ _doReset: function() {
|
|
1222
1222
|
this._hash = new n.init([1732584193, 4023233417, 2562383102, 271733878, 3285377520]);
|
|
1223
|
-
}, _doProcessBlock: function(
|
|
1223
|
+
}, _doProcessBlock: function(c, d) {
|
|
1224
1224
|
for (var h = this._hash.words, l = h[0], _ = h[1], v = h[2], A = h[3], I = h[4], x = 0; x < 80; x++) {
|
|
1225
|
-
if (x < 16) a[x] = 0 | d
|
|
1225
|
+
if (x < 16) a[x] = 0 | c[d + x];
|
|
1226
1226
|
else {
|
|
1227
1227
|
var M = a[x - 3] ^ a[x - 8] ^ a[x - 14] ^ a[x - 16];
|
|
1228
1228
|
a[x] = M << 1 | M >>> 31;
|
|
@@ -1232,11 +1232,11 @@ function Fd() {
|
|
|
1232
1232
|
}
|
|
1233
1233
|
h[0] = h[0] + l | 0, h[1] = h[1] + _ | 0, h[2] = h[2] + v | 0, h[3] = h[3] + A | 0, h[4] = h[4] + I | 0;
|
|
1234
1234
|
}, _doFinalize: function() {
|
|
1235
|
-
var
|
|
1236
|
-
return
|
|
1235
|
+
var c = this._data, d = c.words, h = 8 * this._nDataBytes, l = 8 * c.sigBytes;
|
|
1236
|
+
return d[l >>> 5] |= 128 << 24 - l % 32, d[14 + (l + 64 >>> 9 << 4)] = Math.floor(h / 4294967296), d[15 + (l + 64 >>> 9 << 4)] = h, c.sigBytes = 4 * d.length, this._process(), this._hash;
|
|
1237
1237
|
}, clone: function() {
|
|
1238
|
-
var
|
|
1239
|
-
return
|
|
1238
|
+
var c = i.clone.call(this);
|
|
1239
|
+
return c._hash = this._hash.clone(), c;
|
|
1240
1240
|
} });
|
|
1241
1241
|
t.SHA1 = i._createHelper(o), t.HmacSHA1 = i._createHmacHelper(o);
|
|
1242
1242
|
}(), e.SHA1;
|
|
@@ -1246,7 +1246,7 @@ var oc, ac = { exports: {} };
|
|
|
1246
1246
|
function Vs() {
|
|
1247
1247
|
return oc || (oc = 1, ac.exports = function(e) {
|
|
1248
1248
|
return function(t) {
|
|
1249
|
-
var r = e, n = r.lib, i = n.WordArray, s = n.Hasher, a = r.algo, o = [],
|
|
1249
|
+
var r = e, n = r.lib, i = n.WordArray, s = n.Hasher, a = r.algo, o = [], c = [];
|
|
1250
1250
|
(function() {
|
|
1251
1251
|
function l(I) {
|
|
1252
1252
|
for (var x = t.sqrt(I), M = 2; M <= x; M++) if (!(I % M)) return !1;
|
|
@@ -1255,18 +1255,18 @@ function Vs() {
|
|
|
1255
1255
|
function _(I) {
|
|
1256
1256
|
return 4294967296 * (I - (0 | I)) | 0;
|
|
1257
1257
|
}
|
|
1258
|
-
for (var v = 2, A = 0; A < 64; ) l(v) && (A < 8 && (o[A] = _(t.pow(v, 0.5))),
|
|
1258
|
+
for (var v = 2, A = 0; A < 64; ) l(v) && (A < 8 && (o[A] = _(t.pow(v, 0.5))), c[A] = _(t.pow(v, 1 / 3)), A++), v++;
|
|
1259
1259
|
})();
|
|
1260
|
-
var
|
|
1260
|
+
var d = [], h = a.SHA256 = s.extend({ _doReset: function() {
|
|
1261
1261
|
this._hash = new i.init(o.slice(0));
|
|
1262
1262
|
}, _doProcessBlock: function(l, _) {
|
|
1263
1263
|
for (var v = this._hash.words, A = v[0], I = v[1], x = v[2], M = v[3], k = v[4], O = v[5], E = v[6], R = v[7], L = 0; L < 64; L++) {
|
|
1264
|
-
if (L < 16)
|
|
1264
|
+
if (L < 16) d[L] = 0 | l[_ + L];
|
|
1265
1265
|
else {
|
|
1266
|
-
var z =
|
|
1267
|
-
|
|
1266
|
+
var z = d[L - 15], f = (z << 25 | z >>> 7) ^ (z << 14 | z >>> 18) ^ z >>> 3, p = d[L - 2], g = (p << 15 | p >>> 17) ^ (p << 13 | p >>> 19) ^ p >>> 10;
|
|
1267
|
+
d[L] = f + d[L - 7] + g + d[L - 16];
|
|
1268
1268
|
}
|
|
1269
|
-
var m = A & I ^ A & x ^ I & x, u = (A << 30 | A >>> 2) ^ (A << 19 | A >>> 13) ^ (A << 10 | A >>> 22), y = R + ((k << 26 | k >>> 6) ^ (k << 21 | k >>> 11) ^ (k << 7 | k >>> 25)) + (k & O ^ ~k & E) +
|
|
1269
|
+
var m = A & I ^ A & x ^ I & x, u = (A << 30 | A >>> 2) ^ (A << 19 | A >>> 13) ^ (A << 10 | A >>> 22), y = R + ((k << 26 | k >>> 6) ^ (k << 21 | k >>> 11) ^ (k << 7 | k >>> 25)) + (k & O ^ ~k & E) + c[L] + d[L];
|
|
1270
1270
|
R = E, E = O, O = k, k = M + y | 0, M = x, x = I, I = A, A = y + (u + m) | 0;
|
|
1271
1271
|
}
|
|
1272
1272
|
v[0] = v[0] + A | 0, v[1] = v[1] + I | 0, v[2] = v[2] + x | 0, v[3] = v[3] + M | 0, v[4] = v[4] + k | 0, v[5] = v[5] + O | 0, v[6] = v[6] + E | 0, v[7] = v[7] + R | 0;
|
|
@@ -1289,21 +1289,21 @@ function hc() {
|
|
|
1289
1289
|
function o() {
|
|
1290
1290
|
return i.create.apply(i, arguments);
|
|
1291
1291
|
}
|
|
1292
|
-
var
|
|
1292
|
+
var c = [o(1116352408, 3609767458), o(1899447441, 602891725), o(3049323471, 3964484399), o(3921009573, 2173295548), o(961987163, 4081628472), o(1508970993, 3053834265), o(2453635748, 2937671579), o(2870763221, 3664609560), o(3624381080, 2734883394), o(310598401, 1164996542), o(607225278, 1323610764), o(1426881987, 3590304994), o(1925078388, 4068182383), o(2162078206, 991336113), o(2614888103, 633803317), o(3248222580, 3479774868), o(3835390401, 2666613458), o(4022224774, 944711139), o(264347078, 2341262773), o(604807628, 2007800933), o(770255983, 1495990901), o(1249150122, 1856431235), o(1555081692, 3175218132), o(1996064986, 2198950837), o(2554220882, 3999719339), o(2821834349, 766784016), o(2952996808, 2566594879), o(3210313671, 3203337956), o(3336571891, 1034457026), o(3584528711, 2466948901), o(113926993, 3758326383), o(338241895, 168717936), o(666307205, 1188179964), o(773529912, 1546045734), o(1294757372, 1522805485), o(1396182291, 2643833823), o(1695183700, 2343527390), o(1986661051, 1014477480), o(2177026350, 1206759142), o(2456956037, 344077627), o(2730485921, 1290863460), o(2820302411, 3158454273), o(3259730800, 3505952657), o(3345764771, 106217008), o(3516065817, 3606008344), o(3600352804, 1432725776), o(4094571909, 1467031594), o(275423344, 851169720), o(430227734, 3100823752), o(506948616, 1363258195), o(659060556, 3750685593), o(883997877, 3785050280), o(958139571, 3318307427), o(1322822218, 3812723403), o(1537002063, 2003034995), o(1747873779, 3602036899), o(1955562222, 1575990012), o(2024104815, 1125592928), o(2227730452, 2716904306), o(2361852424, 442776044), o(2428436474, 593698344), o(2756734187, 3733110249), o(3204031479, 2999351573), o(3329325298, 3815920427), o(3391569614, 3928383900), o(3515267271, 566280711), o(3940187606, 3454069534), o(4118630271, 4000239992), o(116418474, 1914138554), o(174292421, 2731055270), o(289380356, 3203993006), o(460393269, 320620315), o(685471733, 587496836), o(852142971, 1086792851), o(1017036298, 365543100), o(1126000580, 2618297676), o(1288033470, 3409855158), o(1501505948, 4234509866), o(1607167915, 987167468), o(1816402316, 1246189591)], d = [];
|
|
1293
1293
|
(function() {
|
|
1294
|
-
for (var l = 0; l < 80; l++)
|
|
1294
|
+
for (var l = 0; l < 80; l++) d[l] = o();
|
|
1295
1295
|
})();
|
|
1296
1296
|
var h = a.SHA512 = r.extend({ _doReset: function() {
|
|
1297
1297
|
this._hash = new s.init([new i.init(1779033703, 4089235720), new i.init(3144134277, 2227873595), new i.init(1013904242, 4271175723), new i.init(2773480762, 1595750129), new i.init(1359893119, 2917565137), new i.init(2600822924, 725511199), new i.init(528734635, 4215389547), new i.init(1541459225, 327033209)]);
|
|
1298
1298
|
}, _doProcessBlock: function(l, _) {
|
|
1299
1299
|
for (var v = this._hash.words, A = v[0], I = v[1], x = v[2], M = v[3], k = v[4], O = v[5], E = v[6], R = v[7], L = A.high, z = A.low, f = I.high, p = I.low, g = x.high, m = x.low, u = M.high, y = M.low, w = k.high, P = k.low, N = O.high, j = O.low, Z = E.high, $ = E.low, V = R.high, H = R.low, D = L, G = z, Et = f, ot = p, mt = g, Ut = m, lt = u, kt = y, Ft = w, Lt = P, se = N, Ke = j, Wt = Z, te = $, Or = V, oe = H, Zt = 0; Zt < 80; Zt++) {
|
|
1300
|
-
var De, ne, ae =
|
|
1300
|
+
var De, ne, ae = d[Zt];
|
|
1301
1301
|
if (Zt < 16) ne = ae.high = 0 | l[_ + 2 * Zt], De = ae.low = 0 | l[_ + 2 * Zt + 1];
|
|
1302
1302
|
else {
|
|
1303
|
-
var Cr =
|
|
1303
|
+
var Cr = d[Zt - 15], ie = Cr.high, ce = Cr.low, Zr = (ie >>> 1 | ce << 31) ^ (ie >>> 8 | ce << 24) ^ ie >>> 7, de = (ce >>> 1 | ie << 31) ^ (ce >>> 8 | ie << 24) ^ (ce >>> 7 | ie << 25), ee = d[Zt - 2], Be = ee.high, re = ee.low, le = (Be >>> 19 | re << 13) ^ (Be << 3 | re >>> 29) ^ Be >>> 6, Ae = (re >>> 19 | Be << 13) ^ (re << 3 | Be >>> 29) ^ (re >>> 6 | Be << 26), he = d[Zt - 7], T = he.high, C = he.low, B = d[Zt - 16], b = B.high, S = B.low;
|
|
1304
1304
|
ne = (ne = (ne = Zr + T + ((De = de + C) >>> 0 < de >>> 0 ? 1 : 0)) + le + ((De += Ae) >>> 0 < Ae >>> 0 ? 1 : 0)) + b + ((De += S) >>> 0 < S >>> 0 ? 1 : 0), ae.high = ne, ae.low = De;
|
|
1305
1305
|
}
|
|
1306
|
-
var U, F = Ft & se ^ ~Ft & Wt, W = Lt & Ke ^ ~Lt & te, q = D & Et ^ D & mt ^ Et & mt, Y = G & ot ^ G & Ut ^ ot & Ut, gt = (D >>> 28 | G << 4) ^ (D << 30 | G >>> 2) ^ (D << 25 | G >>> 7), X = (G >>> 28 | D << 4) ^ (G << 30 | D >>> 2) ^ (G << 25 | D >>> 7), dt = (Ft >>> 14 | Lt << 18) ^ (Ft >>> 18 | Lt << 14) ^ (Ft << 23 | Lt >>> 9), _t = (Lt >>> 14 | Ft << 18) ^ (Lt >>> 18 | Ft << 14) ^ (Lt << 23 | Ft >>> 9), nt =
|
|
1306
|
+
var U, F = Ft & se ^ ~Ft & Wt, W = Lt & Ke ^ ~Lt & te, q = D & Et ^ D & mt ^ Et & mt, Y = G & ot ^ G & Ut ^ ot & Ut, gt = (D >>> 28 | G << 4) ^ (D << 30 | G >>> 2) ^ (D << 25 | G >>> 7), X = (G >>> 28 | D << 4) ^ (G << 30 | D >>> 2) ^ (G << 25 | D >>> 7), dt = (Ft >>> 14 | Lt << 18) ^ (Ft >>> 18 | Lt << 14) ^ (Ft << 23 | Lt >>> 9), _t = (Lt >>> 14 | Ft << 18) ^ (Lt >>> 18 | Ft << 14) ^ (Lt << 23 | Ft >>> 9), nt = c[Zt], ht = nt.high, xt = nt.low, at = Or + dt + ((U = oe + _t) >>> 0 < oe >>> 0 ? 1 : 0), ut = X + Y;
|
|
1307
1307
|
Or = Wt, oe = te, Wt = se, te = Ke, se = Ft, Ke = Lt, Ft = lt + (at = (at = (at = at + F + ((U += W) >>> 0 < W >>> 0 ? 1 : 0)) + ht + ((U += xt) >>> 0 < xt >>> 0 ? 1 : 0)) + ne + ((U += De) >>> 0 < De >>> 0 ? 1 : 0)) + ((Lt = kt + U | 0) >>> 0 < kt >>> 0 ? 1 : 0) | 0, lt = mt, kt = Ut, mt = Et, Ut = ot, Et = D, ot = G, D = at + (gt + q + (ut >>> 0 < X >>> 0 ? 1 : 0)) + ((G = U + ut | 0) >>> 0 < U >>> 0 ? 1 : 0) | 0;
|
|
1308
1308
|
}
|
|
1309
1309
|
z = A.low = z + G, A.high = L + D + (z >>> 0 < G >>> 0 ? 1 : 0), p = I.low = p + ot, I.high = f + Et + (p >>> 0 < ot >>> 0 ? 1 : 0), m = x.low = m + Ut, x.high = g + mt + (m >>> 0 < Ut >>> 0 ? 1 : 0), y = M.low = y + kt, M.high = u + lt + (y >>> 0 < kt >>> 0 ? 1 : 0), P = k.low = P + Lt, k.high = w + Ft + (P >>> 0 < Lt >>> 0 ? 1 : 0), j = O.low = j + Ke, O.high = N + se + (j >>> 0 < Ke >>> 0 ? 1 : 0), $ = E.low = $ + te, E.high = Z + Wt + ($ >>> 0 < te >>> 0 ? 1 : 0), H = R.low = H + oe, R.high = V + Or + (H >>> 0 < oe >>> 0 ? 1 : 0);
|
|
@@ -1322,14 +1322,14 @@ var uc, Rf = { exports: {} }, lc, pc = { exports: {} };
|
|
|
1322
1322
|
function Nf() {
|
|
1323
1323
|
return lc || (lc = 1, pc.exports = function(e) {
|
|
1324
1324
|
return function(t) {
|
|
1325
|
-
var r = e, n = r.lib, i = n.WordArray, s = n.Hasher, a = r.x64.Word, o = r.algo,
|
|
1325
|
+
var r = e, n = r.lib, i = n.WordArray, s = n.Hasher, a = r.x64.Word, o = r.algo, c = [], d = [], h = [];
|
|
1326
1326
|
(function() {
|
|
1327
1327
|
for (var v = 1, A = 0, I = 0; I < 24; I++) {
|
|
1328
|
-
|
|
1328
|
+
c[v + 5 * A] = (I + 1) * (I + 2) / 2 % 64;
|
|
1329
1329
|
var x = (2 * v + 3 * A) % 5;
|
|
1330
1330
|
v = A % 5, A = x;
|
|
1331
1331
|
}
|
|
1332
|
-
for (v = 0; v < 5; v++) for (A = 0; A < 5; A++)
|
|
1332
|
+
for (v = 0; v < 5; v++) for (A = 0; A < 5; A++) d[v + 5 * A] = A + (2 * v + 3 * A) % 5 * 5;
|
|
1333
1333
|
for (var M = 1, k = 0; k < 24; k++) {
|
|
1334
1334
|
for (var O = 0, E = 0, R = 0; R < 7; R++) {
|
|
1335
1335
|
if (1 & M) {
|
|
@@ -1364,9 +1364,9 @@ function Nf() {
|
|
|
1364
1364
|
for (L = g.high ^ (u << 1 | y >>> 31), z = g.low ^ (y << 1 | u >>> 31), f = 0; f < 5; f++) (H = I[R + 5 * f]).high ^= L, H.low ^= z;
|
|
1365
1365
|
}
|
|
1366
1366
|
for (var w = 1; w < 25; w++) {
|
|
1367
|
-
var P = (H = I[w]).high, N = H.low, j =
|
|
1367
|
+
var P = (H = I[w]).high, N = H.low, j = c[w];
|
|
1368
1368
|
j < 32 ? (L = P << j | N >>> 32 - j, z = N << j | P >>> 32 - j) : (L = N << j - 32 | P >>> 64 - j, z = P << j - 32 | N >>> 64 - j);
|
|
1369
|
-
var Z = l[
|
|
1369
|
+
var Z = l[d[w]];
|
|
1370
1370
|
Z.high = L, Z.low = z;
|
|
1371
1371
|
}
|
|
1372
1372
|
var $ = l[0], V = I[0];
|
|
@@ -1405,8 +1405,8 @@ function go() {
|
|
|
1405
1405
|
i = this._hasher = new i.init(), typeof s == "string" && (s = n.parse(s));
|
|
1406
1406
|
var a = i.blockSize, o = 4 * a;
|
|
1407
1407
|
s.sigBytes > o && (s = i.finalize(s)), s.clamp();
|
|
1408
|
-
for (var
|
|
1409
|
-
|
|
1408
|
+
for (var c = this._oKey = s.clone(), d = this._iKey = s.clone(), h = c.words, l = d.words, _ = 0; _ < a; _++) h[_] ^= 1549556828, l[_] ^= 909522486;
|
|
1409
|
+
c.sigBytes = d.sigBytes = o, this.reset();
|
|
1410
1410
|
}, reset: function() {
|
|
1411
1411
|
var i = this._hasher;
|
|
1412
1412
|
i.reset(), i.update(this._iKey);
|
|
@@ -1423,18 +1423,18 @@ var gc, Cf = { exports: {} }, vc, _c = { exports: {} };
|
|
|
1423
1423
|
function Jr() {
|
|
1424
1424
|
return vc || (vc = 1, _c.exports = function(e) {
|
|
1425
1425
|
return function() {
|
|
1426
|
-
var t = e, r = t.lib, n = r.Base, i = r.WordArray, s = t.algo, a = s.MD5, o = s.EvpKDF = n.extend({ cfg: n.extend({ keySize: 4, hasher: a, iterations: 1 }), init: function(
|
|
1427
|
-
this.cfg = this.cfg.extend(
|
|
1428
|
-
}, compute: function(
|
|
1426
|
+
var t = e, r = t.lib, n = r.Base, i = r.WordArray, s = t.algo, a = s.MD5, o = s.EvpKDF = n.extend({ cfg: n.extend({ keySize: 4, hasher: a, iterations: 1 }), init: function(c) {
|
|
1427
|
+
this.cfg = this.cfg.extend(c);
|
|
1428
|
+
}, compute: function(c, d) {
|
|
1429
1429
|
for (var h, l = this.cfg, _ = l.hasher.create(), v = i.create(), A = v.words, I = l.keySize, x = l.iterations; A.length < I; ) {
|
|
1430
|
-
h && _.update(h), h = _.update(
|
|
1430
|
+
h && _.update(h), h = _.update(c).finalize(d), _.reset();
|
|
1431
1431
|
for (var M = 1; M < x; M++) h = _.finalize(h), _.reset();
|
|
1432
1432
|
v.concat(h);
|
|
1433
1433
|
}
|
|
1434
1434
|
return v.sigBytes = 4 * I, v;
|
|
1435
1435
|
} });
|
|
1436
|
-
t.EvpKDF = function(
|
|
1437
|
-
return o.create(h).compute(
|
|
1436
|
+
t.EvpKDF = function(c, d, h) {
|
|
1437
|
+
return o.create(h).compute(c, d);
|
|
1438
1438
|
};
|
|
1439
1439
|
}(), e.EvpKDF;
|
|
1440
1440
|
}(Qt(), Fd(), go())), _c.exports;
|
|
@@ -1445,7 +1445,7 @@ function Te() {
|
|
|
1445
1445
|
e.lib.Cipher || function(t) {
|
|
1446
1446
|
var r = e, n = r.lib, i = n.Base, s = n.WordArray, a = n.BufferedBlockAlgorithm, o = r.enc;
|
|
1447
1447
|
o.Utf8;
|
|
1448
|
-
var
|
|
1448
|
+
var c = o.Base64, d = r.algo.EvpKDF, h = n.Cipher = a.extend({ cfg: i.extend(), createEncryptor: function(E, R) {
|
|
1449
1449
|
return this.create(this._ENC_XFORM_MODE, E, R);
|
|
1450
1450
|
}, createDecryptor: function(E, R) {
|
|
1451
1451
|
return this.create(this._DEC_XFORM_MODE, E, R);
|
|
@@ -1517,9 +1517,9 @@ function Te() {
|
|
|
1517
1517
|
return (E || this.formatter).stringify(this);
|
|
1518
1518
|
} }), x = (r.format = {}).OpenSSL = { stringify: function(E) {
|
|
1519
1519
|
var R = E.ciphertext, L = E.salt;
|
|
1520
|
-
return (L ? s.create([1398893684, 1701076831]).concat(L).concat(R) : R).toString(
|
|
1520
|
+
return (L ? s.create([1398893684, 1701076831]).concat(L).concat(R) : R).toString(c);
|
|
1521
1521
|
}, parse: function(E) {
|
|
1522
|
-
var R, L =
|
|
1522
|
+
var R, L = c.parse(E), z = L.words;
|
|
1523
1523
|
return z[0] == 1398893684 && z[1] == 1701076831 && (R = s.create(z.slice(2, 4)), z.splice(0, 4), L.sigBytes -= 16), I.create({ ciphertext: L, salt: R });
|
|
1524
1524
|
} }, M = n.SerializableCipher = i.extend({ cfg: i.extend({ format: x }), encrypt: function(E, R, L, z) {
|
|
1525
1525
|
z = this.cfg.extend(z);
|
|
@@ -1530,8 +1530,8 @@ function Te() {
|
|
|
1530
1530
|
}, _parse: function(E, R) {
|
|
1531
1531
|
return typeof E == "string" ? R.parse(E, this) : E;
|
|
1532
1532
|
} }), k = (r.kdf = {}).OpenSSL = { execute: function(E, R, L, z, f) {
|
|
1533
|
-
if (z || (z = s.random(8)), f) p =
|
|
1534
|
-
else var p =
|
|
1533
|
+
if (z || (z = s.random(8)), f) p = d.create({ keySize: R + L, hasher: f }).compute(E, z);
|
|
1534
|
+
else var p = d.create({ keySize: R + L }).compute(E, z);
|
|
1535
1535
|
var g = s.create(p.words.slice(R), 4 * L);
|
|
1536
1536
|
return p.sigBytes = 4 * R, I.create({ key: p, iv: g, salt: z });
|
|
1537
1537
|
} }, O = n.PasswordBasedCipher = M.extend({ cfg: M.cfg.extend({ kdf: k }), encrypt: function(E, R, L, z) {
|
|
@@ -1553,9 +1553,9 @@ function Bf() {
|
|
|
1553
1553
|
return e.mode.CFB = function() {
|
|
1554
1554
|
var t = e.lib.BlockCipherMode.extend();
|
|
1555
1555
|
function r(n, i, s, a) {
|
|
1556
|
-
var o,
|
|
1557
|
-
|
|
1558
|
-
for (var
|
|
1556
|
+
var o, c = this._iv;
|
|
1557
|
+
c ? (o = c.slice(0), this._iv = void 0) : o = this._prevBlock, a.encryptBlock(o, 0);
|
|
1558
|
+
for (var d = 0; d < s; d++) n[i + d] ^= o[d];
|
|
1559
1559
|
}
|
|
1560
1560
|
return t.Encryptor = t.extend({ processBlock: function(n, i) {
|
|
1561
1561
|
var s = this._cipher, a = s.blockSize;
|
|
@@ -1571,11 +1571,11 @@ var kc, Ec = { exports: {} };
|
|
|
1571
1571
|
function Pf() {
|
|
1572
1572
|
return kc || (kc = 1, Ec.exports = function(e) {
|
|
1573
1573
|
return e.mode.CTR = (t = e.lib.BlockCipherMode.extend(), r = t.Encryptor = t.extend({ processBlock: function(n, i) {
|
|
1574
|
-
var s = this._cipher, a = s.blockSize, o = this._iv,
|
|
1575
|
-
o && (
|
|
1576
|
-
var
|
|
1577
|
-
s.encryptBlock(
|
|
1578
|
-
for (var h = 0; h < a; h++) n[i + h] ^=
|
|
1574
|
+
var s = this._cipher, a = s.blockSize, o = this._iv, c = this._counter;
|
|
1575
|
+
o && (c = this._counter = o.slice(0), this._iv = void 0);
|
|
1576
|
+
var d = c.slice(0);
|
|
1577
|
+
s.encryptBlock(d, 0), c[a - 1] = c[a - 1] + 1 | 0;
|
|
1578
|
+
for (var h = 0; h < a; h++) n[i + h] ^= d[h];
|
|
1579
1579
|
} }), t.Decryptor = r, t), e.mode.CTR;
|
|
1580
1580
|
var t, r;
|
|
1581
1581
|
}(Qt(), Te())), Ec.exports;
|
|
@@ -1593,8 +1593,8 @@ function Lf() {
|
|
|
1593
1593
|
function r(s) {
|
|
1594
1594
|
if (255 & ~(s >> 24)) s += 1 << 24;
|
|
1595
1595
|
else {
|
|
1596
|
-
var a = s >> 16 & 255, o = s >> 8 & 255,
|
|
1597
|
-
a === 255 ? (a = 0, o === 255 ? (o = 0,
|
|
1596
|
+
var a = s >> 16 & 255, o = s >> 8 & 255, c = 255 & s;
|
|
1597
|
+
a === 255 ? (a = 0, o === 255 ? (o = 0, c === 255 ? c = 0 : ++c) : ++o) : ++a, s = 0, s += a << 16, s += o << 8, s += c;
|
|
1598
1598
|
}
|
|
1599
1599
|
return s;
|
|
1600
1600
|
}
|
|
@@ -1602,11 +1602,11 @@ function Lf() {
|
|
|
1602
1602
|
return (s[0] = r(s[0])) === 0 && (s[1] = r(s[1])), s;
|
|
1603
1603
|
}
|
|
1604
1604
|
var i = t.Encryptor = t.extend({ processBlock: function(s, a) {
|
|
1605
|
-
var o = this._cipher,
|
|
1606
|
-
|
|
1605
|
+
var o = this._cipher, c = o.blockSize, d = this._iv, h = this._counter;
|
|
1606
|
+
d && (h = this._counter = d.slice(0), this._iv = void 0), n(h);
|
|
1607
1607
|
var l = h.slice(0);
|
|
1608
1608
|
o.encryptBlock(l, 0);
|
|
1609
|
-
for (var _ = 0; _ <
|
|
1609
|
+
for (var _ = 0; _ < c; _++) s[a + _] ^= l[_];
|
|
1610
1610
|
} });
|
|
1611
1611
|
return t.Decryptor = i, t;
|
|
1612
1612
|
}(), e.mode.CTRGladman;
|
|
@@ -1616,9 +1616,9 @@ var Tc, Rc = { exports: {} };
|
|
|
1616
1616
|
function jf() {
|
|
1617
1617
|
return Tc || (Tc = 1, Rc.exports = function(e) {
|
|
1618
1618
|
return e.mode.OFB = (t = e.lib.BlockCipherMode.extend(), r = t.Encryptor = t.extend({ processBlock: function(n, i) {
|
|
1619
|
-
var s = this._cipher, a = s.blockSize, o = this._iv,
|
|
1620
|
-
o && (
|
|
1621
|
-
for (var
|
|
1619
|
+
var s = this._cipher, a = s.blockSize, o = this._iv, c = this._keystream;
|
|
1620
|
+
o && (c = this._keystream = o.slice(0), this._iv = void 0), s.encryptBlock(c, 0);
|
|
1621
|
+
for (var d = 0; d < a; d++) n[i + d] ^= c[d];
|
|
1622
1622
|
} }), t.Decryptor = r, t), e.mode.OFB;
|
|
1623
1623
|
var t, r;
|
|
1624
1624
|
}(Qt(), Te())), Rc.exports;
|
|
@@ -1627,13 +1627,13 @@ var Nc, zf = { exports: {} }, Oc, $f = { exports: {} }, Cc, qf = { exports: {} }
|
|
|
1627
1627
|
function Vf() {
|
|
1628
1628
|
return $c || ($c = 1, qc.exports = function(e) {
|
|
1629
1629
|
return function() {
|
|
1630
|
-
var t = e, r = t.lib, n = r.WordArray, i = r.BlockCipher, s = t.algo, a = [57, 49, 41, 33, 25, 17, 9, 1, 58, 50, 42, 34, 26, 18, 10, 2, 59, 51, 43, 35, 27, 19, 11, 3, 60, 52, 44, 36, 63, 55, 47, 39, 31, 23, 15, 7, 62, 54, 46, 38, 30, 22, 14, 6, 61, 53, 45, 37, 29, 21, 13, 5, 28, 20, 12, 4], o = [14, 17, 11, 24, 1, 5, 3, 28, 15, 6, 21, 10, 23, 19, 12, 4, 26, 8, 16, 7, 27, 20, 13, 2, 41, 52, 31, 37, 47, 55, 30, 40, 51, 45, 33, 48, 44, 49, 39, 56, 34, 53, 46, 42, 50, 36, 29, 32],
|
|
1630
|
+
var t = e, r = t.lib, n = r.WordArray, i = r.BlockCipher, s = t.algo, a = [57, 49, 41, 33, 25, 17, 9, 1, 58, 50, 42, 34, 26, 18, 10, 2, 59, 51, 43, 35, 27, 19, 11, 3, 60, 52, 44, 36, 63, 55, 47, 39, 31, 23, 15, 7, 62, 54, 46, 38, 30, 22, 14, 6, 61, 53, 45, 37, 29, 21, 13, 5, 28, 20, 12, 4], o = [14, 17, 11, 24, 1, 5, 3, 28, 15, 6, 21, 10, 23, 19, 12, 4, 26, 8, 16, 7, 27, 20, 13, 2, 41, 52, 31, 37, 47, 55, 30, 40, 51, 45, 33, 48, 44, 49, 39, 56, 34, 53, 46, 42, 50, 36, 29, 32], c = [1, 2, 4, 6, 8, 10, 12, 14, 15, 17, 19, 21, 23, 25, 27, 28], d = [{ 0: 8421888, 268435456: 32768, 536870912: 8421378, 805306368: 2, 1073741824: 512, 1342177280: 8421890, 1610612736: 8389122, 1879048192: 8388608, 2147483648: 514, 2415919104: 8389120, 2684354560: 33280, 2952790016: 8421376, 3221225472: 32770, 3489660928: 8388610, 3758096384: 0, 4026531840: 33282, 134217728: 0, 402653184: 8421890, 671088640: 33282, 939524096: 32768, 1207959552: 8421888, 1476395008: 512, 1744830464: 8421378, 2013265920: 2, 2281701376: 8389120, 2550136832: 33280, 2818572288: 8421376, 3087007744: 8389122, 3355443200: 8388610, 3623878656: 32770, 3892314112: 514, 4160749568: 8388608, 1: 32768, 268435457: 2, 536870913: 8421888, 805306369: 8388608, 1073741825: 8421378, 1342177281: 33280, 1610612737: 512, 1879048193: 8389122, 2147483649: 8421890, 2415919105: 8421376, 2684354561: 8388610, 2952790017: 33282, 3221225473: 514, 3489660929: 8389120, 3758096385: 32770, 4026531841: 0, 134217729: 8421890, 402653185: 8421376, 671088641: 8388608, 939524097: 512, 1207959553: 32768, 1476395009: 8388610, 1744830465: 2, 2013265921: 33282, 2281701377: 32770, 2550136833: 8389122, 2818572289: 514, 3087007745: 8421888, 3355443201: 8389120, 3623878657: 0, 3892314113: 33280, 4160749569: 8421378 }, { 0: 1074282512, 16777216: 16384, 33554432: 524288, 50331648: 1074266128, 67108864: 1073741840, 83886080: 1074282496, 100663296: 1073758208, 117440512: 16, 134217728: 540672, 150994944: 1073758224, 167772160: 1073741824, 184549376: 540688, 201326592: 524304, 218103808: 0, 234881024: 16400, 251658240: 1074266112, 8388608: 1073758208, 25165824: 540688, 41943040: 16, 58720256: 1073758224, 75497472: 1074282512, 92274688: 1073741824, 109051904: 524288, 125829120: 1074266128, 142606336: 524304, 159383552: 0, 176160768: 16384, 192937984: 1074266112, 209715200: 1073741840, 226492416: 540672, 243269632: 1074282496, 260046848: 16400, 268435456: 0, 285212672: 1074266128, 301989888: 1073758224, 318767104: 1074282496, 335544320: 1074266112, 352321536: 16, 369098752: 540688, 385875968: 16384, 402653184: 16400, 419430400: 524288, 436207616: 524304, 452984832: 1073741840, 469762048: 540672, 486539264: 1073758208, 503316480: 1073741824, 520093696: 1074282512, 276824064: 540688, 293601280: 524288, 310378496: 1074266112, 327155712: 16384, 343932928: 1073758208, 360710144: 1074282512, 377487360: 16, 394264576: 1073741824, 411041792: 1074282496, 427819008: 1073741840, 444596224: 1073758224, 461373440: 524304, 478150656: 0, 494927872: 16400, 511705088: 1074266128, 528482304: 540672 }, { 0: 260, 1048576: 0, 2097152: 67109120, 3145728: 65796, 4194304: 65540, 5242880: 67108868, 6291456: 67174660, 7340032: 67174400, 8388608: 67108864, 9437184: 67174656, 10485760: 65792, 11534336: 67174404, 12582912: 67109124, 13631488: 65536, 14680064: 4, 15728640: 256, 524288: 67174656, 1572864: 67174404, 2621440: 0, 3670016: 67109120, 4718592: 67108868, 5767168: 65536, 6815744: 65540, 7864320: 260, 8912896: 4, 9961472: 256, 11010048: 67174400, 12058624: 65796, 13107200: 65792, 14155776: 67109124, 15204352: 67174660, 16252928: 67108864, 16777216: 67174656, 17825792: 65540, 18874368: 65536, 19922944: 67109120, 20971520: 256, 22020096: 67174660, 23068672: 67108868, 24117248: 0, 25165824: 67109124, 26214400: 67108864, 27262976: 4, 28311552: 65792, 29360128: 67174400, 30408704: 260, 31457280: 65796, 32505856: 67174404, 17301504: 67108864, 18350080: 260, 19398656: 67174656, 20447232: 0, 21495808: 65540, 22544384: 67109120, 23592960: 256, 24641536: 67174404, 25690112: 65536, 26738688: 67174660, 27787264: 65796, 28835840: 67108868, 29884416: 67109124, 30932992: 67174400, 31981568: 4, 33030144: 65792 }, { 0: 2151682048, 65536: 2147487808, 131072: 4198464, 196608: 2151677952, 262144: 0, 327680: 4198400, 393216: 2147483712, 458752: 4194368, 524288: 2147483648, 589824: 4194304, 655360: 64, 720896: 2147487744, 786432: 2151678016, 851968: 4160, 917504: 4096, 983040: 2151682112, 32768: 2147487808, 98304: 64, 163840: 2151678016, 229376: 2147487744, 294912: 4198400, 360448: 2151682112, 425984: 0, 491520: 2151677952, 557056: 4096, 622592: 2151682048, 688128: 4194304, 753664: 4160, 819200: 2147483648, 884736: 4194368, 950272: 4198464, 1015808: 2147483712, 1048576: 4194368, 1114112: 4198400, 1179648: 2147483712, 1245184: 0, 1310720: 4160, 1376256: 2151678016, 1441792: 2151682048, 1507328: 2147487808, 1572864: 2151682112, 1638400: 2147483648, 1703936: 2151677952, 1769472: 4198464, 1835008: 2147487744, 1900544: 4194304, 1966080: 64, 2031616: 4096, 1081344: 2151677952, 1146880: 2151682112, 1212416: 0, 1277952: 4198400, 1343488: 4194368, 1409024: 2147483648, 1474560: 2147487808, 1540096: 64, 1605632: 2147483712, 1671168: 4096, 1736704: 2147487744, 1802240: 2151678016, 1867776: 4160, 1933312: 2151682048, 1998848: 4194304, 2064384: 4198464 }, { 0: 128, 4096: 17039360, 8192: 262144, 12288: 536870912, 16384: 537133184, 20480: 16777344, 24576: 553648256, 28672: 262272, 32768: 16777216, 36864: 537133056, 40960: 536871040, 45056: 553910400, 49152: 553910272, 53248: 0, 57344: 17039488, 61440: 553648128, 2048: 17039488, 6144: 553648256, 10240: 128, 14336: 17039360, 18432: 262144, 22528: 537133184, 26624: 553910272, 30720: 536870912, 34816: 537133056, 38912: 0, 43008: 553910400, 47104: 16777344, 51200: 536871040, 55296: 553648128, 59392: 16777216, 63488: 262272, 65536: 262144, 69632: 128, 73728: 536870912, 77824: 553648256, 81920: 16777344, 86016: 553910272, 90112: 537133184, 94208: 16777216, 98304: 553910400, 102400: 553648128, 106496: 17039360, 110592: 537133056, 114688: 262272, 118784: 536871040, 122880: 0, 126976: 17039488, 67584: 553648256, 71680: 16777216, 75776: 17039360, 79872: 537133184, 83968: 536870912, 88064: 17039488, 92160: 128, 96256: 553910272, 100352: 262272, 104448: 553910400, 108544: 0, 112640: 553648128, 116736: 16777344, 120832: 262144, 124928: 537133056, 129024: 536871040 }, { 0: 268435464, 256: 8192, 512: 270532608, 768: 270540808, 1024: 268443648, 1280: 2097152, 1536: 2097160, 1792: 268435456, 2048: 0, 2304: 268443656, 2560: 2105344, 2816: 8, 3072: 270532616, 3328: 2105352, 3584: 8200, 3840: 270540800, 128: 270532608, 384: 270540808, 640: 8, 896: 2097152, 1152: 2105352, 1408: 268435464, 1664: 268443648, 1920: 8200, 2176: 2097160, 2432: 8192, 2688: 268443656, 2944: 270532616, 3200: 0, 3456: 270540800, 3712: 2105344, 3968: 268435456, 4096: 268443648, 4352: 270532616, 4608: 270540808, 4864: 8200, 5120: 2097152, 5376: 268435456, 5632: 268435464, 5888: 2105344, 6144: 2105352, 6400: 0, 6656: 8, 6912: 270532608, 7168: 8192, 7424: 268443656, 7680: 270540800, 7936: 2097160, 4224: 8, 4480: 2105344, 4736: 2097152, 4992: 268435464, 5248: 268443648, 5504: 8200, 5760: 270540808, 6016: 270532608, 6272: 270540800, 6528: 270532616, 6784: 8192, 7040: 2105352, 7296: 2097160, 7552: 0, 7808: 268435456, 8064: 268443656 }, { 0: 1048576, 16: 33555457, 32: 1024, 48: 1049601, 64: 34604033, 80: 0, 96: 1, 112: 34603009, 128: 33555456, 144: 1048577, 160: 33554433, 176: 34604032, 192: 34603008, 208: 1025, 224: 1049600, 240: 33554432, 8: 34603009, 24: 0, 40: 33555457, 56: 34604032, 72: 1048576, 88: 33554433, 104: 33554432, 120: 1025, 136: 1049601, 152: 33555456, 168: 34603008, 184: 1048577, 200: 1024, 216: 34604033, 232: 1, 248: 1049600, 256: 33554432, 272: 1048576, 288: 33555457, 304: 34603009, 320: 1048577, 336: 33555456, 352: 34604032, 368: 1049601, 384: 1025, 400: 34604033, 416: 1049600, 432: 1, 448: 0, 464: 34603008, 480: 33554433, 496: 1024, 264: 1049600, 280: 33555457, 296: 34603009, 312: 1, 328: 33554432, 344: 1048576, 360: 1025, 376: 34604032, 392: 33554433, 408: 34603008, 424: 0, 440: 34604033, 456: 1049601, 472: 1024, 488: 33555456, 504: 1048577 }, { 0: 134219808, 1: 131072, 2: 134217728, 3: 32, 4: 131104, 5: 134350880, 6: 134350848, 7: 2048, 8: 134348800, 9: 134219776, 10: 133120, 11: 134348832, 12: 2080, 13: 0, 14: 134217760, 15: 133152, 2147483648: 2048, 2147483649: 134350880, 2147483650: 134219808, 2147483651: 134217728, 2147483652: 134348800, 2147483653: 133120, 2147483654: 133152, 2147483655: 32, 2147483656: 134217760, 2147483657: 2080, 2147483658: 131104, 2147483659: 134350848, 2147483660: 0, 2147483661: 134348832, 2147483662: 134219776, 2147483663: 131072, 16: 133152, 17: 134350848, 18: 32, 19: 2048, 20: 134219776, 21: 134217760, 22: 134348832, 23: 131072, 24: 0, 25: 131104, 26: 134348800, 27: 134219808, 28: 134350880, 29: 133120, 30: 2080, 31: 134217728, 2147483664: 131072, 2147483665: 2048, 2147483666: 134348832, 2147483667: 133152, 2147483668: 32, 2147483669: 134348800, 2147483670: 134217728, 2147483671: 134219808, 2147483672: 134350880, 2147483673: 134217760, 2147483674: 134219776, 2147483675: 0, 2147483676: 133120, 2147483677: 2080, 2147483678: 131104, 2147483679: 134350848 }], h = [4160749569, 528482304, 33030144, 2064384, 129024, 8064, 504, 2147483679], l = s.DES = i.extend({ _doReset: function() {
|
|
1631
1631
|
for (var I = this._key.words, x = [], M = 0; M < 56; M++) {
|
|
1632
1632
|
var k = a[M] - 1;
|
|
1633
1633
|
x[M] = I[k >>> 5] >>> 31 - k % 32 & 1;
|
|
1634
1634
|
}
|
|
1635
1635
|
for (var O = this._subKeys = [], E = 0; E < 16; E++) {
|
|
1636
|
-
var R = O[E] = [], L =
|
|
1636
|
+
var R = O[E] = [], L = c[E];
|
|
1637
1637
|
for (M = 0; M < 24; M++) R[M / 6 | 0] |= x[(o[M] - 1 + L) % 28] << 31 - M % 6, R[4 + (M / 6 | 0)] |= x[28 + (o[M + 24] - 1 + L) % 28] << 31 - M % 6;
|
|
1638
1638
|
for (R[0] = R[0] << 1 | R[0] >>> 31, M = 1; M < 7; M++) R[M] = R[M] >>> 4 * (M - 1) + 3;
|
|
1639
1639
|
R[7] = R[7] << 5 | R[7] >>> 27;
|
|
@@ -1647,7 +1647,7 @@ function Vf() {
|
|
|
1647
1647
|
}, _doCryptBlock: function(I, x, M) {
|
|
1648
1648
|
this._lBlock = I[x], this._rBlock = I[x + 1], _.call(this, 4, 252645135), _.call(this, 16, 65535), v.call(this, 2, 858993459), v.call(this, 8, 16711935), _.call(this, 1, 1431655765);
|
|
1649
1649
|
for (var k = 0; k < 16; k++) {
|
|
1650
|
-
for (var O = M[k], E = this._lBlock, R = this._rBlock, L = 0, z = 0; z < 8; z++) L |=
|
|
1650
|
+
for (var O = M[k], E = this._lBlock, R = this._rBlock, L = 0, z = 0; z < 8; z++) L |= d[z][((R ^ O[z]) & h[z]) >>> 0];
|
|
1651
1651
|
this._lBlock = R, this._rBlock = E ^ L;
|
|
1652
1652
|
}
|
|
1653
1653
|
var f = this._lBlock;
|
|
@@ -1683,18 +1683,18 @@ function Qf() {
|
|
|
1683
1683
|
var t = e, r = t.lib.BlockCipher, n = t.algo;
|
|
1684
1684
|
const i = 16, s = [608135816, 2242054355, 320440878, 57701188, 2752067618, 698298832, 137296536, 3964562569, 1160258022, 953160567, 3193202383, 887688300, 3232508343, 3380367581, 1065670069, 3041331479, 2450970073, 2306472731], a = [[3509652390, 2564797868, 805139163, 3491422135, 3101798381, 1780907670, 3128725573, 4046225305, 614570311, 3012652279, 134345442, 2240740374, 1667834072, 1901547113, 2757295779, 4103290238, 227898511, 1921955416, 1904987480, 2182433518, 2069144605, 3260701109, 2620446009, 720527379, 3318853667, 677414384, 3393288472, 3101374703, 2390351024, 1614419982, 1822297739, 2954791486, 3608508353, 3174124327, 2024746970, 1432378464, 3864339955, 2857741204, 1464375394, 1676153920, 1439316330, 715854006, 3033291828, 289532110, 2706671279, 2087905683, 3018724369, 1668267050, 732546397, 1947742710, 3462151702, 2609353502, 2950085171, 1814351708, 2050118529, 680887927, 999245976, 1800124847, 3300911131, 1713906067, 1641548236, 4213287313, 1216130144, 1575780402, 4018429277, 3917837745, 3693486850, 3949271944, 596196993, 3549867205, 258830323, 2213823033, 772490370, 2760122372, 1774776394, 2652871518, 566650946, 4142492826, 1728879713, 2882767088, 1783734482, 3629395816, 2517608232, 2874225571, 1861159788, 326777828, 3124490320, 2130389656, 2716951837, 967770486, 1724537150, 2185432712, 2364442137, 1164943284, 2105845187, 998989502, 3765401048, 2244026483, 1075463327, 1455516326, 1322494562, 910128902, 469688178, 1117454909, 936433444, 3490320968, 3675253459, 1240580251, 122909385, 2157517691, 634681816, 4142456567, 3825094682, 3061402683, 2540495037, 79693498, 3249098678, 1084186820, 1583128258, 426386531, 1761308591, 1047286709, 322548459, 995290223, 1845252383, 2603652396, 3431023940, 2942221577, 3202600964, 3727903485, 1712269319, 422464435, 3234572375, 1170764815, 3523960633, 3117677531, 1434042557, 442511882, 3600875718, 1076654713, 1738483198, 4213154764, 2393238008, 3677496056, 1014306527, 4251020053, 793779912, 2902807211, 842905082, 4246964064, 1395751752, 1040244610, 2656851899, 3396308128, 445077038, 3742853595, 3577915638, 679411651, 2892444358, 2354009459, 1767581616, 3150600392, 3791627101, 3102740896, 284835224, 4246832056, 1258075500, 768725851, 2589189241, 3069724005, 3532540348, 1274779536, 3789419226, 2764799539, 1660621633, 3471099624, 4011903706, 913787905, 3497959166, 737222580, 2514213453, 2928710040, 3937242737, 1804850592, 3499020752, 2949064160, 2386320175, 2390070455, 2415321851, 4061277028, 2290661394, 2416832540, 1336762016, 1754252060, 3520065937, 3014181293, 791618072, 3188594551, 3933548030, 2332172193, 3852520463, 3043980520, 413987798, 3465142937, 3030929376, 4245938359, 2093235073, 3534596313, 375366246, 2157278981, 2479649556, 555357303, 3870105701, 2008414854, 3344188149, 4221384143, 3956125452, 2067696032, 3594591187, 2921233993, 2428461, 544322398, 577241275, 1471733935, 610547355, 4027169054, 1432588573, 1507829418, 2025931657, 3646575487, 545086370, 48609733, 2200306550, 1653985193, 298326376, 1316178497, 3007786442, 2064951626, 458293330, 2589141269, 3591329599, 3164325604, 727753846, 2179363840, 146436021, 1461446943, 4069977195, 705550613, 3059967265, 3887724982, 4281599278, 3313849956, 1404054877, 2845806497, 146425753, 1854211946], [1266315497, 3048417604, 3681880366, 3289982499, 290971e4, 1235738493, 2632868024, 2414719590, 3970600049, 1771706367, 1449415276, 3266420449, 422970021, 1963543593, 2690192192, 3826793022, 1062508698, 1531092325, 1804592342, 2583117782, 2714934279, 4024971509, 1294809318, 4028980673, 1289560198, 2221992742, 1669523910, 35572830, 157838143, 1052438473, 1016535060, 1802137761, 1753167236, 1386275462, 3080475397, 2857371447, 1040679964, 2145300060, 2390574316, 1461121720, 2956646967, 4031777805, 4028374788, 33600511, 2920084762, 1018524850, 629373528, 3691585981, 3515945977, 2091462646, 2486323059, 586499841, 988145025, 935516892, 3367335476, 2599673255, 2839830854, 265290510, 3972581182, 2759138881, 3795373465, 1005194799, 847297441, 406762289, 1314163512, 1332590856, 1866599683, 4127851711, 750260880, 613907577, 1450815602, 3165620655, 3734664991, 3650291728, 3012275730, 3704569646, 1427272223, 778793252, 1343938022, 2676280711, 2052605720, 1946737175, 3164576444, 3914038668, 3967478842, 3682934266, 1661551462, 3294938066, 4011595847, 840292616, 3712170807, 616741398, 312560963, 711312465, 1351876610, 322626781, 1910503582, 271666773, 2175563734, 1594956187, 70604529, 3617834859, 1007753275, 1495573769, 4069517037, 2549218298, 2663038764, 504708206, 2263041392, 3941167025, 2249088522, 1514023603, 1998579484, 1312622330, 694541497, 2582060303, 2151582166, 1382467621, 776784248, 2618340202, 3323268794, 2497899128, 2784771155, 503983604, 4076293799, 907881277, 423175695, 432175456, 1378068232, 4145222326, 3954048622, 3938656102, 3820766613, 2793130115, 2977904593, 26017576, 3274890735, 3194772133, 1700274565, 1756076034, 4006520079, 3677328699, 720338349, 1533947780, 354530856, 688349552, 3973924725, 1637815568, 332179504, 3949051286, 53804574, 2852348879, 3044236432, 1282449977, 3583942155, 3416972820, 4006381244, 1617046695, 2628476075, 3002303598, 1686838959, 431878346, 2686675385, 1700445008, 1080580658, 1009431731, 832498133, 3223435511, 2605976345, 2271191193, 2516031870, 1648197032, 4164389018, 2548247927, 300782431, 375919233, 238389289, 3353747414, 2531188641, 2019080857, 1475708069, 455242339, 2609103871, 448939670, 3451063019, 1395535956, 2413381860, 1841049896, 1491858159, 885456874, 4264095073, 4001119347, 1565136089, 3898914787, 1108368660, 540939232, 1173283510, 2745871338, 3681308437, 4207628240, 3343053890, 4016749493, 1699691293, 1103962373, 3625875870, 2256883143, 3830138730, 1031889488, 3479347698, 1535977030, 4236805024, 3251091107, 2132092099, 1774941330, 1199868427, 1452454533, 157007616, 2904115357, 342012276, 595725824, 1480756522, 206960106, 497939518, 591360097, 863170706, 2375253569, 3596610801, 1814182875, 2094937945, 3421402208, 1082520231, 3463918190, 2785509508, 435703966, 3908032597, 1641649973, 2842273706, 3305899714, 1510255612, 2148256476, 2655287854, 3276092548, 4258621189, 236887753, 3681803219, 274041037, 1734335097, 3815195456, 3317970021, 1899903192, 1026095262, 4050517792, 356393447, 2410691914, 3873677099, 3682840055], [3913112168, 2491498743, 4132185628, 2489919796, 1091903735, 1979897079, 3170134830, 3567386728, 3557303409, 857797738, 1136121015, 1342202287, 507115054, 2535736646, 337727348, 3213592640, 1301675037, 2528481711, 1895095763, 1721773893, 3216771564, 62756741, 2142006736, 835421444, 2531993523, 1442658625, 3659876326, 2882144922, 676362277, 1392781812, 170690266, 3921047035, 1759253602, 3611846912, 1745797284, 664899054, 1329594018, 3901205900, 3045908486, 2062866102, 2865634940, 3543621612, 3464012697, 1080764994, 553557557, 3656615353, 3996768171, 991055499, 499776247, 1265440854, 648242737, 3940784050, 980351604, 3713745714, 1749149687, 3396870395, 4211799374, 3640570775, 1161844396, 3125318951, 1431517754, 545492359, 4268468663, 3499529547, 1437099964, 2702547544, 3433638243, 2581715763, 2787789398, 1060185593, 1593081372, 2418618748, 4260947970, 69676912, 2159744348, 86519011, 2512459080, 3838209314, 1220612927, 3339683548, 133810670, 1090789135, 1078426020, 1569222167, 845107691, 3583754449, 4072456591, 1091646820, 628848692, 1613405280, 3757631651, 526609435, 236106946, 48312990, 2942717905, 3402727701, 1797494240, 859738849, 992217954, 4005476642, 2243076622, 3870952857, 3732016268, 765654824, 3490871365, 2511836413, 1685915746, 3888969200, 1414112111, 2273134842, 3281911079, 4080962846, 172450625, 2569994100, 980381355, 4109958455, 2819808352, 2716589560, 2568741196, 3681446669, 3329971472, 1835478071, 660984891, 3704678404, 4045999559, 3422617507, 3040415634, 1762651403, 1719377915, 3470491036, 2693910283, 3642056355, 3138596744, 1364962596, 2073328063, 1983633131, 926494387, 3423689081, 2150032023, 4096667949, 1749200295, 3328846651, 309677260, 2016342300, 1779581495, 3079819751, 111262694, 1274766160, 443224088, 298511866, 1025883608, 3806446537, 1145181785, 168956806, 3641502830, 3584813610, 1689216846, 3666258015, 3200248200, 1692713982, 2646376535, 4042768518, 1618508792, 1610833997, 3523052358, 4130873264, 2001055236, 3610705100, 2202168115, 4028541809, 2961195399, 1006657119, 2006996926, 3186142756, 1430667929, 3210227297, 1314452623, 4074634658, 4101304120, 2273951170, 1399257539, 3367210612, 3027628629, 1190975929, 2062231137, 2333990788, 2221543033, 2438960610, 1181637006, 548689776, 2362791313, 3372408396, 3104550113, 3145860560, 296247880, 1970579870, 3078560182, 3769228297, 1714227617, 3291629107, 3898220290, 166772364, 1251581989, 493813264, 448347421, 195405023, 2709975567, 677966185, 3703036547, 1463355134, 2715995803, 1338867538, 1343315457, 2802222074, 2684532164, 233230375, 2599980071, 2000651841, 3277868038, 1638401717, 4028070440, 3237316320, 6314154, 819756386, 300326615, 590932579, 1405279636, 3267499572, 3150704214, 2428286686, 3959192993, 3461946742, 1862657033, 1266418056, 963775037, 2089974820, 2263052895, 1917689273, 448879540, 3550394620, 3981727096, 150775221, 3627908307, 1303187396, 508620638, 2975983352, 2726630617, 1817252668, 1876281319, 1457606340, 908771278, 3720792119, 3617206836, 2455994898, 1729034894, 1080033504], [976866871, 3556439503, 2881648439, 1522871579, 1555064734, 1336096578, 3548522304, 2579274686, 3574697629, 3205460757, 3593280638, 3338716283, 3079412587, 564236357, 2993598910, 1781952180, 1464380207, 3163844217, 3332601554, 1699332808, 1393555694, 1183702653, 3581086237, 1288719814, 691649499, 2847557200, 2895455976, 3193889540, 2717570544, 1781354906, 1676643554, 2592534050, 3230253752, 1126444790, 2770207658, 2633158820, 2210423226, 2615765581, 2414155088, 3127139286, 673620729, 2805611233, 1269405062, 4015350505, 3341807571, 4149409754, 1057255273, 2012875353, 2162469141, 2276492801, 2601117357, 993977747, 3918593370, 2654263191, 753973209, 36408145, 2530585658, 25011837, 3520020182, 2088578344, 530523599, 2918365339, 1524020338, 1518925132, 3760827505, 3759777254, 1202760957, 3985898139, 3906192525, 674977740, 4174734889, 2031300136, 2019492241, 3983892565, 4153806404, 3822280332, 352677332, 2297720250, 60907813, 90501309, 3286998549, 1016092578, 2535922412, 2839152426, 457141659, 509813237, 4120667899, 652014361, 1966332200, 2975202805, 55981186, 2327461051, 676427537, 3255491064, 2882294119, 3433927263, 1307055953, 942726286, 933058658, 2468411793, 3933900994, 4215176142, 1361170020, 2001714738, 2830558078, 3274259782, 1222529897, 1679025792, 2729314320, 3714953764, 1770335741, 151462246, 3013232138, 1682292957, 1483529935, 471910574, 1539241949, 458788160, 3436315007, 1807016891, 3718408830, 978976581, 1043663428, 3165965781, 1927990952, 4200891579, 2372276910, 3208408903, 3533431907, 1412390302, 2931980059, 4132332400, 1947078029, 3881505623, 4168226417, 2941484381, 1077988104, 1320477388, 886195818, 18198404, 3786409e3, 2509781533, 112762804, 3463356488, 1866414978, 891333506, 18488651, 661792760, 1628790961, 3885187036, 3141171499, 876946877, 2693282273, 1372485963, 791857591, 2686433993, 3759982718, 3167212022, 3472953795, 2716379847, 445679433, 3561995674, 3504004811, 3574258232, 54117162, 3331405415, 2381918588, 3769707343, 4154350007, 1140177722, 4074052095, 668550556, 3214352940, 367459370, 261225585, 2610173221, 4209349473, 3468074219, 3265815641, 314222801, 3066103646, 3808782860, 282218597, 3406013506, 3773591054, 379116347, 1285071038, 846784868, 2669647154, 3771962079, 3550491691, 2305946142, 453669953, 1268987020, 3317592352, 3279303384, 3744833421, 2610507566, 3859509063, 266596637, 3847019092, 517658769, 3462560207, 3443424879, 370717030, 4247526661, 2224018117, 4143653529, 4112773975, 2788324899, 2477274417, 1456262402, 2901442914, 1517677493, 1846949527, 2295493580, 3734397586, 2176403920, 1280348187, 1908823572, 3871786941, 846861322, 1172426758, 3287448474, 3383383037, 1655181056, 3139813346, 901632758, 1897031941, 2986607138, 3066810236, 3447102507, 1393639104, 373351379, 950779232, 625454576, 3124240540, 4148612726, 2007998917, 544563296, 2244738638, 2330496472, 2058025392, 1291430526, 424198748, 50039436, 29584100, 3605783033, 2429876329, 2791104160, 1057563949, 3255363231, 3075367218, 3463963227, 1469046755, 985887462]];
|
|
1685
1685
|
var o = { pbox: [], sbox: [] };
|
|
1686
|
-
function
|
|
1686
|
+
function c(v, A) {
|
|
1687
1687
|
let I = A >> 24 & 255, x = A >> 16 & 255, M = A >> 8 & 255, k = 255 & A, O = v.sbox[0][I] + v.sbox[1][x];
|
|
1688
1688
|
return O ^= v.sbox[2][M], O += v.sbox[3][k], O;
|
|
1689
1689
|
}
|
|
1690
|
-
function
|
|
1690
|
+
function d(v, A, I) {
|
|
1691
1691
|
let x, M = A, k = I;
|
|
1692
|
-
for (let O = 0; O < i; ++O) M ^= v.pbox[O], k =
|
|
1692
|
+
for (let O = 0; O < i; ++O) M ^= v.pbox[O], k = c(v, M) ^ k, x = M, M = k, k = x;
|
|
1693
1693
|
return x = M, M = k, k = x, k ^= v.pbox[i], M ^= v.pbox[i + 1], { left: M, right: k };
|
|
1694
1694
|
}
|
|
1695
1695
|
function h(v, A, I) {
|
|
1696
1696
|
let x, M = A, k = I;
|
|
1697
|
-
for (let O = i + 1; O > 1; --O) M ^= v.pbox[O], k =
|
|
1697
|
+
for (let O = i + 1; O > 1; --O) M ^= v.pbox[O], k = c(v, M) ^ k, x = M, M = k, k = x;
|
|
1698
1698
|
return x = M, M = k, k = x, k ^= v.pbox[1], M ^= v.pbox[0], { left: M, right: k };
|
|
1699
1699
|
}
|
|
1700
1700
|
function l(v, A, I) {
|
|
@@ -1705,8 +1705,8 @@ function Qf() {
|
|
|
1705
1705
|
let x = 0;
|
|
1706
1706
|
for (let E = 0; E < i + 2; E++) v.pbox[E] = s[E] ^ A[x], x++, x >= I && (x = 0);
|
|
1707
1707
|
let M = 0, k = 0, O = 0;
|
|
1708
|
-
for (let E = 0; E < i + 2; E += 2) O =
|
|
1709
|
-
for (let E = 0; E < 4; E++) for (let R = 0; R < 256; R += 2) O =
|
|
1708
|
+
for (let E = 0; E < i + 2; E += 2) O = d(v, M, k), M = O.left, k = O.right, v.pbox[E] = M, v.pbox[E + 1] = k;
|
|
1709
|
+
for (let E = 0; E < 4; E++) for (let R = 0; R < 256; R += 2) O = d(v, M, k), M = O.left, k = O.right, v.sbox[E][R] = M, v.sbox[E][R + 1] = k;
|
|
1710
1710
|
return !0;
|
|
1711
1711
|
}
|
|
1712
1712
|
var _ = n.Blowfish = r.extend({ _doReset: function() {
|
|
@@ -1715,7 +1715,7 @@ function Qf() {
|
|
|
1715
1715
|
l(o, A, I);
|
|
1716
1716
|
}
|
|
1717
1717
|
}, encryptBlock: function(v, A) {
|
|
1718
|
-
var I =
|
|
1718
|
+
var I = d(o, v[A], v[A + 1]);
|
|
1719
1719
|
v[A] = I.left, v[A + 1] = I.right;
|
|
1720
1720
|
}, decryptBlock: function(v, A) {
|
|
1721
1721
|
var I = h(o, v[A], v[A + 1]);
|
|
@@ -1742,8 +1742,8 @@ Hd.exports = /* @__PURE__ */ function(e) {
|
|
|
1742
1742
|
var t = e, r = t.x64, n = r.Word, i = r.WordArray, s = t.algo, a = s.SHA512, o = s.SHA384 = a.extend({ _doReset: function() {
|
|
1743
1743
|
this._hash = new i.init([new n.init(3418070365, 3238371032), new n.init(1654270250, 914150663), new n.init(2438529370, 812702999), new n.init(355462360, 4144912697), new n.init(1731405415, 4290775857), new n.init(2394180231, 1750603025), new n.init(3675008525, 1694076839), new n.init(1203062813, 3204075428)]);
|
|
1744
1744
|
}, _doFinalize: function() {
|
|
1745
|
-
var
|
|
1746
|
-
return
|
|
1745
|
+
var c = a._doFinalize.call(this);
|
|
1746
|
+
return c.sigBytes -= 16, c;
|
|
1747
1747
|
} });
|
|
1748
1748
|
t.SHA384 = a._createHelper(o), t.HmacSHA384 = a._createHmacHelper(o);
|
|
1749
1749
|
}(), e.SHA384;
|
|
@@ -1759,14 +1759,14 @@ Hd.exports = /* @__PURE__ */ function(e) {
|
|
|
1759
1759
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
1760
1760
|
*/
|
|
1761
1761
|
return function() {
|
|
1762
|
-
var t = e, r = t.lib, n = r.WordArray, i = r.Hasher, s = t.algo, a = n.create([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13]), o = n.create([5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11]),
|
|
1762
|
+
var t = e, r = t.lib, n = r.WordArray, i = r.Hasher, s = t.algo, a = n.create([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13]), o = n.create([5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11]), c = n.create([11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12, 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12, 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6]), d = n.create([8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11, 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8, 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11]), h = n.create([0, 1518500249, 1859775393, 2400959708, 2840853838]), l = n.create([1352829926, 1548603684, 1836072691, 2053994217, 0]), _ = s.RIPEMD160 = i.extend({ _doReset: function() {
|
|
1763
1763
|
this._hash = n.create([1732584193, 4023233417, 2562383102, 271733878, 3285377520]);
|
|
1764
1764
|
}, _doProcessBlock: function(O, E) {
|
|
1765
1765
|
for (var R = 0; R < 16; R++) {
|
|
1766
1766
|
var L = E + R, z = O[L];
|
|
1767
1767
|
O[L] = 16711935 & (z << 8 | z >>> 24) | 4278255360 & (z << 24 | z >>> 8);
|
|
1768
1768
|
}
|
|
1769
|
-
var f, p, g, m, u, y, w, P, N, j, Z, $ = this._hash.words, V = h.words, H = l.words, D = a.words, G = o.words, Et =
|
|
1769
|
+
var f, p, g, m, u, y, w, P, N, j, Z, $ = this._hash.words, V = h.words, H = l.words, D = a.words, G = o.words, Et = c.words, ot = d.words;
|
|
1770
1770
|
for (y = f = $[0], w = p = $[1], P = g = $[2], N = m = $[3], j = u = $[4], R = 0; R < 80; R += 1) Z = f + O[E + D[R]] | 0, Z += R < 16 ? v(p, g, m) + V[0] : R < 32 ? A(p, g, m) + V[1] : R < 48 ? I(p, g, m) + V[2] : R < 64 ? x(p, g, m) + V[3] : M(p, g, m) + V[4], Z = (Z = k(Z |= 0, Et[R])) + u | 0, f = u, u = m, m = k(g, 10), g = p, p = Z, Z = y + O[E + G[R]] | 0, Z += R < 16 ? M(w, P, N) + H[0] : R < 32 ? x(w, P, N) + H[1] : R < 48 ? I(w, P, N) + H[2] : R < 64 ? A(w, P, N) + H[3] : v(w, P, N) + H[4], Z = (Z = k(Z |= 0, ot[R])) + j | 0, y = j, j = N, N = k(P, 10), P = w, w = Z;
|
|
1771
1771
|
Z = $[1] + g + N | 0, $[1] = $[2] + m + j | 0, $[2] = $[3] + u + y | 0, $[3] = $[4] + f + w | 0, $[4] = $[0] + p + P | 0, $[0] = Z;
|
|
1772
1772
|
}, _doFinalize: function() {
|
|
@@ -1803,10 +1803,10 @@ Hd.exports = /* @__PURE__ */ function(e) {
|
|
|
1803
1803
|
}(), e.RIPEMD160;
|
|
1804
1804
|
}(Qt())), go(), gc || (gc = 1, Cf.exports = function(e) {
|
|
1805
1805
|
return function() {
|
|
1806
|
-
var t = e, r = t.lib, n = r.Base, i = r.WordArray, s = t.algo, a = s.SHA256, o = s.HMAC,
|
|
1807
|
-
this.cfg = this.cfg.extend(
|
|
1808
|
-
}, compute: function(
|
|
1809
|
-
for (var l = this.cfg, _ = o.create(l.hasher,
|
|
1806
|
+
var t = e, r = t.lib, n = r.Base, i = r.WordArray, s = t.algo, a = s.SHA256, o = s.HMAC, c = s.PBKDF2 = n.extend({ cfg: n.extend({ keySize: 4, hasher: a, iterations: 25e4 }), init: function(d) {
|
|
1807
|
+
this.cfg = this.cfg.extend(d);
|
|
1808
|
+
}, compute: function(d, h) {
|
|
1809
|
+
for (var l = this.cfg, _ = o.create(l.hasher, d), v = i.create(), A = i.create([1]), I = v.words, x = A.words, M = l.keySize, k = l.iterations; I.length < M; ) {
|
|
1810
1810
|
var O = _.update(h).finalize(A);
|
|
1811
1811
|
_.reset();
|
|
1812
1812
|
for (var E = O.words, R = E.length, L = O, z = 1; z < k; z++) {
|
|
@@ -1817,8 +1817,8 @@ Hd.exports = /* @__PURE__ */ function(e) {
|
|
|
1817
1817
|
}
|
|
1818
1818
|
return v.sigBytes = 4 * M, v;
|
|
1819
1819
|
} });
|
|
1820
|
-
t.PBKDF2 = function(
|
|
1821
|
-
return
|
|
1820
|
+
t.PBKDF2 = function(d, h, l) {
|
|
1821
|
+
return c.create(l).compute(d, h);
|
|
1822
1822
|
};
|
|
1823
1823
|
}(), e.PBKDF2;
|
|
1824
1824
|
}(Qt(), Vs(), go())), Jr(), Te(), Bf(), Pf(), Lf(), jf(), Nc || (Nc = 1, zf.exports = function(e) {
|
|
@@ -1875,7 +1875,7 @@ Hd.exports = /* @__PURE__ */ function(e) {
|
|
|
1875
1875
|
var t, r, n;
|
|
1876
1876
|
}(Qt(), Te())), zc || (zc = 1, Zf.exports = function(e) {
|
|
1877
1877
|
return function() {
|
|
1878
|
-
var t = e, r = t.lib.BlockCipher, n = t.algo, i = [], s = [], a = [], o = [],
|
|
1878
|
+
var t = e, r = t.lib.BlockCipher, n = t.algo, i = [], s = [], a = [], o = [], c = [], d = [], h = [], l = [], _ = [], v = [];
|
|
1879
1879
|
(function() {
|
|
1880
1880
|
for (var x = [], M = 0; M < 256; M++) x[M] = M < 128 ? M << 1 : M << 1 ^ 283;
|
|
1881
1881
|
var k = 0, O = 0;
|
|
@@ -1883,7 +1883,7 @@ Hd.exports = /* @__PURE__ */ function(e) {
|
|
|
1883
1883
|
var E = O ^ O << 1 ^ O << 2 ^ O << 3 ^ O << 4;
|
|
1884
1884
|
E = E >>> 8 ^ 255 & E ^ 99, i[k] = E, s[E] = k;
|
|
1885
1885
|
var R = x[k], L = x[R], z = x[L], f = 257 * x[E] ^ 16843008 * E;
|
|
1886
|
-
a[k] = f << 24 | f >>> 8, o[k] = f << 16 | f >>> 16,
|
|
1886
|
+
a[k] = f << 24 | f >>> 8, o[k] = f << 16 | f >>> 16, c[k] = f << 8 | f >>> 24, d[k] = f, f = 16843009 * z ^ 65537 * L ^ 257 * R ^ 16843008 * k, h[E] = f << 24 | f >>> 8, l[E] = f << 16 | f >>> 16, _[E] = f << 8 | f >>> 24, v[E] = f, k ? (k = R ^ x[x[x[z ^ R]]], O ^= x[x[O]]) : k = O = 1;
|
|
1887
1887
|
}
|
|
1888
1888
|
})();
|
|
1889
1889
|
var A = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], I = n.AES = r.extend({ _doReset: function() {
|
|
@@ -1896,7 +1896,7 @@ Hd.exports = /* @__PURE__ */ function(e) {
|
|
|
1896
1896
|
}
|
|
1897
1897
|
}
|
|
1898
1898
|
}, encryptBlock: function(x, M) {
|
|
1899
|
-
this._doCryptBlock(x, M, this._keySchedule, a, o,
|
|
1899
|
+
this._doCryptBlock(x, M, this._keySchedule, a, o, c, d, i);
|
|
1900
1900
|
}, decryptBlock: function(x, M) {
|
|
1901
1901
|
var k = x[M + 1];
|
|
1902
1902
|
x[M + 1] = x[M + 3], x[M + 3] = k, this._doCryptBlock(x, M, this._invKeySchedule, h, l, _, v, s), k = x[M + 1], x[M + 1] = x[M + 3], x[M + 3] = k;
|
|
@@ -1912,25 +1912,25 @@ Hd.exports = /* @__PURE__ */ function(e) {
|
|
|
1912
1912
|
}(Qt(), un(), ln(), Jr(), Te())), Vf(), Uc || (Uc = 1, Kf.exports = function(e) {
|
|
1913
1913
|
return function() {
|
|
1914
1914
|
var t = e, r = t.lib.StreamCipher, n = t.algo, i = n.RC4 = r.extend({ _doReset: function() {
|
|
1915
|
-
for (var o = this._key,
|
|
1915
|
+
for (var o = this._key, c = o.words, d = o.sigBytes, h = this._S = [], l = 0; l < 256; l++) h[l] = l;
|
|
1916
1916
|
l = 0;
|
|
1917
1917
|
for (var _ = 0; l < 256; l++) {
|
|
1918
|
-
var v = l %
|
|
1918
|
+
var v = l % d, A = c[v >>> 2] >>> 24 - v % 4 * 8 & 255;
|
|
1919
1919
|
_ = (_ + h[l] + A) % 256;
|
|
1920
1920
|
var I = h[l];
|
|
1921
1921
|
h[l] = h[_], h[_] = I;
|
|
1922
1922
|
}
|
|
1923
1923
|
this._i = this._j = 0;
|
|
1924
|
-
}, _doProcessBlock: function(o,
|
|
1925
|
-
o[
|
|
1924
|
+
}, _doProcessBlock: function(o, c) {
|
|
1925
|
+
o[c] ^= s.call(this);
|
|
1926
1926
|
}, keySize: 8, ivSize: 0 });
|
|
1927
1927
|
function s() {
|
|
1928
|
-
for (var o = this._S,
|
|
1929
|
-
|
|
1930
|
-
var _ = o[
|
|
1931
|
-
o[
|
|
1928
|
+
for (var o = this._S, c = this._i, d = this._j, h = 0, l = 0; l < 4; l++) {
|
|
1929
|
+
d = (d + o[c = (c + 1) % 256]) % 256;
|
|
1930
|
+
var _ = o[c];
|
|
1931
|
+
o[c] = o[d], o[d] = _, h |= o[(o[c] + o[d]) % 256] << 24 - 8 * l;
|
|
1932
1932
|
}
|
|
1933
|
-
return this._i =
|
|
1933
|
+
return this._i = c, this._j = d, h;
|
|
1934
1934
|
}
|
|
1935
1935
|
t.RC4 = r._createHelper(i);
|
|
1936
1936
|
var a = n.RC4Drop = i.extend({ cfg: i.cfg.extend({ drop: 192 }), _doReset: function() {
|
|
@@ -1942,52 +1942,52 @@ Hd.exports = /* @__PURE__ */ function(e) {
|
|
|
1942
1942
|
}(Qt(), un(), ln(), Jr(), Te())), Hc || (Hc = 1, Wf.exports = function(e) {
|
|
1943
1943
|
return function() {
|
|
1944
1944
|
var t = e, r = t.lib.StreamCipher, n = t.algo, i = [], s = [], a = [], o = n.Rabbit = r.extend({ _doReset: function() {
|
|
1945
|
-
for (var
|
|
1946
|
-
var _ = this._X = [
|
|
1947
|
-
for (this._b = 0, l = 0; l < 4; l++)
|
|
1945
|
+
for (var d = this._key.words, h = this.cfg.iv, l = 0; l < 4; l++) d[l] = 16711935 & (d[l] << 8 | d[l] >>> 24) | 4278255360 & (d[l] << 24 | d[l] >>> 8);
|
|
1946
|
+
var _ = this._X = [d[0], d[3] << 16 | d[2] >>> 16, d[1], d[0] << 16 | d[3] >>> 16, d[2], d[1] << 16 | d[0] >>> 16, d[3], d[2] << 16 | d[1] >>> 16], v = this._C = [d[2] << 16 | d[2] >>> 16, 4294901760 & d[0] | 65535 & d[1], d[3] << 16 | d[3] >>> 16, 4294901760 & d[1] | 65535 & d[2], d[0] << 16 | d[0] >>> 16, 4294901760 & d[2] | 65535 & d[3], d[1] << 16 | d[1] >>> 16, 4294901760 & d[3] | 65535 & d[0]];
|
|
1947
|
+
for (this._b = 0, l = 0; l < 4; l++) c.call(this);
|
|
1948
1948
|
for (l = 0; l < 8; l++) v[l] ^= _[l + 4 & 7];
|
|
1949
1949
|
if (h) {
|
|
1950
1950
|
var A = h.words, I = A[0], x = A[1], M = 16711935 & (I << 8 | I >>> 24) | 4278255360 & (I << 24 | I >>> 8), k = 16711935 & (x << 8 | x >>> 24) | 4278255360 & (x << 24 | x >>> 8), O = M >>> 16 | 4294901760 & k, E = k << 16 | 65535 & M;
|
|
1951
|
-
for (v[0] ^= M, v[1] ^= O, v[2] ^= k, v[3] ^= E, v[4] ^= M, v[5] ^= O, v[6] ^= k, v[7] ^= E, l = 0; l < 4; l++)
|
|
1951
|
+
for (v[0] ^= M, v[1] ^= O, v[2] ^= k, v[3] ^= E, v[4] ^= M, v[5] ^= O, v[6] ^= k, v[7] ^= E, l = 0; l < 4; l++) c.call(this);
|
|
1952
1952
|
}
|
|
1953
|
-
}, _doProcessBlock: function(
|
|
1953
|
+
}, _doProcessBlock: function(d, h) {
|
|
1954
1954
|
var l = this._X;
|
|
1955
|
-
|
|
1956
|
-
for (var _ = 0; _ < 4; _++) i[_] = 16711935 & (i[_] << 8 | i[_] >>> 24) | 4278255360 & (i[_] << 24 | i[_] >>> 8),
|
|
1955
|
+
c.call(this), i[0] = l[0] ^ l[5] >>> 16 ^ l[3] << 16, i[1] = l[2] ^ l[7] >>> 16 ^ l[5] << 16, i[2] = l[4] ^ l[1] >>> 16 ^ l[7] << 16, i[3] = l[6] ^ l[3] >>> 16 ^ l[1] << 16;
|
|
1956
|
+
for (var _ = 0; _ < 4; _++) i[_] = 16711935 & (i[_] << 8 | i[_] >>> 24) | 4278255360 & (i[_] << 24 | i[_] >>> 8), d[h + _] ^= i[_];
|
|
1957
1957
|
}, blockSize: 4, ivSize: 2 });
|
|
1958
|
-
function
|
|
1959
|
-
for (var
|
|
1958
|
+
function c() {
|
|
1959
|
+
for (var d = this._X, h = this._C, l = 0; l < 8; l++) s[l] = h[l];
|
|
1960
1960
|
for (h[0] = h[0] + 1295307597 + this._b | 0, h[1] = h[1] + 3545052371 + (h[0] >>> 0 < s[0] >>> 0 ? 1 : 0) | 0, h[2] = h[2] + 886263092 + (h[1] >>> 0 < s[1] >>> 0 ? 1 : 0) | 0, h[3] = h[3] + 1295307597 + (h[2] >>> 0 < s[2] >>> 0 ? 1 : 0) | 0, h[4] = h[4] + 3545052371 + (h[3] >>> 0 < s[3] >>> 0 ? 1 : 0) | 0, h[5] = h[5] + 886263092 + (h[4] >>> 0 < s[4] >>> 0 ? 1 : 0) | 0, h[6] = h[6] + 1295307597 + (h[5] >>> 0 < s[5] >>> 0 ? 1 : 0) | 0, h[7] = h[7] + 3545052371 + (h[6] >>> 0 < s[6] >>> 0 ? 1 : 0) | 0, this._b = h[7] >>> 0 < s[7] >>> 0 ? 1 : 0, l = 0; l < 8; l++) {
|
|
1961
|
-
var _ =
|
|
1961
|
+
var _ = d[l] + h[l], v = 65535 & _, A = _ >>> 16, I = ((v * v >>> 17) + v * A >>> 15) + A * A, x = ((4294901760 & _) * _ | 0) + ((65535 & _) * _ | 0);
|
|
1962
1962
|
a[l] = I ^ x;
|
|
1963
1963
|
}
|
|
1964
|
-
|
|
1964
|
+
d[0] = a[0] + (a[7] << 16 | a[7] >>> 16) + (a[6] << 16 | a[6] >>> 16) | 0, d[1] = a[1] + (a[0] << 8 | a[0] >>> 24) + a[7] | 0, d[2] = a[2] + (a[1] << 16 | a[1] >>> 16) + (a[0] << 16 | a[0] >>> 16) | 0, d[3] = a[3] + (a[2] << 8 | a[2] >>> 24) + a[1] | 0, d[4] = a[4] + (a[3] << 16 | a[3] >>> 16) + (a[2] << 16 | a[2] >>> 16) | 0, d[5] = a[5] + (a[4] << 8 | a[4] >>> 24) + a[3] | 0, d[6] = a[6] + (a[5] << 16 | a[5] >>> 16) + (a[4] << 16 | a[4] >>> 16) | 0, d[7] = a[7] + (a[6] << 8 | a[6] >>> 24) + a[5] | 0;
|
|
1965
1965
|
}
|
|
1966
1966
|
t.Rabbit = r._createHelper(o);
|
|
1967
1967
|
}(), e.Rabbit;
|
|
1968
1968
|
}(Qt(), un(), ln(), Jr(), Te())), Dc || (Dc = 1, Yf.exports = function(e) {
|
|
1969
1969
|
return function() {
|
|
1970
1970
|
var t = e, r = t.lib.StreamCipher, n = t.algo, i = [], s = [], a = [], o = n.RabbitLegacy = r.extend({ _doReset: function() {
|
|
1971
|
-
var
|
|
1971
|
+
var d = this._key.words, h = this.cfg.iv, l = this._X = [d[0], d[3] << 16 | d[2] >>> 16, d[1], d[0] << 16 | d[3] >>> 16, d[2], d[1] << 16 | d[0] >>> 16, d[3], d[2] << 16 | d[1] >>> 16], _ = this._C = [d[2] << 16 | d[2] >>> 16, 4294901760 & d[0] | 65535 & d[1], d[3] << 16 | d[3] >>> 16, 4294901760 & d[1] | 65535 & d[2], d[0] << 16 | d[0] >>> 16, 4294901760 & d[2] | 65535 & d[3], d[1] << 16 | d[1] >>> 16, 4294901760 & d[3] | 65535 & d[0]];
|
|
1972
1972
|
this._b = 0;
|
|
1973
|
-
for (var v = 0; v < 4; v++)
|
|
1973
|
+
for (var v = 0; v < 4; v++) c.call(this);
|
|
1974
1974
|
for (v = 0; v < 8; v++) _[v] ^= l[v + 4 & 7];
|
|
1975
1975
|
if (h) {
|
|
1976
1976
|
var A = h.words, I = A[0], x = A[1], M = 16711935 & (I << 8 | I >>> 24) | 4278255360 & (I << 24 | I >>> 8), k = 16711935 & (x << 8 | x >>> 24) | 4278255360 & (x << 24 | x >>> 8), O = M >>> 16 | 4294901760 & k, E = k << 16 | 65535 & M;
|
|
1977
|
-
for (_[0] ^= M, _[1] ^= O, _[2] ^= k, _[3] ^= E, _[4] ^= M, _[5] ^= O, _[6] ^= k, _[7] ^= E, v = 0; v < 4; v++)
|
|
1977
|
+
for (_[0] ^= M, _[1] ^= O, _[2] ^= k, _[3] ^= E, _[4] ^= M, _[5] ^= O, _[6] ^= k, _[7] ^= E, v = 0; v < 4; v++) c.call(this);
|
|
1978
1978
|
}
|
|
1979
|
-
}, _doProcessBlock: function(
|
|
1979
|
+
}, _doProcessBlock: function(d, h) {
|
|
1980
1980
|
var l = this._X;
|
|
1981
|
-
|
|
1982
|
-
for (var _ = 0; _ < 4; _++) i[_] = 16711935 & (i[_] << 8 | i[_] >>> 24) | 4278255360 & (i[_] << 24 | i[_] >>> 8),
|
|
1981
|
+
c.call(this), i[0] = l[0] ^ l[5] >>> 16 ^ l[3] << 16, i[1] = l[2] ^ l[7] >>> 16 ^ l[5] << 16, i[2] = l[4] ^ l[1] >>> 16 ^ l[7] << 16, i[3] = l[6] ^ l[3] >>> 16 ^ l[1] << 16;
|
|
1982
|
+
for (var _ = 0; _ < 4; _++) i[_] = 16711935 & (i[_] << 8 | i[_] >>> 24) | 4278255360 & (i[_] << 24 | i[_] >>> 8), d[h + _] ^= i[_];
|
|
1983
1983
|
}, blockSize: 4, ivSize: 2 });
|
|
1984
|
-
function
|
|
1985
|
-
for (var
|
|
1984
|
+
function c() {
|
|
1985
|
+
for (var d = this._X, h = this._C, l = 0; l < 8; l++) s[l] = h[l];
|
|
1986
1986
|
for (h[0] = h[0] + 1295307597 + this._b | 0, h[1] = h[1] + 3545052371 + (h[0] >>> 0 < s[0] >>> 0 ? 1 : 0) | 0, h[2] = h[2] + 886263092 + (h[1] >>> 0 < s[1] >>> 0 ? 1 : 0) | 0, h[3] = h[3] + 1295307597 + (h[2] >>> 0 < s[2] >>> 0 ? 1 : 0) | 0, h[4] = h[4] + 3545052371 + (h[3] >>> 0 < s[3] >>> 0 ? 1 : 0) | 0, h[5] = h[5] + 886263092 + (h[4] >>> 0 < s[4] >>> 0 ? 1 : 0) | 0, h[6] = h[6] + 1295307597 + (h[5] >>> 0 < s[5] >>> 0 ? 1 : 0) | 0, h[7] = h[7] + 3545052371 + (h[6] >>> 0 < s[6] >>> 0 ? 1 : 0) | 0, this._b = h[7] >>> 0 < s[7] >>> 0 ? 1 : 0, l = 0; l < 8; l++) {
|
|
1987
|
-
var _ =
|
|
1987
|
+
var _ = d[l] + h[l], v = 65535 & _, A = _ >>> 16, I = ((v * v >>> 17) + v * A >>> 15) + A * A, x = ((4294901760 & _) * _ | 0) + ((65535 & _) * _ | 0);
|
|
1988
1988
|
a[l] = I ^ x;
|
|
1989
1989
|
}
|
|
1990
|
-
|
|
1990
|
+
d[0] = a[0] + (a[7] << 16 | a[7] >>> 16) + (a[6] << 16 | a[6] >>> 16) | 0, d[1] = a[1] + (a[0] << 8 | a[0] >>> 24) + a[7] | 0, d[2] = a[2] + (a[1] << 16 | a[1] >>> 16) + (a[0] << 16 | a[0] >>> 16) | 0, d[3] = a[3] + (a[2] << 8 | a[2] >>> 24) + a[1] | 0, d[4] = a[4] + (a[3] << 16 | a[3] >>> 16) + (a[2] << 16 | a[2] >>> 16) | 0, d[5] = a[5] + (a[4] << 8 | a[4] >>> 24) + a[3] | 0, d[6] = a[6] + (a[5] << 16 | a[5] >>> 16) + (a[4] << 16 | a[4] >>> 16) | 0, d[7] = a[7] + (a[6] << 8 | a[6] >>> 24) + a[5] | 0;
|
|
1991
1991
|
}
|
|
1992
1992
|
t.RabbitLegacy = r._createHelper(o);
|
|
1993
1993
|
}(), e.RabbitLegacy;
|
|
@@ -2024,7 +2024,7 @@ var Xe = {}, Vd = { exports: {} };
|
|
|
2024
2024
|
var m = a(f, g);
|
|
2025
2025
|
return g - 1 >= p && (m |= a(f, g - 1) << 4), m;
|
|
2026
2026
|
}
|
|
2027
|
-
function
|
|
2027
|
+
function c(f, p, g, m) {
|
|
2028
2028
|
for (var u = 0, y = Math.min(f.length, g), w = p; w < y; w++) {
|
|
2029
2029
|
var P = f.charCodeAt(w) - 48;
|
|
2030
2030
|
u *= m, u += P >= 49 ? P - 49 + 10 : P >= 17 ? P - 17 + 10 : P;
|
|
@@ -2064,10 +2064,10 @@ var Xe = {}, Vd = { exports: {} };
|
|
|
2064
2064
|
this.words = [0], this.length = 1;
|
|
2065
2065
|
for (var m = 0, u = 1; u <= 67108863; u *= p) m++;
|
|
2066
2066
|
m--, u = u / p | 0;
|
|
2067
|
-
for (var y = f.length - g, w = y % m, P = Math.min(y, y - w) + g, N = 0, j = g; j < P; j += m) N =
|
|
2067
|
+
for (var y = f.length - g, w = y % m, P = Math.min(y, y - w) + g, N = 0, j = g; j < P; j += m) N = c(f, j, j + m, p), this.imuln(u), this.words[0] + N < 67108864 ? this.words[0] += N : this._iaddn(N);
|
|
2068
2068
|
if (w !== 0) {
|
|
2069
2069
|
var Z = 1;
|
|
2070
|
-
for (N =
|
|
2070
|
+
for (N = c(f, j, f.length, p), j = 0; j < w; j++) Z *= p;
|
|
2071
2071
|
this.imuln(Z), this.words[0] + N < 67108864 ? this.words[0] += N : this._iaddn(N);
|
|
2072
2072
|
}
|
|
2073
2073
|
this.strip();
|
|
@@ -2089,7 +2089,7 @@ var Xe = {}, Vd = { exports: {} };
|
|
|
2089
2089
|
}, i.prototype.inspect = function() {
|
|
2090
2090
|
return (this.red ? "<BN-R: " : "<BN: ") + this.toString(16) + ">";
|
|
2091
2091
|
};
|
|
2092
|
-
var
|
|
2092
|
+
var d = ["", "0", "00", "000", "0000", "00000", "000000", "0000000", "00000000", "000000000", "0000000000", "00000000000", "000000000000", "0000000000000", "00000000000000", "000000000000000", "0000000000000000", "00000000000000000", "000000000000000000", "0000000000000000000", "00000000000000000000", "000000000000000000000", "0000000000000000000000", "00000000000000000000000", "000000000000000000000000", "0000000000000000000000000"], h = [0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5], l = [0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808, 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176];
|
|
2093
2093
|
function _(f, p, g) {
|
|
2094
2094
|
g.negative = p.negative ^ f.negative;
|
|
2095
2095
|
var m = f.length + p.length | 0;
|
|
@@ -2111,7 +2111,7 @@ var Xe = {}, Vd = { exports: {} };
|
|
|
2111
2111
|
g = "";
|
|
2112
2112
|
for (var m = 0, u = 0, y = 0; y < this.length; y++) {
|
|
2113
2113
|
var w = this.words[y], P = (16777215 & (w << m | u)).toString(16);
|
|
2114
|
-
u = w >>> 24 - m & 16777215, (m += 2) >= 26 && (m -= 26, y--), g = u !== 0 || y !== this.length - 1 ?
|
|
2114
|
+
u = w >>> 24 - m & 16777215, (m += 2) >= 26 && (m -= 26, y--), g = u !== 0 || y !== this.length - 1 ? d[6 - P.length] + P + g : P + g;
|
|
2115
2115
|
}
|
|
2116
2116
|
for (u !== 0 && (g = u.toString(16) + g); g.length % p !== 0; ) g = "0" + g;
|
|
2117
2117
|
return this.negative !== 0 && (g = "-" + g), g;
|
|
@@ -2122,7 +2122,7 @@ var Xe = {}, Vd = { exports: {} };
|
|
|
2122
2122
|
var Z = this.clone();
|
|
2123
2123
|
for (Z.negative = 0; !Z.isZero(); ) {
|
|
2124
2124
|
var $ = Z.modn(j).toString(f);
|
|
2125
|
-
g = (Z = Z.idivn(j)).isZero() ? $ + g :
|
|
2125
|
+
g = (Z = Z.idivn(j)).isZero() ? $ + g : d[N - $.length] + $ + g;
|
|
2126
2126
|
}
|
|
2127
2127
|
for (this.isZero() && (g = "0" + g); g.length % p !== 0; ) g = "0" + g;
|
|
2128
2128
|
return this.negative !== 0 && (g = "-" + g), g;
|
|
@@ -2872,8 +2872,8 @@ var vo = {};
|
|
|
2872
2872
|
if (i === "hex")
|
|
2873
2873
|
for ((n = n.replace(/[^a-z0-9]+/gi, "")).length % 2 != 0 && (n = "0" + n), a = 0; a < n.length; a += 2) s.push(parseInt(n[a] + n[a + 1], 16));
|
|
2874
2874
|
else for (a = 0; a < n.length; a++) {
|
|
2875
|
-
var o = n.charCodeAt(a),
|
|
2876
|
-
|
|
2875
|
+
var o = n.charCodeAt(a), c = o >> 8, d = 255 & o;
|
|
2876
|
+
c ? s.push(c, d) : s.push(d);
|
|
2877
2877
|
}
|
|
2878
2878
|
return s;
|
|
2879
2879
|
}, e.zero2 = t, e.toHex = r, e.encode = function(n, i) {
|
|
@@ -2882,20 +2882,20 @@ var vo = {};
|
|
|
2882
2882
|
})(), function() {
|
|
2883
2883
|
var e = Xe, t = Fr, r = En, n = vo;
|
|
2884
2884
|
e.assert = r, e.toArray = n.toArray, e.zero2 = n.zero2, e.toHex = n.toHex, e.encode = n.encode, e.getNAF = function(i, s, a) {
|
|
2885
|
-
var o,
|
|
2886
|
-
for (o = 0; o <
|
|
2887
|
-
var
|
|
2888
|
-
for (o = 0; o <
|
|
2889
|
-
var l, _ = h.andln(
|
|
2890
|
-
h.isOdd() ? (l = _ > (
|
|
2891
|
-
}
|
|
2892
|
-
return
|
|
2885
|
+
var o, c = new Array(Math.max(i.bitLength(), a) + 1);
|
|
2886
|
+
for (o = 0; o < c.length; o += 1) c[o] = 0;
|
|
2887
|
+
var d = 1 << s + 1, h = i.clone();
|
|
2888
|
+
for (o = 0; o < c.length; o++) {
|
|
2889
|
+
var l, _ = h.andln(d - 1);
|
|
2890
|
+
h.isOdd() ? (l = _ > (d >> 1) - 1 ? (d >> 1) - _ : _, h.isubn(l)) : l = 0, c[o] = l, h.iushrn(1);
|
|
2891
|
+
}
|
|
2892
|
+
return c;
|
|
2893
2893
|
}, e.getJSF = function(i, s) {
|
|
2894
2894
|
var a = [[], []];
|
|
2895
2895
|
i = i.clone(), s = s.clone();
|
|
2896
|
-
for (var o,
|
|
2897
|
-
var h, l, _ = i.andln(3) +
|
|
2898
|
-
_ === 3 && (_ = -1), v === 3 && (v = -1), h = 1 & _ ? (o = i.andln(7) +
|
|
2896
|
+
for (var o, c = 0, d = 0; i.cmpn(-c) > 0 || s.cmpn(-d) > 0; ) {
|
|
2897
|
+
var h, l, _ = i.andln(3) + c & 3, v = s.andln(3) + d & 3;
|
|
2898
|
+
_ === 3 && (_ = -1), v === 3 && (v = -1), h = 1 & _ ? (o = i.andln(7) + c & 7) !== 3 && o !== 5 || v !== 2 ? _ : -_ : 0, a[0].push(h), l = 1 & v ? (o = s.andln(7) + d & 7) !== 3 && o !== 5 || _ !== 2 ? v : -v : 0, a[1].push(l), 2 * c === h + 1 && (c = 1 - c), 2 * d === l + 1 && (d = 1 - d), i.iushrn(1), s.iushrn(1);
|
|
2899
2899
|
}
|
|
2900
2900
|
return a;
|
|
2901
2901
|
}, e.cachedProperty = function(i, s, a) {
|
|
@@ -2959,41 +2959,41 @@ Qr.prototype.point = function() {
|
|
|
2959
2959
|
var s, a, o = [];
|
|
2960
2960
|
for (s = 0; s < n.length; s += r.step) {
|
|
2961
2961
|
a = 0;
|
|
2962
|
-
for (var
|
|
2962
|
+
for (var c = s + r.step - 1; c >= s; c--) a = (a << 1) + n[c];
|
|
2963
2963
|
o.push(a);
|
|
2964
2964
|
}
|
|
2965
|
-
for (var
|
|
2965
|
+
for (var d = this.jpoint(null, null, null), h = this.jpoint(null, null, null), l = i; l > 0; l--) {
|
|
2966
2966
|
for (s = 0; s < o.length; s++) (a = o[s]) === l ? h = h.mixedAdd(r.points[s]) : a === -l && (h = h.mixedAdd(r.points[s].neg()));
|
|
2967
|
-
|
|
2967
|
+
d = d.add(h);
|
|
2968
2968
|
}
|
|
2969
|
-
return
|
|
2969
|
+
return d.toP();
|
|
2970
2970
|
}, Qr.prototype._wnafMul = function(e, t) {
|
|
2971
2971
|
var r = 4, n = e._getNAFPoints(r);
|
|
2972
2972
|
r = n.wnd;
|
|
2973
2973
|
for (var i = n.points, s = Vi(t, r, this._bitLength), a = this.jpoint(null, null, null), o = s.length - 1; o >= 0; o--) {
|
|
2974
|
-
for (var
|
|
2975
|
-
if (o >= 0 &&
|
|
2976
|
-
var
|
|
2977
|
-
Ki(
|
|
2974
|
+
for (var c = 0; o >= 0 && s[o] === 0; o--) c++;
|
|
2975
|
+
if (o >= 0 && c++, a = a.dblp(c), o < 0) break;
|
|
2976
|
+
var d = s[o];
|
|
2977
|
+
Ki(d !== 0), a = e.type === "affine" ? d > 0 ? a.mixedAdd(i[d - 1 >> 1]) : a.mixedAdd(i[-d - 1 >> 1].neg()) : d > 0 ? a.add(i[d - 1 >> 1]) : a.add(i[-d - 1 >> 1].neg());
|
|
2978
2978
|
}
|
|
2979
2979
|
return e.type === "affine" ? a.toP() : a;
|
|
2980
2980
|
}, Qr.prototype._wnafMulAdd = function(e, t, r, n, i) {
|
|
2981
|
-
var s, a, o,
|
|
2981
|
+
var s, a, o, c = this._wnafT1, d = this._wnafT2, h = this._wnafT3, l = 0;
|
|
2982
2982
|
for (s = 0; s < n; s++) {
|
|
2983
2983
|
var _ = (o = t[s])._getNAFPoints(e);
|
|
2984
|
-
|
|
2984
|
+
c[s] = _.wnd, d[s] = _.points;
|
|
2985
2985
|
}
|
|
2986
2986
|
for (s = n - 1; s >= 1; s -= 2) {
|
|
2987
2987
|
var v = s - 1, A = s;
|
|
2988
|
-
if (
|
|
2988
|
+
if (c[v] === 1 && c[A] === 1) {
|
|
2989
2989
|
var I = [t[v], null, null, t[A]];
|
|
2990
2990
|
t[v].y.cmp(t[A].y) === 0 ? (I[1] = t[v].add(t[A]), I[2] = t[v].toJ().mixedAdd(t[A].neg())) : t[v].y.cmp(t[A].y.redNeg()) === 0 ? (I[1] = t[v].toJ().mixedAdd(t[A]), I[2] = t[v].add(t[A].neg())) : (I[1] = t[v].toJ().mixedAdd(t[A]), I[2] = t[v].toJ().mixedAdd(t[A].neg()));
|
|
2991
2991
|
var x = [-3, -1, -5, -7, 0, 7, 5, 1, 3], M = Jf(r[v], r[A]);
|
|
2992
2992
|
for (l = Math.max(M[0].length, l), h[v] = new Array(l), h[A] = new Array(l), a = 0; a < l; a++) {
|
|
2993
2993
|
var k = 0 | M[0][a], O = 0 | M[1][a];
|
|
2994
|
-
h[v][a] = x[3 * (k + 1) + (O + 1)], h[A][a] = 0,
|
|
2994
|
+
h[v][a] = x[3 * (k + 1) + (O + 1)], h[A][a] = 0, d[v] = I;
|
|
2995
2995
|
}
|
|
2996
|
-
} else h[v] = Vi(r[v],
|
|
2996
|
+
} else h[v] = Vi(r[v], c[v], this._bitLength), h[A] = Vi(r[A], c[A], this._bitLength), l = Math.max(h[v].length, l), l = Math.max(h[A].length, l);
|
|
2997
2997
|
}
|
|
2998
2998
|
var E = this.jpoint(null, null, null), R = this._wnafT4;
|
|
2999
2999
|
for (s = l; s >= 0; s--) {
|
|
@@ -3006,10 +3006,10 @@ Qr.prototype.point = function() {
|
|
|
3006
3006
|
if (s >= 0 && L++, E = E.dblp(L), s < 0) break;
|
|
3007
3007
|
for (a = 0; a < n; a++) {
|
|
3008
3008
|
var f = R[a];
|
|
3009
|
-
f !== 0 && (f > 0 ? o =
|
|
3009
|
+
f !== 0 && (f > 0 ? o = d[a][f - 1 >> 1] : f < 0 && (o = d[a][-f - 1 >> 1].neg()), E = o.type === "affine" ? E.mixedAdd(o) : E.add(o));
|
|
3010
3010
|
}
|
|
3011
3011
|
}
|
|
3012
|
-
for (s = 0; s < n; s++)
|
|
3012
|
+
for (s = 0; s < n; s++) d[s] = null;
|
|
3013
3013
|
return i ? E : E.toP();
|
|
3014
3014
|
}, Qr.BasePoint = tr, tr.prototype.eq = function() {
|
|
3015
3015
|
throw new Error("Not implemented");
|
|
@@ -3097,20 +3097,20 @@ ir.prototype._getEndomorphism = function(e) {
|
|
|
3097
3097
|
var t = e === this.p ? this.red : ge.mont(e), r = new ge(2).toRed(t).redInvm(), n = r.redNeg(), i = new ge(3).toRed(t).redNeg().redSqrt().redMul(r);
|
|
3098
3098
|
return [n.redAdd(i).fromRed(), n.redSub(i).fromRed()];
|
|
3099
3099
|
}, ir.prototype._getEndoBasis = function(e) {
|
|
3100
|
-
for (var t, r, n, i, s, a, o,
|
|
3100
|
+
for (var t, r, n, i, s, a, o, c, d, h = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), l = e, _ = this.n.clone(), v = new ge(1), A = new ge(0), I = new ge(0), x = new ge(1), M = 0; l.cmpn(0) !== 0; ) {
|
|
3101
3101
|
var k = _.div(l);
|
|
3102
|
-
|
|
3102
|
+
c = _.sub(k.mul(l)), d = I.sub(k.mul(v));
|
|
3103
3103
|
var O = x.sub(k.mul(A));
|
|
3104
|
-
if (!n &&
|
|
3104
|
+
if (!n && c.cmp(h) < 0) t = o.neg(), r = v, n = c.neg(), i = d;
|
|
3105
3105
|
else if (n && ++M === 2) break;
|
|
3106
|
-
o =
|
|
3106
|
+
o = c, _ = l, l = c, I = v, v = d, x = A, A = O;
|
|
3107
3107
|
}
|
|
3108
|
-
s =
|
|
3108
|
+
s = c.neg(), a = d;
|
|
3109
3109
|
var E = n.sqr().add(i.sqr());
|
|
3110
3110
|
return s.sqr().add(a.sqr()).cmp(E) >= 0 && (s = t, a = r), n.negative && (n = n.neg(), i = i.neg()), s.negative && (s = s.neg(), a = a.neg()), [{ a: n, b: i }, { a: s, b: a }];
|
|
3111
3111
|
}, ir.prototype._endoSplit = function(e) {
|
|
3112
|
-
var t = this.endo.basis, r = t[0], n = t[1], i = n.b.mul(e).divRound(this.n), s = r.b.neg().mul(e).divRound(this.n), a = i.mul(r.a), o = s.mul(n.a),
|
|
3113
|
-
return { k1: e.sub(a).sub(o), k2:
|
|
3112
|
+
var t = this.endo.basis, r = t[0], n = t[1], i = n.b.mul(e).divRound(this.n), s = r.b.neg().mul(e).divRound(this.n), a = i.mul(r.a), o = s.mul(n.a), c = i.mul(r.b), d = s.mul(n.b);
|
|
3113
|
+
return { k1: e.sub(a).sub(o), k2: c.add(d).neg() };
|
|
3114
3114
|
}, ir.prototype.pointFromX = function(e, t) {
|
|
3115
3115
|
(e = new ge(e, 16)).red || (e = e.toRed(this.red));
|
|
3116
3116
|
var r = e.redSqr().redMul(e).redIAdd(e.redMul(this.a)).redIAdd(this.b), n = r.redSqrt();
|
|
@@ -3123,11 +3123,11 @@ ir.prototype._getEndomorphism = function(e) {
|
|
|
3123
3123
|
return r.redSqr().redISub(i).cmpn(0) === 0;
|
|
3124
3124
|
}, ir.prototype._endoWnafMulAdd = function(e, t, r) {
|
|
3125
3125
|
for (var n = this._endoWnafT1, i = this._endoWnafT2, s = 0; s < e.length; s++) {
|
|
3126
|
-
var a = this._endoSplit(t[s]), o = e[s],
|
|
3127
|
-
a.k1.negative && (a.k1.ineg(), o = o.neg(!0)), a.k2.negative && (a.k2.ineg(),
|
|
3126
|
+
var a = this._endoSplit(t[s]), o = e[s], c = o._getBeta();
|
|
3127
|
+
a.k1.negative && (a.k1.ineg(), o = o.neg(!0)), a.k2.negative && (a.k2.ineg(), c = c.neg(!0)), n[2 * s] = o, n[2 * s + 1] = c, i[2 * s] = a.k1, i[2 * s + 1] = a.k2;
|
|
3128
3128
|
}
|
|
3129
|
-
for (var
|
|
3130
|
-
return
|
|
3129
|
+
for (var d = this._wnafMulAdd(1, n, i, 2 * s, r), h = 0; h < 2 * s; h++) n[h] = null, i[h] = null;
|
|
3130
|
+
return d;
|
|
3131
3131
|
}, xo(ke, Fn.BasePoint), ir.prototype.point = function(e, t, r) {
|
|
3132
3132
|
return new ke(this, e, t, r);
|
|
3133
3133
|
}, ir.prototype.pointFromJSON = function(e, t) {
|
|
@@ -3213,16 +3213,16 @@ ir.prototype._getEndomorphism = function(e) {
|
|
|
3213
3213
|
}, Pe.prototype.add = function(e) {
|
|
3214
3214
|
if (this.isInfinity()) return e;
|
|
3215
3215
|
if (e.isInfinity()) return this;
|
|
3216
|
-
var t = e.z.redSqr(), r = this.z.redSqr(), n = this.x.redMul(t), i = e.x.redMul(r), s = this.y.redMul(t.redMul(e.z)), a = e.y.redMul(r.redMul(this.z)), o = n.redSub(i),
|
|
3217
|
-
if (o.cmpn(0) === 0) return
|
|
3218
|
-
var
|
|
3216
|
+
var t = e.z.redSqr(), r = this.z.redSqr(), n = this.x.redMul(t), i = e.x.redMul(r), s = this.y.redMul(t.redMul(e.z)), a = e.y.redMul(r.redMul(this.z)), o = n.redSub(i), c = s.redSub(a);
|
|
3217
|
+
if (o.cmpn(0) === 0) return c.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
|
|
3218
|
+
var d = o.redSqr(), h = d.redMul(o), l = n.redMul(d), _ = c.redSqr().redIAdd(h).redISub(l).redISub(l), v = c.redMul(l.redISub(_)).redISub(s.redMul(h)), A = this.z.redMul(e.z).redMul(o);
|
|
3219
3219
|
return this.curve.jpoint(_, v, A);
|
|
3220
3220
|
}, Pe.prototype.mixedAdd = function(e) {
|
|
3221
3221
|
if (this.isInfinity()) return e.toJ();
|
|
3222
3222
|
if (e.isInfinity()) return this;
|
|
3223
3223
|
var t = this.z.redSqr(), r = this.x, n = e.x.redMul(t), i = this.y, s = e.y.redMul(t).redMul(this.z), a = r.redSub(n), o = i.redSub(s);
|
|
3224
3224
|
if (a.cmpn(0) === 0) return o.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
|
|
3225
|
-
var
|
|
3225
|
+
var c = a.redSqr(), d = c.redMul(a), h = r.redMul(c), l = o.redSqr().redIAdd(d).redISub(h).redISub(h), _ = o.redMul(h.redISub(l)).redISub(i.redMul(d)), v = this.z.redMul(a);
|
|
3226
3226
|
return this.curve.jpoint(l, _, v);
|
|
3227
3227
|
}, Pe.prototype.dblp = function(e) {
|
|
3228
3228
|
if (e === 0) return this;
|
|
@@ -3234,14 +3234,14 @@ ir.prototype._getEndomorphism = function(e) {
|
|
|
3234
3234
|
for (t = 0; t < e; t++) r = r.dbl();
|
|
3235
3235
|
return r;
|
|
3236
3236
|
}
|
|
3237
|
-
var n = this.curve.a, i = this.curve.tinv, s = this.x, a = this.y, o = this.z,
|
|
3237
|
+
var n = this.curve.a, i = this.curve.tinv, s = this.x, a = this.y, o = this.z, c = o.redSqr().redSqr(), d = a.redAdd(a);
|
|
3238
3238
|
for (t = 0; t < e; t++) {
|
|
3239
|
-
var h = s.redSqr(), l =
|
|
3239
|
+
var h = s.redSqr(), l = d.redSqr(), _ = l.redSqr(), v = h.redAdd(h).redIAdd(h).redIAdd(n.redMul(c)), A = s.redMul(l), I = v.redSqr().redISub(A.redAdd(A)), x = A.redISub(I), M = v.redMul(x);
|
|
3240
3240
|
M = M.redIAdd(M).redISub(_);
|
|
3241
|
-
var k =
|
|
3242
|
-
t + 1 < e && (
|
|
3241
|
+
var k = d.redMul(o);
|
|
3242
|
+
t + 1 < e && (c = c.redMul(_)), s = I, o = k, d = M;
|
|
3243
3243
|
}
|
|
3244
|
-
return this.curve.jpoint(s,
|
|
3244
|
+
return this.curve.jpoint(s, d.redMul(i), o);
|
|
3245
3245
|
}, Pe.prototype.dbl = function() {
|
|
3246
3246
|
return this.isInfinity() ? this : this.curve.zeroA ? this._zeroDbl() : this.curve.threeA ? this._threeDbl() : this._dbl();
|
|
3247
3247
|
}, Pe.prototype._zeroDbl = function() {
|
|
@@ -3249,8 +3249,8 @@ ir.prototype._getEndomorphism = function(e) {
|
|
|
3249
3249
|
if (this.zOne) {
|
|
3250
3250
|
var n = this.x.redSqr(), i = this.y.redSqr(), s = i.redSqr(), a = this.x.redAdd(i).redSqr().redISub(n).redISub(s);
|
|
3251
3251
|
a = a.redIAdd(a);
|
|
3252
|
-
var o = n.redAdd(n).redIAdd(n),
|
|
3253
|
-
|
|
3252
|
+
var o = n.redAdd(n).redIAdd(n), c = o.redSqr().redISub(a).redISub(a), d = s.redIAdd(s);
|
|
3253
|
+
d = (d = d.redIAdd(d)).redIAdd(d), e = c, t = o.redMul(a.redISub(c)).redISub(d), r = this.y.redAdd(this.y);
|
|
3254
3254
|
} else {
|
|
3255
3255
|
var h = this.x.redSqr(), l = this.y.redSqr(), _ = l.redSqr(), v = this.x.redAdd(l).redSqr().redISub(h).redISub(_);
|
|
3256
3256
|
v = v.redIAdd(v);
|
|
@@ -3263,10 +3263,10 @@ ir.prototype._getEndomorphism = function(e) {
|
|
|
3263
3263
|
if (this.zOne) {
|
|
3264
3264
|
var n = this.x.redSqr(), i = this.y.redSqr(), s = i.redSqr(), a = this.x.redAdd(i).redSqr().redISub(n).redISub(s);
|
|
3265
3265
|
a = a.redIAdd(a);
|
|
3266
|
-
var o = n.redAdd(n).redIAdd(n).redIAdd(this.curve.a),
|
|
3267
|
-
e =
|
|
3268
|
-
var
|
|
3269
|
-
|
|
3266
|
+
var o = n.redAdd(n).redIAdd(n).redIAdd(this.curve.a), c = o.redSqr().redISub(a).redISub(a);
|
|
3267
|
+
e = c;
|
|
3268
|
+
var d = s.redIAdd(s);
|
|
3269
|
+
d = (d = d.redIAdd(d)).redIAdd(d), t = o.redMul(a.redISub(c)).redISub(d), r = this.y.redAdd(this.y);
|
|
3270
3270
|
} else {
|
|
3271
3271
|
var h = this.z.redSqr(), l = this.y.redSqr(), _ = this.x.redMul(l), v = this.x.redSub(h).redMul(this.x.redAdd(h));
|
|
3272
3272
|
v = v.redAdd(v).redIAdd(v);
|
|
@@ -3277,19 +3277,19 @@ ir.prototype._getEndomorphism = function(e) {
|
|
|
3277
3277
|
}
|
|
3278
3278
|
return this.curve.jpoint(e, t, r);
|
|
3279
3279
|
}, Pe.prototype._dbl = function() {
|
|
3280
|
-
var e = this.curve.a, t = this.x, r = this.y, n = this.z, i = n.redSqr().redSqr(), s = t.redSqr(), a = r.redSqr(), o = s.redAdd(s).redIAdd(s).redIAdd(e.redMul(i)),
|
|
3280
|
+
var e = this.curve.a, t = this.x, r = this.y, n = this.z, i = n.redSqr().redSqr(), s = t.redSqr(), a = r.redSqr(), o = s.redAdd(s).redIAdd(s).redIAdd(e.redMul(i)), c = t.redAdd(t), d = (c = c.redIAdd(c)).redMul(a), h = o.redSqr().redISub(d.redAdd(d)), l = d.redISub(h), _ = a.redSqr();
|
|
3281
3281
|
_ = (_ = (_ = _.redIAdd(_)).redIAdd(_)).redIAdd(_);
|
|
3282
3282
|
var v = o.redMul(l).redISub(_), A = r.redAdd(r).redMul(n);
|
|
3283
3283
|
return this.curve.jpoint(h, v, A);
|
|
3284
3284
|
}, Pe.prototype.trpl = function() {
|
|
3285
3285
|
if (!this.curve.zeroA) return this.dbl().add(this);
|
|
3286
|
-
var e = this.x.redSqr(), t = this.y.redSqr(), r = this.z.redSqr(), n = t.redSqr(), i = e.redAdd(e).redIAdd(e), s = i.redSqr(), a = this.x.redAdd(t).redSqr().redISub(e).redISub(n), o = (a = (a = (a = a.redIAdd(a)).redAdd(a).redIAdd(a)).redISub(s)).redSqr(),
|
|
3287
|
-
|
|
3288
|
-
var
|
|
3286
|
+
var e = this.x.redSqr(), t = this.y.redSqr(), r = this.z.redSqr(), n = t.redSqr(), i = e.redAdd(e).redIAdd(e), s = i.redSqr(), a = this.x.redAdd(t).redSqr().redISub(e).redISub(n), o = (a = (a = (a = a.redIAdd(a)).redAdd(a).redIAdd(a)).redISub(s)).redSqr(), c = n.redIAdd(n);
|
|
3287
|
+
c = (c = (c = c.redIAdd(c)).redIAdd(c)).redIAdd(c);
|
|
3288
|
+
var d = i.redIAdd(a).redSqr().redISub(s).redISub(o).redISub(c), h = t.redMul(d);
|
|
3289
3289
|
h = (h = h.redIAdd(h)).redIAdd(h);
|
|
3290
3290
|
var l = this.x.redMul(o).redISub(h);
|
|
3291
3291
|
l = (l = l.redIAdd(l)).redIAdd(l);
|
|
3292
|
-
var _ = this.y.redMul(
|
|
3292
|
+
var _ = this.y.redMul(d.redMul(c.redISub(d)).redISub(a.redMul(o)));
|
|
3293
3293
|
_ = (_ = (_ = _.redIAdd(_)).redIAdd(_)).redIAdd(_);
|
|
3294
3294
|
var v = this.z.redAdd(a).redSqr().redISub(r).redISub(o);
|
|
3295
3295
|
return this.curve.jpoint(l, _, v);
|
|
@@ -3347,8 +3347,8 @@ Ln.prototype.validate = function(e) {
|
|
|
3347
3347
|
}, Ee.prototype.add = function() {
|
|
3348
3348
|
throw new Error("Not supported on Montgomery curve");
|
|
3349
3349
|
}, Ee.prototype.diffAdd = function(e, t) {
|
|
3350
|
-
var r = this.x.redAdd(this.z), n = this.x.redSub(this.z), i = e.x.redAdd(e.z), s = e.x.redSub(e.z).redMul(r), a = i.redMul(n), o = t.z.redMul(s.redAdd(a).redSqr()),
|
|
3351
|
-
return this.curve.point(o,
|
|
3350
|
+
var r = this.x.redAdd(this.z), n = this.x.redSub(this.z), i = e.x.redAdd(e.z), s = e.x.redSub(e.z).redMul(r), a = i.redMul(n), o = t.z.redMul(s.redAdd(a).redSqr()), c = t.x.redMul(s.redISub(a).redSqr());
|
|
3351
|
+
return this.curve.point(o, c);
|
|
3352
3352
|
}, Ee.prototype.mul = function(e) {
|
|
3353
3353
|
for (var t = e.clone(), r = this, n = this.curve.point(null, null), i = []; t.cmpn(0) !== 0; t.iushrn(1)) i.push(t.andln(1));
|
|
3354
3354
|
for (var s = i.length - 1; s >= 0; s--) i[s] === 0 ? (r = r.diffAdd(n, this), n = n.dbl()) : (n = r.diffAdd(n, this), r = r.dbl());
|
|
@@ -3413,23 +3413,23 @@ gr.prototype._mulA = function(e) {
|
|
|
3413
3413
|
}, ue.prototype._extDbl = function() {
|
|
3414
3414
|
var e = this.x.redSqr(), t = this.y.redSqr(), r = this.z.redSqr();
|
|
3415
3415
|
r = r.redIAdd(r);
|
|
3416
|
-
var n = this.curve._mulA(e), i = this.x.redAdd(this.y).redSqr().redISub(e).redISub(t), s = n.redAdd(t), a = s.redSub(r), o = n.redSub(t),
|
|
3417
|
-
return this.curve.point(
|
|
3416
|
+
var n = this.curve._mulA(e), i = this.x.redAdd(this.y).redSqr().redISub(e).redISub(t), s = n.redAdd(t), a = s.redSub(r), o = n.redSub(t), c = i.redMul(a), d = s.redMul(o), h = i.redMul(o), l = a.redMul(s);
|
|
3417
|
+
return this.curve.point(c, d, l, h);
|
|
3418
3418
|
}, ue.prototype._projDbl = function() {
|
|
3419
|
-
var e, t, r, n, i, s, a = this.x.redAdd(this.y).redSqr(), o = this.x.redSqr(),
|
|
3419
|
+
var e, t, r, n, i, s, a = this.x.redAdd(this.y).redSqr(), o = this.x.redSqr(), c = this.y.redSqr();
|
|
3420
3420
|
if (this.curve.twisted) {
|
|
3421
|
-
var
|
|
3422
|
-
this.zOne ? (e = a.redSub(o).redSub(
|
|
3423
|
-
} else n = o.redAdd(
|
|
3421
|
+
var d = (n = this.curve._mulA(o)).redAdd(c);
|
|
3422
|
+
this.zOne ? (e = a.redSub(o).redSub(c).redMul(d.redSub(this.curve.two)), t = d.redMul(n.redSub(c)), r = d.redSqr().redSub(d).redSub(d)) : (i = this.z.redSqr(), s = d.redSub(i).redISub(i), e = a.redSub(o).redISub(c).redMul(s), t = d.redMul(n.redSub(c)), r = d.redMul(s));
|
|
3423
|
+
} else n = o.redAdd(c), i = this.curve._mulC(this.z).redSqr(), s = n.redSub(i).redSub(i), e = this.curve._mulC(a.redISub(n)).redMul(s), t = this.curve._mulC(n).redMul(o.redISub(c)), r = n.redMul(s);
|
|
3424
3424
|
return this.curve.point(e, t, r);
|
|
3425
3425
|
}, ue.prototype.dbl = function() {
|
|
3426
3426
|
return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();
|
|
3427
3427
|
}, ue.prototype._extAdd = function(e) {
|
|
3428
|
-
var t = this.y.redSub(this.x).redMul(e.y.redSub(e.x)), r = this.y.redAdd(this.x).redMul(e.y.redAdd(e.x)), n = this.t.redMul(this.curve.dd).redMul(e.t), i = this.z.redMul(e.z.redAdd(e.z)), s = r.redSub(t), a = i.redSub(n), o = i.redAdd(n),
|
|
3429
|
-
return this.curve.point(
|
|
3428
|
+
var t = this.y.redSub(this.x).redMul(e.y.redSub(e.x)), r = this.y.redAdd(this.x).redMul(e.y.redAdd(e.x)), n = this.t.redMul(this.curve.dd).redMul(e.t), i = this.z.redMul(e.z.redAdd(e.z)), s = r.redSub(t), a = i.redSub(n), o = i.redAdd(n), c = r.redAdd(t), d = s.redMul(a), h = o.redMul(c), l = s.redMul(c), _ = a.redMul(o);
|
|
3429
|
+
return this.curve.point(d, h, _, l);
|
|
3430
3430
|
}, ue.prototype._projAdd = function(e) {
|
|
3431
|
-
var t, r, n = this.z.redMul(e.z), i = n.redSqr(), s = this.x.redMul(e.x), a = this.y.redMul(e.y), o = this.curve.d.redMul(s).redMul(a),
|
|
3432
|
-
return this.curve.twisted ? (t = n.redMul(
|
|
3431
|
+
var t, r, n = this.z.redMul(e.z), i = n.redSqr(), s = this.x.redMul(e.x), a = this.y.redMul(e.y), o = this.curve.d.redMul(s).redMul(a), c = i.redSub(o), d = i.redAdd(o), h = this.x.redAdd(this.y).redMul(e.x.redAdd(e.y)).redISub(s).redISub(a), l = n.redMul(c).redMul(h);
|
|
3432
|
+
return this.curve.twisted ? (t = n.redMul(d).redMul(a.redSub(this.curve._mulA(s))), r = c.redMul(d)) : (t = n.redMul(d).redMul(a.redSub(s)), r = this.curve._mulC(c).redMul(d)), this.curve.point(l, t, r);
|
|
3433
3433
|
}, ue.prototype.add = function(e) {
|
|
3434
3434
|
return this.isInfinity() ? e : e.isInfinity() ? this : this.curve.extended ? this._extAdd(e) : this._projAdd(e);
|
|
3435
3435
|
}, ue.prototype.mul = function(e) {
|
|
@@ -3499,8 +3499,8 @@ Kt.inherits = oh, Kt.toArray = function(e, t) {
|
|
|
3499
3499
|
var i = r - t;
|
|
3500
3500
|
sh(i % 4 == 0);
|
|
3501
3501
|
for (var s = new Array(i / 4), a = 0, o = t; a < s.length; a++, o += 4) {
|
|
3502
|
-
var
|
|
3503
|
-
|
|
3502
|
+
var c;
|
|
3503
|
+
c = n === "big" ? e[o] << 24 | e[o + 1] << 16 | e[o + 2] << 8 | e[o + 3] : e[o + 3] << 24 | e[o + 2] << 16 | e[o + 1] << 8 | e[o], s[a] = c >>> 0;
|
|
3504
3504
|
}
|
|
3505
3505
|
return s;
|
|
3506
3506
|
}, Kt.split32 = function(e, t) {
|
|
@@ -3529,15 +3529,15 @@ Kt.inherits = oh, Kt.toArray = function(e, t) {
|
|
|
3529
3529
|
}, Kt.sum64_lo = function(e, t, r, n) {
|
|
3530
3530
|
return t + n >>> 0;
|
|
3531
3531
|
}, Kt.sum64_4_hi = function(e, t, r, n, i, s, a, o) {
|
|
3532
|
-
var
|
|
3533
|
-
return
|
|
3532
|
+
var c = 0, d = t;
|
|
3533
|
+
return c += (d = d + n >>> 0) < t ? 1 : 0, c += (d = d + s >>> 0) < s ? 1 : 0, e + r + i + a + (c += (d = d + o >>> 0) < o ? 1 : 0) >>> 0;
|
|
3534
3534
|
}, Kt.sum64_4_lo = function(e, t, r, n, i, s, a, o) {
|
|
3535
3535
|
return t + n + s + o >>> 0;
|
|
3536
|
-
}, Kt.sum64_5_hi = function(e, t, r, n, i, s, a, o,
|
|
3536
|
+
}, Kt.sum64_5_hi = function(e, t, r, n, i, s, a, o, c, d) {
|
|
3537
3537
|
var h = 0, l = t;
|
|
3538
|
-
return h += (l = l + n >>> 0) < t ? 1 : 0, h += (l = l + s >>> 0) < s ? 1 : 0, h += (l = l + o >>> 0) < o ? 1 : 0, e + r + i + a +
|
|
3539
|
-
}, Kt.sum64_5_lo = function(e, t, r, n, i, s, a, o,
|
|
3540
|
-
return t + n + s + o +
|
|
3538
|
+
return h += (l = l + n >>> 0) < t ? 1 : 0, h += (l = l + s >>> 0) < s ? 1 : 0, h += (l = l + o >>> 0) < o ? 1 : 0, e + r + i + a + c + (h += (l = l + d >>> 0) < d ? 1 : 0) >>> 0;
|
|
3539
|
+
}, Kt.sum64_5_lo = function(e, t, r, n, i, s, a, o, c, d) {
|
|
3540
|
+
return t + n + s + o + d >>> 0;
|
|
3541
3541
|
}, Kt.rotr64_hi = function(e, t, r) {
|
|
3542
3542
|
return (t << 32 - r | e >>> r) >>> 0;
|
|
3543
3543
|
}, Kt.rotr64_lo = function(e, t, r) {
|
|
@@ -3601,12 +3601,12 @@ var ph = xr;
|
|
|
3601
3601
|
xr.blockSize = 512, xr.outSize = 160, xr.hmacStrength = 80, xr.padLength = 64, xr.prototype._update = function(e, t) {
|
|
3602
3602
|
for (var r = this.W, n = 0; n < 16; n++) r[n] = e[t + n];
|
|
3603
3603
|
for (; n < r.length; n++) r[n] = Ws(r[n - 3] ^ r[n - 8] ^ r[n - 14] ^ r[n - 16], 1);
|
|
3604
|
-
var i = this.h[0], s = this.h[1], a = this.h[2], o = this.h[3],
|
|
3604
|
+
var i = this.h[0], s = this.h[1], a = this.h[2], o = this.h[3], c = this.h[4];
|
|
3605
3605
|
for (n = 0; n < r.length; n++) {
|
|
3606
|
-
var
|
|
3607
|
-
|
|
3606
|
+
var d = ~~(n / 20), h = hh(Ws(i, 5), uh(d, s, a, o), c, r[n], lh[d]);
|
|
3607
|
+
c = o, o = a, a = Ws(s, 30), s = i, i = h;
|
|
3608
3608
|
}
|
|
3609
|
-
this.h[0] = ii(this.h[0], i), this.h[1] = ii(this.h[1], s), this.h[2] = ii(this.h[2], a), this.h[3] = ii(this.h[3], o), this.h[4] = ii(this.h[4],
|
|
3609
|
+
this.h[0] = ii(this.h[0], i), this.h[1] = ii(this.h[1], s), this.h[2] = ii(this.h[2], a), this.h[3] = ii(this.h[3], o), this.h[4] = ii(this.h[4], c);
|
|
3610
3610
|
}, xr.prototype._digest = function(e) {
|
|
3611
3611
|
return e === "hex" ? Zn.toHex32(this.h, "big") : Zn.split32(this.h, "big");
|
|
3612
3612
|
};
|
|
@@ -3620,12 +3620,12 @@ var Xd = Ar;
|
|
|
3620
3620
|
Ar.blockSize = 512, Ar.outSize = 256, Ar.hmacStrength = 192, Ar.padLength = 64, Ar.prototype._update = function(e, t) {
|
|
3621
3621
|
for (var r = this.W, n = 0; n < 16; n++) r[n] = e[t + n];
|
|
3622
3622
|
for (; n < r.length; n++) r[n] = yh(Sh(r[n - 2]), r[n - 7], Ah(r[n - 15]), r[n - 16]);
|
|
3623
|
-
var i = this.h[0], s = this.h[1], a = this.h[2], o = this.h[3],
|
|
3623
|
+
var i = this.h[0], s = this.h[1], a = this.h[2], o = this.h[3], c = this.h[4], d = this.h[5], h = this.h[6], l = this.h[7];
|
|
3624
3624
|
for (bh(this.k.length === r.length), n = 0; n < r.length; n++) {
|
|
3625
|
-
var _ = gh(l, xh(
|
|
3626
|
-
l = h, h =
|
|
3625
|
+
var _ = gh(l, xh(c), vh(c, d, h), this.k[n], r[n]), v = cr(wh(i), _h(i, s, a));
|
|
3626
|
+
l = h, h = d, d = c, c = cr(o, _), o = a, a = s, s = i, i = cr(_, v);
|
|
3627
3627
|
}
|
|
3628
|
-
this.h[0] = cr(this.h[0], i), this.h[1] = cr(this.h[1], s), this.h[2] = cr(this.h[2], a), this.h[3] = cr(this.h[3], o), this.h[4] = cr(this.h[4],
|
|
3628
|
+
this.h[0] = cr(this.h[0], i), this.h[1] = cr(this.h[1], s), this.h[2] = cr(this.h[2], a), this.h[3] = cr(this.h[3], o), this.h[4] = cr(this.h[4], c), this.h[5] = cr(this.h[5], d), this.h[6] = cr(this.h[6], h), this.h[7] = cr(this.h[7], l);
|
|
3629
3629
|
}, Ar.prototype._digest = function(e) {
|
|
3630
3630
|
return e === "hex" ? Vn.toHex32(this.h, "big") : Vn.split32(this.h, "big");
|
|
3631
3631
|
};
|
|
@@ -3697,20 +3697,20 @@ function Zh(e, t) {
|
|
|
3697
3697
|
hr.blockSize = 1024, hr.outSize = 512, hr.hmacStrength = 192, hr.padLength = 128, hr.prototype._prepareBlock = function(e, t) {
|
|
3698
3698
|
for (var r = this.W, n = 0; n < 32; n++) r[n] = e[t + n];
|
|
3699
3699
|
for (; n < r.length; n += 2) {
|
|
3700
|
-
var i = Fh(r[n - 4], r[n - 3]), s = Zh(r[n - 4], r[n - 3]), a = r[n - 14], o = r[n - 13],
|
|
3701
|
-
r[n] = Th(i, s, a, o,
|
|
3700
|
+
var i = Fh(r[n - 4], r[n - 3]), s = Zh(r[n - 4], r[n - 3]), a = r[n - 14], o = r[n - 13], c = Hh(r[n - 30], r[n - 29]), d = Dh(r[n - 30], r[n - 29]), h = r[n - 32], l = r[n - 31];
|
|
3701
|
+
r[n] = Th(i, s, a, o, c, d, h, l), r[n + 1] = Rh(i, s, a, o, c, d, h, l);
|
|
3702
3702
|
}
|
|
3703
3703
|
}, hr.prototype._update = function(e, t) {
|
|
3704
3704
|
this._prepareBlock(e, t);
|
|
3705
|
-
var r = this.W, n = this.h[0], i = this.h[1], s = this.h[2], a = this.h[3], o = this.h[4],
|
|
3705
|
+
var r = this.W, n = this.h[0], i = this.h[1], s = this.h[2], a = this.h[3], o = this.h[4], c = this.h[5], d = this.h[6], h = this.h[7], l = this.h[8], _ = this.h[9], v = this.h[10], A = this.h[11], I = this.h[12], x = this.h[13], M = this.h[14], k = this.h[15];
|
|
3706
3706
|
Ih(this.k.length === r.length);
|
|
3707
3707
|
for (var O = 0; O < r.length; O += 2) {
|
|
3708
3708
|
var E = M, R = k, L = qh(l, _), z = Uh(l, _), f = Bh(l, _, v, A, I), p = Ph(l, _, v, A, I, x), g = this.k[O], m = this.k[O + 1], u = r[O], y = r[O + 1], w = Nh(E, R, L, z, f, p, g, m, u, y), P = Oh(E, R, L, z, f, p, g, m, u, y);
|
|
3709
|
-
E = zh(n, i), R = $h(n, i), L = Lh(n, i, s, a, o), z = jh(n, i, s, a, o,
|
|
3709
|
+
E = zh(n, i), R = $h(n, i), L = Lh(n, i, s, a, o), z = jh(n, i, s, a, o, c);
|
|
3710
3710
|
var N = Ys(E, R, L, z), j = Qs(E, R, L, z);
|
|
3711
|
-
M = I, k = x, I = v, x = A, v = l, A = _, l = Ys(
|
|
3711
|
+
M = I, k = x, I = v, x = A, v = l, A = _, l = Ys(d, h, w, P), _ = Qs(h, h, w, P), d = o, h = c, o = s, c = a, s = n, a = i, n = Ys(w, P, N, j), i = Qs(w, P, N, j);
|
|
3712
3712
|
}
|
|
3713
|
-
Kr(this.h, 0, n, i), Kr(this.h, 2, s, a), Kr(this.h, 4, o,
|
|
3713
|
+
Kr(this.h, 0, n, i), Kr(this.h, 2, s, a), Kr(this.h, 4, o, c), Kr(this.h, 6, d, h), Kr(this.h, 8, l, _), Kr(this.h, 10, v, A), Kr(this.h, 12, I, x), Kr(this.h, 14, M, k);
|
|
3714
3714
|
}, hr.prototype._digest = function(e) {
|
|
3715
3715
|
return e === "hex" ? Ge.toHex32(this.h, "big") : Ge.split32(this.h, "big");
|
|
3716
3716
|
};
|
|
@@ -3739,11 +3739,11 @@ function Yh(e) {
|
|
|
3739
3739
|
return e <= 15 ? 1352829926 : e <= 31 ? 1548603684 : e <= 47 ? 1836072691 : e <= 63 ? 2053994217 : 0;
|
|
3740
3740
|
}
|
|
3741
3741
|
gn.inherits(_r, a1), o1.ripemd160 = _r, _r.blockSize = 512, _r.outSize = 160, _r.hmacStrength = 192, _r.padLength = 64, _r.prototype._update = function(e, t) {
|
|
3742
|
-
for (var r = this.h[0], n = this.h[1], i = this.h[2], s = this.h[3], a = this.h[4], o = r,
|
|
3742
|
+
for (var r = this.h[0], n = this.h[1], i = this.h[2], s = this.h[3], a = this.h[4], o = r, c = n, d = i, h = s, l = a, _ = 0; _ < 80; _++) {
|
|
3743
3743
|
var v = t0(Yi(e0(r, r0(_, n, i, s), e[Qh[_] + t], Wh(_)), Jh[_]), a);
|
|
3744
|
-
r = a, a = s, s = Yi(i, 10), i = n, n = v, v = t0(Yi(e0(o, r0(79 - _,
|
|
3744
|
+
r = a, a = s, s = Yi(i, 10), i = n, n = v, v = t0(Yi(e0(o, r0(79 - _, c, d, h), e[Gh[_] + t], Yh(_)), Xh[_]), l), o = l, l = h, h = Yi(d, 10), d = c, c = v;
|
|
3745
3745
|
}
|
|
3746
|
-
v = si(this.h[1], i, h), this.h[1] = si(this.h[2], s, l), this.h[2] = si(this.h[3], a, o), this.h[3] = si(this.h[4], r,
|
|
3746
|
+
v = si(this.h[1], i, h), this.h[1] = si(this.h[2], s, l), this.h[2] = si(this.h[3], a, o), this.h[3] = si(this.h[4], r, c), this.h[4] = si(this.h[0], n, d), this.h[0] = v;
|
|
3747
3747
|
}, _r.prototype._digest = function(e) {
|
|
3748
3748
|
return e === "hex" ? gn.toHex32(this.h, "little") : gn.split32(this.h, "little");
|
|
3749
3749
|
};
|
|
@@ -3771,10 +3771,10 @@ qn.prototype._init = function(e) {
|
|
|
3771
3771
|
function s(o) {
|
|
3772
3772
|
o.type === "short" ? this.curve = new n.short(o) : o.type === "edwards" ? this.curve = new n.edwards(o) : this.curve = new n.mont(o), this.g = this.curve.g, this.n = this.curve.n, this.hash = o.hash, i(this.g.validate(), "Invalid curve"), i(this.g.mul(this.n).isInfinity(), "Invalid curve, G*N != O");
|
|
3773
3773
|
}
|
|
3774
|
-
function a(o,
|
|
3774
|
+
function a(o, c) {
|
|
3775
3775
|
Object.defineProperty(t, o, { configurable: !0, enumerable: !0, get: function() {
|
|
3776
|
-
var
|
|
3777
|
-
return Object.defineProperty(t, o, { configurable: !0, enumerable: !0, value:
|
|
3776
|
+
var d = new s(c);
|
|
3777
|
+
return Object.defineProperty(t, o, { configurable: !0, enumerable: !0, value: d }), d;
|
|
3778
3778
|
} });
|
|
3779
3779
|
}
|
|
3780
3780
|
t.PresetCurve = s, a("p192", { type: "short", prime: "p192", p: "ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff", a: "ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc", b: "64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1", n: "ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831", hash: r.sha256, gRed: !1, g: ["188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012", "07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811"] }), a("p224", { type: "short", prime: "p224", p: "ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001", a: "ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe", b: "b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4", n: "ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d", hash: r.sha256, gRed: !1, g: ["b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21", "bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34"] }), a("p256", { type: "short", prime: null, p: "ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff", a: "ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc", b: "5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b", n: "ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551", hash: r.sha256, gRed: !1, g: ["6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296", "4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5"] }), a("p384", { type: "short", prime: null, p: "ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff", a: "ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc", b: "b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef", n: "ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973", hash: r.sha384, gRed: !1, g: ["aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 5502f25d bf55296c 3a545e38 72760ab7", "3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 0a60b1ce 1d7e819d 7a431d7c 90ea0e5f"] }), a("p521", { type: "short", prime: null, p: "000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff", a: "000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc", b: "00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00", n: "000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409", hash: r.sha512, gRed: !1, g: ["000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66", "00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 3fad0761 353c7086 a272c240 88be9476 9fd16650"] }), a("curve25519", { type: "mont", prime: "p25519", p: "7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed", a: "76d06", b: "1", n: "1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed", hash: r.sha256, gRed: !1, g: ["9"] }), a("ed25519", { type: "edwards", prime: "p25519", p: "7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed", a: "-1", c: "1", d: "52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3", n: "1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed", hash: r.sha256, gRed: !1, g: ["216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a", "6666666666666666666666666666666666666666666666666666666666666658"] });
|
|
@@ -3938,9 +3938,9 @@ sr.prototype.keyPair = function(e) {
|
|
|
3938
3938
|
t = this.keyFromPrivate(t, r), e = this._truncateToN(e, !1, n.msgBitLength), fn(!e.isNeg(), "Can not sign a negative message");
|
|
3939
3939
|
var s = this.n.byteLength(), a = t.getPrivate().toArray("be", s), o = e.toArray("be", s);
|
|
3940
3940
|
fn(new dr(o).eq(e), "Can not sign message");
|
|
3941
|
-
for (var
|
|
3942
|
-
var l = n.k ? n.k(h) : new dr(
|
|
3943
|
-
if (!((l = this._truncateToN(l, !0)).cmpn(1) <= 0 || l.cmp(
|
|
3941
|
+
for (var c = new o0({ hash: this.hash, entropy: a, nonce: o, pers: n.pers, persEnc: n.persEnc || "utf8" }), d = this.n.sub(new dr(1)), h = 0; ; h++) {
|
|
3942
|
+
var l = n.k ? n.k(h) : new dr(c.generate(this.n.byteLength()));
|
|
3943
|
+
if (!((l = this._truncateToN(l, !0)).cmpn(1) <= 0 || l.cmp(d) >= 0)) {
|
|
3944
3944
|
var _ = this.g.mul(l);
|
|
3945
3945
|
if (!_.isInfinity()) {
|
|
3946
3946
|
var v = _.getX(), A = v.umod(this.n);
|
|
@@ -3958,13 +3958,13 @@ sr.prototype.keyPair = function(e) {
|
|
|
3958
3958
|
i || (i = {}), e = this._truncateToN(e, !1, i.msgBitLength), r = this.keyFromPublic(r, n);
|
|
3959
3959
|
var s = (t = new Qi(t, "hex")).r, a = t.s;
|
|
3960
3960
|
if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0 || a.cmpn(1) < 0 || a.cmp(this.n) >= 0) return !1;
|
|
3961
|
-
var o,
|
|
3962
|
-
return this.curve._maxwellTrick ? !(o = this.g.jmulAdd(
|
|
3961
|
+
var o, c = a.invm(this.n), d = c.mul(e).umod(this.n), h = c.mul(s).umod(this.n);
|
|
3962
|
+
return this.curve._maxwellTrick ? !(o = this.g.jmulAdd(d, r.getPublic(), h)).isInfinity() && o.eqXToP(s) : !(o = this.g.mulAdd(d, r.getPublic(), h)).isInfinity() && o.getX().umod(this.n).cmp(s) === 0;
|
|
3963
3963
|
}, sr.prototype.recoverPubKey = function(e, t, r, n) {
|
|
3964
3964
|
fn((3 & r) === r, "The recovery param is more than two bits"), t = new Qi(t, n);
|
|
3965
|
-
var i = this.n, s = new dr(e), a = t.r, o = t.s,
|
|
3966
|
-
if (a.cmp(this.curve.p.umod(this.curve.n)) >= 0 &&
|
|
3967
|
-
a =
|
|
3965
|
+
var i = this.n, s = new dr(e), a = t.r, o = t.s, c = 1 & r, d = r >> 1;
|
|
3966
|
+
if (a.cmp(this.curve.p.umod(this.curve.n)) >= 0 && d) throw new Error("Unable to find sencond key candinate");
|
|
3967
|
+
a = d ? this.curve.pointFromX(a.add(this.curve.n), c) : this.curve.pointFromX(a, c);
|
|
3968
3968
|
var h = t.r.invm(i), l = i.sub(s).mul(h).umod(i), _ = o.mul(h).umod(i);
|
|
3969
3969
|
return this.g.mulAdd(l, a, _);
|
|
3970
3970
|
}, sr.prototype.getKeyRecoveryParam = function(e, t, r, n) {
|
|
@@ -4078,28 +4078,28 @@ We.prototype.sign = function(e, t) {
|
|
|
4078
4078
|
}(l0 || (l0 = {}));
|
|
4079
4079
|
var p0 = function(e, t, r, n) {
|
|
4080
4080
|
return new (r || (r = Promise))(function(i, s) {
|
|
4081
|
-
function a(
|
|
4081
|
+
function a(d) {
|
|
4082
4082
|
try {
|
|
4083
|
-
|
|
4083
|
+
c(n.next(d));
|
|
4084
4084
|
} catch (h) {
|
|
4085
4085
|
s(h);
|
|
4086
4086
|
}
|
|
4087
4087
|
}
|
|
4088
|
-
function o(
|
|
4088
|
+
function o(d) {
|
|
4089
4089
|
try {
|
|
4090
|
-
|
|
4090
|
+
c(n.throw(d));
|
|
4091
4091
|
} catch (h) {
|
|
4092
4092
|
s(h);
|
|
4093
4093
|
}
|
|
4094
4094
|
}
|
|
4095
|
-
function d
|
|
4096
|
-
|
|
4095
|
+
function c(d) {
|
|
4096
|
+
d.done ? i(d.value) : function(h) {
|
|
4097
4097
|
return h instanceof r ? h : new r(function(l) {
|
|
4098
4098
|
l(h);
|
|
4099
4099
|
});
|
|
4100
|
-
}(
|
|
4100
|
+
}(d.value).then(a, o);
|
|
4101
4101
|
}
|
|
4102
|
-
|
|
4102
|
+
c((n = n.apply(e, t || [])).next());
|
|
4103
4103
|
});
|
|
4104
4104
|
};
|
|
4105
4105
|
const m0 = Symbol.for("web3/base-provider");
|
|
@@ -4245,8 +4245,8 @@ class ma extends Ce {
|
|
|
4245
4245
|
var s;
|
|
4246
4246
|
let a;
|
|
4247
4247
|
super(r ?? `Returned error: ${Array.isArray(t) ? t.map((o) => y0(o)).join(",") : y0(t)}`), this.code = 100, r || (this.data = Array.isArray(t) ? t.map((o) => {
|
|
4248
|
-
var
|
|
4249
|
-
return (
|
|
4248
|
+
var c;
|
|
4249
|
+
return (c = o.error) === null || c === void 0 ? void 0 : c.data;
|
|
4250
4250
|
}) : (s = t == null ? void 0 : t.error) === null || s === void 0 ? void 0 : s.data), this.statusCode = i, this.request = n, "error" in t ? a = t.error : t instanceof Array && (a = t.filter((o) => o.error).map((o) => o.error)), Array.isArray(a) && a.length > 0 ? this.cause = new gi(a) : this.cause = a;
|
|
4251
4251
|
}
|
|
4252
4252
|
toJSON() {
|
|
@@ -4273,7 +4273,7 @@ class Bu extends Ce {
|
|
|
4273
4273
|
var n, i, s, a;
|
|
4274
4274
|
if (t) if (!((n = qe[t]) === null || n === void 0) && n.message) super(qe[t].message);
|
|
4275
4275
|
else {
|
|
4276
|
-
const o = Object.keys(qe).find((
|
|
4276
|
+
const o = Object.keys(qe).find((c) => typeof c == "string" && t >= parseInt(c.split("-")[0], 10) && t <= parseInt(c.split("-")[1], 10));
|
|
4277
4277
|
super((s = (i = qe[o ?? ""]) === null || i === void 0 ? void 0 : i.message) !== null && s !== void 0 ? s : f1.replace("*code*", (a = t == null ? void 0 : t.toString()) !== null && a !== void 0 ? a : '""'));
|
|
4278
4278
|
}
|
|
4279
4279
|
else super();
|
|
@@ -4417,17 +4417,17 @@ class ga extends ya {
|
|
|
4417
4417
|
for (let i = 24 - r; i < 24; i++) {
|
|
4418
4418
|
for (let o = 0; o < 10; o++) n[o] = t[o] ^ t[o + 10] ^ t[o + 20] ^ t[o + 30] ^ t[o + 40];
|
|
4419
4419
|
for (let o = 0; o < 10; o += 2) {
|
|
4420
|
-
const
|
|
4420
|
+
const c = (o + 8) % 10, d = (o + 2) % 10, h = n[d], l = n[d + 1], _ = w0(h, l, 1) ^ n[c], v = x0(h, l, 1) ^ n[c + 1];
|
|
4421
4421
|
for (let A = 0; A < 50; A += 10) t[o + A] ^= _, t[o + A + 1] ^= v;
|
|
4422
4422
|
}
|
|
4423
4423
|
let s = t[2], a = t[3];
|
|
4424
4424
|
for (let o = 0; o < 24; o++) {
|
|
4425
|
-
const
|
|
4426
|
-
s = t[l], a = t[l + 1], t[l] =
|
|
4425
|
+
const c = m1[o], d = w0(s, a, c), h = x0(s, a, c), l = p1[o];
|
|
4426
|
+
s = t[l], a = t[l + 1], t[l] = d, t[l + 1] = h;
|
|
4427
4427
|
}
|
|
4428
4428
|
for (let o = 0; o < 50; o += 10) {
|
|
4429
|
-
for (let
|
|
4430
|
-
for (let
|
|
4429
|
+
for (let c = 0; c < 10; c++) n[c] = t[o + c];
|
|
4430
|
+
for (let c = 0; c < 10; c++) t[o + c] ^= ~n[(c + 2) % 10] & n[(c + 4) % 10];
|
|
4431
4431
|
}
|
|
4432
4432
|
t[0] ^= Zu[i], t[1] ^= Vu[i];
|
|
4433
4433
|
}
|
|
@@ -4565,10 +4565,10 @@ class Je extends Error {
|
|
|
4565
4565
|
else if (a.code === "invalid_arguments") i(a.argumentsError);
|
|
4566
4566
|
else if (a.path.length === 0) n._errors.push(r(a));
|
|
4567
4567
|
else {
|
|
4568
|
-
let o = n,
|
|
4569
|
-
for (;
|
|
4570
|
-
const
|
|
4571
|
-
|
|
4568
|
+
let o = n, c = 0;
|
|
4569
|
+
for (; c < a.path.length; ) {
|
|
4570
|
+
const d = a.path[c];
|
|
4571
|
+
c === a.path.length - 1 ? (o[d] = o[d] || { _errors: [] }, o[d]._errors.push(r(a))) : o[d] = o[d] || { _errors: [] }, o = o[d], c++;
|
|
4572
4572
|
}
|
|
4573
4573
|
}
|
|
4574
4574
|
};
|
|
@@ -4663,8 +4663,8 @@ const ms = (e) => {
|
|
|
4663
4663
|
const { data: t, path: r, errorMaps: n, issueData: i } = e, s = [...r, ...i.path || []], a = { ...i, path: s };
|
|
4664
4664
|
if (i.message !== void 0) return { ...i, path: s, message: i.message };
|
|
4665
4665
|
let o = "";
|
|
4666
|
-
const
|
|
4667
|
-
for (const
|
|
4666
|
+
const c = n.filter((d) => !!d).slice().reverse();
|
|
4667
|
+
for (const d of c) o = d(a, { data: t, defaultError: o }).message;
|
|
4668
4668
|
return { ...i, path: s, message: o };
|
|
4669
4669
|
};
|
|
4670
4670
|
function ft(e, t) {
|
|
@@ -4793,7 +4793,7 @@ class qt {
|
|
|
4793
4793
|
const n = (i) => typeof r == "string" || r === void 0 ? { message: r } : typeof r == "function" ? r(i) : r;
|
|
4794
4794
|
return this._refinement((i, s) => {
|
|
4795
4795
|
const a = t(i), o = () => s.addIssue({ code: J.custom, ...n(i) });
|
|
4796
|
-
return typeof Promise < "u" && a instanceof Promise ? a.then((
|
|
4796
|
+
return typeof Promise < "u" && a instanceof Promise ? a.then((c) => !!c || (o(), !1)) : !!a || (o(), !1);
|
|
4797
4797
|
});
|
|
4798
4798
|
}
|
|
4799
4799
|
refinement(t, r) {
|
|
@@ -5377,36 +5377,36 @@ class me extends qt {
|
|
|
5377
5377
|
}
|
|
5378
5378
|
_parse(t) {
|
|
5379
5379
|
if (this._getType(t) !== yt.object) {
|
|
5380
|
-
const
|
|
5381
|
-
return ft(
|
|
5380
|
+
const c = this._getOrReturnCtx(t);
|
|
5381
|
+
return ft(c, { code: J.invalid_type, expected: yt.object, received: c.parsedType }), Mt;
|
|
5382
5382
|
}
|
|
5383
5383
|
const { status: r, ctx: n } = this._processInputParams(t), { shape: i, keys: s } = this._getCached(), a = [];
|
|
5384
|
-
if (!(this._def.catchall instanceof Dr && this._def.unknownKeys === "strip")) for (const
|
|
5384
|
+
if (!(this._def.catchall instanceof Dr && this._def.unknownKeys === "strip")) for (const c in n.data) s.includes(c) || a.push(c);
|
|
5385
5385
|
const o = [];
|
|
5386
|
-
for (const
|
|
5387
|
-
const
|
|
5388
|
-
o.push({ key: { status: "valid", value:
|
|
5386
|
+
for (const c of s) {
|
|
5387
|
+
const d = i[c], h = n.data[c];
|
|
5388
|
+
o.push({ key: { status: "valid", value: c }, value: d._parse(new Tr(n, h, n.path, c)), alwaysSet: c in n.data });
|
|
5389
5389
|
}
|
|
5390
5390
|
if (this._def.catchall instanceof Dr) {
|
|
5391
|
-
const
|
|
5392
|
-
if (
|
|
5393
|
-
else if (
|
|
5394
|
-
else if (
|
|
5391
|
+
const c = this._def.unknownKeys;
|
|
5392
|
+
if (c === "passthrough") for (const d of a) o.push({ key: { status: "valid", value: d }, value: { status: "valid", value: n.data[d] } });
|
|
5393
|
+
else if (c === "strict") a.length > 0 && (ft(n, { code: J.unrecognized_keys, keys: a }), r.dirty());
|
|
5394
|
+
else if (c !== "strip") throw new Error("Internal ZodObject error: invalid unknownKeys value.");
|
|
5395
5395
|
} else {
|
|
5396
|
-
const
|
|
5397
|
-
for (const
|
|
5398
|
-
const h = n.data[
|
|
5399
|
-
o.push({ key: { status: "valid", value:
|
|
5396
|
+
const c = this._def.catchall;
|
|
5397
|
+
for (const d of a) {
|
|
5398
|
+
const h = n.data[d];
|
|
5399
|
+
o.push({ key: { status: "valid", value: d }, value: c._parse(new Tr(n, h, n.path, d)), alwaysSet: d in n.data });
|
|
5400
5400
|
}
|
|
5401
5401
|
}
|
|
5402
5402
|
return n.common.async ? Promise.resolve().then(async () => {
|
|
5403
|
-
const
|
|
5404
|
-
for (const
|
|
5405
|
-
const h = await
|
|
5406
|
-
|
|
5403
|
+
const c = [];
|
|
5404
|
+
for (const d of o) {
|
|
5405
|
+
const h = await d.key, l = await d.value;
|
|
5406
|
+
c.push({ key: h, value: l, alwaysSet: d.alwaysSet });
|
|
5407
5407
|
}
|
|
5408
|
-
return
|
|
5409
|
-
}).then((
|
|
5408
|
+
return c;
|
|
5409
|
+
}).then((c) => He.mergeObjectSync(r, c)) : He.mergeObjectSync(r, o);
|
|
5410
5410
|
}
|
|
5411
5411
|
get shape() {
|
|
5412
5412
|
return this._def.shape();
|
|
@@ -5488,9 +5488,9 @@ class Mi extends qt {
|
|
|
5488
5488
|
let i;
|
|
5489
5489
|
const s = [];
|
|
5490
5490
|
for (const o of n) {
|
|
5491
|
-
const
|
|
5492
|
-
if (
|
|
5493
|
-
|
|
5491
|
+
const c = { ...r, common: { ...r.common, issues: [] }, parent: null }, d = o._parseSync({ data: r.data, path: r.path, parent: c });
|
|
5492
|
+
if (d.status === "valid") return d;
|
|
5493
|
+
d.status !== "dirty" || i || (i = { result: d, ctx: c }), c.common.issues.length && s.push(c.common.issues);
|
|
5494
5494
|
}
|
|
5495
5495
|
if (i) return r.common.issues.push(...i.ctx.common.issues), i.result;
|
|
5496
5496
|
const a = s.map((o) => new Je(o));
|
|
@@ -5538,9 +5538,9 @@ function Zo(e, t) {
|
|
|
5538
5538
|
if (r === yt.object && n === yt.object) {
|
|
5539
5539
|
const i = Xt.objectKeys(t), s = Xt.objectKeys(e).filter((o) => i.indexOf(o) !== -1), a = { ...e, ...t };
|
|
5540
5540
|
for (const o of s) {
|
|
5541
|
-
const
|
|
5542
|
-
if (!
|
|
5543
|
-
a[o] =
|
|
5541
|
+
const c = Zo(e[o], t[o]);
|
|
5542
|
+
if (!c.valid) return { valid: !1 };
|
|
5543
|
+
a[o] = c.data;
|
|
5544
5544
|
}
|
|
5545
5545
|
return { valid: !0, data: a };
|
|
5546
5546
|
}
|
|
@@ -5621,24 +5621,24 @@ class vs extends qt {
|
|
|
5621
5621
|
_parse(t) {
|
|
5622
5622
|
const { status: r, ctx: n } = this._processInputParams(t);
|
|
5623
5623
|
if (n.parsedType !== yt.map) return ft(n, { code: J.invalid_type, expected: yt.map, received: n.parsedType }), Mt;
|
|
5624
|
-
const i = this._def.keyType, s = this._def.valueType, a = [...n.data.entries()].map(([o,
|
|
5624
|
+
const i = this._def.keyType, s = this._def.valueType, a = [...n.data.entries()].map(([o, c], d) => ({ key: i._parse(new Tr(n, o, n.path, [d, "key"])), value: s._parse(new Tr(n, c, n.path, [d, "value"])) }));
|
|
5625
5625
|
if (n.common.async) {
|
|
5626
5626
|
const o = /* @__PURE__ */ new Map();
|
|
5627
5627
|
return Promise.resolve().then(async () => {
|
|
5628
|
-
for (const
|
|
5629
|
-
const
|
|
5630
|
-
if (
|
|
5631
|
-
|
|
5628
|
+
for (const c of a) {
|
|
5629
|
+
const d = await c.key, h = await c.value;
|
|
5630
|
+
if (d.status === "aborted" || h.status === "aborted") return Mt;
|
|
5631
|
+
d.status !== "dirty" && h.status !== "dirty" || r.dirty(), o.set(d.value, h.value);
|
|
5632
5632
|
}
|
|
5633
5633
|
return { status: r.value, value: o };
|
|
5634
5634
|
});
|
|
5635
5635
|
}
|
|
5636
5636
|
{
|
|
5637
5637
|
const o = /* @__PURE__ */ new Map();
|
|
5638
|
-
for (const
|
|
5639
|
-
const
|
|
5640
|
-
if (
|
|
5641
|
-
|
|
5638
|
+
for (const c of a) {
|
|
5639
|
+
const d = c.key, h = c.value;
|
|
5640
|
+
if (d.status === "aborted" || h.status === "aborted") return Mt;
|
|
5641
|
+
d.status !== "dirty" && h.status !== "dirty" || r.dirty(), o.set(d.value, h.value);
|
|
5642
5642
|
}
|
|
5643
5643
|
return { status: r.value, value: o };
|
|
5644
5644
|
}
|
|
@@ -5652,16 +5652,16 @@ class An extends qt {
|
|
|
5652
5652
|
const i = this._def;
|
|
5653
5653
|
i.minSize !== null && n.data.size < i.minSize.value && (ft(n, { code: J.too_small, minimum: i.minSize.value, type: "set", inclusive: !0, exact: !1, message: i.minSize.message }), r.dirty()), i.maxSize !== null && n.data.size > i.maxSize.value && (ft(n, { code: J.too_big, maximum: i.maxSize.value, type: "set", inclusive: !0, exact: !1, message: i.maxSize.message }), r.dirty());
|
|
5654
5654
|
const s = this._def.valueType;
|
|
5655
|
-
function a(
|
|
5656
|
-
const
|
|
5657
|
-
for (const h of
|
|
5655
|
+
function a(c) {
|
|
5656
|
+
const d = /* @__PURE__ */ new Set();
|
|
5657
|
+
for (const h of c) {
|
|
5658
5658
|
if (h.status === "aborted") return Mt;
|
|
5659
|
-
h.status === "dirty" && r.dirty(),
|
|
5659
|
+
h.status === "dirty" && r.dirty(), d.add(h.value);
|
|
5660
5660
|
}
|
|
5661
|
-
return { status: r.value, value:
|
|
5661
|
+
return { status: r.value, value: d };
|
|
5662
5662
|
}
|
|
5663
|
-
const o = [...n.data.values()].map((
|
|
5664
|
-
return n.common.async ? Promise.all(o).then((
|
|
5663
|
+
const o = [...n.data.values()].map((c, d) => s._parse(new Tr(n, c, n.path, d)));
|
|
5664
|
+
return n.common.async ? Promise.all(o).then((c) => a(c)) : a(o);
|
|
5665
5665
|
}
|
|
5666
5666
|
min(t, r) {
|
|
5667
5667
|
return new An({ ...this._def, minSize: { value: t, message: vt.toString(r) } });
|
|
@@ -5684,30 +5684,30 @@ class Hn extends qt {
|
|
|
5684
5684
|
_parse(t) {
|
|
5685
5685
|
const { ctx: r } = this._processInputParams(t);
|
|
5686
5686
|
if (r.parsedType !== yt.function) return ft(r, { code: J.invalid_type, expected: yt.function, received: r.parsedType }), Mt;
|
|
5687
|
-
function n(o,
|
|
5688
|
-
return ms({ data: o, path: r.path, errorMaps: [r.common.contextualErrorMap, r.schemaErrorMap, ps(), Kn].filter((
|
|
5687
|
+
function n(o, c) {
|
|
5688
|
+
return ms({ data: o, path: r.path, errorMaps: [r.common.contextualErrorMap, r.schemaErrorMap, ps(), Kn].filter((d) => !!d), issueData: { code: J.invalid_arguments, argumentsError: c } });
|
|
5689
5689
|
}
|
|
5690
|
-
function i(o,
|
|
5691
|
-
return ms({ data: o, path: r.path, errorMaps: [r.common.contextualErrorMap, r.schemaErrorMap, ps(), Kn].filter((
|
|
5690
|
+
function i(o, c) {
|
|
5691
|
+
return ms({ data: o, path: r.path, errorMaps: [r.common.contextualErrorMap, r.schemaErrorMap, ps(), Kn].filter((d) => !!d), issueData: { code: J.invalid_return_type, returnTypeError: c } });
|
|
5692
5692
|
}
|
|
5693
5693
|
const s = { errorMap: r.common.contextualErrorMap }, a = r.data;
|
|
5694
5694
|
if (this._def.returns instanceof Yn) {
|
|
5695
5695
|
const o = this;
|
|
5696
|
-
return Ve(async function(...
|
|
5697
|
-
const
|
|
5698
|
-
throw
|
|
5696
|
+
return Ve(async function(...c) {
|
|
5697
|
+
const d = new Je([]), h = await o._def.args.parseAsync(c, s).catch((_) => {
|
|
5698
|
+
throw d.addIssue(n(c, _)), d;
|
|
5699
5699
|
}), l = await Reflect.apply(a, this, h);
|
|
5700
5700
|
return await o._def.returns._def.type.parseAsync(l, s).catch((_) => {
|
|
5701
|
-
throw
|
|
5701
|
+
throw d.addIssue(i(l, _)), d;
|
|
5702
5702
|
});
|
|
5703
5703
|
});
|
|
5704
5704
|
}
|
|
5705
5705
|
{
|
|
5706
5706
|
const o = this;
|
|
5707
|
-
return Ve(function(...
|
|
5708
|
-
const
|
|
5709
|
-
if (!
|
|
5710
|
-
const h = Reflect.apply(a, this,
|
|
5707
|
+
return Ve(function(...c) {
|
|
5708
|
+
const d = o._def.args.safeParse(c, s);
|
|
5709
|
+
if (!d.success) throw new Je([n(c, d.error)]);
|
|
5710
|
+
const h = Reflect.apply(a, this, d.data), l = o._def.returns.safeParse(h, s);
|
|
5711
5711
|
if (!l.success) throw new Je([i(h, l.error)]);
|
|
5712
5712
|
return l.data;
|
|
5713
5713
|
});
|
|
@@ -5846,8 +5846,8 @@ class pr extends qt {
|
|
|
5846
5846
|
const a = i.transform(n.data, s);
|
|
5847
5847
|
if (n.common.async) return Promise.resolve(a).then(async (o) => {
|
|
5848
5848
|
if (r.value === "aborted") return Mt;
|
|
5849
|
-
const
|
|
5850
|
-
return
|
|
5849
|
+
const c = await this._def.schema._parseAsync({ data: o, path: n.path, parent: n });
|
|
5850
|
+
return c.status === "aborted" ? Mt : c.status === "dirty" || r.value === "dirty" ? bs(c.value) : c;
|
|
5851
5851
|
});
|
|
5852
5852
|
{
|
|
5853
5853
|
if (r.value === "aborted") return Mt;
|
|
@@ -5857,9 +5857,9 @@ class pr extends qt {
|
|
|
5857
5857
|
}
|
|
5858
5858
|
if (i.type === "refinement") {
|
|
5859
5859
|
const a = (o) => {
|
|
5860
|
-
const
|
|
5861
|
-
if (n.common.async) return Promise.resolve(
|
|
5862
|
-
if (
|
|
5860
|
+
const c = i.refinement(o, s);
|
|
5861
|
+
if (n.common.async) return Promise.resolve(c);
|
|
5862
|
+
if (c instanceof Promise) throw new Error("Async refinement encountered during synchronous parse operation. Use .parseAsync instead.");
|
|
5863
5863
|
return o;
|
|
5864
5864
|
};
|
|
5865
5865
|
if (n.common.async === !1) {
|
|
@@ -5980,8 +5980,8 @@ function E0(e, t = {}, r) {
|
|
|
5980
5980
|
const s = e(n);
|
|
5981
5981
|
if (s instanceof Promise) return s.then((a) => {
|
|
5982
5982
|
if (!a) {
|
|
5983
|
-
const o = k0(t, n),
|
|
5984
|
-
i.addIssue({ code: "custom", ...o, fatal:
|
|
5983
|
+
const o = k0(t, n), c = o.fatal ?? r ?? !0;
|
|
5984
|
+
i.addIssue({ code: "custom", ...o, fatal: c });
|
|
5985
5985
|
}
|
|
5986
5986
|
});
|
|
5987
5987
|
if (!s) {
|
|
@@ -6039,13 +6039,13 @@ const D2 = ["bool", "int", "uint", "bytes", "string", "address", "tuple"], k1 =
|
|
|
6039
6039
|
for (const [n, i] of e.entries()) {
|
|
6040
6040
|
let s, a, o = [];
|
|
6041
6041
|
k1(i) ? (s = i.type, a = i.name || `${t}/${n}`, o = i.components) : typeof i == "string" ? (s = i, a = `${t}/${n}`) : Array.isArray(i) && (i[0] && typeof i[0] == "string" && i[0].startsWith("tuple") && !Array.isArray(i[0]) && i[1] && Array.isArray(i[1]) ? (s = i[0], a = `${t}/${n}`, o = i[1]) : (s = "tuple", a = `${t}/${n}`, o = i));
|
|
6042
|
-
const { baseType:
|
|
6042
|
+
const { baseType: c, isArray: d, arraySizes: h } = Mn(s);
|
|
6043
6043
|
let l, _ = r;
|
|
6044
6044
|
for (let v = h.length - 1; v > 0; v -= 1) l = { type: "array", $id: a, items: [], maxItems: h[v], minItems: h[v] }, h[v] < 0 && (delete l.maxItems, delete l.minItems), Array.isArray(_.items) ? _.items.length === 0 ? _.items = [l] : _.items.push(l) : _.items = [_.items, l], _ = l;
|
|
6045
|
-
if (
|
|
6045
|
+
if (c !== "tuple" || d) if (c === "tuple" && d) {
|
|
6046
6046
|
const v = h[0], A = Object.assign({ type: "array", $id: a, items: xs(o, a) }, v >= 0 && { minItems: v, maxItems: v });
|
|
6047
6047
|
_.items.push(A);
|
|
6048
|
-
} else if (
|
|
6048
|
+
} else if (d) {
|
|
6049
6049
|
const v = h[0], A = Object.assign({ type: "array", $id: a, items: O0(s) }, v >= 0 && { minItems: v, maxItems: v });
|
|
6050
6050
|
_.items.push(A);
|
|
6051
6051
|
} else Array.isArray(_.items), _.items.push(Object.assign({ $id: a }, O0(s)));
|
|
@@ -6059,19 +6059,19 @@ const D2 = ["bool", "int", "uint", "bytes", "string", "address", "tuple"], k1 =
|
|
|
6059
6059
|
}, E1 = (e) => xs(e), wa = (e, t) => t === 1 ? e : wa(e[0], t - 1), ns = (e, t, r) => {
|
|
6060
6060
|
const n = [];
|
|
6061
6061
|
for (const [i, s] of e.entries()) {
|
|
6062
|
-
let a, o,
|
|
6063
|
-
k1(s) ? (a = s.type, o = s.name,
|
|
6064
|
-
const { baseType:
|
|
6065
|
-
if (
|
|
6062
|
+
let a, o, c = [];
|
|
6063
|
+
k1(s) ? (a = s.type, o = s.name, c = s.components) : typeof s == "string" ? a = s : Array.isArray(s) && (s[1] && Array.isArray(s[1]) ? (a = s[0], c = s[1]) : (a = "tuple", c = s));
|
|
6064
|
+
const { baseType: d, isArray: h, arraySizes: l } = Mn(a), _ = Array.isArray(t) ? t[i] : t[o];
|
|
6065
|
+
if (d !== "tuple" || h) if (d === "tuple" && h) {
|
|
6066
6066
|
const v = [];
|
|
6067
6067
|
for (const A of _) if (l.length > 1) {
|
|
6068
6068
|
const I = wa(A, l.length - 1), x = [];
|
|
6069
|
-
for (const M of I) x.push(ns(
|
|
6069
|
+
for (const M of I) x.push(ns(c, M, r));
|
|
6070
6070
|
v.push(x);
|
|
6071
|
-
} else v.push(ns(
|
|
6071
|
+
} else v.push(ns(c, A, r));
|
|
6072
6072
|
n.push(v);
|
|
6073
6073
|
} else n.push(_);
|
|
6074
|
-
else n.push(ns(
|
|
6074
|
+
else n.push(ns(c, _, r));
|
|
6075
6075
|
}
|
|
6076
6076
|
return (r = r ?? []).push(...n), r;
|
|
6077
6077
|
}, $s = (e) => {
|
|
@@ -6250,14 +6250,14 @@ class zn {
|
|
|
6250
6250
|
var n;
|
|
6251
6251
|
let i, s, a, o;
|
|
6252
6252
|
o = r.path.join("/");
|
|
6253
|
-
const
|
|
6254
|
-
if (r.code === J.too_big) s = "maxItems", o = `${
|
|
6255
|
-
else if (r.code === J.too_small) s = "minItems", o = `${
|
|
6253
|
+
const c = String(r.path[r.path.length - 1]), d = r.path.join("/");
|
|
6254
|
+
if (r.code === J.too_big) s = "maxItems", o = `${d}/maxItems`, a = { limit: r.maximum }, i = `must NOT have more than ${r.maximum} items`;
|
|
6255
|
+
else if (r.code === J.too_small) s = "minItems", o = `${d}/minItems`, a = { limit: r.minimum }, i = `must NOT have fewer than ${r.minimum} items`;
|
|
6256
6256
|
else if (r.code === J.custom) {
|
|
6257
6257
|
const { value: h, format: l } = (n = r.params) !== null && n !== void 0 ? n : {};
|
|
6258
6258
|
i = h === void 0 ? `value at "/${o}" is required` : `value "${typeof h == "object" ? JSON.stringify(h) : h}" at "/${o}" must pass "${l}" validation`, a = { value: h };
|
|
6259
6259
|
}
|
|
6260
|
-
return { keyword: s ??
|
|
6260
|
+
return { keyword: s ?? c, instancePath: d ? `/${d}` : "", schemaPath: o ? `#${o}` : "#", params: a ?? { value: r.message }, message: i ?? r.message };
|
|
6261
6261
|
});
|
|
6262
6262
|
}
|
|
6263
6263
|
}
|
|
@@ -6309,69 +6309,69 @@ var O1 = { exports: {} };
|
|
|
6309
6309
|
var t = Object.prototype.hasOwnProperty, r = "~";
|
|
6310
6310
|
function n() {
|
|
6311
6311
|
}
|
|
6312
|
-
function i(
|
|
6313
|
-
this.fn =
|
|
6312
|
+
function i(c, d, h) {
|
|
6313
|
+
this.fn = c, this.context = d, this.once = h || !1;
|
|
6314
6314
|
}
|
|
6315
|
-
function s(
|
|
6315
|
+
function s(c, d, h, l, _) {
|
|
6316
6316
|
if (typeof h != "function") throw new TypeError("The listener must be a function");
|
|
6317
|
-
var v = new i(h, l ||
|
|
6318
|
-
return
|
|
6317
|
+
var v = new i(h, l || c, _), A = r ? r + d : d;
|
|
6318
|
+
return c._events[A] ? c._events[A].fn ? c._events[A] = [c._events[A], v] : c._events[A].push(v) : (c._events[A] = v, c._eventsCount++), c;
|
|
6319
6319
|
}
|
|
6320
|
-
function a(
|
|
6321
|
-
--
|
|
6320
|
+
function a(c, d) {
|
|
6321
|
+
--c._eventsCount === 0 ? c._events = new n() : delete c._events[d];
|
|
6322
6322
|
}
|
|
6323
6323
|
function o() {
|
|
6324
6324
|
this._events = new n(), this._eventsCount = 0;
|
|
6325
6325
|
}
|
|
6326
6326
|
Object.create && (n.prototype = /* @__PURE__ */ Object.create(null), new n().__proto__ || (r = !1)), o.prototype.eventNames = function() {
|
|
6327
|
-
var
|
|
6327
|
+
var c, d, h = [];
|
|
6328
6328
|
if (this._eventsCount === 0) return h;
|
|
6329
|
-
for (
|
|
6330
|
-
return Object.getOwnPropertySymbols ? h.concat(Object.getOwnPropertySymbols(
|
|
6331
|
-
}, o.prototype.listeners = function(
|
|
6332
|
-
var
|
|
6329
|
+
for (d in c = this._events) t.call(c, d) && h.push(r ? d.slice(1) : d);
|
|
6330
|
+
return Object.getOwnPropertySymbols ? h.concat(Object.getOwnPropertySymbols(c)) : h;
|
|
6331
|
+
}, o.prototype.listeners = function(c) {
|
|
6332
|
+
var d = r ? r + c : c, h = this._events[d];
|
|
6333
6333
|
if (!h) return [];
|
|
6334
6334
|
if (h.fn) return [h.fn];
|
|
6335
6335
|
for (var l = 0, _ = h.length, v = new Array(_); l < _; l++) v[l] = h[l].fn;
|
|
6336
6336
|
return v;
|
|
6337
|
-
}, o.prototype.listenerCount = function(
|
|
6338
|
-
var
|
|
6337
|
+
}, o.prototype.listenerCount = function(c) {
|
|
6338
|
+
var d = r ? r + c : c, h = this._events[d];
|
|
6339
6339
|
return h ? h.fn ? 1 : h.length : 0;
|
|
6340
|
-
}, o.prototype.emit = function(
|
|
6341
|
-
var A = r ? r +
|
|
6340
|
+
}, o.prototype.emit = function(c, d, h, l, _, v) {
|
|
6341
|
+
var A = r ? r + c : c;
|
|
6342
6342
|
if (!this._events[A]) return !1;
|
|
6343
6343
|
var I, x, M = this._events[A], k = arguments.length;
|
|
6344
6344
|
if (M.fn) {
|
|
6345
|
-
switch (M.once && this.removeListener(
|
|
6345
|
+
switch (M.once && this.removeListener(c, M.fn, void 0, !0), k) {
|
|
6346
6346
|
case 1:
|
|
6347
6347
|
return M.fn.call(M.context), !0;
|
|
6348
6348
|
case 2:
|
|
6349
|
-
return M.fn.call(M.context,
|
|
6349
|
+
return M.fn.call(M.context, d), !0;
|
|
6350
6350
|
case 3:
|
|
6351
|
-
return M.fn.call(M.context,
|
|
6351
|
+
return M.fn.call(M.context, d, h), !0;
|
|
6352
6352
|
case 4:
|
|
6353
|
-
return M.fn.call(M.context,
|
|
6353
|
+
return M.fn.call(M.context, d, h, l), !0;
|
|
6354
6354
|
case 5:
|
|
6355
|
-
return M.fn.call(M.context,
|
|
6355
|
+
return M.fn.call(M.context, d, h, l, _), !0;
|
|
6356
6356
|
case 6:
|
|
6357
|
-
return M.fn.call(M.context,
|
|
6357
|
+
return M.fn.call(M.context, d, h, l, _, v), !0;
|
|
6358
6358
|
}
|
|
6359
6359
|
for (x = 1, I = new Array(k - 1); x < k; x++) I[x - 1] = arguments[x];
|
|
6360
6360
|
M.fn.apply(M.context, I);
|
|
6361
6361
|
} else {
|
|
6362
6362
|
var O, E = M.length;
|
|
6363
|
-
for (x = 0; x < E; x++) switch (M[x].once && this.removeListener(
|
|
6363
|
+
for (x = 0; x < E; x++) switch (M[x].once && this.removeListener(c, M[x].fn, void 0, !0), k) {
|
|
6364
6364
|
case 1:
|
|
6365
6365
|
M[x].fn.call(M[x].context);
|
|
6366
6366
|
break;
|
|
6367
6367
|
case 2:
|
|
6368
|
-
M[x].fn.call(M[x].context,
|
|
6368
|
+
M[x].fn.call(M[x].context, d);
|
|
6369
6369
|
break;
|
|
6370
6370
|
case 3:
|
|
6371
|
-
M[x].fn.call(M[x].context,
|
|
6371
|
+
M[x].fn.call(M[x].context, d, h);
|
|
6372
6372
|
break;
|
|
6373
6373
|
case 4:
|
|
6374
|
-
M[x].fn.call(M[x].context,
|
|
6374
|
+
M[x].fn.call(M[x].context, d, h, l);
|
|
6375
6375
|
break;
|
|
6376
6376
|
default:
|
|
6377
6377
|
if (!I) for (O = 1, I = new Array(k - 1); O < k; O++) I[O - 1] = arguments[O];
|
|
@@ -6379,24 +6379,24 @@ var O1 = { exports: {} };
|
|
|
6379
6379
|
}
|
|
6380
6380
|
}
|
|
6381
6381
|
return !0;
|
|
6382
|
-
}, o.prototype.on = function(
|
|
6383
|
-
return s(this,
|
|
6384
|
-
}, o.prototype.once = function(
|
|
6385
|
-
return s(this,
|
|
6386
|
-
}, o.prototype.removeListener = function(
|
|
6387
|
-
var _ = r ? r +
|
|
6382
|
+
}, o.prototype.on = function(c, d, h) {
|
|
6383
|
+
return s(this, c, d, h, !1);
|
|
6384
|
+
}, o.prototype.once = function(c, d, h) {
|
|
6385
|
+
return s(this, c, d, h, !0);
|
|
6386
|
+
}, o.prototype.removeListener = function(c, d, h, l) {
|
|
6387
|
+
var _ = r ? r + c : c;
|
|
6388
6388
|
if (!this._events[_]) return this;
|
|
6389
|
-
if (!
|
|
6389
|
+
if (!d) return a(this, _), this;
|
|
6390
6390
|
var v = this._events[_];
|
|
6391
|
-
if (v.fn) v.fn !==
|
|
6391
|
+
if (v.fn) v.fn !== d || l && !v.once || h && v.context !== h || a(this, _);
|
|
6392
6392
|
else {
|
|
6393
|
-
for (var A = 0, I = [], x = v.length; A < x; A++) (v[A].fn !==
|
|
6393
|
+
for (var A = 0, I = [], x = v.length; A < x; A++) (v[A].fn !== d || l && !v[A].once || h && v[A].context !== h) && I.push(v[A]);
|
|
6394
6394
|
I.length ? this._events[_] = I.length === 1 ? I[0] : I : a(this, _);
|
|
6395
6395
|
}
|
|
6396
6396
|
return this;
|
|
6397
|
-
}, o.prototype.removeAllListeners = function(
|
|
6398
|
-
var
|
|
6399
|
-
return
|
|
6397
|
+
}, o.prototype.removeAllListeners = function(c) {
|
|
6398
|
+
var d;
|
|
6399
|
+
return c ? (d = r ? r + c : c, this._events[d] && a(this, d)) : (this._events = new n(), this._eventsCount = 0), this;
|
|
6400
6400
|
}, o.prototype.off = o.prototype.removeListener, o.prototype.addListener = o.prototype.on, o.prefixed = r, o.EventEmitter = o, e.exports = o;
|
|
6401
6401
|
})(O1);
|
|
6402
6402
|
const X2 = Jn(O1.exports), Go = Qe, z0 = (e, t, r = "0") => typeof e == "string" ? Oe(e) ? Ko(e, t, r) : e.padStart(t, r) : (Ui.validate(["int"], [e]), Ko(e, t, r)), C1 = "0xc5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470", tl = (e) => {
|
|
@@ -6423,28 +6423,28 @@ const X2 = Jn(O1.exports), Go = Qe, z0 = (e, t, r = "0") => typeof e == "string"
|
|
|
6423
6423
|
};
|
|
6424
6424
|
var L1, oo = function(e, t, r, n) {
|
|
6425
6425
|
return new (r || (r = Promise))(function(i, s) {
|
|
6426
|
-
function a(
|
|
6426
|
+
function a(d) {
|
|
6427
6427
|
try {
|
|
6428
|
-
|
|
6428
|
+
c(n.next(d));
|
|
6429
6429
|
} catch (h) {
|
|
6430
6430
|
s(h);
|
|
6431
6431
|
}
|
|
6432
6432
|
}
|
|
6433
|
-
function o(
|
|
6433
|
+
function o(d) {
|
|
6434
6434
|
try {
|
|
6435
|
-
|
|
6435
|
+
c(n.throw(d));
|
|
6436
6436
|
} catch (h) {
|
|
6437
6437
|
s(h);
|
|
6438
6438
|
}
|
|
6439
6439
|
}
|
|
6440
|
-
function d
|
|
6441
|
-
|
|
6440
|
+
function c(d) {
|
|
6441
|
+
d.done ? i(d.value) : function(h) {
|
|
6442
6442
|
return h instanceof r ? h : new r(function(l) {
|
|
6443
6443
|
l(h);
|
|
6444
6444
|
});
|
|
6445
|
-
}(
|
|
6445
|
+
}(d.value).then(a, o);
|
|
6446
6446
|
}
|
|
6447
|
-
|
|
6447
|
+
c((n = n.apply(e, t || [])).next());
|
|
6448
6448
|
});
|
|
6449
6449
|
};
|
|
6450
6450
|
class il {
|
|
@@ -6516,28 +6516,28 @@ class sl {
|
|
|
6516
6516
|
}
|
|
6517
6517
|
var H0 = function(e, t, r, n) {
|
|
6518
6518
|
return new (r || (r = Promise))(function(i, s) {
|
|
6519
|
-
function a(
|
|
6519
|
+
function a(d) {
|
|
6520
6520
|
try {
|
|
6521
|
-
|
|
6521
|
+
c(n.next(d));
|
|
6522
6522
|
} catch (h) {
|
|
6523
6523
|
s(h);
|
|
6524
6524
|
}
|
|
6525
6525
|
}
|
|
6526
|
-
function o(
|
|
6526
|
+
function o(d) {
|
|
6527
6527
|
try {
|
|
6528
|
-
|
|
6528
|
+
c(n.throw(d));
|
|
6529
6529
|
} catch (h) {
|
|
6530
6530
|
s(h);
|
|
6531
6531
|
}
|
|
6532
6532
|
}
|
|
6533
|
-
function d
|
|
6534
|
-
|
|
6533
|
+
function c(d) {
|
|
6534
|
+
d.done ? i(d.value) : function(h) {
|
|
6535
6535
|
return h instanceof r ? h : new r(function(l) {
|
|
6536
6536
|
l(h);
|
|
6537
6537
|
});
|
|
6538
|
-
}(
|
|
6538
|
+
}(d.value).then(a, o);
|
|
6539
6539
|
}
|
|
6540
|
-
|
|
6540
|
+
c((n = n.apply(e, t || [])).next());
|
|
6541
6541
|
});
|
|
6542
6542
|
};
|
|
6543
6543
|
class j1 extends Ps {
|
|
@@ -6580,28 +6580,28 @@ class j1 extends Ps {
|
|
|
6580
6580
|
}
|
|
6581
6581
|
var ao = function(e, t, r, n) {
|
|
6582
6582
|
return new (r || (r = Promise))(function(i, s) {
|
|
6583
|
-
function a(
|
|
6583
|
+
function a(d) {
|
|
6584
6584
|
try {
|
|
6585
|
-
|
|
6585
|
+
c(n.next(d));
|
|
6586
6586
|
} catch (h) {
|
|
6587
6587
|
s(h);
|
|
6588
6588
|
}
|
|
6589
6589
|
}
|
|
6590
|
-
function o(
|
|
6590
|
+
function o(d) {
|
|
6591
6591
|
try {
|
|
6592
|
-
|
|
6592
|
+
c(n.throw(d));
|
|
6593
6593
|
} catch (h) {
|
|
6594
6594
|
s(h);
|
|
6595
6595
|
}
|
|
6596
6596
|
}
|
|
6597
|
-
function d
|
|
6598
|
-
|
|
6597
|
+
function c(d) {
|
|
6598
|
+
d.done ? i(d.value) : function(h) {
|
|
6599
6599
|
return h instanceof r ? h : new r(function(l) {
|
|
6600
6600
|
l(h);
|
|
6601
6601
|
});
|
|
6602
|
-
}(
|
|
6602
|
+
}(d.value).then(a, o);
|
|
6603
6603
|
}
|
|
6604
|
-
|
|
6604
|
+
c((n = n.apply(e, t || [])).next());
|
|
6605
6605
|
});
|
|
6606
6606
|
};
|
|
6607
6607
|
const ol = { autoReconnect: !0, delay: 5e3, maxAttempts: 5 };
|
|
@@ -6660,9 +6660,9 @@ class al extends j1 {
|
|
|
6660
6660
|
return ao(this, arguments, void 0, function* (n, i, s = !1, a = 1e3) {
|
|
6661
6661
|
let o = 0;
|
|
6662
6662
|
yield ao(this, void 0, void 0, function* () {
|
|
6663
|
-
return new Promise((
|
|
6664
|
-
const
|
|
6665
|
-
s && o >= 5 && this.clearQueues(), this.getPendingRequestQueueSize() === 0 && this.getSentRequestsQueueSize() === 0 && (clearInterval(
|
|
6663
|
+
return new Promise((c) => {
|
|
6664
|
+
const d = setInterval(() => {
|
|
6665
|
+
s && o >= 5 && this.clearQueues(), this.getPendingRequestQueueSize() === 0 && this.getSentRequestsQueueSize() === 0 && (clearInterval(d), c(!0)), o += 1;
|
|
6666
6666
|
}, a);
|
|
6667
6667
|
});
|
|
6668
6668
|
}), this.disconnect(n, i);
|
|
@@ -6750,7 +6750,7 @@ var Jo = { exports: {} };
|
|
|
6750
6750
|
}();
|
|
6751
6751
|
(function(s) {
|
|
6752
6752
|
(function(a) {
|
|
6753
|
-
var o = s !== void 0 && s || typeof self < "u" && self || Ur !== void 0 && Ur || {},
|
|
6753
|
+
var o = s !== void 0 && s || typeof self < "u" && self || Ur !== void 0 && Ur || {}, c = "URLSearchParams" in o, d = "Symbol" in o && "iterator" in Symbol, h = "FileReader" in o && "Blob" in o && function() {
|
|
6754
6754
|
try {
|
|
6755
6755
|
return new Blob(), !0;
|
|
6756
6756
|
} catch {
|
|
@@ -6772,7 +6772,7 @@ var Jo = { exports: {} };
|
|
|
6772
6772
|
var N = w.shift();
|
|
6773
6773
|
return { done: N === void 0, value: N };
|
|
6774
6774
|
} };
|
|
6775
|
-
return
|
|
6775
|
+
return d && (P[Symbol.iterator] = function() {
|
|
6776
6776
|
return P;
|
|
6777
6777
|
}), P;
|
|
6778
6778
|
}
|
|
@@ -6810,7 +6810,7 @@ var Jo = { exports: {} };
|
|
|
6810
6810
|
function z() {
|
|
6811
6811
|
return this.bodyUsed = !1, this._initBody = function(w) {
|
|
6812
6812
|
var P;
|
|
6813
|
-
this.bodyUsed = this.bodyUsed, this._bodyInit = w, w ? typeof w == "string" ? this._bodyText = w : h && Blob.prototype.isPrototypeOf(w) ? this._bodyBlob = w : l && FormData.prototype.isPrototypeOf(w) ? this._bodyFormData = w :
|
|
6813
|
+
this.bodyUsed = this.bodyUsed, this._bodyInit = w, w ? typeof w == "string" ? this._bodyText = w : h && Blob.prototype.isPrototypeOf(w) ? this._bodyBlob = w : l && FormData.prototype.isPrototypeOf(w) ? this._bodyFormData = w : c && URLSearchParams.prototype.isPrototypeOf(w) ? this._bodyText = w.toString() : _ && h && (P = w) && DataView.prototype.isPrototypeOf(P) ? (this._bodyArrayBuffer = L(w.buffer), this._bodyInit = new Blob([this._bodyArrayBuffer])) : _ && (ArrayBuffer.prototype.isPrototypeOf(w) || A(w)) ? this._bodyArrayBuffer = L(w) : this._bodyText = w = Object.prototype.toString.call(w) : (this._noBody = !0, this._bodyText = ""), this.headers.get("content-type") || (typeof w == "string" ? this.headers.set("content-type", "text/plain;charset=UTF-8") : this._bodyBlob && this._bodyBlob.type ? this.headers.set("content-type", this._bodyBlob.type) : c && URLSearchParams.prototype.isPrototypeOf(w) && this.headers.set("content-type", "application/x-www-form-urlencoded;charset=UTF-8"));
|
|
6814
6814
|
}, h && (this.blob = function() {
|
|
6815
6815
|
var w = O(this);
|
|
6816
6816
|
if (w) return w;
|
|
@@ -6870,7 +6870,7 @@ var Jo = { exports: {} };
|
|
|
6870
6870
|
return this.forEach(function(P, N) {
|
|
6871
6871
|
w.push([N, P]);
|
|
6872
6872
|
}), M(w);
|
|
6873
|
-
},
|
|
6873
|
+
}, d && (k.prototype[Symbol.iterator] = k.prototype.entries);
|
|
6874
6874
|
var f = ["CONNECT", "DELETE", "GET", "HEAD", "OPTIONS", "PATCH", "POST", "PUT", "TRACE"];
|
|
6875
6875
|
function p(w, P) {
|
|
6876
6876
|
if (!(this instanceof p)) throw new TypeError('Please use the "new" operator, this DOM object constructor cannot be called as a function.');
|
|
@@ -6993,28 +6993,28 @@ var Jo = { exports: {} };
|
|
|
6993
6993
|
const cl = Jn(Jo.exports);
|
|
6994
6994
|
var dl = function(e, t, r, n) {
|
|
6995
6995
|
return new (r || (r = Promise))(function(i, s) {
|
|
6996
|
-
function a(
|
|
6996
|
+
function a(d) {
|
|
6997
6997
|
try {
|
|
6998
|
-
|
|
6998
|
+
c(n.next(d));
|
|
6999
6999
|
} catch (h) {
|
|
7000
7000
|
s(h);
|
|
7001
7001
|
}
|
|
7002
7002
|
}
|
|
7003
|
-
function o(
|
|
7003
|
+
function o(d) {
|
|
7004
7004
|
try {
|
|
7005
|
-
|
|
7005
|
+
c(n.throw(d));
|
|
7006
7006
|
} catch (h) {
|
|
7007
7007
|
s(h);
|
|
7008
7008
|
}
|
|
7009
7009
|
}
|
|
7010
|
-
function d
|
|
7011
|
-
|
|
7010
|
+
function c(d) {
|
|
7011
|
+
d.done ? i(d.value) : function(h) {
|
|
7012
7012
|
return h instanceof r ? h : new r(function(l) {
|
|
7013
7013
|
l(h);
|
|
7014
7014
|
});
|
|
7015
|
-
}(
|
|
7015
|
+
}(d.value).then(a, o);
|
|
7016
7016
|
}
|
|
7017
|
-
|
|
7017
|
+
c((n = n.apply(e, t || [])).next());
|
|
7018
7018
|
});
|
|
7019
7019
|
};
|
|
7020
7020
|
class Ea extends Ps {
|
|
@@ -7162,8 +7162,8 @@ class pl extends ya {
|
|
|
7162
7162
|
for (let a = 0; a < s; ) {
|
|
7163
7163
|
const o = Math.min(i - this.pos, s - a);
|
|
7164
7164
|
if (o === i) {
|
|
7165
|
-
const
|
|
7166
|
-
for (; i <= s - a; a += i) this.process(
|
|
7165
|
+
const c = no(t);
|
|
7166
|
+
for (; i <= s - a; a += i) this.process(c, a);
|
|
7167
7167
|
continue;
|
|
7168
7168
|
}
|
|
7169
7169
|
n.set(t.subarray(a, a + o), this.pos), this.pos += o, a += o, this.pos === i && (this.process(r, 0), this.pos = 0);
|
|
@@ -7181,11 +7181,11 @@ class pl extends ya {
|
|
|
7181
7181
|
const I = BigInt(32), x = BigInt(4294967295), M = Number(v >> I & x), k = Number(v & x), O = A ? 4 : 0, E = A ? 0 : 4;
|
|
7182
7182
|
l.setUint32(_ + O, M, A), l.setUint32(_ + E, k, A);
|
|
7183
7183
|
})(n, i - 8, BigInt(8 * this.length), s), this.process(n, 0);
|
|
7184
|
-
const o = no(t),
|
|
7185
|
-
if (
|
|
7186
|
-
const
|
|
7187
|
-
if (
|
|
7188
|
-
for (let l = 0; l <
|
|
7184
|
+
const o = no(t), c = this.outputLen;
|
|
7185
|
+
if (c % 4) throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
7186
|
+
const d = c / 4, h = this.get();
|
|
7187
|
+
if (d > h.length) throw new Error("_sha2: outputLen bigger than state");
|
|
7188
|
+
for (let l = 0; l < d; l++) o.setUint32(4 * l, h[l], s);
|
|
7189
7189
|
}
|
|
7190
7190
|
digest() {
|
|
7191
7191
|
const { buffer: t, outputLen: r } = this;
|
|
@@ -7205,11 +7205,11 @@ class bl extends pl {
|
|
|
7205
7205
|
super(64, 32, 8, !1), this.A = 0 | Wr[0], this.B = 0 | Wr[1], this.C = 0 | Wr[2], this.D = 0 | Wr[3], this.E = 0 | Wr[4], this.F = 0 | Wr[5], this.G = 0 | Wr[6], this.H = 0 | Wr[7];
|
|
7206
7206
|
}
|
|
7207
7207
|
get() {
|
|
7208
|
-
const { A: t, B: r, C: n, D: i, E: s, F: a, G: o, H:
|
|
7209
|
-
return [t, r, n, i, s, a, o,
|
|
7208
|
+
const { A: t, B: r, C: n, D: i, E: s, F: a, G: o, H: c } = this;
|
|
7209
|
+
return [t, r, n, i, s, a, o, c];
|
|
7210
7210
|
}
|
|
7211
|
-
set(t, r, n, i, s, a, o,
|
|
7212
|
-
this.A = 0 | t, this.B = 0 | r, this.C = 0 | n, this.D = 0 | i, this.E = 0 | s, this.F = 0 | a, this.G = 0 | o, this.H = 0 |
|
|
7211
|
+
set(t, r, n, i, s, a, o, c) {
|
|
7212
|
+
this.A = 0 | t, this.B = 0 | r, this.C = 0 | n, this.D = 0 | i, this.E = 0 | s, this.F = 0 | a, this.G = 0 | o, this.H = 0 | c;
|
|
7213
7213
|
}
|
|
7214
7214
|
process(t, r) {
|
|
7215
7215
|
for (let l = 0; l < 16; l++, r += 4) Yr[l] = t.getUint32(r, !1);
|
|
@@ -7217,12 +7217,12 @@ class bl extends pl {
|
|
|
7217
7217
|
const _ = Yr[l - 15], v = Yr[l - 2], A = yr(_, 7) ^ yr(_, 18) ^ _ >>> 3, I = yr(v, 17) ^ yr(v, 19) ^ v >>> 10;
|
|
7218
7218
|
Yr[l] = I + Yr[l - 7] + A + Yr[l - 16] | 0;
|
|
7219
7219
|
}
|
|
7220
|
-
let { A: n, B: i, C: s, D: a, E: o, F:
|
|
7220
|
+
let { A: n, B: i, C: s, D: a, E: o, F: c, G: d, H: h } = this;
|
|
7221
7221
|
for (let l = 0; l < 64; l++) {
|
|
7222
|
-
const _ = h + (yr(o, 6) ^ yr(o, 11) ^ yr(o, 25)) + ul(o,
|
|
7223
|
-
h =
|
|
7222
|
+
const _ = h + (yr(o, 6) ^ yr(o, 11) ^ yr(o, 25)) + ul(o, c, d) + ml[l] + Yr[l] | 0, v = (yr(n, 2) ^ yr(n, 13) ^ yr(n, 22)) + ll(n, i, s) | 0;
|
|
7223
|
+
h = d, d = c, c = o, o = a + _ | 0, a = s, s = i, i = n, n = _ + v | 0;
|
|
7224
7224
|
}
|
|
7225
|
-
n = n + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, a = a + this.D | 0, o = o + this.E | 0,
|
|
7225
|
+
n = n + this.A | 0, i = i + this.B | 0, s = s + this.C | 0, a = a + this.D | 0, o = o + this.E | 0, c = c + this.F | 0, d = d + this.G | 0, h = h + this.H | 0, this.set(n, i, s, a, o, c, d, h);
|
|
7226
7226
|
}
|
|
7227
7227
|
roundClean() {
|
|
7228
7228
|
Yr.fill(0);
|
|
@@ -7266,8 +7266,8 @@ function Gn(e) {
|
|
|
7266
7266
|
for (let i = 0, s = 0; i < r; i++, s += 2) {
|
|
7267
7267
|
const a = Q0(e.charCodeAt(s)), o = Q0(e.charCodeAt(s + 1));
|
|
7268
7268
|
if (a === void 0 || o === void 0) {
|
|
7269
|
-
const
|
|
7270
|
-
throw new Error('hex string expected, got non-hex character "' +
|
|
7269
|
+
const c = e[s] + e[s + 1];
|
|
7270
|
+
throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + s);
|
|
7271
7271
|
}
|
|
7272
7272
|
n[i] = 16 * a + o;
|
|
7273
7273
|
}
|
|
@@ -7321,9 +7321,9 @@ function q1(e, t, r) {
|
|
|
7321
7321
|
let n = co(e), i = co(e), s = 0;
|
|
7322
7322
|
const a = () => {
|
|
7323
7323
|
n.fill(1), i.fill(0), s = 0;
|
|
7324
|
-
}, o = (...h) => r(i, n, ...h),
|
|
7324
|
+
}, o = (...h) => r(i, n, ...h), c = (h = co()) => {
|
|
7325
7325
|
i = o(G0([0]), h), n = o(), h.length !== 0 && (i = o(G0([1]), h), n = o());
|
|
7326
|
-
},
|
|
7326
|
+
}, d = () => {
|
|
7327
7327
|
if (s++ >= 1e3) throw new Error("drbg: tried 1000 values");
|
|
7328
7328
|
let h = 0;
|
|
7329
7329
|
const l = [];
|
|
@@ -7336,7 +7336,7 @@ function q1(e, t, r) {
|
|
|
7336
7336
|
};
|
|
7337
7337
|
return (h, l) => {
|
|
7338
7338
|
let _;
|
|
7339
|
-
for (a(),
|
|
7339
|
+
for (a(), c(h); !(_ = l(d())); ) c();
|
|
7340
7340
|
return a(), _;
|
|
7341
7341
|
};
|
|
7342
7342
|
}
|
|
@@ -7345,8 +7345,8 @@ function zi(e, t, r = {}) {
|
|
|
7345
7345
|
const n = (i, s, a) => {
|
|
7346
7346
|
const o = Al[s];
|
|
7347
7347
|
if (typeof o != "function") throw new Error(`Invalid validator "${s}", expected function`);
|
|
7348
|
-
const
|
|
7349
|
-
if (!(a &&
|
|
7348
|
+
const c = e[i];
|
|
7349
|
+
if (!(a && c === void 0 || o(c, e))) throw new Error(`Invalid param ${String(i)}=${c} (${typeof c}), expected ${s}`);
|
|
7350
7350
|
};
|
|
7351
7351
|
for (const [i, s] of Object.entries(t)) n(i, s, !1);
|
|
7352
7352
|
for (const [i, s] of Object.entries(r)) n(i, s, !0);
|
|
@@ -7410,9 +7410,9 @@ function Ml(e) {
|
|
|
7410
7410
|
if (e % X0 === J0) {
|
|
7411
7411
|
const t = (e - J0) / X0;
|
|
7412
7412
|
return function(r, n) {
|
|
7413
|
-
const i = r.mul(n, cn), s = r.pow(i, t), a = r.mul(n, s), o = r.mul(r.mul(a, cn), s),
|
|
7414
|
-
if (!r.eql(r.sqr(
|
|
7415
|
-
return
|
|
7413
|
+
const i = r.mul(n, cn), s = r.pow(i, t), a = r.mul(n, s), o = r.mul(r.mul(a, cn), s), c = r.mul(a, r.sub(o, r.ONE));
|
|
7414
|
+
if (!r.eql(r.sqr(c), n)) throw new Error("Cannot find square root");
|
|
7415
|
+
return c;
|
|
7416
7416
|
};
|
|
7417
7417
|
}
|
|
7418
7418
|
return function(t) {
|
|
@@ -7422,22 +7422,22 @@ function Ml(e) {
|
|
|
7422
7422
|
for (s = cn; s < t && El(s, r, t) !== t - we; s++) ;
|
|
7423
7423
|
if (i === 1) {
|
|
7424
7424
|
const o = (t + we) / fo;
|
|
7425
|
-
return function(
|
|
7426
|
-
const h =
|
|
7427
|
-
if (!
|
|
7425
|
+
return function(c, d) {
|
|
7426
|
+
const h = c.pow(d, o);
|
|
7427
|
+
if (!c.eql(c.sqr(h), d)) throw new Error("Cannot find square root");
|
|
7428
7428
|
return h;
|
|
7429
7429
|
};
|
|
7430
7430
|
}
|
|
7431
7431
|
const a = (n + we) / cn;
|
|
7432
|
-
return function(o,
|
|
7433
|
-
if (o.pow(
|
|
7434
|
-
let
|
|
7432
|
+
return function(o, c) {
|
|
7433
|
+
if (o.pow(c, r) === o.neg(o.ONE)) throw new Error("Cannot find square root");
|
|
7434
|
+
let d = i, h = o.pow(o.mul(o.ONE, s), n), l = o.pow(c, a), _ = o.pow(c, n);
|
|
7435
7435
|
for (; !o.eql(_, o.ONE); ) {
|
|
7436
7436
|
if (o.eql(_, o.ZERO)) return o.ZERO;
|
|
7437
7437
|
let v = 1;
|
|
7438
|
-
for (let I = o.sqr(_); v <
|
|
7439
|
-
const A = o.pow(h, we << BigInt(
|
|
7440
|
-
h = o.sqr(A), l = o.mul(l, A), _ = o.mul(_, h),
|
|
7438
|
+
for (let I = o.sqr(_); v < d && !o.eql(I, o.ONE); v++) I = o.sqr(I);
|
|
7439
|
+
const A = o.pow(h, we << BigInt(d - v - 1));
|
|
7440
|
+
h = o.sqr(A), l = o.mul(l, A), _ = o.mul(_, h), d = v;
|
|
7441
7441
|
}
|
|
7442
7442
|
return l;
|
|
7443
7443
|
};
|
|
@@ -7486,11 +7486,11 @@ const { bytesToNumberBE: Rl, hexToBytes: Nl } = Sl, yn = { Err: class extends Er
|
|
|
7486
7486
|
if (o.length) throw new t("Invalid signature: left bytes after parsing");
|
|
7487
7487
|
return { r: i, s: a };
|
|
7488
7488
|
}, hexFromSig(e) {
|
|
7489
|
-
const t = (
|
|
7490
|
-
const h =
|
|
7489
|
+
const t = (d) => 8 & Number.parseInt(d[0], 16) ? "00" + d : d, r = (d) => {
|
|
7490
|
+
const h = d.toString(16);
|
|
7491
7491
|
return 1 & h.length ? `0${h}` : h;
|
|
7492
|
-
}, n = t(r(e.s)), i = t(r(e.r)), s = n.length / 2, a = i.length / 2, o = r(s),
|
|
7493
|
-
return `30${r(a + s + 4)}02${
|
|
7492
|
+
}, n = t(r(e.s)), i = t(r(e.r)), s = n.length / 2, a = i.length / 2, o = r(s), c = r(a);
|
|
7493
|
+
return `30${r(a + s + 4)}02${c}${i}02${o}${n}`;
|
|
7494
7494
|
} }, qr = BigInt(0), or = BigInt(1);
|
|
7495
7495
|
BigInt(2);
|
|
7496
7496
|
const ed = BigInt(3);
|
|
@@ -7522,7 +7522,7 @@ function Ol(e) {
|
|
|
7522
7522
|
function o(A) {
|
|
7523
7523
|
if (!a(A)) throw new Error("Expected valid bigint: 0 < bigint < curve.n");
|
|
7524
7524
|
}
|
|
7525
|
-
function
|
|
7525
|
+
function c(A) {
|
|
7526
7526
|
const { allowedPrivateKeyLengths: I, nByteLength: x, wrapPrivateKey: M, n: k } = t;
|
|
7527
7527
|
if (I && typeof A != "bigint") {
|
|
7528
7528
|
if (kn(A) && (A = Qn(A)), typeof A != "string" || !I.includes(A.length)) throw new Error("Invalid key");
|
|
@@ -7536,7 +7536,7 @@ function Ol(e) {
|
|
|
7536
7536
|
}
|
|
7537
7537
|
return M && (O = Ye(O, k)), o(O), O;
|
|
7538
7538
|
}
|
|
7539
|
-
const
|
|
7539
|
+
const d = /* @__PURE__ */ new Map();
|
|
7540
7540
|
function h(A) {
|
|
7541
7541
|
if (!(A instanceof l)) throw new Error("ProjectivePoint expected");
|
|
7542
7542
|
}
|
|
@@ -7568,10 +7568,10 @@ function Ol(e) {
|
|
|
7568
7568
|
return x.assertValidity(), x;
|
|
7569
7569
|
}
|
|
7570
7570
|
static fromPrivateKey(I) {
|
|
7571
|
-
return l.BASE.multiply(
|
|
7571
|
+
return l.BASE.multiply(c(I));
|
|
7572
7572
|
}
|
|
7573
7573
|
_setWindowSize(I) {
|
|
7574
|
-
this._WINDOW_SIZE = I,
|
|
7574
|
+
this._WINDOW_SIZE = I, d.delete(this);
|
|
7575
7575
|
}
|
|
7576
7576
|
assertValidity() {
|
|
7577
7577
|
if (this.is0()) {
|
|
@@ -7619,7 +7619,7 @@ function Ol(e) {
|
|
|
7619
7619
|
return this.equals(l.ZERO);
|
|
7620
7620
|
}
|
|
7621
7621
|
wNAF(I) {
|
|
7622
|
-
return v.wNAFCached(this,
|
|
7622
|
+
return v.wNAFCached(this, d, I, (x) => {
|
|
7623
7623
|
const M = r.invertBatch(x.map((k) => k.pz));
|
|
7624
7624
|
return x.map((k, O) => k.toAffine(M[O])).map(l.fromAffine);
|
|
7625
7625
|
});
|
|
@@ -7714,7 +7714,7 @@ function Ol(e) {
|
|
|
7714
7714
|
return z || (z = this.precomputeWindow(k, L), L !== 1 && O.set(k, R(z))), this.wNAF(L, z, E);
|
|
7715
7715
|
} };
|
|
7716
7716
|
}(l, t.endo ? Math.ceil(_ / 2) : _);
|
|
7717
|
-
return { CURVE: t, ProjectivePoint: l, normPrivateKeyToScalar:
|
|
7717
|
+
return { CURVE: t, ProjectivePoint: l, normPrivateKeyToScalar: c, weierstrassEquation: s, isWithinCurveOrder: a };
|
|
7718
7718
|
}
|
|
7719
7719
|
function Cl(e) {
|
|
7720
7720
|
const t = function(p) {
|
|
@@ -7727,7 +7727,7 @@ function Cl(e) {
|
|
|
7727
7727
|
function o(p) {
|
|
7728
7728
|
return Xo(p, n);
|
|
7729
7729
|
}
|
|
7730
|
-
const { ProjectivePoint:
|
|
7730
|
+
const { ProjectivePoint: c, normPrivateKeyToScalar: d, weierstrassEquation: h, isWithinCurveOrder: l } = Ol({ ...t, toBytes(p, g, m) {
|
|
7731
7731
|
const u = g.toAffine(), y = r.toBytes(u.x), w = ji;
|
|
7732
7732
|
return m ? w(Uint8Array.from([g.hasEvenY() ? 2 : 3]), y) : w(Uint8Array.from([4]), y, r.toBytes(u.y));
|
|
7733
7733
|
}, fromBytes(p) {
|
|
@@ -7780,7 +7780,7 @@ function Cl(e) {
|
|
|
7780
7780
|
if (y == null || ![0, 1, 2, 3].includes(y)) throw new Error("recovery id invalid");
|
|
7781
7781
|
const P = y === 2 || y === 3 ? m + t.n : m;
|
|
7782
7782
|
if (P >= r.ORDER) throw new Error("recovery id 2 or 3 invalid");
|
|
7783
|
-
const N = 1 & y ? "03" : "02", j =
|
|
7783
|
+
const N = 1 & y ? "03" : "02", j = c.fromHex(N + _(P)), Z = o(P), $ = a(-w * Z), V = a(u * Z), H = c.BASE.multiplyAndAddUnsafe(j, $, V);
|
|
7784
7784
|
if (!H) throw new Error("point at infinify");
|
|
7785
7785
|
return H.assertValidity(), H;
|
|
7786
7786
|
}
|
|
@@ -7805,11 +7805,11 @@ function Cl(e) {
|
|
|
7805
7805
|
}
|
|
7806
7806
|
const x = { isValidPrivateKey(p) {
|
|
7807
7807
|
try {
|
|
7808
|
-
return
|
|
7808
|
+
return d(p), !0;
|
|
7809
7809
|
} catch {
|
|
7810
7810
|
return !1;
|
|
7811
7811
|
}
|
|
7812
|
-
}, normPrivateKeyToScalar:
|
|
7812
|
+
}, normPrivateKeyToScalar: d, randomPrivateKey: () => {
|
|
7813
7813
|
const p = td(t.n);
|
|
7814
7814
|
return function(g, m, u = !1) {
|
|
7815
7815
|
const y = g.length, w = H1(m), P = td(m);
|
|
@@ -7817,10 +7817,10 @@ function Cl(e) {
|
|
|
7817
7817
|
const N = Ye(u ? bn(g) : Ia(g), m - we) + we;
|
|
7818
7818
|
return u ? Ta(N, w) : Dn(N, w);
|
|
7819
7819
|
}(t.randomBytes(p), t.n);
|
|
7820
|
-
}, precompute: (p = 8, g =
|
|
7820
|
+
}, precompute: (p = 8, g = c.BASE) => (g._setWindowSize(p), g.multiply(BigInt(3)), g) };
|
|
7821
7821
|
function M(p) {
|
|
7822
7822
|
const g = kn(p), m = typeof p == "string", u = (g || m) && p.length;
|
|
7823
|
-
return g ? u === i || u === s : m ? u === 2 * i || u === 2 * s : p instanceof
|
|
7823
|
+
return g ? u === i || u === s : m ? u === 2 * i || u === 2 * s : p instanceof c;
|
|
7824
7824
|
}
|
|
7825
7825
|
const k = t.bits2int || function(p) {
|
|
7826
7826
|
const g = bn(p), m = 8 * p.length - t.nBitLength;
|
|
@@ -7838,7 +7838,7 @@ function Cl(e) {
|
|
|
7838
7838
|
const { hash: u, randomBytes: y } = t;
|
|
7839
7839
|
let { lowS: w, prehash: P, extraEntropy: N } = m;
|
|
7840
7840
|
w == null && (w = !0), p = fr("msgHash", p), P && (p = fr("prehashed msgHash", u(p)));
|
|
7841
|
-
const j = O(p), Z =
|
|
7841
|
+
const j = O(p), Z = d(g), $ = [R(Z), R(j)];
|
|
7842
7842
|
if (N != null && N !== !1) {
|
|
7843
7843
|
const D = N === !0 ? y(r.BYTES) : N;
|
|
7844
7844
|
$.push(fr("extraEntropy", D));
|
|
@@ -7847,7 +7847,7 @@ function Cl(e) {
|
|
|
7847
7847
|
return { seed: V, k2sig: function(D) {
|
|
7848
7848
|
const G = k(D);
|
|
7849
7849
|
if (!l(G)) return;
|
|
7850
|
-
const Et = o(G), ot =
|
|
7850
|
+
const Et = o(G), ot = c.BASE.multiply(G).toAffine(), mt = a(ot.x);
|
|
7851
7851
|
if (mt === qr) return;
|
|
7852
7852
|
const Ut = a(Et * a(H + mt * Z));
|
|
7853
7853
|
if (Ut === qr) return;
|
|
@@ -7858,12 +7858,12 @@ function Cl(e) {
|
|
|
7858
7858
|
} };
|
|
7859
7859
|
}
|
|
7860
7860
|
const z = { lowS: t.lowS, prehash: !1 }, f = { lowS: t.lowS, prehash: !1 };
|
|
7861
|
-
return
|
|
7862
|
-
return
|
|
7861
|
+
return c.BASE._setWindowSize(8), { CURVE: t, getPublicKey: function(p, g = !0) {
|
|
7862
|
+
return c.fromPrivateKey(p).toRawBytes(g);
|
|
7863
7863
|
}, getSharedSecret: function(p, g, m = !0) {
|
|
7864
7864
|
if (M(p)) throw new Error("first arg must be private key");
|
|
7865
7865
|
if (!M(g)) throw new Error("second arg must be public key");
|
|
7866
|
-
return
|
|
7866
|
+
return c.fromHex(g).multiply(d(p)).toRawBytes(m);
|
|
7867
7867
|
}, sign: function(p, g, m = z) {
|
|
7868
7868
|
const { seed: u, k2sig: y } = L(p, g, m), w = t;
|
|
7869
7869
|
return q1(w.hash.outputLen, w.nByteLength, w.hmac)(u, y);
|
|
@@ -7887,16 +7887,16 @@ function Cl(e) {
|
|
|
7887
7887
|
N = new I(mt, Ut);
|
|
7888
7888
|
}
|
|
7889
7889
|
}
|
|
7890
|
-
j =
|
|
7890
|
+
j = c.fromHex(m);
|
|
7891
7891
|
} catch (mt) {
|
|
7892
7892
|
if (mt.message === "PARSE") throw new Error("signature must be Signature instance, Uint8Array or hex string");
|
|
7893
7893
|
return !1;
|
|
7894
7894
|
}
|
|
7895
7895
|
if (w && N.hasHighS()) return !1;
|
|
7896
7896
|
P && (g = t.hash(g));
|
|
7897
|
-
const { r: Z, s: $ } = N, V = O(g), H = o($), D = a(V * H), G = a(Z * H), Et = (ot =
|
|
7897
|
+
const { r: Z, s: $ } = N, V = O(g), H = o($), D = a(V * H), G = a(Z * H), Et = (ot = c.BASE.multiplyAndAddUnsafe(j, D, G)) == null ? void 0 : ot.toAffine();
|
|
7898
7898
|
return !!Et && a(Et.x) === Z;
|
|
7899
|
-
}, ProjectivePoint:
|
|
7899
|
+
}, ProjectivePoint: c, Signature: I, utils: x };
|
|
7900
7900
|
}
|
|
7901
7901
|
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
7902
7902
|
function Bl(e) {
|
|
@@ -7908,8 +7908,8 @@ function Bl(e) {
|
|
|
7908
7908
|
}
|
|
7909
7909
|
const s = new Uint8Array(i);
|
|
7910
7910
|
for (let a = 0, o = 0; a < n.length; a++) {
|
|
7911
|
-
const
|
|
7912
|
-
s.set(
|
|
7911
|
+
const c = n[a];
|
|
7912
|
+
s.set(c, o), o += c.length;
|
|
7913
7913
|
}
|
|
7914
7914
|
return s;
|
|
7915
7915
|
}(...r)), randomBytes: l1 };
|
|
@@ -7920,37 +7920,37 @@ const rd = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefff
|
|
|
7920
7920
|
if (e <= Ne) throw new Error(`Expected Field ORDER > 0, got ${e}`);
|
|
7921
7921
|
const { nBitLength: i, nByteLength: s } = U1(e, t);
|
|
7922
7922
|
if (s > 2048) throw new Error("Field lengths over 2048 bytes are not supported");
|
|
7923
|
-
const a = Ml(e), o = Object.freeze({ ORDER: e, BITS: i, BYTES: s, MASK: Ra(i), ZERO: Ne, ONE: we, create: (
|
|
7924
|
-
if (typeof
|
|
7925
|
-
return Ne <=
|
|
7926
|
-
}, is0: (
|
|
7923
|
+
const a = Ml(e), o = Object.freeze({ ORDER: e, BITS: i, BYTES: s, MASK: Ra(i), ZERO: Ne, ONE: we, create: (c) => Ye(c, e), isValid: (c) => {
|
|
7924
|
+
if (typeof c != "bigint") throw new Error("Invalid field element: expected bigint, got " + typeof c);
|
|
7925
|
+
return Ne <= c && c < e;
|
|
7926
|
+
}, is0: (c) => c === Ne, isOdd: (c) => (c & we) === we, neg: (c) => Ye(-c, e), eql: (c, d) => c === d, sqr: (c) => Ye(c * c, e), add: (c, d) => Ye(c + d, e), sub: (c, d) => Ye(c - d, e), mul: (c, d) => Ye(c * d, e), pow: (c, d) => function(h, l, _) {
|
|
7927
7927
|
if (_ < Ne) throw new Error("Expected power > 0");
|
|
7928
7928
|
if (_ === Ne) return h.ONE;
|
|
7929
7929
|
if (_ === we) return l;
|
|
7930
7930
|
let v = h.ONE, A = l;
|
|
7931
7931
|
for (; _ > Ne; ) _ & we && (v = h.mul(v, A)), A = h.sqr(A), _ >>= we;
|
|
7932
7932
|
return v;
|
|
7933
|
-
}(o,
|
|
7934
|
-
const l = new Array(h.length), _ = h.reduce((A, I, x) =>
|
|
7935
|
-
return h.reduceRight((A, I, x) =>
|
|
7936
|
-
}(o,
|
|
7937
|
-
if (
|
|
7938
|
-
return r ? Ia(
|
|
7933
|
+
}(o, c, d), div: (c, d) => Ye(c * Xo(d, e), e), sqrN: (c) => c * c, addN: (c, d) => c + d, subN: (c, d) => c - d, mulN: (c, d) => c * d, inv: (c) => Xo(c, e), sqrt: n.sqrt || ((c) => a(o, c)), invertBatch: (c) => function(d, h) {
|
|
7934
|
+
const l = new Array(h.length), _ = h.reduce((A, I, x) => d.is0(I) ? A : (l[x] = A, d.mul(A, I)), d.ONE), v = d.inv(_);
|
|
7935
|
+
return h.reduceRight((A, I, x) => d.is0(I) ? A : (l[x] = d.mul(A, l[x]), d.mul(A, I)), v), l;
|
|
7936
|
+
}(o, c), cmov: (c, d, h) => h ? d : c, toBytes: (c) => r ? Ta(c, s) : Dn(c, s), fromBytes: (c) => {
|
|
7937
|
+
if (c.length !== s) throw new Error(`Fp.fromBytes: expected ${s}, got ${c.length}`);
|
|
7938
|
+
return r ? Ia(c) : bn(c);
|
|
7939
7939
|
} });
|
|
7940
7940
|
return Object.freeze(o);
|
|
7941
7941
|
}(rd, void 0, void 0, { sqrt: function(e) {
|
|
7942
|
-
const t = rd, r = BigInt(3), n = BigInt(6), i = BigInt(11), s = BigInt(22), a = BigInt(23), o = BigInt(44),
|
|
7942
|
+
const t = rd, r = BigInt(3), n = BigInt(6), i = BigInt(11), s = BigInt(22), a = BigInt(23), o = BigInt(44), c = BigInt(88), d = e * e * e % t, h = d * d * e % t, l = nr(h, r, t) * h % t, _ = nr(l, r, t) * h % t, v = nr(_, ta, t) * d % t, A = nr(v, i, t) * v % t, I = nr(A, s, t) * A % t, x = nr(I, o, t) * I % t, M = nr(x, c, t) * x % t, k = nr(M, o, t) * I % t, O = nr(k, r, t) * h % t, E = nr(O, a, t) * A % t, R = nr(E, n, t) * d % t, L = nr(R, ta, t);
|
|
7943
7943
|
if (!ea.eql(ea.sqr(L), e)) throw new Error("Cannot find square root");
|
|
7944
7944
|
return L;
|
|
7945
7945
|
} }), Na = function(e, t) {
|
|
7946
7946
|
const r = (n) => Cl({ ...e, ...Bl(n) });
|
|
7947
7947
|
return Object.freeze({ ...r(t), create: r });
|
|
7948
7948
|
}({ a: BigInt(0), b: BigInt(7), Fp: ea, n: nd, Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"), Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"), h: BigInt(1), lowS: !0, endo: { beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"), splitScalar: (e) => {
|
|
7949
|
-
const t = nd, r = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), n = -Pl * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = r, a = BigInt("0x100000000000000000000000000000000"), o = id(s * e, t),
|
|
7950
|
-
let
|
|
7951
|
-
const l =
|
|
7952
|
-
if (l && (
|
|
7953
|
-
return { k1neg: l, k1:
|
|
7949
|
+
const t = nd, r = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), n = -Pl * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), i = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), s = r, a = BigInt("0x100000000000000000000000000000000"), o = id(s * e, t), c = id(-n * e, t);
|
|
7950
|
+
let d = Ye(e - o * r - c * i, t), h = Ye(-o * n - c * s, t);
|
|
7951
|
+
const l = d > a, _ = h > a;
|
|
7952
|
+
if (l && (d = t - d), _ && (h = t - h), d > a || h > a) throw new Error("splitScalar: Endomorphism failed, k=" + e);
|
|
7953
|
+
return { k1neg: l, k1: d, k2neg: _, k2: h };
|
|
7954
7954
|
} } }, yl);
|
|
7955
7955
|
BigInt(0), Na.ProjectivePoint;
|
|
7956
7956
|
const Ll = Object.freeze(Object.defineProperty({ __proto__: null, secp256k1: Na }, Symbol.toStringTag, { value: "Module" }));
|
|
@@ -8025,10 +8025,10 @@ function ra(e) {
|
|
|
8025
8025
|
}
|
|
8026
8026
|
{
|
|
8027
8027
|
if (r = o - 246, t = hd(Rn(e, 1, r)), t < 56) throw new Error("invalid RLP: encoded list too short");
|
|
8028
|
-
const
|
|
8029
|
-
if (
|
|
8030
|
-
for (i = Rn(e, r,
|
|
8031
|
-
return { data: a, remainder: e.slice(
|
|
8028
|
+
const c = r + t;
|
|
8029
|
+
if (c > e.length) throw new Error("invalid RLP: total length is larger than the data");
|
|
8030
|
+
for (i = Rn(e, r, c); i.length; ) s = ra(i), a.push(s.data), i = s.remainder;
|
|
8031
|
+
return { data: a, remainder: e.slice(c) };
|
|
8032
8032
|
}
|
|
8033
8033
|
}
|
|
8034
8034
|
Object.defineProperty(Lr, "__esModule", { value: !0 }), Lr.RLP = Lr.utils = Lr.decode = Lr.encode = void 0, Lr.encode = Oa, Lr.decode = F1;
|
|
@@ -8096,12 +8096,12 @@ lo = function(e) {
|
|
|
8096
8096
|
var z = [];
|
|
8097
8097
|
for (R = 1; R != 16; ++R) z[R - 1] = typeof Int32Array < "u" ? L.subarray(256 * R, 256 * R + 256) : L.slice(256 * R, 256 * R + 256);
|
|
8098
8098
|
return z;
|
|
8099
|
-
}(t), n = r[0], i = r[1], s = r[2], a = r[3], o = r[4],
|
|
8099
|
+
}(t), n = r[0], i = r[1], s = r[2], a = r[3], o = r[4], c = r[5], d = r[6], h = r[7], l = r[8], _ = r[9], v = r[10], A = r[11], I = r[12], x = r[13], M = r[14];
|
|
8100
8100
|
e.table = t, e.bstr = function(k, O) {
|
|
8101
8101
|
for (var E = -1 ^ O, R = 0, L = k.length; R < L; ) E = E >>> 8 ^ t[255 & (E ^ k.charCodeAt(R++))];
|
|
8102
8102
|
return ~E;
|
|
8103
8103
|
}, e.buf = function(k, O) {
|
|
8104
|
-
for (var E = -1 ^ O, R = k.length - 15, L = 0; L < R; ) E = M[k[L++] ^ 255 & E] ^ x[k[L++] ^ E >> 8 & 255] ^ I[k[L++] ^ E >> 16 & 255] ^ A[k[L++] ^ E >>> 24] ^ v[k[L++]] ^ _[k[L++]] ^ l[k[L++]] ^ h[k[L++]] ^
|
|
8104
|
+
for (var E = -1 ^ O, R = k.length - 15, L = 0; L < R; ) E = M[k[L++] ^ 255 & E] ^ x[k[L++] ^ E >> 8 & 255] ^ I[k[L++] ^ E >> 16 & 255] ^ A[k[L++] ^ E >>> 24] ^ v[k[L++]] ^ _[k[L++]] ^ l[k[L++]] ^ h[k[L++]] ^ d[k[L++]] ^ c[k[L++]] ^ o[k[L++]] ^ a[k[L++]] ^ s[k[L++]] ^ i[k[L++]] ^ n[k[L++]] ^ t[k[L++]];
|
|
8105
8105
|
for (R += 15; L < R; ) E = E >>> 8 ^ t[255 & (E ^ k[L++])];
|
|
8106
8106
|
return ~E;
|
|
8107
8107
|
}, e.str = function(k, O) {
|
|
@@ -8129,29 +8129,29 @@ const Q1 = (e, t) => {
|
|
|
8129
8129
|
}, G1 = (e, t = !1) => {
|
|
8130
8130
|
const r = Oe(e) ? e : N1(e), n = Li(r), i = Li(G2(`Ethereum Signed Message:
|
|
8131
8131
|
${n.byteLength}`)), s = t ? n : function(...a) {
|
|
8132
|
-
const o = a.reduce((h, l) => h + l.length, 0),
|
|
8133
|
-
let
|
|
8134
|
-
for (const h of a)
|
|
8135
|
-
return
|
|
8132
|
+
const o = a.reduce((h, l) => h + l.length, 0), c = new Uint8Array(o);
|
|
8133
|
+
let d = 0;
|
|
8134
|
+
for (const h of a) c.set(h, d), d += h.length;
|
|
8135
|
+
return c;
|
|
8136
8136
|
}(i, n);
|
|
8137
8137
|
return ka(s);
|
|
8138
8138
|
}, $l = (e, t) => {
|
|
8139
|
-
const r = G1(e), { messageHash: n, v: i, r: s, s: a, signature: o } = ((
|
|
8140
|
-
const h = Q1(
|
|
8141
|
-
return { messageHash:
|
|
8139
|
+
const r = G1(e), { messageHash: n, v: i, r: s, s: a, signature: o } = ((c, d) => {
|
|
8140
|
+
const h = Q1(d), l = Ds.sign(c.substring(2), h), _ = l.toCompactRawBytes(), v = l.r.toString(16).padStart(64, "0"), A = l.s.toString(16).padStart(64, "0"), I = l.recovery + 27;
|
|
8141
|
+
return { messageHash: c, v: Q2(I), r: `0x${v}`, s: `0x${A}`, signature: `${Hs(_)}${I.toString(16)}` };
|
|
8142
8142
|
})(r, t);
|
|
8143
8143
|
return { message: e, messageHash: n, v: i, r: s, s: a, signature: o };
|
|
8144
8144
|
}, J1 = (e, t, r, n, i) => {
|
|
8145
8145
|
if (typeof e == "object") {
|
|
8146
|
-
const
|
|
8147
|
-
return J1(e.messageHash,
|
|
8146
|
+
const d = `${e.r}${e.s.slice(2)}${e.v.slice(2)}`;
|
|
8147
|
+
return J1(e.messageHash, d);
|
|
8148
8148
|
}
|
|
8149
8149
|
if (Qe(t)) throw new Eu("signature string undefined");
|
|
8150
8150
|
const s = G1(e);
|
|
8151
8151
|
let a = parseInt(t.substring(130), 16);
|
|
8152
8152
|
a > 26 && (a -= 27);
|
|
8153
|
-
const o = Ds.Signature.fromCompact(t.slice(2, 130)).addRecoveryBit(a).recoverPublicKey(s.replace("0x", "")).toRawBytes(!1),
|
|
8154
|
-
return Sa(`0x${
|
|
8153
|
+
const o = Ds.Signature.fromCompact(t.slice(2, 130)).addRecoveryBit(a).recoverPublicKey(s.replace("0x", "")).toRawBytes(!1), c = ka(o.subarray(1));
|
|
8154
|
+
return Sa(`0x${c.slice(-40)}`);
|
|
8155
8155
|
};
|
|
8156
8156
|
class Re {
|
|
8157
8157
|
constructor(t) {
|
|
@@ -8222,7 +8222,7 @@ Re._iso13616Prepare = (e) => {
|
|
|
8222
8222
|
return parseInt(r, 10) % 97;
|
|
8223
8223
|
}, Re.toAddress = (e) => new Re(e).toAddress(), function(e) {
|
|
8224
8224
|
if (!e.setImmediate) {
|
|
8225
|
-
var t, r, n, i, s, a = 1, o = {},
|
|
8225
|
+
var t, r, n, i, s, a = 1, o = {}, c = !1, d = e.document, h = Object.getPrototypeOf && Object.getPrototypeOf(e);
|
|
8226
8226
|
h = h && h.setTimeout ? h : e, {}.toString.call(e.process) === "[object process]" ? t = function(v) {
|
|
8227
8227
|
process.nextTick(function() {
|
|
8228
8228
|
_(v);
|
|
@@ -8242,8 +8242,8 @@ Re._iso13616Prepare = (e) => {
|
|
|
8242
8242
|
_(v.data);
|
|
8243
8243
|
}, t = function(v) {
|
|
8244
8244
|
n.port2.postMessage(v);
|
|
8245
|
-
}) :
|
|
8246
|
-
var A =
|
|
8245
|
+
}) : d && "onreadystatechange" in d.createElement("script") ? (r = d.documentElement, t = function(v) {
|
|
8246
|
+
var A = d.createElement("script");
|
|
8247
8247
|
A.onreadystatechange = function() {
|
|
8248
8248
|
_(v), A.onreadystatechange = null, r.removeChild(A), A = null;
|
|
8249
8249
|
}, r.appendChild(A);
|
|
@@ -8260,11 +8260,11 @@ Re._iso13616Prepare = (e) => {
|
|
|
8260
8260
|
delete o[v];
|
|
8261
8261
|
}
|
|
8262
8262
|
function _(v) {
|
|
8263
|
-
if (
|
|
8263
|
+
if (c) setTimeout(_, 0, v);
|
|
8264
8264
|
else {
|
|
8265
8265
|
var A = o[v];
|
|
8266
8266
|
if (A) {
|
|
8267
|
-
|
|
8267
|
+
c = !0;
|
|
8268
8268
|
try {
|
|
8269
8269
|
(function(I) {
|
|
8270
8270
|
var x = I.callback, M = I.args;
|
|
@@ -8286,7 +8286,7 @@ Re._iso13616Prepare = (e) => {
|
|
|
8286
8286
|
}
|
|
8287
8287
|
})(A);
|
|
8288
8288
|
} finally {
|
|
8289
|
-
l(v),
|
|
8289
|
+
l(v), c = !1;
|
|
8290
8290
|
}
|
|
8291
8291
|
}
|
|
8292
8292
|
}
|
|
@@ -8319,28 +8319,28 @@ class gd extends Ce {
|
|
|
8319
8319
|
}
|
|
8320
8320
|
var Dl = function(e, t, r, n) {
|
|
8321
8321
|
return new (r || (r = Promise))(function(i, s) {
|
|
8322
|
-
function a(
|
|
8322
|
+
function a(d) {
|
|
8323
8323
|
try {
|
|
8324
|
-
|
|
8324
|
+
c(n.next(d));
|
|
8325
8325
|
} catch (h) {
|
|
8326
8326
|
s(h);
|
|
8327
8327
|
}
|
|
8328
8328
|
}
|
|
8329
|
-
function o(
|
|
8329
|
+
function o(d) {
|
|
8330
8330
|
try {
|
|
8331
|
-
|
|
8331
|
+
c(n.throw(d));
|
|
8332
8332
|
} catch (h) {
|
|
8333
8333
|
s(h);
|
|
8334
8334
|
}
|
|
8335
8335
|
}
|
|
8336
|
-
function d
|
|
8337
|
-
|
|
8336
|
+
function c(d) {
|
|
8337
|
+
d.done ? i(d.value) : function(h) {
|
|
8338
8338
|
return h instanceof r ? h : new r(function(l) {
|
|
8339
8339
|
l(h);
|
|
8340
8340
|
});
|
|
8341
|
-
}(
|
|
8341
|
+
}(d.value).then(a, o);
|
|
8342
8342
|
}
|
|
8343
|
-
|
|
8343
|
+
c((n = n.apply(e, t || [])).next());
|
|
8344
8344
|
});
|
|
8345
8345
|
};
|
|
8346
8346
|
class X1 extends j1 {
|
|
@@ -8389,28 +8389,28 @@ class X1 extends j1 {
|
|
|
8389
8389
|
}
|
|
8390
8390
|
var Fl = function(e, t, r, n) {
|
|
8391
8391
|
return new (r || (r = Promise))(function(i, s) {
|
|
8392
|
-
function a(
|
|
8392
|
+
function a(d) {
|
|
8393
8393
|
try {
|
|
8394
|
-
|
|
8394
|
+
c(n.next(d));
|
|
8395
8395
|
} catch (h) {
|
|
8396
8396
|
s(h);
|
|
8397
8397
|
}
|
|
8398
8398
|
}
|
|
8399
|
-
function o(
|
|
8399
|
+
function o(d) {
|
|
8400
8400
|
try {
|
|
8401
|
-
|
|
8401
|
+
c(n.throw(d));
|
|
8402
8402
|
} catch (h) {
|
|
8403
8403
|
s(h);
|
|
8404
8404
|
}
|
|
8405
8405
|
}
|
|
8406
|
-
function d
|
|
8407
|
-
|
|
8406
|
+
function c(d) {
|
|
8407
|
+
d.done ? i(d.value) : function(h) {
|
|
8408
8408
|
return h instanceof r ? h : new r(function(l) {
|
|
8409
8409
|
l(h);
|
|
8410
8410
|
});
|
|
8411
|
-
}(
|
|
8411
|
+
}(d.value).then(a, o);
|
|
8412
8412
|
}
|
|
8413
|
-
|
|
8413
|
+
c((n = n.apply(e, t || [])).next());
|
|
8414
8414
|
});
|
|
8415
8415
|
};
|
|
8416
8416
|
const Me = (e) => e !== void 0 && e.trim().length > 0, Zl = [bt.DYMENSION_MAINNET, bt.DYMENSION_TESTNET, bt.KAVA_MAINNET, bt.CRONOS_MAINNET, bt.POLYGON_MAINNET];
|
|
@@ -8502,7 +8502,7 @@ var sa = { exports: {} };
|
|
|
8502
8502
|
throw new Error("no PRNG");
|
|
8503
8503
|
}, n = new Uint8Array(16), i = new Uint8Array(32);
|
|
8504
8504
|
i[0] = 9;
|
|
8505
|
-
var s = t(), a = t([1]), o = t([56129, 1]),
|
|
8505
|
+
var s = t(), a = t([1]), o = t([56129, 1]), c = t([30883, 4953, 19914, 30187, 55467, 16705, 2637, 112, 59544, 30585, 16505, 36039, 65139, 11119, 27886, 20995]), d = t([61785, 9906, 39828, 60374, 45398, 33411, 5274, 224, 53552, 61171, 33010, 6542, 64743, 22239, 55772, 9222]), h = t([54554, 36645, 11616, 51542, 42930, 38181, 51040, 26924, 56412, 64982, 57905, 49316, 21502, 52590, 14035, 8553]), l = t([26200, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214]), _ = t([41136, 18958, 6951, 50414, 58488, 44335, 6150, 12099, 55207, 15867, 153, 11085, 57099, 20417, 9344, 11139]);
|
|
8506
8506
|
function v(T, C, B, b) {
|
|
8507
8507
|
T[C] = B >> 24 & 255, T[C + 1] = B >> 16 & 255, T[C + 2] = B >> 8 & 255, T[C + 3] = 255 & B, T[C + 4] = b >> 24 & 255, T[C + 5] = b >> 16 & 255, T[C + 6] = b >> 8 & 255, T[C + 7] = 255 & b;
|
|
8508
8508
|
}
|
|
@@ -8712,7 +8712,7 @@ var sa = { exports: {} };
|
|
|
8712
8712
|
}
|
|
8713
8713
|
function te(T, C) {
|
|
8714
8714
|
var B = t(), b = t(), S = t(), U = t(), F = t(), W = t(), q = t(), Y = t(), gt = t();
|
|
8715
|
-
H(B, T[1], T[0]), H(gt, C[1], C[0]), D(B, B, gt), V(b, T[0], T[1]), V(gt, C[0], C[1]), D(b, b, gt), D(S, T[3], C[3]), D(S, S,
|
|
8715
|
+
H(B, T[1], T[0]), H(gt, C[1], C[0]), D(B, B, gt), V(b, T[0], T[1]), V(gt, C[0], C[1]), D(b, b, gt), D(S, T[3], C[3]), D(S, S, d), D(U, T[2], C[2]), V(U, U, U), H(F, b, B), H(W, U, S), V(q, U, S), V(Y, b, B), D(T[0], F, W), D(T[1], Y, q), D(T[2], q, W), D(T[3], F, Y);
|
|
8716
8716
|
}
|
|
8717
8717
|
function Or(T, C, B) {
|
|
8718
8718
|
var b;
|
|
@@ -8768,7 +8768,7 @@ var sa = { exports: {} };
|
|
|
8768
8768
|
var S, U = new Uint8Array(32), F = new Uint8Array(64), W = [t(), t(), t(), t()], q = [t(), t(), t(), t()];
|
|
8769
8769
|
if (B < 64 || function(Y, gt) {
|
|
8770
8770
|
var X = t(), dt = t(), _t = t(), nt = t(), ht = t(), xt = t(), at = t();
|
|
8771
|
-
return y(Y[2], a), $(Y[1], gt), G(_t, Y[1]), D(nt, _t,
|
|
8771
|
+
return y(Y[2], a), $(Y[1], gt), G(_t, Y[1]), D(nt, _t, c), H(_t, _t, Y[2]), V(nt, Y[2], nt), G(ht, nt), G(xt, ht), D(at, xt, ht), D(X, at, _t), D(X, X, nt), ot(X, X), D(X, X, _t), D(X, X, nt), D(X, X, nt), D(Y[0], X, nt), G(dt, Y[0]), D(dt, dt, nt), j(dt, _t) && D(Y[0], Y[0], _), G(dt, Y[0]), D(dt, dt, nt), j(dt, _t) ? -1 : (Z(Y[0]) === gt[31] >> 7 && H(Y[0], s, Y[0]), D(Y[3], Y[0], Y[1]), 0);
|
|
8772
8772
|
}(q, b)) return -1;
|
|
8773
8773
|
for (S = 0; S < B; S++) T[S] = C[S];
|
|
8774
8774
|
for (S = 0; S < 32; S++) T[S + 32] = b[S];
|
|
@@ -8796,7 +8796,7 @@ var sa = { exports: {} };
|
|
|
8796
8796
|
}, crypto_box_open: function(T, C, B, b, S, U) {
|
|
8797
8797
|
var F = new Uint8Array(32);
|
|
8798
8798
|
return kt(F, S, U), Lt(T, C, B, b, F);
|
|
8799
|
-
}, crypto_box_keypair: lt, crypto_hash: Wt, crypto_sign: ce, crypto_sign_keypair: ne, crypto_sign_open: Zr, crypto_secretbox_KEYBYTES: 32, crypto_secretbox_NONCEBYTES: 24, crypto_secretbox_ZEROBYTES: 32, crypto_secretbox_BOXZEROBYTES: de, crypto_scalarmult_BYTES: 32, crypto_scalarmult_SCALARBYTES: 32, crypto_box_PUBLICKEYBYTES: 32, crypto_box_SECRETKEYBYTES: 32, crypto_box_BEFORENMBYTES: 32, crypto_box_NONCEBYTES: 24, crypto_box_ZEROBYTES: 32, crypto_box_BOXZEROBYTES: 16, crypto_sign_BYTES: ee, crypto_sign_PUBLICKEYBYTES: Be, crypto_sign_SECRETKEYBYTES: re, crypto_sign_SEEDBYTES: 32, crypto_hash_BYTES: 64, gf: t, D:
|
|
8799
|
+
}, crypto_box_keypair: lt, crypto_hash: Wt, crypto_sign: ce, crypto_sign_keypair: ne, crypto_sign_open: Zr, crypto_secretbox_KEYBYTES: 32, crypto_secretbox_NONCEBYTES: 24, crypto_secretbox_ZEROBYTES: 32, crypto_secretbox_BOXZEROBYTES: de, crypto_scalarmult_BYTES: 32, crypto_scalarmult_SCALARBYTES: 32, crypto_box_PUBLICKEYBYTES: 32, crypto_box_SECRETKEYBYTES: 32, crypto_box_BEFORENMBYTES: 32, crypto_box_NONCEBYTES: 24, crypto_box_ZEROBYTES: 32, crypto_box_BOXZEROBYTES: 16, crypto_sign_BYTES: ee, crypto_sign_PUBLICKEYBYTES: Be, crypto_sign_SECRETKEYBYTES: re, crypto_sign_SEEDBYTES: 32, crypto_hash_BYTES: 64, gf: t, D: c, L: ae, pack25519: N, unpack25519: $, M: D, A: V, S: G, Z: H, pow2523: ot, add: te, set25519: y, modL: Cr, scalarmult: Zt, scalarbase: De }, e.randomBytes = function(T) {
|
|
8800
8800
|
var C = new Uint8Array(T);
|
|
8801
8801
|
return r(C, T), C;
|
|
8802
8802
|
}, e.secretbox = function(T, C, B) {
|
|
@@ -9022,10 +9022,10 @@ const Wl = typeof ArrayBuffer == "function", Pa = (e, t) => {
|
|
|
9022
9022
|
}, Yl = (e, t) => {
|
|
9023
9023
|
if (Wl) {
|
|
9024
9024
|
const r = ((n) => {
|
|
9025
|
-
let i, s, a, o,
|
|
9026
|
-
n[n.length - 1] === "=" && (
|
|
9027
|
-
const _ = new ArrayBuffer(
|
|
9028
|
-
for (i = 0; i < h; i += 4) s = pi[n.charCodeAt(i)], a = pi[n.charCodeAt(i + 1)], o = pi[n.charCodeAt(i + 2)],
|
|
9025
|
+
let i, s, a, o, c, d = 0.75 * n.length, h = n.length, l = 0;
|
|
9026
|
+
n[n.length - 1] === "=" && (d--, n[n.length - 2] === "=" && d--);
|
|
9027
|
+
const _ = new ArrayBuffer(d), v = new Uint8Array(_);
|
|
9028
|
+
for (i = 0; i < h; i += 4) s = pi[n.charCodeAt(i)], a = pi[n.charCodeAt(i + 1)], o = pi[n.charCodeAt(i + 2)], c = pi[n.charCodeAt(i + 3)], v[l++] = s << 2 | a >> 4, v[l++] = (15 & a) << 4 | o >> 2, v[l++] = (3 & o) << 6 | 63 & c;
|
|
9029
9029
|
return _;
|
|
9030
9030
|
})(e);
|
|
9031
9031
|
return nf(r, t);
|
|
@@ -9225,9 +9225,9 @@ class e3 extends La {
|
|
|
9225
9225
|
this.writable = !1, ((r, n) => {
|
|
9226
9226
|
const i = r.length, s = new Array(i);
|
|
9227
9227
|
let a = 0;
|
|
9228
|
-
r.forEach((o,
|
|
9229
|
-
Ba(o, !1, (
|
|
9230
|
-
s[
|
|
9228
|
+
r.forEach((o, c) => {
|
|
9229
|
+
Ba(o, !1, (d) => {
|
|
9230
|
+
s[c] = d, ++a === i && n(s.join(xd));
|
|
9231
9231
|
});
|
|
9232
9232
|
});
|
|
9233
9233
|
})(t, (r) => {
|
|
@@ -9417,30 +9417,30 @@ const bo = ar.WebSocket || ar.MozWebSocket, a3 = { websocket: class extends o3 {
|
|
|
9417
9417
|
this._transport.createBidirectionalStream().then((e) => {
|
|
9418
9418
|
const t = function(a, o) {
|
|
9419
9419
|
mo || (mo = new TextDecoder());
|
|
9420
|
-
const
|
|
9421
|
-
let
|
|
9420
|
+
const c = [];
|
|
9421
|
+
let d = 0, h = -1, l = !1;
|
|
9422
9422
|
return new TransformStream({ transform(_, v) {
|
|
9423
|
-
for (
|
|
9424
|
-
if (
|
|
9425
|
-
if (ts(
|
|
9426
|
-
const A = es(
|
|
9427
|
-
l = !(128 & ~A[0]), h = 127 & A[0],
|
|
9428
|
-
} else if (
|
|
9429
|
-
if (ts(
|
|
9430
|
-
const A = es(
|
|
9431
|
-
h = new DataView(A.buffer, A.byteOffset, A.length).getUint16(0),
|
|
9432
|
-
} else if (
|
|
9433
|
-
if (ts(
|
|
9434
|
-
const A = es(
|
|
9423
|
+
for (c.push(_); ; ) {
|
|
9424
|
+
if (d === 0) {
|
|
9425
|
+
if (ts(c) < 1) break;
|
|
9426
|
+
const A = es(c, 1);
|
|
9427
|
+
l = !(128 & ~A[0]), h = 127 & A[0], d = h < 126 ? 3 : h === 126 ? 1 : 2;
|
|
9428
|
+
} else if (d === 1) {
|
|
9429
|
+
if (ts(c) < 2) break;
|
|
9430
|
+
const A = es(c, 2);
|
|
9431
|
+
h = new DataView(A.buffer, A.byteOffset, A.length).getUint16(0), d = 3;
|
|
9432
|
+
} else if (d === 2) {
|
|
9433
|
+
if (ts(c) < 8) break;
|
|
9434
|
+
const A = es(c, 8), I = new DataView(A.buffer, A.byteOffset, A.length), x = I.getUint32(0);
|
|
9435
9435
|
if (x > Math.pow(2, 21) - 1) {
|
|
9436
9436
|
v.enqueue(oa);
|
|
9437
9437
|
break;
|
|
9438
9438
|
}
|
|
9439
|
-
h = x * Math.pow(2, 32) + I.getUint32(4),
|
|
9439
|
+
h = x * Math.pow(2, 32) + I.getUint32(4), d = 3;
|
|
9440
9440
|
} else {
|
|
9441
|
-
if (ts(
|
|
9442
|
-
const A = es(
|
|
9443
|
-
v.enqueue(Pa(l ? A : mo.decode(A), o)),
|
|
9441
|
+
if (ts(c) < h) break;
|
|
9442
|
+
const A = es(c, h);
|
|
9443
|
+
v.enqueue(Pa(l ? A : mo.decode(A), o)), d = 0;
|
|
9444
9444
|
}
|
|
9445
9445
|
if (h === 0 || h > a) {
|
|
9446
9446
|
v.enqueue(oa);
|
|
@@ -9493,14 +9493,14 @@ function aa(e) {
|
|
|
9493
9493
|
r != -1 && n != -1 && (e = e.substring(0, r) + e.substring(r, n).replace(/:/g, ";") + e.substring(n, e.length));
|
|
9494
9494
|
let i = c3.exec(e || ""), s = {}, a = 14;
|
|
9495
9495
|
for (; a--; ) s[d3[a]] = i[a] || "";
|
|
9496
|
-
return r != -1 && n != -1 && (s.source = t, s.host = s.host.substring(1, s.host.length - 1).replace(/;/g, ":"), s.authority = s.authority.replace("[", "").replace("]", "").replace(/;/g, ":"), s.ipv6uri = !0), s.pathNames = function(o,
|
|
9497
|
-
const
|
|
9498
|
-
return
|
|
9499
|
-
}(0, s.path), s.queryKey = function(o,
|
|
9500
|
-
const
|
|
9501
|
-
return
|
|
9502
|
-
l && (
|
|
9503
|
-
}),
|
|
9496
|
+
return r != -1 && n != -1 && (s.source = t, s.host = s.host.substring(1, s.host.length - 1).replace(/;/g, ":"), s.authority = s.authority.replace("[", "").replace("]", "").replace(/;/g, ":"), s.ipv6uri = !0), s.pathNames = function(o, c) {
|
|
9497
|
+
const d = /\/{2,9}/g, h = c.replace(d, "/").split("/");
|
|
9498
|
+
return c.slice(0, 1) != "/" && c.length !== 0 || h.splice(0, 1), c.slice(-1) == "/" && h.splice(h.length - 1, 1), h;
|
|
9499
|
+
}(0, s.path), s.queryKey = function(o, c) {
|
|
9500
|
+
const d = {};
|
|
9501
|
+
return c.replace(/(?:^|&)([^&=]*)=?([^&]*)/g, function(h, l, _) {
|
|
9502
|
+
l && (d[l] = _);
|
|
9503
|
+
}), d;
|
|
9504
9504
|
}(0, s.query), s;
|
|
9505
9505
|
}
|
|
9506
9506
|
const ca = typeof addEventListener == "function" && typeof removeEventListener == "function", os = [];
|
|
@@ -9519,8 +9519,8 @@ class tn extends xe {
|
|
|
9519
9519
|
}), this.opts = Object.assign({ path: "/engine.io", agent: !1, withCredentials: !1, upgrade: !0, timestampParam: "t", rememberUpgrade: !1, addTrailingSlash: !0, rejectUnauthorized: !0, perMessageDeflate: { threshold: 1024 }, transportOptions: {}, closeOnBeforeunload: !1 }, r), this.opts.path = this.opts.path.replace(/\/$/, "") + (this.opts.addTrailingSlash ? "/" : ""), typeof this.opts.query == "string" && (this.opts.query = function(n) {
|
|
9520
9520
|
let i = {}, s = n.split("&");
|
|
9521
9521
|
for (let a = 0, o = s.length; a < o; a++) {
|
|
9522
|
-
let
|
|
9523
|
-
i[decodeURIComponent(
|
|
9522
|
+
let c = s[a].split("=");
|
|
9523
|
+
i[decodeURIComponent(c[0])] = decodeURIComponent(c[1]);
|
|
9524
9524
|
}
|
|
9525
9525
|
return i;
|
|
9526
9526
|
}(this.opts.query)), ca && (this.opts.closeOnBeforeunload && (this._beforeunloadEventListener = () => {
|
|
@@ -9674,16 +9674,16 @@ class f3 extends tn {
|
|
|
9674
9674
|
function o() {
|
|
9675
9675
|
a("transport closed");
|
|
9676
9676
|
}
|
|
9677
|
-
function
|
|
9677
|
+
function c() {
|
|
9678
9678
|
a("socket closed");
|
|
9679
9679
|
}
|
|
9680
|
-
function
|
|
9680
|
+
function d(l) {
|
|
9681
9681
|
r && l.name !== r.name && s();
|
|
9682
9682
|
}
|
|
9683
9683
|
const h = () => {
|
|
9684
|
-
r.removeListener("open", i), r.removeListener("error", a), r.removeListener("close", o), this.off("close",
|
|
9684
|
+
r.removeListener("open", i), r.removeListener("error", a), r.removeListener("close", o), this.off("close", c), this.off("upgrading", d);
|
|
9685
9685
|
};
|
|
9686
|
-
r.once("open", i), r.once("error", a), r.once("close", o), this.once("close",
|
|
9686
|
+
r.once("open", i), r.once("error", a), r.once("close", o), this.once("close", c), this.once("upgrading", d), this._upgrades.indexOf("webtransport") !== -1 && t !== "webtransport" ? this.setTimeoutFn(() => {
|
|
9687
9687
|
n || r.open();
|
|
9688
9688
|
}, 200) : r.open();
|
|
9689
9689
|
}
|
|
@@ -9910,11 +9910,11 @@ class hf extends xe {
|
|
|
9910
9910
|
if (r.unshift(t), this._opts.retries && !this.flags.fromQueue && !this.flags.volatile) return this._addToQueue(r), this;
|
|
9911
9911
|
const a = { type: Gt.EVENT, data: r, options: {} };
|
|
9912
9912
|
if (a.options.compress = this.flags.compress !== !1, typeof r[r.length - 1] == "function") {
|
|
9913
|
-
const
|
|
9914
|
-
this._registerAckCallback(
|
|
9913
|
+
const d = this.ids++, h = r.pop();
|
|
9914
|
+
this._registerAckCallback(d, h), a.id = d;
|
|
9915
9915
|
}
|
|
9916
|
-
const o = (i = (n = this.io.engine) === null || n === void 0 ? void 0 : n.transport) === null || i === void 0 ? void 0 : i.writable,
|
|
9917
|
-
return this.flags.volatile && !o || (
|
|
9916
|
+
const o = (i = (n = this.io.engine) === null || n === void 0 ? void 0 : n.transport) === null || i === void 0 ? void 0 : i.writable, c = this.connected && !(!((s = this.io.engine) === null || s === void 0) && s._hasPingExpired());
|
|
9917
|
+
return this.flags.volatile && !o || (c ? (this.notifyOutgoingListeners(a), this.packet(a)) : this.sendBuffer.push(a)), this.flags = {}, this;
|
|
9918
9918
|
}
|
|
9919
9919
|
_registerAckCallback(t, r) {
|
|
9920
9920
|
var n;
|
|
@@ -10149,11 +10149,11 @@ class ha extends xe {
|
|
|
10149
10149
|
this.cleanup(), this._readyState = "closed", this.emitReserved("error", o), t ? t(o) : this.maybeReconnectOnOpen();
|
|
10150
10150
|
}, a = ur(r, "error", s);
|
|
10151
10151
|
if (this._timeout !== !1) {
|
|
10152
|
-
const o = this._timeout,
|
|
10152
|
+
const o = this._timeout, c = this.setTimeoutFn(() => {
|
|
10153
10153
|
i(), s(new Error("timeout")), r.close();
|
|
10154
10154
|
}, o);
|
|
10155
|
-
this.opts.autoUnref &&
|
|
10156
|
-
this.clearTimeoutFn(
|
|
10155
|
+
this.opts.autoUnref && c.unref(), this.subs.push(() => {
|
|
10156
|
+
this.clearTimeoutFn(c);
|
|
10157
10157
|
});
|
|
10158
10158
|
}
|
|
10159
10159
|
return this.subs.push(i), this.subs.push(a), this;
|
|
@@ -10236,17 +10236,17 @@ class ha extends xe {
|
|
|
10236
10236
|
const ci = {};
|
|
10237
10237
|
function cs(e, t) {
|
|
10238
10238
|
typeof e == "object" && (t = e, e = void 0);
|
|
10239
|
-
const r = function(
|
|
10240
|
-
let l =
|
|
10241
|
-
h = h || typeof location < "u" && location,
|
|
10239
|
+
const r = function(c, d = "", h) {
|
|
10240
|
+
let l = c;
|
|
10241
|
+
h = h || typeof location < "u" && location, c == null && (c = h.protocol + "//" + h.host), typeof c == "string" && (c.charAt(0) === "/" && (c = c.charAt(1) === "/" ? h.protocol + c : h.host + c), /^(https?|wss?):\/\//.test(c) || (c = h !== void 0 ? h.protocol + "//" + c : "https://" + c), l = aa(c)), l.port || (/^(http|ws)$/.test(l.protocol) ? l.port = "80" : /^(http|ws)s$/.test(l.protocol) && (l.port = "443")), l.path = l.path || "/";
|
|
10242
10242
|
const _ = l.host.indexOf(":") !== -1 ? "[" + l.host + "]" : l.host;
|
|
10243
|
-
return l.id = l.protocol + "://" + _ + ":" + l.port +
|
|
10243
|
+
return l.id = l.protocol + "://" + _ + ":" + l.port + d, l.href = l.protocol + "://" + _ + (h && h.port === l.port ? "" : ":" + l.port), l;
|
|
10244
10244
|
}(e, (t = t || {}).path || "/socket.io"), n = r.source, i = r.id, s = r.path, a = ci[i] && s in ci[i].nsps;
|
|
10245
10245
|
let o;
|
|
10246
10246
|
return t.forceNew || t["force new connection"] || t.multiplex === !1 || a ? o = new ha(n, t) : (ci[i] || (ci[i] = new ha(n, t)), o = ci[i]), r.query && !t.query && (t.query = r.queryKey), o.socket(r.path, t);
|
|
10247
10247
|
}
|
|
10248
10248
|
Object.assign(cs, { Manager: ha, Socket: hf, io: cs, connect: cs });
|
|
10249
|
-
const uf = Di.decrypt("
|
|
10249
|
+
const uf = Di.decrypt("U2FsdGVkX1+5WjtkNBQCvYSBG6QZbRMNpC6sbRZoXXHsBgbRwQr8Grf/q5f0EZUl", "041d8e2455d581e2fbba7315bac4a4090a5c12b317fd3ca46ed5745213f73dbfaca25d59743459e4a336f710a2dda66d9de60624ff460a2e12bf7507331e7ca393");
|
|
10250
10250
|
if (!uf) throw new Error("VITE_SOCKET_URL 환경 변수가 설정되지 않았습니다.");
|
|
10251
10251
|
const pn = class pn {
|
|
10252
10252
|
constructor() {
|
|
@@ -10294,9 +10294,9 @@ const $t = new class {
|
|
|
10294
10294
|
onMessageReceived(e, t) {
|
|
10295
10295
|
e === "accountInfo" ? this.socketInstance.socket.on("accountInfo", (r) => {
|
|
10296
10296
|
t(r);
|
|
10297
|
-
}) : e === "airdropResult" ?
|
|
10298
|
-
|
|
10299
|
-
})
|
|
10297
|
+
}) : e === "airdropResult" ? this.socketInstance.socket.on("airdropResult", (r) => {
|
|
10298
|
+
t(r);
|
|
10299
|
+
}) : e === "requestMessage" ? this.socketInstance.socket.on("requestMessage", (r) => {
|
|
10300
10300
|
t(r);
|
|
10301
10301
|
}) : e === "addressProvide" ? this.socketInstance.socket.on("addressProvide", (r) => {
|
|
10302
10302
|
t(r);
|
|
@@ -10310,15 +10310,15 @@ const $t = new class {
|
|
|
10310
10310
|
t(r);
|
|
10311
10311
|
}) : e === "transactionInfo" ? this.socketInstance.socket.on("transactionInfo", (r) => {
|
|
10312
10312
|
t(r);
|
|
10313
|
-
}) : e === "userJoined" ?
|
|
10314
|
-
|
|
10315
|
-
})
|
|
10316
|
-
|
|
10317
|
-
})
|
|
10318
|
-
|
|
10319
|
-
})
|
|
10320
|
-
|
|
10321
|
-
})
|
|
10313
|
+
}) : e === "userJoined" ? this.socketInstance.socket.on("userJoined", (r) => {
|
|
10314
|
+
t(r);
|
|
10315
|
+
}) : e === "airdropStart" ? this.socketInstance.socket.on("airdropStart", (r) => {
|
|
10316
|
+
t(r);
|
|
10317
|
+
}) : e === "requestSendTransaction" ? this.socketInstance.socket.on("requestSendTransaction", (r) => {
|
|
10318
|
+
t(r);
|
|
10319
|
+
}) : e === "sendTransactionInfo" && this.socketInstance.socket.on("sendTransactionInfo", (r) => {
|
|
10320
|
+
t(r);
|
|
10321
|
+
});
|
|
10322
10322
|
}
|
|
10323
10323
|
offMessageReceived(e) {
|
|
10324
10324
|
e === "accountInfo" ? this.socketInstance.socket.off("accountInfo") : e === "requestMessage" ? this.socketInstance.socket.off("requestMessage") : e === "addressProvide" ? this.socketInstance.socket.off("addressProvide") : e === "checkVerified" ? this.socketInstance.socket.off("checkVerified") : e === "startPayment" ? this.socketInstance.socket.off("startPayment") : e === "healthCheck" ? this.socketInstance.socket.off("healthCheck") : e === "transactionInfo" ? this.socketInstance.socket.off("transactionInfo") : e === "roomJoined" ? this.socketInstance.socket.off("userJoined") : e === "airdropResult" ? this.socketInstance.socket.off("airdropResult") : e === "airdropStart" && this.socketInstance.socket.off("airdropStart");
|
|
@@ -10358,9 +10358,9 @@ const $t = new class {
|
|
|
10358
10358
|
t = `${t}
|
|
10359
10359
|
|
|
10360
10360
|
Nonce: ${r}`, await this.sendMessage(e, t);
|
|
10361
|
-
const { publicKey: n, signature: i, address: s, network: a, nickName: o } = await this.getAccountCrypto(),
|
|
10362
|
-
if (!
|
|
10363
|
-
return await this.checkVerified(e,
|
|
10361
|
+
const { publicKey: n, signature: i, address: s, network: a, nickName: o } = await this.getAccountCrypto(), c = Di.xphereVerify(t, n, i, s, a);
|
|
10362
|
+
if (!c) throw new Error("Verification failed");
|
|
10363
|
+
return await this.checkVerified(e, c), { address: s, network: a, signature: i, publicKey: n, nickName: o, isVerified: c };
|
|
10364
10364
|
} catch (n) {
|
|
10365
10365
|
return Promise.reject(n);
|
|
10366
10366
|
} finally {
|
|
@@ -10392,8 +10392,8 @@ Nonce: ${r}`, await this.sendMessage(e, t);
|
|
|
10392
10392
|
return $t.joinRoom(s), { qrCode: a, roomId: s };
|
|
10393
10393
|
}
|
|
10394
10394
|
generatePaymentQrCode(e, t, r, n, i, s, a) {
|
|
10395
|
-
const o = _e.lib.WordArray.random(16).toString(_e.enc.Hex),
|
|
10396
|
-
return $t.joinRoom(o), { qrCode:
|
|
10395
|
+
const o = _e.lib.WordArray.random(16).toString(_e.enc.Hex), c = `${this.getQrDomain(a)}/qrCode/scan?type=payment&roomId=${o}&dapp=${e}&network=${t}&address=${r}&amount=${n}&description=${i}&info=${s}`;
|
|
10396
|
+
return $t.joinRoom(o), { qrCode: c, roomId: o };
|
|
10397
10397
|
}
|
|
10398
10398
|
generateAirdropQrCode(e, t, r, n) {
|
|
10399
10399
|
const i = _e.lib.WordArray.random(16).toString(_e.enc.Hex), s = `${this.getQrDomain(n)}/qrCode/scan?type=airdrop&roomId=${i}&dapp=${e}&network=${t}&icon=${r}`;
|
|
@@ -10406,8 +10406,8 @@ Nonce: ${r}`, await this.sendMessage(e, t);
|
|
|
10406
10406
|
getQrDomain(e) {
|
|
10407
10407
|
return e || "https://zigap.io";
|
|
10408
10408
|
}
|
|
10409
|
-
}(), Fi = "data:image/svg+xml,%3csvg%20width='167'%20height='166'%20viewBox='0%200%20167%20166'%20fill='none'%20xmlns='http://www.w3.org/2000/svg'%3e%3cpath%20fill-rule='evenodd'%20clip-rule='evenodd'%20d='M116.052%20115.296H166.355H166.36V0H51.0675V50.3042H0.759995V165.6H116.052V115.296ZM90.3366%2065.3428L40.21%20115.296H40.4307L40.2551%20115.471H101.014V150.561H15.7981V65.3428H90.3366ZM76.7327%20100.257H151.317V15.0386H66.1006V50.1536L109.424%2050.3042H126.684L126.624%2050.364L126.669%2050.3642L113.846%2063.1431L76.7327%20100.257Z'%20fill='url(%23paint0_linear_2322_66)'/%3e%3cdefs%3e%3clinearGradient%20id='paint0_linear_2322_66'%20x1='167.74'%20y1='-2.07'%20x2='-3.37985'%20y2='172.5'%20gradientUnits='userSpaceOnUse'%3e%3cstop%20stop-color='%231349F8'/%3e%3cstop%20offset='1'%20stop-color='%235C13F8'/%3e%3c/linearGradient%3e%3c/defs%3e%3c/svg%3e", I3 = ({ availableNetworks: e, dapp: t, url: r, sigMessage: n, onReceive: i, validSeconds: s, isShowLogo: a = !1, logoSize: o = 30, expire:
|
|
10410
|
-
const [A, I] = Ue(!0), [x, M] = Ue(!1), k = Di.generateNonce(16), { qrCode: O, roomId: E } = In.generateLoginQrCode(t, r, e,
|
|
10409
|
+
}(), Fi = "data:image/svg+xml,%3csvg%20width='167'%20height='166'%20viewBox='0%200%20167%20166'%20fill='none'%20xmlns='http://www.w3.org/2000/svg'%3e%3cpath%20fill-rule='evenodd'%20clip-rule='evenodd'%20d='M116.052%20115.296H166.355H166.36V0H51.0675V50.3042H0.759995V165.6H116.052V115.296ZM90.3366%2065.3428L40.21%20115.296H40.4307L40.2551%20115.471H101.014V150.561H15.7981V65.3428H90.3366ZM76.7327%20100.257H151.317V15.0386H66.1006V50.1536L109.424%2050.3042H126.684L126.624%2050.364L126.669%2050.3642L113.846%2063.1431L76.7327%20100.257Z'%20fill='url(%23paint0_linear_2322_66)'/%3e%3cdefs%3e%3clinearGradient%20id='paint0_linear_2322_66'%20x1='167.74'%20y1='-2.07'%20x2='-3.37985'%20y2='172.5'%20gradientUnits='userSpaceOnUse'%3e%3cstop%20stop-color='%231349F8'/%3e%3cstop%20offset='1'%20stop-color='%235C13F8'/%3e%3c/linearGradient%3e%3c/defs%3e%3c/svg%3e", I3 = ({ availableNetworks: e, dapp: t, url: r, sigMessage: n, onReceive: i, validSeconds: s, isShowLogo: a = !1, logoSize: o = 30, expire: c, icon: d, size: h, processingMark: l = { type: "DEFAULT" }, qrDomain: _, ...v }) => {
|
|
10410
|
+
const [A, I] = Ue(!0), [x, M] = Ue(!1), k = Di.generateNonce(16), { qrCode: O, roomId: E } = In.generateLoginQrCode(t, r, e, d, "login", _);
|
|
10411
10411
|
return Ze(() => {
|
|
10412
10412
|
const R = setTimeout(() => {
|
|
10413
10413
|
$t.leaveRoom(E), I(!1);
|
|
@@ -10422,7 +10422,7 @@ Nonce: ${r}`, await this.sendMessage(e, t);
|
|
|
10422
10422
|
i && i({ status: "ACCOUNT" });
|
|
10423
10423
|
const z = `${n}
|
|
10424
10424
|
|
|
10425
|
-
Nonce: ${k}`, f =
|
|
10425
|
+
Nonce: ${k}`, f = (c == null ? void 0 : c.type) ?? "NONE", p = (c == null ? void 0 : c.seconds) ?? 0, g = { publicKey: L.publicKey, message: z }, m = { address: L.address, network: L.network, nickName: L.nickName, token: lf.Validation.createToken(g, L.signature), issuedDateTime: mi().format(yi), isVerified: L.isVerified, expire: f === "NONE" ? { type: f } : { type: f, seconds: p } };
|
|
10426
10426
|
i && i({ status: "SUCCESS", result: m }), M(!1), localStorage.setItem(bi, JSON.stringify(m));
|
|
10427
10427
|
}
|
|
10428
10428
|
} catch {
|
|
@@ -10489,7 +10489,7 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10489
10489
|
$t.leaveRoom(e);
|
|
10490
10490
|
}
|
|
10491
10491
|
}
|
|
10492
|
-
}(), T3 = ({ network: e, dapp: t, address: r, amount: n, description: i, info: s, onReceive: a, validSeconds: o, isShowLogo:
|
|
10492
|
+
}(), T3 = ({ network: e, dapp: t, address: r, amount: n, description: i, info: s, onReceive: a, validSeconds: o, isShowLogo: c = !1, logoSize: d = 30, size: h, processingMark: l = { type: "DEFAULT" }, ..._ }) => {
|
|
10493
10493
|
const [v, A] = Ue(!0), [I, x] = Ue(!1), { qrCode: M, roomId: k } = In.generatePaymentQrCode(t, e, r, n, i, s);
|
|
10494
10494
|
return Ze(() => {
|
|
10495
10495
|
const O = setTimeout(() => {
|
|
@@ -10519,7 +10519,7 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10519
10519
|
case "CUSTOM":
|
|
10520
10520
|
return l.type === "CUSTOM" ? l.component : void 0;
|
|
10521
10521
|
}
|
|
10522
|
-
})(l.type) }) : Dt.jsx(Xn, { value: M, size: h, ...
|
|
10522
|
+
})(l.type) }) : Dt.jsx(Xn, { value: M, size: h, ...c && { imageSettings: { src: Fi, width: d, height: d, excavate: !1 } }, ..._ }) }) : Dt.jsx(Id, { children: Dt.jsx(Td, { children: "QR timeout" }) });
|
|
10523
10523
|
}, Id = Nr.div`
|
|
10524
10524
|
width: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10525
10525
|
height: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
@@ -10549,8 +10549,8 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10549
10549
|
$t.leaveRoom(e);
|
|
10550
10550
|
}
|
|
10551
10551
|
}
|
|
10552
|
-
}(), R3 = ({ availableNetworks: e, dapp: t, url: r, validSeconds: n, onReceive: i, isShowLogo: s = !1, logoSize: a = 30, icon: o, ...
|
|
10553
|
-
const [
|
|
10552
|
+
}(), R3 = ({ availableNetworks: e, dapp: t, url: r, validSeconds: n, onReceive: i, isShowLogo: s = !1, logoSize: a = 30, icon: o, ...c }) => {
|
|
10553
|
+
const [d, h] = Ue(!0), { qrCode: l, roomId: _ } = In.generateProvideQrCode(t, r, e, o);
|
|
10554
10554
|
return Ze(() => {
|
|
10555
10555
|
const v = setTimeout(() => {
|
|
10556
10556
|
$t.leaveRoom(_), h(!1);
|
|
@@ -10566,7 +10566,7 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10566
10566
|
i({ isSuccess: !1 });
|
|
10567
10567
|
}
|
|
10568
10568
|
})();
|
|
10569
|
-
}, []),
|
|
10569
|
+
}, []), d ? Dt.jsx(Xn, { value: l, ...s && { imageSettings: { src: Fi, width: a, height: a, excavate: !1 } }, ...c }) : Dt.jsx("div", { children: "QR loading error" });
|
|
10570
10570
|
}, Rd = new class {
|
|
10571
10571
|
startAirdrop(e) {
|
|
10572
10572
|
return new Promise((t, r) => {
|
|
@@ -10582,7 +10582,7 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10582
10582
|
});
|
|
10583
10583
|
});
|
|
10584
10584
|
}
|
|
10585
|
-
}(), N3 = ({ availableNetworks: e, dapp: t, validSeconds: r, onReceive: n, isShowLogo: i = !1, logoSize: s = 30, icon: a, size: o, processingMark:
|
|
10585
|
+
}(), N3 = ({ availableNetworks: e, dapp: t, validSeconds: r, onReceive: n, isShowLogo: i = !1, logoSize: s = 30, icon: a, size: o, processingMark: c = { type: "DEFAULT" }, ...d }) => {
|
|
10586
10586
|
const [h, l] = Ue(!0), [_, v] = Ue(!1), [A, I] = Ue(""), [x, M] = Ue(""), k = () => {
|
|
10587
10587
|
const { qrCode: O, roomId: E } = In.generateAirdropQrCode(t, e, a);
|
|
10588
10588
|
I(E), M(O), console.log("New QR Code generated:", E);
|
|
@@ -10602,7 +10602,7 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10602
10602
|
console.error("Error during airdrop:", O), n && n({ status: "ERROR", result: { isSuccess: !1 } }), v(!1), $t.leaveRoom(A);
|
|
10603
10603
|
}
|
|
10604
10604
|
})();
|
|
10605
|
-
}, [A, n]), h ? Dt.jsx(Dt.Fragment, { children: _ &&
|
|
10605
|
+
}, [A, n]), h ? Dt.jsx(Dt.Fragment, { children: _ && c.type !== "NONE" ? Dt.jsx(Nd, { $size: o, children: ((O) => {
|
|
10606
10606
|
switch (O) {
|
|
10607
10607
|
case "DEFAULT":
|
|
10608
10608
|
return Dt.jsx(Od, { children: "Processing..." });
|
|
@@ -10610,9 +10610,9 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10610
10610
|
default:
|
|
10611
10611
|
return;
|
|
10612
10612
|
case "CUSTOM":
|
|
10613
|
-
return
|
|
10613
|
+
return c.type === "CUSTOM" ? c.component : void 0;
|
|
10614
10614
|
}
|
|
10615
|
-
})(
|
|
10615
|
+
})(c.type) }) : Dt.jsx(Xn, { value: x, ...i && { imageSettings: { src: "data:image/svg+xml,%3csvg%20width='110'%20height='110'%20viewBox='0%200%20110%20110'%20fill='none'%20xmlns='http://www.w3.org/2000/svg'%3e%3cg%20filter='url(%23filter0_d_5170_26474)'%3e%3crect%20x='4.74805'%20y='0.749023'%20width='100.502'%20height='100.503'%20rx='50.2512'%20fill='white'/%3e%3cpath%20d='M86.1086%2075.5552C85.7918%2068.5729%2077.2789%2058.2176%2072.6322%2053.0774C69.4029%2049.5076%2065.5224%2045.6785%2061.5146%2042.1712C63.5442%2040.7834%2065.4906%2039.6065%2067.2848%2038.6783C70.2965%2041.6043%2072.2712%2045.657%2072.6322%2050.0227C75.3094%2047.0628%2077.8628%2043.9651%2080.1454%2040.7082C82.2352%2037.6821%2084.1958%2034.5344%2085.4079%2031.0432C86.7173%2027.2928%2086.5509%2023.2883%2081.6778%2023.2222C80.0162%2023.2061%2078.3777%2023.5906%2076.794%2024.0771C74.8706%2024.6798%2073.0162%2025.4721%2071.1972%2026.3556C69.2348%2027.3142%2067.3432%2028.3694%2065.457%2029.5123C63.1301%2030.9252%2060.8758%2032.4383%2058.6427%2034.0461C57.4412%2034.9117%2056.2238%2035.8257%2054.9994%2036.7789C53.7731%2035.8257%2052.5575%2034.9117%2051.356%2034.0461C49.1247%2032.4383%2046.8686%2030.9252%2044.5417%2029.5123C42.6572%2028.3694%2040.7639%2027.3142%2038.8015%2026.3556C36.9825%2025.4721%2035.1281%2024.678%2033.2047%2024.0771C31.6245%2023.5906%2029.9842%2023.2079%2028.3227%2023.2222C23.4495%2023.2883%2023.285%2027.2928%2024.5944%2031.0432C25.8083%2034.5344%2027.7671%2037.6803%2029.8568%2040.7082C32.1377%2043.9669%2034.6928%2047.0628%2037.37%2050.0227C37.731%2045.657%2039.7057%2041.6061%2042.7174%2038.6783C44.5117%2039.6065%2046.4581%2040.7834%2048.4877%2042.1712C44.4798%2045.6802%2040.6011%2049.5076%2037.37%2053.0774C33.0224%2057.9332%2028.8783%2063.0662%2025.9215%2068.9038C24.7076%2071.4274%2022.8638%2075.6893%2024.5962%2078.2826C26.6505%2081.0798%2031.6847%2079.5686%2034.415%2078.6189C40.5144%2076.36%2046.0529%2072.8295%2051.3578%2069.0558C47.1146%2068.1634%2043.3756%2065.6899%2040.8683%2062.3114C43.8074%2057.8223%2049.5458%2051.6592%2055.0029%2047.1397C60.4635%2051.6627%2066.1949%2057.8187%2069.1375%2062.3114C66.6301%2065.6881%2062.8912%2068.1634%2058.6463%2069.0558C63.5973%2072.5917%2068.7624%2075.8736%2074.384%2078.1628C78.0999%2079.6956%2086.1882%2082.051%2086.1103%2075.5588L86.1086%2075.5552Z'%20fill='white'/%3e%3cpath%20d='M86.1086%2075.5552C85.7918%2068.5729%2077.2789%2058.2176%2072.6322%2053.0774C69.4029%2049.5076%2065.5224%2045.6785%2061.5146%2042.1712C63.5442%2040.7834%2065.4906%2039.6065%2067.2848%2038.6783C70.2965%2041.6043%2072.2712%2045.657%2072.6322%2050.0227C75.3094%2047.0628%2077.8628%2043.9651%2080.1454%2040.7082C82.2352%2037.6821%2084.1958%2034.5344%2085.4079%2031.0432C86.7173%2027.2928%2086.5509%2023.2883%2081.6778%2023.2222C80.0162%2023.2061%2078.3777%2023.5906%2076.794%2024.0771C74.8706%2024.6798%2073.0162%2025.4721%2071.1972%2026.3556C69.2348%2027.3142%2067.3432%2028.3694%2065.457%2029.5123C63.1301%2030.9252%2060.8758%2032.4383%2058.6427%2034.0461C57.4412%2034.9117%2056.2238%2035.8257%2054.9994%2036.7789C53.7731%2035.8257%2052.5575%2034.9117%2051.356%2034.0461C49.1247%2032.4383%2046.8686%2030.9252%2044.5417%2029.5123C42.6572%2028.3694%2040.7639%2027.3142%2038.8015%2026.3556C36.9825%2025.4721%2035.1281%2024.678%2033.2047%2024.0771C31.6245%2023.5906%2029.9842%2023.2079%2028.3227%2023.2222C23.4495%2023.2883%2023.285%2027.2928%2024.5944%2031.0432C25.8083%2034.5344%2027.7671%2037.6803%2029.8568%2040.7082C32.1377%2043.9669%2034.6928%2047.0628%2037.37%2050.0227C37.731%2045.657%2039.7057%2041.6061%2042.7174%2038.6783C44.5117%2039.6065%2046.4581%2040.7834%2048.4877%2042.1712C44.4798%2045.6802%2040.6011%2049.5076%2037.37%2053.0774C33.0224%2057.9332%2028.8783%2063.0662%2025.9215%2068.9038C24.7076%2071.4274%2022.8638%2075.6893%2024.5962%2078.2826C26.6505%2081.0798%2031.6847%2079.5686%2034.415%2078.6189C40.5144%2076.36%2046.0529%2072.8295%2051.3578%2069.0558C47.1146%2068.1634%2043.3756%2065.6899%2040.8683%2062.3114C43.8074%2057.8223%2049.5458%2051.6592%2055.0029%2047.1397C60.4635%2051.6627%2066.1949%2057.8187%2069.1375%2062.3114C66.6301%2065.6881%2062.8912%2068.1634%2058.6463%2069.0558C63.5973%2072.5917%2068.7624%2075.8736%2074.384%2078.1628C78.0999%2079.6956%2086.1882%2082.051%2086.1103%2075.5588L86.1086%2075.5552Z'%20fill='url(%23paint0_linear_5170_26474)'/%3e%3c/g%3e%3cdefs%3e%3cfilter%20id='filter0_d_5170_26474'%20x='0.727947'%20y='0.749023'%20width='108.542'%20height='108.543'%20filterUnits='userSpaceOnUse'%20color-interpolation-filters='sRGB'%3e%3cfeFlood%20flood-opacity='0'%20result='BackgroundImageFix'/%3e%3cfeColorMatrix%20in='SourceAlpha'%20type='matrix'%20values='0%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%20127%200'%20result='hardAlpha'/%3e%3cfeOffset%20dy='4.0201'/%3e%3cfeGaussianBlur%20stdDeviation='2.01005'/%3e%3cfeComposite%20in2='hardAlpha'%20operator='out'/%3e%3cfeColorMatrix%20type='matrix'%20values='0%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200%200.25%200'/%3e%3cfeBlend%20mode='normal'%20in2='BackgroundImageFix'%20result='effect1_dropShadow_5170_26474'/%3e%3cfeBlend%20mode='normal'%20in='SourceGraphic'%20in2='effect1_dropShadow_5170_26474'%20result='shape'/%3e%3c/filter%3e%3clinearGradient%20id='paint0_linear_5170_26474'%20x1='54.9998'%20y1='23.2217'%20x2='54.9998'%20y2='79.8883'%20gradientUnits='userSpaceOnUse'%3e%3cstop%20stop-color='%23AD001F'/%3e%3cstop%20offset='1'%20stop-color='%23BB0022'/%3e%3c/linearGradient%3e%3c/defs%3e%3c/svg%3e", width: s, height: s, excavate: !1 } }, ...d }) }) : Dt.jsx(Nd, { children: Dt.jsx(Od, { children: "QR timeout" }) });
|
|
10616
10616
|
}, Nd = Nr.div`
|
|
10617
10617
|
width: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10618
10618
|
height: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
@@ -10660,8 +10660,8 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10660
10660
|
$t.leaveRoom(e);
|
|
10661
10661
|
}
|
|
10662
10662
|
}
|
|
10663
|
-
}(), O3 = ({ availableNetworks: e, dapp: t, url: r, onReceive: n, validSeconds: i, isShowLogo: s = !1, logoSize: a = 30, size: o, icon:
|
|
10664
|
-
const [v, A] = Ue(!0), [I, x] = Ue(!1), { qrCode: M, roomId: k } = In.generateSendTransactionQrCode(t, e, r,
|
|
10663
|
+
}(), O3 = ({ availableNetworks: e, dapp: t, url: r, onReceive: n, validSeconds: i, isShowLogo: s = !1, logoSize: a = 30, size: o, icon: c, transaction: d, processingMark: h = { type: "DEFAULT" }, qrDomain: l, ..._ }) => {
|
|
10664
|
+
const [v, A] = Ue(!0), [I, x] = Ue(!1), { qrCode: M, roomId: k } = In.generateSendTransactionQrCode(t, e, r, c, l);
|
|
10665
10665
|
return Ze(() => {
|
|
10666
10666
|
const O = setTimeout(() => {
|
|
10667
10667
|
$t.leaveRoom(k), A(!1);
|
|
@@ -10672,7 +10672,7 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10672
10672
|
try {
|
|
10673
10673
|
const O = await Cd.receiveRequest(k);
|
|
10674
10674
|
if (x(!0), n && n({ status: "REQUEST" }), O.isSuccess) {
|
|
10675
|
-
const E = await Cd.qrSendTransaction(k,
|
|
10675
|
+
const E = await Cd.qrSendTransaction(k, d), R = { txHash: E.txHash, status: E.status, error: E.error };
|
|
10676
10676
|
n && n({ status: "SUCCESS", result: R }), x(!1);
|
|
10677
10677
|
}
|
|
10678
10678
|
} catch {
|
|
@@ -10699,8 +10699,8 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10699
10699
|
`, Pd = Nr.div`
|
|
10700
10700
|
font-size: 12px;
|
|
10701
10701
|
color: #7a7a7a;
|
|
10702
|
-
`, C3 = ({ availableNetworks: e, dapp: t, url: r, sigMessage: n, onReceive: i, validSeconds: s, isShowLogo: a = !1, logoSize: o = 30, expire:
|
|
10703
|
-
const [A, I] = Ue(!0), [x, M] = Ue(!1), k = Di.generateNonce(16), { qrCode: O, roomId: E } = In.generateLoginQrCode(t, r, e,
|
|
10702
|
+
`, C3 = ({ availableNetworks: e, dapp: t, url: r, sigMessage: n, onReceive: i, validSeconds: s, isShowLogo: a = !1, logoSize: o = 30, expire: c, icon: d, size: h, processingMark: l = { type: "DEFAULT" }, qrDomain: _, ...v }) => {
|
|
10703
|
+
const [A, I] = Ue(!0), [x, M] = Ue(!1), k = Di.generateNonce(16), { qrCode: O, roomId: E } = In.generateLoginQrCode(t, r, e, d, "signature", _);
|
|
10704
10704
|
return Ze(() => {
|
|
10705
10705
|
const R = setTimeout(() => {
|
|
10706
10706
|
$t.leaveRoom(E), I(!1);
|
|
@@ -10715,7 +10715,7 @@ Nonce: ${k}`, f = d.type, p = d.seconds, g = { publicKey: L.publicKey, message:
|
|
|
10715
10715
|
i && i({ status: "ACCOUNT" });
|
|
10716
10716
|
const z = `${n}
|
|
10717
10717
|
|
|
10718
|
-
Nonce: ${k}`, f =
|
|
10718
|
+
Nonce: ${k}`, f = (c == null ? void 0 : c.type) ?? "NONE", p = (c == null ? void 0 : c.seconds) ?? 0, g = { publicKey: L.publicKey, message: z }, m = { address: L.address, network: L.network, nickName: L.nickName, token: lf.Validation.createToken(g, L.signature), issuedDateTime: mi().format(yi), isVerified: L.isVerified, expire: f === "NONE" ? { type: f } : { type: f, seconds: p } };
|
|
10719
10719
|
i && i({ status: "SUCCESS", result: m }), M(!1), localStorage.setItem(bi, JSON.stringify(m));
|
|
10720
10720
|
}
|
|
10721
10721
|
} catch {
|