zigap-utils 3.0.4 → 3.0.5
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.es.js +774 -774
- package/package.json +1 -1
package/dist/index.es.js
CHANGED
|
@@ -8,7 +8,7 @@ var Dr = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : t
|
|
|
8
8
|
function qi(e) {
|
|
9
9
|
return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
|
|
10
10
|
}
|
|
11
|
-
function
|
|
11
|
+
function $d(e) {
|
|
12
12
|
if (e.__esModule) return e;
|
|
13
13
|
var t = e.default;
|
|
14
14
|
if (typeof t == "function") {
|
|
@@ -25,7 +25,7 @@ function Ud(e) {
|
|
|
25
25
|
}), r;
|
|
26
26
|
}
|
|
27
27
|
var Da, go = { exports: {} }, si = {}, Ki = {};
|
|
28
|
-
const Mf =
|
|
28
|
+
const Mf = $d(kf);
|
|
29
29
|
/**
|
|
30
30
|
* @license React
|
|
31
31
|
* react-jsx-runtime.development.js
|
|
@@ -61,7 +61,7 @@ process.env.NODE_ENV === "production" ? go.exports = function() {
|
|
|
61
61
|
return "StrictMode";
|
|
62
62
|
case S:
|
|
63
63
|
return "Suspense";
|
|
64
|
-
case
|
|
64
|
+
case O:
|
|
65
65
|
return "SuspenseList";
|
|
66
66
|
case L:
|
|
67
67
|
return "Activity";
|
|
@@ -98,8 +98,8 @@ process.env.NODE_ENV === "production" ? go.exports = function() {
|
|
|
98
98
|
j = !0;
|
|
99
99
|
}
|
|
100
100
|
if (j) {
|
|
101
|
-
var Z = (j = console).error,
|
|
102
|
-
return Z.call(j, "The provided key is an unsupported type %s. This value must be coerced to a string before using it here.",
|
|
101
|
+
var Z = (j = console).error, U = typeof Symbol == "function" && Symbol.toStringTag && R[Symbol.toStringTag] || R.constructor.name || "Object";
|
|
102
|
+
return Z.call(j, "The provided key is an unsupported type %s. This value must be coerced to a string before using it here.", U), t(R);
|
|
103
103
|
}
|
|
104
104
|
}
|
|
105
105
|
function n(R) {
|
|
@@ -119,10 +119,10 @@ process.env.NODE_ENV === "production" ? go.exports = function() {
|
|
|
119
119
|
var R = e(this.type);
|
|
120
120
|
return u[R] || (u[R] = !0, console.error("Accessing element.ref was removed in React 19. ref is now a regular prop. It will be removed from the JSX Element type in a future release.")), (R = this.props.ref) !== void 0 ? R : null;
|
|
121
121
|
}
|
|
122
|
-
function a(R, j, Z,
|
|
122
|
+
function a(R, j, Z, U, V, F, H, J) {
|
|
123
123
|
var Rt, dt = j.children;
|
|
124
|
-
if (dt !== void 0) if (
|
|
125
|
-
for (
|
|
124
|
+
if (dt !== void 0) if (U) if (g(dt)) {
|
|
125
|
+
for (U = 0; U < dt.length; U++) o(dt[U]);
|
|
126
126
|
Object.freeze && Object.freeze(dt);
|
|
127
127
|
} else console.error("React.jsx: Static children should always be an array. You are likely explicitly calling React.jsxs or React.jsxDEV. Use the Babel transform instead.");
|
|
128
128
|
else o(dt);
|
|
@@ -131,12 +131,12 @@ process.env.NODE_ENV === "production" ? go.exports = function() {
|
|
|
131
131
|
var yt = Object.keys(j).filter(function(mt) {
|
|
132
132
|
return mt !== "key";
|
|
133
133
|
});
|
|
134
|
-
|
|
134
|
+
U = 0 < yt.length ? "{key: someKey, " + yt.join(": ..., ") + ": ...}" : "{key: someKey}", P[dt + U] || (yt = 0 < yt.length ? "{" + yt.join(": ..., ") + ": ...}" : "{}", console.error(`A props object containing a "key" prop is being spread into JSX:
|
|
135
135
|
let props = %s;
|
|
136
136
|
<%s {...props} />
|
|
137
137
|
React keys must be passed directly to JSX without using spread:
|
|
138
138
|
let props = %s;
|
|
139
|
-
<%s key={someKey} {...props} />`,
|
|
139
|
+
<%s key={someKey} {...props} />`, U, dt, yt, dt), P[dt + U] = !0);
|
|
140
140
|
}
|
|
141
141
|
if (dt = null, Z !== void 0 && (r(Z), dt = "" + Z), function(mt) {
|
|
142
142
|
if (l.call(mt, "key")) {
|
|
@@ -158,15 +158,15 @@ React keys must be passed directly to JSX without using spread:
|
|
|
158
158
|
function o(R) {
|
|
159
159
|
typeof R == "object" && R !== null && R.$$typeof === h && R._store && (R._store.validated = 1);
|
|
160
160
|
}
|
|
161
|
-
var c, d = Mf, h = Symbol.for("react.transitional.element"), p = Symbol.for("react.portal"), w = Symbol.for("react.fragment"), v = Symbol.for("react.strict_mode"), A = Symbol.for("react.profiler"), I = Symbol.for("react.consumer"), _ = Symbol.for("react.context"), M = Symbol.for("react.forward_ref"), S = Symbol.for("react.suspense"),
|
|
161
|
+
var c, d = Mf, h = Symbol.for("react.transitional.element"), p = Symbol.for("react.portal"), w = Symbol.for("react.fragment"), v = Symbol.for("react.strict_mode"), A = Symbol.for("react.profiler"), I = Symbol.for("react.consumer"), _ = Symbol.for("react.context"), M = Symbol.for("react.forward_ref"), S = Symbol.for("react.suspense"), O = Symbol.for("react.suspense_list"), k = Symbol.for("react.memo"), N = 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, l = Object.prototype.hasOwnProperty, g = Array.isArray, m = console.createTask ? console.createTask : function() {
|
|
162
162
|
return null;
|
|
163
163
|
}, u = {}, y = (d = { "react-stack-bottom-frame": function(R) {
|
|
164
164
|
return R();
|
|
165
165
|
} })["react-stack-bottom-frame"].bind(d, i)(), x = m(n(i)), P = {};
|
|
166
|
-
Ki.Fragment = w, Ki.jsx = function(R, j, Z,
|
|
166
|
+
Ki.Fragment = w, Ki.jsx = function(R, j, Z, U, V) {
|
|
167
167
|
var F = 1e4 > f.recentlyCreatedOwnerStacks++;
|
|
168
168
|
return a(R, j, Z, !1, 0, V, F ? Error("react-stack-top-frame") : y, F ? m(n(R)) : x);
|
|
169
|
-
}, Ki.jsxs = function(R, j, Z,
|
|
169
|
+
}, Ki.jsxs = function(R, j, Z, U, V) {
|
|
170
170
|
var F = 1e4 > f.recentlyCreatedOwnerStacks++;
|
|
171
171
|
return a(R, j, Z, !0, 0, V, F ? Error("react-stack-top-frame") : y, F ? m(n(R)) : x);
|
|
172
172
|
};
|
|
@@ -192,23 +192,23 @@ Hd.exports = function() {
|
|
|
192
192
|
return { M: d, y: p, w: c, d: o, D: w, 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
|
-
} },
|
|
196
|
-
k[
|
|
195
|
+
} }, O = "en", k = {};
|
|
196
|
+
k[O] = _;
|
|
197
197
|
var N = "$isDayjsObject", L = function(u) {
|
|
198
198
|
return u instanceof g || !(!u || !u[N]);
|
|
199
199
|
}, z = function u(y, x, P) {
|
|
200
200
|
var R;
|
|
201
|
-
if (!y) return
|
|
201
|
+
if (!y) return O;
|
|
202
202
|
if (typeof y == "string") {
|
|
203
203
|
var j = y.toLowerCase();
|
|
204
204
|
k[j] && (R = j), x && (k[j] = x, R = j);
|
|
205
205
|
var Z = y.split("-");
|
|
206
206
|
if (!R && Z.length > 1) return u(Z[0]);
|
|
207
207
|
} else {
|
|
208
|
-
var
|
|
209
|
-
k[
|
|
208
|
+
var U = y.name;
|
|
209
|
+
k[U] = y, R = U;
|
|
210
210
|
}
|
|
211
|
-
return !P && R && (
|
|
211
|
+
return !P && R && (O = R), R || !P && O;
|
|
212
212
|
}, f = function(u, y) {
|
|
213
213
|
if (L(u)) return u.clone();
|
|
214
214
|
var x = typeof y == "object" ? y : {};
|
|
@@ -231,8 +231,8 @@ Hd.exports = function() {
|
|
|
231
231
|
if (typeof R == "string" && !/Z$/i.test(R)) {
|
|
232
232
|
var Z = R.match(A);
|
|
233
233
|
if (Z) {
|
|
234
|
-
var
|
|
235
|
-
return j ? new Date(Date.UTC(Z[1],
|
|
234
|
+
var U = Z[2] - 1 || 0, V = (Z[7] || "0").substring(0, 3);
|
|
235
|
+
return j ? new Date(Date.UTC(Z[1], U, Z[3] || 1, Z[4] || 0, Z[5] || 0, Z[6] || 0, V)) : new Date(Z[1], U, Z[3] || 1, Z[4] || 0, Z[5] || 0, Z[6] || 0, V);
|
|
236
236
|
}
|
|
237
237
|
}
|
|
238
238
|
return new Date(R);
|
|
@@ -258,7 +258,7 @@ Hd.exports = function() {
|
|
|
258
258
|
}, y.valueOf = function() {
|
|
259
259
|
return this.$d.getTime();
|
|
260
260
|
}, y.startOf = function(x, P) {
|
|
261
|
-
var R = this, j = !!l.u(P) || P, Z = l.p(x),
|
|
261
|
+
var R = this, j = !!l.u(P) || P, Z = l.p(x), U = function(Ft, mt) {
|
|
262
262
|
var Et = l.w(R.$u ? Date.UTC(R.$y, mt, Ft) : new Date(R.$y, mt, Ft), R);
|
|
263
263
|
return j ? Et : Et.endOf(o);
|
|
264
264
|
}, V = function(Ft, mt) {
|
|
@@ -266,12 +266,12 @@ Hd.exports = function() {
|
|
|
266
266
|
}, F = this.$W, H = this.$M, J = this.$D, Rt = "set" + (this.$u ? "UTC" : "");
|
|
267
267
|
switch (Z) {
|
|
268
268
|
case p:
|
|
269
|
-
return j ?
|
|
269
|
+
return j ? U(1, 0) : U(31, 11);
|
|
270
270
|
case d:
|
|
271
|
-
return j ?
|
|
271
|
+
return j ? U(1, H) : U(0, H + 1);
|
|
272
272
|
case c:
|
|
273
273
|
var dt = this.$locale().weekStart || 0, yt = (F < dt ? F + 7 : F) - dt;
|
|
274
|
-
return
|
|
274
|
+
return U(j ? J - yt : J + (6 - yt), H);
|
|
275
275
|
case o:
|
|
276
276
|
case w:
|
|
277
277
|
return V(Rt + "Hours", 0);
|
|
@@ -287,11 +287,11 @@ Hd.exports = function() {
|
|
|
287
287
|
}, y.endOf = function(x) {
|
|
288
288
|
return this.startOf(x, !1);
|
|
289
289
|
}, y.$set = function(x, P) {
|
|
290
|
-
var R, j = l.p(x), Z = "set" + (this.$u ? "UTC" : ""),
|
|
290
|
+
var R, j = l.p(x), Z = "set" + (this.$u ? "UTC" : ""), U = (R = {}, R[o] = Z + "Date", R[w] = Z + "Date", R[d] = Z + "Month", R[p] = Z + "FullYear", R[a] = Z + "Hours", R[s] = Z + "Minutes", R[i] = Z + "Seconds", R[n] = Z + "Milliseconds", R)[j], V = j === o ? this.$D + (P - this.$W) : P;
|
|
291
291
|
if (j === d || j === p) {
|
|
292
292
|
var F = this.clone().set(w, 1);
|
|
293
|
-
F.$d[
|
|
294
|
-
} else
|
|
293
|
+
F.$d[U](V), F.init(), this.$d = F.set(w, Math.min(this.$D, F.daysInMonth())).$d;
|
|
294
|
+
} else U && this.$d[U](V);
|
|
295
295
|
return this.init(), this;
|
|
296
296
|
}, y.set = function(x, P) {
|
|
297
297
|
return this.clone().$set(x, P);
|
|
@@ -300,14 +300,14 @@ Hd.exports = function() {
|
|
|
300
300
|
}, y.add = function(x, P) {
|
|
301
301
|
var R, j = this;
|
|
302
302
|
x = Number(x);
|
|
303
|
-
var Z = l.p(P),
|
|
303
|
+
var Z = l.p(P), U = function(H) {
|
|
304
304
|
var J = f(j);
|
|
305
305
|
return l.w(J.date(J.date() + Math.round(H * x)), j);
|
|
306
306
|
};
|
|
307
307
|
if (Z === d) return this.set(d, this.$M + x);
|
|
308
308
|
if (Z === p) return this.set(p, this.$y + x);
|
|
309
|
-
if (Z === o) return
|
|
310
|
-
if (Z === c) return
|
|
309
|
+
if (Z === o) return U(1);
|
|
310
|
+
if (Z === c) return U(7);
|
|
311
311
|
var V = (R = {}, R[s] = t, R[a] = r, R[i] = e, R)[Z] || 1, F = this.$d.getTime() + x * V;
|
|
312
312
|
return l.w(F, this);
|
|
313
313
|
}, y.subtract = function(x, P) {
|
|
@@ -315,10 +315,10 @@ Hd.exports = function() {
|
|
|
315
315
|
}, y.format = function(x) {
|
|
316
316
|
var P = this, R = this.$locale();
|
|
317
317
|
if (!this.isValid()) return R.invalidDate || v;
|
|
318
|
-
var j = x || "YYYY-MM-DDTHH:mm:ssZ", Z = l.z(this),
|
|
318
|
+
var j = x || "YYYY-MM-DDTHH:mm:ssZ", Z = l.z(this), U = this.$H, V = this.$m, F = this.$M, H = R.weekdays, J = R.months, Rt = R.meridiem, dt = function(mt, Et, Zt, Lt) {
|
|
319
319
|
return mt && (mt[Et] || mt(P, j)) || Zt[Et].slice(0, Lt);
|
|
320
320
|
}, yt = function(mt) {
|
|
321
|
-
return l.s(
|
|
321
|
+
return l.s(U % 12 || 12, mt, "0");
|
|
322
322
|
}, Ft = Rt || function(mt, Et, Zt) {
|
|
323
323
|
var Lt = mt < 12 ? "AM" : "PM";
|
|
324
324
|
return Zt ? Lt.toLowerCase() : Lt;
|
|
@@ -351,17 +351,17 @@ Hd.exports = function() {
|
|
|
351
351
|
case "dddd":
|
|
352
352
|
return H[P.$W];
|
|
353
353
|
case "H":
|
|
354
|
-
return String(
|
|
354
|
+
return String(U);
|
|
355
355
|
case "HH":
|
|
356
|
-
return l.s(
|
|
356
|
+
return l.s(U, 2, "0");
|
|
357
357
|
case "h":
|
|
358
358
|
return yt(1);
|
|
359
359
|
case "hh":
|
|
360
360
|
return yt(2);
|
|
361
361
|
case "a":
|
|
362
|
-
return Ft(
|
|
362
|
+
return Ft(U, V, !0);
|
|
363
363
|
case "A":
|
|
364
|
-
return Ft(
|
|
364
|
+
return Ft(U, V, !1);
|
|
365
365
|
case "m":
|
|
366
366
|
return String(V);
|
|
367
367
|
case "mm":
|
|
@@ -381,10 +381,10 @@ Hd.exports = function() {
|
|
|
381
381
|
}, y.utcOffset = function() {
|
|
382
382
|
return 15 * -Math.round(this.$d.getTimezoneOffset() / 15);
|
|
383
383
|
}, y.diff = function(x, P, R) {
|
|
384
|
-
var j, Z = this,
|
|
384
|
+
var j, Z = this, U = l.p(P), V = f(x), F = (V.utcOffset() - this.utcOffset()) * t, H = this - V, J = function() {
|
|
385
385
|
return l.m(Z, V);
|
|
386
386
|
};
|
|
387
|
-
switch (
|
|
387
|
+
switch (U) {
|
|
388
388
|
case p:
|
|
389
389
|
j = J() / 12;
|
|
390
390
|
break;
|
|
@@ -441,7 +441,7 @@ Hd.exports = function() {
|
|
|
441
441
|
return u.$i || (u(y, g, f), u.$i = !0), f;
|
|
442
442
|
}, f.locale = z, f.isDayjs = L, f.unix = function(u) {
|
|
443
443
|
return f(1e3 * u);
|
|
444
|
-
}, f.en = k[
|
|
444
|
+
}, f.en = k[O], f.Ls = k, f.p = {}, f;
|
|
445
445
|
}();
|
|
446
446
|
const bi = qi(Hd.exports);
|
|
447
447
|
var hn, Za, If = Object.defineProperty, hs = Object.getOwnPropertySymbols, Dd = Object.prototype.hasOwnProperty, Fd = Object.prototype.propertyIsEnumerable, Va = (e, t, r) => t in e ? If(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r, vo = (e, t) => {
|
|
@@ -487,26 +487,26 @@ var hn, Za, If = Object.defineProperty, hs = Object.getOwnPropertySymbols, Dd =
|
|
|
487
487
|
if (!(Ht.MIN_VERSION <= h && h <= p && p <= Ht.MAX_VERSION) || w < -1 || w > 7) throw new RangeError("Invalid value");
|
|
488
488
|
let A, I;
|
|
489
489
|
for (A = h; ; A++) {
|
|
490
|
-
const
|
|
491
|
-
if (k <=
|
|
490
|
+
const O = 8 * Ht.getNumDataCodewords(A, d), k = a.getTotalBits(c, A);
|
|
491
|
+
if (k <= O) {
|
|
492
492
|
I = k;
|
|
493
493
|
break;
|
|
494
494
|
}
|
|
495
495
|
if (A >= p) throw new RangeError("Data too long");
|
|
496
496
|
}
|
|
497
|
-
for (const
|
|
497
|
+
for (const O of [Ht.Ecc.MEDIUM, Ht.Ecc.QUARTILE, Ht.Ecc.HIGH]) v && I <= 8 * Ht.getNumDataCodewords(A, O) && (d = O);
|
|
498
498
|
let _ = [];
|
|
499
|
-
for (const
|
|
500
|
-
r(
|
|
501
|
-
for (const k of
|
|
499
|
+
for (const O of c) {
|
|
500
|
+
r(O.mode.modeBits, 4, _), r(O.numChars, O.mode.numCharCountBits(A), _);
|
|
501
|
+
for (const k of O.getData()) _.push(k);
|
|
502
502
|
}
|
|
503
503
|
i(_.length == I);
|
|
504
504
|
const M = 8 * Ht.getNumDataCodewords(A, d);
|
|
505
505
|
i(_.length <= M), r(0, Math.min(4, M - _.length), _), r(0, (8 - _.length % 8) % 8, _), i(_.length % 8 == 0);
|
|
506
|
-
for (let
|
|
506
|
+
for (let O = 236; _.length < M; O ^= 253) r(O, 8, _);
|
|
507
507
|
let S = [];
|
|
508
508
|
for (; 8 * S.length < _.length; ) S.push(0);
|
|
509
|
-
return _.forEach((
|
|
509
|
+
return _.forEach((O, k) => S[k >>> 3] |= O << 7 - (7 & k)), new Ht(A, d, S, w);
|
|
510
510
|
}
|
|
511
511
|
getModule(c, d) {
|
|
512
512
|
return 0 <= c && c < this.size && 0 <= d && d < this.size && this.modules[d][c];
|
|
@@ -563,15 +563,15 @@ var hn, Za, If = Object.defineProperty, hs = Object.getOwnPropertySymbols, Dd =
|
|
|
563
563
|
const p = Ht.NUM_ERROR_CORRECTION_BLOCKS[h.ordinal][d], w = Ht.ECC_CODEWORDS_PER_BLOCK[h.ordinal][d], v = Math.floor(Ht.getNumRawDataModules(d) / 8), A = p - v % p, I = Math.floor(v / p);
|
|
564
564
|
let _ = [];
|
|
565
565
|
const M = Ht.reedSolomonComputeDivisor(w);
|
|
566
|
-
for (let
|
|
567
|
-
let N = c.slice(k, k + I - w + (
|
|
566
|
+
for (let O = 0, k = 0; O < p; O++) {
|
|
567
|
+
let N = c.slice(k, k + I - w + (O < A ? 0 : 1));
|
|
568
568
|
k += N.length;
|
|
569
569
|
const L = Ht.reedSolomonComputeRemainder(N, M);
|
|
570
|
-
|
|
570
|
+
O < A && N.push(0), _.push(N.concat(L));
|
|
571
571
|
}
|
|
572
572
|
let S = [];
|
|
573
|
-
for (let
|
|
574
|
-
(
|
|
573
|
+
for (let O = 0; O < _[0].length; O++) _.forEach((k, N) => {
|
|
574
|
+
(O != I - w || N >= A) && S.push(k[O]);
|
|
575
575
|
});
|
|
576
576
|
return i(S.length == v), S;
|
|
577
577
|
}
|
|
@@ -836,9 +836,9 @@ function Xd({ value: e, level: t, minVersion: r, includeMargin: n, marginSize: i
|
|
|
836
836
|
let v = c.getModules();
|
|
837
837
|
const A = function(M, S) {
|
|
838
838
|
return S != null ? Math.max(Math.floor(S), 0) : M ? 4 : 0;
|
|
839
|
-
}(n, i), I = v.length + 2 * A, _ = function(M, S,
|
|
839
|
+
}(n, i), I = v.length + 2 * A, _ = function(M, S, O, k) {
|
|
840
840
|
if (k == null) return null;
|
|
841
|
-
const N = M.length + 2 *
|
|
841
|
+
const N = M.length + 2 * O, L = Math.floor(0.1 * S), z = N / S, f = (k.width || L) * z, l = (k.height || L) * z, g = k.x == null ? M.length / 2 - f / 2 : k.x * z, m = k.y == null ? M.length / 2 - l / 2 : k.y * z, u = k.opacity == null ? 1 : k.opacity;
|
|
842
842
|
let y = null;
|
|
843
843
|
if (k.excavate) {
|
|
844
844
|
let x = Math.floor(g), P = Math.floor(m);
|
|
@@ -858,7 +858,7 @@ var Rf = function() {
|
|
|
858
858
|
}
|
|
859
859
|
return !0;
|
|
860
860
|
}(), In = Me.forwardRef(function(e, t) {
|
|
861
|
-
const r = e, { value: n, size: i = Zd, level: s = Vd, bgColor: a = Kd, fgColor: o = Wd, includeMargin: c = Yd, minVersion: d = Qd, boostLevel: h, marginSize: p, imageSettings: w } = r, v = wo(r, ["value", "size", "level", "bgColor", "fgColor", "includeMargin", "minVersion", "boostLevel", "marginSize", "imageSettings"]), { style: A } = v, I = wo(v, ["style"]), _ = w == null ? void 0 : w.src, M = Me.useRef(null), S = Me.useRef(null),
|
|
861
|
+
const r = e, { value: n, size: i = Zd, level: s = Vd, bgColor: a = Kd, fgColor: o = Wd, includeMargin: c = Yd, minVersion: d = Qd, boostLevel: h, marginSize: p, imageSettings: w } = r, v = wo(r, ["value", "size", "level", "bgColor", "fgColor", "includeMargin", "minVersion", "boostLevel", "marginSize", "imageSettings"]), { style: A } = v, I = wo(v, ["style"]), _ = w == null ? void 0 : w.src, M = Me.useRef(null), S = Me.useRef(null), O = Me.useCallback((u) => {
|
|
862
862
|
M.current = u, typeof t == "function" ? t(u) : t && (t.current = u);
|
|
863
863
|
}, [t]), [k, N] = Me.useState(!1), { margin: L, cells: z, numCells: f, calculatedImageSettings: l } = Xd({ value: n, level: s, minVersion: d, boostLevel: h, includeMargin: c, marginSize: p, imageSettings: w, size: i });
|
|
864
864
|
Me.useEffect(() => {
|
|
@@ -871,8 +871,8 @@ var Rf = function() {
|
|
|
871
871
|
const j = window.devicePixelRatio || 1;
|
|
872
872
|
u.height = u.width = i * j;
|
|
873
873
|
const Z = i / f * j;
|
|
874
|
-
y.scale(Z, Z), y.fillStyle = a, y.fillRect(0, 0, f, f), y.fillStyle = o, Rf ? y.fill(new Path2D(Gd(x, L))) : z.forEach(function(
|
|
875
|
-
|
|
874
|
+
y.scale(Z, Z), y.fillStyle = a, y.fillRect(0, 0, f, f), y.fillStyle = o, Rf ? y.fill(new Path2D(Gd(x, L))) : z.forEach(function(U, V) {
|
|
875
|
+
U.forEach(function(F, H) {
|
|
876
876
|
F && y.fillRect(H + L, V + L, 1, 1);
|
|
877
877
|
});
|
|
878
878
|
}), l && (y.globalAlpha = l.opacity), R && y.drawImage(P, l.x + L, l.y + L, l.w, l.h);
|
|
@@ -884,14 +884,14 @@ var Rf = function() {
|
|
|
884
884
|
let m = null;
|
|
885
885
|
return _ != null && (m = Me.createElement("img", { src: _, key: _, style: { display: "none" }, onLoad: () => {
|
|
886
886
|
N(!0);
|
|
887
|
-
}, ref: S, crossOrigin: l == null ? void 0 : l.crossOrigin })), Me.createElement(Me.Fragment, null, Me.createElement("canvas", vo({ style: g, height: i, width: i, ref:
|
|
887
|
+
}, ref: S, crossOrigin: l == null ? void 0 : l.crossOrigin })), Me.createElement(Me.Fragment, null, Me.createElement("canvas", vo({ style: g, height: i, width: i, ref: O, role: "img" }, I)), m);
|
|
888
888
|
});
|
|
889
889
|
In.displayName = "QRCodeCanvas";
|
|
890
890
|
var Nf = Me.forwardRef(function(e, t) {
|
|
891
891
|
const r = e, { value: n, size: i = Zd, level: s = Vd, bgColor: a = Kd, fgColor: o = Wd, includeMargin: c = Yd, minVersion: d = Qd, boostLevel: h, title: p, marginSize: w, imageSettings: v } = r, A = wo(r, ["value", "size", "level", "bgColor", "fgColor", "includeMargin", "minVersion", "boostLevel", "title", "marginSize", "imageSettings"]), { margin: I, cells: _, numCells: M, calculatedImageSettings: S } = Xd({ value: n, level: s, minVersion: d, boostLevel: h, includeMargin: c, marginSize: w, imageSettings: v, size: i });
|
|
892
|
-
let
|
|
893
|
-
v != null && S != null && (S.excavation != null && (
|
|
894
|
-
const N = Gd(
|
|
892
|
+
let O = _, k = null;
|
|
893
|
+
v != null && S != null && (S.excavation != null && (O = Jd(_, S.excavation)), k = Me.createElement("image", { href: v.src, height: S.h, width: S.w, x: S.x + I, y: S.y + I, preserveAspectRatio: "none", opacity: S.opacity, crossOrigin: S.crossOrigin }));
|
|
894
|
+
const N = Gd(O, I);
|
|
895
895
|
return Me.createElement("svg", vo({ height: i, width: i, viewBox: `0 0 ${M} ${M}`, ref: t, role: "img" }, A), !!p && Me.createElement("title", null, p), Me.createElement("path", { fill: a, d: `M0,0 h${M}v${M}H0z`, shapeRendering: "crispEdges" }), Me.createElement("path", { fill: o, d: N, shapeRendering: "crispEdges" }), k);
|
|
896
896
|
});
|
|
897
897
|
Nf.displayName = "QRCodeSVG";
|
|
@@ -920,7 +920,7 @@ function e1(e) {
|
|
|
920
920
|
throw new Error('Could not dynamically require "' + e + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
|
|
921
921
|
}
|
|
922
922
|
var Ka = { exports: {} };
|
|
923
|
-
const Rs =
|
|
923
|
+
const Rs = $d(Object.freeze(Object.defineProperty({ __proto__: null, default: {} }, Symbol.toStringTag, { value: "Module" })));
|
|
924
924
|
var Wa;
|
|
925
925
|
function Gt() {
|
|
926
926
|
return Wa || (Wa = 1, Ka.exports = function() {
|
|
@@ -968,12 +968,12 @@ function Gt() {
|
|
|
968
968
|
}, toString: function(_) {
|
|
969
969
|
return (_ || p).stringify(this);
|
|
970
970
|
}, concat: function(_) {
|
|
971
|
-
var M = this.words, S = _.words,
|
|
972
|
-
if (this.clamp(),
|
|
971
|
+
var M = this.words, S = _.words, O = this.sigBytes, k = _.sigBytes;
|
|
972
|
+
if (this.clamp(), O % 4) for (var N = 0; N < k; N++) {
|
|
973
973
|
var L = S[N >>> 2] >>> 24 - N % 4 * 8 & 255;
|
|
974
|
-
M[
|
|
974
|
+
M[O + N >>> 2] |= L << 24 - (O + N) % 4 * 8;
|
|
975
975
|
}
|
|
976
|
-
else for (var z = 0; z < k; z += 4) M[
|
|
976
|
+
else for (var z = 0; z < k; z += 4) M[O + z >>> 2] = S[z >>> 2];
|
|
977
977
|
return this.sigBytes += k, this;
|
|
978
978
|
}, clamp: function() {
|
|
979
979
|
var _ = this.words, M = this.sigBytes;
|
|
@@ -985,22 +985,22 @@ function Gt() {
|
|
|
985
985
|
for (var M = [], S = 0; S < _; S += 4) M.push(i());
|
|
986
986
|
return new d.init(M, _);
|
|
987
987
|
} }), h = a.enc = {}, p = h.Hex = { stringify: function(_) {
|
|
988
|
-
for (var M = _.words, S = _.sigBytes,
|
|
988
|
+
for (var M = _.words, S = _.sigBytes, O = [], k = 0; k < S; k++) {
|
|
989
989
|
var N = M[k >>> 2] >>> 24 - k % 4 * 8 & 255;
|
|
990
|
-
|
|
990
|
+
O.push((N >>> 4).toString(16)), O.push((15 & N).toString(16));
|
|
991
991
|
}
|
|
992
|
-
return
|
|
992
|
+
return O.join("");
|
|
993
993
|
}, parse: function(_) {
|
|
994
|
-
for (var M = _.length, S = [],
|
|
994
|
+
for (var M = _.length, S = [], O = 0; O < M; O += 2) S[O >>> 3] |= parseInt(_.substr(O, 2), 16) << 24 - O % 8 * 4;
|
|
995
995
|
return new d.init(S, M / 2);
|
|
996
996
|
} }, w = h.Latin1 = { stringify: function(_) {
|
|
997
|
-
for (var M = _.words, S = _.sigBytes,
|
|
997
|
+
for (var M = _.words, S = _.sigBytes, O = [], k = 0; k < S; k++) {
|
|
998
998
|
var N = M[k >>> 2] >>> 24 - k % 4 * 8 & 255;
|
|
999
|
-
|
|
999
|
+
O.push(String.fromCharCode(N));
|
|
1000
1000
|
}
|
|
1001
|
-
return
|
|
1001
|
+
return O.join("");
|
|
1002
1002
|
}, parse: function(_) {
|
|
1003
|
-
for (var M = _.length, S = [],
|
|
1003
|
+
for (var M = _.length, S = [], O = 0; O < M; O++) S[O >>> 2] |= (255 & _.charCodeAt(O)) << 24 - O % 4 * 8;
|
|
1004
1004
|
return new d.init(S, M);
|
|
1005
1005
|
} }, v = h.Utf8 = { stringify: function(_) {
|
|
1006
1006
|
try {
|
|
@@ -1015,10 +1015,10 @@ function Gt() {
|
|
|
1015
1015
|
}, _append: function(_) {
|
|
1016
1016
|
typeof _ == "string" && (_ = v.parse(_)), this._data.concat(_), this._nDataBytes += _.sigBytes;
|
|
1017
1017
|
}, _process: function(_) {
|
|
1018
|
-
var M, S = this._data,
|
|
1018
|
+
var M, S = this._data, O = S.words, k = S.sigBytes, N = this.blockSize, L = k / (4 * N), z = (L = _ ? t.ceil(L) : t.max((0 | L) - this._minBufferSize, 0)) * N, f = t.min(4 * z, k);
|
|
1019
1019
|
if (z) {
|
|
1020
|
-
for (var l = 0; l < z; l += N) this._doProcessBlock(
|
|
1021
|
-
M =
|
|
1020
|
+
for (var l = 0; l < z; l += N) this._doProcessBlock(O, l);
|
|
1021
|
+
M = O.splice(0, z), S.sigBytes -= f;
|
|
1022
1022
|
}
|
|
1023
1023
|
return new d.init(M, f);
|
|
1024
1024
|
}, clone: function() {
|
|
@@ -1071,7 +1071,7 @@ function us() {
|
|
|
1071
1071
|
}(Gt())), Qa.exports;
|
|
1072
1072
|
}
|
|
1073
1073
|
var Ga, Ja = { exports: {} };
|
|
1074
|
-
function
|
|
1074
|
+
function Cf() {
|
|
1075
1075
|
return Ga || (Ga = 1, Ja.exports = function(e) {
|
|
1076
1076
|
return function() {
|
|
1077
1077
|
if (typeof ArrayBuffer == "function") {
|
|
@@ -1087,7 +1087,7 @@ function Of() {
|
|
|
1087
1087
|
}(Gt())), Ja.exports;
|
|
1088
1088
|
}
|
|
1089
1089
|
var Xa, tc = { exports: {} };
|
|
1090
|
-
function
|
|
1090
|
+
function Of() {
|
|
1091
1091
|
return Xa || (Xa = 1, tc.exports = function(e) {
|
|
1092
1092
|
return function() {
|
|
1093
1093
|
var t = e, r = t.lib.WordArray, n = t.enc;
|
|
@@ -1203,36 +1203,36 @@ function mn() {
|
|
|
1203
1203
|
var _ = A + I, M = v[_];
|
|
1204
1204
|
v[_] = 16711935 & (M << 8 | M >>> 24) | 4278255360 & (M << 24 | M >>> 8);
|
|
1205
1205
|
}
|
|
1206
|
-
var S = this._hash.words,
|
|
1207
|
-
|
|
1206
|
+
var S = this._hash.words, O = v[A + 0], k = v[A + 1], N = v[A + 2], L = v[A + 3], z = v[A + 4], f = v[A + 5], l = v[A + 6], g = v[A + 7], m = v[A + 8], u = v[A + 9], y = v[A + 10], x = v[A + 11], P = v[A + 12], R = v[A + 13], j = v[A + 14], Z = v[A + 15], U = S[0], V = S[1], F = S[2], H = S[3];
|
|
1207
|
+
U = d(U, V, F, H, O, 7, o[0]), H = d(H, U, V, F, k, 12, o[1]), F = d(F, H, U, V, N, 17, o[2]), V = d(V, F, H, U, L, 22, o[3]), U = d(U, V, F, H, z, 7, o[4]), H = d(H, U, V, F, f, 12, o[5]), F = d(F, H, U, V, l, 17, o[6]), V = d(V, F, H, U, g, 22, o[7]), U = d(U, V, F, H, m, 7, o[8]), H = d(H, U, V, F, u, 12, o[9]), F = d(F, H, U, V, y, 17, o[10]), V = d(V, F, H, U, x, 22, o[11]), U = d(U, V, F, H, P, 7, o[12]), H = d(H, U, V, F, R, 12, o[13]), F = d(F, H, U, V, j, 17, o[14]), U = h(U, V = d(V, F, H, U, Z, 22, o[15]), F, H, k, 5, o[16]), H = h(H, U, V, F, l, 9, o[17]), F = h(F, H, U, V, x, 14, o[18]), V = h(V, F, H, U, O, 20, o[19]), U = h(U, V, F, H, f, 5, o[20]), H = h(H, U, V, F, y, 9, o[21]), F = h(F, H, U, V, Z, 14, o[22]), V = h(V, F, H, U, z, 20, o[23]), U = h(U, V, F, H, u, 5, o[24]), H = h(H, U, V, F, j, 9, o[25]), F = h(F, H, U, V, L, 14, o[26]), V = h(V, F, H, U, m, 20, o[27]), U = h(U, V, F, H, R, 5, o[28]), H = h(H, U, V, F, N, 9, o[29]), F = h(F, H, U, V, g, 14, o[30]), U = p(U, V = h(V, F, H, U, P, 20, o[31]), F, H, f, 4, o[32]), H = p(H, U, V, F, m, 11, o[33]), F = p(F, H, U, V, x, 16, o[34]), V = p(V, F, H, U, j, 23, o[35]), U = p(U, V, F, H, k, 4, o[36]), H = p(H, U, V, F, z, 11, o[37]), F = p(F, H, U, V, g, 16, o[38]), V = p(V, F, H, U, y, 23, o[39]), U = p(U, V, F, H, R, 4, o[40]), H = p(H, U, V, F, O, 11, o[41]), F = p(F, H, U, V, L, 16, o[42]), V = p(V, F, H, U, l, 23, o[43]), U = p(U, V, F, H, u, 4, o[44]), H = p(H, U, V, F, P, 11, o[45]), F = p(F, H, U, V, Z, 16, o[46]), U = w(U, V = p(V, F, H, U, N, 23, o[47]), F, H, O, 6, o[48]), H = w(H, U, V, F, g, 10, o[49]), F = w(F, H, U, V, j, 15, o[50]), V = w(V, F, H, U, f, 21, o[51]), U = w(U, V, F, H, P, 6, o[52]), H = w(H, U, V, F, L, 10, o[53]), F = w(F, H, U, V, y, 15, o[54]), V = w(V, F, H, U, k, 21, o[55]), U = w(U, V, F, H, m, 6, o[56]), H = w(H, U, V, F, Z, 10, o[57]), F = w(F, H, U, V, l, 15, o[58]), V = w(V, F, H, U, R, 21, o[59]), U = w(U, V, F, H, z, 6, o[60]), H = w(H, U, V, F, x, 10, o[61]), F = w(F, H, U, V, N, 15, o[62]), V = w(V, F, H, U, u, 21, o[63]), S[0] = S[0] + U | 0, S[1] = S[1] + V | 0, S[2] = S[2] + F | 0, S[3] = S[3] + H | 0;
|
|
1208
1208
|
}, _doFinalize: function() {
|
|
1209
1209
|
var v = this._data, A = v.words, I = 8 * this._nDataBytes, _ = 8 * v.sigBytes;
|
|
1210
1210
|
A[_ >>> 5] |= 128 << 24 - _ % 32;
|
|
1211
1211
|
var M = t.floor(I / 4294967296), S = I;
|
|
1212
1212
|
A[15 + (_ + 64 >>> 9 << 4)] = 16711935 & (M << 8 | M >>> 24) | 4278255360 & (M << 24 | M >>> 8), A[14 + (_ + 64 >>> 9 << 4)] = 16711935 & (S << 8 | S >>> 24) | 4278255360 & (S << 24 | S >>> 8), v.sigBytes = 4 * (A.length + 1), this._process();
|
|
1213
|
-
for (var
|
|
1213
|
+
for (var O = this._hash, k = O.words, N = 0; N < 4; N++) {
|
|
1214
1214
|
var L = k[N];
|
|
1215
1215
|
k[N] = 16711935 & (L << 8 | L >>> 24) | 4278255360 & (L << 24 | L >>> 8);
|
|
1216
1216
|
}
|
|
1217
|
-
return
|
|
1217
|
+
return O;
|
|
1218
1218
|
}, clone: function() {
|
|
1219
1219
|
var v = s.clone.call(this);
|
|
1220
1220
|
return v._hash = this._hash.clone(), v;
|
|
1221
1221
|
} });
|
|
1222
|
-
function d(v, A, I, _, M, S,
|
|
1223
|
-
var k = v + (A & I | ~A & _) + M +
|
|
1222
|
+
function d(v, A, I, _, M, S, O) {
|
|
1223
|
+
var k = v + (A & I | ~A & _) + M + O;
|
|
1224
1224
|
return (k << S | k >>> 32 - S) + A;
|
|
1225
1225
|
}
|
|
1226
|
-
function h(v, A, I, _, M, S,
|
|
1227
|
-
var k = v + (A & _ | I & ~_) + M +
|
|
1226
|
+
function h(v, A, I, _, M, S, O) {
|
|
1227
|
+
var k = v + (A & _ | I & ~_) + M + O;
|
|
1228
1228
|
return (k << S | k >>> 32 - S) + A;
|
|
1229
1229
|
}
|
|
1230
|
-
function p(v, A, I, _, M, S,
|
|
1231
|
-
var k = v + (A ^ I ^ _) + M +
|
|
1230
|
+
function p(v, A, I, _, M, S, O) {
|
|
1231
|
+
var k = v + (A ^ I ^ _) + M + O;
|
|
1232
1232
|
return (k << S | k >>> 32 - S) + A;
|
|
1233
1233
|
}
|
|
1234
|
-
function w(v, A, I, _, M, S,
|
|
1235
|
-
var k = v + (I ^ (A | ~_)) + M +
|
|
1234
|
+
function w(v, A, I, _, M, S, O) {
|
|
1235
|
+
var k = v + (I ^ (A | ~_)) + M + O;
|
|
1236
1236
|
return (k << S | k >>> 32 - S) + A;
|
|
1237
1237
|
}
|
|
1238
1238
|
r.MD5 = s._createHelper(c), r.HmacMD5 = s._createHmacHelper(c);
|
|
@@ -1285,16 +1285,16 @@ function Ws() {
|
|
|
1285
1285
|
var d = [], h = a.SHA256 = s.extend({ _doReset: function() {
|
|
1286
1286
|
this._hash = new i.init(o.slice(0));
|
|
1287
1287
|
}, _doProcessBlock: function(p, w) {
|
|
1288
|
-
for (var v = this._hash.words, A = v[0], I = v[1], _ = v[2], M = v[3], S = v[4],
|
|
1288
|
+
for (var v = this._hash.words, A = v[0], I = v[1], _ = v[2], M = v[3], S = v[4], O = v[5], k = v[6], N = v[7], L = 0; L < 64; L++) {
|
|
1289
1289
|
if (L < 16) d[L] = 0 | p[w + L];
|
|
1290
1290
|
else {
|
|
1291
1291
|
var z = d[L - 15], f = (z << 25 | z >>> 7) ^ (z << 14 | z >>> 18) ^ z >>> 3, l = d[L - 2], g = (l << 15 | l >>> 17) ^ (l << 13 | l >>> 19) ^ l >>> 10;
|
|
1292
1292
|
d[L] = f + d[L - 7] + g + d[L - 16];
|
|
1293
1293
|
}
|
|
1294
|
-
var m = A & I ^ A & _ ^ I & _, u = (A << 30 | A >>> 2) ^ (A << 19 | A >>> 13) ^ (A << 10 | A >>> 22), y = N + ((S << 26 | S >>> 6) ^ (S << 21 | S >>> 11) ^ (S << 7 | S >>> 25)) + (S &
|
|
1295
|
-
N = k, k =
|
|
1294
|
+
var m = A & I ^ A & _ ^ I & _, u = (A << 30 | A >>> 2) ^ (A << 19 | A >>> 13) ^ (A << 10 | A >>> 22), y = N + ((S << 26 | S >>> 6) ^ (S << 21 | S >>> 11) ^ (S << 7 | S >>> 25)) + (S & O ^ ~S & k) + c[L] + d[L];
|
|
1295
|
+
N = k, k = O, O = S, S = M + y | 0, M = _, _ = I, I = A, A = y + (u + m) | 0;
|
|
1296
1296
|
}
|
|
1297
|
-
v[0] = v[0] + A | 0, v[1] = v[1] + I | 0, v[2] = v[2] + _ | 0, v[3] = v[3] + M | 0, v[4] = v[4] + S | 0, v[5] = v[5] +
|
|
1297
|
+
v[0] = v[0] + A | 0, v[1] = v[1] + I | 0, v[2] = v[2] + _ | 0, v[3] = v[3] + M | 0, v[4] = v[4] + S | 0, v[5] = v[5] + O | 0, v[6] = v[6] + k | 0, v[7] = v[7] + N | 0;
|
|
1298
1298
|
}, _doFinalize: function() {
|
|
1299
1299
|
var p = this._data, w = p.words, v = 8 * this._nDataBytes, A = 8 * p.sigBytes;
|
|
1300
1300
|
return w[A >>> 5] |= 128 << 24 - A % 32, w[14 + (A + 64 >>> 9 << 4)] = t.floor(v / 4294967296), w[15 + (A + 64 >>> 9 << 4)] = v, p.sigBytes = 4 * w.length, this._process(), this._hash;
|
|
@@ -1321,17 +1321,17 @@ function pc() {
|
|
|
1321
1321
|
var h = a.SHA512 = r.extend({ _doReset: function() {
|
|
1322
1322
|
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)]);
|
|
1323
1323
|
}, _doProcessBlock: function(p, w) {
|
|
1324
|
-
for (var v = this._hash.words, A = v[0], I = v[1], _ = v[2], M = v[3], S = v[4],
|
|
1324
|
+
for (var v = this._hash.words, A = v[0], I = v[1], _ = v[2], M = v[3], S = v[4], O = v[5], k = v[6], N = v[7], L = A.high, z = A.low, f = I.high, l = I.low, g = _.high, m = _.low, u = M.high, y = M.low, x = S.high, P = S.low, R = O.high, j = O.low, Z = k.high, U = k.low, V = N.high, F = N.low, H = L, J = z, Rt = f, dt = l, yt = g, Ft = m, mt = u, Et = y, Zt = x, Lt = P, oe = R, Ge = j, Yt = Z, ee = U, Pr = V, ae = F, Vt = 0; Vt < 80; Vt++) {
|
|
1325
1325
|
var Ve, ie, ce = d[Vt];
|
|
1326
1326
|
if (Vt < 16) ie = ce.high = 0 | p[w + 2 * Vt], Ve = ce.low = 0 | p[w + 2 * Vt + 1];
|
|
1327
1327
|
else {
|
|
1328
|
-
var Lr = d[Vt - 15], se = Lr.high, de = Lr.low, Kr = (se >>> 1 | de << 31) ^ (se >>> 8 | de << 24) ^ se >>> 7, fe = (de >>> 1 | se << 31) ^ (de >>> 8 | se << 24) ^ (de >>> 7 | se << 25), re = d[Vt - 2], ze = re.high, ne = re.low, pe = (ze >>> 19 | ne << 13) ^ (ze << 3 | ne >>> 29) ^ ze >>> 6, Ee = (ne >>> 19 | ze << 13) ^ (ne << 3 | ze >>> 29) ^ (ne >>> 6 | ze << 26), ue = d[Vt - 7], T = ue.high,
|
|
1329
|
-
ie = (ie = (ie = Kr + T + ((Ve = fe +
|
|
1328
|
+
var Lr = d[Vt - 15], se = Lr.high, de = Lr.low, Kr = (se >>> 1 | de << 31) ^ (se >>> 8 | de << 24) ^ se >>> 7, fe = (de >>> 1 | se << 31) ^ (de >>> 8 | se << 24) ^ (de >>> 7 | se << 25), re = d[Vt - 2], ze = re.high, ne = re.low, pe = (ze >>> 19 | ne << 13) ^ (ze << 3 | ne >>> 29) ^ ze >>> 6, Ee = (ne >>> 19 | ze << 13) ^ (ne << 3 | ze >>> 29) ^ (ne >>> 6 | ze << 26), ue = d[Vt - 7], T = ue.high, C = ue.low, B = d[Vt - 16], b = B.high, E = B.low;
|
|
1329
|
+
ie = (ie = (ie = Kr + T + ((Ve = fe + C) >>> 0 < fe >>> 0 ? 1 : 0)) + pe + ((Ve += Ee) >>> 0 < Ee >>> 0 ? 1 : 0)) + b + ((Ve += E) >>> 0 < E >>> 0 ? 1 : 0), ce.high = ie, ce.low = Ve;
|
|
1330
1330
|
}
|
|
1331
|
-
var
|
|
1332
|
-
Pr = Yt, ae = ee, Yt = oe, ee = Ge, oe = Zt, Ge = Lt, Zt = mt + (ot = (ot = (ot = ot + D + ((
|
|
1331
|
+
var $, D = Zt & oe ^ ~Zt & Yt, W = Lt & Ge ^ ~Lt & ee, q = H & Rt ^ H & yt ^ Rt & yt, Y = J & dt ^ J & Ft ^ dt & Ft, gt = (H >>> 28 | J << 4) ^ (H << 30 | J >>> 2) ^ (H << 25 | J >>> 7), X = (J >>> 28 | H << 4) ^ (J << 30 | H >>> 2) ^ (J << 25 | H >>> 7), ct = (Zt >>> 14 | Lt << 18) ^ (Zt >>> 18 | Lt << 14) ^ (Zt << 23 | Lt >>> 9), wt = (Lt >>> 14 | Zt << 18) ^ (Lt >>> 18 | Zt << 14) ^ (Lt << 23 | Zt >>> 9), nt = c[Vt], ht = nt.high, xt = nt.low, ot = Pr + ct + (($ = ae + wt) >>> 0 < ae >>> 0 ? 1 : 0), ut = X + Y;
|
|
1332
|
+
Pr = Yt, ae = ee, Yt = oe, ee = Ge, oe = Zt, Ge = Lt, Zt = mt + (ot = (ot = (ot = ot + D + (($ += W) >>> 0 < W >>> 0 ? 1 : 0)) + ht + (($ += xt) >>> 0 < xt >>> 0 ? 1 : 0)) + ie + (($ += Ve) >>> 0 < Ve >>> 0 ? 1 : 0)) + ((Lt = Et + $ | 0) >>> 0 < Et >>> 0 ? 1 : 0) | 0, mt = yt, Et = Ft, yt = Rt, Ft = dt, Rt = H, dt = J, H = ot + (gt + q + (ut >>> 0 < X >>> 0 ? 1 : 0)) + ((J = $ + ut | 0) >>> 0 < $ >>> 0 ? 1 : 0) | 0;
|
|
1333
1333
|
}
|
|
1334
|
-
z = A.low = z + J, A.high = L + H + (z >>> 0 < J >>> 0 ? 1 : 0), l = I.low = l + dt, I.high = f + Rt + (l >>> 0 < dt >>> 0 ? 1 : 0), m = _.low = m + Ft, _.high = g + yt + (m >>> 0 < Ft >>> 0 ? 1 : 0), y = M.low = y + Et, M.high = u + mt + (y >>> 0 < Et >>> 0 ? 1 : 0), P = S.low = P + Lt, S.high = x + Zt + (P >>> 0 < Lt >>> 0 ? 1 : 0), j =
|
|
1334
|
+
z = A.low = z + J, A.high = L + H + (z >>> 0 < J >>> 0 ? 1 : 0), l = I.low = l + dt, I.high = f + Rt + (l >>> 0 < dt >>> 0 ? 1 : 0), m = _.low = m + Ft, _.high = g + yt + (m >>> 0 < Ft >>> 0 ? 1 : 0), y = M.low = y + Et, M.high = u + mt + (y >>> 0 < Et >>> 0 ? 1 : 0), P = S.low = P + Lt, S.high = x + Zt + (P >>> 0 < Lt >>> 0 ? 1 : 0), j = O.low = j + Ge, O.high = R + oe + (j >>> 0 < Ge >>> 0 ? 1 : 0), U = k.low = U + ee, k.high = Z + Yt + (U >>> 0 < ee >>> 0 ? 1 : 0), F = N.low = F + ae, N.high = V + Pr + (F >>> 0 < ae >>> 0 ? 1 : 0);
|
|
1335
1335
|
}, _doFinalize: function() {
|
|
1336
1336
|
var p = this._data, w = p.words, v = 8 * this._nDataBytes, A = 8 * p.sigBytes;
|
|
1337
1337
|
return w[A >>> 5] |= 128 << 24 - A % 32, w[30 + (A + 128 >>> 10 << 5)] = Math.floor(v / 4294967296), w[31 + (A + 128 >>> 10 << 5)] = v, p.sigBytes = 4 * w.length, this._process(), this._hash.toX32();
|
|
@@ -1356,14 +1356,14 @@ function zf() {
|
|
|
1356
1356
|
}
|
|
1357
1357
|
for (v = 0; v < 5; v++) for (A = 0; A < 5; A++) d[v + 5 * A] = A + (2 * v + 3 * A) % 5 * 5;
|
|
1358
1358
|
for (var M = 1, S = 0; S < 24; S++) {
|
|
1359
|
-
for (var
|
|
1359
|
+
for (var O = 0, k = 0, N = 0; N < 7; N++) {
|
|
1360
1360
|
if (1 & M) {
|
|
1361
1361
|
var L = (1 << N) - 1;
|
|
1362
|
-
L < 32 ? k ^= 1 << L :
|
|
1362
|
+
L < 32 ? k ^= 1 << L : O ^= 1 << L - 32;
|
|
1363
1363
|
}
|
|
1364
1364
|
128 & M ? M = M << 1 ^ 113 : M <<= 1;
|
|
1365
1365
|
}
|
|
1366
|
-
h[S] = a.create(
|
|
1366
|
+
h[S] = a.create(O, k);
|
|
1367
1367
|
}
|
|
1368
1368
|
})();
|
|
1369
1369
|
var p = [];
|
|
@@ -1375,8 +1375,8 @@ function zf() {
|
|
|
1375
1375
|
this.blockSize = (1600 - 2 * this.cfg.outputLength) / 32;
|
|
1376
1376
|
}, _doProcessBlock: function(v, A) {
|
|
1377
1377
|
for (var I = this._state, _ = this.blockSize / 2, M = 0; M < _; M++) {
|
|
1378
|
-
var S = v[A + 2 * M],
|
|
1379
|
-
S = 16711935 & (S << 8 | S >>> 24) | 4278255360 & (S << 24 | S >>> 8),
|
|
1378
|
+
var S = v[A + 2 * M], O = v[A + 2 * M + 1];
|
|
1379
|
+
S = 16711935 & (S << 8 | S >>> 24) | 4278255360 & (S << 24 | S >>> 8), O = 16711935 & (O << 8 | O >>> 24) | 4278255360 & (O << 24 | O >>> 8), (F = I[M]).high ^= O, F.low ^= S;
|
|
1380
1380
|
}
|
|
1381
1381
|
for (var k = 0; k < 24; k++) {
|
|
1382
1382
|
for (var N = 0; N < 5; N++) {
|
|
@@ -1394,8 +1394,8 @@ function zf() {
|
|
|
1394
1394
|
var Z = p[d[x]];
|
|
1395
1395
|
Z.high = L, Z.low = z;
|
|
1396
1396
|
}
|
|
1397
|
-
var
|
|
1398
|
-
for (
|
|
1397
|
+
var U = p[0], V = I[0];
|
|
1398
|
+
for (U.high = V.high, U.low = V.low, N = 0; N < 5; N++) for (f = 0; f < 5; f++) {
|
|
1399
1399
|
var F = I[x = N + 5 * f], H = p[x], J = p[(N + 1) % 5 + 5 * f], Rt = p[(N + 2) % 5 + 5 * f];
|
|
1400
1400
|
F.high = H.high ^ ~J.high & Rt.high, F.low = H.low ^ ~J.low & Rt.low;
|
|
1401
1401
|
}
|
|
@@ -1408,7 +1408,7 @@ function zf() {
|
|
|
1408
1408
|
this._nDataBytes;
|
|
1409
1409
|
var I = 8 * v.sigBytes, _ = 32 * this.blockSize;
|
|
1410
1410
|
A[I >>> 5] |= 1 << 24 - I % 32, A[(t.ceil((I + 1) / _) * _ >>> 5) - 1] |= 128, v.sigBytes = 4 * A.length, this._process();
|
|
1411
|
-
for (var M = this._state, S = this.cfg.outputLength / 8,
|
|
1411
|
+
for (var M = this._state, S = this.cfg.outputLength / 8, O = S / 8, k = [], N = 0; N < O; N++) {
|
|
1412
1412
|
var L = M[N], z = L.high, f = L.low;
|
|
1413
1413
|
z = 16711935 & (z << 8 | z >>> 24) | 4278255360 & (z << 24 | z >>> 8), f = 16711935 & (f << 8 | f >>> 24) | 4278255360 & (f << 24 | f >>> 8), k.push(f), k.push(z);
|
|
1414
1414
|
}
|
|
@@ -1444,7 +1444,7 @@ function _o() {
|
|
|
1444
1444
|
})();
|
|
1445
1445
|
}(Gt())), wc.exports;
|
|
1446
1446
|
}
|
|
1447
|
-
var _c,
|
|
1447
|
+
var _c, Uf = { exports: {} }, xc, Ac = { exports: {} };
|
|
1448
1448
|
function tn() {
|
|
1449
1449
|
return xc || (xc = 1, Ac.exports = function(e) {
|
|
1450
1450
|
return function() {
|
|
@@ -1465,7 +1465,7 @@ function tn() {
|
|
|
1465
1465
|
}(Gt(), r1(), _o())), Ac.exports;
|
|
1466
1466
|
}
|
|
1467
1467
|
var Sc, Ec = { exports: {} };
|
|
1468
|
-
function
|
|
1468
|
+
function Ce() {
|
|
1469
1469
|
return Sc || (Sc = 1, Ec.exports = function(e) {
|
|
1470
1470
|
e.lib.Cipher || function(t) {
|
|
1471
1471
|
var r = e, n = r.lib, i = n.Base, s = n.WordArray, a = n.BufferedBlockAlgorithm, o = r.enc;
|
|
@@ -1484,7 +1484,7 @@ function Oe() {
|
|
|
1484
1484
|
return k && this._append(k), this._doFinalize();
|
|
1485
1485
|
}, keySize: 4, ivSize: 4, _ENC_XFORM_MODE: 1, _DEC_XFORM_MODE: 2, _createHelper: /* @__PURE__ */ function() {
|
|
1486
1486
|
function k(N) {
|
|
1487
|
-
return typeof N == "string" ?
|
|
1487
|
+
return typeof N == "string" ? O : M;
|
|
1488
1488
|
}
|
|
1489
1489
|
return function(N) {
|
|
1490
1490
|
return { encrypt: function(L, z, f) {
|
|
@@ -1559,7 +1559,7 @@ function Oe() {
|
|
|
1559
1559
|
else var l = d.create({ keySize: N + L }).compute(k, z);
|
|
1560
1560
|
var g = s.create(l.words.slice(N), 4 * L);
|
|
1561
1561
|
return l.sigBytes = 4 * N, I.create({ key: l, iv: g, salt: z });
|
|
1562
|
-
} },
|
|
1562
|
+
} }, O = n.PasswordBasedCipher = M.extend({ cfg: M.cfg.extend({ kdf: S }), encrypt: function(k, N, L, z) {
|
|
1563
1563
|
var f = (z = this.cfg.extend(z)).kdf.execute(L, k.keySize, k.ivSize, z.salt, z.hasher);
|
|
1564
1564
|
z.iv = f.iv;
|
|
1565
1565
|
var l = M.encrypt.call(this, k, N, f.key, z);
|
|
@@ -1590,10 +1590,10 @@ function qf() {
|
|
|
1590
1590
|
r.call(this, n, i, a, s), this._prevBlock = o;
|
|
1591
1591
|
} }), t;
|
|
1592
1592
|
}(), e.mode.CFB;
|
|
1593
|
-
}(Gt(),
|
|
1593
|
+
}(Gt(), Ce())), Mc.exports;
|
|
1594
1594
|
}
|
|
1595
1595
|
var Ic, Tc = { exports: {} };
|
|
1596
|
-
function
|
|
1596
|
+
function $f() {
|
|
1597
1597
|
return Ic || (Ic = 1, Tc.exports = function(e) {
|
|
1598
1598
|
return e.mode.CTR = (t = e.lib.BlockCipherMode.extend(), r = t.Encryptor = t.extend({ processBlock: function(n, i) {
|
|
1599
1599
|
var s = this._cipher, a = s.blockSize, o = this._iv, c = this._counter;
|
|
@@ -1603,7 +1603,7 @@ function Uf() {
|
|
|
1603
1603
|
for (var h = 0; h < a; h++) n[i + h] ^= d[h];
|
|
1604
1604
|
} }), t.Decryptor = r, t), e.mode.CTR;
|
|
1605
1605
|
var t, r;
|
|
1606
|
-
}(Gt(),
|
|
1606
|
+
}(Gt(), Ce())), Tc.exports;
|
|
1607
1607
|
}
|
|
1608
1608
|
var Rc, Nc = { exports: {} };
|
|
1609
1609
|
function Hf() {
|
|
@@ -1635,20 +1635,20 @@ function Hf() {
|
|
|
1635
1635
|
} });
|
|
1636
1636
|
return t.Decryptor = i, t;
|
|
1637
1637
|
}(), e.mode.CTRGladman;
|
|
1638
|
-
}(Gt(),
|
|
1638
|
+
}(Gt(), Ce())), Nc.exports;
|
|
1639
1639
|
}
|
|
1640
|
-
var
|
|
1640
|
+
var Cc, Oc = { exports: {} };
|
|
1641
1641
|
function Df() {
|
|
1642
|
-
return
|
|
1642
|
+
return Cc || (Cc = 1, Oc.exports = function(e) {
|
|
1643
1643
|
return e.mode.OFB = (t = e.lib.BlockCipherMode.extend(), r = t.Encryptor = t.extend({ processBlock: function(n, i) {
|
|
1644
1644
|
var s = this._cipher, a = s.blockSize, o = this._iv, c = this._keystream;
|
|
1645
1645
|
o && (c = this._keystream = o.slice(0), this._iv = void 0), s.encryptBlock(c, 0);
|
|
1646
1646
|
for (var d = 0; d < a; d++) n[i + d] ^= c[d];
|
|
1647
1647
|
} }), t.Decryptor = r, t), e.mode.OFB;
|
|
1648
1648
|
var t, r;
|
|
1649
|
-
}(Gt(),
|
|
1649
|
+
}(Gt(), Ce())), Oc.exports;
|
|
1650
1650
|
}
|
|
1651
|
-
var Bc, Ff = { exports: {} }, Pc, Zf = { exports: {} }, Lc, Vf = { exports: {} }, zc, Kf = { exports: {} }, jc, Wf = { exports: {} },
|
|
1651
|
+
var Bc, Ff = { exports: {} }, Pc, Zf = { exports: {} }, Lc, Vf = { exports: {} }, zc, Kf = { exports: {} }, jc, Wf = { exports: {} }, Uc, Yf = { exports: {} }, qc, Qf = { exports: {} }, $c, Gf = { exports: {} }, Hc, Dc = { exports: {} };
|
|
1652
1652
|
function Jf() {
|
|
1653
1653
|
return Hc || (Hc = 1, Dc.exports = function(e) {
|
|
1654
1654
|
return function() {
|
|
@@ -1657,14 +1657,14 @@ function Jf() {
|
|
|
1657
1657
|
var S = a[M] - 1;
|
|
1658
1658
|
_[M] = I[S >>> 5] >>> 31 - S % 32 & 1;
|
|
1659
1659
|
}
|
|
1660
|
-
for (var
|
|
1661
|
-
var N =
|
|
1660
|
+
for (var O = this._subKeys = [], k = 0; k < 16; k++) {
|
|
1661
|
+
var N = O[k] = [], L = c[k];
|
|
1662
1662
|
for (M = 0; M < 24; M++) N[M / 6 | 0] |= _[(o[M] - 1 + L) % 28] << 31 - M % 6, N[4 + (M / 6 | 0)] |= _[28 + (o[M + 24] - 1 + L) % 28] << 31 - M % 6;
|
|
1663
1663
|
for (N[0] = N[0] << 1 | N[0] >>> 31, M = 1; M < 7; M++) N[M] = N[M] >>> 4 * (M - 1) + 3;
|
|
1664
1664
|
N[7] = N[7] << 5 | N[7] >>> 27;
|
|
1665
1665
|
}
|
|
1666
1666
|
var z = this._invSubKeys = [];
|
|
1667
|
-
for (M = 0; M < 16; M++) z[M] =
|
|
1667
|
+
for (M = 0; M < 16; M++) z[M] = O[15 - M];
|
|
1668
1668
|
}, encryptBlock: function(I, _) {
|
|
1669
1669
|
this._doCryptBlock(I, _, this._subKeys);
|
|
1670
1670
|
}, decryptBlock: function(I, _) {
|
|
@@ -1672,7 +1672,7 @@ function Jf() {
|
|
|
1672
1672
|
}, _doCryptBlock: function(I, _, M) {
|
|
1673
1673
|
this._lBlock = I[_], this._rBlock = I[_ + 1], w.call(this, 4, 252645135), w.call(this, 16, 65535), v.call(this, 2, 858993459), v.call(this, 8, 16711935), w.call(this, 1, 1431655765);
|
|
1674
1674
|
for (var S = 0; S < 16; S++) {
|
|
1675
|
-
for (var
|
|
1675
|
+
for (var O = M[S], k = this._lBlock, N = this._rBlock, L = 0, z = 0; z < 8; z++) L |= d[z][((N ^ O[z]) & h[z]) >>> 0];
|
|
1676
1676
|
this._lBlock = N, this._rBlock = k ^ L;
|
|
1677
1677
|
}
|
|
1678
1678
|
var f = this._lBlock;
|
|
@@ -1699,7 +1699,7 @@ function Jf() {
|
|
|
1699
1699
|
}, keySize: 6, ivSize: 2, blockSize: 2 });
|
|
1700
1700
|
t.TripleDES = i._createHelper(A);
|
|
1701
1701
|
}(), e.TripleDES;
|
|
1702
|
-
}(Gt(), pn(), mn(), tn(),
|
|
1702
|
+
}(Gt(), pn(), mn(), tn(), Ce())), Dc.exports;
|
|
1703
1703
|
}
|
|
1704
1704
|
var Fc, Xf = { exports: {} }, Zc, th = { exports: {} }, Vc, eh = { exports: {} }, Kc, Wc = { exports: {} };
|
|
1705
1705
|
function rh() {
|
|
@@ -1709,17 +1709,17 @@ function rh() {
|
|
|
1709
1709
|
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]];
|
|
1710
1710
|
var o = { pbox: [], sbox: [] };
|
|
1711
1711
|
function c(v, A) {
|
|
1712
|
-
let I = A >> 24 & 255, _ = A >> 16 & 255, M = A >> 8 & 255, S = 255 & A,
|
|
1713
|
-
return
|
|
1712
|
+
let I = A >> 24 & 255, _ = A >> 16 & 255, M = A >> 8 & 255, S = 255 & A, O = v.sbox[0][I] + v.sbox[1][_];
|
|
1713
|
+
return O ^= v.sbox[2][M], O += v.sbox[3][S], O;
|
|
1714
1714
|
}
|
|
1715
1715
|
function d(v, A, I) {
|
|
1716
1716
|
let _, M = A, S = I;
|
|
1717
|
-
for (let
|
|
1717
|
+
for (let O = 0; O < i; ++O) M ^= v.pbox[O], S = c(v, M) ^ S, _ = M, M = S, S = _;
|
|
1718
1718
|
return _ = M, M = S, S = _, S ^= v.pbox[i], M ^= v.pbox[i + 1], { left: M, right: S };
|
|
1719
1719
|
}
|
|
1720
1720
|
function h(v, A, I) {
|
|
1721
1721
|
let _, M = A, S = I;
|
|
1722
|
-
for (let
|
|
1722
|
+
for (let O = i + 1; O > 1; --O) M ^= v.pbox[O], S = c(v, M) ^ S, _ = M, M = S, S = _;
|
|
1723
1723
|
return _ = M, M = S, S = _, S ^= v.pbox[1], M ^= v.pbox[0], { left: M, right: S };
|
|
1724
1724
|
}
|
|
1725
1725
|
function p(v, A, I) {
|
|
@@ -1729,9 +1729,9 @@ function rh() {
|
|
|
1729
1729
|
}
|
|
1730
1730
|
let _ = 0;
|
|
1731
1731
|
for (let k = 0; k < i + 2; k++) v.pbox[k] = s[k] ^ A[_], _++, _ >= I && (_ = 0);
|
|
1732
|
-
let M = 0, S = 0,
|
|
1733
|
-
for (let k = 0; k < i + 2; k += 2)
|
|
1734
|
-
for (let k = 0; k < 4; k++) for (let N = 0; N < 256; N += 2)
|
|
1732
|
+
let M = 0, S = 0, O = 0;
|
|
1733
|
+
for (let k = 0; k < i + 2; k += 2) O = d(v, M, S), M = O.left, S = O.right, v.pbox[k] = M, v.pbox[k + 1] = S;
|
|
1734
|
+
for (let k = 0; k < 4; k++) for (let N = 0; N < 256; N += 2) O = d(v, M, S), M = O.left, S = O.right, v.sbox[k][N] = M, v.sbox[k][N + 1] = S;
|
|
1735
1735
|
return !0;
|
|
1736
1736
|
}
|
|
1737
1737
|
var w = n.Blowfish = r.extend({ _doReset: function() {
|
|
@@ -1748,11 +1748,11 @@ function rh() {
|
|
|
1748
1748
|
}, blockSize: 2, keySize: 4, ivSize: 2 });
|
|
1749
1749
|
t.Blowfish = r._createHelper(w);
|
|
1750
1750
|
}(), e.Blowfish;
|
|
1751
|
-
}(Gt(), pn(), mn(), tn(),
|
|
1751
|
+
}(Gt(), pn(), mn(), tn(), Ce())), Wc.exports;
|
|
1752
1752
|
}
|
|
1753
1753
|
t1.exports = /* @__PURE__ */ function(e) {
|
|
1754
1754
|
return e;
|
|
1755
|
-
}(Gt(), us(),
|
|
1755
|
+
}(Gt(), us(), Cf(), Of(), pn(), Bf(), mn(), r1(), Ws(), hc || (hc = 1, Pf.exports = function(e) {
|
|
1756
1756
|
return function() {
|
|
1757
1757
|
var t = e, r = t.lib.WordArray, n = t.algo, i = n.SHA256, s = n.SHA224 = i.extend({ _doReset: function() {
|
|
1758
1758
|
this._hash = new r.init([3238371032, 914150663, 812702999, 4144912697, 4290775857, 1750603025, 1694076839, 3204075428]);
|
|
@@ -1786,59 +1786,59 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1786
1786
|
return function() {
|
|
1787
1787
|
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]), p = n.create([1352829926, 1548603684, 1836072691, 2053994217, 0]), w = s.RIPEMD160 = i.extend({ _doReset: function() {
|
|
1788
1788
|
this._hash = n.create([1732584193, 4023233417, 2562383102, 271733878, 3285377520]);
|
|
1789
|
-
}, _doProcessBlock: function(
|
|
1789
|
+
}, _doProcessBlock: function(O, k) {
|
|
1790
1790
|
for (var N = 0; N < 16; N++) {
|
|
1791
|
-
var L = k + N, z =
|
|
1792
|
-
|
|
1791
|
+
var L = k + N, z = O[L];
|
|
1792
|
+
O[L] = 16711935 & (z << 8 | z >>> 24) | 4278255360 & (z << 24 | z >>> 8);
|
|
1793
1793
|
}
|
|
1794
|
-
var f, l, g, m, u, y, x, P, R, j, Z,
|
|
1795
|
-
for (y = f =
|
|
1796
|
-
Z =
|
|
1794
|
+
var f, l, g, m, u, y, x, P, R, j, Z, U = this._hash.words, V = h.words, F = p.words, H = a.words, J = o.words, Rt = c.words, dt = d.words;
|
|
1795
|
+
for (y = f = U[0], x = l = U[1], P = g = U[2], R = m = U[3], j = u = U[4], N = 0; N < 80; N += 1) Z = f + O[k + H[N]] | 0, Z += N < 16 ? v(l, g, m) + V[0] : N < 32 ? A(l, g, m) + V[1] : N < 48 ? I(l, g, m) + V[2] : N < 64 ? _(l, g, m) + V[3] : M(l, g, m) + V[4], Z = (Z = S(Z |= 0, Rt[N])) + u | 0, f = u, u = m, m = S(g, 10), g = l, l = Z, Z = y + O[k + J[N]] | 0, Z += N < 16 ? M(x, P, R) + F[0] : N < 32 ? _(x, P, R) + F[1] : N < 48 ? I(x, P, R) + F[2] : N < 64 ? A(x, P, R) + F[3] : v(x, P, R) + F[4], Z = (Z = S(Z |= 0, dt[N])) + j | 0, y = j, j = R, R = S(P, 10), P = x, x = Z;
|
|
1796
|
+
Z = U[1] + g + R | 0, U[1] = U[2] + m + j | 0, U[2] = U[3] + u + y | 0, U[3] = U[4] + f + x | 0, U[4] = U[0] + l + P | 0, U[0] = Z;
|
|
1797
1797
|
}, _doFinalize: function() {
|
|
1798
|
-
var
|
|
1799
|
-
k[L >>> 5] |= 128 << 24 - L % 32, k[14 + (L + 64 >>> 9 << 4)] = 16711935 & (N << 8 | N >>> 24) | 4278255360 & (N << 24 | N >>> 8),
|
|
1798
|
+
var O = this._data, k = O.words, N = 8 * this._nDataBytes, L = 8 * O.sigBytes;
|
|
1799
|
+
k[L >>> 5] |= 128 << 24 - L % 32, k[14 + (L + 64 >>> 9 << 4)] = 16711935 & (N << 8 | N >>> 24) | 4278255360 & (N << 24 | N >>> 8), O.sigBytes = 4 * (k.length + 1), this._process();
|
|
1800
1800
|
for (var z = this._hash, f = z.words, l = 0; l < 5; l++) {
|
|
1801
1801
|
var g = f[l];
|
|
1802
1802
|
f[l] = 16711935 & (g << 8 | g >>> 24) | 4278255360 & (g << 24 | g >>> 8);
|
|
1803
1803
|
}
|
|
1804
1804
|
return z;
|
|
1805
1805
|
}, clone: function() {
|
|
1806
|
-
var
|
|
1807
|
-
return
|
|
1806
|
+
var O = i.clone.call(this);
|
|
1807
|
+
return O._hash = this._hash.clone(), O;
|
|
1808
1808
|
} });
|
|
1809
|
-
function v(
|
|
1810
|
-
return
|
|
1809
|
+
function v(O, k, N) {
|
|
1810
|
+
return O ^ k ^ N;
|
|
1811
1811
|
}
|
|
1812
|
-
function A(
|
|
1813
|
-
return
|
|
1812
|
+
function A(O, k, N) {
|
|
1813
|
+
return O & k | ~O & N;
|
|
1814
1814
|
}
|
|
1815
|
-
function I(
|
|
1816
|
-
return (
|
|
1815
|
+
function I(O, k, N) {
|
|
1816
|
+
return (O | ~k) ^ N;
|
|
1817
1817
|
}
|
|
1818
|
-
function _(
|
|
1819
|
-
return
|
|
1818
|
+
function _(O, k, N) {
|
|
1819
|
+
return O & N | k & ~N;
|
|
1820
1820
|
}
|
|
1821
|
-
function M(
|
|
1822
|
-
return
|
|
1821
|
+
function M(O, k, N) {
|
|
1822
|
+
return O ^ (k | ~N);
|
|
1823
1823
|
}
|
|
1824
|
-
function S(
|
|
1825
|
-
return
|
|
1824
|
+
function S(O, k) {
|
|
1825
|
+
return O << k | O >>> 32 - k;
|
|
1826
1826
|
}
|
|
1827
1827
|
t.RIPEMD160 = i._createHelper(w), t.HmacRIPEMD160 = i._createHmacHelper(w);
|
|
1828
1828
|
}(), e.RIPEMD160;
|
|
1829
|
-
}(Gt())), _o(), _c || (_c = 1,
|
|
1829
|
+
}(Gt())), _o(), _c || (_c = 1, Uf.exports = function(e) {
|
|
1830
1830
|
return function() {
|
|
1831
1831
|
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) {
|
|
1832
1832
|
this.cfg = this.cfg.extend(d);
|
|
1833
1833
|
}, compute: function(d, h) {
|
|
1834
1834
|
for (var p = this.cfg, w = o.create(p.hasher, d), v = i.create(), A = i.create([1]), I = v.words, _ = A.words, M = p.keySize, S = p.iterations; I.length < M; ) {
|
|
1835
|
-
var
|
|
1835
|
+
var O = w.update(h).finalize(A);
|
|
1836
1836
|
w.reset();
|
|
1837
|
-
for (var k =
|
|
1837
|
+
for (var k = O.words, N = k.length, L = O, z = 1; z < S; z++) {
|
|
1838
1838
|
L = w.finalize(L), w.reset();
|
|
1839
1839
|
for (var f = L.words, l = 0; l < N; l++) k[l] ^= f[l];
|
|
1840
1840
|
}
|
|
1841
|
-
v.concat(
|
|
1841
|
+
v.concat(O), _[0]++;
|
|
1842
1842
|
}
|
|
1843
1843
|
return v.sigBytes = 4 * M, v;
|
|
1844
1844
|
} });
|
|
@@ -1846,14 +1846,14 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1846
1846
|
return c.create(p).compute(d, h);
|
|
1847
1847
|
};
|
|
1848
1848
|
}(), e.PBKDF2;
|
|
1849
|
-
}(Gt(), Ws(), _o())), tn(),
|
|
1849
|
+
}(Gt(), Ws(), _o())), tn(), Ce(), qf(), $f(), Hf(), Df(), Bc || (Bc = 1, Ff.exports = function(e) {
|
|
1850
1850
|
return e.mode.ECB = ((t = e.lib.BlockCipherMode.extend()).Encryptor = t.extend({ processBlock: function(r, n) {
|
|
1851
1851
|
this._cipher.encryptBlock(r, n);
|
|
1852
1852
|
} }), t.Decryptor = t.extend({ processBlock: function(r, n) {
|
|
1853
1853
|
this._cipher.decryptBlock(r, n);
|
|
1854
1854
|
} }), t), e.mode.ECB;
|
|
1855
1855
|
var t;
|
|
1856
|
-
}(Gt(),
|
|
1856
|
+
}(Gt(), Ce())), Pc || (Pc = 1, Zf.exports = function(e) {
|
|
1857
1857
|
return e.pad.AnsiX923 = { pad: function(t, r) {
|
|
1858
1858
|
var n = t.sigBytes, i = 4 * r, s = i - n % i, a = n + s - 1;
|
|
1859
1859
|
t.clamp(), t.words[a >>> 2] |= s << 24 - a % 4 * 8, t.sigBytes += s;
|
|
@@ -1861,7 +1861,7 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1861
1861
|
var r = 255 & t.words[t.sigBytes - 1 >>> 2];
|
|
1862
1862
|
t.sigBytes -= r;
|
|
1863
1863
|
} }, e.pad.Ansix923;
|
|
1864
|
-
}(Gt(),
|
|
1864
|
+
}(Gt(), Ce())), Lc || (Lc = 1, Vf.exports = function(e) {
|
|
1865
1865
|
return e.pad.Iso10126 = { pad: function(t, r) {
|
|
1866
1866
|
var n = 4 * r, i = n - t.sigBytes % n;
|
|
1867
1867
|
t.concat(e.lib.WordArray.random(i - 1)).concat(e.lib.WordArray.create([i << 24], 1));
|
|
@@ -1869,13 +1869,13 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1869
1869
|
var r = 255 & t.words[t.sigBytes - 1 >>> 2];
|
|
1870
1870
|
t.sigBytes -= r;
|
|
1871
1871
|
} }, e.pad.Iso10126;
|
|
1872
|
-
}(Gt(),
|
|
1872
|
+
}(Gt(), Ce())), zc || (zc = 1, Kf.exports = function(e) {
|
|
1873
1873
|
return e.pad.Iso97971 = { pad: function(t, r) {
|
|
1874
1874
|
t.concat(e.lib.WordArray.create([2147483648], 1)), e.pad.ZeroPadding.pad(t, r);
|
|
1875
1875
|
}, unpad: function(t) {
|
|
1876
1876
|
e.pad.ZeroPadding.unpad(t), t.sigBytes--;
|
|
1877
1877
|
} }, e.pad.Iso97971;
|
|
1878
|
-
}(Gt(),
|
|
1878
|
+
}(Gt(), Ce())), jc || (jc = 1, Wf.exports = function(e) {
|
|
1879
1879
|
return e.pad.ZeroPadding = { pad: function(t, r) {
|
|
1880
1880
|
var n = 4 * r;
|
|
1881
1881
|
t.clamp(), t.sigBytes += n - (t.sigBytes % n || n);
|
|
@@ -1886,11 +1886,11 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1886
1886
|
break;
|
|
1887
1887
|
}
|
|
1888
1888
|
} }, e.pad.ZeroPadding;
|
|
1889
|
-
}(Gt(),
|
|
1889
|
+
}(Gt(), Ce())), Uc || (Uc = 1, Yf.exports = function(e) {
|
|
1890
1890
|
return e.pad.NoPadding = { pad: function() {
|
|
1891
1891
|
}, unpad: function() {
|
|
1892
1892
|
} }, e.pad.NoPadding;
|
|
1893
|
-
}(Gt(),
|
|
1893
|
+
}(Gt(), Ce())), qc || (qc = 1, Qf.exports = function(e) {
|
|
1894
1894
|
return r = (t = e).lib.CipherParams, n = t.enc.Hex, t.format.Hex = { stringify: function(i) {
|
|
1895
1895
|
return i.ciphertext.toString(n);
|
|
1896
1896
|
}, parse: function(i) {
|
|
@@ -1898,24 +1898,24 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1898
1898
|
return r.create({ ciphertext: s });
|
|
1899
1899
|
} }, e.format.Hex;
|
|
1900
1900
|
var t, r, n;
|
|
1901
|
-
}(Gt(),
|
|
1901
|
+
}(Gt(), Ce())), $c || ($c = 1, Gf.exports = function(e) {
|
|
1902
1902
|
return function() {
|
|
1903
1903
|
var t = e, r = t.lib.BlockCipher, n = t.algo, i = [], s = [], a = [], o = [], c = [], d = [], h = [], p = [], w = [], v = [];
|
|
1904
1904
|
(function() {
|
|
1905
1905
|
for (var _ = [], M = 0; M < 256; M++) _[M] = M < 128 ? M << 1 : M << 1 ^ 283;
|
|
1906
|
-
var S = 0,
|
|
1906
|
+
var S = 0, O = 0;
|
|
1907
1907
|
for (M = 0; M < 256; M++) {
|
|
1908
|
-
var k =
|
|
1908
|
+
var k = O ^ O << 1 ^ O << 2 ^ O << 3 ^ O << 4;
|
|
1909
1909
|
k = k >>> 8 ^ 255 & k ^ 99, i[S] = k, s[k] = S;
|
|
1910
1910
|
var N = _[S], L = _[N], z = _[L], f = 257 * _[k] ^ 16843008 * k;
|
|
1911
|
-
a[S] = f << 24 | f >>> 8, o[S] = f << 16 | f >>> 16, c[S] = f << 8 | f >>> 24, d[S] = f, f = 16843009 * z ^ 65537 * L ^ 257 * N ^ 16843008 * S, h[k] = f << 24 | f >>> 8, p[k] = f << 16 | f >>> 16, w[k] = f << 8 | f >>> 24, v[k] = f, S ? (S = N ^ _[_[_[z ^ N]]],
|
|
1911
|
+
a[S] = f << 24 | f >>> 8, o[S] = f << 16 | f >>> 16, c[S] = f << 8 | f >>> 24, d[S] = f, f = 16843009 * z ^ 65537 * L ^ 257 * N ^ 16843008 * S, h[k] = f << 24 | f >>> 8, p[k] = f << 16 | f >>> 16, w[k] = f << 8 | f >>> 24, v[k] = f, S ? (S = N ^ _[_[_[z ^ N]]], O ^= _[_[O]]) : S = O = 1;
|
|
1912
1912
|
}
|
|
1913
1913
|
})();
|
|
1914
1914
|
var A = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], I = n.AES = r.extend({ _doReset: function() {
|
|
1915
1915
|
if (!this._nRounds || this._keyPriorReset !== this._key) {
|
|
1916
|
-
for (var _ = this._keyPriorReset = this._key, M = _.words, S = _.sigBytes / 4,
|
|
1917
|
-
for (var L = this._invKeySchedule = [], z = 0; z <
|
|
1918
|
-
if (N =
|
|
1916
|
+
for (var _ = this._keyPriorReset = this._key, M = _.words, S = _.sigBytes / 4, O = 4 * ((this._nRounds = S + 6) + 1), k = this._keySchedule = [], N = 0; N < O; N++) N < S ? k[N] = M[N] : (f = k[N - 1], N % S ? S > 6 && N % S == 4 && (f = i[f >>> 24] << 24 | i[f >>> 16 & 255] << 16 | i[f >>> 8 & 255] << 8 | i[255 & f]) : (f = i[(f = f << 8 | f >>> 24) >>> 24] << 24 | i[f >>> 16 & 255] << 16 | i[f >>> 8 & 255] << 8 | i[255 & f], f ^= A[N / S | 0] << 24), k[N] = k[N - S] ^ f);
|
|
1917
|
+
for (var L = this._invKeySchedule = [], z = 0; z < O; z++) {
|
|
1918
|
+
if (N = O - z, z % 4) var f = k[N];
|
|
1919
1919
|
else f = k[N - 4];
|
|
1920
1920
|
L[z] = z < 4 || N <= 4 ? f : h[i[f >>> 24]] ^ p[i[f >>> 16 & 255]] ^ w[i[f >>> 8 & 255]] ^ v[i[255 & f]];
|
|
1921
1921
|
}
|
|
@@ -1925,16 +1925,16 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1925
1925
|
}, decryptBlock: function(_, M) {
|
|
1926
1926
|
var S = _[M + 1];
|
|
1927
1927
|
_[M + 1] = _[M + 3], _[M + 3] = S, this._doCryptBlock(_, M, this._invKeySchedule, h, p, w, v, s), S = _[M + 1], _[M + 1] = _[M + 3], _[M + 3] = S;
|
|
1928
|
-
}, _doCryptBlock: function(_, M, S,
|
|
1928
|
+
}, _doCryptBlock: function(_, M, S, O, k, N, L, z) {
|
|
1929
1929
|
for (var f = this._nRounds, l = _[M] ^ S[0], g = _[M + 1] ^ S[1], m = _[M + 2] ^ S[2], u = _[M + 3] ^ S[3], y = 4, x = 1; x < f; x++) {
|
|
1930
|
-
var P =
|
|
1930
|
+
var P = O[l >>> 24] ^ k[g >>> 16 & 255] ^ N[m >>> 8 & 255] ^ L[255 & u] ^ S[y++], R = O[g >>> 24] ^ k[m >>> 16 & 255] ^ N[u >>> 8 & 255] ^ L[255 & l] ^ S[y++], j = O[m >>> 24] ^ k[u >>> 16 & 255] ^ N[l >>> 8 & 255] ^ L[255 & g] ^ S[y++], Z = O[u >>> 24] ^ k[l >>> 16 & 255] ^ N[g >>> 8 & 255] ^ L[255 & m] ^ S[y++];
|
|
1931
1931
|
l = P, g = R, m = j, u = Z;
|
|
1932
1932
|
}
|
|
1933
1933
|
P = (z[l >>> 24] << 24 | z[g >>> 16 & 255] << 16 | z[m >>> 8 & 255] << 8 | z[255 & u]) ^ S[y++], R = (z[g >>> 24] << 24 | z[m >>> 16 & 255] << 16 | z[u >>> 8 & 255] << 8 | z[255 & l]) ^ S[y++], j = (z[m >>> 24] << 24 | z[u >>> 16 & 255] << 16 | z[l >>> 8 & 255] << 8 | z[255 & g]) ^ S[y++], Z = (z[u >>> 24] << 24 | z[l >>> 16 & 255] << 16 | z[g >>> 8 & 255] << 8 | z[255 & m]) ^ S[y++], _[M] = P, _[M + 1] = R, _[M + 2] = j, _[M + 3] = Z;
|
|
1934
1934
|
}, keySize: 8 });
|
|
1935
1935
|
t.AES = r._createHelper(I);
|
|
1936
1936
|
}(), e.AES;
|
|
1937
|
-
}(Gt(), pn(), mn(), tn(),
|
|
1937
|
+
}(Gt(), pn(), mn(), tn(), Ce())), Jf(), Fc || (Fc = 1, Xf.exports = function(e) {
|
|
1938
1938
|
return function() {
|
|
1939
1939
|
var t = e, r = t.lib.StreamCipher, n = t.algo, i = n.RC4 = r.extend({ _doReset: function() {
|
|
1940
1940
|
for (var o = this._key, c = o.words, d = o.sigBytes, h = this._S = [], p = 0; p < 256; p++) h[p] = p;
|
|
@@ -1964,7 +1964,7 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1964
1964
|
} });
|
|
1965
1965
|
t.RC4Drop = r._createHelper(a);
|
|
1966
1966
|
}(), e.RC4;
|
|
1967
|
-
}(Gt(), pn(), mn(), tn(),
|
|
1967
|
+
}(Gt(), pn(), mn(), tn(), Ce())), Zc || (Zc = 1, th.exports = function(e) {
|
|
1968
1968
|
return function() {
|
|
1969
1969
|
var t = e, r = t.lib.StreamCipher, n = t.algo, i = [], s = [], a = [], o = n.Rabbit = r.extend({ _doReset: function() {
|
|
1970
1970
|
for (var d = this._key.words, h = this.cfg.iv, p = 0; p < 4; p++) d[p] = 16711935 & (d[p] << 8 | d[p] >>> 24) | 4278255360 & (d[p] << 24 | d[p] >>> 8);
|
|
@@ -1972,8 +1972,8 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1972
1972
|
for (this._b = 0, p = 0; p < 4; p++) c.call(this);
|
|
1973
1973
|
for (p = 0; p < 8; p++) v[p] ^= w[p + 4 & 7];
|
|
1974
1974
|
if (h) {
|
|
1975
|
-
var A = h.words, I = A[0], _ = A[1], M = 16711935 & (I << 8 | I >>> 24) | 4278255360 & (I << 24 | I >>> 8), S = 16711935 & (_ << 8 | _ >>> 24) | 4278255360 & (_ << 24 | _ >>> 8),
|
|
1976
|
-
for (v[0] ^= M, v[1] ^=
|
|
1975
|
+
var A = h.words, I = A[0], _ = A[1], M = 16711935 & (I << 8 | I >>> 24) | 4278255360 & (I << 24 | I >>> 8), S = 16711935 & (_ << 8 | _ >>> 24) | 4278255360 & (_ << 24 | _ >>> 8), O = M >>> 16 | 4294901760 & S, k = S << 16 | 65535 & M;
|
|
1976
|
+
for (v[0] ^= M, v[1] ^= O, v[2] ^= S, v[3] ^= k, v[4] ^= M, v[5] ^= O, v[6] ^= S, v[7] ^= k, p = 0; p < 4; p++) c.call(this);
|
|
1977
1977
|
}
|
|
1978
1978
|
}, _doProcessBlock: function(d, h) {
|
|
1979
1979
|
var p = this._X;
|
|
@@ -1990,7 +1990,7 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1990
1990
|
}
|
|
1991
1991
|
t.Rabbit = r._createHelper(o);
|
|
1992
1992
|
}(), e.Rabbit;
|
|
1993
|
-
}(Gt(), pn(), mn(), tn(),
|
|
1993
|
+
}(Gt(), pn(), mn(), tn(), Ce())), Vc || (Vc = 1, eh.exports = function(e) {
|
|
1994
1994
|
return function() {
|
|
1995
1995
|
var t = e, r = t.lib.StreamCipher, n = t.algo, i = [], s = [], a = [], o = n.RabbitLegacy = r.extend({ _doReset: function() {
|
|
1996
1996
|
var d = this._key.words, h = this.cfg.iv, p = 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], w = 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]];
|
|
@@ -1998,8 +1998,8 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
1998
1998
|
for (var v = 0; v < 4; v++) c.call(this);
|
|
1999
1999
|
for (v = 0; v < 8; v++) w[v] ^= p[v + 4 & 7];
|
|
2000
2000
|
if (h) {
|
|
2001
|
-
var A = h.words, I = A[0], _ = A[1], M = 16711935 & (I << 8 | I >>> 24) | 4278255360 & (I << 24 | I >>> 8), S = 16711935 & (_ << 8 | _ >>> 24) | 4278255360 & (_ << 24 | _ >>> 8),
|
|
2002
|
-
for (w[0] ^= M, w[1] ^=
|
|
2001
|
+
var A = h.words, I = A[0], _ = A[1], M = 16711935 & (I << 8 | I >>> 24) | 4278255360 & (I << 24 | I >>> 8), S = 16711935 & (_ << 8 | _ >>> 24) | 4278255360 & (_ << 24 | _ >>> 8), O = M >>> 16 | 4294901760 & S, k = S << 16 | 65535 & M;
|
|
2002
|
+
for (w[0] ^= M, w[1] ^= O, w[2] ^= S, w[3] ^= k, w[4] ^= M, w[5] ^= O, w[6] ^= S, w[7] ^= k, v = 0; v < 4; v++) c.call(this);
|
|
2003
2003
|
}
|
|
2004
2004
|
}, _doProcessBlock: function(d, h) {
|
|
2005
2005
|
var p = this._X;
|
|
@@ -2016,7 +2016,7 @@ t1.exports = /* @__PURE__ */ function(e) {
|
|
|
2016
2016
|
}
|
|
2017
2017
|
t.RabbitLegacy = r._createHelper(o);
|
|
2018
2018
|
}(), e.RabbitLegacy;
|
|
2019
|
-
}(Gt(), pn(), mn(), tn(),
|
|
2019
|
+
}(Gt(), pn(), mn(), tn(), Ce())), rh());
|
|
2020
2020
|
const xe = qi(t1.exports);
|
|
2021
2021
|
var n1 = {};
|
|
2022
2022
|
const nh = "6.6.1";
|
|
@@ -2122,11 +2122,11 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2122
2122
|
var u = 0 | f.words[0], y = 0 | l.words[0], x = u * y, P = 67108863 & x, R = x / 67108864 | 0;
|
|
2123
2123
|
g.words[0] = P;
|
|
2124
2124
|
for (var j = 1; j < m; j++) {
|
|
2125
|
-
for (var Z = R >>> 26,
|
|
2125
|
+
for (var Z = R >>> 26, U = 67108863 & R, V = Math.min(j, l.length - 1), F = Math.max(0, j - f.length + 1); F <= V; F++) {
|
|
2126
2126
|
var H = j - F | 0;
|
|
2127
|
-
Z += (x = (u = 0 | f.words[H]) * (y = 0 | l.words[F]) +
|
|
2127
|
+
Z += (x = (u = 0 | f.words[H]) * (y = 0 | l.words[F]) + U) / 67108864 | 0, U = 67108863 & x;
|
|
2128
2128
|
}
|
|
2129
|
-
g.words[j] = 0 |
|
|
2129
|
+
g.words[j] = 0 | U, R = 0 | Z;
|
|
2130
2130
|
}
|
|
2131
2131
|
return R !== 0 ? g.words[j] = 0 | R : g.length--, g.strip();
|
|
2132
2132
|
}
|
|
@@ -2146,8 +2146,8 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2146
2146
|
g = "";
|
|
2147
2147
|
var Z = this.clone();
|
|
2148
2148
|
for (Z.negative = 0; !Z.isZero(); ) {
|
|
2149
|
-
var
|
|
2150
|
-
g = (Z = Z.idivn(j)).isZero() ?
|
|
2149
|
+
var U = Z.modn(j).toString(f);
|
|
2150
|
+
g = (Z = Z.idivn(j)).isZero() ? U + g : d[R - U.length] + U + g;
|
|
2151
2151
|
}
|
|
2152
2152
|
for (this.isZero() && (g = "0" + g); g.length % l != 0; ) g = "0" + g;
|
|
2153
2153
|
return this.negative !== 0 && (g = "-" + g), g;
|
|
@@ -2281,32 +2281,32 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2281
2281
|
return this.clone().isub(f);
|
|
2282
2282
|
};
|
|
2283
2283
|
var v = function(f, l, g) {
|
|
2284
|
-
var m, u, y, x = f.words, P = l.words, R = g.words, j = 0, Z = 0 | x[0],
|
|
2284
|
+
var m, u, y, x = f.words, P = l.words, R = g.words, j = 0, Z = 0 | x[0], U = 8191 & Z, V = Z >>> 13, F = 0 | x[1], H = 8191 & F, J = F >>> 13, Rt = 0 | x[2], dt = 8191 & Rt, yt = Rt >>> 13, Ft = 0 | x[3], mt = 8191 & Ft, Et = Ft >>> 13, Zt = 0 | x[4], Lt = 8191 & Zt, oe = Zt >>> 13, Ge = 0 | x[5], Yt = 8191 & Ge, ee = Ge >>> 13, Pr = 0 | x[6], ae = 8191 & Pr, Vt = Pr >>> 13, Ve = 0 | x[7], ie = 8191 & Ve, ce = Ve >>> 13, Lr = 0 | x[8], se = 8191 & Lr, de = Lr >>> 13, Kr = 0 | x[9], fe = 8191 & Kr, re = Kr >>> 13, ze = 0 | P[0], ne = 8191 & ze, pe = ze >>> 13, Ee = 0 | P[1], ue = 8191 & Ee, T = Ee >>> 13, C = 0 | P[2], B = 8191 & C, b = C >>> 13, E = 0 | P[3], $ = 8191 & E, D = E >>> 13, W = 0 | P[4], q = 8191 & W, Y = W >>> 13, gt = 0 | P[5], X = 8191 & gt, ct = gt >>> 13, wt = 0 | P[6], nt = 8191 & wt, ht = wt >>> 13, xt = 0 | P[7], ot = 8191 & xt, ut = xt >>> 13, At = 0 | P[8], it = 8191 & At, lt = At >>> 13, Bt = 0 | P[9], at = 8191 & Bt, K = Bt >>> 13;
|
|
2285
2285
|
g.negative = f.negative ^ l.negative, g.length = 19;
|
|
2286
|
-
var Q = (j + (m = Math.imul(
|
|
2286
|
+
var Q = (j + (m = Math.imul(U, ne)) | 0) + ((8191 & (u = (u = Math.imul(U, pe)) + Math.imul(V, ne) | 0)) << 13) | 0;
|
|
2287
2287
|
j = ((y = Math.imul(V, pe)) + (u >>> 13) | 0) + (Q >>> 26) | 0, Q &= 67108863, m = Math.imul(H, ne), u = (u = Math.imul(H, pe)) + Math.imul(J, ne) | 0, y = Math.imul(J, pe);
|
|
2288
|
-
var st = (j + (m = m + Math.imul(
|
|
2288
|
+
var st = (j + (m = m + Math.imul(U, ue) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(U, T) | 0) + Math.imul(V, ue) | 0)) << 13) | 0;
|
|
2289
2289
|
j = ((y = y + Math.imul(V, T) | 0) + (u >>> 13) | 0) + (st >>> 26) | 0, st &= 67108863, m = Math.imul(dt, ne), u = (u = Math.imul(dt, pe)) + Math.imul(yt, ne) | 0, y = Math.imul(yt, pe), m = m + Math.imul(H, ue) | 0, u = (u = u + Math.imul(H, T) | 0) + Math.imul(J, ue) | 0, y = y + Math.imul(J, T) | 0;
|
|
2290
|
-
var tt = (j + (m = m + Math.imul(
|
|
2290
|
+
var tt = (j + (m = m + Math.imul(U, B) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(U, b) | 0) + Math.imul(V, B) | 0)) << 13) | 0;
|
|
2291
2291
|
j = ((y = y + Math.imul(V, b) | 0) + (u >>> 13) | 0) + (tt >>> 26) | 0, tt &= 67108863, m = Math.imul(mt, ne), u = (u = Math.imul(mt, pe)) + Math.imul(Et, ne) | 0, y = Math.imul(Et, pe), m = m + Math.imul(dt, ue) | 0, u = (u = u + Math.imul(dt, T) | 0) + Math.imul(yt, ue) | 0, y = y + Math.imul(yt, T) | 0, m = m + Math.imul(H, B) | 0, u = (u = u + Math.imul(H, b) | 0) + Math.imul(J, B) | 0, y = y + Math.imul(J, b) | 0;
|
|
2292
|
-
var et = (j + (m = m + Math.imul(
|
|
2293
|
-
j = ((y = y + Math.imul(V, D) | 0) + (u >>> 13) | 0) + (et >>> 26) | 0, et &= 67108863, m = Math.imul(Lt, ne), u = (u = Math.imul(Lt, pe)) + Math.imul(oe, ne) | 0, y = Math.imul(oe, pe), m = m + Math.imul(mt, ue) | 0, u = (u = u + Math.imul(mt, T) | 0) + Math.imul(Et, ue) | 0, y = y + Math.imul(Et, T) | 0, m = m + Math.imul(dt, B) | 0, u = (u = u + Math.imul(dt, b) | 0) + Math.imul(yt, B) | 0, y = y + Math.imul(yt, b) | 0, m = m + Math.imul(H,
|
|
2294
|
-
var rt = (j + (m = m + Math.imul(
|
|
2295
|
-
j = ((y = y + Math.imul(V, Y) | 0) + (u >>> 13) | 0) + (rt >>> 26) | 0, rt &= 67108863, m = Math.imul(Yt, ne), u = (u = Math.imul(Yt, pe)) + Math.imul(ee, ne) | 0, y = Math.imul(ee, pe), m = m + Math.imul(Lt, ue) | 0, u = (u = u + Math.imul(Lt, T) | 0) + Math.imul(oe, ue) | 0, y = y + Math.imul(oe, T) | 0, m = m + Math.imul(mt, B) | 0, u = (u = u + Math.imul(mt, b) | 0) + Math.imul(Et, B) | 0, y = y + Math.imul(Et, b) | 0, m = m + Math.imul(dt,
|
|
2296
|
-
var
|
|
2297
|
-
j = ((y = y + Math.imul(V, ct) | 0) + (u >>> 13) | 0) + (
|
|
2298
|
-
var zt = (j + (m = m + Math.imul(
|
|
2299
|
-
j = ((y = y + Math.imul(V, ht) | 0) + (u >>> 13) | 0) + (zt >>> 26) | 0, zt &= 67108863, m = Math.imul(ie, ne), u = (u = Math.imul(ie, pe)) + Math.imul(ce, ne) | 0, y = Math.imul(ce, pe), m = m + Math.imul(ae, ue) | 0, u = (u = u + Math.imul(ae, T) | 0) + Math.imul(Vt, ue) | 0, y = y + Math.imul(Vt, T) | 0, m = m + Math.imul(Yt, B) | 0, u = (u = u + Math.imul(Yt, b) | 0) + Math.imul(ee, B) | 0, y = y + Math.imul(ee, b) | 0, m = m + Math.imul(Lt,
|
|
2300
|
-
var
|
|
2301
|
-
j = ((y = y + Math.imul(V, ut) | 0) + (u >>> 13) | 0) + (
|
|
2302
|
-
var Kt = (j + (m = m + Math.imul(
|
|
2303
|
-
j = ((y = y + Math.imul(V, lt) | 0) + (u >>> 13) | 0) + (Kt >>> 26) | 0, Kt &= 67108863, m = Math.imul(fe, ne), u = (u = Math.imul(fe, pe)) + Math.imul(re, ne) | 0, y = Math.imul(re, pe), m = m + Math.imul(se, ue) | 0, u = (u = u + Math.imul(se, T) | 0) + Math.imul(de, ue) | 0, y = y + Math.imul(de, T) | 0, m = m + Math.imul(ie, B) | 0, u = (u = u + Math.imul(ie, b) | 0) + Math.imul(ce, B) | 0, y = y + Math.imul(ce, b) | 0, m = m + Math.imul(ae,
|
|
2304
|
-
var Qt = (j + (m = m + Math.imul(
|
|
2305
|
-
j = ((y = y + Math.imul(V, K) | 0) + (u >>> 13) | 0) + (Qt >>> 26) | 0, Qt &= 67108863, m = Math.imul(fe, ue), u = (u = Math.imul(fe, T)) + Math.imul(re, ue) | 0, y = Math.imul(re, T), m = m + Math.imul(se, B) | 0, u = (u = u + Math.imul(se, b) | 0) + Math.imul(de, B) | 0, y = y + Math.imul(de, b) | 0, m = m + Math.imul(ie,
|
|
2292
|
+
var et = (j + (m = m + Math.imul(U, $) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(U, D) | 0) + Math.imul(V, $) | 0)) << 13) | 0;
|
|
2293
|
+
j = ((y = y + Math.imul(V, D) | 0) + (u >>> 13) | 0) + (et >>> 26) | 0, et &= 67108863, m = Math.imul(Lt, ne), u = (u = Math.imul(Lt, pe)) + Math.imul(oe, ne) | 0, y = Math.imul(oe, pe), m = m + Math.imul(mt, ue) | 0, u = (u = u + Math.imul(mt, T) | 0) + Math.imul(Et, ue) | 0, y = y + Math.imul(Et, T) | 0, m = m + Math.imul(dt, B) | 0, u = (u = u + Math.imul(dt, b) | 0) + Math.imul(yt, B) | 0, y = y + Math.imul(yt, b) | 0, m = m + Math.imul(H, $) | 0, u = (u = u + Math.imul(H, D) | 0) + Math.imul(J, $) | 0, y = y + Math.imul(J, D) | 0;
|
|
2294
|
+
var rt = (j + (m = m + Math.imul(U, q) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(U, Y) | 0) + Math.imul(V, q) | 0)) << 13) | 0;
|
|
2295
|
+
j = ((y = y + Math.imul(V, Y) | 0) + (u >>> 13) | 0) + (rt >>> 26) | 0, rt &= 67108863, m = Math.imul(Yt, ne), u = (u = Math.imul(Yt, pe)) + Math.imul(ee, ne) | 0, y = Math.imul(ee, pe), m = m + Math.imul(Lt, ue) | 0, u = (u = u + Math.imul(Lt, T) | 0) + Math.imul(oe, ue) | 0, y = y + Math.imul(oe, T) | 0, m = m + Math.imul(mt, B) | 0, u = (u = u + Math.imul(mt, b) | 0) + Math.imul(Et, B) | 0, y = y + Math.imul(Et, b) | 0, m = m + Math.imul(dt, $) | 0, u = (u = u + Math.imul(dt, D) | 0) + Math.imul(yt, $) | 0, y = y + Math.imul(yt, D) | 0, m = m + Math.imul(H, q) | 0, u = (u = u + Math.imul(H, Y) | 0) + Math.imul(J, q) | 0, y = y + Math.imul(J, Y) | 0;
|
|
2296
|
+
var Ot = (j + (m = m + Math.imul(U, X) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(U, ct) | 0) + Math.imul(V, X) | 0)) << 13) | 0;
|
|
2297
|
+
j = ((y = y + Math.imul(V, ct) | 0) + (u >>> 13) | 0) + (Ot >>> 26) | 0, Ot &= 67108863, m = Math.imul(ae, ne), u = (u = Math.imul(ae, pe)) + Math.imul(Vt, ne) | 0, y = Math.imul(Vt, pe), m = m + Math.imul(Yt, ue) | 0, u = (u = u + Math.imul(Yt, T) | 0) + Math.imul(ee, ue) | 0, y = y + Math.imul(ee, T) | 0, m = m + Math.imul(Lt, B) | 0, u = (u = u + Math.imul(Lt, b) | 0) + Math.imul(oe, B) | 0, y = y + Math.imul(oe, b) | 0, m = m + Math.imul(mt, $) | 0, u = (u = u + Math.imul(mt, D) | 0) + Math.imul(Et, $) | 0, y = y + Math.imul(Et, D) | 0, m = m + Math.imul(dt, q) | 0, u = (u = u + Math.imul(dt, Y) | 0) + Math.imul(yt, q) | 0, y = y + Math.imul(yt, Y) | 0, m = m + Math.imul(H, X) | 0, u = (u = u + Math.imul(H, ct) | 0) + Math.imul(J, X) | 0, y = y + Math.imul(J, ct) | 0;
|
|
2298
|
+
var zt = (j + (m = m + Math.imul(U, nt) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(U, ht) | 0) + Math.imul(V, nt) | 0)) << 13) | 0;
|
|
2299
|
+
j = ((y = y + Math.imul(V, ht) | 0) + (u >>> 13) | 0) + (zt >>> 26) | 0, zt &= 67108863, m = Math.imul(ie, ne), u = (u = Math.imul(ie, pe)) + Math.imul(ce, ne) | 0, y = Math.imul(ce, pe), m = m + Math.imul(ae, ue) | 0, u = (u = u + Math.imul(ae, T) | 0) + Math.imul(Vt, ue) | 0, y = y + Math.imul(Vt, T) | 0, m = m + Math.imul(Yt, B) | 0, u = (u = u + Math.imul(Yt, b) | 0) + Math.imul(ee, B) | 0, y = y + Math.imul(ee, b) | 0, m = m + Math.imul(Lt, $) | 0, u = (u = u + Math.imul(Lt, D) | 0) + Math.imul(oe, $) | 0, y = y + Math.imul(oe, D) | 0, m = m + Math.imul(mt, q) | 0, u = (u = u + Math.imul(mt, Y) | 0) + Math.imul(Et, q) | 0, y = y + Math.imul(Et, Y) | 0, m = m + Math.imul(dt, X) | 0, u = (u = u + Math.imul(dt, ct) | 0) + Math.imul(yt, X) | 0, y = y + Math.imul(yt, ct) | 0, m = m + Math.imul(H, nt) | 0, u = (u = u + Math.imul(H, ht) | 0) + Math.imul(J, nt) | 0, y = y + Math.imul(J, ht) | 0;
|
|
2300
|
+
var Ct = (j + (m = m + Math.imul(U, ot) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(U, ut) | 0) + Math.imul(V, ot) | 0)) << 13) | 0;
|
|
2301
|
+
j = ((y = y + Math.imul(V, ut) | 0) + (u >>> 13) | 0) + (Ct >>> 26) | 0, Ct &= 67108863, m = Math.imul(se, ne), u = (u = Math.imul(se, pe)) + Math.imul(de, ne) | 0, y = Math.imul(de, pe), m = m + Math.imul(ie, ue) | 0, u = (u = u + Math.imul(ie, T) | 0) + Math.imul(ce, ue) | 0, y = y + Math.imul(ce, T) | 0, m = m + Math.imul(ae, B) | 0, u = (u = u + Math.imul(ae, b) | 0) + Math.imul(Vt, B) | 0, y = y + Math.imul(Vt, b) | 0, m = m + Math.imul(Yt, $) | 0, u = (u = u + Math.imul(Yt, D) | 0) + Math.imul(ee, $) | 0, y = y + Math.imul(ee, D) | 0, m = m + Math.imul(Lt, q) | 0, u = (u = u + Math.imul(Lt, Y) | 0) + Math.imul(oe, q) | 0, y = y + Math.imul(oe, Y) | 0, m = m + Math.imul(mt, X) | 0, u = (u = u + Math.imul(mt, ct) | 0) + Math.imul(Et, X) | 0, y = y + Math.imul(Et, ct) | 0, m = m + Math.imul(dt, nt) | 0, u = (u = u + Math.imul(dt, ht) | 0) + Math.imul(yt, nt) | 0, y = y + Math.imul(yt, ht) | 0, m = m + Math.imul(H, ot) | 0, u = (u = u + Math.imul(H, ut) | 0) + Math.imul(J, ot) | 0, y = y + Math.imul(J, ut) | 0;
|
|
2302
|
+
var Kt = (j + (m = m + Math.imul(U, it) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(U, lt) | 0) + Math.imul(V, it) | 0)) << 13) | 0;
|
|
2303
|
+
j = ((y = y + Math.imul(V, lt) | 0) + (u >>> 13) | 0) + (Kt >>> 26) | 0, Kt &= 67108863, m = Math.imul(fe, ne), u = (u = Math.imul(fe, pe)) + Math.imul(re, ne) | 0, y = Math.imul(re, pe), m = m + Math.imul(se, ue) | 0, u = (u = u + Math.imul(se, T) | 0) + Math.imul(de, ue) | 0, y = y + Math.imul(de, T) | 0, m = m + Math.imul(ie, B) | 0, u = (u = u + Math.imul(ie, b) | 0) + Math.imul(ce, B) | 0, y = y + Math.imul(ce, b) | 0, m = m + Math.imul(ae, $) | 0, u = (u = u + Math.imul(ae, D) | 0) + Math.imul(Vt, $) | 0, y = y + Math.imul(Vt, D) | 0, m = m + Math.imul(Yt, q) | 0, u = (u = u + Math.imul(Yt, Y) | 0) + Math.imul(ee, q) | 0, y = y + Math.imul(ee, Y) | 0, m = m + Math.imul(Lt, X) | 0, u = (u = u + Math.imul(Lt, ct) | 0) + Math.imul(oe, X) | 0, y = y + Math.imul(oe, ct) | 0, m = m + Math.imul(mt, nt) | 0, u = (u = u + Math.imul(mt, ht) | 0) + Math.imul(Et, nt) | 0, y = y + Math.imul(Et, ht) | 0, m = m + Math.imul(dt, ot) | 0, u = (u = u + Math.imul(dt, ut) | 0) + Math.imul(yt, ot) | 0, y = y + Math.imul(yt, ut) | 0, m = m + Math.imul(H, it) | 0, u = (u = u + Math.imul(H, lt) | 0) + Math.imul(J, it) | 0, y = y + Math.imul(J, lt) | 0;
|
|
2304
|
+
var Qt = (j + (m = m + Math.imul(U, at) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(U, K) | 0) + Math.imul(V, at) | 0)) << 13) | 0;
|
|
2305
|
+
j = ((y = y + Math.imul(V, K) | 0) + (u >>> 13) | 0) + (Qt >>> 26) | 0, Qt &= 67108863, m = Math.imul(fe, ue), u = (u = Math.imul(fe, T)) + Math.imul(re, ue) | 0, y = Math.imul(re, T), m = m + Math.imul(se, B) | 0, u = (u = u + Math.imul(se, b) | 0) + Math.imul(de, B) | 0, y = y + Math.imul(de, b) | 0, m = m + Math.imul(ie, $) | 0, u = (u = u + Math.imul(ie, D) | 0) + Math.imul(ce, $) | 0, y = y + Math.imul(ce, D) | 0, m = m + Math.imul(ae, q) | 0, u = (u = u + Math.imul(ae, Y) | 0) + Math.imul(Vt, q) | 0, y = y + Math.imul(Vt, Y) | 0, m = m + Math.imul(Yt, X) | 0, u = (u = u + Math.imul(Yt, ct) | 0) + Math.imul(ee, X) | 0, y = y + Math.imul(ee, ct) | 0, m = m + Math.imul(Lt, nt) | 0, u = (u = u + Math.imul(Lt, ht) | 0) + Math.imul(oe, nt) | 0, y = y + Math.imul(oe, ht) | 0, m = m + Math.imul(mt, ot) | 0, u = (u = u + Math.imul(mt, ut) | 0) + Math.imul(Et, ot) | 0, y = y + Math.imul(Et, ut) | 0, m = m + Math.imul(dt, it) | 0, u = (u = u + Math.imul(dt, lt) | 0) + Math.imul(yt, it) | 0, y = y + Math.imul(yt, lt) | 0;
|
|
2306
2306
|
var Xt = (j + (m = m + Math.imul(H, at) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(H, K) | 0) + Math.imul(J, at) | 0)) << 13) | 0;
|
|
2307
|
-
j = ((y = y + Math.imul(J, K) | 0) + (u >>> 13) | 0) + (Xt >>> 26) | 0, Xt &= 67108863, m = Math.imul(fe, B), u = (u = Math.imul(fe, b)) + Math.imul(re, B) | 0, y = Math.imul(re, b), m = m + Math.imul(se,
|
|
2307
|
+
j = ((y = y + Math.imul(J, K) | 0) + (u >>> 13) | 0) + (Xt >>> 26) | 0, Xt &= 67108863, m = Math.imul(fe, B), u = (u = Math.imul(fe, b)) + Math.imul(re, B) | 0, y = Math.imul(re, b), m = m + Math.imul(se, $) | 0, u = (u = u + Math.imul(se, D) | 0) + Math.imul(de, $) | 0, y = y + Math.imul(de, D) | 0, m = m + Math.imul(ie, q) | 0, u = (u = u + Math.imul(ie, Y) | 0) + Math.imul(ce, q) | 0, y = y + Math.imul(ce, Y) | 0, m = m + Math.imul(ae, X) | 0, u = (u = u + Math.imul(ae, ct) | 0) + Math.imul(Vt, X) | 0, y = y + Math.imul(Vt, ct) | 0, m = m + Math.imul(Yt, nt) | 0, u = (u = u + Math.imul(Yt, ht) | 0) + Math.imul(ee, nt) | 0, y = y + Math.imul(ee, ht) | 0, m = m + Math.imul(Lt, ot) | 0, u = (u = u + Math.imul(Lt, ut) | 0) + Math.imul(oe, ot) | 0, y = y + Math.imul(oe, ut) | 0, m = m + Math.imul(mt, it) | 0, u = (u = u + Math.imul(mt, lt) | 0) + Math.imul(Et, it) | 0, y = y + Math.imul(Et, lt) | 0;
|
|
2308
2308
|
var St = (j + (m = m + Math.imul(dt, at) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(dt, K) | 0) + Math.imul(yt, at) | 0)) << 13) | 0;
|
|
2309
|
-
j = ((y = y + Math.imul(yt, K) | 0) + (u >>> 13) | 0) + (St >>> 26) | 0, St &= 67108863, m = Math.imul(fe,
|
|
2309
|
+
j = ((y = y + Math.imul(yt, K) | 0) + (u >>> 13) | 0) + (St >>> 26) | 0, St &= 67108863, m = Math.imul(fe, $), u = (u = Math.imul(fe, D)) + Math.imul(re, $) | 0, y = Math.imul(re, D), m = m + Math.imul(se, q) | 0, u = (u = u + Math.imul(se, Y) | 0) + Math.imul(de, q) | 0, y = y + Math.imul(de, Y) | 0, m = m + Math.imul(ie, X) | 0, u = (u = u + Math.imul(ie, ct) | 0) + Math.imul(ce, X) | 0, y = y + Math.imul(ce, ct) | 0, m = m + Math.imul(ae, nt) | 0, u = (u = u + Math.imul(ae, ht) | 0) + Math.imul(Vt, nt) | 0, y = y + Math.imul(Vt, ht) | 0, m = m + Math.imul(Yt, ot) | 0, u = (u = u + Math.imul(Yt, ut) | 0) + Math.imul(ee, ot) | 0, y = y + Math.imul(ee, ut) | 0, m = m + Math.imul(Lt, it) | 0, u = (u = u + Math.imul(Lt, lt) | 0) + Math.imul(oe, it) | 0, y = y + Math.imul(oe, lt) | 0;
|
|
2310
2310
|
var It = (j + (m = m + Math.imul(mt, at) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(mt, K) | 0) + Math.imul(Et, at) | 0)) << 13) | 0;
|
|
2311
2311
|
j = ((y = y + Math.imul(Et, K) | 0) + (u >>> 13) | 0) + (It >>> 26) | 0, It &= 67108863, m = Math.imul(fe, q), u = (u = Math.imul(fe, Y)) + Math.imul(re, q) | 0, y = Math.imul(re, Y), m = m + Math.imul(se, X) | 0, u = (u = u + Math.imul(se, ct) | 0) + Math.imul(de, X) | 0, y = y + Math.imul(de, ct) | 0, m = m + Math.imul(ie, nt) | 0, u = (u = u + Math.imul(ie, ht) | 0) + Math.imul(ce, nt) | 0, y = y + Math.imul(ce, ht) | 0, m = m + Math.imul(ae, ot) | 0, u = (u = u + Math.imul(ae, ut) | 0) + Math.imul(Vt, ot) | 0, y = y + Math.imul(Vt, ut) | 0, m = m + Math.imul(Yt, it) | 0, u = (u = u + Math.imul(Yt, lt) | 0) + Math.imul(ee, it) | 0, y = y + Math.imul(ee, lt) | 0;
|
|
2312
2312
|
var Tt = (j + (m = m + Math.imul(Lt, at) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(Lt, K) | 0) + Math.imul(oe, at) | 0)) << 13) | 0;
|
|
@@ -2317,10 +2317,10 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2317
2317
|
j = ((y = y + Math.imul(Vt, K) | 0) + (u >>> 13) | 0) + (_t >>> 26) | 0, _t &= 67108863, m = Math.imul(fe, ot), u = (u = Math.imul(fe, ut)) + Math.imul(re, ot) | 0, y = Math.imul(re, ut), m = m + Math.imul(se, it) | 0, u = (u = u + Math.imul(se, lt) | 0) + Math.imul(de, it) | 0, y = y + Math.imul(de, lt) | 0;
|
|
2318
2318
|
var jt = (j + (m = m + Math.imul(ie, at) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(ie, K) | 0) + Math.imul(ce, at) | 0)) << 13) | 0;
|
|
2319
2319
|
j = ((y = y + Math.imul(ce, K) | 0) + (u >>> 13) | 0) + (jt >>> 26) | 0, jt &= 67108863, m = Math.imul(fe, it), u = (u = Math.imul(fe, lt)) + Math.imul(re, it) | 0, y = Math.imul(re, lt);
|
|
2320
|
-
var
|
|
2321
|
-
j = ((y = y + Math.imul(de, K) | 0) + (u >>> 13) | 0) + (
|
|
2320
|
+
var $t = (j + (m = m + Math.imul(se, at) | 0) | 0) + ((8191 & (u = (u = u + Math.imul(se, K) | 0) + Math.imul(de, at) | 0)) << 13) | 0;
|
|
2321
|
+
j = ((y = y + Math.imul(de, K) | 0) + (u >>> 13) | 0) + ($t >>> 26) | 0, $t &= 67108863;
|
|
2322
2322
|
var me = (j + (m = Math.imul(fe, at)) | 0) + ((8191 & (u = (u = Math.imul(fe, K)) + Math.imul(re, at) | 0)) << 13) | 0;
|
|
2323
|
-
return j = ((y = Math.imul(re, K)) + (u >>> 13) | 0) + (me >>> 26) | 0, me &= 67108863, R[0] = Q, R[1] = st, R[2] = tt, R[3] = et, R[4] = rt, R[5] =
|
|
2323
|
+
return j = ((y = Math.imul(re, K)) + (u >>> 13) | 0) + (me >>> 26) | 0, me &= 67108863, R[0] = Q, R[1] = st, R[2] = tt, R[3] = et, R[4] = rt, R[5] = Ot, R[6] = zt, R[7] = Ct, R[8] = Kt, R[9] = Qt, R[10] = Xt, R[11] = St, R[12] = It, R[13] = Tt, R[14] = Nt, R[15] = _t, R[16] = jt, R[17] = $t, R[18] = me, j !== 0 && (R[19] = j, g.length++), g;
|
|
2324
2324
|
};
|
|
2325
2325
|
function A(f, l, g) {
|
|
2326
2326
|
return new I().mulp(f, l, g);
|
|
@@ -2335,11 +2335,11 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2335
2335
|
for (var P = 0, R = 0, j = 0; j < x.length - 1; j++) {
|
|
2336
2336
|
var Z = R;
|
|
2337
2337
|
R = 0;
|
|
2338
|
-
for (var
|
|
2338
|
+
for (var U = 67108863 & P, V = Math.min(j, y.length - 1), F = Math.max(0, j - u.length + 1); F <= V; F++) {
|
|
2339
2339
|
var H = j - F, J = (0 | u.words[H]) * (0 | y.words[F]), Rt = 67108863 & J;
|
|
2340
|
-
|
|
2340
|
+
U = 67108863 & (Rt = Rt + U | 0), R += (Z = (Z = Z + (J / 67108864 | 0) | 0) + (Rt >>> 26) | 0) >>> 26, Z &= 67108863;
|
|
2341
2341
|
}
|
|
2342
|
-
x.words[j] =
|
|
2342
|
+
x.words[j] = U, P = Z, Z = R;
|
|
2343
2343
|
}
|
|
2344
2344
|
return P !== 0 ? x.words[j] = P : x.length--, x.strip();
|
|
2345
2345
|
}(this, f, l) : A(this, f, l), g;
|
|
@@ -2354,9 +2354,9 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2354
2354
|
for (var x = 0; x < y; x++) m[x] = l[f[x]], u[x] = g[f[x]];
|
|
2355
2355
|
}, I.prototype.transform = function(f, l, g, m, u, y) {
|
|
2356
2356
|
this.permute(y, f, l, g, m, u);
|
|
2357
|
-
for (var x = 1; x < u; x <<= 1) for (var P = x << 1, R = Math.cos(2 * Math.PI / P), j = Math.sin(2 * Math.PI / P), Z = 0; Z < u; Z += P) for (var
|
|
2358
|
-
var H = g[Z + F], J = m[Z + F], Rt = g[Z + F + x], dt = m[Z + F + x], yt =
|
|
2359
|
-
dt =
|
|
2357
|
+
for (var x = 1; x < u; x <<= 1) for (var P = x << 1, R = Math.cos(2 * Math.PI / P), j = Math.sin(2 * Math.PI / P), Z = 0; Z < u; Z += P) for (var U = R, V = j, F = 0; F < x; F++) {
|
|
2358
|
+
var H = g[Z + F], J = m[Z + F], Rt = g[Z + F + x], dt = m[Z + F + x], yt = U * Rt - V * dt;
|
|
2359
|
+
dt = U * dt + V * Rt, Rt = yt, g[Z + F] = H + Rt, m[Z + F] = J + dt, g[Z + F + x] = H - Rt, m[Z + F + x] = J - dt, F !== P && (yt = R * U - j * V, V = R * V + j * U, U = yt);
|
|
2360
2360
|
}
|
|
2361
2361
|
}, I.prototype.guessLen13b = function(f, l) {
|
|
2362
2362
|
var g = 1 | Math.max(l, f), m = 1 & g, u = 0;
|
|
@@ -2381,11 +2381,11 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2381
2381
|
for (var l = new Array(f), g = 0; g < f; g++) l[g] = 0;
|
|
2382
2382
|
return l;
|
|
2383
2383
|
}, I.prototype.mulp = function(f, l, g) {
|
|
2384
|
-
var m = 2 * this.guessLen13b(f.length, l.length), u = this.makeRBT(m), y = this.stub(m), x = new Array(m), P = new Array(m), R = new Array(m), j = new Array(m), Z = new Array(m),
|
|
2385
|
-
V.length = m, this.convert13b(f.words, f.length, x, m), this.convert13b(l.words, l.length, j, m), this.transform(x, y, P, R, m, u), this.transform(j, y, Z,
|
|
2384
|
+
var m = 2 * this.guessLen13b(f.length, l.length), u = this.makeRBT(m), y = this.stub(m), x = new Array(m), P = new Array(m), R = new Array(m), j = new Array(m), Z = new Array(m), U = new Array(m), V = g.words;
|
|
2385
|
+
V.length = m, this.convert13b(f.words, f.length, x, m), this.convert13b(l.words, l.length, j, m), this.transform(x, y, P, R, m, u), this.transform(j, y, Z, U, m, u);
|
|
2386
2386
|
for (var F = 0; F < m; F++) {
|
|
2387
|
-
var H = P[F] * Z[F] - R[F] *
|
|
2388
|
-
R[F] = P[F] *
|
|
2387
|
+
var H = P[F] * Z[F] - R[F] * U[F];
|
|
2388
|
+
R[F] = P[F] * U[F] + R[F] * Z[F], P[F] = H;
|
|
2389
2389
|
}
|
|
2390
2390
|
return this.conjugate(P, R, m), this.transform(P, R, V, y, m, u), this.conjugate(V, y, m), this.normalize13b(V, m), g.negative = f.negative ^ l.negative, g.length = f.length + l.length, g.strip();
|
|
2391
2391
|
}, i.prototype.mul = function(f) {
|
|
@@ -2525,9 +2525,9 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2525
2525
|
var j = m.clone()._ishlnsubmul(u, 1, P);
|
|
2526
2526
|
j.negative === 0 && (m = j, x && (x.words[P] = 1));
|
|
2527
2527
|
for (var Z = P - 1; Z >= 0; Z--) {
|
|
2528
|
-
var
|
|
2529
|
-
for (
|
|
2530
|
-
x && (x.words[Z] =
|
|
2528
|
+
var U = 67108864 * (0 | m.words[u.length + Z]) + (0 | m.words[u.length + Z - 1]);
|
|
2529
|
+
for (U = Math.min(U / y | 0, 67108863), m._ishlnsubmul(u, U, Z); m.negative !== 0; ) U--, m.negative = 0, m._ishlnsubmul(u, 1, Z), m.isZero() || (m.negative ^= 1);
|
|
2530
|
+
x && (x.words[Z] = U);
|
|
2531
2531
|
}
|
|
2532
2532
|
return x && x.strip(), m.strip(), l !== "div" && g !== 0 && m.iushrn(g), { div: x || null, mod: m };
|
|
2533
2533
|
}, i.prototype.divmod = function(f, l, g) {
|
|
@@ -2563,7 +2563,7 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2563
2563
|
l = l.negative !== 0 ? l.umod(f) : l.clone();
|
|
2564
2564
|
for (var m = new i(1), u = new i(0), y = new i(0), x = new i(1), P = 0; l.isEven() && g.isEven(); ) l.iushrn(1), g.iushrn(1), ++P;
|
|
2565
2565
|
for (var R = g.clone(), j = l.clone(); !l.isZero(); ) {
|
|
2566
|
-
for (var Z = 0,
|
|
2566
|
+
for (var Z = 0, U = 1; !(l.words[0] & U) && Z < 26; ++Z, U <<= 1) ;
|
|
2567
2567
|
if (Z > 0) for (l.iushrn(Z); Z-- > 0; ) (m.isOdd() || u.isOdd()) && (m.iadd(R), u.isub(j)), m.iushrn(1), u.iushrn(1);
|
|
2568
2568
|
for (var V = 0, F = 1; !(g.words[0] & F) && V < 26; ++V, F <<= 1) ;
|
|
2569
2569
|
if (V > 0) for (g.iushrn(V); V-- > 0; ) (y.isOdd() || x.isOdd()) && (y.iadd(R), x.isub(j)), y.iushrn(1), x.iushrn(1);
|
|
@@ -2709,7 +2709,7 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2709
2709
|
function S() {
|
|
2710
2710
|
M.call(this, "k256", "ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f");
|
|
2711
2711
|
}
|
|
2712
|
-
function
|
|
2712
|
+
function O() {
|
|
2713
2713
|
M.call(this, "p224", "ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001");
|
|
2714
2714
|
}
|
|
2715
2715
|
function k() {
|
|
@@ -2757,7 +2757,7 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2757
2757
|
l += 977 * m, f.words[g] = 67108863 & l, l = 64 * m + (l / 67108864 | 0);
|
|
2758
2758
|
}
|
|
2759
2759
|
return f.words[f.length - 1] === 0 && (f.length--, f.words[f.length - 1] === 0 && f.length--), f;
|
|
2760
|
-
}, n(
|
|
2760
|
+
}, n(O, M), n(k, M), n(N, M), N.prototype.imulK = function(f) {
|
|
2761
2761
|
for (var l = 0, g = 0; g < f.length; g++) {
|
|
2762
2762
|
var m = 19 * (0 | f.words[g]) + l, u = 67108863 & m;
|
|
2763
2763
|
m >>>= 26, f.words[g] = u, l = m;
|
|
@@ -2767,7 +2767,7 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2767
2767
|
if (_[f]) return _[f];
|
|
2768
2768
|
var l;
|
|
2769
2769
|
if (f === "k256") l = new S();
|
|
2770
|
-
else if (f === "p224") l = new
|
|
2770
|
+
else if (f === "p224") l = new O();
|
|
2771
2771
|
else if (f === "p192") l = new k();
|
|
2772
2772
|
else {
|
|
2773
2773
|
if (f !== "p25519") throw new Error("Unknown prime " + f);
|
|
@@ -2819,11 +2819,11 @@ var rr = {}, i1 = { exports: {} };
|
|
|
2819
2819
|
r(!m.isZero());
|
|
2820
2820
|
var y = new i(1).toRed(this), x = y.redNeg(), P = this.m.subn(1).iushrn(1), R = this.m.bitLength();
|
|
2821
2821
|
for (R = new i(2 * R * R).toRed(this); this.pow(R, P).cmp(x) !== 0; ) R.redIAdd(x);
|
|
2822
|
-
for (var j = this.pow(R, m), Z = this.pow(f, m.addn(1).iushrn(1)),
|
|
2823
|
-
for (var F =
|
|
2822
|
+
for (var j = this.pow(R, m), Z = this.pow(f, m.addn(1).iushrn(1)), U = this.pow(f, m), V = u; U.cmp(y) !== 0; ) {
|
|
2823
|
+
for (var F = U, H = 0; F.cmp(y) !== 0; H++) F = F.redSqr();
|
|
2824
2824
|
r(H < V);
|
|
2825
2825
|
var J = this.pow(j, new i(1).iushln(V - H - 1));
|
|
2826
|
-
Z = Z.redMul(J), j = J.redSqr(),
|
|
2826
|
+
Z = Z.redMul(J), j = J.redSqr(), U = U.redMul(j), V = H;
|
|
2827
2827
|
}
|
|
2828
2828
|
return Z;
|
|
2829
2829
|
}, L.prototype.invm = function(f) {
|
|
@@ -3015,8 +3015,8 @@ Jr.prototype.point = function() {
|
|
|
3015
3015
|
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()));
|
|
3016
3016
|
var _ = [-3, -1, -5, -7, 0, 7, 5, 1, 3], M = ih(r[v], r[A]);
|
|
3017
3017
|
for (p = Math.max(M[0].length, p), h[v] = new Array(p), h[A] = new Array(p), a = 0; a < p; a++) {
|
|
3018
|
-
var S = 0 | M[0][a],
|
|
3019
|
-
h[v][a] = _[3 * (S + 1) + (
|
|
3018
|
+
var S = 0 | M[0][a], O = 0 | M[1][a];
|
|
3019
|
+
h[v][a] = _[3 * (S + 1) + (O + 1)], h[A][a] = 0, d[v] = I;
|
|
3020
3020
|
}
|
|
3021
3021
|
} else h[v] = Wi(r[v], c[v], this._bitLength), h[A] = Wi(r[A], c[A], this._bitLength), p = Math.max(h[v].length, p), p = Math.max(h[A].length, p);
|
|
3022
3022
|
}
|
|
@@ -3089,7 +3089,7 @@ typeof Object.create == "function" ? So.exports = function(e, t) {
|
|
|
3089
3089
|
r.prototype = t.prototype, e.prototype = new r(), e.prototype.constructor = e;
|
|
3090
3090
|
}
|
|
3091
3091
|
};
|
|
3092
|
-
var
|
|
3092
|
+
var Cs = So.exports, we = Vr, Eo = Cs, Wn = Ns, sh = rr.assert;
|
|
3093
3093
|
function ar(e) {
|
|
3094
3094
|
Wn.call(this, "short", e), this.a = new we(e.a, 16).toRed(this.red), this.b = new we(e.b, 16).toRed(this.red), this.tinv = this.two.redInvm(), this.zeroA = this.a.fromRed().cmpn(0) === 0, this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0, this.endo = this._getEndomorphism(e), this._endoWnafT1 = new Array(4), this._endoWnafT2 = new Array(4);
|
|
3095
3095
|
}
|
|
@@ -3125,10 +3125,10 @@ ar.prototype._getEndomorphism = function(e) {
|
|
|
3125
3125
|
for (var t, r, n, i, s, a, o, c, d, h = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), p = e, w = this.n.clone(), v = new we(1), A = new we(0), I = new we(0), _ = new we(1), M = 0; p.cmpn(0) !== 0; ) {
|
|
3126
3126
|
var S = w.div(p);
|
|
3127
3127
|
c = w.sub(S.mul(p)), d = I.sub(S.mul(v));
|
|
3128
|
-
var
|
|
3128
|
+
var O = _.sub(S.mul(A));
|
|
3129
3129
|
if (!n && c.cmp(h) < 0) t = o.neg(), r = v, n = c.neg(), i = d;
|
|
3130
3130
|
else if (n && ++M == 2) break;
|
|
3131
|
-
o = c, w = p, p = c, I = v, v = d, _ = A, A =
|
|
3131
|
+
o = c, w = p, p = c, I = v, v = d, _ = A, A = O;
|
|
3132
3132
|
}
|
|
3133
3133
|
s = c.neg(), a = d;
|
|
3134
3134
|
var k = n.sqr().add(i.sqr());
|
|
@@ -3339,19 +3339,19 @@ ar.prototype._getEndomorphism = function(e) {
|
|
|
3339
3339
|
}, je.prototype.isInfinity = function() {
|
|
3340
3340
|
return this.z.cmpn(0) === 0;
|
|
3341
3341
|
};
|
|
3342
|
-
var
|
|
3342
|
+
var Un = Vr, a1 = Cs, Os = Ns, ah = rr;
|
|
3343
3343
|
function qn(e) {
|
|
3344
|
-
|
|
3344
|
+
Os.call(this, "mont", e), this.a = new Un(e.a, 16).toRed(this.red), this.b = new Un(e.b, 16).toRed(this.red), this.i4 = new Un(4).toRed(this.red).redInvm(), this.two = new Un(2).toRed(this.red), this.a24 = this.i4.redMul(this.a.redAdd(this.two));
|
|
3345
3345
|
}
|
|
3346
|
-
a1(qn,
|
|
3346
|
+
a1(qn, Os);
|
|
3347
3347
|
var ch = qn;
|
|
3348
3348
|
function Te(e, t, r) {
|
|
3349
|
-
|
|
3349
|
+
Os.BasePoint.call(this, e, "projective"), t === null && r === null ? (this.x = this.curve.one, this.z = this.curve.zero) : (this.x = new Un(t, 16), this.z = new Un(r, 16), this.x.red || (this.x = this.x.toRed(this.curve.red)), this.z.red || (this.z = this.z.toRed(this.curve.red)));
|
|
3350
3350
|
}
|
|
3351
3351
|
qn.prototype.validate = function(e) {
|
|
3352
3352
|
var t = e.normalize().x, r = t.redSqr(), n = r.redMul(t).redAdd(r.redMul(this.a)).redAdd(t);
|
|
3353
3353
|
return n.redSqrt().redSqr().cmp(n) === 0;
|
|
3354
|
-
}, a1(Te,
|
|
3354
|
+
}, a1(Te, Os.BasePoint), qn.prototype.decodePoint = function(e, t) {
|
|
3355
3355
|
return this.point(ah.toArray(e, t), 1);
|
|
3356
3356
|
}, qn.prototype.point = function(e, t) {
|
|
3357
3357
|
return new Te(this, e, t);
|
|
@@ -3389,7 +3389,7 @@ qn.prototype.validate = function(e) {
|
|
|
3389
3389
|
}, Te.prototype.getX = function() {
|
|
3390
3390
|
return this.normalize(), this.x.fromRed();
|
|
3391
3391
|
};
|
|
3392
|
-
var Fr = Vr, c1 =
|
|
3392
|
+
var Fr = Vr, c1 = Cs, Bs = Ns, dh = rr.assert;
|
|
3393
3393
|
function _r(e) {
|
|
3394
3394
|
this.twisted = (0 | e.a) != 1, this.mOneA = this.twisted && (0 | e.a) == -1, this.extended = this.mOneA, Bs.call(this, "edwards", e), this.a = new Fr(e.a, 16).umod(this.red.m), this.a = this.a.toRed(this.red), this.c = new Fr(e.c, 16).toRed(this.red), this.c2 = this.c.redSqr(), this.d = new Fr(e.d, 16).toRed(this.red), this.dd = this.d.redAdd(this.d), dh(!this.twisted || this.c.fromRed().cmpn(1) === 0), this.oneC = (0 | e.c) == 1;
|
|
3395
3395
|
}
|
|
@@ -3486,7 +3486,7 @@ _r.prototype._mulA = function(e) {
|
|
|
3486
3486
|
var t = e;
|
|
3487
3487
|
t.base = Ns, t.short = oh, t.mont = ch, t.edwards = fh;
|
|
3488
3488
|
}(ya);
|
|
3489
|
-
var Ps = {}, ls = {}, Wt = {}, hh = Tn, uh =
|
|
3489
|
+
var Ps = {}, ls = {}, Wt = {}, hh = Tn, uh = Cs;
|
|
3490
3490
|
function lh(e, t) {
|
|
3491
3491
|
return (64512 & e.charCodeAt(t)) == 55296 && !(t < 0 || t + 1 >= e.length) && (64512 & e.charCodeAt(t + 1)) == 56320;
|
|
3492
3492
|
}
|
|
@@ -3660,14 +3660,14 @@ function qr() {
|
|
|
3660
3660
|
u1.call(this), this.h = [3238371032, 914150663, 812702999, 4144912697, 4290775857, 1750603025, 1694076839, 3204075428];
|
|
3661
3661
|
}
|
|
3662
3662
|
ko.inherits(qr, u1);
|
|
3663
|
-
var
|
|
3663
|
+
var Ch = qr;
|
|
3664
3664
|
qr.blockSize = 512, qr.outSize = 224, qr.hmacStrength = 192, qr.padLength = 64, qr.prototype._digest = function(e) {
|
|
3665
3665
|
return e === "hex" ? ko.toHex32(this.h.slice(0, 7), "big") : ko.split32(this.h.slice(0, 7), "big");
|
|
3666
3666
|
};
|
|
3667
|
-
var tr = Wt,
|
|
3667
|
+
var tr = Wt, Oh = ri, Bh = Tn, Ir = tr.rotr64_hi, Tr = tr.rotr64_lo, l1 = tr.shr64_hi, p1 = tr.shr64_lo, Yr = tr.sum64, Gs = tr.sum64_hi, Js = tr.sum64_lo, Ph = tr.sum64_4_hi, Lh = tr.sum64_4_lo, zh = tr.sum64_5_hi, jh = tr.sum64_5_lo, m1 = Oh.BlockHash, Uh = [1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163, 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394, 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206, 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139, 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692, 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879, 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895, 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823, 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921, 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344, 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616, 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403, 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452, 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573, 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271, 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315, 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470, 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591];
|
|
3668
3668
|
function pr() {
|
|
3669
3669
|
if (!(this instanceof pr)) return new pr();
|
|
3670
|
-
m1.call(this), this.h = [1779033703, 4089235720, 3144134277, 2227873595, 1013904242, 4271175723, 2773480762, 1595750129, 1359893119, 2917565137, 2600822924, 725511199, 528734635, 4215389547, 1541459225, 327033209], this.k =
|
|
3670
|
+
m1.call(this), this.h = [1779033703, 4089235720, 3144134277, 2227873595, 1013904242, 4271175723, 2773480762, 1595750129, 1359893119, 2917565137, 2600822924, 725511199, 528734635, 4215389547, 1541459225, 327033209], this.k = Uh, this.W = new Array(160);
|
|
3671
3671
|
}
|
|
3672
3672
|
tr.inherits(pr, m1);
|
|
3673
3673
|
var b1 = pr;
|
|
@@ -3675,7 +3675,7 @@ function qh(e, t, r, n, i) {
|
|
|
3675
3675
|
var s = e & r ^ ~e & i;
|
|
3676
3676
|
return s < 0 && (s += 4294967296), s;
|
|
3677
3677
|
}
|
|
3678
|
-
function
|
|
3678
|
+
function $h(e, t, r, n, i, s) {
|
|
3679
3679
|
var a = t & n ^ ~t & s;
|
|
3680
3680
|
return a < 0 && (a += 4294967296), a;
|
|
3681
3681
|
}
|
|
@@ -3729,8 +3729,8 @@ pr.blockSize = 1024, pr.outSize = 512, pr.hmacStrength = 192, pr.padLength = 128
|
|
|
3729
3729
|
this._prepareBlock(e, t);
|
|
3730
3730
|
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], p = this.h[8], w = this.h[9], v = this.h[10], A = this.h[11], I = this.h[12], _ = this.h[13], M = this.h[14], S = this.h[15];
|
|
3731
3731
|
Bh(this.k.length === r.length);
|
|
3732
|
-
for (var
|
|
3733
|
-
var k = M, N = S, L = Vh(p, w), z = Kh(p, w), f = qh(p, w, v, A, I), l =
|
|
3732
|
+
for (var O = 0; O < r.length; O += 2) {
|
|
3733
|
+
var k = M, N = S, L = Vh(p, w), z = Kh(p, w), f = qh(p, w, v, A, I), l = $h(p, w, v, A, I, _), g = this.k[O], m = this.k[O + 1], u = r[O], y = r[O + 1], x = zh(k, N, L, z, f, l, g, m, u, y), P = jh(k, N, L, z, f, l, g, m, u, y);
|
|
3734
3734
|
k = Fh(n, i), N = Zh(n, i), L = Hh(n, i, s, a, o), z = Dh(n, i, s, a, o, c);
|
|
3735
3735
|
var R = Gs(k, N, L, z), j = Js(k, N, L, z);
|
|
3736
3736
|
M = I, S = _, I = v, _ = A, v = p, A = w, p = Gs(d, h, x, P), w = Js(h, h, x, P), d = o, h = c, o = s, c = a, s = n, a = i, n = Gs(x, P, R, j), i = Js(x, P, R, j);
|
|
@@ -3740,15 +3740,15 @@ pr.blockSize = 1024, pr.outSize = 512, pr.hmacStrength = 192, pr.padLength = 128
|
|
|
3740
3740
|
return e === "hex" ? tr.toHex32(this.h, "big") : tr.split32(this.h, "big");
|
|
3741
3741
|
};
|
|
3742
3742
|
var Mo = Wt, y1 = b1;
|
|
3743
|
-
function
|
|
3744
|
-
if (!(this instanceof
|
|
3743
|
+
function $r() {
|
|
3744
|
+
if (!(this instanceof $r)) return new $r();
|
|
3745
3745
|
y1.call(this), this.h = [3418070365, 3238371032, 1654270250, 914150663, 2438529370, 812702999, 355462360, 4144912697, 1731405415, 4290775857, 2394180231, 1750603025, 3675008525, 1694076839, 1203062813, 3204075428];
|
|
3746
3746
|
}
|
|
3747
|
-
Mo.inherits(
|
|
3748
|
-
var Jh =
|
|
3749
|
-
|
|
3747
|
+
Mo.inherits($r, y1);
|
|
3748
|
+
var Jh = $r;
|
|
3749
|
+
$r.blockSize = 1024, $r.outSize = 384, $r.hmacStrength = 192, $r.padLength = 128, $r.prototype._digest = function(e) {
|
|
3750
3750
|
return e === "hex" ? Mo.toHex32(this.h.slice(0, 12), "big") : Mo.split32(this.h.slice(0, 12), "big");
|
|
3751
|
-
}, Bn.sha1 = wh, Bn.sha224 =
|
|
3751
|
+
}, Bn.sha1 = wh, Bn.sha224 = Ch, Bn.sha256 = h1, Bn.sha384 = Jh, Bn.sha512 = b1;
|
|
3752
3752
|
var g1 = {}, wn = Wt, Xh = ri, Gi = wn.rotl32, n0 = wn.sum32, ai = wn.sum32_3, i0 = wn.sum32_4, v1 = Xh.BlockHash;
|
|
3753
3753
|
function Ar() {
|
|
3754
3754
|
if (!(this instanceof Ar)) return new Ar();
|
|
@@ -4005,7 +4005,7 @@ cr.prototype.keyPair = function(e) {
|
|
|
4005
4005
|
}
|
|
4006
4006
|
throw new Error("Unable to find valid recovery factor");
|
|
4007
4007
|
};
|
|
4008
|
-
var xi = rr, f0 = xi.assert, h0 = xi.parseBytes,
|
|
4008
|
+
var xi = rr, f0 = xi.assert, h0 = xi.parseBytes, Cn = xi.cachedProperty;
|
|
4009
4009
|
function Ne(e, t) {
|
|
4010
4010
|
this.eddsa = e, this._secret = h0(t.secret), e.isPoint(t.pub) ? this._pub = t.pub : this._pubBytes = h0(t.pub);
|
|
4011
4011
|
}
|
|
@@ -4015,18 +4015,18 @@ Ne.fromPublic = function(e, t) {
|
|
|
4015
4015
|
return t instanceof Ne ? t : new Ne(e, { secret: t });
|
|
4016
4016
|
}, Ne.prototype.secret = function() {
|
|
4017
4017
|
return this._secret;
|
|
4018
|
-
},
|
|
4018
|
+
}, Cn(Ne, "pubBytes", function() {
|
|
4019
4019
|
return this.eddsa.encodePoint(this.pub());
|
|
4020
|
-
}),
|
|
4020
|
+
}), Cn(Ne, "pub", function() {
|
|
4021
4021
|
return this._pubBytes ? this.eddsa.decodePoint(this._pubBytes) : this.eddsa.g.mul(this.priv());
|
|
4022
|
-
}),
|
|
4022
|
+
}), Cn(Ne, "privBytes", function() {
|
|
4023
4023
|
var e = this.eddsa, t = this.hash(), r = e.encodingLength - 1, n = t.slice(0, e.encodingLength);
|
|
4024
4024
|
return n[0] &= 248, n[r] &= 127, n[r] |= 64, n;
|
|
4025
|
-
}),
|
|
4025
|
+
}), Cn(Ne, "priv", function() {
|
|
4026
4026
|
return this.eddsa.decodeInt(this.privBytes());
|
|
4027
|
-
}),
|
|
4027
|
+
}), Cn(Ne, "hash", function() {
|
|
4028
4028
|
return this.eddsa.hash().update(this.secret()).digest();
|
|
4029
|
-
}),
|
|
4029
|
+
}), Cn(Ne, "messagePrefix", function() {
|
|
4030
4030
|
return this.hash().slice(this.eddsa.encodingLength);
|
|
4031
4031
|
}), Ne.prototype.sign = function(e) {
|
|
4032
4032
|
return f0(this._secret, "KeyPair can only verify"), this.eddsa.sign(e, this);
|
|
@@ -4054,7 +4054,7 @@ Xi(ln, "S", function() {
|
|
|
4054
4054
|
}, ln.prototype.toHex = function() {
|
|
4055
4055
|
return Ls.encode(this.toBytes(), "hex").toUpperCase();
|
|
4056
4056
|
};
|
|
4057
|
-
var _u = ln, xu = ls, Au = Ps,
|
|
4057
|
+
var _u = ln, xu = ls, Au = Ps, $n = rr, Su = $n.assert, l0 = $n.parseBytes, p0 = gu, m0 = _u;
|
|
4058
4058
|
function Je(e) {
|
|
4059
4059
|
if (Su(e === "ed25519", "only tested with ed25519 so far"), !(this instanceof Je)) return new Je(e);
|
|
4060
4060
|
e = Au[e].curve, this.curve = e, this.g = e.g, this.g.precompute(e.n.bitLength() + 1), this.pointClass = e.point().constructor, this.encodingLength = Math.ceil(e.n.bitLength() / 8), this.hash = xu.sha512;
|
|
@@ -4070,7 +4070,7 @@ Je.prototype.sign = function(e, t) {
|
|
|
4070
4070
|
return t.R().add(n.pub().mul(i)).eq(s);
|
|
4071
4071
|
}, Je.prototype.hashInt = function() {
|
|
4072
4072
|
for (var e = this.hash(), t = 0; t < arguments.length; t++) e.update(arguments[t]);
|
|
4073
|
-
return
|
|
4073
|
+
return $n.intFromLE(e.digest()).umod(this.curve.n);
|
|
4074
4074
|
}, Je.prototype.keyFromPublic = function(e) {
|
|
4075
4075
|
return p0.fromPublic(this, e);
|
|
4076
4076
|
}, Je.prototype.keyFromSecret = function(e) {
|
|
@@ -4081,12 +4081,12 @@ Je.prototype.sign = function(e, t) {
|
|
|
4081
4081
|
var t = e.getY().toArray("le", this.encodingLength);
|
|
4082
4082
|
return t[this.encodingLength - 1] |= e.getX().isOdd() ? 128 : 0, t;
|
|
4083
4083
|
}, Je.prototype.decodePoint = function(e) {
|
|
4084
|
-
var t = (e =
|
|
4084
|
+
var t = (e = $n.parseBytes(e)).length - 1, r = e.slice(0, t).concat(-129 & e[t]), n = !!(128 & e[t]), i = $n.intFromLE(r);
|
|
4085
4085
|
return this.curve.pointFromY(i, n);
|
|
4086
4086
|
}, Je.prototype.encodeInt = function(e) {
|
|
4087
4087
|
return e.toArray("le", this.encodingLength);
|
|
4088
4088
|
}, Je.prototype.decodeInt = function(e) {
|
|
4089
|
-
return
|
|
4089
|
+
return $n.intFromLE(e);
|
|
4090
4090
|
}, Je.prototype.isPoint = function(e) {
|
|
4091
4091
|
return e instanceof this.pointClass;
|
|
4092
4092
|
}, function(e) {
|
|
@@ -4156,7 +4156,7 @@ class zs {
|
|
|
4156
4156
|
}, t.asEIP1193Provider = void 0, t;
|
|
4157
4157
|
}
|
|
4158
4158
|
}
|
|
4159
|
-
const ku = 4001, Mu = 4100, Iu = 4200, Tu = 4900, Ru = 4901, Ro = -32700, No = -32600,
|
|
4159
|
+
const ku = 4001, Mu = 4100, Iu = 4200, Tu = 4900, Ru = 4901, Ro = -32700, No = -32600, Co = -32601, Oo = -32602, Bo = -32603, Po = -32e3, Lo = -32001, zo = -32002, jo = -32003, Uo = -32004, qo = -32005, $o = -32006;
|
|
4160
4160
|
class Le extends Error {
|
|
4161
4161
|
get innerError() {
|
|
4162
4162
|
return this.cause instanceof vi ? this.cause.errors : this.cause;
|
|
@@ -4196,12 +4196,12 @@ class Nu extends Le {
|
|
|
4196
4196
|
super("Invalid Private Key, Not a valid string or uint8Array"), this.code = 702;
|
|
4197
4197
|
}
|
|
4198
4198
|
}
|
|
4199
|
-
class
|
|
4199
|
+
class Cu extends Le {
|
|
4200
4200
|
constructor(t) {
|
|
4201
4201
|
super(`"${t}"`), this.code = 802;
|
|
4202
4202
|
}
|
|
4203
4203
|
}
|
|
4204
|
-
class
|
|
4204
|
+
class $i extends Le {
|
|
4205
4205
|
constructor(t, r) {
|
|
4206
4206
|
super(t), this.code = 500, r && (this.errorCode = r.code, this.errorReason = r.reason);
|
|
4207
4207
|
}
|
|
@@ -4209,22 +4209,22 @@ class Ui extends Le {
|
|
|
4209
4209
|
return Object.assign(Object.assign({}, super.toJSON()), { errorCode: this.errorCode, errorReason: this.errorReason });
|
|
4210
4210
|
}
|
|
4211
4211
|
}
|
|
4212
|
-
class Ho extends
|
|
4212
|
+
class Ho extends $i {
|
|
4213
4213
|
constructor(t) {
|
|
4214
4214
|
super("Connection not open", t), this.code = 503;
|
|
4215
4215
|
}
|
|
4216
4216
|
}
|
|
4217
|
-
class
|
|
4217
|
+
class Ou extends $i {
|
|
4218
4218
|
constructor(t) {
|
|
4219
4219
|
super(`Maximum number of reconnect attempts reached! (${t})`), this.code = 505;
|
|
4220
4220
|
}
|
|
4221
4221
|
}
|
|
4222
|
-
class Bu extends
|
|
4222
|
+
class Bu extends $i {
|
|
4223
4223
|
constructor() {
|
|
4224
4224
|
super("CONNECTION ERROR: Provider started to reconnect before the response got received!"), this.code = 506;
|
|
4225
4225
|
}
|
|
4226
4226
|
}
|
|
4227
|
-
class Pu extends
|
|
4227
|
+
class Pu extends $i {
|
|
4228
4228
|
constructor(t) {
|
|
4229
4229
|
super(`Request already sent with following id: ${t}`), this.code = 507;
|
|
4230
4230
|
}
|
|
@@ -4278,13 +4278,13 @@ class va extends Le {
|
|
|
4278
4278
|
return Object.assign(Object.assign({}, super.toJSON()), { data: this.data, request: this.request, statusCode: this.statusCode });
|
|
4279
4279
|
}
|
|
4280
4280
|
}
|
|
4281
|
-
class
|
|
4281
|
+
class Uu extends va {
|
|
4282
4282
|
constructor(t, r) {
|
|
4283
4283
|
let n;
|
|
4284
4284
|
super(t, void 0, r), this.code = 101, "error" in t ? n = t.error : t instanceof Array && (n = t.map((i) => i.error)), Array.isArray(n) ? this.cause = new vi(n) : this.cause = n;
|
|
4285
4285
|
}
|
|
4286
4286
|
}
|
|
4287
|
-
const x1 = "An Rpc error has occured with a code of *code*", De = { [Ro]: { message: "Parse error", description: "Invalid JSON" }, [No]: { message: "Invalid request", description: "JSON is not a valid request object " }, [
|
|
4287
|
+
const x1 = "An Rpc error has occured with a code of *code*", De = { [Ro]: { message: "Parse error", description: "Invalid JSON" }, [No]: { message: "Invalid request", description: "JSON is not a valid request object " }, [Co]: { message: "Method not found", description: "Method does not exist " }, [Oo]: { message: "Invalid params", description: "Invalid method parameters" }, [Bo]: { message: "Internal error", description: "Internal JSON-RPC error" }, [Po]: { message: "Invalid input", description: "Missing or invalid parameters" }, [Lo]: { message: "Resource not found", description: "Requested resource not found" }, [zo]: { message: "Resource unavailable", description: "Requested resource not available" }, [jo]: { message: "Transaction rejected", description: "Transaction creation failed" }, [Uo]: { message: "Method not supported", description: "Method is not implemented" }, [qo]: { message: "Limit exceeded", description: "Request exceeds defined limit" }, [$o]: { message: "JSON-RPC version not supported", description: "Version of JSON-RPC protocol is not supported" }, [ku]: { name: "User Rejected Request", message: "The user rejected the request." }, [Mu]: { name: "Unauthorized", message: "The requested method and/or account has not been authorized by the user." }, [Iu]: { name: "Unsupported Method", message: "The Provider does not support the requested method." }, [Tu]: { name: "Disconnected", message: "The Provider is disconnected from all chains." }, [Ru]: { name: "Chain Disconnected", message: "The Provider is not connected to the requested chain." }, "0-999": { name: "", message: "Not used." }, 1e3: { name: "Normal Closure", message: "The connection successfully completed the purpose for which it was created." }, 1001: { name: "Going Away", message: "The endpoint is going away, either because of a server failure or because the browser is navigating away from the page that opened the connection." }, 1002: { name: "Protocol error", message: "The endpoint is terminating the connection due to a protocol error." }, 1003: { name: "Unsupported Data", message: "The connection is being terminated because the endpoint received data of a type it cannot accept. (For example, a text-only endpoint received binary data.)" }, 1004: { name: "Reserved", message: "Reserved. A meaning might be defined in the future." }, 1005: { name: "No Status Rcvd", message: "Reserved. Indicates that no status code was provided even though one was expected." }, 1006: { name: "Abnormal Closure", message: "Reserved. Indicates that a connection was closed abnormally (that is, with no close frame being sent) when a status code is expected." }, 1007: { name: "Invalid frame payload data", message: "The endpoint is terminating the connection because a message was received that contained inconsistent data (e.g., non-UTF-8 data within a text message)." }, 1008: { name: "Policy Violation", message: "The endpoint is terminating the connection because it received a message that violates its policy. This is a generic status code, used when codes 1003 and 1009 are not suitable." }, 1009: { name: "Message Too Big", message: "The endpoint is terminating the connection because a data frame was received that is too large." }, 1010: { name: "Mandatory Ext.", message: "The client is terminating the connection because it expected the server to negotiate one or more extension, but the server didn't." }, 1011: { name: "Internal Error", message: "The server is terminating the connection because it encountered an unexpected condition that prevented it from fulfilling the request." }, 1012: { name: "Service Restart", message: "The server is terminating the connection because it is restarting." }, 1013: { name: "Try Again Later", message: "The server is terminating the connection due to a temporary condition, e.g. it is overloaded and is casting off some of its clients." }, 1014: { name: "Bad Gateway", message: "The server was acting as a gateway or proxy and received an invalid response from the upstream server. This is similar to 502 HTTP Status Code." }, 1015: { name: "TLS handshake", message: "Reserved. Indicates that the connection was closed due to a failure to perform a TLS handshake (e.g., the server certificate can't be verified)." }, "1016-2999": { name: "", message: "For definition by future revisions of the WebSocket Protocol specification, and for definition by extension specifications." }, "3000-3999": { name: "", message: "For use by libraries, frameworks, and applications. These status codes are registered directly with IANA. The interpretation of these codes is undefined by the WebSocket protocol." }, "4000-4999": { name: "", message: "For private use, and thus can't be registered. Such codes can be used by prior agreements between WebSocket applications. The interpretation of these codes is undefined by the WebSocket protocol." } };
|
|
4288
4288
|
class ir extends Le {
|
|
4289
4289
|
constructor(t, r) {
|
|
4290
4290
|
super(r ?? x1.replace("*code*", t.error.code.toString())), this.code = t.error.code, this.id = t.id, this.jsonrpc = t.jsonrpc, this.jsonRpcError = t.error;
|
|
@@ -4314,13 +4314,13 @@ sr.set(Ro, { error: class extends ir {
|
|
|
4314
4314
|
constructor(e) {
|
|
4315
4315
|
super(e, De[-32600].message), this.code = No;
|
|
4316
4316
|
}
|
|
4317
|
-
} }), sr.set(
|
|
4317
|
+
} }), sr.set(Co, { error: class extends ir {
|
|
4318
4318
|
constructor(e) {
|
|
4319
|
-
super(e, De[-32601].message), this.code =
|
|
4319
|
+
super(e, De[-32601].message), this.code = Co;
|
|
4320
4320
|
}
|
|
4321
|
-
} }), sr.set(
|
|
4321
|
+
} }), sr.set(Oo, { error: class extends ir {
|
|
4322
4322
|
constructor(e) {
|
|
4323
|
-
super(e, De[-32602].message), this.code =
|
|
4323
|
+
super(e, De[-32602].message), this.code = Oo;
|
|
4324
4324
|
}
|
|
4325
4325
|
} }), sr.set(Bo, { error: class extends ir {
|
|
4326
4326
|
constructor(e) {
|
|
@@ -4330,9 +4330,9 @@ sr.set(Ro, { error: class extends ir {
|
|
|
4330
4330
|
constructor(e) {
|
|
4331
4331
|
super(e, De[-32e3].message), this.code = Po;
|
|
4332
4332
|
}
|
|
4333
|
-
} }), sr.set(
|
|
4333
|
+
} }), sr.set(Uo, { error: class extends ir {
|
|
4334
4334
|
constructor(e) {
|
|
4335
|
-
super(e, De[-32004].message), this.code =
|
|
4335
|
+
super(e, De[-32004].message), this.code = Uo;
|
|
4336
4336
|
}
|
|
4337
4337
|
} }), sr.set(zo, { error: class extends ir {
|
|
4338
4338
|
constructor(e) {
|
|
@@ -4346,16 +4346,16 @@ sr.set(Ro, { error: class extends ir {
|
|
|
4346
4346
|
constructor(e) {
|
|
4347
4347
|
super(e, De[-32001].message), this.code = Lo;
|
|
4348
4348
|
}
|
|
4349
|
-
} }), sr.set(
|
|
4349
|
+
} }), sr.set($o, { error: class extends ir {
|
|
4350
4350
|
constructor(e) {
|
|
4351
|
-
super(e, De[-32006].message), this.code =
|
|
4351
|
+
super(e, De[-32006].message), this.code = $o;
|
|
4352
4352
|
}
|
|
4353
4353
|
} }), sr.set(qo, { error: class extends ir {
|
|
4354
4354
|
constructor(e) {
|
|
4355
4355
|
super(e, De[-32005].message), this.code = qo;
|
|
4356
4356
|
}
|
|
4357
4357
|
} });
|
|
4358
|
-
class
|
|
4358
|
+
class $u extends Le {
|
|
4359
4359
|
constructor(t) {
|
|
4360
4360
|
super(`Format for the type ${t} is unsupported`), this.type = t, this.code = 1200;
|
|
4361
4361
|
}
|
|
@@ -4547,7 +4547,7 @@ var te, Zo;
|
|
|
4547
4547
|
})(te || (te = {})), function(e) {
|
|
4548
4548
|
e.mergeShapes = (t, r) => ({ ...t, ...r });
|
|
4549
4549
|
}(Zo || (Zo = {}));
|
|
4550
|
-
const bt = te.arrayToEnum(["string", "nan", "number", "integer", "float", "boolean", "date", "bigint", "symbol", "function", "undefined", "null", "array", "object", "unknown", "promise", "void", "never", "map", "set"]),
|
|
4550
|
+
const bt = te.arrayToEnum(["string", "nan", "number", "integer", "float", "boolean", "date", "bigint", "symbol", "function", "undefined", "null", "array", "object", "unknown", "promise", "void", "never", "map", "set"]), Ur = (e) => {
|
|
4551
4551
|
switch (typeof e) {
|
|
4552
4552
|
case "undefined":
|
|
4553
4553
|
return bt.undefined;
|
|
@@ -4738,7 +4738,7 @@ var vt;
|
|
|
4738
4738
|
(function(e) {
|
|
4739
4739
|
e.errToObj = (t) => typeof t == "string" ? { message: t } : t || {}, e.toString = (t) => typeof t == "string" ? t : t == null ? void 0 : t.message;
|
|
4740
4740
|
})(vt || (vt = {}));
|
|
4741
|
-
class
|
|
4741
|
+
class Cr {
|
|
4742
4742
|
constructor(t, r, n, i) {
|
|
4743
4743
|
this._cachedPath = [], this.parent = t, this.data = r, this._path = n, this._key = i;
|
|
4744
4744
|
}
|
|
@@ -4769,13 +4769,13 @@ class qt {
|
|
|
4769
4769
|
return this._def.description;
|
|
4770
4770
|
}
|
|
4771
4771
|
_getType(t) {
|
|
4772
|
-
return
|
|
4772
|
+
return Ur(t.data);
|
|
4773
4773
|
}
|
|
4774
4774
|
_getOrReturnCtx(t, r) {
|
|
4775
|
-
return r || { common: t.parent.common, data: t.data, parsedType:
|
|
4775
|
+
return r || { common: t.parent.common, data: t.data, parsedType: Ur(t.data), schemaErrorMap: this._def.errorMap, path: t.path, parent: t.parent };
|
|
4776
4776
|
}
|
|
4777
4777
|
_processInputParams(t) {
|
|
4778
|
-
return { status: new Ze(), ctx: { common: t.parent.common, data: t.data, parsedType:
|
|
4778
|
+
return { status: new Ze(), ctx: { common: t.parent.common, data: t.data, parsedType: Ur(t.data), schemaErrorMap: this._def.errorMap, path: t.path, parent: t.parent } };
|
|
4779
4779
|
}
|
|
4780
4780
|
_parseSync(t) {
|
|
4781
4781
|
const r = this._parse(t);
|
|
@@ -4792,12 +4792,12 @@ class qt {
|
|
|
4792
4792
|
throw n.error;
|
|
4793
4793
|
}
|
|
4794
4794
|
safeParse(t, r) {
|
|
4795
|
-
const n = { common: { issues: [], async: (r == null ? void 0 : r.async) ?? !1, contextualErrorMap: r == null ? void 0 : r.errorMap }, path: (r == null ? void 0 : r.path) || [], schemaErrorMap: this._def.errorMap, parent: null, data: t, parsedType:
|
|
4795
|
+
const n = { common: { issues: [], async: (r == null ? void 0 : r.async) ?? !1, contextualErrorMap: r == null ? void 0 : r.errorMap }, path: (r == null ? void 0 : r.path) || [], schemaErrorMap: this._def.errorMap, parent: null, data: t, parsedType: Ur(t) }, i = this._parseSync({ data: t, path: n.path, parent: n });
|
|
4796
4796
|
return M0(n, i);
|
|
4797
4797
|
}
|
|
4798
4798
|
"~validate"(t) {
|
|
4799
4799
|
var n, i;
|
|
4800
|
-
const r = { common: { issues: [], async: !!this["~standard"].async }, path: [], schemaErrorMap: this._def.errorMap, parent: null, data: t, parsedType:
|
|
4800
|
+
const r = { common: { issues: [], async: !!this["~standard"].async }, path: [], schemaErrorMap: this._def.errorMap, parent: null, data: t, parsedType: Ur(t) };
|
|
4801
4801
|
if (!this["~standard"].async) try {
|
|
4802
4802
|
const s = this._parseSync({ data: t, path: [], parent: r });
|
|
4803
4803
|
return An(s) ? { value: s.value } : { issues: r.common.issues };
|
|
@@ -4812,7 +4812,7 @@ class qt {
|
|
|
4812
4812
|
throw n.error;
|
|
4813
4813
|
}
|
|
4814
4814
|
async safeParseAsync(t, r) {
|
|
4815
|
-
const n = { common: { issues: [], contextualErrorMap: r == null ? void 0 : r.errorMap, async: !0 }, path: (r == null ? void 0 : r.path) || [], schemaErrorMap: this._def.errorMap, parent: null, data: t, parsedType:
|
|
4815
|
+
const n = { common: { issues: [], contextualErrorMap: r == null ? void 0 : r.errorMap, async: !0 }, path: (r == null ? void 0 : r.path) || [], schemaErrorMap: this._def.errorMap, parent: null, data: t, parsedType: Ur(t) }, i = this._parse({ data: t, path: n.path, parent: n }), s = await (Si(i) ? i : Promise.resolve(i));
|
|
4816
4816
|
return M0(n, s);
|
|
4817
4817
|
}
|
|
4818
4818
|
refine(t, r) {
|
|
@@ -4860,7 +4860,7 @@ class qt {
|
|
|
4860
4860
|
}
|
|
4861
4861
|
default(t) {
|
|
4862
4862
|
const r = typeof t == "function" ? t : () => t;
|
|
4863
|
-
return new
|
|
4863
|
+
return new Oi({ ...Pt(this._def), innerType: this, defaultValue: r, typeName: Mt.ZodDefault });
|
|
4864
4864
|
}
|
|
4865
4865
|
brand() {
|
|
4866
4866
|
return new Sa({ typeName: Mt.ZodBranded, type: this, ...Pt(this._def) });
|
|
@@ -4892,7 +4892,7 @@ function N1(e) {
|
|
|
4892
4892
|
let t = "[0-5]\\d";
|
|
4893
4893
|
return e.precision ? t = `${t}\\.\\d{${e.precision}}` : e.precision == null && (t = `${t}(\\.\\d+)?`), `([01]\\d|2[0-3]):[0-5]\\d(:${t})${e.precision ? "+" : "?"}`;
|
|
4894
4894
|
}
|
|
4895
|
-
function
|
|
4895
|
+
function C1(e) {
|
|
4896
4896
|
let t = `${R1}T${N1(e)}`;
|
|
4897
4897
|
const r = [];
|
|
4898
4898
|
return r.push(e.local ? "Z?" : "Z"), e.offset && r.push("([+-]\\d{2}:?\\d{2})"), t = `${t}(${r.join("|")})`, new RegExp(`^${t}$`);
|
|
@@ -4939,7 +4939,7 @@ class br extends qt {
|
|
|
4939
4939
|
} catch {
|
|
4940
4940
|
n = this._getOrReturnCtx(t, n), ft(n, { validation: "url", code: G.invalid_string, message: i.message }), r.dirty();
|
|
4941
4941
|
}
|
|
4942
|
-
else i.kind === "regex" ? (i.regex.lastIndex = 0, i.regex.test(t.data) || (n = this._getOrReturnCtx(t, n), ft(n, { validation: "regex", code: G.invalid_string, message: i.message }), r.dirty())) : i.kind === "trim" ? t.data = t.data.trim() : i.kind === "includes" ? t.data.includes(i.value, i.position) || (n = this._getOrReturnCtx(t, n), ft(n, { code: G.invalid_string, validation: { includes: i.value, position: i.position }, message: i.message }), r.dirty()) : i.kind === "toLowerCase" ? t.data = t.data.toLowerCase() : i.kind === "toUpperCase" ? t.data = t.data.toUpperCase() : i.kind === "startsWith" ? t.data.startsWith(i.value) || (n = this._getOrReturnCtx(t, n), ft(n, { code: G.invalid_string, validation: { startsWith: i.value }, message: i.message }), r.dirty()) : i.kind === "endsWith" ? t.data.endsWith(i.value) || (n = this._getOrReturnCtx(t, n), ft(n, { code: G.invalid_string, validation: { endsWith: i.value }, message: i.message }), r.dirty()) : i.kind === "datetime" ?
|
|
4942
|
+
else i.kind === "regex" ? (i.regex.lastIndex = 0, i.regex.test(t.data) || (n = this._getOrReturnCtx(t, n), ft(n, { validation: "regex", code: G.invalid_string, message: i.message }), r.dirty())) : i.kind === "trim" ? t.data = t.data.trim() : i.kind === "includes" ? t.data.includes(i.value, i.position) || (n = this._getOrReturnCtx(t, n), ft(n, { code: G.invalid_string, validation: { includes: i.value, position: i.position }, message: i.message }), r.dirty()) : i.kind === "toLowerCase" ? t.data = t.data.toLowerCase() : i.kind === "toUpperCase" ? t.data = t.data.toUpperCase() : i.kind === "startsWith" ? t.data.startsWith(i.value) || (n = this._getOrReturnCtx(t, n), ft(n, { code: G.invalid_string, validation: { startsWith: i.value }, message: i.message }), r.dirty()) : i.kind === "endsWith" ? t.data.endsWith(i.value) || (n = this._getOrReturnCtx(t, n), ft(n, { code: G.invalid_string, validation: { endsWith: i.value }, message: i.message }), r.dirty()) : i.kind === "datetime" ? C1(i).test(t.data) || (n = this._getOrReturnCtx(t, n), ft(n, { code: G.invalid_string, validation: "datetime", message: i.message }), r.dirty()) : i.kind === "date" ? u2.test(t.data) || (n = this._getOrReturnCtx(t, n), ft(n, { code: G.invalid_string, validation: "date", message: i.message }), r.dirty()) : i.kind === "time" ? new RegExp(`^${N1(i)}$`).test(t.data) || (n = this._getOrReturnCtx(t, n), ft(n, { code: G.invalid_string, validation: "time", message: i.message }), r.dirty()) : i.kind === "duration" ? i2.test(t.data) || (n = this._getOrReturnCtx(t, n), ft(n, { validation: "duration", code: G.invalid_string, message: i.message }), r.dirty()) : i.kind === "ip" ? l2(t.data, i.version) || (n = this._getOrReturnCtx(t, n), ft(n, { validation: "ip", code: G.invalid_string, message: i.message }), r.dirty()) : i.kind === "jwt" ? p2(t.data, i.alg) || (n = this._getOrReturnCtx(t, n), ft(n, { validation: "jwt", code: G.invalid_string, message: i.message }), r.dirty()) : i.kind === "cidr" ? m2(t.data, i.version) || (n = this._getOrReturnCtx(t, n), ft(n, { validation: "cidr", code: G.invalid_string, message: i.message }), r.dirty()) : i.kind === "base64" ? f2.test(t.data) || (n = this._getOrReturnCtx(t, n), ft(n, { validation: "base64", code: G.invalid_string, message: i.message }), r.dirty()) : i.kind === "base64url" ? h2.test(t.data) || (n = this._getOrReturnCtx(t, n), ft(n, { validation: "base64url", code: G.invalid_string, message: i.message }), r.dirty()) : te.assertNever(i);
|
|
4943
4943
|
return { status: r.value, value: t.data };
|
|
4944
4944
|
}
|
|
4945
4945
|
_regex(t, r, n) {
|
|
@@ -5357,8 +5357,8 @@ class gr extends qt {
|
|
|
5357
5357
|
const a = r.data.length > i.exactLength.value, o = r.data.length < i.exactLength.value;
|
|
5358
5358
|
(a || o) && (ft(r, { code: a ? G.too_big : G.too_small, minimum: o ? i.exactLength.value : void 0, maximum: a ? i.exactLength.value : void 0, type: "array", inclusive: !0, exact: !0, message: i.exactLength.message }), n.dirty());
|
|
5359
5359
|
}
|
|
5360
|
-
if (i.minLength !== null && r.data.length < i.minLength.value && (ft(r, { code: G.too_small, minimum: i.minLength.value, type: "array", inclusive: !0, exact: !1, message: i.minLength.message }), n.dirty()), i.maxLength !== null && r.data.length > i.maxLength.value && (ft(r, { code: G.too_big, maximum: i.maxLength.value, type: "array", inclusive: !0, exact: !1, message: i.maxLength.message }), n.dirty()), r.common.async) return Promise.all([...r.data].map((a, o) => i.type._parseAsync(new
|
|
5361
|
-
const s = [...r.data].map((a, o) => i.type._parseSync(new
|
|
5360
|
+
if (i.minLength !== null && r.data.length < i.minLength.value && (ft(r, { code: G.too_small, minimum: i.minLength.value, type: "array", inclusive: !0, exact: !1, message: i.minLength.message }), n.dirty()), i.maxLength !== null && r.data.length > i.maxLength.value && (ft(r, { code: G.too_big, maximum: i.maxLength.value, type: "array", inclusive: !0, exact: !1, message: i.maxLength.message }), n.dirty()), r.common.async) return Promise.all([...r.data].map((a, o) => i.type._parseAsync(new Cr(r, a, r.path, o)))).then((a) => Ze.mergeArray(n, a));
|
|
5361
|
+
const s = [...r.data].map((a, o) => i.type._parseSync(new Cr(r, a, r.path, o)));
|
|
5362
5362
|
return Ze.mergeArray(n, s);
|
|
5363
5363
|
}
|
|
5364
5364
|
get element() {
|
|
@@ -5386,7 +5386,7 @@ function Pn(e) {
|
|
|
5386
5386
|
}
|
|
5387
5387
|
return new be({ ...e._def, shape: () => t });
|
|
5388
5388
|
}
|
|
5389
|
-
return e instanceof gr ? new gr({ ...e._def, type: Pn(e.element) }) : e instanceof Rr ? Rr.create(Pn(e.unwrap())) : e instanceof an ? an.create(Pn(e.unwrap())) : e instanceof
|
|
5389
|
+
return e instanceof gr ? new gr({ ...e._def, type: Pn(e.element) }) : e instanceof Rr ? Rr.create(Pn(e.unwrap())) : e instanceof an ? an.create(Pn(e.unwrap())) : e instanceof Or ? Or.create(e.items.map((t) => Pn(t))) : e;
|
|
5390
5390
|
}
|
|
5391
5391
|
gr.create = (e, t) => new gr({ type: e, minLength: null, maxLength: null, exactLength: null, typeName: Mt.ZodArray, ...Pt(t) });
|
|
5392
5392
|
class be extends qt {
|
|
@@ -5408,7 +5408,7 @@ class be extends qt {
|
|
|
5408
5408
|
const o = [];
|
|
5409
5409
|
for (const c of s) {
|
|
5410
5410
|
const d = i[c], h = n.data[c];
|
|
5411
|
-
o.push({ key: { status: "valid", value: c }, value: d._parse(new
|
|
5411
|
+
o.push({ key: { status: "valid", value: c }, value: d._parse(new Cr(n, h, n.path, c)), alwaysSet: c in n.data });
|
|
5412
5412
|
}
|
|
5413
5413
|
if (this._def.catchall instanceof Zr) {
|
|
5414
5414
|
const c = this._def.unknownKeys;
|
|
@@ -5419,7 +5419,7 @@ class be extends qt {
|
|
|
5419
5419
|
const c = this._def.catchall;
|
|
5420
5420
|
for (const d of a) {
|
|
5421
5421
|
const h = n.data[d];
|
|
5422
|
-
o.push({ key: { status: "valid", value: d }, value: c._parse(new
|
|
5422
|
+
o.push({ key: { status: "valid", value: d }, value: c._parse(new Cr(n, h, n.path, d)), alwaysSet: d in n.data });
|
|
5423
5423
|
}
|
|
5424
5424
|
}
|
|
5425
5425
|
return n.common.async ? Promise.resolve().then(async () => {
|
|
@@ -5491,7 +5491,7 @@ class be extends qt {
|
|
|
5491
5491
|
return new be({ ...this._def, shape: () => r });
|
|
5492
5492
|
}
|
|
5493
5493
|
keyof() {
|
|
5494
|
-
return
|
|
5494
|
+
return O1(te.objectKeys(this.shape));
|
|
5495
5495
|
}
|
|
5496
5496
|
}
|
|
5497
5497
|
be.create = (e, t) => new be({ shape: () => e, unknownKeys: "strip", catchall: Zr.create(), typeName: Mt.ZodObject, ...Pt(t) }), be.strictCreate = (e, t) => new be({ shape: () => e, unknownKeys: "strict", catchall: Zr.create(), typeName: Mt.ZodObject, ...Pt(t) }), be.lazycreate = (e, t) => new be({ shape: e, unknownKeys: "strip", catchall: Zr.create(), typeName: Mt.ZodObject, ...Pt(t) });
|
|
@@ -5525,8 +5525,8 @@ class Ii extends qt {
|
|
|
5525
5525
|
}
|
|
5526
5526
|
}
|
|
5527
5527
|
Ii.create = (e, t) => new Ii({ options: e, typeName: Mt.ZodUnion, ...Pt(t) });
|
|
5528
|
-
const Xr = (e) => e instanceof Ri ? Xr(e.schema) : e instanceof yr ? Xr(e.innerType()) : e instanceof Ni ? [e.value] : e instanceof on ? e.options : e instanceof
|
|
5529
|
-
class
|
|
5528
|
+
const Xr = (e) => e instanceof Ri ? Xr(e.schema) : e instanceof yr ? Xr(e.innerType()) : e instanceof Ni ? [e.value] : e instanceof on ? e.options : e instanceof Ci ? te.objectValues(e.enum) : e instanceof Oi ? Xr(e._def.innerType) : e instanceof ki ? [void 0] : e instanceof Mi ? [null] : e instanceof Rr ? [void 0, ...Xr(e.unwrap())] : e instanceof an ? [null, ...Xr(e.unwrap())] : e instanceof Sa || e instanceof Pi ? Xr(e.unwrap()) : e instanceof Bi ? Xr(e._def.innerType) : [];
|
|
5529
|
+
class Us extends qt {
|
|
5530
5530
|
_parse(t) {
|
|
5531
5531
|
const { ctx: r } = this._processInputParams(t);
|
|
5532
5532
|
if (r.parsedType !== bt.object) return ft(r, { code: G.invalid_type, expected: bt.object, received: r.parsedType }), kt;
|
|
@@ -5552,11 +5552,11 @@ class $s extends qt {
|
|
|
5552
5552
|
i.set(o, s);
|
|
5553
5553
|
}
|
|
5554
5554
|
}
|
|
5555
|
-
return new
|
|
5555
|
+
return new Us({ typeName: Mt.ZodDiscriminatedUnion, discriminator: t, options: r, optionsMap: i, ...Pt(n) });
|
|
5556
5556
|
}
|
|
5557
5557
|
}
|
|
5558
5558
|
function Wo(e, t) {
|
|
5559
|
-
const r =
|
|
5559
|
+
const r = Ur(e), n = Ur(t);
|
|
5560
5560
|
if (e === t) return { valid: !0, data: e };
|
|
5561
5561
|
if (r === bt.object && n === bt.object) {
|
|
5562
5562
|
const i = te.objectKeys(t), s = te.objectKeys(e).filter((o) => i.indexOf(o) !== -1), a = { ...e, ...t };
|
|
@@ -5590,7 +5590,7 @@ class Ti extends qt {
|
|
|
5590
5590
|
}
|
|
5591
5591
|
}
|
|
5592
5592
|
Ti.create = (e, t, r) => new Ti({ left: e, right: t, typeName: Mt.ZodIntersection, ...Pt(r) });
|
|
5593
|
-
class
|
|
5593
|
+
class Or extends qt {
|
|
5594
5594
|
_parse(t) {
|
|
5595
5595
|
const { status: r, ctx: n } = this._processInputParams(t);
|
|
5596
5596
|
if (n.parsedType !== bt.array) return ft(n, { code: G.invalid_type, expected: bt.array, received: n.parsedType }), kt;
|
|
@@ -5598,7 +5598,7 @@ class Cr extends qt {
|
|
|
5598
5598
|
!this._def.rest && n.data.length > this._def.items.length && (ft(n, { code: G.too_big, maximum: this._def.items.length, inclusive: !0, exact: !1, type: "array" }), r.dirty());
|
|
5599
5599
|
const i = [...n.data].map((s, a) => {
|
|
5600
5600
|
const o = this._def.items[a] || this._def.rest;
|
|
5601
|
-
return o ? o._parse(new
|
|
5601
|
+
return o ? o._parse(new Cr(n, s, n.path, a)) : null;
|
|
5602
5602
|
}).filter((s) => !!s);
|
|
5603
5603
|
return n.common.async ? Promise.all(i).then((s) => Ze.mergeArray(r, s)) : Ze.mergeArray(r, i);
|
|
5604
5604
|
}
|
|
@@ -5606,12 +5606,12 @@ class Cr extends qt {
|
|
|
5606
5606
|
return this._def.items;
|
|
5607
5607
|
}
|
|
5608
5608
|
rest(t) {
|
|
5609
|
-
return new
|
|
5609
|
+
return new Or({ ...this._def, rest: t });
|
|
5610
5610
|
}
|
|
5611
5611
|
}
|
|
5612
|
-
|
|
5612
|
+
Or.create = (e, t) => {
|
|
5613
5613
|
if (!Array.isArray(e)) throw new Error("You must pass an array of schemas to z.tuple([ ... ])");
|
|
5614
|
-
return new
|
|
5614
|
+
return new Or({ items: e, typeName: Mt.ZodTuple, rest: null, ...Pt(t) });
|
|
5615
5615
|
};
|
|
5616
5616
|
class qs extends qt {
|
|
5617
5617
|
get keySchema() {
|
|
@@ -5624,7 +5624,7 @@ class qs extends qt {
|
|
|
5624
5624
|
const { status: r, ctx: n } = this._processInputParams(t);
|
|
5625
5625
|
if (n.parsedType !== bt.object) return ft(n, { code: G.invalid_type, expected: bt.object, received: n.parsedType }), kt;
|
|
5626
5626
|
const i = [], s = this._def.keyType, a = this._def.valueType;
|
|
5627
|
-
for (const o in n.data) i.push({ key: s._parse(new
|
|
5627
|
+
for (const o in n.data) i.push({ key: s._parse(new Cr(n, o, n.path, o)), value: a._parse(new Cr(n, n.data[o], n.path, o)), alwaysSet: o in n.data });
|
|
5628
5628
|
return n.common.async ? Ze.mergeObjectAsync(r, i) : Ze.mergeObjectSync(r, i);
|
|
5629
5629
|
}
|
|
5630
5630
|
get element() {
|
|
@@ -5644,7 +5644,7 @@ class _s extends qt {
|
|
|
5644
5644
|
_parse(t) {
|
|
5645
5645
|
const { status: r, ctx: n } = this._processInputParams(t);
|
|
5646
5646
|
if (n.parsedType !== bt.map) return ft(n, { code: G.invalid_type, expected: bt.map, received: n.parsedType }), kt;
|
|
5647
|
-
const i = this._def.keyType, s = this._def.valueType, a = [...n.data.entries()].map(([o, c], d) => ({ key: i._parse(new
|
|
5647
|
+
const i = this._def.keyType, s = this._def.valueType, a = [...n.data.entries()].map(([o, c], d) => ({ key: i._parse(new Cr(n, o, n.path, [d, "key"])), value: s._parse(new Cr(n, c, n.path, [d, "value"])) }));
|
|
5648
5648
|
if (n.common.async) {
|
|
5649
5649
|
const o = /* @__PURE__ */ new Map();
|
|
5650
5650
|
return Promise.resolve().then(async () => {
|
|
@@ -5683,7 +5683,7 @@ class En extends qt {
|
|
|
5683
5683
|
}
|
|
5684
5684
|
return { status: r.value, value: d };
|
|
5685
5685
|
}
|
|
5686
|
-
const o = [...n.data.values()].map((c, d) => s._parse(new
|
|
5686
|
+
const o = [...n.data.values()].map((c, d) => s._parse(new Cr(n, c, n.path, d)));
|
|
5687
5687
|
return n.common.async ? Promise.all(o).then((c) => a(c)) : a(o);
|
|
5688
5688
|
}
|
|
5689
5689
|
min(t, r) {
|
|
@@ -5743,7 +5743,7 @@ class Vn extends qt {
|
|
|
5743
5743
|
return this._def.returns;
|
|
5744
5744
|
}
|
|
5745
5745
|
args(...t) {
|
|
5746
|
-
return new Vn({ ...this._def, args:
|
|
5746
|
+
return new Vn({ ...this._def, args: Or.create(t).rest(_n.create()) });
|
|
5747
5747
|
}
|
|
5748
5748
|
returns(t) {
|
|
5749
5749
|
return new Vn({ ...this._def, returns: t });
|
|
@@ -5755,7 +5755,7 @@ class Vn extends qt {
|
|
|
5755
5755
|
return this.parse(t);
|
|
5756
5756
|
}
|
|
5757
5757
|
static create(t, r, n) {
|
|
5758
|
-
return new Vn({ args: t ||
|
|
5758
|
+
return new Vn({ args: t || Or.create([]).rest(_n.create()), returns: r || _n.create(), typeName: Mt.ZodFunction, ...Pt(n) });
|
|
5759
5759
|
}
|
|
5760
5760
|
}
|
|
5761
5761
|
class Ri extends qt {
|
|
@@ -5780,7 +5780,7 @@ class Ni extends qt {
|
|
|
5780
5780
|
return this._def.value;
|
|
5781
5781
|
}
|
|
5782
5782
|
}
|
|
5783
|
-
function
|
|
5783
|
+
function O1(e, t) {
|
|
5784
5784
|
return new on({ values: e, typeName: Mt.ZodEnum, ...Pt(t) });
|
|
5785
5785
|
}
|
|
5786
5786
|
Ni.create = (e, t) => new Ni({ value: e, typeName: Mt.ZodLiteral, ...Pt(t) });
|
|
@@ -5821,8 +5821,8 @@ class on extends qt {
|
|
|
5821
5821
|
return on.create(this.options.filter((n) => !t.includes(n)), { ...this._def, ...r });
|
|
5822
5822
|
}
|
|
5823
5823
|
}
|
|
5824
|
-
on.create =
|
|
5825
|
-
class
|
|
5824
|
+
on.create = O1;
|
|
5825
|
+
class Ci extends qt {
|
|
5826
5826
|
_parse(t) {
|
|
5827
5827
|
const r = te.getValidEnumValues(this._def.values), n = this._getOrReturnCtx(t);
|
|
5828
5828
|
if (n.parsedType !== bt.string && n.parsedType !== bt.number) {
|
|
@@ -5839,7 +5839,7 @@ class Oi extends qt {
|
|
|
5839
5839
|
return this._def.values;
|
|
5840
5840
|
}
|
|
5841
5841
|
}
|
|
5842
|
-
|
|
5842
|
+
Ci.create = (e, t) => new Ci({ values: e, typeName: Mt.ZodNativeEnum, ...Pt(t) });
|
|
5843
5843
|
class Xn extends qt {
|
|
5844
5844
|
unwrap() {
|
|
5845
5845
|
return this._def.type;
|
|
@@ -5923,7 +5923,7 @@ class an extends qt {
|
|
|
5923
5923
|
}
|
|
5924
5924
|
}
|
|
5925
5925
|
an.create = (e, t) => new an({ innerType: e, typeName: Mt.ZodNullable, ...Pt(t) });
|
|
5926
|
-
class
|
|
5926
|
+
class Oi extends qt {
|
|
5927
5927
|
_parse(t) {
|
|
5928
5928
|
const { ctx: r } = this._processInputParams(t);
|
|
5929
5929
|
let n = r.data;
|
|
@@ -5933,7 +5933,7 @@ class Ci extends qt {
|
|
|
5933
5933
|
return this._def.innerType;
|
|
5934
5934
|
}
|
|
5935
5935
|
}
|
|
5936
|
-
|
|
5936
|
+
Oi.create = (e, t) => new Oi({ innerType: e, typeName: Mt.ZodDefault, defaultValue: typeof t.default == "function" ? t.default : () => t.default, ...Pt(t) });
|
|
5937
5937
|
class Bi extends qt {
|
|
5938
5938
|
_parse(t) {
|
|
5939
5939
|
const { ctx: r } = this._processInputParams(t), n = { ...r, common: { ...r.common, issues: [] } }, i = this._def.innerType._parse({ data: n.data, path: n.path, parent: { ...n } });
|
|
@@ -6019,13 +6019,13 @@ var Mt;
|
|
|
6019
6019
|
(function(e) {
|
|
6020
6020
|
e.ZodString = "ZodString", e.ZodNumber = "ZodNumber", e.ZodNaN = "ZodNaN", e.ZodBigInt = "ZodBigInt", e.ZodBoolean = "ZodBoolean", e.ZodDate = "ZodDate", e.ZodSymbol = "ZodSymbol", e.ZodUndefined = "ZodUndefined", e.ZodNull = "ZodNull", e.ZodAny = "ZodAny", e.ZodUnknown = "ZodUnknown", e.ZodNever = "ZodNever", e.ZodVoid = "ZodVoid", e.ZodArray = "ZodArray", e.ZodObject = "ZodObject", e.ZodUnion = "ZodUnion", e.ZodDiscriminatedUnion = "ZodDiscriminatedUnion", e.ZodIntersection = "ZodIntersection", e.ZodTuple = "ZodTuple", e.ZodRecord = "ZodRecord", e.ZodMap = "ZodMap", e.ZodSet = "ZodSet", e.ZodFunction = "ZodFunction", e.ZodLazy = "ZodLazy", e.ZodLiteral = "ZodLiteral", e.ZodEnum = "ZodEnum", e.ZodEffects = "ZodEffects", e.ZodNativeEnum = "ZodNativeEnum", e.ZodOptional = "ZodOptional", e.ZodNullable = "ZodNullable", e.ZodDefault = "ZodDefault", e.ZodCatch = "ZodCatch", e.ZodPromise = "ZodPromise", e.ZodBranded = "ZodBranded", e.ZodPipeline = "ZodPipeline", e.ZodReadonly = "ZodReadonly";
|
|
6021
6021
|
})(Mt || (Mt = {}));
|
|
6022
|
-
const R0 = br.create, N0 = nn.create, v2 = xs.create, w2 = sn.create,
|
|
6022
|
+
const R0 = br.create, N0 = nn.create, v2 = xs.create, w2 = sn.create, C0 = Ei.create, _2 = Sn.create, x2 = vs.create, A2 = ki.create, S2 = Mi.create, Yo = Jn.create, E2 = _n.create, k2 = Zr.create, M2 = ws.create, B1 = gr.create, is = be.create, I2 = be.strictCreate, P1 = Ii.create, T2 = Us.create, R2 = Ti.create, L1 = Or.create, N2 = qs.create, C2 = _s.create, O2 = En.create, B2 = Vn.create, P2 = Ri.create, L2 = Ni.create, z2 = on.create, j2 = Ci.create, U2 = Xn.create, O0 = yr.create, q2 = Rr.create, $2 = an.create, H2 = yr.createWithPreprocess, D2 = Hi.create, F2 = { string: (e) => br.create({ ...e, coerce: !0 }), number: (e) => nn.create({ ...e, coerce: !0 }), boolean: (e) => Ei.create({ ...e, coerce: !0 }), bigint: (e) => sn.create({ ...e, coerce: !0 }), date: (e) => Sn.create({ ...e, coerce: !0 }) }, Z2 = kt, B0 = Object.freeze(Object.defineProperty({ __proto__: null, BRAND: y2, DIRTY: gs, EMPTY_PATH: [], INVALID: kt, NEVER: Z2, OK: Qe, ParseStatus: Ze, Schema: qt, ZodAny: Jn, ZodArray: gr, ZodBigInt: sn, ZodBoolean: Ei, ZodBranded: Sa, ZodCatch: Bi, ZodDate: Sn, ZodDefault: Oi, ZodDiscriminatedUnion: Us, ZodEffects: yr, ZodEnum: on, ZodError: er, get ZodFirstPartyTypeKind() {
|
|
6023
6023
|
return Mt;
|
|
6024
|
-
}, ZodFunction: Vn, ZodIntersection: Ti, ZodIssueCode: G, ZodLazy: Ri, ZodLiteral: Ni, ZodMap: _s, ZodNaN: xs, ZodNativeEnum:
|
|
6024
|
+
}, ZodFunction: Vn, ZodIntersection: Ti, ZodIssueCode: G, ZodLazy: Ri, ZodLiteral: Ni, ZodMap: _s, ZodNaN: xs, ZodNativeEnum: Ci, ZodNever: Zr, ZodNull: Mi, ZodNullable: an, ZodNumber: nn, ZodObject: be, ZodOptional: Rr, ZodParsedType: bt, ZodPipeline: Hi, ZodPromise: Xn, ZodReadonly: Pi, ZodRecord: qs, ZodSchema: qt, ZodSet: En, ZodString: br, ZodSymbol: vs, ZodTransformer: yr, ZodTuple: Or, ZodType: qt, ZodUndefined: ki, ZodUnion: Ii, ZodUnknown: _n, ZodVoid: ws, addIssueToContext: ft, any: Yo, array: B1, bigint: w2, boolean: C0, coerce: F2, custom: T0, date: _2, datetimeRegex: C1, defaultErrorMap: Gn, discriminatedUnion: T2, effect: O0, enum: z2, function: B2, getErrorMap: bs, getParsedType: Ur, instanceof: (e, t = { message: `Input not instance of ${e.name}` }) => T0((r) => r instanceof e, t), intersection: R2, isAborted: Vo, isAsync: Si, isDirty: Ko, isValid: An, late: g2, lazy: P2, literal: L2, makeIssue: ys, map: C2, nan: v2, nativeEnum: j2, never: k2, null: S2, nullable: $2, number: N0, object: is, get objectUtil() {
|
|
6025
6025
|
return Zo;
|
|
6026
|
-
}, oboolean: () =>
|
|
6026
|
+
}, oboolean: () => C0().optional(), onumber: () => N0().optional(), optional: q2, ostring: () => R0().optional(), pipeline: D2, preprocess: H2, promise: U2, quotelessJson: (e) => JSON.stringify(e, null, 2).replace(/"([^"]+)":/g, "$1:"), record: N2, set: O2, setErrorMap: function(e) {
|
|
6027
6027
|
T1 = e;
|
|
6028
|
-
}, strictObject: I2, string: R0, symbol: x2, transformer:
|
|
6028
|
+
}, strictObject: I2, string: R0, symbol: x2, transformer: O0, tuple: L1, undefined: A2, union: P1, unknown: E2, get util() {
|
|
6029
6029
|
return te;
|
|
6030
6030
|
}, void: M2 }, Symbol.toStringTag, { value: "Module" })), V2 = (e) => e.message ? e.message : "unspecified error";
|
|
6031
6031
|
class As extends Le {
|
|
@@ -6097,7 +6097,7 @@ const K2 = ["bool", "int", "uint", "bytes", "string", "address", "tuple"], z1 =
|
|
|
6097
6097
|
else n.push(ss(c, w, r));
|
|
6098
6098
|
}
|
|
6099
6099
|
return (r = r ?? []).push(...n), r;
|
|
6100
|
-
},
|
|
6100
|
+
}, $s = (e) => {
|
|
6101
6101
|
if (!Pe(e)) throw new Error("Invalid hex string");
|
|
6102
6102
|
const [t, r] = e.startsWith("-") ? [!0, e.slice(1)] : [!1, e], n = BigInt(r);
|
|
6103
6103
|
return n > Number.MAX_SAFE_INTEGER ? t ? -n : n : n < Number.MIN_SAFE_INTEGER ? n : t ? -1 * Number(n) : Number(n);
|
|
@@ -6124,7 +6124,7 @@ function Es(e) {
|
|
|
6124
6124
|
return t;
|
|
6125
6125
|
}
|
|
6126
6126
|
const L0 = 48, Y2 = 57, z0 = 65, Q2 = 70, j0 = 97, G2 = 102;
|
|
6127
|
-
function
|
|
6127
|
+
function U0(e) {
|
|
6128
6128
|
return e >= L0 && e <= Y2 ? e - L0 : e >= z0 && e <= Q2 ? e - (z0 - 10) : e >= j0 && e <= G2 ? e - (j0 - 10) : void 0;
|
|
6129
6129
|
}
|
|
6130
6130
|
function ka(e) {
|
|
@@ -6132,7 +6132,7 @@ function ka(e) {
|
|
|
6132
6132
|
if (!e.startsWith("0") || e[1] !== "x" && e[1] !== "X" || (t = 2), e.length % 2 != 0) throw new Fo(`hex string has odd length: ${e}`);
|
|
6133
6133
|
const r = (e.length - t) / 2, n = new Uint8Array(r);
|
|
6134
6134
|
for (let i = 0, s = t; i < r; i += 1) {
|
|
6135
|
-
const a =
|
|
6135
|
+
const a = U0(e.charCodeAt(s++)), o = U0(e.charCodeAt(s++));
|
|
6136
6136
|
if (a === void 0 || o === void 0) throw new Fo(`Invalid byte sequence ("${e[s - 2]}${e[s - 1]}" in "${e}").`);
|
|
6137
6137
|
n[i] = 16 * a + o;
|
|
6138
6138
|
}
|
|
@@ -6147,10 +6147,10 @@ const J2 = Object.freeze(Object.defineProperty({ __proto__: null, abiSchemaToJso
|
|
|
6147
6147
|
if (e >= 65 && e <= 70) return e - 55;
|
|
6148
6148
|
if (e >= 97 && e <= 102) return e - 87;
|
|
6149
6149
|
throw new Error(`Invalid code point: ${e}`);
|
|
6150
|
-
}, ensureIfUint8Array: Ds, ethAbiToJsonSchema: j1, fetchArrayElement: Ea, hexToNumber:
|
|
6150
|
+
}, ensureIfUint8Array: Ds, ethAbiToJsonSchema: j1, fetchArrayElement: Ea, hexToNumber: $s, hexToUint8Array: ka, numberToHex: Hs, padLeft: Qo, parseBaseType: Rn, transformJsonDataToAbiFormat: ss, uint8ArrayToHexString: Es }, Symbol.toStringTag, { value: "Module" })), Go = (e) => {
|
|
6151
6151
|
var t, r;
|
|
6152
6152
|
return e instanceof Uint8Array || ((t = e == null ? void 0 : e.constructor) === null || t === void 0 ? void 0 : t.name) === "Uint8Array" || ((r = e == null ? void 0 : e.constructor) === null || r === void 0 ? void 0 : r.name) === "Buffer";
|
|
6153
|
-
},
|
|
6153
|
+
}, U1 = (e, t = { abiType: "bytes" }) => {
|
|
6154
6154
|
if (typeof e != "string" && !Array.isArray(e) && !Go(e) || typeof e == "string" && Pe(e) && e.startsWith("-") || typeof e == "string" && !Pe(e)) return !1;
|
|
6155
6155
|
let r;
|
|
6156
6156
|
if (typeof e == "string") {
|
|
@@ -6188,7 +6188,7 @@ const J2 = Object.freeze(Object.defineProperty({ __proto__: null, abiSchemaToJso
|
|
|
6188
6188
|
} else t.bitSize && (r = t.bitSize);
|
|
6189
6189
|
const n = Jo(BigInt(2), BigInt(r ?? 256)) - BigInt(1);
|
|
6190
6190
|
try {
|
|
6191
|
-
const i = typeof e == "string" && Pe(e) ? BigInt(
|
|
6191
|
+
const i = typeof e == "string" && Pe(e) ? BigInt($s(e)) : BigInt(e);
|
|
6192
6192
|
return i >= 0 && i <= n;
|
|
6193
6193
|
} catch {
|
|
6194
6194
|
return !1;
|
|
@@ -6203,15 +6203,15 @@ const J2 = Object.freeze(Object.defineProperty({ __proto__: null, abiSchemaToJso
|
|
|
6203
6203
|
} else t.bitSize && (r = t.bitSize);
|
|
6204
6204
|
const n = Jo(BigInt(2), BigInt((r ?? 256) - 1)), i = BigInt(-1) * Jo(BigInt(2), BigInt((r ?? 256) - 1));
|
|
6205
6205
|
try {
|
|
6206
|
-
const s = typeof e == "string" && Pe(e) ? BigInt(
|
|
6206
|
+
const s = typeof e == "string" && Pe(e) ? BigInt($s(e)) : BigInt(e);
|
|
6207
6207
|
return s >= i && s <= n;
|
|
6208
6208
|
} catch {
|
|
6209
6209
|
return !1;
|
|
6210
6210
|
}
|
|
6211
|
-
}, q1 = (e) => Ma(e),
|
|
6211
|
+
}, q1 = (e) => Ma(e), $1 = (e) => Object.values(To).includes(e), ao = (e) => $1(e) || q1(e), We = (e) => e == null, q0 = (e) => typeof e == "string" && !!/^(0x)?[0-9a-f]{64}$/i.test(e) && !(!/^(0x)?[0-9a-f]{64}$/.test(e) && !/^(0x)?[0-9A-F]{64}$/.test(e)), kn = { address: (e) => wi(e), bloom: (e) => {
|
|
6212
6212
|
return !(typeof (t = e) != "string" || !/^(0x)?[0-9a-f]{512}$/i.test(t) || !/^(0x)?[0-9a-f]{512}$/.test(t) && !/^(0x)?[0-9A-F]{512}$/.test(t));
|
|
6213
6213
|
var t;
|
|
6214
|
-
}, blockNumber: (e) => q1(e), blockTag: (e) =>
|
|
6214
|
+
}, blockNumber: (e) => q1(e), blockTag: (e) => $1(e), blockNumberOrTag: (e) => ao(e), bool: (e) => ((t) => !!["number", "string", "boolean"].includes(typeof t) && (typeof t == "boolean" || (typeof t != "string" || Pe(t) ? typeof t == "string" && Pe(t) ? t === "0x1" || t === "0x0" : t === 1 || t === 0 : t === "1" || t === "0")))(e), bytes: (e) => U1(e), filter: (e) => ((t) => {
|
|
6215
6215
|
const r = ["fromBlock", "toBlock", "address", "topics", "blockHash"];
|
|
6216
6216
|
if (We(t) || typeof t != "object" || !Object.keys(t).every((n) => r.includes(n)) || !We(t.fromBlock) && !ao(t.fromBlock) || !We(t.toBlock) && !ao(t.toBlock)) return !1;
|
|
6217
6217
|
if (!We(t.address)) {
|
|
@@ -6222,7 +6222,7 @@ const J2 = Object.freeze(Object.defineProperty({ __proto__: null, abiSchemaToJso
|
|
|
6222
6222
|
return !(!We(t.topics) && !t.topics.every((n) => !!We(n) || (Array.isArray(n) ? n.every((i) => q0(i)) : !!q0(n))));
|
|
6223
6223
|
})(e), hex: (e) => Pe(e), uint: (e) => Ma(e), int: (e) => Xo(e), number: (e) => ((t) => !!Xo(t) || !(typeof t != "string" || !/[0-9.]/.test(t) || t.indexOf(".") !== t.lastIndexOf(".")) || typeof t == "number")(e), string: (e) => /* @__PURE__ */ ((t) => typeof t == "string")(e) };
|
|
6224
6224
|
for (let e = 8; e <= 256; e += 8) kn[`int${e}`] = (t) => Xo(t, { bitSize: e }), kn[`uint${e}`] = (t) => Ma(t, { bitSize: e });
|
|
6225
|
-
for (let e = 1; e <= 32; e += 1) kn[`bytes${e}`] = (t) =>
|
|
6225
|
+
for (let e = 1; e <= 32; e += 1) kn[`bytes${e}`] = (t) => U1(t, { size: e });
|
|
6226
6226
|
kn.bytes256 = kn.bytes;
|
|
6227
6227
|
const li = (e) => {
|
|
6228
6228
|
if ((!(e != null && e.type) || (e == null ? void 0 : e.type) === "object") && (e != null && e.properties)) {
|
|
@@ -6248,7 +6248,7 @@ const li = (e) => {
|
|
|
6248
6248
|
}
|
|
6249
6249
|
if (e.oneOf && Array.isArray(e.oneOf)) return P1(e.oneOf.map((t) => li(t)));
|
|
6250
6250
|
if (e != null && e.format) {
|
|
6251
|
-
if (!kn[e.format]) throw new
|
|
6251
|
+
if (!kn[e.format]) throw new $u(e.format);
|
|
6252
6252
|
return Yo().refine(kn[e.format], (t) => ({ params: { value: t, format: e.format } }));
|
|
6253
6253
|
}
|
|
6254
6254
|
return e != null && e.type && (e == null ? void 0 : e.type) !== "object" && typeof B0[String(e.type)] == "function" ? B0[String(e.type)]() : is({ data: Yo() }).partial();
|
|
@@ -6382,7 +6382,7 @@ var F1 = { exports: {} };
|
|
|
6382
6382
|
for (_ = 1, I = new Array(S - 1); _ < S; _++) I[_ - 1] = arguments[_];
|
|
6383
6383
|
M.fn.apply(M.context, I);
|
|
6384
6384
|
} else {
|
|
6385
|
-
var
|
|
6385
|
+
var O, k = M.length;
|
|
6386
6386
|
for (_ = 0; _ < k; _++) switch (M[_].once && this.removeListener(c, M[_].fn, void 0, !0), S) {
|
|
6387
6387
|
case 1:
|
|
6388
6388
|
M[_].fn.call(M[_].context);
|
|
@@ -6397,7 +6397,7 @@ var F1 = { exports: {} };
|
|
|
6397
6397
|
M[_].fn.call(M[_].context, d, h, p);
|
|
6398
6398
|
break;
|
|
6399
6399
|
default:
|
|
6400
|
-
if (!I) for (
|
|
6400
|
+
if (!I) for (O = 1, I = new Array(S - 1); O < S; O++) I[O - 1] = arguments[O];
|
|
6401
6401
|
M[_].fn.apply(M[_].context, I);
|
|
6402
6402
|
}
|
|
6403
6403
|
}
|
|
@@ -6422,7 +6422,7 @@ var F1 = { exports: {} };
|
|
|
6422
6422
|
return c ? (d = r ? r + c : c, this._events[d] && a(this, d)) : (this._events = new n(), this._eventsCount = 0), this;
|
|
6423
6423
|
}, o.prototype.off = o.prototype.removeListener, o.prototype.addListener = o.prototype.on, o.prefixed = r, o.EventEmitter = o, e.exports = o;
|
|
6424
6424
|
})(F1);
|
|
6425
|
-
const nl = qi(F1.exports), ta = We,
|
|
6425
|
+
const nl = qi(F1.exports), ta = We, $0 = (e, t, r = "0") => typeof e == "string" ? Pe(e) ? Qo(e, t, r) : e.padStart(t, r) : (Di.validate(["int"], [e]), Qo(e, t, r)), Z1 = "0xc5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470", il = (e) => {
|
|
6426
6426
|
let t;
|
|
6427
6427
|
t = typeof e == "string" ? e.startsWith("0x") && Pe(e) ? zi(e) : Zn(e) : e;
|
|
6428
6428
|
const r = ((n) => {
|
|
@@ -6530,7 +6530,7 @@ class dl {
|
|
|
6530
6530
|
i = JSON.parse(s);
|
|
6531
6531
|
} catch {
|
|
6532
6532
|
return this.lastChunk = s, this.lastChunkTimeout && clearTimeout(this.lastChunkTimeout), void (this.lastChunkTimeout = setTimeout(() => {
|
|
6533
|
-
this.autoReconnect || (this.clearQueues(), this.eventEmitter.emit("error", new
|
|
6533
|
+
this.autoReconnect || (this.clearQueues(), this.eventEmitter.emit("error", new Uu({ id: 1, jsonrpc: "2.0", error: { code: 2, message: "Chunk timeout" } })));
|
|
6534
6534
|
}, this.chunkTimeout));
|
|
6535
6535
|
}
|
|
6536
6536
|
clearTimeout(this.lastChunkTimeout), this.lastChunk = void 0, i && r.push(i);
|
|
@@ -6645,7 +6645,7 @@ class hl extends Y1 {
|
|
|
6645
6645
|
try {
|
|
6646
6646
|
this._openSocketConnection(), this._connectionStatus = "connecting", this._addSocketListeners();
|
|
6647
6647
|
} catch (t) {
|
|
6648
|
-
if (!this.isReconnecting) throw this._connectionStatus = "disconnected", t && t.message ? new
|
|
6648
|
+
if (!this.isReconnecting) throw this._connectionStatus = "disconnected", t && t.message ? new $i(`Error while connecting to ${this._socketPath}. Reason: ${t.message}`) : new Do(this._socketPath);
|
|
6649
6649
|
setImmediate(() => {
|
|
6650
6650
|
this._reconnect();
|
|
6651
6651
|
});
|
|
@@ -6705,7 +6705,7 @@ class hl extends Y1 {
|
|
|
6705
6705
|
t.deferredPromise.reject(new Bu()), this._sentRequestsQueue.delete(r);
|
|
6706
6706
|
}), this._reconnectAttempts < this._reconnectOptions.maxAttempts ? (this._reconnectAttempts += 1, setTimeout(() => {
|
|
6707
6707
|
this._removeSocketListeners(), this.connect(), this.isReconnecting = !1;
|
|
6708
|
-
}, this._reconnectOptions.delay)) : (this.isReconnecting = !1, this._clearQueues(), this._removeSocketListeners(), this._eventEmitter.emit("error", new
|
|
6708
|
+
}, this._reconnectOptions.delay)) : (this.isReconnecting = !1, this._clearQueues(), this._removeSocketListeners(), this._eventEmitter.emit("error", new Ou(this._reconnectOptions.maxAttempts))));
|
|
6709
6709
|
}
|
|
6710
6710
|
request(t) {
|
|
6711
6711
|
return fo(this, void 0, void 0, function* () {
|
|
@@ -6809,7 +6809,7 @@ var ea = { exports: {} };
|
|
|
6809
6809
|
this.append(P, x[P]);
|
|
6810
6810
|
}, this);
|
|
6811
6811
|
}
|
|
6812
|
-
function
|
|
6812
|
+
function O(x) {
|
|
6813
6813
|
if (!x._noBody) return x.bodyUsed ? Promise.reject(new TypeError("Already read")) : void (x.bodyUsed = !0);
|
|
6814
6814
|
}
|
|
6815
6815
|
function k(x) {
|
|
@@ -6835,7 +6835,7 @@ var ea = { exports: {} };
|
|
|
6835
6835
|
var P;
|
|
6836
6836
|
this.bodyUsed = this.bodyUsed, this._bodyInit = x, x ? typeof x == "string" ? this._bodyText = x : h && Blob.prototype.isPrototypeOf(x) ? this._bodyBlob = x : p && FormData.prototype.isPrototypeOf(x) ? this._bodyFormData = x : c && URLSearchParams.prototype.isPrototypeOf(x) ? this._bodyText = x.toString() : w && h && (P = x) && DataView.prototype.isPrototypeOf(P) ? (this._bodyArrayBuffer = L(x.buffer), this._bodyInit = new Blob([this._bodyArrayBuffer])) : w && (ArrayBuffer.prototype.isPrototypeOf(x) || A(x)) ? this._bodyArrayBuffer = L(x) : this._bodyText = x = Object.prototype.toString.call(x) : (this._noBody = !0, this._bodyText = ""), this.headers.get("content-type") || (typeof x == "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(x) && this.headers.set("content-type", "application/x-www-form-urlencoded;charset=UTF-8"));
|
|
6837
6837
|
}, h && (this.blob = function() {
|
|
6838
|
-
var x =
|
|
6838
|
+
var x = O(this);
|
|
6839
6839
|
if (x) return x;
|
|
6840
6840
|
if (this._bodyBlob) return Promise.resolve(this._bodyBlob);
|
|
6841
6841
|
if (this._bodyArrayBuffer) return Promise.resolve(new Blob([this._bodyArrayBuffer]));
|
|
@@ -6843,14 +6843,14 @@ var ea = { exports: {} };
|
|
|
6843
6843
|
return Promise.resolve(new Blob([this._bodyText]));
|
|
6844
6844
|
}), this.arrayBuffer = function() {
|
|
6845
6845
|
if (this._bodyArrayBuffer) {
|
|
6846
|
-
var x =
|
|
6846
|
+
var x = O(this);
|
|
6847
6847
|
return x || (ArrayBuffer.isView(this._bodyArrayBuffer) ? Promise.resolve(this._bodyArrayBuffer.buffer.slice(this._bodyArrayBuffer.byteOffset, this._bodyArrayBuffer.byteOffset + this._bodyArrayBuffer.byteLength)) : Promise.resolve(this._bodyArrayBuffer));
|
|
6848
6848
|
}
|
|
6849
6849
|
if (h) return this.blob().then(N);
|
|
6850
6850
|
throw new Error("could not read as ArrayBuffer");
|
|
6851
6851
|
}, this.text = function() {
|
|
6852
|
-
var x, P, R, j, Z,
|
|
6853
|
-
if (
|
|
6852
|
+
var x, P, R, j, Z, U = O(this);
|
|
6853
|
+
if (U) return U;
|
|
6854
6854
|
if (this._bodyBlob) return x = this._bodyBlob, P = new FileReader(), R = k(P), j = /charset=([A-Za-z0-9_-]+)/.exec(x.type), Z = j ? j[1] : "utf-8", P.readAsText(x, Z), R;
|
|
6855
6855
|
if (this._bodyArrayBuffer) return Promise.resolve(function(V) {
|
|
6856
6856
|
for (var F = new Uint8Array(V), H = new Array(F.length), J = 0; J < F.length; J++) H[J] = String.fromCharCode(F[J]);
|
|
@@ -6906,16 +6906,16 @@ var ea = { exports: {} };
|
|
|
6906
6906
|
if ("AbortController" in o) return new AbortController().signal;
|
|
6907
6907
|
}(), this.referrer = null, (this.method === "GET" || this.method === "HEAD") && Z) throw new TypeError("Body not allowed for GET or HEAD requests");
|
|
6908
6908
|
if (this._initBody(Z), !(this.method !== "GET" && this.method !== "HEAD" || P.cache !== "no-store" && P.cache !== "no-cache")) {
|
|
6909
|
-
var
|
|
6910
|
-
|
|
6909
|
+
var U = /([?&])_=[^&]*/;
|
|
6910
|
+
U.test(this.url) ? this.url = this.url.replace(U, "$1_=" + (/* @__PURE__ */ new Date()).getTime()) : this.url += (/\?/.test(this.url) ? "&" : "?") + "_=" + (/* @__PURE__ */ new Date()).getTime();
|
|
6911
6911
|
}
|
|
6912
6912
|
}
|
|
6913
6913
|
function g(x) {
|
|
6914
6914
|
var P = new FormData();
|
|
6915
6915
|
return x.trim().split("&").forEach(function(R) {
|
|
6916
6916
|
if (R) {
|
|
6917
|
-
var j = R.split("="), Z = j.shift().replace(/\+/g, " "),
|
|
6918
|
-
P.append(decodeURIComponent(Z), decodeURIComponent(
|
|
6917
|
+
var j = R.split("="), Z = j.shift().replace(/\+/g, " "), U = j.join("=").replace(/\+/g, " ");
|
|
6918
|
+
P.append(decodeURIComponent(Z), decodeURIComponent(U));
|
|
6919
6919
|
}
|
|
6920
6920
|
}), P;
|
|
6921
6921
|
}
|
|
@@ -6950,12 +6950,12 @@ var ea = { exports: {} };
|
|
|
6950
6950
|
return new Promise(function(R, j) {
|
|
6951
6951
|
var Z = new l(x, P);
|
|
6952
6952
|
if (Z.signal && Z.signal.aborted) return j(new a.DOMException("Aborted", "AbortError"));
|
|
6953
|
-
var
|
|
6953
|
+
var U = new XMLHttpRequest();
|
|
6954
6954
|
function V() {
|
|
6955
|
-
|
|
6955
|
+
U.abort();
|
|
6956
6956
|
}
|
|
6957
|
-
if (
|
|
6958
|
-
var H, J, Rt = { statusText:
|
|
6957
|
+
if (U.onload = function() {
|
|
6958
|
+
var H, J, Rt = { statusText: U.statusText, headers: (H = U.getAllResponseHeaders() || "", J = new S(), H.replace(/\r?\n[\t ]+/g, " ").split("\r").map(function(yt) {
|
|
6959
6959
|
return yt.indexOf(`
|
|
6960
6960
|
`) === 0 ? yt.substr(1, yt.length) : yt;
|
|
6961
6961
|
}).forEach(function(yt) {
|
|
@@ -6969,42 +6969,42 @@ var ea = { exports: {} };
|
|
|
6969
6969
|
}
|
|
6970
6970
|
}
|
|
6971
6971
|
}), J) };
|
|
6972
|
-
Z.url.indexOf("file://") === 0 && (
|
|
6973
|
-
var dt = "response" in
|
|
6972
|
+
Z.url.indexOf("file://") === 0 && (U.status < 200 || U.status > 599) ? Rt.status = 200 : Rt.status = U.status, Rt.url = "responseURL" in U ? U.responseURL : Rt.headers.get("X-Request-URL");
|
|
6973
|
+
var dt = "response" in U ? U.response : U.responseText;
|
|
6974
6974
|
setTimeout(function() {
|
|
6975
6975
|
R(new m(dt, Rt));
|
|
6976
6976
|
}, 0);
|
|
6977
|
-
},
|
|
6977
|
+
}, U.onerror = function() {
|
|
6978
6978
|
setTimeout(function() {
|
|
6979
6979
|
j(new TypeError("Network request failed"));
|
|
6980
6980
|
}, 0);
|
|
6981
|
-
},
|
|
6981
|
+
}, U.ontimeout = function() {
|
|
6982
6982
|
setTimeout(function() {
|
|
6983
6983
|
j(new TypeError("Network request timed out"));
|
|
6984
6984
|
}, 0);
|
|
6985
|
-
},
|
|
6985
|
+
}, U.onabort = function() {
|
|
6986
6986
|
setTimeout(function() {
|
|
6987
6987
|
j(new a.DOMException("Aborted", "AbortError"));
|
|
6988
6988
|
}, 0);
|
|
6989
|
-
},
|
|
6989
|
+
}, U.open(Z.method, function(H) {
|
|
6990
6990
|
try {
|
|
6991
6991
|
return H === "" && o.location.href ? o.location.href : H;
|
|
6992
6992
|
} catch {
|
|
6993
6993
|
return H;
|
|
6994
6994
|
}
|
|
6995
|
-
}(Z.url), !0), Z.credentials === "include" ?
|
|
6995
|
+
}(Z.url), !0), Z.credentials === "include" ? U.withCredentials = !0 : Z.credentials === "omit" && (U.withCredentials = !1), "responseType" in U && (h ? U.responseType = "blob" : w && (U.responseType = "arraybuffer")), P && typeof P.headers == "object" && !(P.headers instanceof S || o.Headers && P.headers instanceof o.Headers)) {
|
|
6996
6996
|
var F = [];
|
|
6997
6997
|
Object.getOwnPropertyNames(P.headers).forEach(function(H) {
|
|
6998
|
-
F.push(I(H)),
|
|
6998
|
+
F.push(I(H)), U.setRequestHeader(H, _(P.headers[H]));
|
|
6999
6999
|
}), Z.headers.forEach(function(H, J) {
|
|
7000
|
-
F.indexOf(J) === -1 &&
|
|
7000
|
+
F.indexOf(J) === -1 && U.setRequestHeader(J, H);
|
|
7001
7001
|
});
|
|
7002
7002
|
} else Z.headers.forEach(function(H, J) {
|
|
7003
|
-
|
|
7003
|
+
U.setRequestHeader(J, H);
|
|
7004
7004
|
});
|
|
7005
|
-
Z.signal && (Z.signal.addEventListener("abort", V),
|
|
7006
|
-
|
|
7007
|
-
}),
|
|
7005
|
+
Z.signal && (Z.signal.addEventListener("abort", V), U.onreadystatechange = function() {
|
|
7006
|
+
U.readyState === 4 && Z.signal.removeEventListener("abort", V);
|
|
7007
|
+
}), U.send(Z._bodyInit === void 0 ? null : Z._bodyInit);
|
|
7008
7008
|
});
|
|
7009
7009
|
}
|
|
7010
7010
|
y.polyfill = !0, o.fetch || (o.fetch = y, o.Headers = S, o.Request = l, o.Response = m), a.Headers = S, a.Request = l, a.Response = m, a.fetch = y;
|
|
@@ -7200,8 +7200,8 @@ class yl extends _a {
|
|
|
7200
7200
|
for (let p = a; p < i; p++) r[p] = 0;
|
|
7201
7201
|
(function(p, w, v, A) {
|
|
7202
7202
|
if (typeof p.setBigUint64 == "function") return p.setBigUint64(w, v, A);
|
|
7203
|
-
const I = BigInt(32), _ = BigInt(4294967295), M = Number(v >> I & _), S = Number(v & _),
|
|
7204
|
-
p.setUint32(w +
|
|
7203
|
+
const I = BigInt(32), _ = BigInt(4294967295), M = Number(v >> I & _), S = Number(v & _), O = A ? 4 : 0, k = A ? 0 : 4;
|
|
7204
|
+
p.setUint32(w + O, M, A), p.setUint32(w + k, S, A);
|
|
7205
7205
|
})(n, i - 8, BigInt(8 * this.length), s), this.process(n, 0);
|
|
7206
7206
|
const o = so(t), c = this.outputLen;
|
|
7207
7207
|
if (c % 4) throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
@@ -7299,13 +7299,13 @@ function ei(e) {
|
|
|
7299
7299
|
function gn(e) {
|
|
7300
7300
|
return Na(ti(e));
|
|
7301
7301
|
}
|
|
7302
|
-
function
|
|
7302
|
+
function Ca(e) {
|
|
7303
7303
|
return Fi(e), Na(ti(Uint8Array.from(e).reverse()));
|
|
7304
7304
|
}
|
|
7305
7305
|
function Kn(e, t) {
|
|
7306
7306
|
return ei(e.toString(16).padStart(2 * t, "0"));
|
|
7307
7307
|
}
|
|
7308
|
-
function
|
|
7308
|
+
function Oa(e, t) {
|
|
7309
7309
|
return Kn(e, t).reverse();
|
|
7310
7310
|
}
|
|
7311
7311
|
function lr(e, t, r) {
|
|
@@ -7364,7 +7364,7 @@ function J1(e, t, r) {
|
|
|
7364
7364
|
};
|
|
7365
7365
|
}
|
|
7366
7366
|
const kl = { bigint: (e) => typeof e == "bigint", function: (e) => typeof e == "function", boolean: (e) => typeof e == "boolean", string: (e) => typeof e == "string", stringOrUint8Array: (e) => typeof e == "string" || Mn(e), isSafeInteger: (e) => Number.isSafeInteger(e), array: (e) => Array.isArray(e), field: (e, t) => t.Fp.isValid(e), hash: (e) => typeof e == "function" && Number.isSafeInteger(e.outputLen) };
|
|
7367
|
-
function
|
|
7367
|
+
function Ui(e, t, r = {}) {
|
|
7368
7368
|
const n = (i, s, a) => {
|
|
7369
7369
|
const o = kl[s];
|
|
7370
7370
|
if (typeof o != "function") throw new Error(`Invalid validator "${s}", expected function`);
|
|
@@ -7383,17 +7383,17 @@ const Ml = Object.freeze(Object.defineProperty({ __proto__: null, abytes: Fi, bi
|
|
|
7383
7383
|
return t;
|
|
7384
7384
|
}, bitMask: Ba, bitSet: function(e, t, r) {
|
|
7385
7385
|
return e | (r ? os : W0) << BigInt(t);
|
|
7386
|
-
}, bytesToHex: ti, bytesToNumberBE: gn, bytesToNumberLE:
|
|
7386
|
+
}, bytesToHex: ti, bytesToNumberBE: gn, bytesToNumberLE: Ca, concatBytes: ji, createHmacDrbg: J1, ensureBytes: lr, equalBytes: function(e, t) {
|
|
7387
7387
|
if (e.length !== t.length) return !1;
|
|
7388
7388
|
let r = 0;
|
|
7389
7389
|
for (let n = 0; n < e.length; n++) r |= e[n] ^ t[n];
|
|
7390
7390
|
return r === 0;
|
|
7391
|
-
}, hexToBytes: ei, hexToNumber: Na, isBytes: Mn, numberToBytesBE: Kn, numberToBytesLE:
|
|
7391
|
+
}, hexToBytes: ei, hexToNumber: Na, isBytes: Mn, numberToBytesBE: Kn, numberToBytesLE: Oa, numberToHexUnpadded: Y0, numberToVarBytesBE: function(e) {
|
|
7392
7392
|
return ei(Y0(e));
|
|
7393
7393
|
}, utf8ToBytes: function(e) {
|
|
7394
7394
|
if (typeof e != "string") throw new Error("utf8ToBytes expected string, got " + typeof e);
|
|
7395
7395
|
return new Uint8Array(new TextEncoder().encode(e));
|
|
7396
|
-
}, validateObject:
|
|
7396
|
+
}, validateObject: Ui }, Symbol.toStringTag, { value: "Module" })), Be = BigInt(0), Ae = BigInt(1), fn = BigInt(2), Il = BigInt(3), uo = BigInt(4), ed = BigInt(5), rd = BigInt(8);
|
|
7397
7397
|
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
7398
7398
|
function Xe(e, t) {
|
|
7399
7399
|
const r = e % t;
|
|
@@ -7482,12 +7482,12 @@ function nd(e) {
|
|
|
7482
7482
|
return t + Math.ceil(t / 2);
|
|
7483
7483
|
}
|
|
7484
7484
|
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
7485
|
-
const
|
|
7485
|
+
const Cl = BigInt(0), lo = BigInt(1);
|
|
7486
7486
|
function ef(e) {
|
|
7487
|
-
return
|
|
7487
|
+
return Ui(e.Fp, Nl.reduce((t, r) => (t[r] = "function", t), { ORDER: "bigint", MASK: "bigint", BYTES: "isSafeInteger", BITS: "isSafeInteger" })), Ui(e, { n: "bigint", h: "bigint", Gx: "field", Gy: "field" }, { nBitLength: "isSafeInteger", nByteLength: "isSafeInteger" }), Object.freeze({ ...X1(e.n, e.nBitLength), ...e, p: e.Fp.ORDER });
|
|
7488
7488
|
}
|
|
7489
7489
|
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
7490
|
-
const { bytesToNumberBE:
|
|
7490
|
+
const { bytesToNumberBE: Ol, hexToBytes: Bl } = Ml, vn = { Err: class extends Error {
|
|
7491
7491
|
constructor(e = "") {
|
|
7492
7492
|
super(e);
|
|
7493
7493
|
}
|
|
@@ -7498,7 +7498,7 @@ const { bytesToNumberBE: Cl, hexToBytes: Bl } = Ml, vn = { Err: class extends Er
|
|
|
7498
7498
|
if (!r || n.length !== r) throw new t("Invalid signature integer: wrong length");
|
|
7499
7499
|
if (128 & n[0]) throw new t("Invalid signature integer: negative");
|
|
7500
7500
|
if (n[0] === 0 && !(128 & n[1])) throw new t("Invalid signature integer: unnecessary leading zero");
|
|
7501
|
-
return { d:
|
|
7501
|
+
return { d: Ol(n), l: e.subarray(r + 2) };
|
|
7502
7502
|
}, toSig(e) {
|
|
7503
7503
|
const { Err: t } = vn, r = typeof e == "string" ? Bl(e) : e;
|
|
7504
7504
|
Fi(r);
|
|
@@ -7520,7 +7520,7 @@ const id = BigInt(3);
|
|
|
7520
7520
|
function Pl(e) {
|
|
7521
7521
|
const t = function(A) {
|
|
7522
7522
|
const I = ef(A);
|
|
7523
|
-
|
|
7523
|
+
Ui(I, { a: "field", b: "field" }, { allowedPrivateKeyLengths: "array", wrapPrivateKey: "boolean", isTorsionFree: "function", clearCofactor: "function", allowInfinityPoint: "boolean", fromBytes: "function", toBytes: "function" });
|
|
7524
7524
|
const { endo: _, Fp: M, a: S } = I;
|
|
7525
7525
|
if (_) {
|
|
7526
7526
|
if (!M.eql(S, M.ZERO)) throw new Error("Endomorphism can only be defined for Koblitz curves that have a=0");
|
|
@@ -7551,13 +7551,13 @@ function Pl(e) {
|
|
|
7551
7551
|
if (Mn(A) && (A = ti(A)), typeof A != "string" || !I.includes(A.length)) throw new Error("Invalid key");
|
|
7552
7552
|
A = A.padStart(2 * _, "0");
|
|
7553
7553
|
}
|
|
7554
|
-
let
|
|
7554
|
+
let O;
|
|
7555
7555
|
try {
|
|
7556
|
-
|
|
7556
|
+
O = typeof A == "bigint" ? A : gn(lr("private key", A, _));
|
|
7557
7557
|
} catch {
|
|
7558
7558
|
throw new Error(`private key must be ${_} bytes, hex or bigint, not ${typeof A}`);
|
|
7559
7559
|
}
|
|
7560
|
-
return M && (
|
|
7560
|
+
return M && (O = Xe(O, S)), o(O), O;
|
|
7561
7561
|
}
|
|
7562
7562
|
const d = /* @__PURE__ */ new Map();
|
|
7563
7563
|
function h(A) {
|
|
@@ -7573,7 +7573,7 @@ function Pl(e) {
|
|
|
7573
7573
|
const { x: _, y: M } = I || {};
|
|
7574
7574
|
if (!I || !r.isValid(_) || !r.isValid(M)) throw new Error("invalid affine point");
|
|
7575
7575
|
if (I instanceof p) throw new Error("projective point not allowed");
|
|
7576
|
-
const S = (
|
|
7576
|
+
const S = (O) => r.eql(O, r.ZERO);
|
|
7577
7577
|
return S(_) && S(M) ? p.ZERO : new p(_, M, r.ONE);
|
|
7578
7578
|
}
|
|
7579
7579
|
get x() {
|
|
@@ -7614,25 +7614,25 @@ function Pl(e) {
|
|
|
7614
7614
|
}
|
|
7615
7615
|
equals(I) {
|
|
7616
7616
|
h(I);
|
|
7617
|
-
const { px: _, py: M, pz: S } = this, { px:
|
|
7617
|
+
const { px: _, py: M, pz: S } = this, { px: O, py: k, pz: N } = I, L = r.eql(r.mul(_, N), r.mul(O, S)), z = r.eql(r.mul(M, N), r.mul(k, S));
|
|
7618
7618
|
return L && z;
|
|
7619
7619
|
}
|
|
7620
7620
|
negate() {
|
|
7621
7621
|
return new p(this.px, r.neg(this.py), this.pz);
|
|
7622
7622
|
}
|
|
7623
7623
|
double() {
|
|
7624
|
-
const { a: I, b: _ } = t, M = r.mul(_, id), { px: S, py:
|
|
7625
|
-
let N = r.ZERO, L = r.ZERO, z = r.ZERO, f = r.mul(S, S), l = r.mul(
|
|
7626
|
-
return m = r.add(m, m), z = r.mul(S, k), z = r.add(z, z), N = r.mul(I, z), L = r.mul(M, g), L = r.add(N, L), N = r.sub(l, L), L = r.add(l, L), L = r.mul(N, L), N = r.mul(m, N), z = r.mul(M, z), g = r.mul(I, g), m = r.sub(f, g), m = r.mul(I, m), m = r.add(m, z), z = r.add(f, f), f = r.add(z, f), f = r.add(f, g), f = r.mul(f, m), L = r.add(L, f), g = r.mul(
|
|
7624
|
+
const { a: I, b: _ } = t, M = r.mul(_, id), { px: S, py: O, pz: k } = this;
|
|
7625
|
+
let N = r.ZERO, L = r.ZERO, z = r.ZERO, f = r.mul(S, S), l = r.mul(O, O), g = r.mul(k, k), m = r.mul(S, O);
|
|
7626
|
+
return m = r.add(m, m), z = r.mul(S, k), z = r.add(z, z), N = r.mul(I, z), L = r.mul(M, g), L = r.add(N, L), N = r.sub(l, L), L = r.add(l, L), L = r.mul(N, L), N = r.mul(m, N), z = r.mul(M, z), g = r.mul(I, g), m = r.sub(f, g), m = r.mul(I, m), m = r.add(m, z), z = r.add(f, f), f = r.add(z, f), f = r.add(f, g), f = r.mul(f, m), L = r.add(L, f), g = r.mul(O, k), g = r.add(g, g), f = r.mul(g, m), N = r.sub(N, f), z = r.mul(g, l), z = r.add(z, z), z = r.add(z, z), new p(N, L, z);
|
|
7627
7627
|
}
|
|
7628
7628
|
add(I) {
|
|
7629
7629
|
h(I);
|
|
7630
|
-
const { px: _, py: M, pz: S } = this, { px:
|
|
7630
|
+
const { px: _, py: M, pz: S } = this, { px: O, py: k, pz: N } = I;
|
|
7631
7631
|
let L = r.ZERO, z = r.ZERO, f = r.ZERO;
|
|
7632
7632
|
const l = t.a, g = r.mul(t.b, id);
|
|
7633
|
-
let m = r.mul(_,
|
|
7633
|
+
let m = r.mul(_, O), u = r.mul(M, k), y = r.mul(S, N), x = r.add(_, M), P = r.add(O, k);
|
|
7634
7634
|
x = r.mul(x, P), P = r.add(m, u), x = r.sub(x, P), P = r.add(_, S);
|
|
7635
|
-
let R = r.add(
|
|
7635
|
+
let R = r.add(O, N);
|
|
7636
7636
|
return P = r.mul(P, R), R = r.add(m, y), P = r.sub(P, R), R = r.add(M, S), L = r.add(k, N), R = r.mul(R, L), L = r.add(u, y), R = r.sub(R, L), f = r.mul(l, P), L = r.mul(g, y), f = r.add(L, f), L = r.sub(u, f), f = r.add(u, f), z = r.mul(L, f), u = r.add(m, m), u = r.add(u, m), y = r.mul(l, y), P = r.mul(g, P), u = r.add(u, y), y = r.sub(m, y), y = r.mul(l, y), P = r.add(P, y), m = r.mul(u, P), z = r.add(z, m), m = r.mul(R, P), L = r.mul(x, L), L = r.sub(L, m), m = r.mul(x, u), f = r.mul(R, f), f = r.add(f, m), new p(L, z, f);
|
|
7637
7637
|
}
|
|
7638
7638
|
subtract(I) {
|
|
@@ -7644,7 +7644,7 @@ function Pl(e) {
|
|
|
7644
7644
|
wNAF(I) {
|
|
7645
7645
|
return v.wNAFCached(this, d, I, (_) => {
|
|
7646
7646
|
const M = r.invertBatch(_.map((S) => S.pz));
|
|
7647
|
-
return _.map((S,
|
|
7647
|
+
return _.map((S, O) => S.toAffine(M[O])).map(p.fromAffine);
|
|
7648
7648
|
});
|
|
7649
7649
|
}
|
|
7650
7650
|
multiplyUnsafe(I) {
|
|
@@ -7653,18 +7653,18 @@ function Pl(e) {
|
|
|
7653
7653
|
if (o(I), I === dr) return this;
|
|
7654
7654
|
const { endo: M } = t;
|
|
7655
7655
|
if (!M) return v.unsafeLadder(this, I);
|
|
7656
|
-
let { k1neg: S, k1:
|
|
7657
|
-
for (;
|
|
7656
|
+
let { k1neg: S, k1: O, k2neg: k, k2: N } = M.splitScalar(I), L = _, z = _, f = this;
|
|
7657
|
+
for (; O > Hr || N > Hr; ) O & dr && (L = L.add(f)), N & dr && (z = z.add(f)), f = f.double(), O >>= dr, N >>= dr;
|
|
7658
7658
|
return S && (L = L.negate()), k && (z = z.negate()), z = new p(r.mul(z.px, M.beta), z.py, z.pz), L.add(z);
|
|
7659
7659
|
}
|
|
7660
7660
|
multiply(I) {
|
|
7661
7661
|
o(I);
|
|
7662
7662
|
let _, M, S = I;
|
|
7663
|
-
const { endo:
|
|
7664
|
-
if (
|
|
7665
|
-
const { k1neg: k, k1: N, k2neg: L, k2: z } =
|
|
7663
|
+
const { endo: O } = t;
|
|
7664
|
+
if (O) {
|
|
7665
|
+
const { k1neg: k, k1: N, k2neg: L, k2: z } = O.splitScalar(S);
|
|
7666
7666
|
let { p: f, f: l } = this.wNAF(N), { p: g, f: m } = this.wNAF(z);
|
|
7667
|
-
f = v.constTimeNegate(k, f), g = v.constTimeNegate(L, g), g = new p(r.mul(g.px,
|
|
7667
|
+
f = v.constTimeNegate(k, f), g = v.constTimeNegate(L, g), g = new p(r.mul(g.px, O.beta), g.py, g.pz), _ = f.add(g), M = l.add(m);
|
|
7668
7668
|
} else {
|
|
7669
7669
|
const { p: k, f: N } = this.wNAF(S);
|
|
7670
7670
|
_ = k, M = N;
|
|
@@ -7672,14 +7672,14 @@ function Pl(e) {
|
|
|
7672
7672
|
return p.normalizeZ([_, M])[0];
|
|
7673
7673
|
}
|
|
7674
7674
|
multiplyAndAddUnsafe(I, _, M) {
|
|
7675
|
-
const S = p.BASE,
|
|
7675
|
+
const S = p.BASE, O = (N, L) => L !== Hr && L !== dr && N.equals(S) ? N.multiply(L) : N.multiplyUnsafe(L), k = O(this, _).add(O(I, M));
|
|
7676
7676
|
return k.is0() ? void 0 : k;
|
|
7677
7677
|
}
|
|
7678
7678
|
toAffine(I) {
|
|
7679
|
-
const { px: _, py: M, pz: S } = this,
|
|
7680
|
-
I == null && (I =
|
|
7679
|
+
const { px: _, py: M, pz: S } = this, O = this.is0();
|
|
7680
|
+
I == null && (I = O ? r.ONE : r.inv(S));
|
|
7681
7681
|
const k = r.mul(_, I), N = r.mul(M, I), L = r.mul(S, I);
|
|
7682
|
-
if (
|
|
7682
|
+
if (O) return { x: r.ZERO, y: r.ZERO };
|
|
7683
7683
|
if (!r.eql(L, r.ONE)) throw new Error("invZ was invalid");
|
|
7684
7684
|
return { x: k, y: N };
|
|
7685
7685
|
}
|
|
@@ -7702,16 +7702,16 @@ function Pl(e) {
|
|
|
7702
7702
|
}
|
|
7703
7703
|
p.BASE = new p(t.Gx, t.Gy, r.ONE), p.ZERO = new p(r.ZERO, r.ONE, r.ZERO);
|
|
7704
7704
|
const w = t.nBitLength, v = /* @__PURE__ */ function(A, I) {
|
|
7705
|
-
const _ = (S,
|
|
7706
|
-
const k =
|
|
7707
|
-
return S ? k :
|
|
7705
|
+
const _ = (S, O) => {
|
|
7706
|
+
const k = O.negate();
|
|
7707
|
+
return S ? k : O;
|
|
7708
7708
|
}, M = (S) => ({ windows: Math.ceil(I / S) + 1, windowSize: 2 ** (S - 1) });
|
|
7709
|
-
return { constTimeNegate: _, unsafeLadder(S,
|
|
7709
|
+
return { constTimeNegate: _, unsafeLadder(S, O) {
|
|
7710
7710
|
let k = A.ZERO, N = S;
|
|
7711
|
-
for (;
|
|
7711
|
+
for (; O > Cl; ) O & lo && (k = k.add(N)), N = N.double(), O >>= lo;
|
|
7712
7712
|
return k;
|
|
7713
|
-
}, precomputeWindow(S,
|
|
7714
|
-
const { windows: k, windowSize: N } = M(
|
|
7713
|
+
}, precomputeWindow(S, O) {
|
|
7714
|
+
const { windows: k, windowSize: N } = M(O), L = [];
|
|
7715
7715
|
let z = S, f = z;
|
|
7716
7716
|
for (let l = 0; l < k; l++) {
|
|
7717
7717
|
f = z, L.push(f);
|
|
@@ -7719,7 +7719,7 @@ function Pl(e) {
|
|
|
7719
7719
|
z = f.double();
|
|
7720
7720
|
}
|
|
7721
7721
|
return L;
|
|
7722
|
-
}, wNAF(S,
|
|
7722
|
+
}, wNAF(S, O, k) {
|
|
7723
7723
|
const { windows: N, windowSize: L } = M(S);
|
|
7724
7724
|
let z = A.ZERO, f = A.BASE;
|
|
7725
7725
|
const l = BigInt(2 ** S - 1), g = 2 ** S, m = BigInt(S);
|
|
@@ -7728,13 +7728,13 @@ function Pl(e) {
|
|
|
7728
7728
|
let x = Number(k & l);
|
|
7729
7729
|
k >>= m, x > L && (x -= g, k += lo);
|
|
7730
7730
|
const P = y, R = y + Math.abs(x) - 1, j = u % 2 != 0, Z = x < 0;
|
|
7731
|
-
x === 0 ? f = f.add(_(j,
|
|
7731
|
+
x === 0 ? f = f.add(_(j, O[P])) : z = z.add(_(Z, O[R]));
|
|
7732
7732
|
}
|
|
7733
7733
|
return { p: z, f };
|
|
7734
|
-
}, wNAFCached(S,
|
|
7734
|
+
}, wNAFCached(S, O, k, N) {
|
|
7735
7735
|
const L = S._WINDOW_SIZE || 1;
|
|
7736
|
-
let z =
|
|
7737
|
-
return z || (z = this.precomputeWindow(S, L), L !== 1 &&
|
|
7736
|
+
let z = O.get(S);
|
|
7737
|
+
return z || (z = this.precomputeWindow(S, L), L !== 1 && O.set(S, N(z))), this.wNAF(L, z, k);
|
|
7738
7738
|
} };
|
|
7739
7739
|
}(p, t.endo ? Math.ceil(w / 2) : w);
|
|
7740
7740
|
return { CURVE: t, ProjectivePoint: p, normPrivateKeyToScalar: c, weierstrassEquation: s, isWithinCurveOrder: a };
|
|
@@ -7742,7 +7742,7 @@ function Pl(e) {
|
|
|
7742
7742
|
function Ll(e) {
|
|
7743
7743
|
const t = function(l) {
|
|
7744
7744
|
const g = ef(l);
|
|
7745
|
-
return
|
|
7745
|
+
return Ui(g, { hash: "hash", hmac: "function", randomBytes: "function" }, { bits2int: "function", bits2int_modN: "function", lowS: "boolean" }), Object.freeze({ lowS: !0, ...g });
|
|
7746
7746
|
}(e), { Fp: r, n } = t, i = r.BYTES + 1, s = 2 * r.BYTES + 1;
|
|
7747
7747
|
function a(l) {
|
|
7748
7748
|
return Xe(l, n);
|
|
@@ -7799,11 +7799,11 @@ function Ll(e) {
|
|
|
7799
7799
|
return new I(this.r, this.s, g);
|
|
7800
7800
|
}
|
|
7801
7801
|
recoverPublicKey(g) {
|
|
7802
|
-
const { r: m, s: u, recovery: y } = this, x =
|
|
7802
|
+
const { r: m, s: u, recovery: y } = this, x = O(lr("msgHash", g));
|
|
7803
7803
|
if (y == null || ![0, 1, 2, 3].includes(y)) throw new Error("recovery id invalid");
|
|
7804
7804
|
const P = y === 2 || y === 3 ? m + t.n : m;
|
|
7805
7805
|
if (P >= r.ORDER) throw new Error("recovery id 2 or 3 invalid");
|
|
7806
|
-
const R = 1 & y ? "03" : "02", j = c.fromHex(R + w(P)), Z = o(P),
|
|
7806
|
+
const R = 1 & y ? "03" : "02", j = c.fromHex(R + w(P)), Z = o(P), U = a(-x * Z), V = a(u * Z), F = c.BASE.multiplyAndAddUnsafe(j, U, V);
|
|
7807
7807
|
if (!F) throw new Error("point at infinify");
|
|
7808
7808
|
return F.assertValidity(), F;
|
|
7809
7809
|
}
|
|
@@ -7837,8 +7837,8 @@ function Ll(e) {
|
|
|
7837
7837
|
return function(g, m, u = !1) {
|
|
7838
7838
|
const y = g.length, x = tf(m), P = nd(m);
|
|
7839
7839
|
if (y < 16 || y < P || y > 1024) throw new Error(`expected ${P}-1024 bytes of input, got ${y}`);
|
|
7840
|
-
const R = Xe(u ? gn(g) :
|
|
7841
|
-
return u ?
|
|
7840
|
+
const R = Xe(u ? gn(g) : Ca(g), m - Ae) + Ae;
|
|
7841
|
+
return u ? Oa(R, x) : Kn(R, x);
|
|
7842
7842
|
}(t.randomBytes(l), t.n);
|
|
7843
7843
|
}, precompute: (l = 8, g = c.BASE) => (g._setWindowSize(l), g.multiply(BigInt(3)), g) };
|
|
7844
7844
|
function M(l) {
|
|
@@ -7848,7 +7848,7 @@ function Ll(e) {
|
|
|
7848
7848
|
const S = t.bits2int || function(l) {
|
|
7849
7849
|
const g = gn(l), m = 8 * l.length - t.nBitLength;
|
|
7850
7850
|
return m > 0 ? g >> BigInt(m) : g;
|
|
7851
|
-
},
|
|
7851
|
+
}, O = t.bits2int_modN || function(l) {
|
|
7852
7852
|
return a(S(l));
|
|
7853
7853
|
}, k = Ba(t.nBitLength);
|
|
7854
7854
|
function N(l) {
|
|
@@ -7861,12 +7861,12 @@ function Ll(e) {
|
|
|
7861
7861
|
const { hash: u, randomBytes: y } = t;
|
|
7862
7862
|
let { lowS: x, prehash: P, extraEntropy: R } = m;
|
|
7863
7863
|
x == null && (x = !0), l = lr("msgHash", l), P && (l = lr("prehashed msgHash", u(l)));
|
|
7864
|
-
const j =
|
|
7864
|
+
const j = O(l), Z = d(g), U = [N(Z), N(j)];
|
|
7865
7865
|
if (R != null && R !== !1) {
|
|
7866
7866
|
const H = R === !0 ? y(r.BYTES) : R;
|
|
7867
|
-
|
|
7867
|
+
U.push(lr("extraEntropy", H));
|
|
7868
7868
|
}
|
|
7869
|
-
const V = ji(
|
|
7869
|
+
const V = ji(...U), F = j;
|
|
7870
7870
|
return { seed: V, k2sig: function(H) {
|
|
7871
7871
|
const J = S(H);
|
|
7872
7872
|
if (!p(J)) return;
|
|
@@ -7917,7 +7917,7 @@ function Ll(e) {
|
|
|
7917
7917
|
}
|
|
7918
7918
|
if (x && R.hasHighS()) return !1;
|
|
7919
7919
|
P && (g = t.hash(g));
|
|
7920
|
-
const { r: Z, s:
|
|
7920
|
+
const { r: Z, s: U } = R, V = O(g), F = o(U), H = a(V * F), J = a(Z * F), Rt = (dt = c.BASE.multiplyAndAddUnsafe(j, H, J)) == null ? void 0 : dt.toAffine();
|
|
7921
7921
|
return !!Rt && a(Rt.x) === Z;
|
|
7922
7922
|
}, ProjectivePoint: c, Signature: I, utils: _ };
|
|
7923
7923
|
}
|
|
@@ -7956,13 +7956,13 @@ const sd = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefff
|
|
|
7956
7956
|
}(o, c, d), div: (c, d) => Xe(c * ra(d, e), e), sqrN: (c) => c * c, addN: (c, d) => c + d, subN: (c, d) => c - d, mulN: (c, d) => c * d, inv: (c) => ra(c, e), sqrt: n.sqrt || ((c) => a(o, c)), invertBatch: (c) => function(d, h) {
|
|
7957
7957
|
const p = new Array(h.length), w = h.reduce((A, I, _) => d.is0(I) ? A : (p[_] = A, d.mul(A, I)), d.ONE), v = d.inv(w);
|
|
7958
7958
|
return h.reduceRight((A, I, _) => d.is0(I) ? A : (p[_] = d.mul(A, p[_]), d.mul(A, I)), v), p;
|
|
7959
|
-
}(o, c), cmov: (c, d, h) => h ? d : c, toBytes: (c) => r ?
|
|
7959
|
+
}(o, c), cmov: (c, d, h) => h ? d : c, toBytes: (c) => r ? Oa(c, s) : Kn(c, s), fromBytes: (c) => {
|
|
7960
7960
|
if (c.length !== s) throw new Error(`Fp.fromBytes: expected ${s}, got ${c.length}`);
|
|
7961
|
-
return r ?
|
|
7961
|
+
return r ? Ca(c) : gn(c);
|
|
7962
7962
|
} });
|
|
7963
7963
|
return Object.freeze(o);
|
|
7964
7964
|
}(sd, void 0, void 0, { sqrt: function(e) {
|
|
7965
|
-
const t = sd, 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, p = or(h, r, t) * h % t, w = or(p, r, t) * h % t, v = or(w, na, t) * d % t, A = or(v, i, t) * v % t, I = or(A, s, t) * A % t, _ = or(I, o, t) * I % t, M = or(_, c, t) * _ % t, S = or(M, o, t) * I % t,
|
|
7965
|
+
const t = sd, 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, p = or(h, r, t) * h % t, w = or(p, r, t) * h % t, v = or(w, na, t) * d % t, A = or(v, i, t) * v % t, I = or(A, s, t) * A % t, _ = or(I, o, t) * I % t, M = or(_, c, t) * _ % t, S = or(M, o, t) * I % t, O = or(S, r, t) * h % t, k = or(O, a, t) * A % t, N = or(k, n, t) * d % t, L = or(N, na, t);
|
|
7966
7966
|
if (!ia.eql(ia.sqr(L), e)) throw new Error("Cannot find square root");
|
|
7967
7967
|
return L;
|
|
7968
7968
|
} }), Pa = function(e, t) {
|
|
@@ -7976,9 +7976,9 @@ const sd = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefff
|
|
|
7976
7976
|
return { k1neg: p, k1: d, k2neg: w, k2: h };
|
|
7977
7977
|
} } }, wl);
|
|
7978
7978
|
BigInt(0), Pa.ProjectivePoint;
|
|
7979
|
-
const
|
|
7979
|
+
const Ul = Object.freeze(Object.defineProperty({ __proto__: null, secp256k1: Pa }, Symbol.toStringTag, { value: "Module" }));
|
|
7980
7980
|
var po;
|
|
7981
|
-
const Zs = (po = Pa) !== null && po !== void 0 ? po :
|
|
7981
|
+
const Zs = (po = Pa) !== null && po !== void 0 ? po : Ul;
|
|
7982
7982
|
BigInt("0xffffffffffffffff"), BigInt("0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
|
|
7983
7983
|
Zs.CURVE.n;
|
|
7984
7984
|
var cd, dd, fd, hd, ud, ld;
|
|
@@ -8009,7 +8009,7 @@ function La(e) {
|
|
|
8009
8009
|
const t = af(e);
|
|
8010
8010
|
return t.length === 1 && t[0] < 128 ? t : oa(md(t.length, 128), t);
|
|
8011
8011
|
}
|
|
8012
|
-
function
|
|
8012
|
+
function On(e, t, r) {
|
|
8013
8013
|
if (r > e.length) throw new Error("invalid RLP (safeSlice): end slice of Uint8Array out-of-bounds");
|
|
8014
8014
|
return e.slice(t, r);
|
|
8015
8015
|
}
|
|
@@ -8034,23 +8034,23 @@ function sa(e) {
|
|
|
8034
8034
|
const a = [], o = e[0];
|
|
8035
8035
|
if (o <= 127) return { data: e.slice(0, 1), remainder: e.slice(1) };
|
|
8036
8036
|
if (o <= 183) {
|
|
8037
|
-
if (t = o - 127, n = o === 128 ? Uint8Array.from([]) :
|
|
8037
|
+
if (t = o - 127, n = o === 128 ? Uint8Array.from([]) : On(e, 1, t), t === 2 && n[0] < 128) throw new Error("invalid RLP encoding: invalid prefix, single byte < 0x80 are not prefixed");
|
|
8038
8038
|
return { data: n, remainder: e.slice(t) };
|
|
8039
8039
|
}
|
|
8040
8040
|
if (o <= 191) {
|
|
8041
8041
|
if (r = o - 182, e.length - 1 < r) throw new Error("invalid RLP: not enough bytes for string length");
|
|
8042
|
-
if (t = pd(
|
|
8043
|
-
return n =
|
|
8042
|
+
if (t = pd(On(e, 1, r)), t <= 55) throw new Error("invalid RLP: expected string length to be greater than 55");
|
|
8043
|
+
return n = On(e, r, t + r), { data: n, remainder: e.slice(t + r) };
|
|
8044
8044
|
}
|
|
8045
8045
|
if (o <= 247) {
|
|
8046
|
-
for (t = o - 191, i =
|
|
8046
|
+
for (t = o - 191, i = On(e, 1, t); i.length; ) s = sa(i), a.push(s.data), i = s.remainder;
|
|
8047
8047
|
return { data: a, remainder: e.slice(t) };
|
|
8048
8048
|
}
|
|
8049
8049
|
{
|
|
8050
|
-
if (r = o - 246, t = pd(
|
|
8050
|
+
if (r = o - 246, t = pd(On(e, 1, r)), t < 56) throw new Error("invalid RLP: encoded list too short");
|
|
8051
8051
|
const c = r + t;
|
|
8052
8052
|
if (c > e.length) throw new Error("invalid RLP: total length is larger than the data");
|
|
8053
|
-
for (i =
|
|
8053
|
+
for (i = On(e, r, c); i.length; ) s = sa(i), a.push(s.data), i = s.remainder;
|
|
8054
8054
|
return { data: a, remainder: e.slice(c) };
|
|
8055
8055
|
}
|
|
8056
8056
|
}
|
|
@@ -8110,25 +8110,25 @@ var yd;
|
|
|
8110
8110
|
(function(e) {
|
|
8111
8111
|
e.version = "1.2.2";
|
|
8112
8112
|
var t = function() {
|
|
8113
|
-
for (var S = 0,
|
|
8114
|
-
return typeof Int32Array < "u" ? new Int32Array(
|
|
8113
|
+
for (var S = 0, O = new Array(256), k = 0; k != 256; ++k) S = 1 & (S = 1 & (S = 1 & (S = 1 & (S = 1 & (S = 1 & (S = 1 & (S = 1 & (S = k) ? -306674912 ^ S >>> 1 : S >>> 1) ? -306674912 ^ S >>> 1 : S >>> 1) ? -306674912 ^ S >>> 1 : S >>> 1) ? -306674912 ^ S >>> 1 : S >>> 1) ? -306674912 ^ S >>> 1 : S >>> 1) ? -306674912 ^ S >>> 1 : S >>> 1) ? -306674912 ^ S >>> 1 : S >>> 1) ? -306674912 ^ S >>> 1 : S >>> 1, O[k] = S;
|
|
8114
|
+
return typeof Int32Array < "u" ? new Int32Array(O) : O;
|
|
8115
8115
|
}(), r = function(S) {
|
|
8116
|
-
var
|
|
8116
|
+
var O = 0, k = 0, N = 0, L = typeof Int32Array < "u" ? new Int32Array(4096) : new Array(4096);
|
|
8117
8117
|
for (N = 0; N != 256; ++N) L[N] = S[N];
|
|
8118
|
-
for (N = 0; N != 256; ++N) for (k = S[N],
|
|
8118
|
+
for (N = 0; N != 256; ++N) for (k = S[N], O = 256 + N; O < 4096; O += 256) k = L[O] = k >>> 8 ^ S[255 & k];
|
|
8119
8119
|
var z = [];
|
|
8120
8120
|
for (N = 1; N != 16; ++N) z[N - 1] = typeof Int32Array < "u" ? L.subarray(256 * N, 256 * N + 256) : L.slice(256 * N, 256 * N + 256);
|
|
8121
8121
|
return z;
|
|
8122
8122
|
}(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], p = r[8], w = r[9], v = r[10], A = r[11], I = r[12], _ = r[13], M = r[14];
|
|
8123
|
-
e.table = t, e.bstr = function(S,
|
|
8124
|
-
for (var k = ~
|
|
8123
|
+
e.table = t, e.bstr = function(S, O) {
|
|
8124
|
+
for (var k = ~O, N = 0, L = S.length; N < L; ) k = k >>> 8 ^ t[255 & (k ^ S.charCodeAt(N++))];
|
|
8125
8125
|
return ~k;
|
|
8126
|
-
}, e.buf = function(S,
|
|
8127
|
-
for (var k = ~
|
|
8126
|
+
}, e.buf = function(S, O) {
|
|
8127
|
+
for (var k = ~O, N = S.length - 15, L = 0; L < N; ) k = M[S[L++] ^ 255 & k] ^ _[S[L++] ^ k >> 8 & 255] ^ I[S[L++] ^ k >> 16 & 255] ^ A[S[L++] ^ k >>> 24] ^ v[S[L++]] ^ w[S[L++]] ^ p[S[L++]] ^ h[S[L++]] ^ d[S[L++]] ^ c[S[L++]] ^ o[S[L++]] ^ a[S[L++]] ^ s[S[L++]] ^ i[S[L++]] ^ n[S[L++]] ^ t[S[L++]];
|
|
8128
8128
|
for (N += 15; L < N; ) k = k >>> 8 ^ t[255 & (k ^ S[L++])];
|
|
8129
8129
|
return ~k;
|
|
8130
|
-
}, e.str = function(S,
|
|
8131
|
-
for (var k = ~
|
|
8130
|
+
}, e.str = function(S, O) {
|
|
8131
|
+
for (var k = ~O, N = 0, L = S.length, z = 0, f = 0; N < L; ) (z = S.charCodeAt(N++)) < 128 ? k = k >>> 8 ^ t[255 & (k ^ z)] : z < 2048 ? k = (k = k >>> 8 ^ t[255 & (k ^ (192 | z >> 6 & 31))]) >>> 8 ^ t[255 & (k ^ (128 | 63 & z))] : z >= 55296 && z < 57344 ? (z = 64 + (1023 & z), f = 1023 & S.charCodeAt(N++), k = (k = (k = (k = k >>> 8 ^ t[255 & (k ^ (240 | z >> 8 & 7))]) >>> 8 ^ t[255 & (k ^ (128 | z >> 2 & 63))]) >>> 8 ^ t[255 & (k ^ (128 | f >> 6 & 15 | (3 & z) << 4))]) >>> 8 ^ t[255 & (k ^ (128 | 63 & f))]) : k = (k = (k = k >>> 8 ^ t[255 & (k ^ (224 | z >> 12 & 15))]) >>> 8 ^ t[255 & (k ^ (128 | z >> 6 & 63))]) >>> 8 ^ t[255 & (k ^ (128 | 63 & z))];
|
|
8132
8132
|
return ~k;
|
|
8133
8133
|
};
|
|
8134
8134
|
})({}), function(e) {
|
|
@@ -8155,7 +8155,7 @@ ${n.byteLength}`)), s = t ? n : function(...a) {
|
|
|
8155
8155
|
return c;
|
|
8156
8156
|
}(i, n);
|
|
8157
8157
|
return Ta(s);
|
|
8158
|
-
},
|
|
8158
|
+
}, $l = (e, t) => {
|
|
8159
8159
|
const r = df(e), { messageHash: n, v: i, r: s, s: a, signature: o } = ((c, d) => {
|
|
8160
8160
|
const h = cf(d), p = Zs.sign(c.substring(2), h), w = p.toCompactRawBytes(), v = p.r.toString(16).padStart(64, "0"), A = p.s.toString(16).padStart(64, "0"), I = p.recovery + 27;
|
|
8161
8161
|
return { messageHash: c, v: tl(I), r: `0x${v}`, s: `0x${A}`, signature: `${Fs(w)}${I.toString(16)}` };
|
|
@@ -8170,56 +8170,56 @@ ${n.byteLength}`)), s = t ? n : function(...a) {
|
|
|
8170
8170
|
const d = `${r}${n.slice(2)}${t.slice(2)}`;
|
|
8171
8171
|
return ca(e, d, i);
|
|
8172
8172
|
}
|
|
8173
|
-
if (We(t)) throw new
|
|
8173
|
+
if (We(t)) throw new Cu("signature string undefined");
|
|
8174
8174
|
const s = df(e);
|
|
8175
8175
|
let a = parseInt(t.substring(130), 16);
|
|
8176
8176
|
a > 26 && (a -= 27);
|
|
8177
8177
|
const o = Zs.Signature.fromCompact(t.slice(2, 130)).addRecoveryBit(a).recoverPublicKey(s.replace("0x", "")).toRawBytes(!1), c = Ta(o.subarray(1));
|
|
8178
8178
|
return Ia(`0x${c.slice(-40)}`);
|
|
8179
8179
|
};
|
|
8180
|
-
class
|
|
8180
|
+
class Oe {
|
|
8181
8181
|
constructor(t) {
|
|
8182
8182
|
if (this.toAddress = () => {
|
|
8183
8183
|
if (this.isDirect()) {
|
|
8184
|
-
const r = this._iban.slice(4), n =
|
|
8184
|
+
const r = this._iban.slice(4), n = Oe._parseInt(r, 36), i = $0(n, 40);
|
|
8185
8185
|
return Ia(i);
|
|
8186
8186
|
}
|
|
8187
8187
|
throw new Error("Iban is indirect and cannot be converted. Must be length of 34 or 35");
|
|
8188
|
-
}, !
|
|
8188
|
+
}, !Oe.isIndirect(t) && !Oe.isDirect(t)) throw new Error("Invalid IBAN was provided");
|
|
8189
8189
|
this._iban = t;
|
|
8190
8190
|
}
|
|
8191
8191
|
static isDirect(t) {
|
|
8192
8192
|
return t.length === 34 || t.length === 35;
|
|
8193
8193
|
}
|
|
8194
8194
|
isDirect() {
|
|
8195
|
-
return
|
|
8195
|
+
return Oe.isDirect(this._iban);
|
|
8196
8196
|
}
|
|
8197
8197
|
static isIndirect(t) {
|
|
8198
8198
|
return t.length === 20;
|
|
8199
8199
|
}
|
|
8200
8200
|
isIndirect() {
|
|
8201
|
-
return
|
|
8201
|
+
return Oe.isIndirect(this._iban);
|
|
8202
8202
|
}
|
|
8203
8203
|
static isValid(t) {
|
|
8204
|
-
return /^XE[0-9]{2}(ETH[0-9A-Z]{13}|[0-9A-Z]{30,31})$/.test(t) &&
|
|
8204
|
+
return /^XE[0-9]{2}(ETH[0-9A-Z]{13}|[0-9A-Z]{30,31})$/.test(t) && Oe._mod9710(Oe._iso13616Prepare(t)) === 1;
|
|
8205
8205
|
}
|
|
8206
8206
|
isValid() {
|
|
8207
|
-
return
|
|
8207
|
+
return Oe.isValid(this._iban);
|
|
8208
8208
|
}
|
|
8209
8209
|
static fromBban(t) {
|
|
8210
8210
|
const r = `0${(98 - this._mod9710(this._iso13616Prepare(`XE00${t}`))).toString()}`.slice(-2);
|
|
8211
|
-
return new
|
|
8211
|
+
return new Oe(`XE${r}${t}`);
|
|
8212
8212
|
}
|
|
8213
8213
|
static createIndirect(t) {
|
|
8214
|
-
return
|
|
8214
|
+
return Oe.fromBban(`ETH${t.institution}${t.identifier}`);
|
|
8215
8215
|
}
|
|
8216
8216
|
static fromAddress(t) {
|
|
8217
8217
|
if (!wi(t)) throw new _1(t);
|
|
8218
|
-
const r = BigInt(((s) => (Di.validate(["hex"], [s]),
|
|
8219
|
-
return
|
|
8218
|
+
const r = BigInt(((s) => (Di.validate(["hex"], [s]), $s(s)))(t)), n = r.toString(36), i = $0(n, 15);
|
|
8219
|
+
return Oe.fromBban(i.toUpperCase());
|
|
8220
8220
|
}
|
|
8221
8221
|
static toIban(t) {
|
|
8222
|
-
return
|
|
8222
|
+
return Oe.fromAddress(t).toString();
|
|
8223
8223
|
}
|
|
8224
8224
|
client() {
|
|
8225
8225
|
return this.isIndirect() ? this._iban.slice(11) : "";
|
|
@@ -8234,17 +8234,17 @@ class Ce {
|
|
|
8234
8234
|
return this._iban;
|
|
8235
8235
|
}
|
|
8236
8236
|
}
|
|
8237
|
-
|
|
8237
|
+
Oe._iso13616Prepare = (e) => {
|
|
8238
8238
|
const n = e.toUpperCase();
|
|
8239
8239
|
return `${n.slice(4)}${n.slice(0, 4)}`.split("").map((i) => {
|
|
8240
8240
|
const s = i.charCodeAt(0);
|
|
8241
8241
|
return s >= 65 && s <= 90 ? s - 65 + 10 : i;
|
|
8242
8242
|
}).join("");
|
|
8243
|
-
},
|
|
8243
|
+
}, Oe._parseInt = (e, t) => [...e].reduce((r, n) => BigInt(parseInt(n, t)) + BigInt(t) * r, BigInt(0)), Oe._mod9710 = (e) => {
|
|
8244
8244
|
let t, r = e;
|
|
8245
8245
|
for (; r.length > 2; ) t = r.slice(0, 9), r = `${(parseInt(t, 10) % 97).toString()}${r.slice(t.length)}`;
|
|
8246
8246
|
return parseInt(r, 10) % 97;
|
|
8247
|
-
},
|
|
8247
|
+
}, Oe.toAddress = (e) => new Oe(e).toAddress(), function(e) {
|
|
8248
8248
|
if (!e.setImmediate) {
|
|
8249
8249
|
var t, r, n, i, s, a = 1, o = {}, c = !1, d = e.document, h = Object.getPrototypeOf && Object.getPrototypeOf(e);
|
|
8250
8250
|
h = h && h.setTimeout ? h : e, {}.toString.call(e.process) === "[object process]" ? t = function(v) {
|
|
@@ -8510,7 +8510,7 @@ class Wl {
|
|
|
8510
8510
|
})(t);
|
|
8511
8511
|
}
|
|
8512
8512
|
static signature(t, r) {
|
|
8513
|
-
return
|
|
8513
|
+
return $l(t, r);
|
|
8514
8514
|
}
|
|
8515
8515
|
static signatureValidity(t, r, n) {
|
|
8516
8516
|
try {
|
|
@@ -8523,396 +8523,396 @@ class Wl {
|
|
|
8523
8523
|
var da = { exports: {} };
|
|
8524
8524
|
(function(e) {
|
|
8525
8525
|
var t = function(T) {
|
|
8526
|
-
var
|
|
8527
|
-
if (T) for (
|
|
8526
|
+
var C, B = new Float64Array(16);
|
|
8527
|
+
if (T) for (C = 0; C < T.length; C++) B[C] = T[C];
|
|
8528
8528
|
return B;
|
|
8529
8529
|
}, r = function() {
|
|
8530
8530
|
throw new Error("no PRNG");
|
|
8531
8531
|
}, n = new Uint8Array(16), i = new Uint8Array(32);
|
|
8532
8532
|
i[0] = 9;
|
|
8533
8533
|
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]), p = t([26200, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214, 26214]), w = t([41136, 18958, 6951, 50414, 58488, 44335, 6150, 12099, 55207, 15867, 153, 11085, 57099, 20417, 9344, 11139]);
|
|
8534
|
-
function v(T,
|
|
8535
|
-
T[
|
|
8534
|
+
function v(T, C, B, b) {
|
|
8535
|
+
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;
|
|
8536
8536
|
}
|
|
8537
|
-
function A(T,
|
|
8538
|
-
var
|
|
8539
|
-
for (
|
|
8537
|
+
function A(T, C, B, b, E) {
|
|
8538
|
+
var $, D = 0;
|
|
8539
|
+
for ($ = 0; $ < E; $++) D |= T[C + $] ^ B[b + $];
|
|
8540
8540
|
return (1 & D - 1 >>> 8) - 1;
|
|
8541
8541
|
}
|
|
8542
|
-
function I(T,
|
|
8543
|
-
return A(T,
|
|
8542
|
+
function I(T, C, B, b) {
|
|
8543
|
+
return A(T, C, B, b, 16);
|
|
8544
8544
|
}
|
|
8545
|
-
function _(T,
|
|
8546
|
-
return A(T,
|
|
8545
|
+
function _(T, C, B, b) {
|
|
8546
|
+
return A(T, C, B, b, 32);
|
|
8547
8547
|
}
|
|
8548
|
-
function M(T,
|
|
8549
|
-
(function(E,
|
|
8550
|
-
for (var q, Y = 255 & W[0] | (255 & W[1]) << 8 | (255 & W[2]) << 16 | (255 & W[3]) << 24, gt = 255 & D[0] | (255 & D[1]) << 8 | (255 & D[2]) << 16 | (255 & D[3]) << 24, X = 255 & D[4] | (255 & D[5]) << 8 | (255 & D[6]) << 16 | (255 & D[7]) << 24, ct = 255 & D[8] | (255 & D[9]) << 8 | (255 & D[10]) << 16 | (255 & D[11]) << 24, wt = 255 & D[12] | (255 & D[13]) << 8 | (255 & D[14]) << 16 | (255 & D[15]) << 24, nt = 255 & W[4] | (255 & W[5]) << 8 | (255 & W[6]) << 16 | (255 & W[7]) << 24, ht = 255 &
|
|
8551
|
-
Q = Q + Y | 0, st = st + gt | 0, tt = tt + X | 0, et = et + ct | 0, rt = rt + wt | 0,
|
|
8552
|
-
})(T,
|
|
8548
|
+
function M(T, C, B, b) {
|
|
8549
|
+
(function(E, $, D, W) {
|
|
8550
|
+
for (var q, Y = 255 & W[0] | (255 & W[1]) << 8 | (255 & W[2]) << 16 | (255 & W[3]) << 24, gt = 255 & D[0] | (255 & D[1]) << 8 | (255 & D[2]) << 16 | (255 & D[3]) << 24, X = 255 & D[4] | (255 & D[5]) << 8 | (255 & D[6]) << 16 | (255 & D[7]) << 24, ct = 255 & D[8] | (255 & D[9]) << 8 | (255 & D[10]) << 16 | (255 & D[11]) << 24, wt = 255 & D[12] | (255 & D[13]) << 8 | (255 & D[14]) << 16 | (255 & D[15]) << 24, nt = 255 & W[4] | (255 & W[5]) << 8 | (255 & W[6]) << 16 | (255 & W[7]) << 24, ht = 255 & $[0] | (255 & $[1]) << 8 | (255 & $[2]) << 16 | (255 & $[3]) << 24, xt = 255 & $[4] | (255 & $[5]) << 8 | (255 & $[6]) << 16 | (255 & $[7]) << 24, ot = 255 & $[8] | (255 & $[9]) << 8 | (255 & $[10]) << 16 | (255 & $[11]) << 24, ut = 255 & $[12] | (255 & $[13]) << 8 | (255 & $[14]) << 16 | (255 & $[15]) << 24, At = 255 & W[8] | (255 & W[9]) << 8 | (255 & W[10]) << 16 | (255 & W[11]) << 24, it = 255 & D[16] | (255 & D[17]) << 8 | (255 & D[18]) << 16 | (255 & D[19]) << 24, lt = 255 & D[20] | (255 & D[21]) << 8 | (255 & D[22]) << 16 | (255 & D[23]) << 24, Bt = 255 & D[24] | (255 & D[25]) << 8 | (255 & D[26]) << 16 | (255 & D[27]) << 24, at = 255 & D[28] | (255 & D[29]) << 8 | (255 & D[30]) << 16 | (255 & D[31]) << 24, K = 255 & W[12] | (255 & W[13]) << 8 | (255 & W[14]) << 16 | (255 & W[15]) << 24, Q = Y, st = gt, tt = X, et = ct, rt = wt, Ot = nt, zt = ht, Ct = xt, Kt = ot, Qt = ut, Xt = At, St = it, It = lt, Tt = Bt, Nt = at, _t = K, jt = 0; jt < 20; jt += 2) Q ^= (q = (It ^= (q = (Kt ^= (q = (rt ^= (q = Q + It | 0) << 7 | q >>> 25) + Q | 0) << 9 | q >>> 23) + rt | 0) << 13 | q >>> 19) + Kt | 0) << 18 | q >>> 14, Ot ^= (q = (st ^= (q = (Tt ^= (q = (Qt ^= (q = Ot + st | 0) << 7 | q >>> 25) + Ot | 0) << 9 | q >>> 23) + Qt | 0) << 13 | q >>> 19) + Tt | 0) << 18 | q >>> 14, Xt ^= (q = (zt ^= (q = (tt ^= (q = (Nt ^= (q = Xt + zt | 0) << 7 | q >>> 25) + Xt | 0) << 9 | q >>> 23) + Nt | 0) << 13 | q >>> 19) + tt | 0) << 18 | q >>> 14, _t ^= (q = (St ^= (q = (Ct ^= (q = (et ^= (q = _t + St | 0) << 7 | q >>> 25) + _t | 0) << 9 | q >>> 23) + et | 0) << 13 | q >>> 19) + Ct | 0) << 18 | q >>> 14, Q ^= (q = (et ^= (q = (tt ^= (q = (st ^= (q = Q + et | 0) << 7 | q >>> 25) + Q | 0) << 9 | q >>> 23) + st | 0) << 13 | q >>> 19) + tt | 0) << 18 | q >>> 14, Ot ^= (q = (rt ^= (q = (Ct ^= (q = (zt ^= (q = Ot + rt | 0) << 7 | q >>> 25) + Ot | 0) << 9 | q >>> 23) + zt | 0) << 13 | q >>> 19) + Ct | 0) << 18 | q >>> 14, Xt ^= (q = (Qt ^= (q = (Kt ^= (q = (St ^= (q = Xt + Qt | 0) << 7 | q >>> 25) + Xt | 0) << 9 | q >>> 23) + St | 0) << 13 | q >>> 19) + Kt | 0) << 18 | q >>> 14, _t ^= (q = (Nt ^= (q = (Tt ^= (q = (It ^= (q = _t + Nt | 0) << 7 | q >>> 25) + _t | 0) << 9 | q >>> 23) + It | 0) << 13 | q >>> 19) + Tt | 0) << 18 | q >>> 14;
|
|
8551
|
+
Q = Q + Y | 0, st = st + gt | 0, tt = tt + X | 0, et = et + ct | 0, rt = rt + wt | 0, Ot = Ot + nt | 0, zt = zt + ht | 0, Ct = Ct + xt | 0, Kt = Kt + ot | 0, Qt = Qt + ut | 0, Xt = Xt + At | 0, St = St + it | 0, It = It + lt | 0, Tt = Tt + Bt | 0, Nt = Nt + at | 0, _t = _t + K | 0, E[0] = Q >>> 0 & 255, E[1] = Q >>> 8 & 255, E[2] = Q >>> 16 & 255, E[3] = Q >>> 24 & 255, E[4] = st >>> 0 & 255, E[5] = st >>> 8 & 255, E[6] = st >>> 16 & 255, E[7] = st >>> 24 & 255, E[8] = tt >>> 0 & 255, E[9] = tt >>> 8 & 255, E[10] = tt >>> 16 & 255, E[11] = tt >>> 24 & 255, E[12] = et >>> 0 & 255, E[13] = et >>> 8 & 255, E[14] = et >>> 16 & 255, E[15] = et >>> 24 & 255, E[16] = rt >>> 0 & 255, E[17] = rt >>> 8 & 255, E[18] = rt >>> 16 & 255, E[19] = rt >>> 24 & 255, E[20] = Ot >>> 0 & 255, E[21] = Ot >>> 8 & 255, E[22] = Ot >>> 16 & 255, E[23] = Ot >>> 24 & 255, E[24] = zt >>> 0 & 255, E[25] = zt >>> 8 & 255, E[26] = zt >>> 16 & 255, E[27] = zt >>> 24 & 255, E[28] = Ct >>> 0 & 255, E[29] = Ct >>> 8 & 255, E[30] = Ct >>> 16 & 255, E[31] = Ct >>> 24 & 255, E[32] = Kt >>> 0 & 255, E[33] = Kt >>> 8 & 255, E[34] = Kt >>> 16 & 255, E[35] = Kt >>> 24 & 255, E[36] = Qt >>> 0 & 255, E[37] = Qt >>> 8 & 255, E[38] = Qt >>> 16 & 255, E[39] = Qt >>> 24 & 255, E[40] = Xt >>> 0 & 255, E[41] = Xt >>> 8 & 255, E[42] = Xt >>> 16 & 255, E[43] = Xt >>> 24 & 255, E[44] = St >>> 0 & 255, E[45] = St >>> 8 & 255, E[46] = St >>> 16 & 255, E[47] = St >>> 24 & 255, E[48] = It >>> 0 & 255, E[49] = It >>> 8 & 255, E[50] = It >>> 16 & 255, E[51] = It >>> 24 & 255, E[52] = Tt >>> 0 & 255, E[53] = Tt >>> 8 & 255, E[54] = Tt >>> 16 & 255, E[55] = Tt >>> 24 & 255, E[56] = Nt >>> 0 & 255, E[57] = Nt >>> 8 & 255, E[58] = Nt >>> 16 & 255, E[59] = Nt >>> 24 & 255, E[60] = _t >>> 0 & 255, E[61] = _t >>> 8 & 255, E[62] = _t >>> 16 & 255, E[63] = _t >>> 24 & 255;
|
|
8552
|
+
})(T, C, B, b);
|
|
8553
8553
|
}
|
|
8554
|
-
function S(T,
|
|
8555
|
-
(function(E,
|
|
8556
|
-
for (var q, Y = 255 & W[0] | (255 & W[1]) << 8 | (255 & W[2]) << 16 | (255 & W[3]) << 24, gt = 255 & D[0] | (255 & D[1]) << 8 | (255 & D[2]) << 16 | (255 & D[3]) << 24, X = 255 & D[4] | (255 & D[5]) << 8 | (255 & D[6]) << 16 | (255 & D[7]) << 24, ct = 255 & D[8] | (255 & D[9]) << 8 | (255 & D[10]) << 16 | (255 & D[11]) << 24, wt = 255 & D[12] | (255 & D[13]) << 8 | (255 & D[14]) << 16 | (255 & D[15]) << 24, nt = 255 & W[4] | (255 & W[5]) << 8 | (255 & W[6]) << 16 | (255 & W[7]) << 24, ht = 255 &
|
|
8554
|
+
function S(T, C, B, b) {
|
|
8555
|
+
(function(E, $, D, W) {
|
|
8556
|
+
for (var q, Y = 255 & W[0] | (255 & W[1]) << 8 | (255 & W[2]) << 16 | (255 & W[3]) << 24, gt = 255 & D[0] | (255 & D[1]) << 8 | (255 & D[2]) << 16 | (255 & D[3]) << 24, X = 255 & D[4] | (255 & D[5]) << 8 | (255 & D[6]) << 16 | (255 & D[7]) << 24, ct = 255 & D[8] | (255 & D[9]) << 8 | (255 & D[10]) << 16 | (255 & D[11]) << 24, wt = 255 & D[12] | (255 & D[13]) << 8 | (255 & D[14]) << 16 | (255 & D[15]) << 24, nt = 255 & W[4] | (255 & W[5]) << 8 | (255 & W[6]) << 16 | (255 & W[7]) << 24, ht = 255 & $[0] | (255 & $[1]) << 8 | (255 & $[2]) << 16 | (255 & $[3]) << 24, xt = 255 & $[4] | (255 & $[5]) << 8 | (255 & $[6]) << 16 | (255 & $[7]) << 24, ot = 255 & $[8] | (255 & $[9]) << 8 | (255 & $[10]) << 16 | (255 & $[11]) << 24, ut = 255 & $[12] | (255 & $[13]) << 8 | (255 & $[14]) << 16 | (255 & $[15]) << 24, At = 255 & W[8] | (255 & W[9]) << 8 | (255 & W[10]) << 16 | (255 & W[11]) << 24, it = 255 & D[16] | (255 & D[17]) << 8 | (255 & D[18]) << 16 | (255 & D[19]) << 24, lt = 255 & D[20] | (255 & D[21]) << 8 | (255 & D[22]) << 16 | (255 & D[23]) << 24, Bt = 255 & D[24] | (255 & D[25]) << 8 | (255 & D[26]) << 16 | (255 & D[27]) << 24, at = 255 & D[28] | (255 & D[29]) << 8 | (255 & D[30]) << 16 | (255 & D[31]) << 24, K = 255 & W[12] | (255 & W[13]) << 8 | (255 & W[14]) << 16 | (255 & W[15]) << 24, Q = 0; Q < 20; Q += 2) Y ^= (q = (lt ^= (q = (ot ^= (q = (wt ^= (q = Y + lt | 0) << 7 | q >>> 25) + Y | 0) << 9 | q >>> 23) + wt | 0) << 13 | q >>> 19) + ot | 0) << 18 | q >>> 14, nt ^= (q = (gt ^= (q = (Bt ^= (q = (ut ^= (q = nt + gt | 0) << 7 | q >>> 25) + nt | 0) << 9 | q >>> 23) + ut | 0) << 13 | q >>> 19) + Bt | 0) << 18 | q >>> 14, At ^= (q = (ht ^= (q = (X ^= (q = (at ^= (q = At + ht | 0) << 7 | q >>> 25) + At | 0) << 9 | q >>> 23) + at | 0) << 13 | q >>> 19) + X | 0) << 18 | q >>> 14, K ^= (q = (it ^= (q = (xt ^= (q = (ct ^= (q = K + it | 0) << 7 | q >>> 25) + K | 0) << 9 | q >>> 23) + ct | 0) << 13 | q >>> 19) + xt | 0) << 18 | q >>> 14, Y ^= (q = (ct ^= (q = (X ^= (q = (gt ^= (q = Y + ct | 0) << 7 | q >>> 25) + Y | 0) << 9 | q >>> 23) + gt | 0) << 13 | q >>> 19) + X | 0) << 18 | q >>> 14, nt ^= (q = (wt ^= (q = (xt ^= (q = (ht ^= (q = nt + wt | 0) << 7 | q >>> 25) + nt | 0) << 9 | q >>> 23) + ht | 0) << 13 | q >>> 19) + xt | 0) << 18 | q >>> 14, At ^= (q = (ut ^= (q = (ot ^= (q = (it ^= (q = At + ut | 0) << 7 | q >>> 25) + At | 0) << 9 | q >>> 23) + it | 0) << 13 | q >>> 19) + ot | 0) << 18 | q >>> 14, K ^= (q = (at ^= (q = (Bt ^= (q = (lt ^= (q = K + at | 0) << 7 | q >>> 25) + K | 0) << 9 | q >>> 23) + lt | 0) << 13 | q >>> 19) + Bt | 0) << 18 | q >>> 14;
|
|
8557
8557
|
E[0] = Y >>> 0 & 255, E[1] = Y >>> 8 & 255, E[2] = Y >>> 16 & 255, E[3] = Y >>> 24 & 255, E[4] = nt >>> 0 & 255, E[5] = nt >>> 8 & 255, E[6] = nt >>> 16 & 255, E[7] = nt >>> 24 & 255, E[8] = At >>> 0 & 255, E[9] = At >>> 8 & 255, E[10] = At >>> 16 & 255, E[11] = At >>> 24 & 255, E[12] = K >>> 0 & 255, E[13] = K >>> 8 & 255, E[14] = K >>> 16 & 255, E[15] = K >>> 24 & 255, E[16] = ht >>> 0 & 255, E[17] = ht >>> 8 & 255, E[18] = ht >>> 16 & 255, E[19] = ht >>> 24 & 255, E[20] = xt >>> 0 & 255, E[21] = xt >>> 8 & 255, E[22] = xt >>> 16 & 255, E[23] = xt >>> 24 & 255, E[24] = ot >>> 0 & 255, E[25] = ot >>> 8 & 255, E[26] = ot >>> 16 & 255, E[27] = ot >>> 24 & 255, E[28] = ut >>> 0 & 255, E[29] = ut >>> 8 & 255, E[30] = ut >>> 16 & 255, E[31] = ut >>> 24 & 255;
|
|
8558
|
-
})(T,
|
|
8558
|
+
})(T, C, B, b);
|
|
8559
8559
|
}
|
|
8560
|
-
var
|
|
8561
|
-
function k(T,
|
|
8560
|
+
var O = new Uint8Array([101, 120, 112, 97, 110, 100, 32, 51, 50, 45, 98, 121, 116, 101, 32, 107]);
|
|
8561
|
+
function k(T, C, B, b, E, $, D) {
|
|
8562
8562
|
var W, q, Y = new Uint8Array(16), gt = new Uint8Array(64);
|
|
8563
8563
|
for (q = 0; q < 16; q++) Y[q] = 0;
|
|
8564
|
-
for (q = 0; q < 8; q++) Y[q] =
|
|
8564
|
+
for (q = 0; q < 8; q++) Y[q] = $[q];
|
|
8565
8565
|
for (; E >= 64; ) {
|
|
8566
|
-
for (M(gt, Y, D,
|
|
8566
|
+
for (M(gt, Y, D, O), q = 0; q < 64; q++) T[C + q] = B[b + q] ^ gt[q];
|
|
8567
8567
|
for (W = 1, q = 8; q < 16; q++) W = W + (255 & Y[q]) | 0, Y[q] = 255 & W, W >>>= 8;
|
|
8568
|
-
E -= 64,
|
|
8568
|
+
E -= 64, C += 64, b += 64;
|
|
8569
8569
|
}
|
|
8570
|
-
if (E > 0) for (M(gt, Y, D,
|
|
8570
|
+
if (E > 0) for (M(gt, Y, D, O), q = 0; q < E; q++) T[C + q] = B[b + q] ^ gt[q];
|
|
8571
8571
|
return 0;
|
|
8572
8572
|
}
|
|
8573
|
-
function N(T,
|
|
8574
|
-
var
|
|
8573
|
+
function N(T, C, B, b, E) {
|
|
8574
|
+
var $, D, W = new Uint8Array(16), q = new Uint8Array(64);
|
|
8575
8575
|
for (D = 0; D < 16; D++) W[D] = 0;
|
|
8576
8576
|
for (D = 0; D < 8; D++) W[D] = b[D];
|
|
8577
8577
|
for (; B >= 64; ) {
|
|
8578
|
-
for (M(q, W, E,
|
|
8579
|
-
for (
|
|
8580
|
-
B -= 64,
|
|
8578
|
+
for (M(q, W, E, O), D = 0; D < 64; D++) T[C + D] = q[D];
|
|
8579
|
+
for ($ = 1, D = 8; D < 16; D++) $ = $ + (255 & W[D]) | 0, W[D] = 255 & $, $ >>>= 8;
|
|
8580
|
+
B -= 64, C += 64;
|
|
8581
8581
|
}
|
|
8582
|
-
if (B > 0) for (M(q, W, E,
|
|
8582
|
+
if (B > 0) for (M(q, W, E, O), D = 0; D < B; D++) T[C + D] = q[D];
|
|
8583
8583
|
return 0;
|
|
8584
8584
|
}
|
|
8585
|
-
function L(T,
|
|
8586
|
-
var
|
|
8587
|
-
S(
|
|
8585
|
+
function L(T, C, B, b, E) {
|
|
8586
|
+
var $ = new Uint8Array(32);
|
|
8587
|
+
S($, b, E, O);
|
|
8588
8588
|
for (var D = new Uint8Array(8), W = 0; W < 8; W++) D[W] = b[W + 16];
|
|
8589
|
-
return N(T,
|
|
8589
|
+
return N(T, C, B, D, $);
|
|
8590
8590
|
}
|
|
8591
|
-
function z(T,
|
|
8591
|
+
function z(T, C, B, b, E, $, D) {
|
|
8592
8592
|
var W = new Uint8Array(32);
|
|
8593
|
-
S(W,
|
|
8594
|
-
for (var q = new Uint8Array(8), Y = 0; Y < 8; Y++) q[Y] =
|
|
8595
|
-
return k(T,
|
|
8593
|
+
S(W, $, D, O);
|
|
8594
|
+
for (var q = new Uint8Array(8), Y = 0; Y < 8; Y++) q[Y] = $[Y + 16];
|
|
8595
|
+
return k(T, C, B, b, E, q, W);
|
|
8596
8596
|
}
|
|
8597
8597
|
var f = function(T) {
|
|
8598
|
-
var
|
|
8599
|
-
this.buffer = new Uint8Array(16), this.r = new Uint16Array(10), this.h = new Uint16Array(10), this.pad = new Uint16Array(8), this.leftover = 0, this.fin = 0,
|
|
8598
|
+
var C, B, b, E, $, D, W, q;
|
|
8599
|
+
this.buffer = new Uint8Array(16), this.r = new Uint16Array(10), this.h = new Uint16Array(10), this.pad = new Uint16Array(8), this.leftover = 0, this.fin = 0, C = 255 & T[0] | (255 & T[1]) << 8, this.r[0] = 8191 & C, B = 255 & T[2] | (255 & T[3]) << 8, this.r[1] = 8191 & (C >>> 13 | B << 3), b = 255 & T[4] | (255 & T[5]) << 8, this.r[2] = 7939 & (B >>> 10 | b << 6), E = 255 & T[6] | (255 & T[7]) << 8, this.r[3] = 8191 & (b >>> 7 | E << 9), $ = 255 & T[8] | (255 & T[9]) << 8, this.r[4] = 255 & (E >>> 4 | $ << 12), this.r[5] = $ >>> 1 & 8190, D = 255 & T[10] | (255 & T[11]) << 8, this.r[6] = 8191 & ($ >>> 14 | D << 2), W = 255 & T[12] | (255 & T[13]) << 8, this.r[7] = 8065 & (D >>> 11 | W << 5), q = 255 & T[14] | (255 & T[15]) << 8, this.r[8] = 8191 & (W >>> 8 | q << 8), this.r[9] = q >>> 5 & 127, this.pad[0] = 255 & T[16] | (255 & T[17]) << 8, this.pad[1] = 255 & T[18] | (255 & T[19]) << 8, this.pad[2] = 255 & T[20] | (255 & T[21]) << 8, this.pad[3] = 255 & T[22] | (255 & T[23]) << 8, this.pad[4] = 255 & T[24] | (255 & T[25]) << 8, this.pad[5] = 255 & T[26] | (255 & T[27]) << 8, this.pad[6] = 255 & T[28] | (255 & T[29]) << 8, this.pad[7] = 255 & T[30] | (255 & T[31]) << 8;
|
|
8600
8600
|
};
|
|
8601
|
-
function l(T,
|
|
8602
|
-
var D = new f(
|
|
8603
|
-
return D.update(B, b, E), D.finish(T,
|
|
8601
|
+
function l(T, C, B, b, E, $) {
|
|
8602
|
+
var D = new f($);
|
|
8603
|
+
return D.update(B, b, E), D.finish(T, C), 0;
|
|
8604
8604
|
}
|
|
8605
|
-
function g(T,
|
|
8605
|
+
function g(T, C, B, b, E, $) {
|
|
8606
8606
|
var D = new Uint8Array(16);
|
|
8607
|
-
return l(D, 0, B, b, E,
|
|
8607
|
+
return l(D, 0, B, b, E, $), I(T, C, D, 0);
|
|
8608
8608
|
}
|
|
8609
|
-
function m(T,
|
|
8610
|
-
var
|
|
8609
|
+
function m(T, C, B, b, E) {
|
|
8610
|
+
var $;
|
|
8611
8611
|
if (B < 32) return -1;
|
|
8612
|
-
for (z(T, 0,
|
|
8612
|
+
for (z(T, 0, C, 0, B, b, E), l(T, 16, T, 32, B - 32, T), $ = 0; $ < 16; $++) T[$] = 0;
|
|
8613
8613
|
return 0;
|
|
8614
8614
|
}
|
|
8615
|
-
function u(T,
|
|
8616
|
-
var
|
|
8617
|
-
if (B < 32 || (L(D, 0, 32, b, E), g(
|
|
8618
|
-
for (z(T, 0,
|
|
8615
|
+
function u(T, C, B, b, E) {
|
|
8616
|
+
var $, D = new Uint8Array(32);
|
|
8617
|
+
if (B < 32 || (L(D, 0, 32, b, E), g(C, 16, C, 32, B - 32, D) !== 0)) return -1;
|
|
8618
|
+
for (z(T, 0, C, 0, B, b, E), $ = 0; $ < 32; $++) T[$] = 0;
|
|
8619
8619
|
return 0;
|
|
8620
8620
|
}
|
|
8621
|
-
function y(T,
|
|
8621
|
+
function y(T, C) {
|
|
8622
8622
|
var B;
|
|
8623
|
-
for (B = 0; B < 16; B++) T[B] = 0 |
|
|
8623
|
+
for (B = 0; B < 16; B++) T[B] = 0 | C[B];
|
|
8624
8624
|
}
|
|
8625
8625
|
function x(T) {
|
|
8626
|
-
var
|
|
8627
|
-
for (
|
|
8626
|
+
var C, B, b = 1;
|
|
8627
|
+
for (C = 0; C < 16; C++) B = T[C] + b + 65535, b = Math.floor(B / 65536), T[C] = B - 65536 * b;
|
|
8628
8628
|
T[0] += b - 1 + 37 * (b - 1);
|
|
8629
8629
|
}
|
|
8630
|
-
function P(T,
|
|
8631
|
-
for (var b, E = ~(B - 1),
|
|
8630
|
+
function P(T, C, B) {
|
|
8631
|
+
for (var b, E = ~(B - 1), $ = 0; $ < 16; $++) b = E & (T[$] ^ C[$]), T[$] ^= b, C[$] ^= b;
|
|
8632
8632
|
}
|
|
8633
|
-
function R(T,
|
|
8634
|
-
var B, b, E,
|
|
8635
|
-
for (B = 0; B < 16; B++) D[B] =
|
|
8633
|
+
function R(T, C) {
|
|
8634
|
+
var B, b, E, $ = t(), D = t();
|
|
8635
|
+
for (B = 0; B < 16; B++) D[B] = C[B];
|
|
8636
8636
|
for (x(D), x(D), x(D), b = 0; b < 2; b++) {
|
|
8637
|
-
for (
|
|
8638
|
-
|
|
8637
|
+
for ($[0] = D[0] - 65517, B = 1; B < 15; B++) $[B] = D[B] - 65535 - ($[B - 1] >> 16 & 1), $[B - 1] &= 65535;
|
|
8638
|
+
$[15] = D[15] - 32767 - ($[14] >> 16 & 1), E = $[15] >> 16 & 1, $[14] &= 65535, P(D, $, 1 - E);
|
|
8639
8639
|
}
|
|
8640
8640
|
for (B = 0; B < 16; B++) T[2 * B] = 255 & D[B], T[2 * B + 1] = D[B] >> 8;
|
|
8641
8641
|
}
|
|
8642
|
-
function j(T,
|
|
8642
|
+
function j(T, C) {
|
|
8643
8643
|
var B = new Uint8Array(32), b = new Uint8Array(32);
|
|
8644
|
-
return R(B, T), R(b,
|
|
8644
|
+
return R(B, T), R(b, C), _(B, 0, b, 0);
|
|
8645
8645
|
}
|
|
8646
8646
|
function Z(T) {
|
|
8647
|
-
var
|
|
8648
|
-
return R(
|
|
8647
|
+
var C = new Uint8Array(32);
|
|
8648
|
+
return R(C, T), 1 & C[0];
|
|
8649
8649
|
}
|
|
8650
|
-
function
|
|
8650
|
+
function U(T, C) {
|
|
8651
8651
|
var B;
|
|
8652
|
-
for (B = 0; B < 16; B++) T[B] =
|
|
8652
|
+
for (B = 0; B < 16; B++) T[B] = C[2 * B] + (C[2 * B + 1] << 8);
|
|
8653
8653
|
T[15] &= 32767;
|
|
8654
8654
|
}
|
|
8655
|
-
function V(T,
|
|
8656
|
-
for (var b = 0; b < 16; b++) T[b] =
|
|
8655
|
+
function V(T, C, B) {
|
|
8656
|
+
for (var b = 0; b < 16; b++) T[b] = C[b] + B[b];
|
|
8657
8657
|
}
|
|
8658
|
-
function F(T,
|
|
8659
|
-
for (var b = 0; b < 16; b++) T[b] =
|
|
8658
|
+
function F(T, C, B) {
|
|
8659
|
+
for (var b = 0; b < 16; b++) T[b] = C[b] - B[b];
|
|
8660
8660
|
}
|
|
8661
|
-
function H(T,
|
|
8662
|
-
var b, E,
|
|
8663
|
-
|
|
8661
|
+
function H(T, C, B) {
|
|
8662
|
+
var b, E, $ = 0, D = 0, W = 0, q = 0, Y = 0, gt = 0, X = 0, ct = 0, wt = 0, nt = 0, ht = 0, xt = 0, ot = 0, ut = 0, At = 0, it = 0, lt = 0, Bt = 0, at = 0, K = 0, Q = 0, st = 0, tt = 0, et = 0, rt = 0, Ot = 0, zt = 0, Ct = 0, Kt = 0, Qt = 0, Xt = 0, St = B[0], It = B[1], Tt = B[2], Nt = B[3], _t = B[4], jt = B[5], $t = B[6], me = B[7], he = B[8], ye = B[9], ge = B[10], _e = B[11], ke = B[12], Ue = B[13], qe = B[14], $e = B[15];
|
|
8663
|
+
$ += (b = C[0]) * St, D += b * It, W += b * Tt, q += b * Nt, Y += b * _t, gt += b * jt, X += b * $t, ct += b * me, wt += b * he, nt += b * ye, ht += b * ge, xt += b * _e, ot += b * ke, ut += b * Ue, At += b * qe, it += b * $e, D += (b = C[1]) * St, W += b * It, q += b * Tt, Y += b * Nt, gt += b * _t, X += b * jt, ct += b * $t, wt += b * me, nt += b * he, ht += b * ye, xt += b * ge, ot += b * _e, ut += b * ke, At += b * Ue, it += b * qe, lt += b * $e, W += (b = C[2]) * St, q += b * It, Y += b * Tt, gt += b * Nt, X += b * _t, ct += b * jt, wt += b * $t, nt += b * me, ht += b * he, xt += b * ye, ot += b * ge, ut += b * _e, At += b * ke, it += b * Ue, lt += b * qe, Bt += b * $e, q += (b = C[3]) * St, Y += b * It, gt += b * Tt, X += b * Nt, ct += b * _t, wt += b * jt, nt += b * $t, ht += b * me, xt += b * he, ot += b * ye, ut += b * ge, At += b * _e, it += b * ke, lt += b * Ue, Bt += b * qe, at += b * $e, Y += (b = C[4]) * St, gt += b * It, X += b * Tt, ct += b * Nt, wt += b * _t, nt += b * jt, ht += b * $t, xt += b * me, ot += b * he, ut += b * ye, At += b * ge, it += b * _e, lt += b * ke, Bt += b * Ue, at += b * qe, K += b * $e, gt += (b = C[5]) * St, X += b * It, ct += b * Tt, wt += b * Nt, nt += b * _t, ht += b * jt, xt += b * $t, ot += b * me, ut += b * he, At += b * ye, it += b * ge, lt += b * _e, Bt += b * ke, at += b * Ue, K += b * qe, Q += b * $e, X += (b = C[6]) * St, ct += b * It, wt += b * Tt, nt += b * Nt, ht += b * _t, xt += b * jt, ot += b * $t, ut += b * me, At += b * he, it += b * ye, lt += b * ge, Bt += b * _e, at += b * ke, K += b * Ue, Q += b * qe, st += b * $e, ct += (b = C[7]) * St, wt += b * It, nt += b * Tt, ht += b * Nt, xt += b * _t, ot += b * jt, ut += b * $t, At += b * me, it += b * he, lt += b * ye, Bt += b * ge, at += b * _e, K += b * ke, Q += b * Ue, st += b * qe, tt += b * $e, wt += (b = C[8]) * St, nt += b * It, ht += b * Tt, xt += b * Nt, ot += b * _t, ut += b * jt, At += b * $t, it += b * me, lt += b * he, Bt += b * ye, at += b * ge, K += b * _e, Q += b * ke, st += b * Ue, tt += b * qe, et += b * $e, nt += (b = C[9]) * St, ht += b * It, xt += b * Tt, ot += b * Nt, ut += b * _t, At += b * jt, it += b * $t, lt += b * me, Bt += b * he, at += b * ye, K += b * ge, Q += b * _e, st += b * ke, tt += b * Ue, et += b * qe, rt += b * $e, ht += (b = C[10]) * St, xt += b * It, ot += b * Tt, ut += b * Nt, At += b * _t, it += b * jt, lt += b * $t, Bt += b * me, at += b * he, K += b * ye, Q += b * ge, st += b * _e, tt += b * ke, et += b * Ue, rt += b * qe, Ot += b * $e, xt += (b = C[11]) * St, ot += b * It, ut += b * Tt, At += b * Nt, it += b * _t, lt += b * jt, Bt += b * $t, at += b * me, K += b * he, Q += b * ye, st += b * ge, tt += b * _e, et += b * ke, rt += b * Ue, Ot += b * qe, zt += b * $e, ot += (b = C[12]) * St, ut += b * It, At += b * Tt, it += b * Nt, lt += b * _t, Bt += b * jt, at += b * $t, K += b * me, Q += b * he, st += b * ye, tt += b * ge, et += b * _e, rt += b * ke, Ot += b * Ue, zt += b * qe, Ct += b * $e, ut += (b = C[13]) * St, At += b * It, it += b * Tt, lt += b * Nt, Bt += b * _t, at += b * jt, K += b * $t, Q += b * me, st += b * he, tt += b * ye, et += b * ge, rt += b * _e, Ot += b * ke, zt += b * Ue, Ct += b * qe, Kt += b * $e, At += (b = C[14]) * St, it += b * It, lt += b * Tt, Bt += b * Nt, at += b * _t, K += b * jt, Q += b * $t, st += b * me, tt += b * he, et += b * ye, rt += b * ge, Ot += b * _e, zt += b * ke, Ct += b * Ue, Kt += b * qe, Qt += b * $e, it += (b = C[15]) * St, D += 38 * (Bt += b * Tt), W += 38 * (at += b * Nt), q += 38 * (K += b * _t), Y += 38 * (Q += b * jt), gt += 38 * (st += b * $t), X += 38 * (tt += b * me), ct += 38 * (et += b * he), wt += 38 * (rt += b * ye), nt += 38 * (Ot += b * ge), ht += 38 * (zt += b * _e), xt += 38 * (Ct += b * ke), ot += 38 * (Kt += b * Ue), ut += 38 * (Qt += b * qe), At += 38 * (Xt += b * $e), $ = (b = ($ += 38 * (lt += b * It)) + (E = 1) + 65535) - 65536 * (E = Math.floor(b / 65536)), D = (b = D + E + 65535) - 65536 * (E = Math.floor(b / 65536)), W = (b = W + E + 65535) - 65536 * (E = Math.floor(b / 65536)), q = (b = q + E + 65535) - 65536 * (E = Math.floor(b / 65536)), Y = (b = Y + E + 65535) - 65536 * (E = Math.floor(b / 65536)), gt = (b = gt + E + 65535) - 65536 * (E = Math.floor(b / 65536)), X = (b = X + E + 65535) - 65536 * (E = Math.floor(b / 65536)), ct = (b = ct + E + 65535) - 65536 * (E = Math.floor(b / 65536)), wt = (b = wt + E + 65535) - 65536 * (E = Math.floor(b / 65536)), nt = (b = nt + E + 65535) - 65536 * (E = Math.floor(b / 65536)), ht = (b = ht + E + 65535) - 65536 * (E = Math.floor(b / 65536)), xt = (b = xt + E + 65535) - 65536 * (E = Math.floor(b / 65536)), ot = (b = ot + E + 65535) - 65536 * (E = Math.floor(b / 65536)), ut = (b = ut + E + 65535) - 65536 * (E = Math.floor(b / 65536)), At = (b = At + E + 65535) - 65536 * (E = Math.floor(b / 65536)), it = (b = it + E + 65535) - 65536 * (E = Math.floor(b / 65536)), $ = (b = ($ += E - 1 + 37 * (E - 1)) + (E = 1) + 65535) - 65536 * (E = Math.floor(b / 65536)), D = (b = D + E + 65535) - 65536 * (E = Math.floor(b / 65536)), W = (b = W + E + 65535) - 65536 * (E = Math.floor(b / 65536)), q = (b = q + E + 65535) - 65536 * (E = Math.floor(b / 65536)), Y = (b = Y + E + 65535) - 65536 * (E = Math.floor(b / 65536)), gt = (b = gt + E + 65535) - 65536 * (E = Math.floor(b / 65536)), X = (b = X + E + 65535) - 65536 * (E = Math.floor(b / 65536)), ct = (b = ct + E + 65535) - 65536 * (E = Math.floor(b / 65536)), wt = (b = wt + E + 65535) - 65536 * (E = Math.floor(b / 65536)), nt = (b = nt + E + 65535) - 65536 * (E = Math.floor(b / 65536)), ht = (b = ht + E + 65535) - 65536 * (E = Math.floor(b / 65536)), xt = (b = xt + E + 65535) - 65536 * (E = Math.floor(b / 65536)), ot = (b = ot + E + 65535) - 65536 * (E = Math.floor(b / 65536)), ut = (b = ut + E + 65535) - 65536 * (E = Math.floor(b / 65536)), At = (b = At + E + 65535) - 65536 * (E = Math.floor(b / 65536)), it = (b = it + E + 65535) - 65536 * (E = Math.floor(b / 65536)), $ += E - 1 + 37 * (E - 1), T[0] = $, T[1] = D, T[2] = W, T[3] = q, T[4] = Y, T[5] = gt, T[6] = X, T[7] = ct, T[8] = wt, T[9] = nt, T[10] = ht, T[11] = xt, T[12] = ot, T[13] = ut, T[14] = At, T[15] = it;
|
|
8664
8664
|
}
|
|
8665
|
-
function J(T,
|
|
8666
|
-
H(T,
|
|
8665
|
+
function J(T, C) {
|
|
8666
|
+
H(T, C, C);
|
|
8667
8667
|
}
|
|
8668
|
-
function Rt(T,
|
|
8668
|
+
function Rt(T, C) {
|
|
8669
8669
|
var B, b = t();
|
|
8670
|
-
for (B = 0; B < 16; B++) b[B] =
|
|
8671
|
-
for (B = 253; B >= 0; B--) J(b, b), B !== 2 && B !== 4 && H(b, b,
|
|
8670
|
+
for (B = 0; B < 16; B++) b[B] = C[B];
|
|
8671
|
+
for (B = 253; B >= 0; B--) J(b, b), B !== 2 && B !== 4 && H(b, b, C);
|
|
8672
8672
|
for (B = 0; B < 16; B++) T[B] = b[B];
|
|
8673
8673
|
}
|
|
8674
|
-
function dt(T,
|
|
8674
|
+
function dt(T, C) {
|
|
8675
8675
|
var B, b = t();
|
|
8676
|
-
for (B = 0; B < 16; B++) b[B] =
|
|
8677
|
-
for (B = 250; B >= 0; B--) J(b, b), B !== 1 && H(b, b,
|
|
8676
|
+
for (B = 0; B < 16; B++) b[B] = C[B];
|
|
8677
|
+
for (B = 250; B >= 0; B--) J(b, b), B !== 1 && H(b, b, C);
|
|
8678
8678
|
for (B = 0; B < 16; B++) T[B] = b[B];
|
|
8679
8679
|
}
|
|
8680
|
-
function yt(T,
|
|
8681
|
-
var b, E,
|
|
8682
|
-
for (E = 0; E < 31; E++)
|
|
8683
|
-
for (
|
|
8684
|
-
for (W[0] = gt[0] = 1, E = 254; E >= 0; --E) P(W, q, b =
|
|
8680
|
+
function yt(T, C, B) {
|
|
8681
|
+
var b, E, $ = new Uint8Array(32), D = new Float64Array(80), W = t(), q = t(), Y = t(), gt = t(), X = t(), ct = t();
|
|
8682
|
+
for (E = 0; E < 31; E++) $[E] = C[E];
|
|
8683
|
+
for ($[31] = 127 & C[31] | 64, $[0] &= 248, U(D, B), E = 0; E < 16; E++) q[E] = D[E], gt[E] = W[E] = Y[E] = 0;
|
|
8684
|
+
for (W[0] = gt[0] = 1, E = 254; E >= 0; --E) P(W, q, b = $[E >>> 3] >>> (7 & E) & 1), P(Y, gt, b), V(X, W, Y), F(W, W, Y), V(Y, q, gt), F(q, q, gt), J(gt, X), J(ct, W), H(W, Y, W), H(Y, q, X), V(X, W, Y), F(W, W, Y), J(q, W), F(Y, gt, ct), H(W, Y, o), V(W, W, gt), H(Y, Y, W), H(W, gt, ct), H(gt, q, D), J(q, X), P(W, q, b), P(Y, gt, b);
|
|
8685
8685
|
for (E = 0; E < 16; E++) D[E + 16] = W[E], D[E + 32] = Y[E], D[E + 48] = q[E], D[E + 64] = gt[E];
|
|
8686
8686
|
var wt = D.subarray(32), nt = D.subarray(16);
|
|
8687
8687
|
return Rt(wt, wt), H(nt, nt, wt), R(T, nt), 0;
|
|
8688
8688
|
}
|
|
8689
|
-
function Ft(T,
|
|
8690
|
-
return yt(T,
|
|
8689
|
+
function Ft(T, C) {
|
|
8690
|
+
return yt(T, C, i);
|
|
8691
8691
|
}
|
|
8692
|
-
function mt(T,
|
|
8693
|
-
return r(
|
|
8692
|
+
function mt(T, C) {
|
|
8693
|
+
return r(C, 32), Ft(T, C);
|
|
8694
8694
|
}
|
|
8695
|
-
function Et(T,
|
|
8695
|
+
function Et(T, C, B) {
|
|
8696
8696
|
var b = new Uint8Array(32);
|
|
8697
|
-
return yt(b, B,
|
|
8697
|
+
return yt(b, B, C), S(T, n, b, O);
|
|
8698
8698
|
}
|
|
8699
|
-
f.prototype.blocks = function(T,
|
|
8700
|
-
for (var b, E,
|
|
8701
|
-
this.h[0] = at, this.h[1] = K, this.h[2] = Q, this.h[3] = st, this.h[4] = tt, this.h[5] = et, this.h[6] = rt, this.h[7] =
|
|
8702
|
-
}, f.prototype.finish = function(T,
|
|
8703
|
-
var B, b, E,
|
|
8699
|
+
f.prototype.blocks = function(T, C, B) {
|
|
8700
|
+
for (var b, E, $, D, W, q, Y, gt, X, ct, wt, nt, ht, xt, ot, ut, At, it, lt, Bt = this.fin ? 0 : 2048, at = this.h[0], K = this.h[1], Q = this.h[2], st = this.h[3], tt = this.h[4], et = this.h[5], rt = this.h[6], Ot = this.h[7], zt = this.h[8], Ct = this.h[9], Kt = this.r[0], Qt = this.r[1], Xt = this.r[2], St = this.r[3], It = this.r[4], Tt = this.r[5], Nt = this.r[6], _t = this.r[7], jt = this.r[8], $t = this.r[9]; B >= 16; ) ct = X = 0, ct += (at += 8191 & (b = 255 & T[C + 0] | (255 & T[C + 1]) << 8)) * Kt, ct += (K += 8191 & (b >>> 13 | (E = 255 & T[C + 2] | (255 & T[C + 3]) << 8) << 3)) * (5 * $t), ct += (Q += 8191 & (E >>> 10 | ($ = 255 & T[C + 4] | (255 & T[C + 5]) << 8) << 6)) * (5 * jt), ct += (st += 8191 & ($ >>> 7 | (D = 255 & T[C + 6] | (255 & T[C + 7]) << 8) << 9)) * (5 * _t), X = (ct += (tt += 8191 & (D >>> 4 | (W = 255 & T[C + 8] | (255 & T[C + 9]) << 8) << 12)) * (5 * Nt)) >>> 13, ct &= 8191, ct += (et += W >>> 1 & 8191) * (5 * Tt), ct += (rt += 8191 & (W >>> 14 | (q = 255 & T[C + 10] | (255 & T[C + 11]) << 8) << 2)) * (5 * It), ct += (Ot += 8191 & (q >>> 11 | (Y = 255 & T[C + 12] | (255 & T[C + 13]) << 8) << 5)) * (5 * St), ct += (zt += 8191 & (Y >>> 8 | (gt = 255 & T[C + 14] | (255 & T[C + 15]) << 8) << 8)) * (5 * Xt), wt = X += (ct += (Ct += gt >>> 5 | Bt) * (5 * Qt)) >>> 13, wt += at * Qt, wt += K * Kt, wt += Q * (5 * $t), wt += st * (5 * jt), X = (wt += tt * (5 * _t)) >>> 13, wt &= 8191, wt += et * (5 * Nt), wt += rt * (5 * Tt), wt += Ot * (5 * It), wt += zt * (5 * St), X += (wt += Ct * (5 * Xt)) >>> 13, wt &= 8191, nt = X, nt += at * Xt, nt += K * Qt, nt += Q * Kt, nt += st * (5 * $t), X = (nt += tt * (5 * jt)) >>> 13, nt &= 8191, nt += et * (5 * _t), nt += rt * (5 * Nt), nt += Ot * (5 * Tt), nt += zt * (5 * It), ht = X += (nt += Ct * (5 * St)) >>> 13, ht += at * St, ht += K * Xt, ht += Q * Qt, ht += st * Kt, X = (ht += tt * (5 * $t)) >>> 13, ht &= 8191, ht += et * (5 * jt), ht += rt * (5 * _t), ht += Ot * (5 * Nt), ht += zt * (5 * Tt), xt = X += (ht += Ct * (5 * It)) >>> 13, xt += at * It, xt += K * St, xt += Q * Xt, xt += st * Qt, X = (xt += tt * Kt) >>> 13, xt &= 8191, xt += et * (5 * $t), xt += rt * (5 * jt), xt += Ot * (5 * _t), xt += zt * (5 * Nt), ot = X += (xt += Ct * (5 * Tt)) >>> 13, ot += at * Tt, ot += K * It, ot += Q * St, ot += st * Xt, X = (ot += tt * Qt) >>> 13, ot &= 8191, ot += et * Kt, ot += rt * (5 * $t), ot += Ot * (5 * jt), ot += zt * (5 * _t), ut = X += (ot += Ct * (5 * Nt)) >>> 13, ut += at * Nt, ut += K * Tt, ut += Q * It, ut += st * St, X = (ut += tt * Xt) >>> 13, ut &= 8191, ut += et * Qt, ut += rt * Kt, ut += Ot * (5 * $t), ut += zt * (5 * jt), At = X += (ut += Ct * (5 * _t)) >>> 13, At += at * _t, At += K * Nt, At += Q * Tt, At += st * It, X = (At += tt * St) >>> 13, At &= 8191, At += et * Xt, At += rt * Qt, At += Ot * Kt, At += zt * (5 * $t), it = X += (At += Ct * (5 * jt)) >>> 13, it += at * jt, it += K * _t, it += Q * Nt, it += st * Tt, X = (it += tt * It) >>> 13, it &= 8191, it += et * St, it += rt * Xt, it += Ot * Qt, it += zt * Kt, lt = X += (it += Ct * (5 * $t)) >>> 13, lt += at * $t, lt += K * jt, lt += Q * _t, lt += st * Nt, X = (lt += tt * Tt) >>> 13, lt &= 8191, lt += et * It, lt += rt * St, lt += Ot * Xt, lt += zt * Qt, at = ct = 8191 & (X = (X = ((X += (lt += Ct * Kt) >>> 13) << 2) + X | 0) + (ct &= 8191) | 0), K = wt += X >>>= 13, Q = nt &= 8191, st = ht &= 8191, tt = xt &= 8191, et = ot &= 8191, rt = ut &= 8191, Ot = At &= 8191, zt = it &= 8191, Ct = lt &= 8191, C += 16, B -= 16;
|
|
8701
|
+
this.h[0] = at, this.h[1] = K, this.h[2] = Q, this.h[3] = st, this.h[4] = tt, this.h[5] = et, this.h[6] = rt, this.h[7] = Ot, this.h[8] = zt, this.h[9] = Ct;
|
|
8702
|
+
}, f.prototype.finish = function(T, C) {
|
|
8703
|
+
var B, b, E, $, D = new Uint16Array(10);
|
|
8704
8704
|
if (this.leftover) {
|
|
8705
|
-
for (
|
|
8705
|
+
for ($ = this.leftover, this.buffer[$++] = 1; $ < 16; $++) this.buffer[$] = 0;
|
|
8706
8706
|
this.fin = 1, this.blocks(this.buffer, 0, 16);
|
|
8707
8707
|
}
|
|
8708
|
-
for (B = this.h[1] >>> 13, this.h[1] &= 8191,
|
|
8709
|
-
for (this.h[0] += 5 * B, B = this.h[0] >>> 13, this.h[0] &= 8191, this.h[1] += B, B = this.h[1] >>> 13, this.h[1] &= 8191, this.h[2] += B, D[0] = this.h[0] + 5, B = D[0] >>> 13, D[0] &= 8191,
|
|
8710
|
-
for (D[9] -= 8192, b = (1 ^ B) - 1,
|
|
8711
|
-
for (b = ~b,
|
|
8712
|
-
for (this.h[0] = 65535 & (this.h[0] | this.h[1] << 13), this.h[1] = 65535 & (this.h[1] >>> 3 | this.h[2] << 10), this.h[2] = 65535 & (this.h[2] >>> 6 | this.h[3] << 7), this.h[3] = 65535 & (this.h[3] >>> 9 | this.h[4] << 4), this.h[4] = 65535 & (this.h[4] >>> 12 | this.h[5] << 1 | this.h[6] << 14), this.h[5] = 65535 & (this.h[6] >>> 2 | this.h[7] << 11), this.h[6] = 65535 & (this.h[7] >>> 5 | this.h[8] << 8), this.h[7] = 65535 & (this.h[8] >>> 8 | this.h[9] << 5), E = this.h[0] + this.pad[0], this.h[0] = 65535 & E,
|
|
8713
|
-
T[
|
|
8714
|
-
}, f.prototype.update = function(T,
|
|
8708
|
+
for (B = this.h[1] >>> 13, this.h[1] &= 8191, $ = 2; $ < 10; $++) this.h[$] += B, B = this.h[$] >>> 13, this.h[$] &= 8191;
|
|
8709
|
+
for (this.h[0] += 5 * B, B = this.h[0] >>> 13, this.h[0] &= 8191, this.h[1] += B, B = this.h[1] >>> 13, this.h[1] &= 8191, this.h[2] += B, D[0] = this.h[0] + 5, B = D[0] >>> 13, D[0] &= 8191, $ = 1; $ < 10; $++) D[$] = this.h[$] + B, B = D[$] >>> 13, D[$] &= 8191;
|
|
8710
|
+
for (D[9] -= 8192, b = (1 ^ B) - 1, $ = 0; $ < 10; $++) D[$] &= b;
|
|
8711
|
+
for (b = ~b, $ = 0; $ < 10; $++) this.h[$] = this.h[$] & b | D[$];
|
|
8712
|
+
for (this.h[0] = 65535 & (this.h[0] | this.h[1] << 13), this.h[1] = 65535 & (this.h[1] >>> 3 | this.h[2] << 10), this.h[2] = 65535 & (this.h[2] >>> 6 | this.h[3] << 7), this.h[3] = 65535 & (this.h[3] >>> 9 | this.h[4] << 4), this.h[4] = 65535 & (this.h[4] >>> 12 | this.h[5] << 1 | this.h[6] << 14), this.h[5] = 65535 & (this.h[6] >>> 2 | this.h[7] << 11), this.h[6] = 65535 & (this.h[7] >>> 5 | this.h[8] << 8), this.h[7] = 65535 & (this.h[8] >>> 8 | this.h[9] << 5), E = this.h[0] + this.pad[0], this.h[0] = 65535 & E, $ = 1; $ < 8; $++) E = (this.h[$] + this.pad[$] | 0) + (E >>> 16) | 0, this.h[$] = 65535 & E;
|
|
8713
|
+
T[C + 0] = this.h[0] >>> 0 & 255, T[C + 1] = this.h[0] >>> 8 & 255, T[C + 2] = this.h[1] >>> 0 & 255, T[C + 3] = this.h[1] >>> 8 & 255, T[C + 4] = this.h[2] >>> 0 & 255, T[C + 5] = this.h[2] >>> 8 & 255, T[C + 6] = this.h[3] >>> 0 & 255, T[C + 7] = this.h[3] >>> 8 & 255, T[C + 8] = this.h[4] >>> 0 & 255, T[C + 9] = this.h[4] >>> 8 & 255, T[C + 10] = this.h[5] >>> 0 & 255, T[C + 11] = this.h[5] >>> 8 & 255, T[C + 12] = this.h[6] >>> 0 & 255, T[C + 13] = this.h[6] >>> 8 & 255, T[C + 14] = this.h[7] >>> 0 & 255, T[C + 15] = this.h[7] >>> 8 & 255;
|
|
8714
|
+
}, f.prototype.update = function(T, C, B) {
|
|
8715
8715
|
var b, E;
|
|
8716
8716
|
if (this.leftover) {
|
|
8717
|
-
for ((E = 16 - this.leftover) > B && (E = B), b = 0; b < E; b++) this.buffer[this.leftover + b] = T[
|
|
8718
|
-
if (B -= E,
|
|
8717
|
+
for ((E = 16 - this.leftover) > B && (E = B), b = 0; b < E; b++) this.buffer[this.leftover + b] = T[C + b];
|
|
8718
|
+
if (B -= E, C += E, this.leftover += E, this.leftover < 16) return;
|
|
8719
8719
|
this.blocks(this.buffer, 0, 16), this.leftover = 0;
|
|
8720
8720
|
}
|
|
8721
|
-
if (B >= 16 && (E = B - B % 16, this.blocks(T,
|
|
8722
|
-
for (b = 0; b < B; b++) this.buffer[this.leftover + b] = T[
|
|
8721
|
+
if (B >= 16 && (E = B - B % 16, this.blocks(T, C, E), C += E, B -= E), B) {
|
|
8722
|
+
for (b = 0; b < B; b++) this.buffer[this.leftover + b] = T[C + b];
|
|
8723
8723
|
this.leftover += B;
|
|
8724
8724
|
}
|
|
8725
8725
|
};
|
|
8726
8726
|
var Zt = m, Lt = u, oe = [1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163, 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394, 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206, 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139, 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692, 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879, 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895, 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823, 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921, 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344, 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616, 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403, 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452, 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573, 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271, 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315, 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470, 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591];
|
|
8727
|
-
function Ge(T,
|
|
8728
|
-
for (var E,
|
|
8729
|
-
for (Bt = 0; Bt < 16; Bt++) at = 8 * Bt + ke,
|
|
8730
|
-
for (Bt = 0; Bt < 80; Bt++) if (E =
|
|
8731
|
-
st = 65535 & (Q = _t), tt = Q >>> 16, et = 65535 & (K =
|
|
8727
|
+
function Ge(T, C, B, b) {
|
|
8728
|
+
for (var E, $, D, W, q, Y, gt, X, ct, wt, nt, ht, xt, ot, ut, At, it, lt, Bt, at, K, Q, st, tt, et, rt, Ot = new Int32Array(16), zt = new Int32Array(16), Ct = T[0], Kt = T[1], Qt = T[2], Xt = T[3], St = T[4], It = T[5], Tt = T[6], Nt = T[7], _t = C[0], jt = C[1], $t = C[2], me = C[3], he = C[4], ye = C[5], ge = C[6], _e = C[7], ke = 0; b >= 128; ) {
|
|
8729
|
+
for (Bt = 0; Bt < 16; Bt++) at = 8 * Bt + ke, Ot[Bt] = B[at + 0] << 24 | B[at + 1] << 16 | B[at + 2] << 8 | B[at + 3], zt[Bt] = B[at + 4] << 24 | B[at + 5] << 16 | B[at + 6] << 8 | B[at + 7];
|
|
8730
|
+
for (Bt = 0; Bt < 80; Bt++) if (E = Ct, $ = Kt, D = Qt, W = Xt, q = St, Y = It, gt = Tt, ct = _t, wt = jt, nt = $t, ht = me, xt = he, ot = ye, ut = ge, st = 65535 & (Q = _e), tt = Q >>> 16, et = 65535 & (K = Nt), rt = K >>> 16, st += 65535 & (Q = (he >>> 14 | St << 18) ^ (he >>> 18 | St << 14) ^ (St >>> 9 | he << 23)), tt += Q >>> 16, et += 65535 & (K = (St >>> 14 | he << 18) ^ (St >>> 18 | he << 14) ^ (he >>> 9 | St << 23)), rt += K >>> 16, st += 65535 & (Q = he & ye ^ ~he & ge), tt += Q >>> 16, et += 65535 & (K = St & It ^ ~St & Tt), rt += K >>> 16, st += 65535 & (Q = oe[2 * Bt + 1]), tt += Q >>> 16, et += 65535 & (K = oe[2 * Bt]), rt += K >>> 16, K = Ot[Bt % 16], tt += (Q = zt[Bt % 16]) >>> 16, et += 65535 & K, rt += K >>> 16, et += (tt += (st += 65535 & Q) >>> 16) >>> 16, st = 65535 & (Q = lt = 65535 & st | tt << 16), tt = Q >>> 16, et = 65535 & (K = it = 65535 & et | (rt += et >>> 16) << 16), rt = K >>> 16, st += 65535 & (Q = (_t >>> 28 | Ct << 4) ^ (Ct >>> 2 | _t << 30) ^ (Ct >>> 7 | _t << 25)), tt += Q >>> 16, et += 65535 & (K = (Ct >>> 28 | _t << 4) ^ (_t >>> 2 | Ct << 30) ^ (_t >>> 7 | Ct << 25)), rt += K >>> 16, tt += (Q = _t & jt ^ _t & $t ^ jt & $t) >>> 16, et += 65535 & (K = Ct & Kt ^ Ct & Qt ^ Kt & Qt), rt += K >>> 16, X = 65535 & (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) | (rt += et >>> 16) << 16, At = 65535 & st | tt << 16, st = 65535 & (Q = ht), tt = Q >>> 16, et = 65535 & (K = W), rt = K >>> 16, tt += (Q = lt) >>> 16, et += 65535 & (K = it), rt += K >>> 16, Kt = E, Qt = $, Xt = D, St = W = 65535 & (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) | (rt += et >>> 16) << 16, It = q, Tt = Y, Nt = gt, Ct = X, jt = ct, $t = wt, me = nt, he = ht = 65535 & st | tt << 16, ye = xt, ge = ot, _e = ut, _t = At, Bt % 16 == 15) for (at = 0; at < 16; at++) K = Ot[at], st = 65535 & (Q = zt[at]), tt = Q >>> 16, et = 65535 & K, rt = K >>> 16, K = Ot[(at + 9) % 16], st += 65535 & (Q = zt[(at + 9) % 16]), tt += Q >>> 16, et += 65535 & K, rt += K >>> 16, it = Ot[(at + 1) % 16], st += 65535 & (Q = ((lt = zt[(at + 1) % 16]) >>> 1 | it << 31) ^ (lt >>> 8 | it << 24) ^ (lt >>> 7 | it << 25)), tt += Q >>> 16, et += 65535 & (K = (it >>> 1 | lt << 31) ^ (it >>> 8 | lt << 24) ^ it >>> 7), rt += K >>> 16, it = Ot[(at + 14) % 16], tt += (Q = ((lt = zt[(at + 14) % 16]) >>> 19 | it << 13) ^ (it >>> 29 | lt << 3) ^ (lt >>> 6 | it << 26)) >>> 16, et += 65535 & (K = (it >>> 19 | lt << 13) ^ (lt >>> 29 | it << 3) ^ it >>> 6), rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, Ot[at] = 65535 & et | rt << 16, zt[at] = 65535 & st | tt << 16;
|
|
8731
|
+
st = 65535 & (Q = _t), tt = Q >>> 16, et = 65535 & (K = Ct), rt = K >>> 16, K = T[0], tt += (Q = C[0]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[0] = Ct = 65535 & et | rt << 16, C[0] = _t = 65535 & st | tt << 16, st = 65535 & (Q = jt), tt = Q >>> 16, et = 65535 & (K = Kt), rt = K >>> 16, K = T[1], tt += (Q = C[1]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[1] = Kt = 65535 & et | rt << 16, C[1] = jt = 65535 & st | tt << 16, st = 65535 & (Q = $t), tt = Q >>> 16, et = 65535 & (K = Qt), rt = K >>> 16, K = T[2], tt += (Q = C[2]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[2] = Qt = 65535 & et | rt << 16, C[2] = $t = 65535 & st | tt << 16, st = 65535 & (Q = me), tt = Q >>> 16, et = 65535 & (K = Xt), rt = K >>> 16, K = T[3], tt += (Q = C[3]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[3] = Xt = 65535 & et | rt << 16, C[3] = me = 65535 & st | tt << 16, st = 65535 & (Q = he), tt = Q >>> 16, et = 65535 & (K = St), rt = K >>> 16, K = T[4], tt += (Q = C[4]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[4] = St = 65535 & et | rt << 16, C[4] = he = 65535 & st | tt << 16, st = 65535 & (Q = ye), tt = Q >>> 16, et = 65535 & (K = It), rt = K >>> 16, K = T[5], tt += (Q = C[5]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[5] = It = 65535 & et | rt << 16, C[5] = ye = 65535 & st | tt << 16, st = 65535 & (Q = ge), tt = Q >>> 16, et = 65535 & (K = Tt), rt = K >>> 16, K = T[6], tt += (Q = C[6]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[6] = Tt = 65535 & et | rt << 16, C[6] = ge = 65535 & st | tt << 16, st = 65535 & (Q = _e), tt = Q >>> 16, et = 65535 & (K = Nt), rt = K >>> 16, K = T[7], tt += (Q = C[7]) >>> 16, et += 65535 & K, rt += K >>> 16, rt += (et += (tt += (st += 65535 & Q) >>> 16) >>> 16) >>> 16, T[7] = Nt = 65535 & et | rt << 16, C[7] = _e = 65535 & st | tt << 16, ke += 128, b -= 128;
|
|
8732
8732
|
}
|
|
8733
8733
|
return b;
|
|
8734
8734
|
}
|
|
8735
|
-
function Yt(T,
|
|
8736
|
-
var b, E = new Int32Array(8),
|
|
8737
|
-
for (E[0] = 1779033703, E[1] = 3144134277, E[2] = 1013904242, E[3] = 2773480762, E[4] = 1359893119, E[5] = 2600822924, E[6] = 528734635, E[7] = 1541459225,
|
|
8738
|
-
for (D[B] = 128, D[(B = 256 - 128 * (B < 112 ? 1 : 0)) - 9] = 0, v(D, B - 8, W / 536870912 | 0, W << 3), Ge(E,
|
|
8735
|
+
function Yt(T, C, B) {
|
|
8736
|
+
var b, E = new Int32Array(8), $ = new Int32Array(8), D = new Uint8Array(256), W = B;
|
|
8737
|
+
for (E[0] = 1779033703, E[1] = 3144134277, E[2] = 1013904242, E[3] = 2773480762, E[4] = 1359893119, E[5] = 2600822924, E[6] = 528734635, E[7] = 1541459225, $[0] = 4089235720, $[1] = 2227873595, $[2] = 4271175723, $[3] = 1595750129, $[4] = 2917565137, $[5] = 725511199, $[6] = 4215389547, $[7] = 327033209, Ge(E, $, C, B), B %= 128, b = 0; b < B; b++) D[b] = C[W - B + b];
|
|
8738
|
+
for (D[B] = 128, D[(B = 256 - 128 * (B < 112 ? 1 : 0)) - 9] = 0, v(D, B - 8, W / 536870912 | 0, W << 3), Ge(E, $, D, B), b = 0; b < 8; b++) v(T, 8 * b, E[b], $[b]);
|
|
8739
8739
|
return 0;
|
|
8740
8740
|
}
|
|
8741
|
-
function ee(T,
|
|
8742
|
-
var B = t(), b = t(), E = t(),
|
|
8743
|
-
F(B, T[1], T[0]), F(gt,
|
|
8741
|
+
function ee(T, C) {
|
|
8742
|
+
var B = t(), b = t(), E = t(), $ = t(), D = t(), W = t(), q = t(), Y = t(), gt = t();
|
|
8743
|
+
F(B, T[1], T[0]), F(gt, C[1], C[0]), H(B, B, gt), V(b, T[0], T[1]), V(gt, C[0], C[1]), H(b, b, gt), H(E, T[3], C[3]), H(E, E, d), H($, T[2], C[2]), V($, $, $), F(D, b, B), F(W, $, E), V(q, $, E), V(Y, b, B), H(T[0], D, W), H(T[1], Y, q), H(T[2], q, W), H(T[3], D, Y);
|
|
8744
8744
|
}
|
|
8745
|
-
function Pr(T,
|
|
8745
|
+
function Pr(T, C, B) {
|
|
8746
8746
|
var b;
|
|
8747
|
-
for (b = 0; b < 4; b++) P(T[b],
|
|
8747
|
+
for (b = 0; b < 4; b++) P(T[b], C[b], B);
|
|
8748
8748
|
}
|
|
8749
|
-
function ae(T,
|
|
8749
|
+
function ae(T, C) {
|
|
8750
8750
|
var B = t(), b = t(), E = t();
|
|
8751
|
-
Rt(E,
|
|
8751
|
+
Rt(E, C[2]), H(B, C[0], E), H(b, C[1], E), R(T, b), T[31] ^= Z(B) << 7;
|
|
8752
8752
|
}
|
|
8753
|
-
function Vt(T,
|
|
8753
|
+
function Vt(T, C, B) {
|
|
8754
8754
|
var b, E;
|
|
8755
|
-
for (y(T[0], s), y(T[1], a), y(T[2], a), y(T[3], s), E = 255; E >= 0; --E) Pr(T,
|
|
8755
|
+
for (y(T[0], s), y(T[1], a), y(T[2], a), y(T[3], s), E = 255; E >= 0; --E) Pr(T, C, b = B[E / 8 | 0] >> (7 & E) & 1), ee(C, T), ee(T, T), Pr(T, C, b);
|
|
8756
8756
|
}
|
|
8757
|
-
function Ve(T,
|
|
8757
|
+
function Ve(T, C) {
|
|
8758
8758
|
var B = [t(), t(), t(), t()];
|
|
8759
|
-
y(B[0], h), y(B[1], p), y(B[2], a), H(B[3], h, p), Vt(T, B,
|
|
8759
|
+
y(B[0], h), y(B[1], p), y(B[2], a), H(B[3], h, p), Vt(T, B, C);
|
|
8760
8760
|
}
|
|
8761
|
-
function ie(T,
|
|
8762
|
-
var b, E = new Uint8Array(64),
|
|
8763
|
-
for (B || r(
|
|
8761
|
+
function ie(T, C, B) {
|
|
8762
|
+
var b, E = new Uint8Array(64), $ = [t(), t(), t(), t()];
|
|
8763
|
+
for (B || r(C, 32), Yt(E, C, 32), E[0] &= 248, E[31] &= 127, E[31] |= 64, Ve($, E), ae(T, $), b = 0; b < 32; b++) C[b + 32] = T[b];
|
|
8764
8764
|
return 0;
|
|
8765
8765
|
}
|
|
8766
8766
|
var ce = new Float64Array([237, 211, 245, 92, 26, 99, 18, 88, 214, 156, 247, 162, 222, 249, 222, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16]);
|
|
8767
|
-
function Lr(T,
|
|
8768
|
-
var B, b, E,
|
|
8767
|
+
function Lr(T, C) {
|
|
8768
|
+
var B, b, E, $;
|
|
8769
8769
|
for (b = 63; b >= 32; --b) {
|
|
8770
|
-
for (B = 0, E = b - 32,
|
|
8771
|
-
|
|
8770
|
+
for (B = 0, E = b - 32, $ = b - 12; E < $; ++E) C[E] += B - 16 * C[b] * ce[E - (b - 32)], B = Math.floor((C[E] + 128) / 256), C[E] -= 256 * B;
|
|
8771
|
+
C[E] += B, C[b] = 0;
|
|
8772
8772
|
}
|
|
8773
|
-
for (B = 0, E = 0; E < 32; E++)
|
|
8774
|
-
for (E = 0; E < 32; E++)
|
|
8775
|
-
for (b = 0; b < 32; b++)
|
|
8773
|
+
for (B = 0, E = 0; E < 32; E++) C[E] += B - (C[31] >> 4) * ce[E], B = C[E] >> 8, C[E] &= 255;
|
|
8774
|
+
for (E = 0; E < 32; E++) C[E] -= B * ce[E];
|
|
8775
|
+
for (b = 0; b < 32; b++) C[b + 1] += C[b] >> 8, T[b] = 255 & C[b];
|
|
8776
8776
|
}
|
|
8777
8777
|
function se(T) {
|
|
8778
|
-
var
|
|
8779
|
-
for (
|
|
8780
|
-
for (
|
|
8778
|
+
var C, B = new Float64Array(64);
|
|
8779
|
+
for (C = 0; C < 64; C++) B[C] = T[C];
|
|
8780
|
+
for (C = 0; C < 64; C++) T[C] = 0;
|
|
8781
8781
|
Lr(T, B);
|
|
8782
8782
|
}
|
|
8783
|
-
function de(T,
|
|
8784
|
-
var E,
|
|
8783
|
+
function de(T, C, B, b) {
|
|
8784
|
+
var E, $, D = new Uint8Array(64), W = new Uint8Array(64), q = new Uint8Array(64), Y = new Float64Array(64), gt = [t(), t(), t(), t()];
|
|
8785
8785
|
Yt(D, b, 32), D[0] &= 248, D[31] &= 127, D[31] |= 64;
|
|
8786
8786
|
var X = B + 64;
|
|
8787
|
-
for (E = 0; E < B; E++) T[64 + E] =
|
|
8787
|
+
for (E = 0; E < B; E++) T[64 + E] = C[E];
|
|
8788
8788
|
for (E = 0; E < 32; E++) T[32 + E] = D[32 + E];
|
|
8789
8789
|
for (Yt(q, T.subarray(32), B + 32), se(q), Ve(gt, q), ae(T, gt), E = 32; E < 64; E++) T[E] = b[E];
|
|
8790
8790
|
for (Yt(W, T, B + 64), se(W), E = 0; E < 64; E++) Y[E] = 0;
|
|
8791
8791
|
for (E = 0; E < 32; E++) Y[E] = q[E];
|
|
8792
|
-
for (E = 0; E < 32; E++) for (
|
|
8792
|
+
for (E = 0; E < 32; E++) for ($ = 0; $ < 32; $++) Y[E + $] += W[E] * D[$];
|
|
8793
8793
|
return Lr(T.subarray(32), Y), X;
|
|
8794
8794
|
}
|
|
8795
|
-
function Kr(T,
|
|
8796
|
-
var E,
|
|
8795
|
+
function Kr(T, C, B, b) {
|
|
8796
|
+
var E, $ = new Uint8Array(32), D = new Uint8Array(64), W = [t(), t(), t(), t()], q = [t(), t(), t(), t()];
|
|
8797
8797
|
if (B < 64 || function(Y, gt) {
|
|
8798
8798
|
var X = t(), ct = t(), wt = t(), nt = t(), ht = t(), xt = t(), ot = t();
|
|
8799
|
-
return y(Y[2], a),
|
|
8799
|
+
return y(Y[2], a), U(Y[1], gt), J(wt, Y[1]), H(nt, wt, c), F(wt, wt, Y[2]), V(nt, Y[2], nt), J(ht, nt), J(xt, ht), H(ot, xt, ht), H(X, ot, wt), H(X, X, nt), dt(X, X), H(X, X, wt), H(X, X, nt), H(X, X, nt), H(Y[0], X, nt), J(ct, Y[0]), H(ct, ct, nt), j(ct, wt) && H(Y[0], Y[0], w), J(ct, Y[0]), H(ct, ct, nt), j(ct, wt) ? -1 : (Z(Y[0]) === gt[31] >> 7 && F(Y[0], s, Y[0]), H(Y[3], Y[0], Y[1]), 0);
|
|
8800
8800
|
}(q, b)) return -1;
|
|
8801
|
-
for (E = 0; E < B; E++) T[E] =
|
|
8801
|
+
for (E = 0; E < B; E++) T[E] = C[E];
|
|
8802
8802
|
for (E = 0; E < 32; E++) T[E + 32] = b[E];
|
|
8803
|
-
if (Yt(D, T, B), se(D), Vt(W, q, D), Ve(q,
|
|
8803
|
+
if (Yt(D, T, B), se(D), Vt(W, q, D), Ve(q, C.subarray(32)), ee(W, q), ae($, W), B -= 64, _(C, 0, $, 0)) {
|
|
8804
8804
|
for (E = 0; E < B; E++) T[E] = 0;
|
|
8805
8805
|
return -1;
|
|
8806
8806
|
}
|
|
8807
|
-
for (E = 0; E < B; E++) T[E] =
|
|
8807
|
+
for (E = 0; E < B; E++) T[E] = C[E + 64];
|
|
8808
8808
|
return B;
|
|
8809
8809
|
}
|
|
8810
8810
|
var fe = 16, re = 64, ze = 32, ne = 64;
|
|
8811
|
-
function pe(T,
|
|
8811
|
+
function pe(T, C) {
|
|
8812
8812
|
if (T.length !== 32) throw new Error("bad key size");
|
|
8813
|
-
if (
|
|
8813
|
+
if (C.length !== 24) throw new Error("bad nonce size");
|
|
8814
8814
|
}
|
|
8815
8815
|
function Ee() {
|
|
8816
8816
|
for (var T = 0; T < arguments.length; T++) if (!(arguments[T] instanceof Uint8Array)) throw new TypeError("unexpected type, use Uint8Array");
|
|
8817
8817
|
}
|
|
8818
8818
|
function ue(T) {
|
|
8819
|
-
for (var
|
|
8819
|
+
for (var C = 0; C < T.length; C++) T[C] = 0;
|
|
8820
8820
|
}
|
|
8821
|
-
e.lowlevel = { crypto_core_hsalsa20: S, crypto_stream_xor: z, crypto_stream: L, crypto_stream_salsa20_xor: k, crypto_stream_salsa20: N, crypto_onetimeauth: l, crypto_onetimeauth_verify: g, crypto_verify_16: I, crypto_verify_32: _, crypto_secretbox: m, crypto_secretbox_open: u, crypto_scalarmult: yt, crypto_scalarmult_base: Ft, crypto_box_beforenm: Et, crypto_box_afternm: Zt, crypto_box: function(T,
|
|
8821
|
+
e.lowlevel = { crypto_core_hsalsa20: S, crypto_stream_xor: z, crypto_stream: L, crypto_stream_salsa20_xor: k, crypto_stream_salsa20: N, crypto_onetimeauth: l, crypto_onetimeauth_verify: g, crypto_verify_16: I, crypto_verify_32: _, crypto_secretbox: m, crypto_secretbox_open: u, crypto_scalarmult: yt, crypto_scalarmult_base: Ft, crypto_box_beforenm: Et, crypto_box_afternm: Zt, crypto_box: function(T, C, B, b, E, $) {
|
|
8822
8822
|
var D = new Uint8Array(32);
|
|
8823
|
-
return Et(D, E,
|
|
8824
|
-
}, crypto_box_open: function(T,
|
|
8823
|
+
return Et(D, E, $), Zt(T, C, B, b, D);
|
|
8824
|
+
}, crypto_box_open: function(T, C, B, b, E, $) {
|
|
8825
8825
|
var D = new Uint8Array(32);
|
|
8826
|
-
return Et(D, E,
|
|
8827
|
-
}, crypto_box_keypair: mt, crypto_hash: Yt, crypto_sign: de, crypto_sign_keypair: ie, crypto_sign_open: Kr, crypto_secretbox_KEYBYTES: 32, crypto_secretbox_NONCEBYTES: 24, crypto_secretbox_ZEROBYTES: 32, crypto_secretbox_BOXZEROBYTES: fe, 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: re, crypto_sign_PUBLICKEYBYTES: ze, crypto_sign_SECRETKEYBYTES: ne, crypto_sign_SEEDBYTES: 32, crypto_hash_BYTES: 64, gf: t, D: c, L: ce, pack25519: R, unpack25519:
|
|
8828
|
-
var
|
|
8829
|
-
return r(
|
|
8830
|
-
}, e.secretbox = function(T,
|
|
8831
|
-
Ee(T,
|
|
8832
|
-
for (var b = new Uint8Array(32 + T.length), E = new Uint8Array(b.length),
|
|
8833
|
-
return m(E, b, b.length,
|
|
8834
|
-
}, e.secretbox.open = function(T,
|
|
8835
|
-
Ee(T,
|
|
8836
|
-
for (var b = new Uint8Array(fe + T.length), E = new Uint8Array(b.length),
|
|
8837
|
-
return b.length < 32 || u(E, b, b.length,
|
|
8838
|
-
}, e.secretbox.keyLength = 32, e.secretbox.nonceLength = 24, e.secretbox.overheadLength = fe, e.scalarMult = function(T,
|
|
8839
|
-
if (Ee(T,
|
|
8840
|
-
if (
|
|
8826
|
+
return Et(D, E, $), Lt(T, C, B, b, D);
|
|
8827
|
+
}, crypto_box_keypair: mt, crypto_hash: Yt, crypto_sign: de, crypto_sign_keypair: ie, crypto_sign_open: Kr, crypto_secretbox_KEYBYTES: 32, crypto_secretbox_NONCEBYTES: 24, crypto_secretbox_ZEROBYTES: 32, crypto_secretbox_BOXZEROBYTES: fe, 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: re, crypto_sign_PUBLICKEYBYTES: ze, crypto_sign_SECRETKEYBYTES: ne, crypto_sign_SEEDBYTES: 32, crypto_hash_BYTES: 64, gf: t, D: c, L: ce, pack25519: R, unpack25519: U, M: H, A: V, S: J, Z: F, pow2523: dt, add: ee, set25519: y, modL: Lr, scalarmult: Vt, scalarbase: Ve }, e.randomBytes = function(T) {
|
|
8828
|
+
var C = new Uint8Array(T);
|
|
8829
|
+
return r(C, T), C;
|
|
8830
|
+
}, e.secretbox = function(T, C, B) {
|
|
8831
|
+
Ee(T, C, B), pe(B, C);
|
|
8832
|
+
for (var b = new Uint8Array(32 + T.length), E = new Uint8Array(b.length), $ = 0; $ < T.length; $++) b[$ + 32] = T[$];
|
|
8833
|
+
return m(E, b, b.length, C, B), E.subarray(fe);
|
|
8834
|
+
}, e.secretbox.open = function(T, C, B) {
|
|
8835
|
+
Ee(T, C, B), pe(B, C);
|
|
8836
|
+
for (var b = new Uint8Array(fe + T.length), E = new Uint8Array(b.length), $ = 0; $ < T.length; $++) b[$ + fe] = T[$];
|
|
8837
|
+
return b.length < 32 || u(E, b, b.length, C, B) !== 0 ? null : E.subarray(32);
|
|
8838
|
+
}, e.secretbox.keyLength = 32, e.secretbox.nonceLength = 24, e.secretbox.overheadLength = fe, e.scalarMult = function(T, C) {
|
|
8839
|
+
if (Ee(T, C), T.length !== 32) throw new Error("bad n size");
|
|
8840
|
+
if (C.length !== 32) throw new Error("bad p size");
|
|
8841
8841
|
var B = new Uint8Array(32);
|
|
8842
|
-
return yt(B, T,
|
|
8842
|
+
return yt(B, T, C), B;
|
|
8843
8843
|
}, e.scalarMult.base = function(T) {
|
|
8844
8844
|
if (Ee(T), T.length !== 32) throw new Error("bad n size");
|
|
8845
|
-
var
|
|
8846
|
-
return Ft(
|
|
8847
|
-
}, e.scalarMult.scalarLength = 32, e.scalarMult.groupElementLength = 32, e.box = function(T,
|
|
8845
|
+
var C = new Uint8Array(32);
|
|
8846
|
+
return Ft(C, T), C;
|
|
8847
|
+
}, e.scalarMult.scalarLength = 32, e.scalarMult.groupElementLength = 32, e.box = function(T, C, B, b) {
|
|
8848
8848
|
var E = e.box.before(B, b);
|
|
8849
|
-
return e.secretbox(T,
|
|
8850
|
-
}, e.box.before = function(T,
|
|
8851
|
-
Ee(T,
|
|
8849
|
+
return e.secretbox(T, C, E);
|
|
8850
|
+
}, e.box.before = function(T, C) {
|
|
8851
|
+
Ee(T, C), function(b, E) {
|
|
8852
8852
|
if (b.length !== 32) throw new Error("bad public key size");
|
|
8853
8853
|
if (E.length !== 32) throw new Error("bad secret key size");
|
|
8854
|
-
}(T,
|
|
8854
|
+
}(T, C);
|
|
8855
8855
|
var B = new Uint8Array(32);
|
|
8856
|
-
return Et(B, T,
|
|
8857
|
-
}, e.box.after = e.secretbox, e.box.open = function(T,
|
|
8856
|
+
return Et(B, T, C), B;
|
|
8857
|
+
}, e.box.after = e.secretbox, e.box.open = function(T, C, B, b) {
|
|
8858
8858
|
var E = e.box.before(B, b);
|
|
8859
|
-
return e.secretbox.open(T,
|
|
8859
|
+
return e.secretbox.open(T, C, E);
|
|
8860
8860
|
}, e.box.open.after = e.secretbox.open, e.box.keyPair = function() {
|
|
8861
|
-
var T = new Uint8Array(32),
|
|
8862
|
-
return mt(T,
|
|
8861
|
+
var T = new Uint8Array(32), C = new Uint8Array(32);
|
|
8862
|
+
return mt(T, C), { publicKey: T, secretKey: C };
|
|
8863
8863
|
}, e.box.keyPair.fromSecretKey = function(T) {
|
|
8864
8864
|
if (Ee(T), T.length !== 32) throw new Error("bad secret key size");
|
|
8865
|
-
var
|
|
8866
|
-
return Ft(
|
|
8867
|
-
}, e.box.publicKeyLength = 32, e.box.secretKeyLength = 32, e.box.sharedKeyLength = 32, e.box.nonceLength = 24, e.box.overheadLength = e.secretbox.overheadLength, e.sign = function(T,
|
|
8868
|
-
if (Ee(T,
|
|
8865
|
+
var C = new Uint8Array(32);
|
|
8866
|
+
return Ft(C, T), { publicKey: C, secretKey: new Uint8Array(T) };
|
|
8867
|
+
}, e.box.publicKeyLength = 32, e.box.secretKeyLength = 32, e.box.sharedKeyLength = 32, e.box.nonceLength = 24, e.box.overheadLength = e.secretbox.overheadLength, e.sign = function(T, C) {
|
|
8868
|
+
if (Ee(T, C), C.length !== ne) throw new Error("bad secret key size");
|
|
8869
8869
|
var B = new Uint8Array(re + T.length);
|
|
8870
|
-
return de(B, T, T.length,
|
|
8871
|
-
}, e.sign.open = function(T,
|
|
8872
|
-
if (Ee(T,
|
|
8873
|
-
var B = new Uint8Array(T.length), b = Kr(B, T, T.length,
|
|
8870
|
+
return de(B, T, T.length, C), B;
|
|
8871
|
+
}, e.sign.open = function(T, C) {
|
|
8872
|
+
if (Ee(T, C), C.length !== ze) throw new Error("bad public key size");
|
|
8873
|
+
var B = new Uint8Array(T.length), b = Kr(B, T, T.length, C);
|
|
8874
8874
|
if (b < 0) return null;
|
|
8875
|
-
for (var E = new Uint8Array(b),
|
|
8875
|
+
for (var E = new Uint8Array(b), $ = 0; $ < E.length; $++) E[$] = B[$];
|
|
8876
8876
|
return E;
|
|
8877
|
-
}, e.sign.detached = function(T,
|
|
8878
|
-
for (var B = e.sign(T,
|
|
8877
|
+
}, e.sign.detached = function(T, C) {
|
|
8878
|
+
for (var B = e.sign(T, C), b = new Uint8Array(re), E = 0; E < b.length; E++) b[E] = B[E];
|
|
8879
8879
|
return b;
|
|
8880
|
-
}, e.sign.detached.verify = function(T,
|
|
8881
|
-
if (Ee(T,
|
|
8880
|
+
}, e.sign.detached.verify = function(T, C, B) {
|
|
8881
|
+
if (Ee(T, C, B), C.length !== re) throw new Error("bad signature size");
|
|
8882
8882
|
if (B.length !== ze) throw new Error("bad public key size");
|
|
8883
|
-
var b, E = new Uint8Array(re + T.length),
|
|
8884
|
-
for (b = 0; b < re; b++) E[b] =
|
|
8883
|
+
var b, E = new Uint8Array(re + T.length), $ = new Uint8Array(re + T.length);
|
|
8884
|
+
for (b = 0; b < re; b++) E[b] = C[b];
|
|
8885
8885
|
for (b = 0; b < T.length; b++) E[b + re] = T[b];
|
|
8886
|
-
return Kr(
|
|
8886
|
+
return Kr($, E, E.length, B) >= 0;
|
|
8887
8887
|
}, e.sign.keyPair = function() {
|
|
8888
|
-
var T = new Uint8Array(ze),
|
|
8889
|
-
return ie(T,
|
|
8888
|
+
var T = new Uint8Array(ze), C = new Uint8Array(ne);
|
|
8889
|
+
return ie(T, C), { publicKey: T, secretKey: C };
|
|
8890
8890
|
}, e.sign.keyPair.fromSecretKey = function(T) {
|
|
8891
8891
|
if (Ee(T), T.length !== ne) throw new Error("bad secret key size");
|
|
8892
|
-
for (var
|
|
8893
|
-
return { publicKey:
|
|
8892
|
+
for (var C = new Uint8Array(ze), B = 0; B < C.length; B++) C[B] = T[32 + B];
|
|
8893
|
+
return { publicKey: C, secretKey: new Uint8Array(T) };
|
|
8894
8894
|
}, e.sign.keyPair.fromSeed = function(T) {
|
|
8895
8895
|
if (Ee(T), T.length !== 32) throw new Error("bad seed size");
|
|
8896
|
-
for (var
|
|
8897
|
-
return ie(
|
|
8896
|
+
for (var C = new Uint8Array(ze), B = new Uint8Array(ne), b = 0; b < 32; b++) B[b] = T[b];
|
|
8897
|
+
return ie(C, B, !0), { publicKey: C, secretKey: B };
|
|
8898
8898
|
}, e.sign.publicKeyLength = ze, e.sign.secretKeyLength = ne, e.sign.seedLength = 32, e.sign.signatureLength = re, e.hash = function(T) {
|
|
8899
8899
|
Ee(T);
|
|
8900
|
-
var
|
|
8901
|
-
return Yt(
|
|
8902
|
-
}, e.hash.hashLength = 64, e.verify = function(T,
|
|
8903
|
-
return Ee(T,
|
|
8900
|
+
var C = new Uint8Array(64);
|
|
8901
|
+
return Yt(C, T, T.length), C;
|
|
8902
|
+
}, e.hash.hashLength = 64, e.verify = function(T, C) {
|
|
8903
|
+
return Ee(T, C), T.length !== 0 && C.length !== 0 && T.length === C.length && A(T, 0, C, 0, T.length) === 0;
|
|
8904
8904
|
}, e.setPRNG = function(T) {
|
|
8905
8905
|
r = T;
|
|
8906
8906
|
}, function() {
|
|
8907
8907
|
var T = typeof self < "u" ? self.crypto || self.msCrypto : null;
|
|
8908
|
-
T && T.getRandomValues ? e.setPRNG(function(
|
|
8908
|
+
T && T.getRandomValues ? e.setPRNG(function(C, B) {
|
|
8909
8909
|
var b, E = new Uint8Array(B);
|
|
8910
8910
|
for (b = 0; b < B; b += 65536) T.getRandomValues(E.subarray(b, b + Math.min(B - b, 65536)));
|
|
8911
|
-
for (b = 0; b < B; b++)
|
|
8911
|
+
for (b = 0; b < B; b++) C[b] = E[b];
|
|
8912
8912
|
ue(E);
|
|
8913
|
-
}) : e1 !== void 0 && (T = Rs) && T.randomBytes && e.setPRNG(function(
|
|
8913
|
+
}) : e1 !== void 0 && (T = Rs) && T.randomBytes && e.setPRNG(function(C, B) {
|
|
8914
8914
|
var b, E = T.randomBytes(B);
|
|
8915
|
-
for (b = 0; b < B; b++)
|
|
8915
|
+
for (b = 0; b < B; b++) C[b] = E[b];
|
|
8916
8916
|
ue(E);
|
|
8917
8917
|
});
|
|
8918
8918
|
}();
|
|
@@ -9043,7 +9043,7 @@ function Sd(e) {
|
|
|
9043
9043
|
let mo;
|
|
9044
9044
|
const Yl = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", mi = typeof Uint8Array > "u" ? [] : new Uint8Array(256);
|
|
9045
9045
|
for (let e = 0; e < 64; e++) mi[Yl.charCodeAt(e)] = e;
|
|
9046
|
-
const Ql = typeof ArrayBuffer == "function",
|
|
9046
|
+
const Ql = typeof ArrayBuffer == "function", Ua = (e, t) => {
|
|
9047
9047
|
if (typeof e != "string") return { type: "message", data: pf(e, t) };
|
|
9048
9048
|
const r = e.charAt(0);
|
|
9049
9049
|
return r === "b" ? { type: "message", data: Gl(e.substring(1), t) } : as[r] ? e.length > 1 ? { type: as[r], data: e.substring(1) } : { type: as[r] } : fa;
|
|
@@ -9166,7 +9166,7 @@ class qa extends Se {
|
|
|
9166
9166
|
this.readyState = "open", this.writable = !0, super.emitReserved("open");
|
|
9167
9167
|
}
|
|
9168
9168
|
onData(t) {
|
|
9169
|
-
const r =
|
|
9169
|
+
const r = Ua(t, this.socket.binaryType);
|
|
9170
9170
|
this.onPacket(r);
|
|
9171
9171
|
}
|
|
9172
9172
|
onPacket(t) {
|
|
@@ -9227,7 +9227,7 @@ class r3 extends qa {
|
|
|
9227
9227
|
((r, n) => {
|
|
9228
9228
|
const i = r.split(Ed), s = [];
|
|
9229
9229
|
for (let a = 0; a < i.length; a++) {
|
|
9230
|
-
const o =
|
|
9230
|
+
const o = Ua(i[a], n);
|
|
9231
9231
|
if (s.push(o), o.type === "error") break;
|
|
9232
9232
|
}
|
|
9233
9233
|
return s;
|
|
@@ -9461,7 +9461,7 @@ const yo = fr.WebSocket || fr.MozWebSocket, c3 = { websocket: class extends a3 {
|
|
|
9461
9461
|
} else {
|
|
9462
9462
|
if (rs(c) < h) break;
|
|
9463
9463
|
const A = ns(c, h);
|
|
9464
|
-
v.enqueue(
|
|
9464
|
+
v.enqueue(Ua(p ? A : bo.decode(A), o)), d = 0;
|
|
9465
9465
|
}
|
|
9466
9466
|
if (h === 0 || h > a) {
|
|
9467
9467
|
v.enqueue(fa);
|
|
@@ -9729,7 +9729,7 @@ let u3 = class extends h3 {
|
|
|
9729
9729
|
}
|
|
9730
9730
|
};
|
|
9731
9731
|
const l3 = typeof ArrayBuffer == "function", wf = Object.prototype.toString, p3 = typeof Blob == "function" || typeof Blob < "u" && wf.call(Blob) === "[object BlobConstructor]", m3 = typeof File == "function" || typeof File < "u" && wf.call(File) === "[object FileConstructor]";
|
|
9732
|
-
function
|
|
9732
|
+
function $a(e) {
|
|
9733
9733
|
return l3 && (e instanceof ArrayBuffer || ((t) => typeof ArrayBuffer.isView == "function" ? ArrayBuffer.isView(t) : t.buffer instanceof ArrayBuffer)(e)) || p3 && e instanceof Blob || m3 && e instanceof File;
|
|
9734
9734
|
}
|
|
9735
9735
|
function ds(e, t) {
|
|
@@ -9738,7 +9738,7 @@ function ds(e, t) {
|
|
|
9738
9738
|
for (let r = 0, n = e.length; r < n; r++) if (ds(e[r])) return !0;
|
|
9739
9739
|
return !1;
|
|
9740
9740
|
}
|
|
9741
|
-
if (
|
|
9741
|
+
if ($a(e)) return !0;
|
|
9742
9742
|
if (e.toJSON && typeof e.toJSON == "function" && arguments.length === 1) return ds(e.toJSON(), !0);
|
|
9743
9743
|
for (const r in e) if (Object.prototype.hasOwnProperty.call(e, r) && ds(e[r])) return !0;
|
|
9744
9744
|
return !1;
|
|
@@ -9749,7 +9749,7 @@ function b3(e) {
|
|
|
9749
9749
|
}
|
|
9750
9750
|
function la(e, t) {
|
|
9751
9751
|
if (!e) return e;
|
|
9752
|
-
if (
|
|
9752
|
+
if ($a(e)) {
|
|
9753
9753
|
const r = { _placeholder: !0, num: t.length };
|
|
9754
9754
|
return t.push(e), r;
|
|
9755
9755
|
}
|
|
@@ -9798,7 +9798,7 @@ class Ha extends Se {
|
|
|
9798
9798
|
const n = r.type === Jt.BINARY_EVENT;
|
|
9799
9799
|
n || r.type === Jt.BINARY_ACK ? (r.type = n ? Jt.EVENT : Jt.ACK, this.reconstructor = new v3(r), r.attachments === 0 && super.emitReserved("decoded", r)) : super.emitReserved("decoded", r);
|
|
9800
9800
|
} else {
|
|
9801
|
-
if (
|
|
9801
|
+
if (!$a(t) && !t.base64) throw new Error("Unknown type: " + t);
|
|
9802
9802
|
if (!this.reconstructor) throw new Error("got binary data when not reconstructing a packet");
|
|
9803
9803
|
r = this.reconstructor.takeBinaryData(t), r && (this.reconstructor = null, super.emitReserved("decoded", r));
|
|
9804
9804
|
}
|
|
@@ -10272,7 +10272,7 @@ function fs(e, t) {
|
|
|
10272
10272
|
return t.forceNew || t["force new connection"] || t.multiplex === !1 || a ? o = new ma(n, t) : (fi[i] || (fi[i] = new ma(n, t)), o = fi[i]), r.query && !t.query && (t.query = r.queryKey), o.socket(r.path, t);
|
|
10273
10273
|
}
|
|
10274
10274
|
Object.assign(fs, { Manager: ma, Socket: _f, io: fs, connect: fs });
|
|
10275
|
-
const x3 = process.env.NEXT_PUBLIC_SOCKET_ENCRYPTED_URL || "
|
|
10275
|
+
const x3 = process.env.NEXT_PUBLIC_SOCKET_ENCRYPTED_URL || "U2FsdGVkX1/lFjf0FTvvjrvEZKKcfmh4VVTTC3UIu8HM6jNsNjjkjP496WDsZMq5", A3 = process.env.NEXT_PUBLIC_SOCKET_KEY || "041be0b6097b836434923bd5e759ac5389f958621d6e36e5a95484a5b58cb6ed32fe986e6ae64a646d36fa5729d591c5339ccae0be5fd334eefff3fa0b06117e6b", xf = Zi.decrypt(x3, A3);
|
|
10276
10276
|
if (!xf) throw new Error("VITE_SOCKET_URL 환경 변수가 설정되지 않았습니다.");
|
|
10277
10277
|
const bn = class bn {
|
|
10278
10278
|
constructor() {
|
|
@@ -10285,7 +10285,7 @@ const bn = class bn {
|
|
|
10285
10285
|
};
|
|
10286
10286
|
cn(bn, "instance");
|
|
10287
10287
|
let ba = bn;
|
|
10288
|
-
const
|
|
10288
|
+
const Ut = new class {
|
|
10289
10289
|
constructor() {
|
|
10290
10290
|
cn(this, "socketInstance");
|
|
10291
10291
|
this.socketInstance = ba.getInstance();
|
|
@@ -10355,26 +10355,26 @@ const $t = new class {
|
|
|
10355
10355
|
}
|
|
10356
10356
|
getAccountCrypto() {
|
|
10357
10357
|
return new Promise((e, t) => {
|
|
10358
|
-
|
|
10358
|
+
Ut.onMessageReceived("accountInfo", (r) => {
|
|
10359
10359
|
this.isAccountCryptoType(r) ? e(r) : t(new Error("Invalid account crypto"));
|
|
10360
10360
|
});
|
|
10361
10361
|
});
|
|
10362
10362
|
}
|
|
10363
10363
|
receiveRequest(e) {
|
|
10364
10364
|
return new Promise((t, r) => {
|
|
10365
|
-
|
|
10366
|
-
n.message === "Request Message" ? e === n.roomId ? t({ roomId: n.roomId, isSuccess: !0 }) :
|
|
10365
|
+
Ut.onMessageReceived("requestMessage", (n) => {
|
|
10366
|
+
n.message === "Request Message" ? e === n.roomId ? t({ roomId: n.roomId, isSuccess: !0 }) : Ut.leaveRoom(e) : r(new Error("Request message is different"));
|
|
10367
10367
|
});
|
|
10368
10368
|
});
|
|
10369
10369
|
}
|
|
10370
10370
|
sendMessage(e, t) {
|
|
10371
10371
|
return new Promise((r, n) => {
|
|
10372
|
-
|
|
10372
|
+
Ut.confirmMessage(e, t).connected ? r() : n(new Error("Send failed"));
|
|
10373
10373
|
});
|
|
10374
10374
|
}
|
|
10375
10375
|
checkVerified(e, t) {
|
|
10376
10376
|
return new Promise((r, n) => {
|
|
10377
|
-
|
|
10377
|
+
Ut.checkVerified(e, t) ? Ut.onMessageReceived("checkVerified", (i) => {
|
|
10378
10378
|
r(i);
|
|
10379
10379
|
}) : n(new Error("checkVerified failed"));
|
|
10380
10380
|
});
|
|
@@ -10389,7 +10389,7 @@ Nonce: ${r}`, await this.sendMessage(e, t);
|
|
|
10389
10389
|
} catch (n) {
|
|
10390
10390
|
return Promise.reject(n);
|
|
10391
10391
|
} finally {
|
|
10392
|
-
|
|
10392
|
+
Ut.leaveRoom(e);
|
|
10393
10393
|
}
|
|
10394
10394
|
}
|
|
10395
10395
|
}(), S3 = new class {
|
|
@@ -10409,33 +10409,33 @@ Nonce: ${r}`, await this.sendMessage(e, t);
|
|
|
10409
10409
|
}
|
|
10410
10410
|
}(), Af = { Enc: pi, Sign: Is, Util: Ke, Validation: S3 }, Nn = new class {
|
|
10411
10411
|
generateLoginQrCode(e, t, r, n, i, s) {
|
|
10412
|
-
const a = xe.lib.WordArray.random(16).toString(xe.enc.Hex), o = `${this.getQrDomain(s)}/qrCode/scan?type=login&
|
|
10413
|
-
return
|
|
10412
|
+
const a = xe.lib.WordArray.random(16).toString(xe.enc.Hex), o = new URLSearchParams({ roomId: a, dapp: e, url: t, network: r.toString(), icon: n ?? "undefined", method: i }), c = encodeURIComponent(o.toString()), d = `${this.getQrDomain(s)}/qrCode/scan?type=login&encoded=${c}`;
|
|
10413
|
+
return Ut.joinRoom(a), { qrCode: d, roomId: a };
|
|
10414
10414
|
}
|
|
10415
10415
|
generateProvideQrCode(e, t, r, n, i) {
|
|
10416
|
-
const s = xe.lib.WordArray.random(16).toString(xe.enc.Hex), a = `${this.getQrDomain(i)}/qrCode/scan?type=provide&
|
|
10417
|
-
return
|
|
10416
|
+
const s = xe.lib.WordArray.random(16).toString(xe.enc.Hex), a = new URLSearchParams({ roomId: s, dapp: e, url: t, network: r.toString(), icon: n ?? "undefined" }), o = encodeURIComponent(a.toString()), c = `${this.getQrDomain(i)}/qrCode/scan?type=provide&encoded=${o}`;
|
|
10417
|
+
return Ut.joinRoom(s), { qrCode: c, roomId: s };
|
|
10418
10418
|
}
|
|
10419
10419
|
generatePaymentQrCode(e, t, r, n, i, s, a) {
|
|
10420
|
-
const o = xe.lib.WordArray.random(16).toString(xe.enc.Hex), c = `${this.getQrDomain(a)}/qrCode/scan?type=payment&
|
|
10421
|
-
return
|
|
10420
|
+
const o = xe.lib.WordArray.random(16).toString(xe.enc.Hex), c = new URLSearchParams({ roomId: o, dapp: e, address: r, amount: n, description: i ?? "undefined", info: s ?? "undefined", network: t.toString() }), d = encodeURIComponent(c.toString()), h = `${this.getQrDomain(a)}/qrCode/scan?type=payment&encoded=${d}`;
|
|
10421
|
+
return Ut.joinRoom(o), { qrCode: h, roomId: o };
|
|
10422
10422
|
}
|
|
10423
10423
|
generateAirdropQrCode(e, t, r, n) {
|
|
10424
|
-
const i = xe.lib.WordArray.random(16).toString(xe.enc.Hex), s = `${this.getQrDomain(n)}/qrCode/scan?type=airdrop&
|
|
10425
|
-
return
|
|
10424
|
+
const i = xe.lib.WordArray.random(16).toString(xe.enc.Hex), s = new URLSearchParams({ roomId: i, dapp: e, icon: r ?? "undefined", network: t.toString() }), a = encodeURIComponent(s.toString()), o = `${this.getQrDomain(n)}/qrCode/scan?type=airdrop&encoded=${a}`;
|
|
10425
|
+
return Ut.joinRoom(i), { qrCode: o, roomId: i };
|
|
10426
10426
|
}
|
|
10427
10427
|
generateSendTransactionQrCode(e, t, r, n, i) {
|
|
10428
|
-
const s = xe.lib.WordArray.random(16).toString(xe.enc.Hex), a = `${this.getQrDomain(i)}/qrCode/scan?type=sendTransaction&
|
|
10429
|
-
return
|
|
10428
|
+
const s = xe.lib.WordArray.random(16).toString(xe.enc.Hex), a = new URLSearchParams({ roomId: s, dapp: e, url: r, icon: n ?? "undefined", network: t.toString() }), o = encodeURIComponent(a.toString()), c = `${this.getQrDomain(i)}/qrCode/scan?type=sendTransaction&encoded=${o}`;
|
|
10429
|
+
return Ut.joinRoom(s), { qrCode: c, roomId: s };
|
|
10430
10430
|
}
|
|
10431
10431
|
getQrDomain(e) {
|
|
10432
10432
|
return e || "https://zigap.io";
|
|
10433
10433
|
}
|
|
10434
10434
|
}(), Vi = "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", R3 = ({ 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: p = { type: "DEFAULT" }, qrDomain: w, ...v }) => {
|
|
10435
|
-
const [A, I] = Fe(!0), [_, M] = Fe(!1), S = Zi.generateNonce(16), { qrCode:
|
|
10435
|
+
const [A, I] = Fe(!0), [_, M] = Fe(!1), S = Zi.generateNonce(16), { qrCode: O, roomId: k } = Nn.generateLoginQrCode(t, r, e, d, "login", w);
|
|
10436
10436
|
return Ye(() => {
|
|
10437
10437
|
const N = setTimeout(() => {
|
|
10438
|
-
|
|
10438
|
+
Ut.leaveRoom(k), I(!1);
|
|
10439
10439
|
}, 1e3 * s);
|
|
10440
10440
|
return () => clearTimeout(N);
|
|
10441
10441
|
}, [k, s]), Ye(() => {
|
|
@@ -10464,7 +10464,7 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10464
10464
|
case "CUSTOM":
|
|
10465
10465
|
return p.type === "CUSTOM" ? p.component : void 0;
|
|
10466
10466
|
}
|
|
10467
|
-
})(p.type) }) : Dt.jsx(In, { value:
|
|
10467
|
+
})(p.type) }) : Dt.jsx(In, { value: O, size: h, ...a && { imageSettings: { src: Vi, width: o, height: o, excavate: !1 } }, ...v }) }) : Dt.jsx(Id, { children: Dt.jsx(Td, { children: "QR timeout" }) });
|
|
10468
10468
|
}, Id = Br.div`
|
|
10469
10469
|
width: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10470
10470
|
height: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
@@ -10480,26 +10480,26 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10480
10480
|
}
|
|
10481
10481
|
startPayment(e) {
|
|
10482
10482
|
return new Promise((t, r) => {
|
|
10483
|
-
|
|
10484
|
-
n.message === "Join the room" ? e === n.roomId ? t({ isSuccess: !0 }) :
|
|
10483
|
+
Ut.onMessageReceived("startPayment", (n) => {
|
|
10484
|
+
n.message === "Join the room" ? e === n.roomId ? t({ isSuccess: !0 }) : Ut.leaveRoom(e) : r(new Error("Failed to join room"));
|
|
10485
10485
|
});
|
|
10486
10486
|
});
|
|
10487
10487
|
}
|
|
10488
10488
|
healthCheck() {
|
|
10489
10489
|
return new Promise((e, t) => {
|
|
10490
|
-
|
|
10490
|
+
Ut.onMessageReceived("healthCheck", (r) => {
|
|
10491
10491
|
r.message === "ping" ? e(!0) : t(new Error("Health check failed"));
|
|
10492
10492
|
});
|
|
10493
10493
|
});
|
|
10494
10494
|
}
|
|
10495
10495
|
checkResponse(e) {
|
|
10496
10496
|
return new Promise((t, r) => {
|
|
10497
|
-
|
|
10497
|
+
Ut.checkResponse(e).connected ? t() : r(new Error("Response failed"));
|
|
10498
10498
|
});
|
|
10499
10499
|
}
|
|
10500
10500
|
getTransactionResult() {
|
|
10501
10501
|
return new Promise((e, t) => {
|
|
10502
|
-
|
|
10502
|
+
Ut.onMessageReceived("transactionInfo", (r) => {
|
|
10503
10503
|
this.isTransactionResultType(r) ? e(r) : t(new Error("Invalid account crypto"));
|
|
10504
10504
|
});
|
|
10505
10505
|
});
|
|
@@ -10511,22 +10511,22 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10511
10511
|
} catch (t) {
|
|
10512
10512
|
return Promise.reject(t);
|
|
10513
10513
|
} finally {
|
|
10514
|
-
|
|
10514
|
+
Ut.leaveRoom(e);
|
|
10515
10515
|
}
|
|
10516
10516
|
}
|
|
10517
10517
|
}(), N3 = ({ 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: p = { type: "DEFAULT" }, ...w }) => {
|
|
10518
10518
|
const [v, A] = Fe(!0), [I, _] = Fe(!1), { qrCode: M, roomId: S } = Nn.generatePaymentQrCode(t, e, r, n, i, s);
|
|
10519
10519
|
return Ye(() => {
|
|
10520
|
-
const
|
|
10521
|
-
|
|
10520
|
+
const O = setTimeout(() => {
|
|
10521
|
+
Ut.leaveRoom(S), A(!1);
|
|
10522
10522
|
}, 1e3 * o);
|
|
10523
|
-
return () => clearTimeout(
|
|
10523
|
+
return () => clearTimeout(O);
|
|
10524
10524
|
}, [S, o]), Ye(() => {
|
|
10525
10525
|
(async () => {
|
|
10526
10526
|
try {
|
|
10527
10527
|
console.log("roomId", S);
|
|
10528
|
-
const
|
|
10529
|
-
if (_(!0), a && a({ status: "REQUEST" }),
|
|
10528
|
+
const O = await Rd.startPayment(S);
|
|
10529
|
+
if (_(!0), a && a({ status: "REQUEST" }), O.isSuccess) {
|
|
10530
10530
|
const k = await Rd.qrPayment(S), N = { from: k.from, txHash: k.txHash, status: k.status };
|
|
10531
10531
|
console.log("result: ", N), a && a({ status: "SUCCESS" }), _(!1);
|
|
10532
10532
|
}
|
|
@@ -10534,24 +10534,24 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10534
10534
|
a && a({ status: "ERROR" }), _(!1);
|
|
10535
10535
|
}
|
|
10536
10536
|
})();
|
|
10537
|
-
}, [a]), v ? Dt.jsx(Dt.Fragment, { children: I && p.type !== "NONE" ? Dt.jsx(Nd, { $size: h, children: ((
|
|
10538
|
-
switch (
|
|
10537
|
+
}, [a]), v ? Dt.jsx(Dt.Fragment, { children: I && p.type !== "NONE" ? Dt.jsx(Nd, { $size: h, children: ((O) => {
|
|
10538
|
+
switch (O) {
|
|
10539
10539
|
case "DEFAULT":
|
|
10540
|
-
return Dt.jsx(
|
|
10540
|
+
return Dt.jsx(Cd, { children: "processing..." });
|
|
10541
10541
|
case "NONE":
|
|
10542
10542
|
default:
|
|
10543
10543
|
return;
|
|
10544
10544
|
case "CUSTOM":
|
|
10545
10545
|
return p.type === "CUSTOM" ? p.component : void 0;
|
|
10546
10546
|
}
|
|
10547
|
-
})(p.type) }) : Dt.jsx(In, { value: M, size: h, ...c && { imageSettings: { src: Vi, width: d, height: d, excavate: !1 } }, ...w }) }) : Dt.jsx(Nd, { children: Dt.jsx(
|
|
10547
|
+
})(p.type) }) : Dt.jsx(In, { value: M, size: h, ...c && { imageSettings: { src: Vi, width: d, height: d, excavate: !1 } }, ...w }) }) : Dt.jsx(Nd, { children: Dt.jsx(Cd, { children: "QR timeout" }) });
|
|
10548
10548
|
}, Nd = Br.div`
|
|
10549
10549
|
width: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10550
10550
|
height: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10551
10551
|
display: flex;
|
|
10552
10552
|
justify-content: center;
|
|
10553
10553
|
align-items: center;
|
|
10554
|
-
`,
|
|
10554
|
+
`, Cd = Br.div`
|
|
10555
10555
|
font-size: 12px;
|
|
10556
10556
|
color: #7a7a7a;
|
|
10557
10557
|
`, E3 = new class {
|
|
@@ -10560,7 +10560,7 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10560
10560
|
}
|
|
10561
10561
|
getAccount() {
|
|
10562
10562
|
return new Promise((e, t) => {
|
|
10563
|
-
|
|
10563
|
+
Ut.onMessageReceived("addressProvide", (r) => {
|
|
10564
10564
|
this.isAccountType(r) ? e(r) : t(new Error("Invalid address"));
|
|
10565
10565
|
});
|
|
10566
10566
|
});
|
|
@@ -10571,14 +10571,14 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10571
10571
|
} catch (t) {
|
|
10572
10572
|
return Promise.reject(t);
|
|
10573
10573
|
} finally {
|
|
10574
|
-
|
|
10574
|
+
Ut.leaveRoom(e);
|
|
10575
10575
|
}
|
|
10576
10576
|
}
|
|
10577
|
-
}(),
|
|
10577
|
+
}(), C3 = ({ availableNetworks: e, dapp: t, url: r, validSeconds: n, onReceive: i, isShowLogo: s = !1, logoSize: a = 30, icon: o, ...c }) => {
|
|
10578
10578
|
const [d, h] = Fe(!0), { qrCode: p, roomId: w } = Nn.generateProvideQrCode(t, r, e, o);
|
|
10579
10579
|
return Ye(() => {
|
|
10580
10580
|
const v = setTimeout(() => {
|
|
10581
|
-
|
|
10581
|
+
Ut.leaveRoom(w), h(!1);
|
|
10582
10582
|
}, 60 * n * 1e3);
|
|
10583
10583
|
return () => clearTimeout(v);
|
|
10584
10584
|
}, [w, n]), Ye(() => {
|
|
@@ -10592,43 +10592,43 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10592
10592
|
}
|
|
10593
10593
|
})();
|
|
10594
10594
|
}, []), d ? Dt.jsx(In, { value: p, ...s && { imageSettings: { src: Vi, width: a, height: a, excavate: !1 } }, ...c }) : Dt.jsx("div", { children: "QR loading error" });
|
|
10595
|
-
},
|
|
10595
|
+
}, Od = new class {
|
|
10596
10596
|
startAirdrop(e) {
|
|
10597
10597
|
return new Promise((t, r) => {
|
|
10598
|
-
|
|
10599
|
-
console.log("startAirdrop message:", n), n.message === "Join the room" ? e === n.roomId && t({ isSuccess: !0 }) : (
|
|
10598
|
+
Ut.onMessageReceived("userJoined", (n) => {
|
|
10599
|
+
console.log("startAirdrop message:", n), n.message === "Join the room" ? e === n.roomId && t({ isSuccess: !0 }) : (Ut.leaveRoom(e), r(new Error("Failed to join room or mismatched roomId")));
|
|
10600
10600
|
});
|
|
10601
10601
|
});
|
|
10602
10602
|
}
|
|
10603
10603
|
async getAirdrop(e) {
|
|
10604
10604
|
return new Promise((t, r) => {
|
|
10605
|
-
|
|
10606
|
-
console.log("airdropStart message:", n), n.message === "Airdrop started" && e === n.roomId ? t({ isSuccess: !0 }) : r(new Error("Invalid airdrop result")),
|
|
10605
|
+
Ut.onMessageReceived("airdropStart", (n) => {
|
|
10606
|
+
console.log("airdropStart message:", n), n.message === "Airdrop started" && e === n.roomId ? t({ isSuccess: !0 }) : r(new Error("Invalid airdrop result")), Ut.leaveRoom(e), Ut.offMessageReceived("airdropStart");
|
|
10607
10607
|
});
|
|
10608
10608
|
});
|
|
10609
10609
|
}
|
|
10610
|
-
}(),
|
|
10610
|
+
}(), O3 = ({ availableNetworks: e, dapp: t, validSeconds: r, onReceive: n, isShowLogo: i = !1, logoSize: s = 30, icon: a, size: o, processingMark: c = { type: "DEFAULT" }, ...d }) => {
|
|
10611
10611
|
const [h, p] = Fe(!0), [w, v] = Fe(!1), [A, I] = Fe(""), [_, M] = Fe(""), S = () => {
|
|
10612
|
-
const { qrCode:
|
|
10613
|
-
I(k), M(
|
|
10612
|
+
const { qrCode: O, roomId: k } = Nn.generateAirdropQrCode(t, e, a);
|
|
10613
|
+
I(k), M(O), console.log("New QR Code generated:", k);
|
|
10614
10614
|
};
|
|
10615
10615
|
return Ye(() => {
|
|
10616
10616
|
S();
|
|
10617
10617
|
}, []), Ye(() => {
|
|
10618
|
-
const
|
|
10619
|
-
|
|
10618
|
+
const O = setTimeout(() => {
|
|
10619
|
+
Ut.leaveRoom(A), p(!1);
|
|
10620
10620
|
}, 60 * r * 1e3);
|
|
10621
|
-
return () => clearTimeout(
|
|
10621
|
+
return () => clearTimeout(O);
|
|
10622
10622
|
}, [A, r]), Ye(() => {
|
|
10623
10623
|
(async () => {
|
|
10624
10624
|
try {
|
|
10625
|
-
console.log("roomId:", A), (await
|
|
10626
|
-
} catch (
|
|
10627
|
-
console.error("Error during airdrop:",
|
|
10625
|
+
console.log("roomId:", A), (await Od.startAirdrop(A)).isSuccess && (v(!0), n && n({ status: "REQUEST" }), (await Od.getAirdrop(A)).isSuccess ? (n && n({ status: "SUCCESS", result: { isSuccess: !0 } }), v(!1), S(), Ut.leaveRoom(A)) : (n && n({ status: "ERROR", result: { isSuccess: !1 } }), v(!1), console.log("Airdrop failed, keeping processing state"), Ut.leaveRoom(A)));
|
|
10626
|
+
} catch (O) {
|
|
10627
|
+
console.error("Error during airdrop:", O), n && n({ status: "ERROR", result: { isSuccess: !1 } }), v(!1), Ut.leaveRoom(A);
|
|
10628
10628
|
}
|
|
10629
10629
|
})();
|
|
10630
|
-
}, [A, n]), h ? Dt.jsx(Dt.Fragment, { children: w && c.type !== "NONE" ? Dt.jsx(Bd, { $size: o, children: ((
|
|
10631
|
-
switch (
|
|
10630
|
+
}, [A, n]), h ? Dt.jsx(Dt.Fragment, { children: w && c.type !== "NONE" ? Dt.jsx(Bd, { $size: o, children: ((O) => {
|
|
10631
|
+
switch (O) {
|
|
10632
10632
|
case "DEFAULT":
|
|
10633
10633
|
return Dt.jsx(Pd, { children: "Processing..." });
|
|
10634
10634
|
case "NONE":
|
|
@@ -10650,26 +10650,26 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10650
10650
|
`, Ld = new class {
|
|
10651
10651
|
getTransactionCrypto() {
|
|
10652
10652
|
return new Promise((e, t) => {
|
|
10653
|
-
|
|
10653
|
+
Ut.onMessageReceived("sendTransactionInfo", (r) => {
|
|
10654
10654
|
r.txHash || r.error ? e(r) : t(new Error("Invalid transaction crypto"));
|
|
10655
10655
|
});
|
|
10656
10656
|
});
|
|
10657
10657
|
}
|
|
10658
10658
|
receiveRequest(e) {
|
|
10659
10659
|
return new Promise((t, r) => {
|
|
10660
|
-
|
|
10661
|
-
n.message === "Request SendTransaction" ? e === n.roomId ? t({ roomId: n.roomId, isSuccess: !0 }) :
|
|
10660
|
+
Ut.onMessageReceived("requestSendTransaction", (n) => {
|
|
10661
|
+
n.message === "Request SendTransaction" ? e === n.roomId ? t({ roomId: n.roomId, isSuccess: !0 }) : Ut.leaveRoom(e) : r(new Error("Request message is different"));
|
|
10662
10662
|
});
|
|
10663
10663
|
});
|
|
10664
10664
|
}
|
|
10665
10665
|
sendMessage(e, t) {
|
|
10666
10666
|
return new Promise((r, n) => {
|
|
10667
|
-
|
|
10667
|
+
Ut.confirmSendTransaction(e, t).connected ? r() : n(new Error("Send failed"));
|
|
10668
10668
|
});
|
|
10669
10669
|
}
|
|
10670
10670
|
checkVerified(e, t) {
|
|
10671
10671
|
return new Promise((r, n) => {
|
|
10672
|
-
|
|
10672
|
+
Ut.checkVerified(e, t) ? Ut.onMessageReceived("checkVerified", (i) => {
|
|
10673
10673
|
r(i);
|
|
10674
10674
|
}) : n(new Error("checkVerified failed"));
|
|
10675
10675
|
});
|
|
@@ -10682,21 +10682,21 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10682
10682
|
} catch (r) {
|
|
10683
10683
|
return Promise.reject(r);
|
|
10684
10684
|
} finally {
|
|
10685
|
-
|
|
10685
|
+
Ut.leaveRoom(e);
|
|
10686
10686
|
}
|
|
10687
10687
|
}
|
|
10688
10688
|
}(), B3 = ({ 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: p, ...w }) => {
|
|
10689
10689
|
const [v, A] = Fe(!0), [I, _] = Fe(!1), { qrCode: M, roomId: S } = Nn.generateSendTransactionQrCode(t, e, r, c, p);
|
|
10690
10690
|
return Ye(() => {
|
|
10691
|
-
const
|
|
10692
|
-
|
|
10691
|
+
const O = setTimeout(() => {
|
|
10692
|
+
Ut.leaveRoom(S), A(!1);
|
|
10693
10693
|
}, 1e3 * i);
|
|
10694
|
-
return () => clearTimeout(
|
|
10694
|
+
return () => clearTimeout(O);
|
|
10695
10695
|
}, [S, i]), Ye(() => {
|
|
10696
10696
|
(async () => {
|
|
10697
10697
|
try {
|
|
10698
|
-
const
|
|
10699
|
-
if (_(!0), n && n({ status: "REQUEST" }),
|
|
10698
|
+
const O = await Ld.receiveRequest(S);
|
|
10699
|
+
if (_(!0), n && n({ status: "REQUEST" }), O.isSuccess) {
|
|
10700
10700
|
const k = await Ld.qrSendTransaction(S, d), N = { txHash: k.txHash, status: k.status, error: k.error };
|
|
10701
10701
|
n && n({ status: "SUCCESS", result: N }), _(!1);
|
|
10702
10702
|
}
|
|
@@ -10704,8 +10704,8 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10704
10704
|
n && n({ status: "ERROR" }), _(!1);
|
|
10705
10705
|
}
|
|
10706
10706
|
})();
|
|
10707
|
-
}, [n]), v ? Dt.jsx(Dt.Fragment, { children: I && h.type !== "NONE" ? Dt.jsx(zd, { $size: o, children: ((
|
|
10708
|
-
switch (
|
|
10707
|
+
}, [n]), v ? Dt.jsx(Dt.Fragment, { children: I && h.type !== "NONE" ? Dt.jsx(zd, { $size: o, children: ((O) => {
|
|
10708
|
+
switch (O) {
|
|
10709
10709
|
case "DEFAULT":
|
|
10710
10710
|
return Dt.jsx(jd, { children: "processing..." });
|
|
10711
10711
|
case "NONE":
|
|
@@ -10725,10 +10725,10 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10725
10725
|
font-size: 12px;
|
|
10726
10726
|
color: #7a7a7a;
|
|
10727
10727
|
`, P3 = ({ 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: p = { type: "DEFAULT" }, qrDomain: w, ...v }) => {
|
|
10728
|
-
const [A, I] = Fe(!0), [_, M] = Fe(!1), S = Zi.generateNonce(16), { qrCode:
|
|
10728
|
+
const [A, I] = Fe(!0), [_, M] = Fe(!1), S = Zi.generateNonce(16), { qrCode: O, roomId: k } = Nn.generateLoginQrCode(t, r, e, d, "signature", w);
|
|
10729
10729
|
return Ye(() => {
|
|
10730
10730
|
const N = setTimeout(() => {
|
|
10731
|
-
|
|
10731
|
+
Ut.leaveRoom(k), I(!1);
|
|
10732
10732
|
}, 1e3 * s);
|
|
10733
10733
|
return () => clearTimeout(N);
|
|
10734
10734
|
}, [k, s]), Ye(() => {
|
|
@@ -10747,7 +10747,7 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10747
10747
|
i && i({ status: "ERROR" }), M(!1);
|
|
10748
10748
|
}
|
|
10749
10749
|
})();
|
|
10750
|
-
}, [i, n]), A ? Dt.jsx(Dt.Fragment, { children: _ && p.type !== "NONE" ? Dt.jsx(
|
|
10750
|
+
}, [i, n]), A ? Dt.jsx(Dt.Fragment, { children: _ && p.type !== "NONE" ? Dt.jsx(Ud, { $size: h, children: ((N) => {
|
|
10751
10751
|
switch (N) {
|
|
10752
10752
|
case "DEFAULT":
|
|
10753
10753
|
return Dt.jsx(qd, { children: "processing..." });
|
|
@@ -10757,8 +10757,8 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10757
10757
|
case "CUSTOM":
|
|
10758
10758
|
return p.type === "CUSTOM" ? p.component : void 0;
|
|
10759
10759
|
}
|
|
10760
|
-
})(p.type) }) : Dt.jsx(In, { value:
|
|
10761
|
-
},
|
|
10760
|
+
})(p.type) }) : Dt.jsx(In, { value: O, size: h, ...a && { imageSettings: { src: Vi, width: o, height: o, excavate: !1 } }, ...v }) }) : Dt.jsx(Ud, { children: Dt.jsx(qd, { children: "QR timeout" }) });
|
|
10761
|
+
}, Ud = Br.div`
|
|
10762
10762
|
width: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10763
10763
|
height: ${(e) => e.$size ? `${e.$size}px` : "128px"};
|
|
10764
10764
|
display: flex;
|
|
@@ -10769,8 +10769,8 @@ Nonce: ${S}`, f = (c == null ? void 0 : c.type) ?? "NONE", l = (c == null ? void
|
|
|
10769
10769
|
color: #7a7a7a;
|
|
10770
10770
|
`, L3 = { Qr: Nn };
|
|
10771
10771
|
export {
|
|
10772
|
-
|
|
10773
|
-
|
|
10772
|
+
C3 as AddressProvideQR,
|
|
10773
|
+
O3 as AirdropQR,
|
|
10774
10774
|
R3 as LoginQR,
|
|
10775
10775
|
N3 as PaymentQR,
|
|
10776
10776
|
B3 as SendTransactionQR,
|