@pioneer-platform/pioneer-react 0.2.47 → 0.2.49
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.js +198340 -146844
- package/dist/{index_0e37f5ff.js → index_0652205a.js} +6 -6
- package/dist/{index_f9d1a3bf.js → index_096371b1.js} +3 -1
- package/dist/{index_ae6c3b10.js → index_0a5ed442.js} +3 -3
- package/dist/{index_e233a036.js → index_0a6e5811.js} +1 -1
- package/dist/{index_547d2868.js → index_0b5f5f6a.js} +4 -4
- package/dist/index_10812439.js +25 -0
- package/dist/{index_4a548214.js → index_1093b1b4.js} +8 -8
- package/dist/{index_3a6b0cd3.js → index_169417bf.js} +3 -3
- package/dist/{index_e168f4c0.js → index_1d5f0f00.js} +7 -7
- package/dist/{index_e57ba5a5.js → index_278505c5.js} +3 -3
- package/dist/{index_a4f5a15a.js → index_2845411a.js} +19 -19
- package/dist/{index_003befba.js → index_29be6ff5.js} +1122 -1312
- package/dist/{index_a6b45215.js → index_2dc95f2a.js} +7 -3
- package/dist/{index_6d2a3e5c.js → index_3402bab8.js} +6 -2
- package/dist/{index_310b7772.js → index_3c54e5ec.js} +9 -9
- package/dist/{index_f9d461d1.js → index_423ea09e.js} +3 -3
- package/dist/{index_37894947.js → index_4425b278.js} +3 -3
- package/dist/{index_61a33920.js → index_514c608b.js} +6 -6
- package/dist/index_51b338c1.js +121 -0
- package/dist/{index_0364269a.js → index_5d8426fb.js} +3 -3
- package/dist/index_628b22bc.js +11003 -0
- package/dist/index_63a883f7.js +446 -0
- package/dist/{index_d8e757ba.js → index_654fef3a.js} +3 -3
- package/dist/index_691fd636.js +12913 -0
- package/dist/{index_674ffbfa.js → index_69b0f47b.js} +9 -9
- package/dist/{index_a682c1a8.js → index_6cd7bc1a.js} +3 -1
- package/dist/{index_c8ebd6e3.js → index_6ebe4744.js} +900 -900
- package/dist/{index_7382dec1.js → index_7f735685.js} +5 -5
- package/dist/{index_b3022c1a.js → index_82348f63.js} +5 -5
- package/dist/index_849386d3.js +1115 -0
- package/dist/{index_85b01410.js → index_8610c3c4.js} +6 -6
- package/dist/index_8d6422b9.js +112 -0
- package/dist/{index_167c5f7a.js → index_8fd2c24a.js} +3 -3
- package/dist/{index_1990afbf.js → index_942c3b80.js} +4 -4
- package/dist/index_94b7968d.js +22872 -0
- package/dist/index_94d38802.js +2856 -0
- package/dist/{index_bd7e0d56.js → index_a5ca5cc4.js} +2 -2
- package/dist/{index_f80541a0.js → index_aa71379e.js} +307 -267
- package/dist/{index_354cce52.js → index_aa773d39.js} +3 -3
- package/dist/{index_29e62962.js → index_b022faaa.js} +4 -4
- package/dist/index_b1028d5f.js +65 -0
- package/dist/index_c232ca43.js +25 -0
- package/dist/{index_f19b5fe5.js → index_c9105338.js} +3 -3
- package/dist/{index_7c12bb44.js → index_cebbd50e.js} +1 -1
- package/dist/{index_ca633a1c.js → index_d477606a.js} +7 -7
- package/dist/index_d8a5e2ef.js +116 -0
- package/dist/{index_542dbb9a.js → index_de4af619.js} +4 -4
- package/dist/{index_7a1bb0b1.js → index_df47a9c6.js} +8 -8
- package/dist/{index_8b9255eb.js → index_e0b32f2f.js} +10 -10
- package/dist/{index_b21f58b7.js → index_e2794130.js} +4 -4
- package/dist/{index_2cbf1530.js → index_ecce7b22.js} +6 -6
- package/dist/{index_3891b298.js → index_f2d68730.js} +1 -1
- package/dist/index_f66728ba.js +130 -0
- package/dist/{index_f3922fc1.js → index_f8bc80e1.js} +3 -3
- package/package.json +19 -18
- package/src/lib/context/Pioneer/sdk/connect.ts +11 -11
|
@@ -1,16 +1,16 @@
|
|
|
1
|
-
import { i, g as global, R,
|
|
2
|
-
import { x as xB$1, Y as YM$1, M as MB$1, B as BB$1, S as SB$1, X as XM$1, e as eB$1 } from "./
|
|
3
|
-
import "./
|
|
4
|
-
import { B as BinanceToolbox, G as GaiaToolbox, T as ThorchainToolbox } from "./
|
|
5
|
-
import { b as build } from "./
|
|
6
|
-
import { S as SN$1, O as ON$1, T as TN$1, A as AN$1 } from "./
|
|
1
|
+
import { i, g as global, R, d, I, L, $ } from "./index_aa71379e.js";
|
|
2
|
+
import { x as xB$1, Y as YM$1, M as MB$1, B as BB$1, S as SB$1, X as XM$1, e as eB$1 } from "./index_69b0f47b.js";
|
|
3
|
+
import "./index_0652205a.js";
|
|
4
|
+
import { B as BinanceToolbox, G as GaiaToolbox, T as ThorchainToolbox } from "./index_2845411a.js";
|
|
5
|
+
import { b as build } from "./index_f8bc80e1.js";
|
|
6
|
+
import { S as SN$1, O as ON$1, T as TN$1, A as AN$1 } from "./index_e2794130.js";
|
|
7
7
|
import "react";
|
|
8
8
|
import "@chakra-ui/react";
|
|
9
9
|
import "react-dom";
|
|
10
|
-
import "./
|
|
11
|
-
import "./
|
|
12
|
-
import "./
|
|
13
|
-
import "./
|
|
10
|
+
import "./index_aa773d39.js";
|
|
11
|
+
import "./index_096371b1.js";
|
|
12
|
+
import "./index_6cd7bc1a.js";
|
|
13
|
+
import "./index_a5ca5cc4.js";
|
|
14
14
|
var J6 = Object.defineProperty;
|
|
15
15
|
var q6 = (e10, t, r) => t in e10 ? J6(e10, t, { enumerable: true, configurable: true, writable: true, value: r }) : e10[t] = r;
|
|
16
16
|
var Nr = (e10, t, r) => (q6(e10, typeof t != "symbol" ? t + "" : t, r), r), Z0 = (e10, t, r) => {
|
|
@@ -233,7 +233,7 @@ var cm = {}, bh = {}, Re = {};
|
|
|
233
233
|
return false;
|
|
234
234
|
}
|
|
235
235
|
e10.canConsumeForm = M;
|
|
236
|
-
class
|
|
236
|
+
class D {
|
|
237
237
|
constructor(P, k = (K) => K) {
|
|
238
238
|
this.raw = P, this.transformer = k;
|
|
239
239
|
}
|
|
@@ -241,7 +241,7 @@ var cm = {}, bh = {}, Re = {};
|
|
|
241
241
|
return this.transformer(await this.raw.json());
|
|
242
242
|
}
|
|
243
243
|
}
|
|
244
|
-
e10.JSONApiResponse =
|
|
244
|
+
e10.JSONApiResponse = D;
|
|
245
245
|
class F {
|
|
246
246
|
constructor(P) {
|
|
247
247
|
this.raw = P;
|
|
@@ -6657,7 +6657,7 @@ const Xa = (e10, t, r, n) => {
|
|
|
6657
6657
|
signerAddress: r,
|
|
6658
6658
|
signDoc: {
|
|
6659
6659
|
account_number: (l == null ? void 0 : l.account_number.toString()) ?? "0",
|
|
6660
|
-
chain_id:
|
|
6660
|
+
chain_id: d.Binance,
|
|
6661
6661
|
memo: a,
|
|
6662
6662
|
sequence: (l == null ? void 0 : l.sequence.toString()) ?? "0",
|
|
6663
6663
|
source: "0",
|
|
@@ -6701,7 +6701,7 @@ const Xa = (e10, t, r, n) => {
|
|
|
6701
6701
|
}), n = GaiaToolbox({ server: t });
|
|
6702
6702
|
fl.amount[0].amount = String(
|
|
6703
6703
|
//@ts-ignore
|
|
6704
|
-
await (n == null ? void 0 : n.getFeeRateFromThorswap(
|
|
6704
|
+
await (n == null ? void 0 : n.getFeeRateFromThorswap(d.Cosmos)) ?? "500"
|
|
6705
6705
|
);
|
|
6706
6706
|
const i$1 = async ({
|
|
6707
6707
|
amount: o,
|
|
@@ -6716,7 +6716,7 @@ const Xa = (e10, t, r, n) => {
|
|
|
6716
6716
|
fee: fl,
|
|
6717
6717
|
memo: l,
|
|
6718
6718
|
sequence: (b == null ? void 0 : b.sequence.toString()) ?? "",
|
|
6719
|
-
chain_id:
|
|
6719
|
+
chain_id: d.Cosmos,
|
|
6720
6720
|
account_number: (b == null ? void 0 : b.accountNumber.toString()) ?? "",
|
|
6721
6721
|
msgs: [
|
|
6722
6722
|
{
|
|
@@ -6725,10 +6725,10 @@ const Xa = (e10, t, r, n) => {
|
|
|
6725
6725
|
}
|
|
6726
6726
|
]
|
|
6727
6727
|
}
|
|
6728
|
-
}), M = atob(O.serialized),
|
|
6728
|
+
}), M = atob(O.serialized), D = new Uint8Array(M.length);
|
|
6729
6729
|
for (let J = 0; J < M.length; J++)
|
|
6730
|
-
|
|
6731
|
-
return (await (await build.StargateClient.connect(I.Cosmos)).broadcastTx(
|
|
6730
|
+
D[J] = M.charCodeAt(J);
|
|
6731
|
+
return (await (await build.StargateClient.connect(I.Cosmos)).broadcastTx(D)).transactionHash;
|
|
6732
6732
|
} catch (b) {
|
|
6733
6733
|
throw console.error(b), b;
|
|
6734
6734
|
}
|
|
@@ -7127,8 +7127,8 @@ function v7(e10) {
|
|
|
7127
7127
|
var Yh = {};
|
|
7128
7128
|
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
|
|
7129
7129
|
Yh.read = function(e10, t, r, n, i10) {
|
|
7130
|
-
var s, o, a = i10 * 8 - n - 1, u = (1 << a) - 1, l = u >> 1, b = -7, O = r ? i10 - 1 : 0, M = r ? -1 : 1,
|
|
7131
|
-
for (O += M, s =
|
|
7130
|
+
var s, o, a = i10 * 8 - n - 1, u = (1 << a) - 1, l = u >> 1, b = -7, O = r ? i10 - 1 : 0, M = r ? -1 : 1, D = e10[t + O];
|
|
7131
|
+
for (O += M, s = D & (1 << -b) - 1, D >>= -b, b += a; b > 0; s = s * 256 + e10[t + O], O += M, b -= 8)
|
|
7132
7132
|
;
|
|
7133
7133
|
for (o = s & (1 << -b) - 1, s >>= -b, b += n; b > 0; o = o * 256 + e10[t + O], O += M, b -= 8)
|
|
7134
7134
|
;
|
|
@@ -7136,18 +7136,18 @@ Yh.read = function(e10, t, r, n, i10) {
|
|
|
7136
7136
|
s = 1 - l;
|
|
7137
7137
|
else {
|
|
7138
7138
|
if (s === u)
|
|
7139
|
-
return o ? NaN : (
|
|
7139
|
+
return o ? NaN : (D ? -1 : 1) * (1 / 0);
|
|
7140
7140
|
o = o + Math.pow(2, n), s = s - l;
|
|
7141
7141
|
}
|
|
7142
|
-
return (
|
|
7142
|
+
return (D ? -1 : 1) * o * Math.pow(2, s - n);
|
|
7143
7143
|
};
|
|
7144
7144
|
Yh.write = function(e10, t, r, n, i10, s) {
|
|
7145
|
-
var o, a, u, l = s * 8 - i10 - 1, b = (1 << l) - 1, O = b >> 1, M = i10 === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0,
|
|
7146
|
-
for (t = Math.abs(t), isNaN(t) || t === 1 / 0 ? (a = isNaN(t) ? 1 : 0, o = b) : (o = Math.floor(Math.log(t) / Math.LN2), t * (u = Math.pow(2, -o)) < 1 && (o--, u *= 2), o + O >= 1 ? t += M / u : t += M * Math.pow(2, 1 - O), t * u >= 2 && (o++, u /= 2), o + O >= b ? (a = 0, o = b) : o + O >= 1 ? (a = (t * u - 1) * Math.pow(2, i10), o = o + O) : (a = t * Math.pow(2, O - 1) * Math.pow(2, i10), o = 0)); i10 >= 8; e10[r +
|
|
7145
|
+
var o, a, u, l = s * 8 - i10 - 1, b = (1 << l) - 1, O = b >> 1, M = i10 === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, D = n ? 0 : s - 1, F = n ? 1 : -1, $6 = t < 0 || t === 0 && 1 / t < 0 ? 1 : 0;
|
|
7146
|
+
for (t = Math.abs(t), isNaN(t) || t === 1 / 0 ? (a = isNaN(t) ? 1 : 0, o = b) : (o = Math.floor(Math.log(t) / Math.LN2), t * (u = Math.pow(2, -o)) < 1 && (o--, u *= 2), o + O >= 1 ? t += M / u : t += M * Math.pow(2, 1 - O), t * u >= 2 && (o++, u /= 2), o + O >= b ? (a = 0, o = b) : o + O >= 1 ? (a = (t * u - 1) * Math.pow(2, i10), o = o + O) : (a = t * Math.pow(2, O - 1) * Math.pow(2, i10), o = 0)); i10 >= 8; e10[r + D] = a & 255, D += F, a /= 256, i10 -= 8)
|
|
7147
7147
|
;
|
|
7148
|
-
for (o = o << i10 | a, l += i10; l > 0; e10[r +
|
|
7148
|
+
for (o = o << i10 | a, l += i10; l > 0; e10[r + D] = o & 255, D += F, o /= 256, l -= 8)
|
|
7149
7149
|
;
|
|
7150
|
-
e10[r +
|
|
7150
|
+
e10[r + D - F] |= $6 * 128;
|
|
7151
7151
|
};
|
|
7152
7152
|
/*!
|
|
7153
7153
|
* The buffer module from node.js, for the browser.
|
|
@@ -7260,7 +7260,7 @@ Yh.write = function(e10, t, r, n, i10, s) {
|
|
|
7260
7260
|
const B = N.write(v, c);
|
|
7261
7261
|
return B !== p && (N = N.slice(0, B)), N;
|
|
7262
7262
|
}
|
|
7263
|
-
function
|
|
7263
|
+
function D(v) {
|
|
7264
7264
|
const c = v.length < 0 ? 0 : C(v.length) | 0, p = o(c);
|
|
7265
7265
|
for (let N = 0; N < c; N += 1)
|
|
7266
7266
|
p[N] = v[N] & 255;
|
|
@@ -7271,7 +7271,7 @@ Yh.write = function(e10, t, r, n, i10, s) {
|
|
|
7271
7271
|
const c = new Uint8Array(v);
|
|
7272
7272
|
return $6(c.buffer, c.byteOffset, c.byteLength);
|
|
7273
7273
|
}
|
|
7274
|
-
return
|
|
7274
|
+
return D(v);
|
|
7275
7275
|
}
|
|
7276
7276
|
function $6(v, c, p) {
|
|
7277
7277
|
if (c < 0 || v.byteLength < c)
|
|
@@ -7287,9 +7287,9 @@ Yh.write = function(e10, t, r, n, i10, s) {
|
|
|
7287
7287
|
return p.length === 0 || v.copy(p, 0, 0, c), p;
|
|
7288
7288
|
}
|
|
7289
7289
|
if (v.length !== void 0)
|
|
7290
|
-
return typeof v.length != "number" || Pe(v.length) ? o(0) :
|
|
7290
|
+
return typeof v.length != "number" || Pe(v.length) ? o(0) : D(v);
|
|
7291
7291
|
if (v.type === "Buffer" && Array.isArray(v.data))
|
|
7292
|
-
return
|
|
7292
|
+
return D(v.data);
|
|
7293
7293
|
}
|
|
7294
7294
|
function C(v) {
|
|
7295
7295
|
if (v >= i10)
|
|
@@ -7404,7 +7404,7 @@ Yh.write = function(e10, t, r, n, i10, s) {
|
|
|
7404
7404
|
for (v || (v = "utf8"); ; )
|
|
7405
7405
|
switch (v) {
|
|
7406
7406
|
case "hex":
|
|
7407
|
-
return
|
|
7407
|
+
return T(this, c, p);
|
|
7408
7408
|
case "utf8":
|
|
7409
7409
|
case "utf-8":
|
|
7410
7410
|
return f(this, c, p);
|
|
@@ -7565,7 +7565,7 @@ Yh.write = function(e10, t, r, n, i10, s) {
|
|
|
7565
7565
|
function ve(v, c, p, N) {
|
|
7566
7566
|
return Te(Se(c), v, p, N);
|
|
7567
7567
|
}
|
|
7568
|
-
function
|
|
7568
|
+
function L6(v, c, p, N) {
|
|
7569
7569
|
return Te($e(c), v, p, N);
|
|
7570
7570
|
}
|
|
7571
7571
|
function g(v, c, p, N) {
|
|
@@ -7599,7 +7599,7 @@ Yh.write = function(e10, t, r, n, i10, s) {
|
|
|
7599
7599
|
case "binary":
|
|
7600
7600
|
return ve(this, c, p, N);
|
|
7601
7601
|
case "base64":
|
|
7602
|
-
return
|
|
7602
|
+
return L6(this, c, p, N);
|
|
7603
7603
|
case "ucs2":
|
|
7604
7604
|
case "ucs-2":
|
|
7605
7605
|
case "utf16le":
|
|
@@ -7646,16 +7646,16 @@ Yh.write = function(e10, t, r, n, i10, s) {
|
|
|
7646
7646
|
}
|
|
7647
7647
|
return S(N);
|
|
7648
7648
|
}
|
|
7649
|
-
const
|
|
7649
|
+
const d10 = 4096;
|
|
7650
7650
|
function S(v) {
|
|
7651
7651
|
const c = v.length;
|
|
7652
|
-
if (c <=
|
|
7652
|
+
if (c <= d10)
|
|
7653
7653
|
return String.fromCharCode.apply(String, v);
|
|
7654
7654
|
let p = "", N = 0;
|
|
7655
7655
|
for (; N < c; )
|
|
7656
7656
|
p += String.fromCharCode.apply(
|
|
7657
7657
|
String,
|
|
7658
|
-
v.slice(N, N +=
|
|
7658
|
+
v.slice(N, N += d10)
|
|
7659
7659
|
);
|
|
7660
7660
|
return p;
|
|
7661
7661
|
}
|
|
@@ -7673,7 +7673,7 @@ Yh.write = function(e10, t, r, n, i10, s) {
|
|
|
7673
7673
|
N += String.fromCharCode(v[B]);
|
|
7674
7674
|
return N;
|
|
7675
7675
|
}
|
|
7676
|
-
function
|
|
7676
|
+
function T(v, c, p) {
|
|
7677
7677
|
const N = v.length;
|
|
7678
7678
|
(!c || c < 0) && (c = 0), (!p || p < 0 || p > N) && (p = N);
|
|
7679
7679
|
let B = "";
|
|
@@ -8488,13 +8488,13 @@ let P7 = class extends b2 {
|
|
|
8488
8488
|
for (let O = 0; O < 16; O++, r += 4)
|
|
8489
8489
|
Ys[O] = t.getUint32(r, false);
|
|
8490
8490
|
for (let O = 16; O < 64; O++) {
|
|
8491
|
-
const M = Ys[O - 15],
|
|
8491
|
+
const M = Ys[O - 15], D = Ys[O - 2], F = di(M, 7) ^ di(M, 18) ^ M >>> 3, $6 = di(D, 17) ^ di(D, 19) ^ D >>> 10;
|
|
8492
8492
|
Ys[O] = $6 + Ys[O - 7] + F + Ys[O - 16] | 0;
|
|
8493
8493
|
}
|
|
8494
8494
|
let { A: n, B: i10, C: s, D: o, E: a, F: u, G: l, H: b } = this;
|
|
8495
8495
|
for (let O = 0; O < 64; O++) {
|
|
8496
|
-
const M = di(a, 6) ^ di(a, 11) ^ di(a, 25),
|
|
8497
|
-
b = l, l = u, u = a, a = o +
|
|
8496
|
+
const M = di(a, 6) ^ di(a, 11) ^ di(a, 25), D = b + M + B7(a, u, l) + q7[O] + Ys[O] | 0, $6 = (di(n, 2) ^ di(n, 13) ^ di(n, 22)) + J7(n, i10, s) | 0;
|
|
8497
|
+
b = l, l = u, u = a, a = o + D | 0, o = s, s = i10, i10 = n, n = D + $6 | 0;
|
|
8498
8498
|
}
|
|
8499
8499
|
n = n + this.A | 0, i10 = i10 + this.B | 0, s = s + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, u = u + this.F | 0, l = l + this.G | 0, b = b + this.H | 0, this.set(n, i10, s, o, a, u, l, b);
|
|
8500
8500
|
}
|
|
@@ -8633,28 +8633,28 @@ let Qh = class extends b2 {
|
|
|
8633
8633
|
}
|
|
8634
8634
|
// prettier-ignore
|
|
8635
8635
|
get() {
|
|
8636
|
-
const { Ah: t, Al: r, Bh: n, Bl: i10, Ch: s, Cl: o, Dh: a, Dl: u, Eh: l, El: b, Fh: O, Fl: M, Gh:
|
|
8637
|
-
return [t, r, n, i10, s, o, a, u, l, b, O, M,
|
|
8636
|
+
const { Ah: t, Al: r, Bh: n, Bl: i10, Ch: s, Cl: o, Dh: a, Dl: u, Eh: l, El: b, Fh: O, Fl: M, Gh: D, Gl: F, Hh: $6, Hl: J } = this;
|
|
8637
|
+
return [t, r, n, i10, s, o, a, u, l, b, O, M, D, F, $6, J];
|
|
8638
8638
|
}
|
|
8639
8639
|
// prettier-ignore
|
|
8640
|
-
set(t, r, n, i10, s, o, a, u, l, b, O, M,
|
|
8641
|
-
this.Ah = t | 0, this.Al = r | 0, this.Bh = n | 0, this.Bl = i10 | 0, this.Ch = s | 0, this.Cl = o | 0, this.Dh = a | 0, this.Dl = u | 0, this.Eh = l | 0, this.El = b | 0, this.Fh = O | 0, this.Fl = M | 0, this.Gh =
|
|
8640
|
+
set(t, r, n, i10, s, o, a, u, l, b, O, M, D, F, $6, J) {
|
|
8641
|
+
this.Ah = t | 0, this.Al = r | 0, this.Bh = n | 0, this.Bl = i10 | 0, this.Ch = s | 0, this.Cl = o | 0, this.Dh = a | 0, this.Dl = u | 0, this.Eh = l | 0, this.El = b | 0, this.Fh = O | 0, this.Fl = M | 0, this.Gh = D | 0, this.Gl = F | 0, this.Hh = $6 | 0, this.Hl = J | 0;
|
|
8642
8642
|
}
|
|
8643
8643
|
process(t, r) {
|
|
8644
8644
|
for (let k = 0; k < 16; k++, r += 4)
|
|
8645
8645
|
Qs[k] = t.getUint32(r), js[k] = t.getUint32(r += 4);
|
|
8646
8646
|
for (let k = 16; k < 80; k++) {
|
|
8647
|
-
const K = Qs[k - 15] | 0, X = js[k - 15] | 0, Y = Oe.rotrSH(K, X, 1) ^ Oe.rotrSH(K, X, 8) ^ Oe.shrSH(K, X, 7), ie = Oe.rotrSL(K, X, 1) ^ Oe.rotrSL(K, X, 8) ^ Oe.shrSL(K, X, 7), ne = Qs[k - 2] | 0, se = js[k - 2] | 0, ve = Oe.rotrSH(ne, se, 19) ^ Oe.rotrBH(ne, se, 61) ^ Oe.shrSH(ne, se, 6),
|
|
8647
|
+
const K = Qs[k - 15] | 0, X = js[k - 15] | 0, Y = Oe.rotrSH(K, X, 1) ^ Oe.rotrSH(K, X, 8) ^ Oe.shrSH(K, X, 7), ie = Oe.rotrSL(K, X, 1) ^ Oe.rotrSL(K, X, 8) ^ Oe.shrSL(K, X, 7), ne = Qs[k - 2] | 0, se = js[k - 2] | 0, ve = Oe.rotrSH(ne, se, 19) ^ Oe.rotrBH(ne, se, 61) ^ Oe.shrSH(ne, se, 6), L6 = Oe.rotrSL(ne, se, 19) ^ Oe.rotrBL(ne, se, 61) ^ Oe.shrSL(ne, se, 6), g = Oe.add4L(ie, L6, js[k - 7], js[k - 16]), m = Oe.add4H(g, Y, ve, Qs[k - 7], Qs[k - 16]);
|
|
8648
8648
|
Qs[k] = m | 0, js[k] = g | 0;
|
|
8649
8649
|
}
|
|
8650
|
-
let { Ah: n, Al: i10, Bh: s, Bl: o, Ch: a, Cl: u, Dh: l, Dl: b, Eh: O, El: M, Fh:
|
|
8650
|
+
let { Ah: n, Al: i10, Bh: s, Bl: o, Ch: a, Cl: u, Dh: l, Dl: b, Eh: O, El: M, Fh: D, Fl: F, Gh: $6, Gl: J, Hh: C, Hl: P } = this;
|
|
8651
8651
|
for (let k = 0; k < 80; k++) {
|
|
8652
|
-
const K = Oe.rotrSH(O, M, 14) ^ Oe.rotrSH(O, M, 18) ^ Oe.rotrBH(O, M, 41), X = Oe.rotrSL(O, M, 14) ^ Oe.rotrSL(O, M, 18) ^ Oe.rotrBL(O, M, 41), Y = O &
|
|
8653
|
-
C = $6 | 0, P = J | 0, $6 =
|
|
8654
|
-
const
|
|
8655
|
-
n = Oe.add3H(
|
|
8652
|
+
const K = Oe.rotrSH(O, M, 14) ^ Oe.rotrSH(O, M, 18) ^ Oe.rotrBH(O, M, 41), X = Oe.rotrSL(O, M, 14) ^ Oe.rotrSL(O, M, 18) ^ Oe.rotrBL(O, M, 41), Y = O & D ^ ~O & $6, ie = M & F ^ ~M & J, ne = Oe.add5L(P, X, ie, oR[k], js[k]), se = Oe.add5H(ne, C, K, Y, sR[k], Qs[k]), ve = ne | 0, L6 = Oe.rotrSH(n, i10, 28) ^ Oe.rotrBH(n, i10, 34) ^ Oe.rotrBH(n, i10, 39), g = Oe.rotrSL(n, i10, 28) ^ Oe.rotrBL(n, i10, 34) ^ Oe.rotrBL(n, i10, 39), m = n & s ^ n & a ^ s & a, f = i10 & o ^ i10 & u ^ o & u;
|
|
8653
|
+
C = $6 | 0, P = J | 0, $6 = D | 0, J = F | 0, D = O | 0, F = M | 0, { h: O, l: M } = Oe.add(l | 0, b | 0, se | 0, ve | 0), l = a | 0, b = u | 0, a = s | 0, u = o | 0, s = n | 0, o = i10 | 0;
|
|
8654
|
+
const d10 = Oe.add3L(ve, g, f);
|
|
8655
|
+
n = Oe.add3H(d10, se, L6, m), i10 = d10 | 0;
|
|
8656
8656
|
}
|
|
8657
|
-
({ h: n, l: i10 } = Oe.add(this.Ah | 0, this.Al | 0, n | 0, i10 | 0)), { h: s, l: o } = Oe.add(this.Bh | 0, this.Bl | 0, s | 0, o | 0), { h: a, l: u } = Oe.add(this.Ch | 0, this.Cl | 0, a | 0, u | 0), { h: l, l: b } = Oe.add(this.Dh | 0, this.Dl | 0, l | 0, b | 0), { h: O, l: M } = Oe.add(this.Eh | 0, this.El | 0, O | 0, M | 0), { h:
|
|
8657
|
+
({ h: n, l: i10 } = Oe.add(this.Ah | 0, this.Al | 0, n | 0, i10 | 0)), { h: s, l: o } = Oe.add(this.Bh | 0, this.Bl | 0, s | 0, o | 0), { h: a, l: u } = Oe.add(this.Ch | 0, this.Cl | 0, a | 0, u | 0), { h: l, l: b } = Oe.add(this.Dh | 0, this.Dl | 0, l | 0, b | 0), { h: O, l: M } = Oe.add(this.Eh | 0, this.El | 0, O | 0, M | 0), { h: D, l: F } = Oe.add(this.Fh | 0, this.Fl | 0, D | 0, F | 0), { h: $6, l: J } = Oe.add(this.Gh | 0, this.Gl | 0, $6 | 0, J | 0), { h: C, l: P } = Oe.add(this.Hh | 0, this.Hl | 0, C | 0, P | 0), this.set(n, i10, s, o, a, u, l, b, O, M, D, F, $6, J, C, P);
|
|
8658
8658
|
}
|
|
8659
8659
|
roundClean() {
|
|
8660
8660
|
Qs.fill(0), js.fill(0);
|
|
@@ -8726,8 +8726,8 @@ function SR(e10, t = 24) {
|
|
|
8726
8726
|
r[o] = e10[o] ^ e10[o + 10] ^ e10[o + 20] ^ e10[o + 30] ^ e10[o + 40];
|
|
8727
8727
|
for (let o = 0; o < 10; o += 2) {
|
|
8728
8728
|
const a = (o + 8) % 10, u = (o + 2) % 10, l = r[u], b = r[u + 1], O = yl(l, b, 1) ^ r[a], M = gl(l, b, 1) ^ r[a + 1];
|
|
8729
|
-
for (let
|
|
8730
|
-
e10[o +
|
|
8729
|
+
for (let D = 0; D < 50; D += 10)
|
|
8730
|
+
e10[o + D] ^= O, e10[o + D + 1] ^= M;
|
|
8731
8731
|
}
|
|
8732
8732
|
let i10 = e10[2], s = e10[3];
|
|
8733
8733
|
for (let o = 0; o < 24; o++) {
|
|
@@ -9391,8 +9391,8 @@ var zR = function e(t) {
|
|
|
9391
9391
|
var n = jR(t), i10 = n.length > 0 ? n[0] : "", s = e9("%" + i10 + "%", r), o = s.name, a = s.value, u = false, l = s.alias;
|
|
9392
9392
|
l && (i10 = l[0], XR(n, WR([0, 1], l)));
|
|
9393
9393
|
for (var b = 1, O = true; b < n.length; b += 1) {
|
|
9394
|
-
var M = n[b],
|
|
9395
|
-
if ((
|
|
9394
|
+
var M = n[b], D = nc(M, 0, 1), F = nc(M, -1);
|
|
9395
|
+
if ((D === '"' || D === "'" || D === "`" || F === '"' || F === "'" || F === "`") && D !== F)
|
|
9396
9396
|
throw new Ya("property names with quotes must have matching quotes");
|
|
9397
9397
|
if ((M === "constructor" || !O) && (u = true), i10 += "." + M, o = "%" + i10 + "%", rc(Wo, o))
|
|
9398
9398
|
a = Wo[o];
|
|
@@ -9423,8 +9423,8 @@ var zR = function e(t) {
|
|
|
9423
9423
|
e10.exports = function(O) {
|
|
9424
9424
|
var M = s(t, i10, arguments);
|
|
9425
9425
|
if (o && a) {
|
|
9426
|
-
var
|
|
9427
|
-
|
|
9426
|
+
var D = o(M, "length");
|
|
9427
|
+
D.configurable && a(
|
|
9428
9428
|
M,
|
|
9429
9429
|
"length",
|
|
9430
9430
|
{ value: 1 + u(0, O.length - (arguments.length - 1)) }
|
|
@@ -9632,7 +9632,7 @@ var P9 = function(t) {
|
|
|
9632
9632
|
if (o)
|
|
9633
9633
|
var M = s(BigInt.prototype.valueOf);
|
|
9634
9634
|
if (a)
|
|
9635
|
-
var
|
|
9635
|
+
var D = s(Symbol.prototype.valueOf);
|
|
9636
9636
|
function F(te, $e) {
|
|
9637
9637
|
if (typeof te != "object")
|
|
9638
9638
|
return false;
|
|
@@ -9691,10 +9691,10 @@ var P9 = function(t) {
|
|
|
9691
9691
|
return n(te) === "BigInt64Array";
|
|
9692
9692
|
}
|
|
9693
9693
|
e10.isBigInt64Array = ve;
|
|
9694
|
-
function
|
|
9694
|
+
function L6(te) {
|
|
9695
9695
|
return n(te) === "BigUint64Array";
|
|
9696
9696
|
}
|
|
9697
|
-
e10.isBigUint64Array =
|
|
9697
|
+
e10.isBigUint64Array = L6;
|
|
9698
9698
|
function g(te) {
|
|
9699
9699
|
return u(te) === "[object Map]";
|
|
9700
9700
|
}
|
|
@@ -9707,10 +9707,10 @@ var P9 = function(t) {
|
|
|
9707
9707
|
return u(te) === "[object Set]";
|
|
9708
9708
|
}
|
|
9709
9709
|
f.working = typeof Set < "u" && f(/* @__PURE__ */ new Set());
|
|
9710
|
-
function
|
|
9710
|
+
function d10(te) {
|
|
9711
9711
|
return typeof Set > "u" ? false : f.working ? f(te) : te instanceof Set;
|
|
9712
9712
|
}
|
|
9713
|
-
e10.isSet =
|
|
9713
|
+
e10.isSet = d10;
|
|
9714
9714
|
function S(te) {
|
|
9715
9715
|
return u(te) === "[object WeakMap]";
|
|
9716
9716
|
}
|
|
@@ -9723,10 +9723,10 @@ var P9 = function(t) {
|
|
|
9723
9723
|
return u(te) === "[object WeakSet]";
|
|
9724
9724
|
}
|
|
9725
9725
|
x.working = typeof WeakSet < "u" && x(/* @__PURE__ */ new WeakSet());
|
|
9726
|
-
function
|
|
9726
|
+
function T(te) {
|
|
9727
9727
|
return x(te);
|
|
9728
9728
|
}
|
|
9729
|
-
e10.isWeakSet =
|
|
9729
|
+
e10.isWeakSet = T;
|
|
9730
9730
|
function y(te) {
|
|
9731
9731
|
return u(te) === "[object ArrayBuffer]";
|
|
9732
9732
|
}
|
|
@@ -9788,7 +9788,7 @@ var P9 = function(t) {
|
|
|
9788
9788
|
}
|
|
9789
9789
|
e10.isBigIntObject = he;
|
|
9790
9790
|
function pe(te) {
|
|
9791
|
-
return a && F(te,
|
|
9791
|
+
return a && F(te, D);
|
|
9792
9792
|
}
|
|
9793
9793
|
e10.isSymbolObject = pe;
|
|
9794
9794
|
function be(te) {
|
|
@@ -9936,7 +9936,7 @@ var L9 = function(t) {
|
|
|
9936
9936
|
if (U)
|
|
9937
9937
|
return U;
|
|
9938
9938
|
var G = Object.keys(R10), Z = l(G);
|
|
9939
|
-
if (h.showHidden && (G = Object.getOwnPropertyNames(R10)),
|
|
9939
|
+
if (h.showHidden && (G = Object.getOwnPropertyNames(R10)), L6(R10) && (G.indexOf("message") >= 0 || G.indexOf("description") >= 0))
|
|
9940
9940
|
return M(R10);
|
|
9941
9941
|
if (G.length === 0) {
|
|
9942
9942
|
if (g(R10)) {
|
|
@@ -9947,7 +9947,7 @@ var L9 = function(t) {
|
|
|
9947
9947
|
return h.stylize(RegExp.prototype.toString.call(R10), "regexp");
|
|
9948
9948
|
if (ve(R10))
|
|
9949
9949
|
return h.stylize(Date.prototype.toString.call(R10), "date");
|
|
9950
|
-
if (
|
|
9950
|
+
if (L6(R10))
|
|
9951
9951
|
return M(R10);
|
|
9952
9952
|
}
|
|
9953
9953
|
var ae = "", I6 = false, q = ["{", "}"];
|
|
@@ -9955,13 +9955,13 @@ var L9 = function(t) {
|
|
|
9955
9955
|
var re = R10.name ? ": " + R10.name : "";
|
|
9956
9956
|
ae = " [Function" + re + "]";
|
|
9957
9957
|
}
|
|
9958
|
-
if (ne(R10) && (ae = " " + RegExp.prototype.toString.call(R10)), ve(R10) && (ae = " " + Date.prototype.toUTCString.call(R10)),
|
|
9958
|
+
if (ne(R10) && (ae = " " + RegExp.prototype.toString.call(R10)), ve(R10) && (ae = " " + Date.prototype.toUTCString.call(R10)), L6(R10) && (ae = " " + M(R10)), G.length === 0 && (!I6 || R10.length == 0))
|
|
9959
9959
|
return q[0] + ae + q[1];
|
|
9960
9960
|
if (W < 0)
|
|
9961
9961
|
return ne(R10) ? h.stylize(RegExp.prototype.toString.call(R10), "regexp") : h.stylize("[Object]", "special");
|
|
9962
9962
|
h.seen.push(R10);
|
|
9963
9963
|
var oe;
|
|
9964
|
-
return I6 ? oe =
|
|
9964
|
+
return I6 ? oe = D(h, R10, W, Z, G) : oe = G.map(function(he) {
|
|
9965
9965
|
return F(h, R10, W, Z, he, I6);
|
|
9966
9966
|
}), h.seen.pop(), $6(oe, ae, q);
|
|
9967
9967
|
}
|
|
@@ -9982,7 +9982,7 @@ var L9 = function(t) {
|
|
|
9982
9982
|
function M(h) {
|
|
9983
9983
|
return "[" + Error.prototype.toString.call(h) + "]";
|
|
9984
9984
|
}
|
|
9985
|
-
function
|
|
9985
|
+
function D(h, R10, W, Q, U) {
|
|
9986
9986
|
for (var G = [], Z = 0, ee = R10.length; Z < ee; ++Z)
|
|
9987
9987
|
x(R10, String(Z)) ? G.push(F(
|
|
9988
9988
|
h,
|
|
@@ -10076,10 +10076,10 @@ var L9 = function(t) {
|
|
|
10076
10076
|
return se(h) && f(h) === "[object Date]";
|
|
10077
10077
|
}
|
|
10078
10078
|
e10.isDate = ve, e10.types.isDate = ve;
|
|
10079
|
-
function
|
|
10079
|
+
function L6(h) {
|
|
10080
10080
|
return se(h) && (f(h) === "[object Error]" || h instanceof Error);
|
|
10081
10081
|
}
|
|
10082
|
-
e10.isError =
|
|
10082
|
+
e10.isError = L6, e10.types.isNativeError = L6;
|
|
10083
10083
|
function g(h) {
|
|
10084
10084
|
return typeof h == "function";
|
|
10085
10085
|
}
|
|
@@ -10092,7 +10092,7 @@ var L9 = function(t) {
|
|
|
10092
10092
|
function f(h) {
|
|
10093
10093
|
return Object.prototype.toString.call(h);
|
|
10094
10094
|
}
|
|
10095
|
-
function
|
|
10095
|
+
function d10(h) {
|
|
10096
10096
|
return h < 10 ? "0" + h.toString(10) : h.toString(10);
|
|
10097
10097
|
}
|
|
10098
10098
|
var S = [
|
|
@@ -10111,9 +10111,9 @@ var L9 = function(t) {
|
|
|
10111
10111
|
];
|
|
10112
10112
|
function _() {
|
|
10113
10113
|
var h = /* @__PURE__ */ new Date(), R10 = [
|
|
10114
|
-
|
|
10115
|
-
|
|
10116
|
-
|
|
10114
|
+
d10(h.getHours()),
|
|
10115
|
+
d10(h.getMinutes()),
|
|
10116
|
+
d10(h.getSeconds())
|
|
10117
10117
|
].join(":");
|
|
10118
10118
|
return [h.getDate(), S[h.getMonth()], R10].join(" ");
|
|
10119
10119
|
}
|
|
@@ -10129,15 +10129,15 @@ var L9 = function(t) {
|
|
|
10129
10129
|
function x(h, R10) {
|
|
10130
10130
|
return Object.prototype.hasOwnProperty.call(h, R10);
|
|
10131
10131
|
}
|
|
10132
|
-
var
|
|
10132
|
+
var T = typeof Symbol < "u" ? Symbol("util.promisify.custom") : void 0;
|
|
10133
10133
|
e10.promisify = function(R10) {
|
|
10134
10134
|
if (typeof R10 != "function")
|
|
10135
10135
|
throw new TypeError('The "original" argument must be of type Function');
|
|
10136
|
-
if (
|
|
10137
|
-
var W = R10[
|
|
10136
|
+
if (T && R10[T]) {
|
|
10137
|
+
var W = R10[T];
|
|
10138
10138
|
if (typeof W != "function")
|
|
10139
10139
|
throw new TypeError('The "util.promisify.custom" argument must be of type Function');
|
|
10140
|
-
return Object.defineProperty(W,
|
|
10140
|
+
return Object.defineProperty(W, T, {
|
|
10141
10141
|
value: W,
|
|
10142
10142
|
enumerable: false,
|
|
10143
10143
|
writable: false,
|
|
@@ -10159,7 +10159,7 @@ var L9 = function(t) {
|
|
|
10159
10159
|
}
|
|
10160
10160
|
return G;
|
|
10161
10161
|
}
|
|
10162
|
-
return Object.setPrototypeOf(W, Object.getPrototypeOf(R10)),
|
|
10162
|
+
return Object.setPrototypeOf(W, Object.getPrototypeOf(R10)), T && Object.defineProperty(W, T, {
|
|
10163
10163
|
value: W,
|
|
10164
10164
|
enumerable: false,
|
|
10165
10165
|
writable: false,
|
|
@@ -10168,7 +10168,7 @@ var L9 = function(t) {
|
|
|
10168
10168
|
W,
|
|
10169
10169
|
t(R10)
|
|
10170
10170
|
);
|
|
10171
|
-
}, e10.promisify.custom =
|
|
10171
|
+
}, e10.promisify.custom = T;
|
|
10172
10172
|
function y(h, R10) {
|
|
10173
10173
|
if (!h) {
|
|
10174
10174
|
var W = new Error("Promise was rejected with a falsy value");
|
|
@@ -10263,7 +10263,7 @@ function U9() {
|
|
|
10263
10263
|
return ($6 === "string" ? String : Number)(F);
|
|
10264
10264
|
}
|
|
10265
10265
|
var u = si, l = u.Buffer, b = e0, O = b.inspect, M = O && O.custom || "inspect";
|
|
10266
|
-
function
|
|
10266
|
+
function D(F, $6, J) {
|
|
10267
10267
|
l.prototype.copy.call(F, $6, J);
|
|
10268
10268
|
}
|
|
10269
10269
|
return Pd = /* @__PURE__ */ function() {
|
|
@@ -10316,7 +10316,7 @@ function U9() {
|
|
|
10316
10316
|
if (this.length === 0)
|
|
10317
10317
|
return l.alloc(0);
|
|
10318
10318
|
for (var C = l.allocUnsafe(J >>> 0), P = this.head, k = 0; P; )
|
|
10319
|
-
|
|
10319
|
+
D(P.data, C, k), k += P.data.length, P = P.next;
|
|
10320
10320
|
return C;
|
|
10321
10321
|
}
|
|
10322
10322
|
// Consumes a specified amount of bytes or characters from the buffered data.
|
|
@@ -10535,7 +10535,7 @@ function nS() {
|
|
|
10535
10535
|
function a(U) {
|
|
10536
10536
|
return i10.isBuffer(U) || U instanceof s;
|
|
10537
10537
|
}
|
|
10538
|
-
var u = eS, l = rS, b = l.getHighWaterMark, O = ra.codes, M = O.ERR_INVALID_ARG_TYPE,
|
|
10538
|
+
var u = eS, l = rS, b = l.getHighWaterMark, O = ra.codes, M = O.ERR_INVALID_ARG_TYPE, D = O.ERR_METHOD_NOT_IMPLEMENTED, F = O.ERR_MULTIPLE_CALLBACK, $6 = O.ERR_STREAM_CANNOT_PIPE, J = O.ERR_STREAM_DESTROYED, C = O.ERR_STREAM_NULL_VALUES, P = O.ERR_STREAM_WRITE_AFTER_END, k = O.ERR_UNKNOWN_ENCODING, K = u.errorOrDestroy;
|
|
10539
10539
|
Ie(ne, n);
|
|
10540
10540
|
function X() {
|
|
10541
10541
|
}
|
|
@@ -10593,7 +10593,7 @@ function nS() {
|
|
|
10593
10593
|
this._writableState.corked++;
|
|
10594
10594
|
}, ne.prototype.uncork = function() {
|
|
10595
10595
|
var U = this._writableState;
|
|
10596
|
-
U.corked && (U.corked--, !U.writing && !U.corked && !U.bufferProcessing && U.bufferedRequest &&
|
|
10596
|
+
U.corked && (U.corked--, !U.writing && !U.corked && !U.bufferProcessing && U.bufferedRequest && T(this, U));
|
|
10597
10597
|
}, ne.prototype.setDefaultEncoding = function(G) {
|
|
10598
10598
|
if (typeof G == "string" && (G = G.toLowerCase()), !(["hex", "utf8", "utf-8", "ascii", "binary", "base64", "ucs2", "ucs-2", "utf16le", "utf-16le", "raw"].indexOf((G + "").toLowerCase()) > -1))
|
|
10599
10599
|
throw new k(G);
|
|
@@ -10607,7 +10607,7 @@ function nS() {
|
|
|
10607
10607
|
return this._writableState && this._writableState.getBuffer();
|
|
10608
10608
|
}
|
|
10609
10609
|
});
|
|
10610
|
-
function
|
|
10610
|
+
function L6(U, G, Z) {
|
|
10611
10611
|
return !U.objectMode && U.decodeStrings !== false && typeof G == "string" && (G = i10.from(G, Z)), G;
|
|
10612
10612
|
}
|
|
10613
10613
|
Object.defineProperty(ne.prototype, "writableHighWaterMark", {
|
|
@@ -10621,7 +10621,7 @@ function nS() {
|
|
|
10621
10621
|
});
|
|
10622
10622
|
function g(U, G, Z, ee, ae, I6) {
|
|
10623
10623
|
if (!Z) {
|
|
10624
|
-
var q =
|
|
10624
|
+
var q = L6(G, ee, ae);
|
|
10625
10625
|
ee !== q && (Z = true, ae = "buffer", ee = q);
|
|
10626
10626
|
}
|
|
10627
10627
|
var re = G.objectMode ? 1 : ee.length;
|
|
@@ -10646,18 +10646,18 @@ function nS() {
|
|
|
10646
10646
|
function f(U, G, Z, ee, ae) {
|
|
10647
10647
|
--G.pendingcb, Z ? (de.process.nextTick(ae, ee), de.process.nextTick(R10, U, G), U._writableState.errorEmitted = true, K(U, ee)) : (ae(ee), U._writableState.errorEmitted = true, K(U, ee), R10(U, G));
|
|
10648
10648
|
}
|
|
10649
|
-
function
|
|
10649
|
+
function d10(U) {
|
|
10650
10650
|
U.writing = false, U.writecb = null, U.length -= U.writelen, U.writelen = 0;
|
|
10651
10651
|
}
|
|
10652
10652
|
function S(U, G) {
|
|
10653
10653
|
var Z = U._writableState, ee = Z.sync, ae = Z.writecb;
|
|
10654
10654
|
if (typeof ae != "function")
|
|
10655
10655
|
throw new F();
|
|
10656
|
-
if (
|
|
10656
|
+
if (d10(Z), G)
|
|
10657
10657
|
f(U, Z, ee, G, ae);
|
|
10658
10658
|
else {
|
|
10659
10659
|
var I6 = y(Z) || U.destroyed;
|
|
10660
|
-
!I6 && !Z.corked && !Z.bufferProcessing && Z.bufferedRequest &&
|
|
10660
|
+
!I6 && !Z.corked && !Z.bufferProcessing && Z.bufferedRequest && T(U, Z), ee ? de.process.nextTick(_, U, Z, I6, ae) : _(U, Z, I6, ae);
|
|
10661
10661
|
}
|
|
10662
10662
|
}
|
|
10663
10663
|
function _(U, G, Z, ee) {
|
|
@@ -10666,7 +10666,7 @@ function nS() {
|
|
|
10666
10666
|
function x(U, G) {
|
|
10667
10667
|
G.length === 0 && G.needDrain && (G.needDrain = false, U.emit("drain"));
|
|
10668
10668
|
}
|
|
10669
|
-
function
|
|
10669
|
+
function T(U, G) {
|
|
10670
10670
|
G.bufferProcessing = true;
|
|
10671
10671
|
var Z = G.bufferedRequest;
|
|
10672
10672
|
if (U._writev && Z && Z.next) {
|
|
@@ -10686,7 +10686,7 @@ function nS() {
|
|
|
10686
10686
|
G.bufferedRequest = Z, G.bufferProcessing = false;
|
|
10687
10687
|
}
|
|
10688
10688
|
ne.prototype._write = function(U, G, Z) {
|
|
10689
|
-
Z(new
|
|
10689
|
+
Z(new D("_write()"));
|
|
10690
10690
|
}, ne.prototype._writev = null, ne.prototype.end = function(U, G, Z) {
|
|
10691
10691
|
var ee = this._writableState;
|
|
10692
10692
|
return typeof U == "function" ? (Z = U, U = null, G = null) : typeof G == "function" && (Z = G, G = null), U != null && this.write(U, G), ee.corked && (ee.corked = 1, this.uncork()), ee.ending || W(this, ee, Z), this;
|
|
@@ -11048,7 +11048,7 @@ function yx() {
|
|
|
11048
11048
|
done: K
|
|
11049
11049
|
};
|
|
11050
11050
|
}
|
|
11051
|
-
function
|
|
11051
|
+
function D(k) {
|
|
11052
11052
|
var K = k[s];
|
|
11053
11053
|
if (K !== null) {
|
|
11054
11054
|
var X = k[O].read();
|
|
@@ -11056,7 +11056,7 @@ function yx() {
|
|
|
11056
11056
|
}
|
|
11057
11057
|
}
|
|
11058
11058
|
function F(k) {
|
|
11059
|
-
de.process.nextTick(
|
|
11059
|
+
de.process.nextTick(D, k);
|
|
11060
11060
|
}
|
|
11061
11061
|
function $6(k, K) {
|
|
11062
11062
|
return function(X, Y) {
|
|
@@ -11171,7 +11171,7 @@ function sS() {
|
|
|
11171
11171
|
var a = e0, u;
|
|
11172
11172
|
a && a.debuglog ? u = a.debuglog("stream") : u = function() {
|
|
11173
11173
|
};
|
|
11174
|
-
var l = U9(), b = eS, O = rS, M = O.getHighWaterMark,
|
|
11174
|
+
var l = U9(), b = eS, O = rS, M = O.getHighWaterMark, D = ra.codes, F = D.ERR_INVALID_ARG_TYPE, $6 = D.ERR_STREAM_PUSH_AFTER_EOF, J = D.ERR_METHOD_NOT_IMPLEMENTED, C = D.ERR_STREAM_UNSHIFT_AFTER_END_EVENT, P, k, K;
|
|
11175
11175
|
Ie(se, r);
|
|
11176
11176
|
var X = b.errorOrDestroy, Y = ["error", "close", "destroy", "pause", "resume"];
|
|
11177
11177
|
function ie(I6, q, re) {
|
|
@@ -11218,21 +11218,21 @@ function sS() {
|
|
|
11218
11218
|
X(I6, be);
|
|
11219
11219
|
else if (pe.objectMode || q && q.length > 0)
|
|
11220
11220
|
if (typeof q != "string" && !pe.objectMode && Object.getPrototypeOf(q) !== n.prototype && (q = s(q)), oe)
|
|
11221
|
-
pe.endEmitted ? X(I6, new C()) :
|
|
11221
|
+
pe.endEmitted ? X(I6, new C()) : L6(I6, pe, q, true);
|
|
11222
11222
|
else if (pe.ended)
|
|
11223
11223
|
X(I6, new $6());
|
|
11224
11224
|
else {
|
|
11225
11225
|
if (pe.destroyed)
|
|
11226
11226
|
return false;
|
|
11227
|
-
pe.reading = false, pe.decoder && !re ? (q = pe.decoder.write(q), pe.objectMode || q.length !== 0 ?
|
|
11227
|
+
pe.reading = false, pe.decoder && !re ? (q = pe.decoder.write(q), pe.objectMode || q.length !== 0 ? L6(I6, pe, q, false) : T(I6, pe)) : L6(I6, pe, q, false);
|
|
11228
11228
|
}
|
|
11229
11229
|
else
|
|
11230
|
-
oe || (pe.reading = false,
|
|
11230
|
+
oe || (pe.reading = false, T(I6, pe));
|
|
11231
11231
|
}
|
|
11232
11232
|
return !pe.ended && (pe.length < pe.highWaterMark || pe.length === 0);
|
|
11233
11233
|
}
|
|
11234
|
-
function
|
|
11235
|
-
q.flowing && q.length === 0 && !q.sync ? (q.awaitDrain = 0, I6.emit("data", re)) : (q.length += q.objectMode ? 1 : re.length, oe ? q.buffer.unshift(re) : q.buffer.push(re), q.needReadable && _(I6)),
|
|
11234
|
+
function L6(I6, q, re, oe) {
|
|
11235
|
+
q.flowing && q.length === 0 && !q.sync ? (q.awaitDrain = 0, I6.emit("data", re)) : (q.length += q.objectMode ? 1 : re.length, oe ? q.buffer.unshift(re) : q.buffer.push(re), q.needReadable && _(I6)), T(I6, q);
|
|
11236
11236
|
}
|
|
11237
11237
|
function g(I6, q) {
|
|
11238
11238
|
var re;
|
|
@@ -11252,7 +11252,7 @@ function sS() {
|
|
|
11252
11252
|
function f(I6) {
|
|
11253
11253
|
return I6 >= m ? I6 = m : (I6--, I6 |= I6 >>> 1, I6 |= I6 >>> 2, I6 |= I6 >>> 4, I6 |= I6 >>> 8, I6 |= I6 >>> 16, I6++), I6;
|
|
11254
11254
|
}
|
|
11255
|
-
function
|
|
11255
|
+
function d10(I6, q) {
|
|
11256
11256
|
return I6 <= 0 || q.length === 0 && q.ended ? 0 : q.objectMode ? 1 : I6 !== I6 ? q.flowing && q.length ? q.buffer.head.data.length : q.length : (I6 > q.highWaterMark && (q.highWaterMark = f(I6)), I6 <= q.length ? I6 : q.ended ? q.length : (q.needReadable = true, 0));
|
|
11257
11257
|
}
|
|
11258
11258
|
se.prototype.read = function(I6) {
|
|
@@ -11260,10 +11260,10 @@ function sS() {
|
|
|
11260
11260
|
var q = this._readableState, re = I6;
|
|
11261
11261
|
if (I6 !== 0 && (q.emittedReadable = false), I6 === 0 && q.needReadable && ((q.highWaterMark !== 0 ? q.length >= q.highWaterMark : q.length > 0) || q.ended))
|
|
11262
11262
|
return u("read: emitReadable", q.length, q.ended), q.length === 0 && q.ended ? Z(this) : _(this), null;
|
|
11263
|
-
if (I6 =
|
|
11263
|
+
if (I6 = d10(I6, q), I6 === 0 && q.ended)
|
|
11264
11264
|
return q.length === 0 && Z(this), null;
|
|
11265
11265
|
var oe = q.needReadable;
|
|
11266
|
-
u("need readable", oe), (q.length === 0 || q.length - I6 < q.highWaterMark) && (oe = true, u("length less than watermark", oe)), q.ended || q.reading ? (oe = false, u("reading or ended", oe)) : oe && (u("do read"), q.reading = true, q.sync = true, q.length === 0 && (q.needReadable = true), this._read(q.highWaterMark), q.sync = false, q.reading || (I6 =
|
|
11266
|
+
u("need readable", oe), (q.length === 0 || q.length - I6 < q.highWaterMark) && (oe = true, u("length less than watermark", oe)), q.ended || q.reading ? (oe = false, u("reading or ended", oe)) : oe && (u("do read"), q.reading = true, q.sync = true, q.length === 0 && (q.needReadable = true), this._read(q.highWaterMark), q.sync = false, q.reading || (I6 = d10(re, q)));
|
|
11267
11267
|
var he;
|
|
11268
11268
|
return I6 > 0 ? he = G(I6, q) : he = null, he === null ? (q.needReadable = q.length <= q.highWaterMark, I6 = 0) : (q.length -= I6, q.awaitDrain = 0), q.length === 0 && (q.ended || (q.needReadable = true), re !== I6 && q.ended && Z(this)), he !== null && this.emit("data", he), he;
|
|
11269
11269
|
};
|
|
@@ -11284,7 +11284,7 @@ function sS() {
|
|
|
11284
11284
|
var q = I6._readableState;
|
|
11285
11285
|
u("emitReadable_", q.destroyed, q.length, q.ended), !q.destroyed && (q.length || q.ended) && (I6.emit("readable"), q.emittedReadable = false), q.needReadable = !q.flowing && !q.ended && q.length <= q.highWaterMark, U(I6);
|
|
11286
11286
|
}
|
|
11287
|
-
function
|
|
11287
|
+
function T(I6, q) {
|
|
11288
11288
|
q.readingMore || (q.readingMore = true, de.process.nextTick(y, I6, q));
|
|
11289
11289
|
}
|
|
11290
11290
|
function y(I6, q) {
|
|
@@ -12057,8 +12057,8 @@ Lc.prototype._update = function() {
|
|
|
12057
12057
|
for (var e10 = Lx, t = 0; t < 16; ++t)
|
|
12058
12058
|
e10[t] = this._block.readInt32LE(t * 4);
|
|
12059
12059
|
for (var r = this._a | 0, n = this._b | 0, i10 = this._c | 0, s = this._d | 0, o = this._e | 0, a = this._a | 0, u = this._b | 0, l = this._c | 0, b = this._d | 0, O = this._e | 0, M = 0; M < 80; M += 1) {
|
|
12060
|
-
var
|
|
12061
|
-
M < 16 ? (
|
|
12060
|
+
var D, F;
|
|
12061
|
+
M < 16 ? (D = kl(r, n, i10, s, o, e10[xf[M]], Ef[0], Mf[M]), F = Hl(a, u, l, b, O, e10[Nf[M]], Ff[0], Df[M])) : M < 32 ? (D = Ll(r, n, i10, s, o, e10[xf[M]], Ef[1], Mf[M]), F = $l(a, u, l, b, O, e10[Nf[M]], Ff[1], Df[M])) : M < 48 ? (D = Ul(r, n, i10, s, o, e10[xf[M]], Ef[2], Mf[M]), F = Ul(a, u, l, b, O, e10[Nf[M]], Ff[2], Df[M])) : M < 64 ? (D = $l(r, n, i10, s, o, e10[xf[M]], Ef[3], Mf[M]), F = Ll(a, u, l, b, O, e10[Nf[M]], Ff[3], Df[M])) : (D = Hl(r, n, i10, s, o, e10[xf[M]], Ef[4], Mf[M]), F = kl(a, u, l, b, O, e10[Nf[M]], Ff[4], Df[M])), r = o, o = s, s = Yo(i10, 10), i10 = n, n = D, a = O, O = b, b = Yo(l, 10), l = u, u = F;
|
|
12062
12062
|
}
|
|
12063
12063
|
var $6 = this._b + i10 + b | 0;
|
|
12064
12064
|
this._b = this._c + s + O | 0, this._c = this._d + o + a | 0, this._d = this._e + r + u | 0, this._e = this._a + n + l | 0, this._a = $6;
|
|
@@ -12290,8 +12290,8 @@ au.prototype._update = function(e10) {
|
|
|
12290
12290
|
for (; b < 64; ++b)
|
|
12291
12291
|
t[b] = lN(t[b - 2]) + t[b - 7] + hN(t[b - 15]) + t[b - 16] | 0;
|
|
12292
12292
|
for (var O = 0; O < 64; ++O) {
|
|
12293
|
-
var M = l + dN(o) + fN(o, a, u) + oN[O] + t[O] | 0,
|
|
12294
|
-
l = u, u = a, a = o, o = s + M | 0, s = i10, i10 = n, n = r, r = M +
|
|
12293
|
+
var M = l + dN(o) + fN(o, a, u) + oN[O] + t[O] | 0, D = cN(r) + uN(r, n, i10) | 0;
|
|
12294
|
+
l = u, u = a, a = o, o = s + M | 0, s = i10, i10 = n, n = r, r = M + D | 0;
|
|
12295
12295
|
}
|
|
12296
12296
|
this._a = r + this._a | 0, this._b = n + this._b | 0, this._c = i10 + this._c | 0, this._d = s + this._d | 0, this._e = o + this._e | 0, this._f = a + this._f | 0, this._g = u + this._g | 0, this._h = l + this._h | 0;
|
|
12297
12297
|
};
|
|
@@ -12508,22 +12508,22 @@ function Bt(e10, t) {
|
|
|
12508
12508
|
return e10 >>> 0 < t >>> 0 ? 1 : 0;
|
|
12509
12509
|
}
|
|
12510
12510
|
fu.prototype._update = function(e10) {
|
|
12511
|
-
for (var t = this._w, r = this._ah | 0, n = this._bh | 0, i10 = this._ch | 0, s = this._dh | 0, o = this._eh | 0, a = this._fh | 0, u = this._gh | 0, l = this._hh | 0, b = this._al | 0, O = this._bl | 0, M = this._cl | 0,
|
|
12511
|
+
for (var t = this._w, r = this._ah | 0, n = this._bh | 0, i10 = this._ch | 0, s = this._dh | 0, o = this._eh | 0, a = this._fh | 0, u = this._gh | 0, l = this._hh | 0, b = this._al | 0, O = this._bl | 0, M = this._cl | 0, D = this._dl | 0, F = this._el | 0, $6 = this._fl | 0, J = this._gl | 0, C = this._hl | 0, P = 0; P < 32; P += 2)
|
|
12512
12512
|
t[P] = e10.readInt32BE(P * 4), t[P + 1] = e10.readInt32BE(P * 4 + 4);
|
|
12513
12513
|
for (; P < 160; P += 2) {
|
|
12514
12514
|
var k = t[P - 30], K = t[P - 15 * 2 + 1], X = _N(k, K), Y = ON(K, k);
|
|
12515
12515
|
k = t[P - 2 * 2], K = t[P - 2 * 2 + 1];
|
|
12516
|
-
var ie = AN(k, K), ne = RN(K, k), se = t[P - 7 * 2], ve = t[P - 7 * 2 + 1],
|
|
12517
|
-
m = m + ne | 0, f = f + ie + Bt(m, ne) | 0, m = m + g | 0, f = f +
|
|
12516
|
+
var ie = AN(k, K), ne = RN(K, k), se = t[P - 7 * 2], ve = t[P - 7 * 2 + 1], L6 = t[P - 16 * 2], g = t[P - 16 * 2 + 1], m = Y + ve | 0, f = X + se + Bt(m, Y) | 0;
|
|
12517
|
+
m = m + ne | 0, f = f + ie + Bt(m, ne) | 0, m = m + g | 0, f = f + L6 + Bt(m, g) | 0, t[P] = f, t[P + 1] = m;
|
|
12518
12518
|
}
|
|
12519
|
-
for (var
|
|
12520
|
-
f = t[
|
|
12521
|
-
var S = Kl(r, n, i10), _ = Kl(b, O, M), x = zl(r, b),
|
|
12519
|
+
for (var d10 = 0; d10 < 160; d10 += 2) {
|
|
12520
|
+
f = t[d10], m = t[d10 + 1];
|
|
12521
|
+
var S = Kl(r, n, i10), _ = Kl(b, O, M), x = zl(r, b), T = zl(b, r), y = Wl(o, F), w = Wl(F, o), h = Gl[d10], R10 = Gl[d10 + 1], W = Vl(o, a, u), Q = Vl(F, $6, J), U = C + w | 0, G = l + y + Bt(U, C) | 0;
|
|
12522
12522
|
U = U + Q | 0, G = G + W + Bt(U, Q) | 0, U = U + R10 | 0, G = G + h + Bt(U, R10) | 0, U = U + m | 0, G = G + f + Bt(U, m) | 0;
|
|
12523
|
-
var Z =
|
|
12524
|
-
l = u, C = J, u = a, J = $6, a = o, $6 = F, F =
|
|
12523
|
+
var Z = T + _ | 0, ee = x + S + Bt(Z, T) | 0;
|
|
12524
|
+
l = u, C = J, u = a, J = $6, a = o, $6 = F, F = D + U | 0, o = s + G + Bt(F, D) | 0, s = i10, D = M, i10 = n, M = O, n = r, O = b, b = U + Z | 0, r = G + ee + Bt(b, U) | 0;
|
|
12525
12525
|
}
|
|
12526
|
-
this._al = this._al + b | 0, this._bl = this._bl + O | 0, this._cl = this._cl + M | 0, this._dl = this._dl +
|
|
12526
|
+
this._al = this._al + b | 0, this._bl = this._bl + O | 0, this._cl = this._cl + M | 0, this._dl = this._dl + D | 0, this._el = this._el + F | 0, this._fl = this._fl + $6 | 0, this._gl = this._gl + J | 0, this._hl = this._hl + C | 0, this._ah = this._ah + r + Bt(this._al, b) | 0, this._bh = this._bh + n + Bt(this._bl, O) | 0, this._ch = this._ch + i10 + Bt(this._cl, M) | 0, this._dh = this._dh + s + Bt(this._dl, D) | 0, this._eh = this._eh + o + Bt(this._el, F) | 0, this._fh = this._fh + a + Bt(this._fl, $6) | 0, this._gh = this._gh + u + Bt(this._gl, J) | 0, this._hh = this._hh + l + Bt(this._hl, C) | 0;
|
|
12527
12527
|
};
|
|
12528
12528
|
fu.prototype._hash = function() {
|
|
12529
12529
|
var e10 = wN.allocUnsafe(64);
|
|
@@ -12879,10 +12879,10 @@ function lM(e10, t, r, n, i10) {
|
|
|
12879
12879
|
t.copy(a, 0, 0, t.length);
|
|
12880
12880
|
for (var u = 0, l = Lu[i10], b = Math.ceil(n / l), O = 1; O <= b; O++) {
|
|
12881
12881
|
a.writeUInt32BE(O, t.length);
|
|
12882
|
-
for (var M = s.run(a, s.ipad1),
|
|
12883
|
-
|
|
12882
|
+
for (var M = s.run(a, s.ipad1), D = M, F = 1; F < r; F++) {
|
|
12883
|
+
D = s.run(D, s.ipad2);
|
|
12884
12884
|
for (var $6 = 0; $6 < l; $6++)
|
|
12885
|
-
M[$6] ^=
|
|
12885
|
+
M[$6] ^= D[$6];
|
|
12886
12886
|
}
|
|
12887
12887
|
M.copy(o, u), u += l;
|
|
12888
12888
|
}
|
|
@@ -13794,8 +13794,8 @@ Rs.prototype._encrypt = function(t, r, n, i10, s) {
|
|
|
13794
13794
|
for (var o = r, a = n, u = 0; u < t.keys.length; u += 2) {
|
|
13795
13795
|
var l = t.keys[u], b = t.keys[u + 1];
|
|
13796
13796
|
Mt.expand(a, t.tmp, 0), l ^= t.tmp[0], b ^= t.tmp[1];
|
|
13797
|
-
var O = Mt.substitute(l, b), M = Mt.permute(O),
|
|
13798
|
-
a = (o ^ M) >>> 0, o =
|
|
13797
|
+
var O = Mt.substitute(l, b), M = Mt.permute(O), D = a;
|
|
13798
|
+
a = (o ^ M) >>> 0, o = D;
|
|
13799
13799
|
}
|
|
13800
13800
|
Mt.rip(a, o, i10, s);
|
|
13801
13801
|
};
|
|
@@ -13803,8 +13803,8 @@ Rs.prototype._decrypt = function(t, r, n, i10, s) {
|
|
|
13803
13803
|
for (var o = n, a = r, u = t.keys.length - 2; u >= 0; u -= 2) {
|
|
13804
13804
|
var l = t.keys[u], b = t.keys[u + 1];
|
|
13805
13805
|
Mt.expand(o, t.tmp, 0), l ^= t.tmp[0], b ^= t.tmp[1];
|
|
13806
|
-
var O = Mt.substitute(l, b), M = Mt.permute(O),
|
|
13807
|
-
o = (a ^ M) >>> 0, a =
|
|
13806
|
+
var O = Mt.substitute(l, b), M = Mt.permute(O), D = o;
|
|
13807
|
+
o = (a ^ M) >>> 0, a = D;
|
|
13808
13808
|
}
|
|
13809
13809
|
Mt.rip(o, a, i10, s);
|
|
13810
13810
|
};
|
|
@@ -14235,9 +14235,9 @@ function Xd(e10) {
|
|
|
14235
14235
|
e10[t] = 0;
|
|
14236
14236
|
}
|
|
14237
14237
|
function ZS(e10, t, r, n, i10) {
|
|
14238
|
-
for (var s = r[0], o = r[1], a = r[2], u = r[3], l = e10[0] ^ t[0], b = e10[1] ^ t[1], O = e10[2] ^ t[2], M = e10[3] ^ t[3],
|
|
14239
|
-
|
|
14240
|
-
return
|
|
14238
|
+
for (var s = r[0], o = r[1], a = r[2], u = r[3], l = e10[0] ^ t[0], b = e10[1] ^ t[1], O = e10[2] ^ t[2], M = e10[3] ^ t[3], D, F, $6, J, C = 4, P = 1; P < i10; P++)
|
|
14239
|
+
D = s[l >>> 24] ^ o[b >>> 16 & 255] ^ a[O >>> 8 & 255] ^ u[M & 255] ^ t[C++], F = s[b >>> 24] ^ o[O >>> 16 & 255] ^ a[M >>> 8 & 255] ^ u[l & 255] ^ t[C++], $6 = s[O >>> 24] ^ o[M >>> 16 & 255] ^ a[l >>> 8 & 255] ^ u[b & 255] ^ t[C++], J = s[M >>> 24] ^ o[l >>> 16 & 255] ^ a[b >>> 8 & 255] ^ u[O & 255] ^ t[C++], l = D, b = F, O = $6, M = J;
|
|
14240
|
+
return D = (n[l >>> 24] << 24 | n[b >>> 16 & 255] << 16 | n[O >>> 8 & 255] << 8 | n[M & 255]) ^ t[C++], F = (n[b >>> 24] << 24 | n[O >>> 16 & 255] << 16 | n[M >>> 8 & 255] << 8 | n[l & 255]) ^ t[C++], $6 = (n[O >>> 24] << 24 | n[M >>> 16 & 255] << 16 | n[l >>> 8 & 255] << 8 | n[b & 255]) ^ t[C++], J = (n[M >>> 24] << 24 | n[l >>> 16 & 255] << 16 | n[b >>> 8 & 255] << 8 | n[O & 255]) ^ t[C++], D = D >>> 0, F = F >>> 0, $6 = $6 >>> 0, J = J >>> 0, [D, F, $6, J];
|
|
14241
14241
|
}
|
|
14242
14242
|
var zM = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], Rt = function() {
|
|
14243
14243
|
for (var e10 = new Array(256), t = 0; t < 256; t++)
|
|
@@ -14245,8 +14245,8 @@ var zM = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], Rt = function() {
|
|
|
14245
14245
|
for (var r = [], n = [], i10 = [[], [], [], []], s = [[], [], [], []], o = 0, a = 0, u = 0; u < 256; ++u) {
|
|
14246
14246
|
var l = a ^ a << 1 ^ a << 2 ^ a << 3 ^ a << 4;
|
|
14247
14247
|
l = l >>> 8 ^ l & 255 ^ 99, r[o] = l, n[l] = o;
|
|
14248
|
-
var b = e10[o], O = e10[b], M = e10[O],
|
|
14249
|
-
i10[0][o] =
|
|
14248
|
+
var b = e10[o], O = e10[b], M = e10[O], D = e10[l] * 257 ^ l * 16843008;
|
|
14249
|
+
i10[0][o] = D << 24 | D >>> 8, i10[1][o] = D << 16 | D >>> 16, i10[2][o] = D << 8 | D >>> 24, i10[3][o] = D, D = M * 16843009 ^ O * 65537 ^ b * 257 ^ o * 16843008, s[0][l] = D << 24 | D >>> 8, s[1][l] = D << 16 | D >>> 16, s[2][l] = D << 8 | D >>> 24, s[3][l] = D, o === 0 ? o = a = 1 : (o = b ^ e10[e10[e10[M ^ b]]], a ^= e10[e10[a]]);
|
|
14250
14250
|
}
|
|
14251
14251
|
return {
|
|
14252
14252
|
SBOX: r,
|
|
@@ -14627,20 +14627,20 @@ ni.listCiphers = ni.getCiphers = AD;
|
|
|
14627
14627
|
var Co = {}, v0 = { exports: {} };
|
|
14628
14628
|
(function(e10) {
|
|
14629
14629
|
(function(t, r) {
|
|
14630
|
-
function n(
|
|
14631
|
-
if (!
|
|
14630
|
+
function n(L6, g) {
|
|
14631
|
+
if (!L6)
|
|
14632
14632
|
throw new Error(g || "Assertion failed");
|
|
14633
14633
|
}
|
|
14634
|
-
function i10(
|
|
14635
|
-
|
|
14634
|
+
function i10(L6, g) {
|
|
14635
|
+
L6.super_ = g;
|
|
14636
14636
|
var m = function() {
|
|
14637
14637
|
};
|
|
14638
|
-
m.prototype = g.prototype,
|
|
14638
|
+
m.prototype = g.prototype, L6.prototype = new m(), L6.prototype.constructor = L6;
|
|
14639
14639
|
}
|
|
14640
|
-
function s(
|
|
14641
|
-
if (s.isBN(
|
|
14642
|
-
return
|
|
14643
|
-
this.negative = 0, this.words = null, this.length = 0, this.red = null,
|
|
14640
|
+
function s(L6, g, m) {
|
|
14641
|
+
if (s.isBN(L6))
|
|
14642
|
+
return L6;
|
|
14643
|
+
this.negative = 0, this.words = null, this.length = 0, this.red = null, L6 !== null && ((g === "le" || g === "be") && (m = g, g = 10), this._init(L6 || 0, g || 10, m || "be"));
|
|
14644
14644
|
}
|
|
14645
14645
|
typeof t == "object" ? t.exports = s : r.BN = s, s.BN = s, s.wordSize = 26;
|
|
14646
14646
|
var o;
|
|
@@ -14660,8 +14660,8 @@ var Co = {}, v0 = { exports: {} };
|
|
|
14660
14660
|
if (typeof g == "object")
|
|
14661
14661
|
return this._initArray(g, m, f);
|
|
14662
14662
|
m === "hex" && (m = 16), n(m === (m | 0) && m >= 2 && m <= 36), g = g.toString().replace(/\s+/g, "");
|
|
14663
|
-
var
|
|
14664
|
-
g[0] === "-" && (
|
|
14663
|
+
var d10 = 0;
|
|
14664
|
+
g[0] === "-" && (d10++, this.negative = 1), d10 < g.length && (m === 16 ? this._parseHex(g, d10, f) : (this._parseBase(g, m, d10), f === "le" && this._initArray(this.toArray(), m, f)));
|
|
14665
14665
|
}, s.prototype._initNumber = function(g, m, f) {
|
|
14666
14666
|
g < 0 && (this.negative = 1, g = -g), g < 67108864 ? (this.words = [g & 67108863], this.length = 1) : g < 4503599627370496 ? (this.words = [
|
|
14667
14667
|
g & 67108863,
|
|
@@ -14675,54 +14675,54 @@ var Co = {}, v0 = { exports: {} };
|
|
|
14675
14675
|
if (n(typeof g.length == "number"), g.length <= 0)
|
|
14676
14676
|
return this.words = [0], this.length = 1, this;
|
|
14677
14677
|
this.length = Math.ceil(g.length / 3), this.words = new Array(this.length);
|
|
14678
|
-
for (var
|
|
14679
|
-
this.words[
|
|
14678
|
+
for (var d10 = 0; d10 < this.length; d10++)
|
|
14679
|
+
this.words[d10] = 0;
|
|
14680
14680
|
var S, _, x = 0;
|
|
14681
14681
|
if (f === "be")
|
|
14682
|
-
for (
|
|
14683
|
-
_ = g[
|
|
14682
|
+
for (d10 = g.length - 1, S = 0; d10 >= 0; d10 -= 3)
|
|
14683
|
+
_ = g[d10] | g[d10 - 1] << 8 | g[d10 - 2] << 16, this.words[S] |= _ << x & 67108863, this.words[S + 1] = _ >>> 26 - x & 67108863, x += 24, x >= 26 && (x -= 26, S++);
|
|
14684
14684
|
else if (f === "le")
|
|
14685
|
-
for (
|
|
14686
|
-
_ = g[
|
|
14685
|
+
for (d10 = 0, S = 0; d10 < g.length; d10 += 3)
|
|
14686
|
+
_ = g[d10] | g[d10 + 1] << 8 | g[d10 + 2] << 16, this.words[S] |= _ << x & 67108863, this.words[S + 1] = _ >>> 26 - x & 67108863, x += 24, x >= 26 && (x -= 26, S++);
|
|
14687
14687
|
return this.strip();
|
|
14688
14688
|
};
|
|
14689
|
-
function a(
|
|
14690
|
-
var m =
|
|
14689
|
+
function a(L6, g) {
|
|
14690
|
+
var m = L6.charCodeAt(g);
|
|
14691
14691
|
return m >= 65 && m <= 70 ? m - 55 : m >= 97 && m <= 102 ? m - 87 : m - 48 & 15;
|
|
14692
14692
|
}
|
|
14693
|
-
function u(
|
|
14694
|
-
var f = a(
|
|
14695
|
-
return m - 1 >= g && (f |= a(
|
|
14693
|
+
function u(L6, g, m) {
|
|
14694
|
+
var f = a(L6, m);
|
|
14695
|
+
return m - 1 >= g && (f |= a(L6, m - 1) << 4), f;
|
|
14696
14696
|
}
|
|
14697
14697
|
s.prototype._parseHex = function(g, m, f) {
|
|
14698
14698
|
this.length = Math.ceil((g.length - m) / 6), this.words = new Array(this.length);
|
|
14699
|
-
for (var
|
|
14700
|
-
this.words[
|
|
14699
|
+
for (var d10 = 0; d10 < this.length; d10++)
|
|
14700
|
+
this.words[d10] = 0;
|
|
14701
14701
|
var S = 0, _ = 0, x;
|
|
14702
14702
|
if (f === "be")
|
|
14703
|
-
for (
|
|
14704
|
-
x = u(g, m,
|
|
14703
|
+
for (d10 = g.length - 1; d10 >= m; d10 -= 2)
|
|
14704
|
+
x = u(g, m, d10) << S, this.words[_] |= x & 67108863, S >= 18 ? (S -= 18, _ += 1, this.words[_] |= x >>> 26) : S += 8;
|
|
14705
14705
|
else {
|
|
14706
|
-
var
|
|
14707
|
-
for (
|
|
14708
|
-
x = u(g, m,
|
|
14706
|
+
var T = g.length - m;
|
|
14707
|
+
for (d10 = T % 2 === 0 ? m + 1 : m; d10 < g.length; d10 += 2)
|
|
14708
|
+
x = u(g, m, d10) << S, this.words[_] |= x & 67108863, S >= 18 ? (S -= 18, _ += 1, this.words[_] |= x >>> 26) : S += 8;
|
|
14709
14709
|
}
|
|
14710
14710
|
this.strip();
|
|
14711
14711
|
};
|
|
14712
|
-
function l(
|
|
14713
|
-
for (var
|
|
14714
|
-
var x =
|
|
14715
|
-
|
|
14712
|
+
function l(L6, g, m, f) {
|
|
14713
|
+
for (var d10 = 0, S = Math.min(L6.length, m), _ = g; _ < S; _++) {
|
|
14714
|
+
var x = L6.charCodeAt(_) - 48;
|
|
14715
|
+
d10 *= f, x >= 49 ? d10 += x - 49 + 10 : x >= 17 ? d10 += x - 17 + 10 : d10 += x;
|
|
14716
14716
|
}
|
|
14717
|
-
return
|
|
14717
|
+
return d10;
|
|
14718
14718
|
}
|
|
14719
14719
|
s.prototype._parseBase = function(g, m, f) {
|
|
14720
14720
|
this.words = [0], this.length = 1;
|
|
14721
|
-
for (var
|
|
14722
|
-
|
|
14723
|
-
|
|
14724
|
-
for (var _ = g.length - f, x = _ %
|
|
14725
|
-
y = l(g, w, w +
|
|
14721
|
+
for (var d10 = 0, S = 1; S <= 67108863; S *= m)
|
|
14722
|
+
d10++;
|
|
14723
|
+
d10--, S = S / m | 0;
|
|
14724
|
+
for (var _ = g.length - f, x = _ % d10, T = Math.min(_, _ - x) + f, y = 0, w = f; w < T; w += d10)
|
|
14725
|
+
y = l(g, w, w + d10, m), this.imuln(S), this.words[0] + y < 67108864 ? this.words[0] += y : this._iaddn(y);
|
|
14726
14726
|
if (x !== 0) {
|
|
14727
14727
|
var h = 1;
|
|
14728
14728
|
for (y = l(g, w, g.length, m), w = 0; w < x; w++)
|
|
@@ -14860,9 +14860,9 @@ var Co = {}, v0 = { exports: {} };
|
|
|
14860
14860
|
var f;
|
|
14861
14861
|
if (g === 16 || g === "hex") {
|
|
14862
14862
|
f = "";
|
|
14863
|
-
for (var
|
|
14864
|
-
var x = this.words[_],
|
|
14865
|
-
S = x >>> 24 -
|
|
14863
|
+
for (var d10 = 0, S = 0, _ = 0; _ < this.length; _++) {
|
|
14864
|
+
var x = this.words[_], T = ((x << d10 | S) & 16777215).toString(16);
|
|
14865
|
+
S = x >>> 24 - d10 & 16777215, S !== 0 || _ !== this.length - 1 ? f = b[6 - T.length] + T + f : f = T + f, d10 += 2, d10 >= 26 && (d10 -= 26, _--);
|
|
14866
14866
|
}
|
|
14867
14867
|
for (S !== 0 && (f = S.toString(16) + f); f.length % m !== 0; )
|
|
14868
14868
|
f = "0" + f;
|
|
@@ -14891,19 +14891,19 @@ var Co = {}, v0 = { exports: {} };
|
|
|
14891
14891
|
}, s.prototype.toArray = function(g, m) {
|
|
14892
14892
|
return this.toArrayLike(Array, g, m);
|
|
14893
14893
|
}, s.prototype.toArrayLike = function(g, m, f) {
|
|
14894
|
-
var
|
|
14895
|
-
n(
|
|
14896
|
-
var _ = m === "le", x = new g(S),
|
|
14894
|
+
var d10 = this.byteLength(), S = f || Math.max(1, d10);
|
|
14895
|
+
n(d10 <= S, "byte array longer than desired length"), n(S > 0, "Requested array length <= 0"), this.strip();
|
|
14896
|
+
var _ = m === "le", x = new g(S), T, y, w = this.clone();
|
|
14897
14897
|
if (_) {
|
|
14898
14898
|
for (y = 0; !w.isZero(); y++)
|
|
14899
|
-
|
|
14899
|
+
T = w.andln(255), w.iushrn(8), x[y] = T;
|
|
14900
14900
|
for (; y < S; y++)
|
|
14901
14901
|
x[y] = 0;
|
|
14902
14902
|
} else {
|
|
14903
|
-
for (y = 0; y < S -
|
|
14903
|
+
for (y = 0; y < S - d10; y++)
|
|
14904
14904
|
x[y] = 0;
|
|
14905
14905
|
for (y = 0; !w.isZero(); y++)
|
|
14906
|
-
|
|
14906
|
+
T = w.andln(255), w.iushrn(8), x[S - y - 1] = T;
|
|
14907
14907
|
}
|
|
14908
14908
|
return x;
|
|
14909
14909
|
}, Math.clz32 ? s.prototype._countBits = function(g) {
|
|
@@ -14920,10 +14920,10 @@ var Co = {}, v0 = { exports: {} };
|
|
|
14920
14920
|
var g = this.words[this.length - 1], m = this._countBits(g);
|
|
14921
14921
|
return (this.length - 1) * 26 + m;
|
|
14922
14922
|
};
|
|
14923
|
-
function
|
|
14924
|
-
for (var g = new Array(
|
|
14925
|
-
var f = m / 26 | 0,
|
|
14926
|
-
g[m] = (
|
|
14923
|
+
function D(L6) {
|
|
14924
|
+
for (var g = new Array(L6.bitLength()), m = 0; m < g.length; m++) {
|
|
14925
|
+
var f = m / 26 | 0, d10 = m % 26;
|
|
14926
|
+
g[m] = (L6.words[f] & 1 << d10) >>> d10;
|
|
14927
14927
|
}
|
|
14928
14928
|
return g;
|
|
14929
14929
|
}
|
|
@@ -14975,11 +14975,11 @@ var Co = {}, v0 = { exports: {} };
|
|
|
14975
14975
|
}, s.prototype.iuxor = function(g) {
|
|
14976
14976
|
var m, f;
|
|
14977
14977
|
this.length > g.length ? (m = this, f = g) : (m = g, f = this);
|
|
14978
|
-
for (var
|
|
14979
|
-
this.words[
|
|
14978
|
+
for (var d10 = 0; d10 < f.length; d10++)
|
|
14979
|
+
this.words[d10] = m.words[d10] ^ f.words[d10];
|
|
14980
14980
|
if (this !== m)
|
|
14981
|
-
for (;
|
|
14982
|
-
this.words[
|
|
14981
|
+
for (; d10 < m.length; d10++)
|
|
14982
|
+
this.words[d10] = m.words[d10];
|
|
14983
14983
|
return this.length = m.length, this.strip();
|
|
14984
14984
|
}, s.prototype.ixor = function(g) {
|
|
14985
14985
|
return n((this.negative | g.negative) === 0), this.iuxor(g);
|
|
@@ -14991,25 +14991,25 @@ var Co = {}, v0 = { exports: {} };
|
|
|
14991
14991
|
n(typeof g == "number" && g >= 0);
|
|
14992
14992
|
var m = Math.ceil(g / 26) | 0, f = g % 26;
|
|
14993
14993
|
this._expand(m), f > 0 && m--;
|
|
14994
|
-
for (var
|
|
14995
|
-
this.words[
|
|
14996
|
-
return f > 0 && (this.words[
|
|
14994
|
+
for (var d10 = 0; d10 < m; d10++)
|
|
14995
|
+
this.words[d10] = ~this.words[d10] & 67108863;
|
|
14996
|
+
return f > 0 && (this.words[d10] = ~this.words[d10] & 67108863 >> 26 - f), this.strip();
|
|
14997
14997
|
}, s.prototype.notn = function(g) {
|
|
14998
14998
|
return this.clone().inotn(g);
|
|
14999
14999
|
}, s.prototype.setn = function(g, m) {
|
|
15000
15000
|
n(typeof g == "number" && g >= 0);
|
|
15001
|
-
var f = g / 26 | 0,
|
|
15002
|
-
return this._expand(f + 1), m ? this.words[f] = this.words[f] | 1 <<
|
|
15001
|
+
var f = g / 26 | 0, d10 = g % 26;
|
|
15002
|
+
return this._expand(f + 1), m ? this.words[f] = this.words[f] | 1 << d10 : this.words[f] = this.words[f] & ~(1 << d10), this.strip();
|
|
15003
15003
|
}, s.prototype.iadd = function(g) {
|
|
15004
15004
|
var m;
|
|
15005
15005
|
if (this.negative !== 0 && g.negative === 0)
|
|
15006
15006
|
return this.negative = 0, m = this.isub(g), this.negative ^= 1, this._normSign();
|
|
15007
15007
|
if (this.negative === 0 && g.negative !== 0)
|
|
15008
15008
|
return g.negative = 0, m = this.isub(g), g.negative = 1, m._normSign();
|
|
15009
|
-
var f,
|
|
15010
|
-
this.length > g.length ? (f = this,
|
|
15011
|
-
for (var S = 0, _ = 0; _ <
|
|
15012
|
-
m = (f.words[_] | 0) + (
|
|
15009
|
+
var f, d10;
|
|
15010
|
+
this.length > g.length ? (f = this, d10 = g) : (f = g, d10 = this);
|
|
15011
|
+
for (var S = 0, _ = 0; _ < d10.length; _++)
|
|
15012
|
+
m = (f.words[_] | 0) + (d10.words[_] | 0) + S, this.words[_] = m & 67108863, S = m >>> 26;
|
|
15013
15013
|
for (; S !== 0 && _ < f.length; _++)
|
|
15014
15014
|
m = (f.words[_] | 0) + S, this.words[_] = m & 67108863, S = m >>> 26;
|
|
15015
15015
|
if (this.length = f.length, S !== 0)
|
|
@@ -15031,143 +15031,143 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15031
15031
|
var f = this.cmp(g);
|
|
15032
15032
|
if (f === 0)
|
|
15033
15033
|
return this.negative = 0, this.length = 1, this.words[0] = 0, this;
|
|
15034
|
-
var
|
|
15035
|
-
f > 0 ? (
|
|
15034
|
+
var d10, S;
|
|
15035
|
+
f > 0 ? (d10 = this, S = g) : (d10 = g, S = this);
|
|
15036
15036
|
for (var _ = 0, x = 0; x < S.length; x++)
|
|
15037
|
-
m = (
|
|
15038
|
-
for (; _ !== 0 && x <
|
|
15039
|
-
m = (
|
|
15040
|
-
if (_ === 0 && x <
|
|
15041
|
-
for (; x <
|
|
15042
|
-
this.words[x] =
|
|
15043
|
-
return this.length = Math.max(this.length, x),
|
|
15037
|
+
m = (d10.words[x] | 0) - (S.words[x] | 0) + _, _ = m >> 26, this.words[x] = m & 67108863;
|
|
15038
|
+
for (; _ !== 0 && x < d10.length; x++)
|
|
15039
|
+
m = (d10.words[x] | 0) + _, _ = m >> 26, this.words[x] = m & 67108863;
|
|
15040
|
+
if (_ === 0 && x < d10.length && d10 !== this)
|
|
15041
|
+
for (; x < d10.length; x++)
|
|
15042
|
+
this.words[x] = d10.words[x];
|
|
15043
|
+
return this.length = Math.max(this.length, x), d10 !== this && (this.negative = 1), this.strip();
|
|
15044
15044
|
}, s.prototype.sub = function(g) {
|
|
15045
15045
|
return this.clone().isub(g);
|
|
15046
15046
|
};
|
|
15047
|
-
function F(
|
|
15048
|
-
m.negative = g.negative ^
|
|
15049
|
-
var f =
|
|
15047
|
+
function F(L6, g, m) {
|
|
15048
|
+
m.negative = g.negative ^ L6.negative;
|
|
15049
|
+
var f = L6.length + g.length | 0;
|
|
15050
15050
|
m.length = f, f = f - 1 | 0;
|
|
15051
|
-
var
|
|
15051
|
+
var d10 = L6.words[0] | 0, S = g.words[0] | 0, _ = d10 * S, x = _ & 67108863, T = _ / 67108864 | 0;
|
|
15052
15052
|
m.words[0] = x;
|
|
15053
15053
|
for (var y = 1; y < f; y++) {
|
|
15054
|
-
for (var w =
|
|
15054
|
+
for (var w = T >>> 26, h = T & 67108863, R10 = Math.min(y, g.length - 1), W = Math.max(0, y - L6.length + 1); W <= R10; W++) {
|
|
15055
15055
|
var Q = y - W | 0;
|
|
15056
|
-
|
|
15056
|
+
d10 = L6.words[Q] | 0, S = g.words[W] | 0, _ = d10 * S + h, w += _ / 67108864 | 0, h = _ & 67108863;
|
|
15057
15057
|
}
|
|
15058
|
-
m.words[y] = h | 0,
|
|
15058
|
+
m.words[y] = h | 0, T = w | 0;
|
|
15059
15059
|
}
|
|
15060
|
-
return
|
|
15060
|
+
return T !== 0 ? m.words[y] = T | 0 : m.length--, m.strip();
|
|
15061
15061
|
}
|
|
15062
15062
|
var $6 = function(g, m, f) {
|
|
15063
|
-
var
|
|
15064
|
-
f.negative = g.negative ^ m.negative, f.length = 19,
|
|
15065
|
-
var et = (x +
|
|
15066
|
-
x = (w + (y >>> 13) | 0) + (et >>> 26) | 0, et &= 67108863,
|
|
15067
|
-
var tt = (x +
|
|
15068
|
-
x = (w + (y >>> 13) | 0) + (tt >>> 26) | 0, tt &= 67108863,
|
|
15069
|
-
var mo = (x +
|
|
15070
|
-
x = (w + (y >>> 13) | 0) + (mo >>> 26) | 0, mo &= 67108863,
|
|
15071
|
-
var yo = (x +
|
|
15072
|
-
x = (w + (y >>> 13) | 0) + (yo >>> 26) | 0, yo &= 67108863,
|
|
15073
|
-
var go = (x +
|
|
15074
|
-
x = (w + (y >>> 13) | 0) + (go >>> 26) | 0, go &= 67108863,
|
|
15075
|
-
var bo = (x +
|
|
15076
|
-
x = (w + (y >>> 13) | 0) + (bo >>> 26) | 0, bo &= 67108863,
|
|
15077
|
-
var So = (x +
|
|
15078
|
-
x = (w + (y >>> 13) | 0) + (So >>> 26) | 0, So &= 67108863,
|
|
15079
|
-
var vo = (x +
|
|
15080
|
-
x = (w + (y >>> 13) | 0) + (vo >>> 26) | 0, vo &= 67108863,
|
|
15081
|
-
var wo = (x +
|
|
15082
|
-
x = (w + (y >>> 13) | 0) + (wo >>> 26) | 0, wo &= 67108863,
|
|
15083
|
-
var To = (x +
|
|
15084
|
-
x = (w + (y >>> 13) | 0) + (To >>> 26) | 0, To &= 67108863,
|
|
15085
|
-
var _o = (x +
|
|
15086
|
-
x = (w + (y >>> 13) | 0) + (_o >>> 26) | 0, _o &= 67108863,
|
|
15087
|
-
var Oo = (x +
|
|
15088
|
-
x = (w + (y >>> 13) | 0) + (Oo >>> 26) | 0, Oo &= 67108863,
|
|
15089
|
-
var Ao = (x +
|
|
15090
|
-
x = (w + (y >>> 13) | 0) + (Ao >>> 26) | 0, Ao &= 67108863,
|
|
15091
|
-
var Ro = (x +
|
|
15092
|
-
x = (w + (y >>> 13) | 0) + (Ro >>> 26) | 0, Ro &= 67108863,
|
|
15093
|
-
var xo = (x +
|
|
15094
|
-
x = (w + (y >>> 13) | 0) + (xo >>> 26) | 0, xo &= 67108863,
|
|
15095
|
-
var No = (x +
|
|
15096
|
-
x = (w + (y >>> 13) | 0) + (No >>> 26) | 0, No &= 67108863,
|
|
15097
|
-
var Mo = (x +
|
|
15098
|
-
x = (w + (y >>> 13) | 0) + (Mo >>> 26) | 0, Mo &= 67108863,
|
|
15099
|
-
var Do = (x +
|
|
15100
|
-
x = (w + (y >>> 13) | 0) + (Do >>> 26) | 0, Do &= 67108863,
|
|
15101
|
-
var Eo = (x +
|
|
15063
|
+
var d10 = g.words, S = m.words, _ = f.words, x = 0, T, y, w, h = d10[0] | 0, R10 = h & 8191, W = h >>> 13, Q = d10[1] | 0, U = Q & 8191, G = Q >>> 13, Z = d10[2] | 0, ee = Z & 8191, ae = Z >>> 13, I6 = d10[3] | 0, q = I6 & 8191, re = I6 >>> 13, oe = d10[4] | 0, he = oe & 8191, pe = oe >>> 13, be = d10[5] | 0, Se = be & 8191, te = be >>> 13, $e = d10[6] | 0, Te = $e & 8191, le = $e >>> 13, Pe = d10[7] | 0, A = Pe & 8191, E = Pe >>> 13, V = d10[8] | 0, v = V & 8191, c = V >>> 13, p = d10[9] | 0, N = p & 8191, B = p >>> 13, H = S[0] | 0, z = H & 8191, ue = H >>> 13, ce = S[1] | 0, fe = ce & 8191, ge = ce >>> 13, me = S[2] | 0, _e = me & 8191, Ye = me >>> 13, nt = S[3] | 0, xe = nt & 8191, it = nt >>> 13, st = S[4] | 0, Ne = st & 8191, ot = st >>> 13, at = S[5] | 0, Me = at & 8191, ft = at >>> 13, ut = S[6] | 0, De = ut & 8191, ct = ut >>> 13, dt = S[7] | 0, Ee = dt & 8191, ht = dt >>> 13, lt = S[8] | 0, Fe = lt & 8191, pt = lt >>> 13, mt = S[9] | 0, Be = mt & 8191, yt = mt >>> 13;
|
|
15064
|
+
f.negative = g.negative ^ m.negative, f.length = 19, T = Math.imul(R10, z), y = Math.imul(R10, ue), y = y + Math.imul(W, z) | 0, w = Math.imul(W, ue);
|
|
15065
|
+
var et = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15066
|
+
x = (w + (y >>> 13) | 0) + (et >>> 26) | 0, et &= 67108863, T = Math.imul(U, z), y = Math.imul(U, ue), y = y + Math.imul(G, z) | 0, w = Math.imul(G, ue), T = T + Math.imul(R10, fe) | 0, y = y + Math.imul(R10, ge) | 0, y = y + Math.imul(W, fe) | 0, w = w + Math.imul(W, ge) | 0;
|
|
15067
|
+
var tt = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15068
|
+
x = (w + (y >>> 13) | 0) + (tt >>> 26) | 0, tt &= 67108863, T = Math.imul(ee, z), y = Math.imul(ee, ue), y = y + Math.imul(ae, z) | 0, w = Math.imul(ae, ue), T = T + Math.imul(U, fe) | 0, y = y + Math.imul(U, ge) | 0, y = y + Math.imul(G, fe) | 0, w = w + Math.imul(G, ge) | 0, T = T + Math.imul(R10, _e) | 0, y = y + Math.imul(R10, Ye) | 0, y = y + Math.imul(W, _e) | 0, w = w + Math.imul(W, Ye) | 0;
|
|
15069
|
+
var mo = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15070
|
+
x = (w + (y >>> 13) | 0) + (mo >>> 26) | 0, mo &= 67108863, T = Math.imul(q, z), y = Math.imul(q, ue), y = y + Math.imul(re, z) | 0, w = Math.imul(re, ue), T = T + Math.imul(ee, fe) | 0, y = y + Math.imul(ee, ge) | 0, y = y + Math.imul(ae, fe) | 0, w = w + Math.imul(ae, ge) | 0, T = T + Math.imul(U, _e) | 0, y = y + Math.imul(U, Ye) | 0, y = y + Math.imul(G, _e) | 0, w = w + Math.imul(G, Ye) | 0, T = T + Math.imul(R10, xe) | 0, y = y + Math.imul(R10, it) | 0, y = y + Math.imul(W, xe) | 0, w = w + Math.imul(W, it) | 0;
|
|
15071
|
+
var yo = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15072
|
+
x = (w + (y >>> 13) | 0) + (yo >>> 26) | 0, yo &= 67108863, T = Math.imul(he, z), y = Math.imul(he, ue), y = y + Math.imul(pe, z) | 0, w = Math.imul(pe, ue), T = T + Math.imul(q, fe) | 0, y = y + Math.imul(q, ge) | 0, y = y + Math.imul(re, fe) | 0, w = w + Math.imul(re, ge) | 0, T = T + Math.imul(ee, _e) | 0, y = y + Math.imul(ee, Ye) | 0, y = y + Math.imul(ae, _e) | 0, w = w + Math.imul(ae, Ye) | 0, T = T + Math.imul(U, xe) | 0, y = y + Math.imul(U, it) | 0, y = y + Math.imul(G, xe) | 0, w = w + Math.imul(G, it) | 0, T = T + Math.imul(R10, Ne) | 0, y = y + Math.imul(R10, ot) | 0, y = y + Math.imul(W, Ne) | 0, w = w + Math.imul(W, ot) | 0;
|
|
15073
|
+
var go = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15074
|
+
x = (w + (y >>> 13) | 0) + (go >>> 26) | 0, go &= 67108863, T = Math.imul(Se, z), y = Math.imul(Se, ue), y = y + Math.imul(te, z) | 0, w = Math.imul(te, ue), T = T + Math.imul(he, fe) | 0, y = y + Math.imul(he, ge) | 0, y = y + Math.imul(pe, fe) | 0, w = w + Math.imul(pe, ge) | 0, T = T + Math.imul(q, _e) | 0, y = y + Math.imul(q, Ye) | 0, y = y + Math.imul(re, _e) | 0, w = w + Math.imul(re, Ye) | 0, T = T + Math.imul(ee, xe) | 0, y = y + Math.imul(ee, it) | 0, y = y + Math.imul(ae, xe) | 0, w = w + Math.imul(ae, it) | 0, T = T + Math.imul(U, Ne) | 0, y = y + Math.imul(U, ot) | 0, y = y + Math.imul(G, Ne) | 0, w = w + Math.imul(G, ot) | 0, T = T + Math.imul(R10, Me) | 0, y = y + Math.imul(R10, ft) | 0, y = y + Math.imul(W, Me) | 0, w = w + Math.imul(W, ft) | 0;
|
|
15075
|
+
var bo = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15076
|
+
x = (w + (y >>> 13) | 0) + (bo >>> 26) | 0, bo &= 67108863, T = Math.imul(Te, z), y = Math.imul(Te, ue), y = y + Math.imul(le, z) | 0, w = Math.imul(le, ue), T = T + Math.imul(Se, fe) | 0, y = y + Math.imul(Se, ge) | 0, y = y + Math.imul(te, fe) | 0, w = w + Math.imul(te, ge) | 0, T = T + Math.imul(he, _e) | 0, y = y + Math.imul(he, Ye) | 0, y = y + Math.imul(pe, _e) | 0, w = w + Math.imul(pe, Ye) | 0, T = T + Math.imul(q, xe) | 0, y = y + Math.imul(q, it) | 0, y = y + Math.imul(re, xe) | 0, w = w + Math.imul(re, it) | 0, T = T + Math.imul(ee, Ne) | 0, y = y + Math.imul(ee, ot) | 0, y = y + Math.imul(ae, Ne) | 0, w = w + Math.imul(ae, ot) | 0, T = T + Math.imul(U, Me) | 0, y = y + Math.imul(U, ft) | 0, y = y + Math.imul(G, Me) | 0, w = w + Math.imul(G, ft) | 0, T = T + Math.imul(R10, De) | 0, y = y + Math.imul(R10, ct) | 0, y = y + Math.imul(W, De) | 0, w = w + Math.imul(W, ct) | 0;
|
|
15077
|
+
var So = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15078
|
+
x = (w + (y >>> 13) | 0) + (So >>> 26) | 0, So &= 67108863, T = Math.imul(A, z), y = Math.imul(A, ue), y = y + Math.imul(E, z) | 0, w = Math.imul(E, ue), T = T + Math.imul(Te, fe) | 0, y = y + Math.imul(Te, ge) | 0, y = y + Math.imul(le, fe) | 0, w = w + Math.imul(le, ge) | 0, T = T + Math.imul(Se, _e) | 0, y = y + Math.imul(Se, Ye) | 0, y = y + Math.imul(te, _e) | 0, w = w + Math.imul(te, Ye) | 0, T = T + Math.imul(he, xe) | 0, y = y + Math.imul(he, it) | 0, y = y + Math.imul(pe, xe) | 0, w = w + Math.imul(pe, it) | 0, T = T + Math.imul(q, Ne) | 0, y = y + Math.imul(q, ot) | 0, y = y + Math.imul(re, Ne) | 0, w = w + Math.imul(re, ot) | 0, T = T + Math.imul(ee, Me) | 0, y = y + Math.imul(ee, ft) | 0, y = y + Math.imul(ae, Me) | 0, w = w + Math.imul(ae, ft) | 0, T = T + Math.imul(U, De) | 0, y = y + Math.imul(U, ct) | 0, y = y + Math.imul(G, De) | 0, w = w + Math.imul(G, ct) | 0, T = T + Math.imul(R10, Ee) | 0, y = y + Math.imul(R10, ht) | 0, y = y + Math.imul(W, Ee) | 0, w = w + Math.imul(W, ht) | 0;
|
|
15079
|
+
var vo = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15080
|
+
x = (w + (y >>> 13) | 0) + (vo >>> 26) | 0, vo &= 67108863, T = Math.imul(v, z), y = Math.imul(v, ue), y = y + Math.imul(c, z) | 0, w = Math.imul(c, ue), T = T + Math.imul(A, fe) | 0, y = y + Math.imul(A, ge) | 0, y = y + Math.imul(E, fe) | 0, w = w + Math.imul(E, ge) | 0, T = T + Math.imul(Te, _e) | 0, y = y + Math.imul(Te, Ye) | 0, y = y + Math.imul(le, _e) | 0, w = w + Math.imul(le, Ye) | 0, T = T + Math.imul(Se, xe) | 0, y = y + Math.imul(Se, it) | 0, y = y + Math.imul(te, xe) | 0, w = w + Math.imul(te, it) | 0, T = T + Math.imul(he, Ne) | 0, y = y + Math.imul(he, ot) | 0, y = y + Math.imul(pe, Ne) | 0, w = w + Math.imul(pe, ot) | 0, T = T + Math.imul(q, Me) | 0, y = y + Math.imul(q, ft) | 0, y = y + Math.imul(re, Me) | 0, w = w + Math.imul(re, ft) | 0, T = T + Math.imul(ee, De) | 0, y = y + Math.imul(ee, ct) | 0, y = y + Math.imul(ae, De) | 0, w = w + Math.imul(ae, ct) | 0, T = T + Math.imul(U, Ee) | 0, y = y + Math.imul(U, ht) | 0, y = y + Math.imul(G, Ee) | 0, w = w + Math.imul(G, ht) | 0, T = T + Math.imul(R10, Fe) | 0, y = y + Math.imul(R10, pt) | 0, y = y + Math.imul(W, Fe) | 0, w = w + Math.imul(W, pt) | 0;
|
|
15081
|
+
var wo = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15082
|
+
x = (w + (y >>> 13) | 0) + (wo >>> 26) | 0, wo &= 67108863, T = Math.imul(N, z), y = Math.imul(N, ue), y = y + Math.imul(B, z) | 0, w = Math.imul(B, ue), T = T + Math.imul(v, fe) | 0, y = y + Math.imul(v, ge) | 0, y = y + Math.imul(c, fe) | 0, w = w + Math.imul(c, ge) | 0, T = T + Math.imul(A, _e) | 0, y = y + Math.imul(A, Ye) | 0, y = y + Math.imul(E, _e) | 0, w = w + Math.imul(E, Ye) | 0, T = T + Math.imul(Te, xe) | 0, y = y + Math.imul(Te, it) | 0, y = y + Math.imul(le, xe) | 0, w = w + Math.imul(le, it) | 0, T = T + Math.imul(Se, Ne) | 0, y = y + Math.imul(Se, ot) | 0, y = y + Math.imul(te, Ne) | 0, w = w + Math.imul(te, ot) | 0, T = T + Math.imul(he, Me) | 0, y = y + Math.imul(he, ft) | 0, y = y + Math.imul(pe, Me) | 0, w = w + Math.imul(pe, ft) | 0, T = T + Math.imul(q, De) | 0, y = y + Math.imul(q, ct) | 0, y = y + Math.imul(re, De) | 0, w = w + Math.imul(re, ct) | 0, T = T + Math.imul(ee, Ee) | 0, y = y + Math.imul(ee, ht) | 0, y = y + Math.imul(ae, Ee) | 0, w = w + Math.imul(ae, ht) | 0, T = T + Math.imul(U, Fe) | 0, y = y + Math.imul(U, pt) | 0, y = y + Math.imul(G, Fe) | 0, w = w + Math.imul(G, pt) | 0, T = T + Math.imul(R10, Be) | 0, y = y + Math.imul(R10, yt) | 0, y = y + Math.imul(W, Be) | 0, w = w + Math.imul(W, yt) | 0;
|
|
15083
|
+
var To = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15084
|
+
x = (w + (y >>> 13) | 0) + (To >>> 26) | 0, To &= 67108863, T = Math.imul(N, fe), y = Math.imul(N, ge), y = y + Math.imul(B, fe) | 0, w = Math.imul(B, ge), T = T + Math.imul(v, _e) | 0, y = y + Math.imul(v, Ye) | 0, y = y + Math.imul(c, _e) | 0, w = w + Math.imul(c, Ye) | 0, T = T + Math.imul(A, xe) | 0, y = y + Math.imul(A, it) | 0, y = y + Math.imul(E, xe) | 0, w = w + Math.imul(E, it) | 0, T = T + Math.imul(Te, Ne) | 0, y = y + Math.imul(Te, ot) | 0, y = y + Math.imul(le, Ne) | 0, w = w + Math.imul(le, ot) | 0, T = T + Math.imul(Se, Me) | 0, y = y + Math.imul(Se, ft) | 0, y = y + Math.imul(te, Me) | 0, w = w + Math.imul(te, ft) | 0, T = T + Math.imul(he, De) | 0, y = y + Math.imul(he, ct) | 0, y = y + Math.imul(pe, De) | 0, w = w + Math.imul(pe, ct) | 0, T = T + Math.imul(q, Ee) | 0, y = y + Math.imul(q, ht) | 0, y = y + Math.imul(re, Ee) | 0, w = w + Math.imul(re, ht) | 0, T = T + Math.imul(ee, Fe) | 0, y = y + Math.imul(ee, pt) | 0, y = y + Math.imul(ae, Fe) | 0, w = w + Math.imul(ae, pt) | 0, T = T + Math.imul(U, Be) | 0, y = y + Math.imul(U, yt) | 0, y = y + Math.imul(G, Be) | 0, w = w + Math.imul(G, yt) | 0;
|
|
15085
|
+
var _o = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15086
|
+
x = (w + (y >>> 13) | 0) + (_o >>> 26) | 0, _o &= 67108863, T = Math.imul(N, _e), y = Math.imul(N, Ye), y = y + Math.imul(B, _e) | 0, w = Math.imul(B, Ye), T = T + Math.imul(v, xe) | 0, y = y + Math.imul(v, it) | 0, y = y + Math.imul(c, xe) | 0, w = w + Math.imul(c, it) | 0, T = T + Math.imul(A, Ne) | 0, y = y + Math.imul(A, ot) | 0, y = y + Math.imul(E, Ne) | 0, w = w + Math.imul(E, ot) | 0, T = T + Math.imul(Te, Me) | 0, y = y + Math.imul(Te, ft) | 0, y = y + Math.imul(le, Me) | 0, w = w + Math.imul(le, ft) | 0, T = T + Math.imul(Se, De) | 0, y = y + Math.imul(Se, ct) | 0, y = y + Math.imul(te, De) | 0, w = w + Math.imul(te, ct) | 0, T = T + Math.imul(he, Ee) | 0, y = y + Math.imul(he, ht) | 0, y = y + Math.imul(pe, Ee) | 0, w = w + Math.imul(pe, ht) | 0, T = T + Math.imul(q, Fe) | 0, y = y + Math.imul(q, pt) | 0, y = y + Math.imul(re, Fe) | 0, w = w + Math.imul(re, pt) | 0, T = T + Math.imul(ee, Be) | 0, y = y + Math.imul(ee, yt) | 0, y = y + Math.imul(ae, Be) | 0, w = w + Math.imul(ae, yt) | 0;
|
|
15087
|
+
var Oo = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15088
|
+
x = (w + (y >>> 13) | 0) + (Oo >>> 26) | 0, Oo &= 67108863, T = Math.imul(N, xe), y = Math.imul(N, it), y = y + Math.imul(B, xe) | 0, w = Math.imul(B, it), T = T + Math.imul(v, Ne) | 0, y = y + Math.imul(v, ot) | 0, y = y + Math.imul(c, Ne) | 0, w = w + Math.imul(c, ot) | 0, T = T + Math.imul(A, Me) | 0, y = y + Math.imul(A, ft) | 0, y = y + Math.imul(E, Me) | 0, w = w + Math.imul(E, ft) | 0, T = T + Math.imul(Te, De) | 0, y = y + Math.imul(Te, ct) | 0, y = y + Math.imul(le, De) | 0, w = w + Math.imul(le, ct) | 0, T = T + Math.imul(Se, Ee) | 0, y = y + Math.imul(Se, ht) | 0, y = y + Math.imul(te, Ee) | 0, w = w + Math.imul(te, ht) | 0, T = T + Math.imul(he, Fe) | 0, y = y + Math.imul(he, pt) | 0, y = y + Math.imul(pe, Fe) | 0, w = w + Math.imul(pe, pt) | 0, T = T + Math.imul(q, Be) | 0, y = y + Math.imul(q, yt) | 0, y = y + Math.imul(re, Be) | 0, w = w + Math.imul(re, yt) | 0;
|
|
15089
|
+
var Ao = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15090
|
+
x = (w + (y >>> 13) | 0) + (Ao >>> 26) | 0, Ao &= 67108863, T = Math.imul(N, Ne), y = Math.imul(N, ot), y = y + Math.imul(B, Ne) | 0, w = Math.imul(B, ot), T = T + Math.imul(v, Me) | 0, y = y + Math.imul(v, ft) | 0, y = y + Math.imul(c, Me) | 0, w = w + Math.imul(c, ft) | 0, T = T + Math.imul(A, De) | 0, y = y + Math.imul(A, ct) | 0, y = y + Math.imul(E, De) | 0, w = w + Math.imul(E, ct) | 0, T = T + Math.imul(Te, Ee) | 0, y = y + Math.imul(Te, ht) | 0, y = y + Math.imul(le, Ee) | 0, w = w + Math.imul(le, ht) | 0, T = T + Math.imul(Se, Fe) | 0, y = y + Math.imul(Se, pt) | 0, y = y + Math.imul(te, Fe) | 0, w = w + Math.imul(te, pt) | 0, T = T + Math.imul(he, Be) | 0, y = y + Math.imul(he, yt) | 0, y = y + Math.imul(pe, Be) | 0, w = w + Math.imul(pe, yt) | 0;
|
|
15091
|
+
var Ro = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15092
|
+
x = (w + (y >>> 13) | 0) + (Ro >>> 26) | 0, Ro &= 67108863, T = Math.imul(N, Me), y = Math.imul(N, ft), y = y + Math.imul(B, Me) | 0, w = Math.imul(B, ft), T = T + Math.imul(v, De) | 0, y = y + Math.imul(v, ct) | 0, y = y + Math.imul(c, De) | 0, w = w + Math.imul(c, ct) | 0, T = T + Math.imul(A, Ee) | 0, y = y + Math.imul(A, ht) | 0, y = y + Math.imul(E, Ee) | 0, w = w + Math.imul(E, ht) | 0, T = T + Math.imul(Te, Fe) | 0, y = y + Math.imul(Te, pt) | 0, y = y + Math.imul(le, Fe) | 0, w = w + Math.imul(le, pt) | 0, T = T + Math.imul(Se, Be) | 0, y = y + Math.imul(Se, yt) | 0, y = y + Math.imul(te, Be) | 0, w = w + Math.imul(te, yt) | 0;
|
|
15093
|
+
var xo = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15094
|
+
x = (w + (y >>> 13) | 0) + (xo >>> 26) | 0, xo &= 67108863, T = Math.imul(N, De), y = Math.imul(N, ct), y = y + Math.imul(B, De) | 0, w = Math.imul(B, ct), T = T + Math.imul(v, Ee) | 0, y = y + Math.imul(v, ht) | 0, y = y + Math.imul(c, Ee) | 0, w = w + Math.imul(c, ht) | 0, T = T + Math.imul(A, Fe) | 0, y = y + Math.imul(A, pt) | 0, y = y + Math.imul(E, Fe) | 0, w = w + Math.imul(E, pt) | 0, T = T + Math.imul(Te, Be) | 0, y = y + Math.imul(Te, yt) | 0, y = y + Math.imul(le, Be) | 0, w = w + Math.imul(le, yt) | 0;
|
|
15095
|
+
var No = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15096
|
+
x = (w + (y >>> 13) | 0) + (No >>> 26) | 0, No &= 67108863, T = Math.imul(N, Ee), y = Math.imul(N, ht), y = y + Math.imul(B, Ee) | 0, w = Math.imul(B, ht), T = T + Math.imul(v, Fe) | 0, y = y + Math.imul(v, pt) | 0, y = y + Math.imul(c, Fe) | 0, w = w + Math.imul(c, pt) | 0, T = T + Math.imul(A, Be) | 0, y = y + Math.imul(A, yt) | 0, y = y + Math.imul(E, Be) | 0, w = w + Math.imul(E, yt) | 0;
|
|
15097
|
+
var Mo = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15098
|
+
x = (w + (y >>> 13) | 0) + (Mo >>> 26) | 0, Mo &= 67108863, T = Math.imul(N, Fe), y = Math.imul(N, pt), y = y + Math.imul(B, Fe) | 0, w = Math.imul(B, pt), T = T + Math.imul(v, Be) | 0, y = y + Math.imul(v, yt) | 0, y = y + Math.imul(c, Be) | 0, w = w + Math.imul(c, yt) | 0;
|
|
15099
|
+
var Do = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15100
|
+
x = (w + (y >>> 13) | 0) + (Do >>> 26) | 0, Do &= 67108863, T = Math.imul(N, Be), y = Math.imul(N, yt), y = y + Math.imul(B, Be) | 0, w = Math.imul(B, yt);
|
|
15101
|
+
var Eo = (x + T | 0) + ((y & 8191) << 13) | 0;
|
|
15102
15102
|
return x = (w + (y >>> 13) | 0) + (Eo >>> 26) | 0, Eo &= 67108863, _[0] = et, _[1] = tt, _[2] = mo, _[3] = yo, _[4] = go, _[5] = bo, _[6] = So, _[7] = vo, _[8] = wo, _[9] = To, _[10] = _o, _[11] = Oo, _[12] = Ao, _[13] = Ro, _[14] = xo, _[15] = No, _[16] = Mo, _[17] = Do, _[18] = Eo, x !== 0 && (_[19] = x, f.length++), f;
|
|
15103
15103
|
};
|
|
15104
15104
|
Math.imul || ($6 = F);
|
|
15105
|
-
function J(
|
|
15106
|
-
m.negative = g.negative ^
|
|
15107
|
-
for (var f = 0,
|
|
15108
|
-
var _ =
|
|
15109
|
-
|
|
15110
|
-
for (var x = f & 67108863,
|
|
15111
|
-
var w = S - y, h =
|
|
15112
|
-
_ = _ + (W / 67108864 | 0) | 0, Q = Q + x | 0, x = Q & 67108863, _ = _ + (Q >>> 26) | 0,
|
|
15105
|
+
function J(L6, g, m) {
|
|
15106
|
+
m.negative = g.negative ^ L6.negative, m.length = L6.length + g.length;
|
|
15107
|
+
for (var f = 0, d10 = 0, S = 0; S < m.length - 1; S++) {
|
|
15108
|
+
var _ = d10;
|
|
15109
|
+
d10 = 0;
|
|
15110
|
+
for (var x = f & 67108863, T = Math.min(S, g.length - 1), y = Math.max(0, S - L6.length + 1); y <= T; y++) {
|
|
15111
|
+
var w = S - y, h = L6.words[w] | 0, R10 = g.words[y] | 0, W = h * R10, Q = W & 67108863;
|
|
15112
|
+
_ = _ + (W / 67108864 | 0) | 0, Q = Q + x | 0, x = Q & 67108863, _ = _ + (Q >>> 26) | 0, d10 += _ >>> 26, _ &= 67108863;
|
|
15113
15113
|
}
|
|
15114
|
-
m.words[S] = x, f = _, _ =
|
|
15114
|
+
m.words[S] = x, f = _, _ = d10;
|
|
15115
15115
|
}
|
|
15116
15116
|
return f !== 0 ? m.words[S] = f : m.length--, m.strip();
|
|
15117
15117
|
}
|
|
15118
|
-
function C(
|
|
15118
|
+
function C(L6, g, m) {
|
|
15119
15119
|
var f = new P();
|
|
15120
|
-
return f.mulp(
|
|
15120
|
+
return f.mulp(L6, g, m);
|
|
15121
15121
|
}
|
|
15122
15122
|
s.prototype.mulTo = function(g, m) {
|
|
15123
|
-
var f,
|
|
15124
|
-
return this.length === 10 && g.length === 10 ? f = $6(this, g, m) :
|
|
15123
|
+
var f, d10 = this.length + g.length;
|
|
15124
|
+
return this.length === 10 && g.length === 10 ? f = $6(this, g, m) : d10 < 63 ? f = F(this, g, m) : d10 < 1024 ? f = J(this, g, m) : f = C(this, g, m), f;
|
|
15125
15125
|
};
|
|
15126
|
-
function P(
|
|
15127
|
-
this.x =
|
|
15126
|
+
function P(L6, g) {
|
|
15127
|
+
this.x = L6, this.y = g;
|
|
15128
15128
|
}
|
|
15129
15129
|
P.prototype.makeRBT = function(g) {
|
|
15130
|
-
for (var m = new Array(g), f = s.prototype._countBits(g) - 1,
|
|
15131
|
-
m[
|
|
15130
|
+
for (var m = new Array(g), f = s.prototype._countBits(g) - 1, d10 = 0; d10 < g; d10++)
|
|
15131
|
+
m[d10] = this.revBin(d10, f, g);
|
|
15132
15132
|
return m;
|
|
15133
15133
|
}, P.prototype.revBin = function(g, m, f) {
|
|
15134
15134
|
if (g === 0 || g === f - 1)
|
|
15135
15135
|
return g;
|
|
15136
|
-
for (var
|
|
15137
|
-
|
|
15138
|
-
return
|
|
15139
|
-
}, P.prototype.permute = function(g, m, f,
|
|
15136
|
+
for (var d10 = 0, S = 0; S < m; S++)
|
|
15137
|
+
d10 |= (g & 1) << m - S - 1, g >>= 1;
|
|
15138
|
+
return d10;
|
|
15139
|
+
}, P.prototype.permute = function(g, m, f, d10, S, _) {
|
|
15140
15140
|
for (var x = 0; x < _; x++)
|
|
15141
|
-
|
|
15142
|
-
}, P.prototype.transform = function(g, m, f,
|
|
15143
|
-
this.permute(_, g, m, f,
|
|
15141
|
+
d10[x] = m[g[x]], S[x] = f[g[x]];
|
|
15142
|
+
}, P.prototype.transform = function(g, m, f, d10, S, _) {
|
|
15143
|
+
this.permute(_, g, m, f, d10, S);
|
|
15144
15144
|
for (var x = 1; x < S; x <<= 1)
|
|
15145
|
-
for (var
|
|
15145
|
+
for (var T = x << 1, y = Math.cos(2 * Math.PI / T), w = Math.sin(2 * Math.PI / T), h = 0; h < S; h += T)
|
|
15146
15146
|
for (var R10 = y, W = w, Q = 0; Q < x; Q++) {
|
|
15147
|
-
var U = f[h + Q], G =
|
|
15148
|
-
ee = R10 * ee + W * Z, Z = ae, f[h + Q] = U + Z,
|
|
15147
|
+
var U = f[h + Q], G = d10[h + Q], Z = f[h + Q + x], ee = d10[h + Q + x], ae = R10 * Z - W * ee;
|
|
15148
|
+
ee = R10 * ee + W * Z, Z = ae, f[h + Q] = U + Z, d10[h + Q] = G + ee, f[h + Q + x] = U - Z, d10[h + Q + x] = G - ee, Q !== T && (ae = y * R10 - w * W, W = y * W + w * R10, R10 = ae);
|
|
15149
15149
|
}
|
|
15150
15150
|
}, P.prototype.guessLen13b = function(g, m) {
|
|
15151
|
-
var f = Math.max(m, g) | 1,
|
|
15151
|
+
var f = Math.max(m, g) | 1, d10 = f & 1, S = 0;
|
|
15152
15152
|
for (f = f / 2 | 0; f; f = f >>> 1)
|
|
15153
15153
|
S++;
|
|
15154
|
-
return 1 << S + 1 +
|
|
15154
|
+
return 1 << S + 1 + d10;
|
|
15155
15155
|
}, P.prototype.conjugate = function(g, m, f) {
|
|
15156
15156
|
if (!(f <= 1))
|
|
15157
|
-
for (var
|
|
15158
|
-
var S = g[
|
|
15159
|
-
g[
|
|
15157
|
+
for (var d10 = 0; d10 < f / 2; d10++) {
|
|
15158
|
+
var S = g[d10];
|
|
15159
|
+
g[d10] = g[f - d10 - 1], g[f - d10 - 1] = S, S = m[d10], m[d10] = -m[f - d10 - 1], m[f - d10 - 1] = -S;
|
|
15160
15160
|
}
|
|
15161
15161
|
}, P.prototype.normalize13b = function(g, m) {
|
|
15162
|
-
for (var f = 0,
|
|
15163
|
-
var S = Math.round(g[2 *
|
|
15164
|
-
g[
|
|
15162
|
+
for (var f = 0, d10 = 0; d10 < m / 2; d10++) {
|
|
15163
|
+
var S = Math.round(g[2 * d10 + 1] / m) * 8192 + Math.round(g[2 * d10] / m) + f;
|
|
15164
|
+
g[d10] = S & 67108863, S < 67108864 ? f = 0 : f = S / 67108864 | 0;
|
|
15165
15165
|
}
|
|
15166
15166
|
return g;
|
|
15167
|
-
}, P.prototype.convert13b = function(g, m, f,
|
|
15167
|
+
}, P.prototype.convert13b = function(g, m, f, d10) {
|
|
15168
15168
|
for (var S = 0, _ = 0; _ < m; _++)
|
|
15169
15169
|
S = S + (g[_] | 0), f[2 * _] = S & 8191, S = S >>> 13, f[2 * _ + 1] = S & 8191, S = S >>> 13;
|
|
15170
|
-
for (_ = 2 * m; _ <
|
|
15170
|
+
for (_ = 2 * m; _ < d10; ++_)
|
|
15171
15171
|
f[_] = 0;
|
|
15172
15172
|
n(S === 0), n((S & -8192) === 0);
|
|
15173
15173
|
}, P.prototype.stub = function(g) {
|
|
@@ -15175,13 +15175,13 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15175
15175
|
m[f] = 0;
|
|
15176
15176
|
return m;
|
|
15177
15177
|
}, P.prototype.mulp = function(g, m, f) {
|
|
15178
|
-
var
|
|
15179
|
-
W.length =
|
|
15180
|
-
for (var Q = 0; Q <
|
|
15181
|
-
var U =
|
|
15182
|
-
y[Q] =
|
|
15178
|
+
var d10 = 2 * this.guessLen13b(g.length, m.length), S = this.makeRBT(d10), _ = this.stub(d10), x = new Array(d10), T = new Array(d10), y = new Array(d10), w = new Array(d10), h = new Array(d10), R10 = new Array(d10), W = f.words;
|
|
15179
|
+
W.length = d10, this.convert13b(g.words, g.length, x, d10), this.convert13b(m.words, m.length, w, d10), this.transform(x, _, T, y, d10, S), this.transform(w, _, h, R10, d10, S);
|
|
15180
|
+
for (var Q = 0; Q < d10; Q++) {
|
|
15181
|
+
var U = T[Q] * h[Q] - y[Q] * R10[Q];
|
|
15182
|
+
y[Q] = T[Q] * R10[Q] + y[Q] * h[Q], T[Q] = U;
|
|
15183
15183
|
}
|
|
15184
|
-
return this.conjugate(
|
|
15184
|
+
return this.conjugate(T, y, d10), this.transform(T, y, W, _, d10, S), this.conjugate(W, _, d10), this.normalize13b(W, d10), f.negative = g.negative ^ m.negative, f.length = g.length + m.length, f.strip();
|
|
15185
15185
|
}, s.prototype.mul = function(g) {
|
|
15186
15186
|
var m = new s(null);
|
|
15187
15187
|
return m.words = new Array(this.length + g.length), this.mulTo(g, m);
|
|
@@ -15193,8 +15193,8 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15193
15193
|
}, s.prototype.imuln = function(g) {
|
|
15194
15194
|
n(typeof g == "number"), n(g < 67108864);
|
|
15195
15195
|
for (var m = 0, f = 0; f < this.length; f++) {
|
|
15196
|
-
var
|
|
15197
|
-
m >>= 26, m +=
|
|
15196
|
+
var d10 = (this.words[f] | 0) * g, S = (d10 & 67108863) + (m & 67108863);
|
|
15197
|
+
m >>= 26, m += d10 / 67108864 | 0, m += S >>> 26, this.words[f] = S & 67108863;
|
|
15198
15198
|
}
|
|
15199
15199
|
return m !== 0 && (this.words[f] = m, this.length++), this;
|
|
15200
15200
|
}, s.prototype.muln = function(g) {
|
|
@@ -15204,23 +15204,23 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15204
15204
|
}, s.prototype.isqr = function() {
|
|
15205
15205
|
return this.imul(this.clone());
|
|
15206
15206
|
}, s.prototype.pow = function(g) {
|
|
15207
|
-
var m =
|
|
15207
|
+
var m = D(g);
|
|
15208
15208
|
if (m.length === 0)
|
|
15209
15209
|
return new s(1);
|
|
15210
|
-
for (var f = this,
|
|
15210
|
+
for (var f = this, d10 = 0; d10 < m.length && m[d10] === 0; d10++, f = f.sqr())
|
|
15211
15211
|
;
|
|
15212
|
-
if (++
|
|
15213
|
-
for (var S = f.sqr();
|
|
15214
|
-
m[
|
|
15212
|
+
if (++d10 < m.length)
|
|
15213
|
+
for (var S = f.sqr(); d10 < m.length; d10++, S = S.sqr())
|
|
15214
|
+
m[d10] !== 0 && (f = f.mul(S));
|
|
15215
15215
|
return f;
|
|
15216
15216
|
}, s.prototype.iushln = function(g) {
|
|
15217
15217
|
n(typeof g == "number" && g >= 0);
|
|
15218
|
-
var m = g % 26, f = (g - m) / 26,
|
|
15218
|
+
var m = g % 26, f = (g - m) / 26, d10 = 67108863 >>> 26 - m << 26 - m, S;
|
|
15219
15219
|
if (m !== 0) {
|
|
15220
15220
|
var _ = 0;
|
|
15221
15221
|
for (S = 0; S < this.length; S++) {
|
|
15222
|
-
var x = this.words[S] &
|
|
15223
|
-
this.words[S] =
|
|
15222
|
+
var x = this.words[S] & d10, T = (this.words[S] | 0) - x << m;
|
|
15223
|
+
this.words[S] = T | _, _ = x >>> 26 - m;
|
|
15224
15224
|
}
|
|
15225
15225
|
_ && (this.words[S] = _, this.length++);
|
|
15226
15226
|
}
|
|
@@ -15236,13 +15236,13 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15236
15236
|
return n(this.negative === 0), this.iushln(g);
|
|
15237
15237
|
}, s.prototype.iushrn = function(g, m, f) {
|
|
15238
15238
|
n(typeof g == "number" && g >= 0);
|
|
15239
|
-
var
|
|
15240
|
-
m ?
|
|
15241
|
-
var S = g % 26, _ = Math.min((g - S) / 26, this.length), x = 67108863 ^ 67108863 >>> S << S,
|
|
15242
|
-
if (
|
|
15239
|
+
var d10;
|
|
15240
|
+
m ? d10 = (m - m % 26) / 26 : d10 = 0;
|
|
15241
|
+
var S = g % 26, _ = Math.min((g - S) / 26, this.length), x = 67108863 ^ 67108863 >>> S << S, T = f;
|
|
15242
|
+
if (d10 -= _, d10 = Math.max(0, d10), T) {
|
|
15243
15243
|
for (var y = 0; y < _; y++)
|
|
15244
|
-
|
|
15245
|
-
|
|
15244
|
+
T.words[y] = this.words[y];
|
|
15245
|
+
T.length = _;
|
|
15246
15246
|
}
|
|
15247
15247
|
if (_ !== 0)
|
|
15248
15248
|
if (this.length > _)
|
|
@@ -15251,11 +15251,11 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15251
15251
|
else
|
|
15252
15252
|
this.words[0] = 0, this.length = 1;
|
|
15253
15253
|
var w = 0;
|
|
15254
|
-
for (y = this.length - 1; y >= 0 && (w !== 0 || y >=
|
|
15254
|
+
for (y = this.length - 1; y >= 0 && (w !== 0 || y >= d10); y--) {
|
|
15255
15255
|
var h = this.words[y] | 0;
|
|
15256
15256
|
this.words[y] = w << 26 - S | h >>> S, w = h & x;
|
|
15257
15257
|
}
|
|
15258
|
-
return
|
|
15258
|
+
return T && w !== 0 && (T.words[T.length++] = w), this.length === 0 && (this.words[0] = 0, this.length = 1), this.strip();
|
|
15259
15259
|
}, s.prototype.ishrn = function(g, m, f) {
|
|
15260
15260
|
return n(this.negative === 0), this.iushrn(g, m, f);
|
|
15261
15261
|
}, s.prototype.shln = function(g) {
|
|
@@ -15268,19 +15268,19 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15268
15268
|
return this.clone().iushrn(g);
|
|
15269
15269
|
}, s.prototype.testn = function(g) {
|
|
15270
15270
|
n(typeof g == "number" && g >= 0);
|
|
15271
|
-
var m = g % 26, f = (g - m) / 26,
|
|
15271
|
+
var m = g % 26, f = (g - m) / 26, d10 = 1 << m;
|
|
15272
15272
|
if (this.length <= f)
|
|
15273
15273
|
return false;
|
|
15274
15274
|
var S = this.words[f];
|
|
15275
|
-
return !!(S &
|
|
15275
|
+
return !!(S & d10);
|
|
15276
15276
|
}, s.prototype.imaskn = function(g) {
|
|
15277
15277
|
n(typeof g == "number" && g >= 0);
|
|
15278
15278
|
var m = g % 26, f = (g - m) / 26;
|
|
15279
15279
|
if (n(this.negative === 0, "imaskn works only with positive numbers"), this.length <= f)
|
|
15280
15280
|
return this;
|
|
15281
15281
|
if (m !== 0 && f++, this.length = Math.min(f, this.length), m !== 0) {
|
|
15282
|
-
var
|
|
15283
|
-
this.words[this.length - 1] &=
|
|
15282
|
+
var d10 = 67108863 ^ 67108863 >>> m << m;
|
|
15283
|
+
this.words[this.length - 1] &= d10;
|
|
15284
15284
|
}
|
|
15285
15285
|
return this.strip();
|
|
15286
15286
|
}, s.prototype.maskn = function(g) {
|
|
@@ -15312,13 +15312,13 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15312
15312
|
}, s.prototype.abs = function() {
|
|
15313
15313
|
return this.clone().iabs();
|
|
15314
15314
|
}, s.prototype._ishlnsubmul = function(g, m, f) {
|
|
15315
|
-
var
|
|
15316
|
-
this._expand(
|
|
15315
|
+
var d10 = g.length + f, S;
|
|
15316
|
+
this._expand(d10);
|
|
15317
15317
|
var _, x = 0;
|
|
15318
15318
|
for (S = 0; S < g.length; S++) {
|
|
15319
15319
|
_ = (this.words[S + f] | 0) + x;
|
|
15320
|
-
var
|
|
15321
|
-
_ -=
|
|
15320
|
+
var T = (g.words[S] | 0) * m;
|
|
15321
|
+
_ -= T & 67108863, x = (_ >> 26) - (T / 67108864 | 0), this.words[S + f] = _ & 67108863;
|
|
15322
15322
|
}
|
|
15323
15323
|
for (; S < this.length - f; S++)
|
|
15324
15324
|
_ = (this.words[S + f] | 0) + x, x = _ >> 26, this.words[S + f] = _ & 67108863;
|
|
@@ -15328,25 +15328,25 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15328
15328
|
_ = -(this.words[S] | 0) + x, x = _ >> 26, this.words[S] = _ & 67108863;
|
|
15329
15329
|
return this.negative = 1, this.strip();
|
|
15330
15330
|
}, s.prototype._wordDiv = function(g, m) {
|
|
15331
|
-
var f = this.length - g.length,
|
|
15332
|
-
f = 26 - x, f !== 0 && (S = S.ushln(f),
|
|
15333
|
-
var
|
|
15331
|
+
var f = this.length - g.length, d10 = this.clone(), S = g, _ = S.words[S.length - 1] | 0, x = this._countBits(_);
|
|
15332
|
+
f = 26 - x, f !== 0 && (S = S.ushln(f), d10.iushln(f), _ = S.words[S.length - 1] | 0);
|
|
15333
|
+
var T = d10.length - S.length, y;
|
|
15334
15334
|
if (m !== "mod") {
|
|
15335
|
-
y = new s(null), y.length =
|
|
15335
|
+
y = new s(null), y.length = T + 1, y.words = new Array(y.length);
|
|
15336
15336
|
for (var w = 0; w < y.length; w++)
|
|
15337
15337
|
y.words[w] = 0;
|
|
15338
15338
|
}
|
|
15339
|
-
var h =
|
|
15340
|
-
h.negative === 0 && (
|
|
15341
|
-
for (var R10 =
|
|
15342
|
-
var W = (
|
|
15343
|
-
for (W = Math.min(W / _ | 0, 67108863),
|
|
15344
|
-
W--,
|
|
15339
|
+
var h = d10.clone()._ishlnsubmul(S, 1, T);
|
|
15340
|
+
h.negative === 0 && (d10 = h, y && (y.words[T] = 1));
|
|
15341
|
+
for (var R10 = T - 1; R10 >= 0; R10--) {
|
|
15342
|
+
var W = (d10.words[S.length + R10] | 0) * 67108864 + (d10.words[S.length + R10 - 1] | 0);
|
|
15343
|
+
for (W = Math.min(W / _ | 0, 67108863), d10._ishlnsubmul(S, W, R10); d10.negative !== 0; )
|
|
15344
|
+
W--, d10.negative = 0, d10._ishlnsubmul(S, 1, R10), d10.isZero() || (d10.negative ^= 1);
|
|
15345
15345
|
y && (y.words[R10] = W);
|
|
15346
15346
|
}
|
|
15347
|
-
return y && y.strip(),
|
|
15347
|
+
return y && y.strip(), d10.strip(), m !== "div" && f !== 0 && d10.iushrn(f), {
|
|
15348
15348
|
div: y || null,
|
|
15349
|
-
mod:
|
|
15349
|
+
mod: d10
|
|
15350
15350
|
};
|
|
15351
15351
|
}, s.prototype.divmod = function(g, m, f) {
|
|
15352
15352
|
if (n(!g.isZero()), this.isZero())
|
|
@@ -15354,12 +15354,12 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15354
15354
|
div: new s(0),
|
|
15355
15355
|
mod: new s(0)
|
|
15356
15356
|
};
|
|
15357
|
-
var
|
|
15358
|
-
return this.negative !== 0 && g.negative === 0 ? (_ = this.neg().divmod(g, m), m !== "mod" && (
|
|
15359
|
-
div:
|
|
15357
|
+
var d10, S, _;
|
|
15358
|
+
return this.negative !== 0 && g.negative === 0 ? (_ = this.neg().divmod(g, m), m !== "mod" && (d10 = _.div.neg()), m !== "div" && (S = _.mod.neg(), f && S.negative !== 0 && S.iadd(g)), {
|
|
15359
|
+
div: d10,
|
|
15360
15360
|
mod: S
|
|
15361
|
-
}) : this.negative === 0 && g.negative !== 0 ? (_ = this.divmod(g.neg(), m), m !== "mod" && (
|
|
15362
|
-
div:
|
|
15361
|
+
}) : this.negative === 0 && g.negative !== 0 ? (_ = this.divmod(g.neg(), m), m !== "mod" && (d10 = _.div.neg()), {
|
|
15362
|
+
div: d10,
|
|
15363
15363
|
mod: _.mod
|
|
15364
15364
|
}) : this.negative & g.negative ? (_ = this.neg().divmod(g.neg(), m), m !== "div" && (S = _.mod.neg(), f && S.negative !== 0 && S.isub(g)), {
|
|
15365
15365
|
div: _.div,
|
|
@@ -15387,18 +15387,18 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15387
15387
|
var m = this.divmod(g);
|
|
15388
15388
|
if (m.mod.isZero())
|
|
15389
15389
|
return m.div;
|
|
15390
|
-
var f = m.div.negative !== 0 ? m.mod.isub(g) : m.mod,
|
|
15390
|
+
var f = m.div.negative !== 0 ? m.mod.isub(g) : m.mod, d10 = g.ushrn(1), S = g.andln(1), _ = f.cmp(d10);
|
|
15391
15391
|
return _ < 0 || S === 1 && _ === 0 ? m.div : m.div.negative !== 0 ? m.div.isubn(1) : m.div.iaddn(1);
|
|
15392
15392
|
}, s.prototype.modn = function(g) {
|
|
15393
15393
|
n(g <= 67108863);
|
|
15394
|
-
for (var m = (1 << 26) % g, f = 0,
|
|
15395
|
-
f = (m * f + (this.words[
|
|
15394
|
+
for (var m = (1 << 26) % g, f = 0, d10 = this.length - 1; d10 >= 0; d10--)
|
|
15395
|
+
f = (m * f + (this.words[d10] | 0)) % g;
|
|
15396
15396
|
return f;
|
|
15397
15397
|
}, s.prototype.idivn = function(g) {
|
|
15398
15398
|
n(g <= 67108863);
|
|
15399
15399
|
for (var m = 0, f = this.length - 1; f >= 0; f--) {
|
|
15400
|
-
var
|
|
15401
|
-
this.words[f] =
|
|
15400
|
+
var d10 = (this.words[f] | 0) + m * 67108864;
|
|
15401
|
+
this.words[f] = d10 / g | 0, m = d10 % g;
|
|
15402
15402
|
}
|
|
15403
15403
|
return this.strip();
|
|
15404
15404
|
}, s.prototype.divn = function(g) {
|
|
@@ -15407,45 +15407,45 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15407
15407
|
n(g.negative === 0), n(!g.isZero());
|
|
15408
15408
|
var m = this, f = g.clone();
|
|
15409
15409
|
m.negative !== 0 ? m = m.umod(g) : m = m.clone();
|
|
15410
|
-
for (var
|
|
15411
|
-
m.iushrn(1), f.iushrn(1), ++
|
|
15410
|
+
for (var d10 = new s(1), S = new s(0), _ = new s(0), x = new s(1), T = 0; m.isEven() && f.isEven(); )
|
|
15411
|
+
m.iushrn(1), f.iushrn(1), ++T;
|
|
15412
15412
|
for (var y = f.clone(), w = m.clone(); !m.isZero(); ) {
|
|
15413
15413
|
for (var h = 0, R10 = 1; !(m.words[0] & R10) && h < 26; ++h, R10 <<= 1)
|
|
15414
15414
|
;
|
|
15415
15415
|
if (h > 0)
|
|
15416
15416
|
for (m.iushrn(h); h-- > 0; )
|
|
15417
|
-
(
|
|
15417
|
+
(d10.isOdd() || S.isOdd()) && (d10.iadd(y), S.isub(w)), d10.iushrn(1), S.iushrn(1);
|
|
15418
15418
|
for (var W = 0, Q = 1; !(f.words[0] & Q) && W < 26; ++W, Q <<= 1)
|
|
15419
15419
|
;
|
|
15420
15420
|
if (W > 0)
|
|
15421
15421
|
for (f.iushrn(W); W-- > 0; )
|
|
15422
15422
|
(_.isOdd() || x.isOdd()) && (_.iadd(y), x.isub(w)), _.iushrn(1), x.iushrn(1);
|
|
15423
|
-
m.cmp(f) >= 0 ? (m.isub(f),
|
|
15423
|
+
m.cmp(f) >= 0 ? (m.isub(f), d10.isub(_), S.isub(x)) : (f.isub(m), _.isub(d10), x.isub(S));
|
|
15424
15424
|
}
|
|
15425
15425
|
return {
|
|
15426
15426
|
a: _,
|
|
15427
15427
|
b: x,
|
|
15428
|
-
gcd: f.iushln(
|
|
15428
|
+
gcd: f.iushln(T)
|
|
15429
15429
|
};
|
|
15430
15430
|
}, s.prototype._invmp = function(g) {
|
|
15431
15431
|
n(g.negative === 0), n(!g.isZero());
|
|
15432
15432
|
var m = this, f = g.clone();
|
|
15433
15433
|
m.negative !== 0 ? m = m.umod(g) : m = m.clone();
|
|
15434
|
-
for (var
|
|
15435
|
-
for (var x = 0,
|
|
15434
|
+
for (var d10 = new s(1), S = new s(0), _ = f.clone(); m.cmpn(1) > 0 && f.cmpn(1) > 0; ) {
|
|
15435
|
+
for (var x = 0, T = 1; !(m.words[0] & T) && x < 26; ++x, T <<= 1)
|
|
15436
15436
|
;
|
|
15437
15437
|
if (x > 0)
|
|
15438
15438
|
for (m.iushrn(x); x-- > 0; )
|
|
15439
|
-
|
|
15439
|
+
d10.isOdd() && d10.iadd(_), d10.iushrn(1);
|
|
15440
15440
|
for (var y = 0, w = 1; !(f.words[0] & w) && y < 26; ++y, w <<= 1)
|
|
15441
15441
|
;
|
|
15442
15442
|
if (y > 0)
|
|
15443
15443
|
for (f.iushrn(y); y-- > 0; )
|
|
15444
15444
|
S.isOdd() && S.iadd(_), S.iushrn(1);
|
|
15445
|
-
m.cmp(f) >= 0 ? (m.isub(f),
|
|
15445
|
+
m.cmp(f) >= 0 ? (m.isub(f), d10.isub(S)) : (f.isub(m), S.isub(d10));
|
|
15446
15446
|
}
|
|
15447
15447
|
var h;
|
|
15448
|
-
return m.cmpn(1) === 0 ? h =
|
|
15448
|
+
return m.cmpn(1) === 0 ? h = d10 : h = S, h.cmpn(0) < 0 && h.iadd(g), h;
|
|
15449
15449
|
}, s.prototype.gcd = function(g) {
|
|
15450
15450
|
if (this.isZero())
|
|
15451
15451
|
return g.abs();
|
|
@@ -15453,7 +15453,7 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15453
15453
|
return this.abs();
|
|
15454
15454
|
var m = this.clone(), f = g.clone();
|
|
15455
15455
|
m.negative = 0, f.negative = 0;
|
|
15456
|
-
for (var
|
|
15456
|
+
for (var d10 = 0; m.isEven() && f.isEven(); d10++)
|
|
15457
15457
|
m.iushrn(1), f.iushrn(1);
|
|
15458
15458
|
do {
|
|
15459
15459
|
for (; m.isEven(); )
|
|
@@ -15468,7 +15468,7 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15468
15468
|
break;
|
|
15469
15469
|
m.isub(f);
|
|
15470
15470
|
} while (true);
|
|
15471
|
-
return f.iushln(
|
|
15471
|
+
return f.iushln(d10);
|
|
15472
15472
|
}, s.prototype.invm = function(g) {
|
|
15473
15473
|
return this.egcd(g).a.umod(g);
|
|
15474
15474
|
}, s.prototype.isEven = function() {
|
|
@@ -15479,10 +15479,10 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15479
15479
|
return this.words[0] & g;
|
|
15480
15480
|
}, s.prototype.bincn = function(g) {
|
|
15481
15481
|
n(typeof g == "number");
|
|
15482
|
-
var m = g % 26, f = (g - m) / 26,
|
|
15482
|
+
var m = g % 26, f = (g - m) / 26, d10 = 1 << m;
|
|
15483
15483
|
if (this.length <= f)
|
|
15484
|
-
return this._expand(f + 1), this.words[f] |=
|
|
15485
|
-
for (var S =
|
|
15484
|
+
return this._expand(f + 1), this.words[f] |= d10, this;
|
|
15485
|
+
for (var S = d10, _ = f; S !== 0 && _ < this.length; _++) {
|
|
15486
15486
|
var x = this.words[_] | 0;
|
|
15487
15487
|
x += S, S = x >>> 26, x &= 67108863, this.words[_] = x;
|
|
15488
15488
|
}
|
|
@@ -15501,8 +15501,8 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15501
15501
|
f = 1;
|
|
15502
15502
|
else {
|
|
15503
15503
|
m && (g = -g), n(g <= 67108863, "Number is too big");
|
|
15504
|
-
var
|
|
15505
|
-
f =
|
|
15504
|
+
var d10 = this.words[0] | 0;
|
|
15505
|
+
f = d10 === g ? 0 : d10 < g ? -1 : 1;
|
|
15506
15506
|
}
|
|
15507
15507
|
return this.negative !== 0 ? -f | 0 : f;
|
|
15508
15508
|
}, s.prototype.cmp = function(g) {
|
|
@@ -15518,9 +15518,9 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15518
15518
|
if (this.length < g.length)
|
|
15519
15519
|
return -1;
|
|
15520
15520
|
for (var m = 0, f = this.length - 1; f >= 0; f--) {
|
|
15521
|
-
var
|
|
15522
|
-
if (
|
|
15523
|
-
|
|
15521
|
+
var d10 = this.words[f] | 0, S = g.words[f] | 0;
|
|
15522
|
+
if (d10 !== S) {
|
|
15523
|
+
d10 < S ? m = -1 : d10 > S && (m = 1);
|
|
15524
15524
|
break;
|
|
15525
15525
|
}
|
|
15526
15526
|
}
|
|
@@ -15588,8 +15588,8 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15588
15588
|
p192: null,
|
|
15589
15589
|
p25519: null
|
|
15590
15590
|
};
|
|
15591
|
-
function K(
|
|
15592
|
-
this.name =
|
|
15591
|
+
function K(L6, g) {
|
|
15592
|
+
this.name = L6, this.p = new s(g, 16), this.n = this.p.bitLength(), this.k = new s(1).iushln(this.n).isub(this.p), this.tmp = this._tmp();
|
|
15593
15593
|
}
|
|
15594
15594
|
K.prototype._tmp = function() {
|
|
15595
15595
|
var g = new s(null);
|
|
@@ -15599,8 +15599,8 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15599
15599
|
do
|
|
15600
15600
|
this.split(m, this.tmp), m = this.imulK(m), m = m.iadd(this.tmp), f = m.bitLength();
|
|
15601
15601
|
while (f > this.n);
|
|
15602
|
-
var
|
|
15603
|
-
return
|
|
15602
|
+
var d10 = f < this.n ? -1 : m.ucmp(this.p);
|
|
15603
|
+
return d10 === 0 ? (m.words[0] = 0, m.length = 1) : d10 > 0 ? m.isub(this.p) : m.strip !== void 0 ? m.strip() : m._strip(), m;
|
|
15604
15604
|
}, K.prototype.split = function(g, m) {
|
|
15605
15605
|
g.iushrn(this.n, 0, m);
|
|
15606
15606
|
}, K.prototype.imulK = function(g) {
|
|
@@ -15614,9 +15614,9 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15614
15614
|
);
|
|
15615
15615
|
}
|
|
15616
15616
|
i10(X, K), X.prototype.split = function(g, m) {
|
|
15617
|
-
for (var f = 4194303,
|
|
15617
|
+
for (var f = 4194303, d10 = Math.min(g.length, 9), S = 0; S < d10; S++)
|
|
15618
15618
|
m.words[S] = g.words[S];
|
|
15619
|
-
if (m.length =
|
|
15619
|
+
if (m.length = d10, g.length <= 9) {
|
|
15620
15620
|
g.words[0] = 0, g.length = 1;
|
|
15621
15621
|
return;
|
|
15622
15622
|
}
|
|
@@ -15629,8 +15629,8 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15629
15629
|
}, X.prototype.imulK = function(g) {
|
|
15630
15630
|
g.words[g.length] = 0, g.words[g.length + 1] = 0, g.length += 2;
|
|
15631
15631
|
for (var m = 0, f = 0; f < g.length; f++) {
|
|
15632
|
-
var
|
|
15633
|
-
m +=
|
|
15632
|
+
var d10 = g.words[f] | 0;
|
|
15633
|
+
m += d10 * 977, g.words[f] = m & 67108863, m = d10 * 64 + (m / 67108864 | 0);
|
|
15634
15634
|
}
|
|
15635
15635
|
return g.words[g.length - 1] === 0 && (g.length--, g.words[g.length - 1] === 0 && g.length--), g;
|
|
15636
15636
|
};
|
|
@@ -15659,8 +15659,8 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15659
15659
|
}
|
|
15660
15660
|
i10(ne, K), ne.prototype.imulK = function(g) {
|
|
15661
15661
|
for (var m = 0, f = 0; f < g.length; f++) {
|
|
15662
|
-
var
|
|
15663
|
-
|
|
15662
|
+
var d10 = (g.words[f] | 0) * 19 + m, S = d10 & 67108863;
|
|
15663
|
+
d10 >>>= 26, g.words[f] = S, m = d10;
|
|
15664
15664
|
}
|
|
15665
15665
|
return m !== 0 && (g.words[g.length++] = m), g;
|
|
15666
15666
|
}, s._prime = function(g) {
|
|
@@ -15679,12 +15679,12 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15679
15679
|
throw new Error("Unknown prime " + g);
|
|
15680
15680
|
return k[g] = m, m;
|
|
15681
15681
|
};
|
|
15682
|
-
function se(
|
|
15683
|
-
if (typeof
|
|
15684
|
-
var g = s._prime(
|
|
15682
|
+
function se(L6) {
|
|
15683
|
+
if (typeof L6 == "string") {
|
|
15684
|
+
var g = s._prime(L6);
|
|
15685
15685
|
this.m = g.p, this.prime = g;
|
|
15686
15686
|
} else
|
|
15687
|
-
n(
|
|
15687
|
+
n(L6.gtn(1), "modulus must be greater than 1"), this.m = L6, this.prime = null;
|
|
15688
15688
|
}
|
|
15689
15689
|
se.prototype._verify1 = function(g) {
|
|
15690
15690
|
n(g.negative === 0, "red works only with positives"), n(g.red, "red works only with red numbers");
|
|
@@ -15731,13 +15731,13 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15731
15731
|
var f = this.m.add(new s(1)).iushrn(2);
|
|
15732
15732
|
return this.pow(g, f);
|
|
15733
15733
|
}
|
|
15734
|
-
for (var
|
|
15735
|
-
S++,
|
|
15736
|
-
n(!
|
|
15737
|
-
var _ = new s(1).toRed(this), x = _.redNeg(),
|
|
15738
|
-
for (y = new s(2 * y * y).toRed(this); this.pow(y,
|
|
15734
|
+
for (var d10 = this.m.subn(1), S = 0; !d10.isZero() && d10.andln(1) === 0; )
|
|
15735
|
+
S++, d10.iushrn(1);
|
|
15736
|
+
n(!d10.isZero());
|
|
15737
|
+
var _ = new s(1).toRed(this), x = _.redNeg(), T = this.m.subn(1).iushrn(1), y = this.m.bitLength();
|
|
15738
|
+
for (y = new s(2 * y * y).toRed(this); this.pow(y, T).cmp(x) !== 0; )
|
|
15739
15739
|
y.redIAdd(x);
|
|
15740
|
-
for (var w = this.pow(y,
|
|
15740
|
+
for (var w = this.pow(y, d10), h = this.pow(g, d10.addn(1).iushrn(1)), R10 = this.pow(g, d10), W = S; R10.cmp(_) !== 0; ) {
|
|
15741
15741
|
for (var Q = R10, U = 0; Q.cmp(_) !== 0; U++)
|
|
15742
15742
|
Q = Q.redSqr();
|
|
15743
15743
|
n(U < W);
|
|
@@ -15753,19 +15753,19 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15753
15753
|
return new s(1).toRed(this);
|
|
15754
15754
|
if (m.cmpn(1) === 0)
|
|
15755
15755
|
return g.clone();
|
|
15756
|
-
var f = 4,
|
|
15757
|
-
|
|
15758
|
-
for (var S = 2; S <
|
|
15759
|
-
|
|
15760
|
-
var _ =
|
|
15756
|
+
var f = 4, d10 = new Array(1 << f);
|
|
15757
|
+
d10[0] = new s(1).toRed(this), d10[1] = g;
|
|
15758
|
+
for (var S = 2; S < d10.length; S++)
|
|
15759
|
+
d10[S] = this.mul(d10[S - 1], g);
|
|
15760
|
+
var _ = d10[0], x = 0, T = 0, y = m.bitLength() % 26;
|
|
15761
15761
|
for (y === 0 && (y = 26), S = m.length - 1; S >= 0; S--) {
|
|
15762
15762
|
for (var w = m.words[S], h = y - 1; h >= 0; h--) {
|
|
15763
15763
|
var R10 = w >> h & 1;
|
|
15764
|
-
if (_ !==
|
|
15765
|
-
|
|
15764
|
+
if (_ !== d10[0] && (_ = this.sqr(_)), R10 === 0 && x === 0) {
|
|
15765
|
+
T = 0;
|
|
15766
15766
|
continue;
|
|
15767
15767
|
}
|
|
15768
|
-
x <<= 1, x |= R10,
|
|
15768
|
+
x <<= 1, x |= R10, T++, !(T !== f && (S !== 0 || h !== 0)) && (_ = this.mul(_, d10[x]), T = 0, x = 0);
|
|
15769
15769
|
}
|
|
15770
15770
|
y = 26;
|
|
15771
15771
|
}
|
|
@@ -15779,8 +15779,8 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15779
15779
|
}, s.mont = function(g) {
|
|
15780
15780
|
return new ve(g);
|
|
15781
15781
|
};
|
|
15782
|
-
function ve(
|
|
15783
|
-
se.call(this,
|
|
15782
|
+
function ve(L6) {
|
|
15783
|
+
se.call(this, L6), this.shift = this.m.bitLength(), this.shift % 26 !== 0 && (this.shift += 26 - this.shift % 26), this.r = new s(1).iushln(this.shift), this.r2 = this.imod(this.r.sqr()), this.rinv = this.r._invmp(this.m), this.minv = this.rinv.mul(this.r).isubn(1).div(this.m), this.minv = this.minv.umod(this.r), this.minv = this.r.sub(this.minv);
|
|
15784
15784
|
}
|
|
15785
15785
|
i10(ve, se), ve.prototype.convertTo = function(g) {
|
|
15786
15786
|
return this.imod(g.ushln(this.shift));
|
|
@@ -15790,12 +15790,12 @@ var Co = {}, v0 = { exports: {} };
|
|
|
15790
15790
|
}, ve.prototype.imul = function(g, m) {
|
|
15791
15791
|
if (g.isZero() || m.isZero())
|
|
15792
15792
|
return g.words[0] = 0, g.length = 1, g;
|
|
15793
|
-
var f = g.imul(m),
|
|
15793
|
+
var f = g.imul(m), d10 = f.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), S = f.isub(d10).iushrn(this.shift), _ = S;
|
|
15794
15794
|
return S.cmp(this.m) >= 0 ? _ = S.isub(this.m) : S.cmpn(0) < 0 && (_ = S.iadd(this.m)), _._forceRed(this);
|
|
15795
15795
|
}, ve.prototype.mul = function(g, m) {
|
|
15796
15796
|
if (g.isZero() || m.isZero())
|
|
15797
15797
|
return new s(0)._forceRed(this);
|
|
15798
|
-
var f = g.mul(m),
|
|
15798
|
+
var f = g.mul(m), d10 = f.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), S = f.isub(d10).iushrn(this.shift), _ = S;
|
|
15799
15799
|
return S.cmp(this.m) >= 0 ? _ = S.isub(this.m) : S.cmpn(0) < 0 && (_ = S.iadd(this.m)), _._forceRed(this);
|
|
15800
15800
|
}, ve.prototype.invm = function(g) {
|
|
15801
15801
|
var m = this.imod(g._invmp(this.m).mul(this.r2));
|
|
@@ -15870,15 +15870,15 @@ function yv() {
|
|
|
15870
15870
|
s || (s = Math.max(1, a / 48 | 0));
|
|
15871
15871
|
for (var b = i10.subn(1), O = 0; !b.testn(O); O++)
|
|
15872
15872
|
;
|
|
15873
|
-
for (var M = i10.shrn(O),
|
|
15873
|
+
for (var M = i10.shrn(O), D = b.toRed(u), F = true; s > 0; s--) {
|
|
15874
15874
|
var $6 = this._randrange(new e10(2), b);
|
|
15875
15875
|
o && o($6);
|
|
15876
15876
|
var J = $6.toRed(u).redPow(M);
|
|
15877
|
-
if (!(J.cmp(l) === 0 || J.cmp(
|
|
15877
|
+
if (!(J.cmp(l) === 0 || J.cmp(D) === 0)) {
|
|
15878
15878
|
for (var C = 1; C < O; C++) {
|
|
15879
15879
|
if (J = J.redSqr(), J.cmp(l) === 0)
|
|
15880
15880
|
return false;
|
|
15881
|
-
if (J.cmp(
|
|
15881
|
+
if (J.cmp(D) === 0)
|
|
15882
15882
|
break;
|
|
15883
15883
|
}
|
|
15884
15884
|
if (C === O)
|
|
@@ -15892,10 +15892,10 @@ function yv() {
|
|
|
15892
15892
|
for (var l = i10.subn(1), b = 0; !l.testn(b); b++)
|
|
15893
15893
|
;
|
|
15894
15894
|
for (var O = i10.shrn(b), M = l.toRed(a); s > 0; s--) {
|
|
15895
|
-
var
|
|
15895
|
+
var D = this._randrange(new e10(2), l), F = i10.gcd(D);
|
|
15896
15896
|
if (F.cmpn(1) !== 0)
|
|
15897
15897
|
return F;
|
|
15898
|
-
var $6 =
|
|
15898
|
+
var $6 = D.toRed(a).redPow(O);
|
|
15899
15899
|
if (!($6.cmp(u) === 0 || $6.cmp(M) === 0)) {
|
|
15900
15900
|
for (var J = 1; J < b; J++) {
|
|
15901
15901
|
if ($6 = $6.redSqr(), $6.cmp(u) === 0)
|
|
@@ -15924,7 +15924,7 @@ function gv() {
|
|
|
15924
15924
|
var b = new t(11), O = new t(4);
|
|
15925
15925
|
new t(12);
|
|
15926
15926
|
var M = null;
|
|
15927
|
-
function
|
|
15927
|
+
function D() {
|
|
15928
15928
|
if (M !== null)
|
|
15929
15929
|
return M;
|
|
15930
15930
|
var C = 1048576, P = [];
|
|
@@ -15937,7 +15937,7 @@ function gv() {
|
|
|
15937
15937
|
return M = P, P;
|
|
15938
15938
|
}
|
|
15939
15939
|
function F(C) {
|
|
15940
|
-
for (var P =
|
|
15940
|
+
for (var P = D(), k = 0; k < P.length; k++)
|
|
15941
15941
|
if (C.modn(P[k]) === 0)
|
|
15942
15942
|
return C.cmpn(P[k]) === 0;
|
|
15943
15943
|
return true;
|
|
@@ -16014,7 +16014,7 @@ function qD() {
|
|
|
16014
16014
|
return C = C || "utf8", de.Buffer.isBuffer(J) || (J = new de.Buffer(J, C)), this._priv = new e10(J), this;
|
|
16015
16015
|
}
|
|
16016
16016
|
var M = {};
|
|
16017
|
-
function
|
|
16017
|
+
function D(J, C) {
|
|
16018
16018
|
var P = C.toString("hex"), k = [P, J.toString(16)].join("_");
|
|
16019
16019
|
if (k in M)
|
|
16020
16020
|
return M[k];
|
|
@@ -16041,7 +16041,7 @@ function qD() {
|
|
|
16041
16041
|
Object.defineProperty(F.prototype, "verifyError", {
|
|
16042
16042
|
enumerable: true,
|
|
16043
16043
|
get: function() {
|
|
16044
|
-
return typeof this._primeCode != "number" && (this._primeCode =
|
|
16044
|
+
return typeof this._primeCode != "number" && (this._primeCode = D(this.__prime, this.__gen)), this._primeCode;
|
|
16045
16045
|
}
|
|
16046
16046
|
}), F.prototype.generateKeys = function() {
|
|
16047
16047
|
return this._priv || (this._priv = new e10(l(this._primeLen))), this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed(), this.getPublicKey();
|
|
@@ -16099,14 +16099,14 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16099
16099
|
}
|
|
16100
16100
|
function i10(m, f) {
|
|
16101
16101
|
m.super_ = f;
|
|
16102
|
-
var
|
|
16102
|
+
var d10 = function() {
|
|
16103
16103
|
};
|
|
16104
|
-
|
|
16104
|
+
d10.prototype = f.prototype, m.prototype = new d10(), m.prototype.constructor = m;
|
|
16105
16105
|
}
|
|
16106
|
-
function s(m, f,
|
|
16106
|
+
function s(m, f, d10) {
|
|
16107
16107
|
if (s.isBN(m))
|
|
16108
16108
|
return m;
|
|
16109
|
-
this.negative = 0, this.words = null, this.length = 0, this.red = null, m !== null && ((f === "le" || f === "be") && (
|
|
16109
|
+
this.negative = 0, this.words = null, this.length = 0, this.red = null, m !== null && ((f === "le" || f === "be") && (d10 = f, f = 10), this._init(m || 0, f || 10, d10 || "be"));
|
|
16110
16110
|
}
|
|
16111
16111
|
typeof t == "object" ? t.exports = s : r.BN = s, s.BN = s, s.wordSize = 26;
|
|
16112
16112
|
var o;
|
|
@@ -16116,19 +16116,19 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16116
16116
|
}
|
|
16117
16117
|
s.isBN = function(f) {
|
|
16118
16118
|
return f instanceof s ? true : f !== null && typeof f == "object" && f.constructor.wordSize === s.wordSize && Array.isArray(f.words);
|
|
16119
|
-
}, s.max = function(f,
|
|
16120
|
-
return f.cmp(
|
|
16121
|
-
}, s.min = function(f,
|
|
16122
|
-
return f.cmp(
|
|
16123
|
-
}, s.prototype._init = function(f,
|
|
16119
|
+
}, s.max = function(f, d10) {
|
|
16120
|
+
return f.cmp(d10) > 0 ? f : d10;
|
|
16121
|
+
}, s.min = function(f, d10) {
|
|
16122
|
+
return f.cmp(d10) < 0 ? f : d10;
|
|
16123
|
+
}, s.prototype._init = function(f, d10, S) {
|
|
16124
16124
|
if (typeof f == "number")
|
|
16125
|
-
return this._initNumber(f,
|
|
16125
|
+
return this._initNumber(f, d10, S);
|
|
16126
16126
|
if (typeof f == "object")
|
|
16127
|
-
return this._initArray(f,
|
|
16128
|
-
|
|
16127
|
+
return this._initArray(f, d10, S);
|
|
16128
|
+
d10 === "hex" && (d10 = 16), n(d10 === (d10 | 0) && d10 >= 2 && d10 <= 36), f = f.toString().replace(/\s+/g, "");
|
|
16129
16129
|
var _ = 0;
|
|
16130
|
-
f[0] === "-" && (_++, this.negative = 1), _ < f.length && (
|
|
16131
|
-
}, s.prototype._initNumber = function(f,
|
|
16130
|
+
f[0] === "-" && (_++, this.negative = 1), _ < f.length && (d10 === 16 ? this._parseHex(f, _, S) : (this._parseBase(f, d10, _), S === "le" && this._initArray(this.toArray(), d10, S)));
|
|
16131
|
+
}, s.prototype._initNumber = function(f, d10, S) {
|
|
16132
16132
|
f < 0 && (this.negative = 1, f = -f), f < 67108864 ? (this.words = [f & 67108863], this.length = 1) : f < 4503599627370496 ? (this.words = [
|
|
16133
16133
|
f & 67108863,
|
|
16134
16134
|
f / 67108864 & 67108863
|
|
@@ -16136,76 +16136,76 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16136
16136
|
f & 67108863,
|
|
16137
16137
|
f / 67108864 & 67108863,
|
|
16138
16138
|
1
|
|
16139
|
-
], this.length = 3), S === "le" && this._initArray(this.toArray(),
|
|
16140
|
-
}, s.prototype._initArray = function(f,
|
|
16139
|
+
], this.length = 3), S === "le" && this._initArray(this.toArray(), d10, S);
|
|
16140
|
+
}, s.prototype._initArray = function(f, d10, S) {
|
|
16141
16141
|
if (n(typeof f.length == "number"), f.length <= 0)
|
|
16142
16142
|
return this.words = [0], this.length = 1, this;
|
|
16143
16143
|
this.length = Math.ceil(f.length / 3), this.words = new Array(this.length);
|
|
16144
16144
|
for (var _ = 0; _ < this.length; _++)
|
|
16145
16145
|
this.words[_] = 0;
|
|
16146
|
-
var x,
|
|
16146
|
+
var x, T, y = 0;
|
|
16147
16147
|
if (S === "be")
|
|
16148
16148
|
for (_ = f.length - 1, x = 0; _ >= 0; _ -= 3)
|
|
16149
|
-
|
|
16149
|
+
T = f[_] | f[_ - 1] << 8 | f[_ - 2] << 16, this.words[x] |= T << y & 67108863, this.words[x + 1] = T >>> 26 - y & 67108863, y += 24, y >= 26 && (y -= 26, x++);
|
|
16150
16150
|
else if (S === "le")
|
|
16151
16151
|
for (_ = 0, x = 0; _ < f.length; _ += 3)
|
|
16152
|
-
|
|
16152
|
+
T = f[_] | f[_ + 1] << 8 | f[_ + 2] << 16, this.words[x] |= T << y & 67108863, this.words[x + 1] = T >>> 26 - y & 67108863, y += 24, y >= 26 && (y -= 26, x++);
|
|
16153
16153
|
return this._strip();
|
|
16154
16154
|
};
|
|
16155
16155
|
function a(m, f) {
|
|
16156
|
-
var
|
|
16157
|
-
if (
|
|
16158
|
-
return
|
|
16159
|
-
if (
|
|
16160
|
-
return
|
|
16161
|
-
if (
|
|
16162
|
-
return
|
|
16156
|
+
var d10 = m.charCodeAt(f);
|
|
16157
|
+
if (d10 >= 48 && d10 <= 57)
|
|
16158
|
+
return d10 - 48;
|
|
16159
|
+
if (d10 >= 65 && d10 <= 70)
|
|
16160
|
+
return d10 - 55;
|
|
16161
|
+
if (d10 >= 97 && d10 <= 102)
|
|
16162
|
+
return d10 - 87;
|
|
16163
16163
|
n(false, "Invalid character in " + m);
|
|
16164
16164
|
}
|
|
16165
|
-
function u(m, f,
|
|
16166
|
-
var S = a(m,
|
|
16167
|
-
return
|
|
16165
|
+
function u(m, f, d10) {
|
|
16166
|
+
var S = a(m, d10);
|
|
16167
|
+
return d10 - 1 >= f && (S |= a(m, d10 - 1) << 4), S;
|
|
16168
16168
|
}
|
|
16169
|
-
s.prototype._parseHex = function(f,
|
|
16170
|
-
this.length = Math.ceil((f.length -
|
|
16169
|
+
s.prototype._parseHex = function(f, d10, S) {
|
|
16170
|
+
this.length = Math.ceil((f.length - d10) / 6), this.words = new Array(this.length);
|
|
16171
16171
|
for (var _ = 0; _ < this.length; _++)
|
|
16172
16172
|
this.words[_] = 0;
|
|
16173
|
-
var x = 0,
|
|
16173
|
+
var x = 0, T = 0, y;
|
|
16174
16174
|
if (S === "be")
|
|
16175
|
-
for (_ = f.length - 1; _ >=
|
|
16176
|
-
y = u(f,
|
|
16175
|
+
for (_ = f.length - 1; _ >= d10; _ -= 2)
|
|
16176
|
+
y = u(f, d10, _) << x, this.words[T] |= y & 67108863, x >= 18 ? (x -= 18, T += 1, this.words[T] |= y >>> 26) : x += 8;
|
|
16177
16177
|
else {
|
|
16178
|
-
var w = f.length -
|
|
16179
|
-
for (_ = w % 2 === 0 ?
|
|
16180
|
-
y = u(f,
|
|
16178
|
+
var w = f.length - d10;
|
|
16179
|
+
for (_ = w % 2 === 0 ? d10 + 1 : d10; _ < f.length; _ += 2)
|
|
16180
|
+
y = u(f, d10, _) << x, this.words[T] |= y & 67108863, x >= 18 ? (x -= 18, T += 1, this.words[T] |= y >>> 26) : x += 8;
|
|
16181
16181
|
}
|
|
16182
16182
|
this._strip();
|
|
16183
16183
|
};
|
|
16184
|
-
function l(m, f,
|
|
16185
|
-
for (var _ = 0, x = 0,
|
|
16184
|
+
function l(m, f, d10, S) {
|
|
16185
|
+
for (var _ = 0, x = 0, T = Math.min(m.length, d10), y = f; y < T; y++) {
|
|
16186
16186
|
var w = m.charCodeAt(y) - 48;
|
|
16187
16187
|
_ *= S, w >= 49 ? x = w - 49 + 10 : w >= 17 ? x = w - 17 + 10 : x = w, n(w >= 0 && x < S, "Invalid character"), _ += x;
|
|
16188
16188
|
}
|
|
16189
16189
|
return _;
|
|
16190
16190
|
}
|
|
16191
|
-
s.prototype._parseBase = function(f,
|
|
16191
|
+
s.prototype._parseBase = function(f, d10, S) {
|
|
16192
16192
|
this.words = [0], this.length = 1;
|
|
16193
|
-
for (var _ = 0, x = 1; x <= 67108863; x *=
|
|
16193
|
+
for (var _ = 0, x = 1; x <= 67108863; x *= d10)
|
|
16194
16194
|
_++;
|
|
16195
|
-
_--, x = x /
|
|
16196
|
-
for (var
|
|
16197
|
-
h = l(f, R10, R10 + _,
|
|
16195
|
+
_--, x = x / d10 | 0;
|
|
16196
|
+
for (var T = f.length - S, y = T % _, w = Math.min(T, T - y) + S, h = 0, R10 = S; R10 < w; R10 += _)
|
|
16197
|
+
h = l(f, R10, R10 + _, d10), this.imuln(x), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
|
|
16198
16198
|
if (y !== 0) {
|
|
16199
16199
|
var W = 1;
|
|
16200
|
-
for (h = l(f, R10, f.length,
|
|
16201
|
-
W *=
|
|
16200
|
+
for (h = l(f, R10, f.length, d10), R10 = 0; R10 < y; R10++)
|
|
16201
|
+
W *= d10;
|
|
16202
16202
|
this.imuln(W), this.words[0] + h < 67108864 ? this.words[0] += h : this._iaddn(h);
|
|
16203
16203
|
}
|
|
16204
16204
|
this._strip();
|
|
16205
16205
|
}, s.prototype.copy = function(f) {
|
|
16206
16206
|
f.words = new Array(this.length);
|
|
16207
|
-
for (var
|
|
16208
|
-
f.words[
|
|
16207
|
+
for (var d10 = 0; d10 < this.length; d10++)
|
|
16208
|
+
f.words[d10] = this.words[d10];
|
|
16209
16209
|
f.length = this.length, f.negative = this.negative, f.red = this.red;
|
|
16210
16210
|
};
|
|
16211
16211
|
function b(m, f) {
|
|
@@ -16264,7 +16264,7 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16264
16264
|
"00000000000000000000000",
|
|
16265
16265
|
"000000000000000000000000",
|
|
16266
16266
|
"0000000000000000000000000"
|
|
16267
|
-
],
|
|
16267
|
+
], D = [
|
|
16268
16268
|
0,
|
|
16269
16269
|
0,
|
|
16270
16270
|
25,
|
|
@@ -16341,28 +16341,28 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16341
16341
|
52521875,
|
|
16342
16342
|
60466176
|
|
16343
16343
|
];
|
|
16344
|
-
s.prototype.toString = function(f,
|
|
16345
|
-
f = f || 10,
|
|
16344
|
+
s.prototype.toString = function(f, d10) {
|
|
16345
|
+
f = f || 10, d10 = d10 | 0 || 1;
|
|
16346
16346
|
var S;
|
|
16347
16347
|
if (f === 16 || f === "hex") {
|
|
16348
16348
|
S = "";
|
|
16349
|
-
for (var _ = 0, x = 0,
|
|
16350
|
-
var y = this.words[
|
|
16351
|
-
x = y >>> 24 - _ & 16777215, _ += 2, _ >= 26 && (_ -= 26,
|
|
16349
|
+
for (var _ = 0, x = 0, T = 0; T < this.length; T++) {
|
|
16350
|
+
var y = this.words[T], w = ((y << _ | x) & 16777215).toString(16);
|
|
16351
|
+
x = y >>> 24 - _ & 16777215, _ += 2, _ >= 26 && (_ -= 26, T--), x !== 0 || T !== this.length - 1 ? S = M[6 - w.length] + w + S : S = w + S;
|
|
16352
16352
|
}
|
|
16353
|
-
for (x !== 0 && (S = x.toString(16) + S); S.length %
|
|
16353
|
+
for (x !== 0 && (S = x.toString(16) + S); S.length % d10 !== 0; )
|
|
16354
16354
|
S = "0" + S;
|
|
16355
16355
|
return this.negative !== 0 && (S = "-" + S), S;
|
|
16356
16356
|
}
|
|
16357
16357
|
if (f === (f | 0) && f >= 2 && f <= 36) {
|
|
16358
|
-
var h =
|
|
16358
|
+
var h = D[f], R10 = F[f];
|
|
16359
16359
|
S = "";
|
|
16360
16360
|
var W = this.clone();
|
|
16361
16361
|
for (W.negative = 0; !W.isZero(); ) {
|
|
16362
16362
|
var Q = W.modrn(R10).toString(f);
|
|
16363
16363
|
W = W.idivn(R10), W.isZero() ? S = Q + S : S = M[h - Q.length] + Q + S;
|
|
16364
16364
|
}
|
|
16365
|
-
for (this.isZero() && (S = "0" + S); S.length %
|
|
16365
|
+
for (this.isZero() && (S = "0" + S); S.length % d10 !== 0; )
|
|
16366
16366
|
S = "0" + S;
|
|
16367
16367
|
return this.negative !== 0 && (S = "-" + S), S;
|
|
16368
16368
|
}
|
|
@@ -16372,32 +16372,32 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16372
16372
|
return this.length === 2 ? f += this.words[1] * 67108864 : this.length === 3 && this.words[2] === 1 ? f += 4503599627370496 + this.words[1] * 67108864 : this.length > 2 && n(false, "Number can only safely store up to 53 bits"), this.negative !== 0 ? -f : f;
|
|
16373
16373
|
}, s.prototype.toJSON = function() {
|
|
16374
16374
|
return this.toString(16, 2);
|
|
16375
|
-
}, o && (s.prototype.toBuffer = function(f,
|
|
16376
|
-
return this.toArrayLike(o, f,
|
|
16377
|
-
}), s.prototype.toArray = function(f,
|
|
16378
|
-
return this.toArrayLike(Array, f,
|
|
16375
|
+
}, o && (s.prototype.toBuffer = function(f, d10) {
|
|
16376
|
+
return this.toArrayLike(o, f, d10);
|
|
16377
|
+
}), s.prototype.toArray = function(f, d10) {
|
|
16378
|
+
return this.toArrayLike(Array, f, d10);
|
|
16379
16379
|
};
|
|
16380
|
-
var $6 = function(f,
|
|
16381
|
-
return f.allocUnsafe ? f.allocUnsafe(
|
|
16380
|
+
var $6 = function(f, d10) {
|
|
16381
|
+
return f.allocUnsafe ? f.allocUnsafe(d10) : new f(d10);
|
|
16382
16382
|
};
|
|
16383
|
-
s.prototype.toArrayLike = function(f,
|
|
16383
|
+
s.prototype.toArrayLike = function(f, d10, S) {
|
|
16384
16384
|
this._strip();
|
|
16385
16385
|
var _ = this.byteLength(), x = S || Math.max(1, _);
|
|
16386
16386
|
n(_ <= x, "byte array longer than desired length"), n(x > 0, "Requested array length <= 0");
|
|
16387
|
-
var
|
|
16388
|
-
return this["_toArrayLike" + y](
|
|
16389
|
-
}, s.prototype._toArrayLikeLE = function(f,
|
|
16390
|
-
for (var S = 0, _ = 0, x = 0,
|
|
16391
|
-
var y = this.words[x] <<
|
|
16392
|
-
f[S++] = y & 255, S < f.length && (f[S++] = y >> 8 & 255), S < f.length && (f[S++] = y >> 16 & 255),
|
|
16387
|
+
var T = $6(f, x), y = d10 === "le" ? "LE" : "BE";
|
|
16388
|
+
return this["_toArrayLike" + y](T, _), T;
|
|
16389
|
+
}, s.prototype._toArrayLikeLE = function(f, d10) {
|
|
16390
|
+
for (var S = 0, _ = 0, x = 0, T = 0; x < this.length; x++) {
|
|
16391
|
+
var y = this.words[x] << T | _;
|
|
16392
|
+
f[S++] = y & 255, S < f.length && (f[S++] = y >> 8 & 255), S < f.length && (f[S++] = y >> 16 & 255), T === 6 ? (S < f.length && (f[S++] = y >> 24 & 255), _ = 0, T = 0) : (_ = y >>> 24, T += 2);
|
|
16393
16393
|
}
|
|
16394
16394
|
if (S < f.length)
|
|
16395
16395
|
for (f[S++] = _; S < f.length; )
|
|
16396
16396
|
f[S++] = 0;
|
|
16397
|
-
}, s.prototype._toArrayLikeBE = function(f,
|
|
16398
|
-
for (var S = f.length - 1, _ = 0, x = 0,
|
|
16399
|
-
var y = this.words[x] <<
|
|
16400
|
-
f[S--] = y & 255, S >= 0 && (f[S--] = y >> 8 & 255), S >= 0 && (f[S--] = y >> 16 & 255),
|
|
16397
|
+
}, s.prototype._toArrayLikeBE = function(f, d10) {
|
|
16398
|
+
for (var S = f.length - 1, _ = 0, x = 0, T = 0; x < this.length; x++) {
|
|
16399
|
+
var y = this.words[x] << T | _;
|
|
16400
|
+
f[S--] = y & 255, S >= 0 && (f[S--] = y >> 8 & 255), S >= 0 && (f[S--] = y >> 16 & 255), T === 6 ? (S >= 0 && (f[S--] = y >> 24 & 255), _ = 0, T = 0) : (_ = y >>> 24, T += 2);
|
|
16401
16401
|
}
|
|
16402
16402
|
if (S >= 0)
|
|
16403
16403
|
for (f[S--] = _; S >= 0; )
|
|
@@ -16405,29 +16405,29 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16405
16405
|
}, Math.clz32 ? s.prototype._countBits = function(f) {
|
|
16406
16406
|
return 32 - Math.clz32(f);
|
|
16407
16407
|
} : s.prototype._countBits = function(f) {
|
|
16408
|
-
var
|
|
16409
|
-
return
|
|
16408
|
+
var d10 = f, S = 0;
|
|
16409
|
+
return d10 >= 4096 && (S += 13, d10 >>>= 13), d10 >= 64 && (S += 7, d10 >>>= 7), d10 >= 8 && (S += 4, d10 >>>= 4), d10 >= 2 && (S += 2, d10 >>>= 2), S + d10;
|
|
16410
16410
|
}, s.prototype._zeroBits = function(f) {
|
|
16411
16411
|
if (f === 0)
|
|
16412
16412
|
return 26;
|
|
16413
|
-
var
|
|
16414
|
-
return
|
|
16413
|
+
var d10 = f, S = 0;
|
|
16414
|
+
return d10 & 8191 || (S += 13, d10 >>>= 13), d10 & 127 || (S += 7, d10 >>>= 7), d10 & 15 || (S += 4, d10 >>>= 4), d10 & 3 || (S += 2, d10 >>>= 2), d10 & 1 || S++, S;
|
|
16415
16415
|
}, s.prototype.bitLength = function() {
|
|
16416
|
-
var f = this.words[this.length - 1],
|
|
16417
|
-
return (this.length - 1) * 26 +
|
|
16416
|
+
var f = this.words[this.length - 1], d10 = this._countBits(f);
|
|
16417
|
+
return (this.length - 1) * 26 + d10;
|
|
16418
16418
|
};
|
|
16419
16419
|
function J(m) {
|
|
16420
|
-
for (var f = new Array(m.bitLength()),
|
|
16421
|
-
var S =
|
|
16422
|
-
f[
|
|
16420
|
+
for (var f = new Array(m.bitLength()), d10 = 0; d10 < f.length; d10++) {
|
|
16421
|
+
var S = d10 / 26 | 0, _ = d10 % 26;
|
|
16422
|
+
f[d10] = m.words[S] >>> _ & 1;
|
|
16423
16423
|
}
|
|
16424
16424
|
return f;
|
|
16425
16425
|
}
|
|
16426
16426
|
s.prototype.zeroBits = function() {
|
|
16427
16427
|
if (this.isZero())
|
|
16428
16428
|
return 0;
|
|
16429
|
-
for (var f = 0,
|
|
16430
|
-
var S = this._zeroBits(this.words[
|
|
16429
|
+
for (var f = 0, d10 = 0; d10 < this.length; d10++) {
|
|
16430
|
+
var S = this._zeroBits(this.words[d10]);
|
|
16431
16431
|
if (f += S, S !== 26)
|
|
16432
16432
|
break;
|
|
16433
16433
|
}
|
|
@@ -16447,8 +16447,8 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16447
16447
|
}, s.prototype.iuor = function(f) {
|
|
16448
16448
|
for (; this.length < f.length; )
|
|
16449
16449
|
this.words[this.length++] = 0;
|
|
16450
|
-
for (var
|
|
16451
|
-
this.words[
|
|
16450
|
+
for (var d10 = 0; d10 < f.length; d10++)
|
|
16451
|
+
this.words[d10] = this.words[d10] | f.words[d10];
|
|
16452
16452
|
return this._strip();
|
|
16453
16453
|
}, s.prototype.ior = function(f) {
|
|
16454
16454
|
return n((this.negative | f.negative) === 0), this.iuor(f);
|
|
@@ -16457,11 +16457,11 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16457
16457
|
}, s.prototype.uor = function(f) {
|
|
16458
16458
|
return this.length > f.length ? this.clone().iuor(f) : f.clone().iuor(this);
|
|
16459
16459
|
}, s.prototype.iuand = function(f) {
|
|
16460
|
-
var
|
|
16461
|
-
this.length > f.length ?
|
|
16462
|
-
for (var S = 0; S <
|
|
16460
|
+
var d10;
|
|
16461
|
+
this.length > f.length ? d10 = f : d10 = this;
|
|
16462
|
+
for (var S = 0; S < d10.length; S++)
|
|
16463
16463
|
this.words[S] = this.words[S] & f.words[S];
|
|
16464
|
-
return this.length =
|
|
16464
|
+
return this.length = d10.length, this._strip();
|
|
16465
16465
|
}, s.prototype.iand = function(f) {
|
|
16466
16466
|
return n((this.negative | f.negative) === 0), this.iuand(f);
|
|
16467
16467
|
}, s.prototype.and = function(f) {
|
|
@@ -16469,14 +16469,14 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16469
16469
|
}, s.prototype.uand = function(f) {
|
|
16470
16470
|
return this.length > f.length ? this.clone().iuand(f) : f.clone().iuand(this);
|
|
16471
16471
|
}, s.prototype.iuxor = function(f) {
|
|
16472
|
-
var
|
|
16473
|
-
this.length > f.length ? (
|
|
16472
|
+
var d10, S;
|
|
16473
|
+
this.length > f.length ? (d10 = this, S = f) : (d10 = f, S = this);
|
|
16474
16474
|
for (var _ = 0; _ < S.length; _++)
|
|
16475
|
-
this.words[_] =
|
|
16476
|
-
if (this !==
|
|
16477
|
-
for (; _ <
|
|
16478
|
-
this.words[_] =
|
|
16479
|
-
return this.length =
|
|
16475
|
+
this.words[_] = d10.words[_] ^ S.words[_];
|
|
16476
|
+
if (this !== d10)
|
|
16477
|
+
for (; _ < d10.length; _++)
|
|
16478
|
+
this.words[_] = d10.words[_];
|
|
16479
|
+
return this.length = d10.length, this._strip();
|
|
16480
16480
|
}, s.prototype.ixor = function(f) {
|
|
16481
16481
|
return n((this.negative | f.negative) === 0), this.iuxor(f);
|
|
16482
16482
|
}, s.prototype.xor = function(f) {
|
|
@@ -16485,43 +16485,43 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16485
16485
|
return this.length > f.length ? this.clone().iuxor(f) : f.clone().iuxor(this);
|
|
16486
16486
|
}, s.prototype.inotn = function(f) {
|
|
16487
16487
|
n(typeof f == "number" && f >= 0);
|
|
16488
|
-
var
|
|
16489
|
-
this._expand(
|
|
16490
|
-
for (var _ = 0; _ <
|
|
16488
|
+
var d10 = Math.ceil(f / 26) | 0, S = f % 26;
|
|
16489
|
+
this._expand(d10), S > 0 && d10--;
|
|
16490
|
+
for (var _ = 0; _ < d10; _++)
|
|
16491
16491
|
this.words[_] = ~this.words[_] & 67108863;
|
|
16492
16492
|
return S > 0 && (this.words[_] = ~this.words[_] & 67108863 >> 26 - S), this._strip();
|
|
16493
16493
|
}, s.prototype.notn = function(f) {
|
|
16494
16494
|
return this.clone().inotn(f);
|
|
16495
|
-
}, s.prototype.setn = function(f,
|
|
16495
|
+
}, s.prototype.setn = function(f, d10) {
|
|
16496
16496
|
n(typeof f == "number" && f >= 0);
|
|
16497
16497
|
var S = f / 26 | 0, _ = f % 26;
|
|
16498
|
-
return this._expand(S + 1),
|
|
16498
|
+
return this._expand(S + 1), d10 ? this.words[S] = this.words[S] | 1 << _ : this.words[S] = this.words[S] & ~(1 << _), this._strip();
|
|
16499
16499
|
}, s.prototype.iadd = function(f) {
|
|
16500
|
-
var
|
|
16500
|
+
var d10;
|
|
16501
16501
|
if (this.negative !== 0 && f.negative === 0)
|
|
16502
|
-
return this.negative = 0,
|
|
16502
|
+
return this.negative = 0, d10 = this.isub(f), this.negative ^= 1, this._normSign();
|
|
16503
16503
|
if (this.negative === 0 && f.negative !== 0)
|
|
16504
|
-
return f.negative = 0,
|
|
16504
|
+
return f.negative = 0, d10 = this.isub(f), f.negative = 1, d10._normSign();
|
|
16505
16505
|
var S, _;
|
|
16506
16506
|
this.length > f.length ? (S = this, _ = f) : (S = f, _ = this);
|
|
16507
|
-
for (var x = 0,
|
|
16508
|
-
|
|
16509
|
-
for (; x !== 0 &&
|
|
16510
|
-
|
|
16507
|
+
for (var x = 0, T = 0; T < _.length; T++)
|
|
16508
|
+
d10 = (S.words[T] | 0) + (_.words[T] | 0) + x, this.words[T] = d10 & 67108863, x = d10 >>> 26;
|
|
16509
|
+
for (; x !== 0 && T < S.length; T++)
|
|
16510
|
+
d10 = (S.words[T] | 0) + x, this.words[T] = d10 & 67108863, x = d10 >>> 26;
|
|
16511
16511
|
if (this.length = S.length, x !== 0)
|
|
16512
16512
|
this.words[this.length] = x, this.length++;
|
|
16513
16513
|
else if (S !== this)
|
|
16514
|
-
for (;
|
|
16515
|
-
this.words[
|
|
16514
|
+
for (; T < S.length; T++)
|
|
16515
|
+
this.words[T] = S.words[T];
|
|
16516
16516
|
return this;
|
|
16517
16517
|
}, s.prototype.add = function(f) {
|
|
16518
|
-
var
|
|
16519
|
-
return f.negative !== 0 && this.negative === 0 ? (f.negative = 0,
|
|
16518
|
+
var d10;
|
|
16519
|
+
return f.negative !== 0 && this.negative === 0 ? (f.negative = 0, d10 = this.sub(f), f.negative ^= 1, d10) : f.negative === 0 && this.negative !== 0 ? (this.negative = 0, d10 = f.sub(this), this.negative = 1, d10) : this.length > f.length ? this.clone().iadd(f) : f.clone().iadd(this);
|
|
16520
16520
|
}, s.prototype.isub = function(f) {
|
|
16521
16521
|
if (f.negative !== 0) {
|
|
16522
16522
|
f.negative = 0;
|
|
16523
|
-
var
|
|
16524
|
-
return f.negative = 1,
|
|
16523
|
+
var d10 = this.iadd(f);
|
|
16524
|
+
return f.negative = 1, d10._normSign();
|
|
16525
16525
|
} else if (this.negative !== 0)
|
|
16526
16526
|
return this.negative = 0, this.iadd(f), this.negative = 1, this._normSign();
|
|
16527
16527
|
var S = this.cmp(f);
|
|
@@ -16529,35 +16529,35 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16529
16529
|
return this.negative = 0, this.length = 1, this.words[0] = 0, this;
|
|
16530
16530
|
var _, x;
|
|
16531
16531
|
S > 0 ? (_ = this, x = f) : (_ = f, x = this);
|
|
16532
|
-
for (var
|
|
16533
|
-
|
|
16534
|
-
for (;
|
|
16535
|
-
|
|
16536
|
-
if (
|
|
16532
|
+
for (var T = 0, y = 0; y < x.length; y++)
|
|
16533
|
+
d10 = (_.words[y] | 0) - (x.words[y] | 0) + T, T = d10 >> 26, this.words[y] = d10 & 67108863;
|
|
16534
|
+
for (; T !== 0 && y < _.length; y++)
|
|
16535
|
+
d10 = (_.words[y] | 0) + T, T = d10 >> 26, this.words[y] = d10 & 67108863;
|
|
16536
|
+
if (T === 0 && y < _.length && _ !== this)
|
|
16537
16537
|
for (; y < _.length; y++)
|
|
16538
16538
|
this.words[y] = _.words[y];
|
|
16539
16539
|
return this.length = Math.max(this.length, y), _ !== this && (this.negative = 1), this._strip();
|
|
16540
16540
|
}, s.prototype.sub = function(f) {
|
|
16541
16541
|
return this.clone().isub(f);
|
|
16542
16542
|
};
|
|
16543
|
-
function C(m, f,
|
|
16544
|
-
|
|
16543
|
+
function C(m, f, d10) {
|
|
16544
|
+
d10.negative = f.negative ^ m.negative;
|
|
16545
16545
|
var S = m.length + f.length | 0;
|
|
16546
|
-
|
|
16547
|
-
var _ = m.words[0] | 0, x = f.words[0] | 0,
|
|
16548
|
-
|
|
16546
|
+
d10.length = S, S = S - 1 | 0;
|
|
16547
|
+
var _ = m.words[0] | 0, x = f.words[0] | 0, T = _ * x, y = T & 67108863, w = T / 67108864 | 0;
|
|
16548
|
+
d10.words[0] = y;
|
|
16549
16549
|
for (var h = 1; h < S; h++) {
|
|
16550
16550
|
for (var R10 = w >>> 26, W = w & 67108863, Q = Math.min(h, f.length - 1), U = Math.max(0, h - m.length + 1); U <= Q; U++) {
|
|
16551
16551
|
var G = h - U | 0;
|
|
16552
|
-
_ = m.words[G] | 0, x = f.words[U] | 0,
|
|
16552
|
+
_ = m.words[G] | 0, x = f.words[U] | 0, T = _ * x + W, R10 += T / 67108864 | 0, W = T & 67108863;
|
|
16553
16553
|
}
|
|
16554
|
-
|
|
16554
|
+
d10.words[h] = W | 0, w = R10 | 0;
|
|
16555
16555
|
}
|
|
16556
|
-
return w !== 0 ?
|
|
16556
|
+
return w !== 0 ? d10.words[h] = w | 0 : d10.length--, d10._strip();
|
|
16557
16557
|
}
|
|
16558
|
-
var P = function(f,
|
|
16559
|
-
var _ = f.words, x =
|
|
16560
|
-
S.negative = f.negative ^
|
|
16558
|
+
var P = function(f, d10, S) {
|
|
16559
|
+
var _ = f.words, x = d10.words, T = S.words, y = 0, w, h, R10, W = _[0] | 0, Q = W & 8191, U = W >>> 13, G = _[1] | 0, Z = G & 8191, ee = G >>> 13, ae = _[2] | 0, I6 = ae & 8191, q = ae >>> 13, re = _[3] | 0, oe = re & 8191, he = re >>> 13, pe = _[4] | 0, be = pe & 8191, Se = pe >>> 13, te = _[5] | 0, $e = te & 8191, Te = te >>> 13, le = _[6] | 0, Pe = le & 8191, A = le >>> 13, E = _[7] | 0, V = E & 8191, v = E >>> 13, c = _[8] | 0, p = c & 8191, N = c >>> 13, B = _[9] | 0, H = B & 8191, z = B >>> 13, ue = x[0] | 0, ce = ue & 8191, fe = ue >>> 13, ge = x[1] | 0, me = ge & 8191, _e = ge >>> 13, Ye = x[2] | 0, nt = Ye & 8191, xe = Ye >>> 13, it = x[3] | 0, st = it & 8191, Ne = it >>> 13, ot = x[4] | 0, at = ot & 8191, Me = ot >>> 13, ft = x[5] | 0, ut = ft & 8191, De = ft >>> 13, ct = x[6] | 0, dt = ct & 8191, Ee = ct >>> 13, ht = x[7] | 0, lt = ht & 8191, Fe = ht >>> 13, pt = x[8] | 0, mt = pt & 8191, Be = pt >>> 13, yt = x[9] | 0, et = yt & 8191, tt = yt >>> 13;
|
|
16560
|
+
S.negative = f.negative ^ d10.negative, S.length = 19, w = Math.imul(Q, ce), h = Math.imul(Q, fe), h = h + Math.imul(U, ce) | 0, R10 = Math.imul(U, fe);
|
|
16561
16561
|
var mo = (y + w | 0) + ((h & 8191) << 13) | 0;
|
|
16562
16562
|
y = (R10 + (h >>> 13) | 0) + (mo >>> 26) | 0, mo &= 67108863, w = Math.imul(Z, ce), h = Math.imul(Z, fe), h = h + Math.imul(ee, ce) | 0, R10 = Math.imul(ee, fe), w = w + Math.imul(Q, me) | 0, h = h + Math.imul(Q, _e) | 0, h = h + Math.imul(U, me) | 0, R10 = R10 + Math.imul(U, _e) | 0;
|
|
16563
16563
|
var yo = (y + w | 0) + ((h & 8191) << 13) | 0;
|
|
@@ -16595,44 +16595,44 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16595
16595
|
var md = (y + w | 0) + ((h & 8191) << 13) | 0;
|
|
16596
16596
|
y = (R10 + (h >>> 13) | 0) + (md >>> 26) | 0, md &= 67108863, w = Math.imul(H, et), h = Math.imul(H, tt), h = h + Math.imul(z, et) | 0, R10 = Math.imul(z, tt);
|
|
16597
16597
|
var yd = (y + w | 0) + ((h & 8191) << 13) | 0;
|
|
16598
|
-
return y = (R10 + (h >>> 13) | 0) + (yd >>> 26) | 0, yd &= 67108863,
|
|
16598
|
+
return y = (R10 + (h >>> 13) | 0) + (yd >>> 26) | 0, yd &= 67108863, T[0] = mo, T[1] = yo, T[2] = go, T[3] = bo, T[4] = So, T[5] = vo, T[6] = wo, T[7] = To, T[8] = _o, T[9] = Oo, T[10] = Ao, T[11] = Ro, T[12] = xo, T[13] = No, T[14] = Mo, T[15] = Do, T[16] = Eo, T[17] = md, T[18] = yd, y !== 0 && (T[19] = y, S.length++), S;
|
|
16599
16599
|
};
|
|
16600
16600
|
Math.imul || (P = C);
|
|
16601
|
-
function k(m, f,
|
|
16602
|
-
|
|
16603
|
-
for (var S = 0, _ = 0, x = 0; x <
|
|
16604
|
-
var
|
|
16601
|
+
function k(m, f, d10) {
|
|
16602
|
+
d10.negative = f.negative ^ m.negative, d10.length = m.length + f.length;
|
|
16603
|
+
for (var S = 0, _ = 0, x = 0; x < d10.length - 1; x++) {
|
|
16604
|
+
var T = _;
|
|
16605
16605
|
_ = 0;
|
|
16606
16606
|
for (var y = S & 67108863, w = Math.min(x, f.length - 1), h = Math.max(0, x - m.length + 1); h <= w; h++) {
|
|
16607
16607
|
var R10 = x - h, W = m.words[R10] | 0, Q = f.words[h] | 0, U = W * Q, G = U & 67108863;
|
|
16608
|
-
|
|
16608
|
+
T = T + (U / 67108864 | 0) | 0, G = G + y | 0, y = G & 67108863, T = T + (G >>> 26) | 0, _ += T >>> 26, T &= 67108863;
|
|
16609
16609
|
}
|
|
16610
|
-
|
|
16610
|
+
d10.words[x] = y, S = T, T = _;
|
|
16611
16611
|
}
|
|
16612
|
-
return S !== 0 ?
|
|
16612
|
+
return S !== 0 ? d10.words[x] = S : d10.length--, d10._strip();
|
|
16613
16613
|
}
|
|
16614
|
-
function K(m, f,
|
|
16615
|
-
return k(m, f,
|
|
16614
|
+
function K(m, f, d10) {
|
|
16615
|
+
return k(m, f, d10);
|
|
16616
16616
|
}
|
|
16617
|
-
s.prototype.mulTo = function(f,
|
|
16617
|
+
s.prototype.mulTo = function(f, d10) {
|
|
16618
16618
|
var S, _ = this.length + f.length;
|
|
16619
|
-
return this.length === 10 && f.length === 10 ? S = P(this, f,
|
|
16619
|
+
return this.length === 10 && f.length === 10 ? S = P(this, f, d10) : _ < 63 ? S = C(this, f, d10) : _ < 1024 ? S = k(this, f, d10) : S = K(this, f, d10), S;
|
|
16620
16620
|
}, s.prototype.mul = function(f) {
|
|
16621
|
-
var
|
|
16622
|
-
return
|
|
16621
|
+
var d10 = new s(null);
|
|
16622
|
+
return d10.words = new Array(this.length + f.length), this.mulTo(f, d10);
|
|
16623
16623
|
}, s.prototype.mulf = function(f) {
|
|
16624
|
-
var
|
|
16625
|
-
return
|
|
16624
|
+
var d10 = new s(null);
|
|
16625
|
+
return d10.words = new Array(this.length + f.length), K(this, f, d10);
|
|
16626
16626
|
}, s.prototype.imul = function(f) {
|
|
16627
16627
|
return this.clone().mulTo(f, this);
|
|
16628
16628
|
}, s.prototype.imuln = function(f) {
|
|
16629
|
-
var
|
|
16630
|
-
|
|
16629
|
+
var d10 = f < 0;
|
|
16630
|
+
d10 && (f = -f), n(typeof f == "number"), n(f < 67108864);
|
|
16631
16631
|
for (var S = 0, _ = 0; _ < this.length; _++) {
|
|
16632
|
-
var x = (this.words[_] | 0) * f,
|
|
16633
|
-
S >>= 26, S += x / 67108864 | 0, S +=
|
|
16632
|
+
var x = (this.words[_] | 0) * f, T = (x & 67108863) + (S & 67108863);
|
|
16633
|
+
S >>= 26, S += x / 67108864 | 0, S += T >>> 26, this.words[_] = T & 67108863;
|
|
16634
16634
|
}
|
|
16635
|
-
return S !== 0 && (this.words[_] = S, this.length++),
|
|
16635
|
+
return S !== 0 && (this.words[_] = S, this.length++), d10 ? this.ineg() : this;
|
|
16636
16636
|
}, s.prototype.muln = function(f) {
|
|
16637
16637
|
return this.clone().imuln(f);
|
|
16638
16638
|
}, s.prototype.sqr = function() {
|
|
@@ -16640,25 +16640,25 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16640
16640
|
}, s.prototype.isqr = function() {
|
|
16641
16641
|
return this.imul(this.clone());
|
|
16642
16642
|
}, s.prototype.pow = function(f) {
|
|
16643
|
-
var
|
|
16644
|
-
if (
|
|
16643
|
+
var d10 = J(f);
|
|
16644
|
+
if (d10.length === 0)
|
|
16645
16645
|
return new s(1);
|
|
16646
|
-
for (var S = this, _ = 0; _ <
|
|
16646
|
+
for (var S = this, _ = 0; _ < d10.length && d10[_] === 0; _++, S = S.sqr())
|
|
16647
16647
|
;
|
|
16648
|
-
if (++_ <
|
|
16649
|
-
for (var x = S.sqr(); _ <
|
|
16650
|
-
|
|
16648
|
+
if (++_ < d10.length)
|
|
16649
|
+
for (var x = S.sqr(); _ < d10.length; _++, x = x.sqr())
|
|
16650
|
+
d10[_] !== 0 && (S = S.mul(x));
|
|
16651
16651
|
return S;
|
|
16652
16652
|
}, s.prototype.iushln = function(f) {
|
|
16653
16653
|
n(typeof f == "number" && f >= 0);
|
|
16654
|
-
var
|
|
16655
|
-
if (
|
|
16656
|
-
var
|
|
16654
|
+
var d10 = f % 26, S = (f - d10) / 26, _ = 67108863 >>> 26 - d10 << 26 - d10, x;
|
|
16655
|
+
if (d10 !== 0) {
|
|
16656
|
+
var T = 0;
|
|
16657
16657
|
for (x = 0; x < this.length; x++) {
|
|
16658
|
-
var y = this.words[x] & _, w = (this.words[x] | 0) - y <<
|
|
16659
|
-
this.words[x] = w |
|
|
16658
|
+
var y = this.words[x] & _, w = (this.words[x] | 0) - y << d10;
|
|
16659
|
+
this.words[x] = w | T, T = y >>> 26 - d10;
|
|
16660
16660
|
}
|
|
16661
|
-
|
|
16661
|
+
T && (this.words[x] = T, this.length++);
|
|
16662
16662
|
}
|
|
16663
16663
|
if (S !== 0) {
|
|
16664
16664
|
for (x = this.length - 1; x >= 0; x--)
|
|
@@ -16670,20 +16670,20 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16670
16670
|
return this._strip();
|
|
16671
16671
|
}, s.prototype.ishln = function(f) {
|
|
16672
16672
|
return n(this.negative === 0), this.iushln(f);
|
|
16673
|
-
}, s.prototype.iushrn = function(f,
|
|
16673
|
+
}, s.prototype.iushrn = function(f, d10, S) {
|
|
16674
16674
|
n(typeof f == "number" && f >= 0);
|
|
16675
16675
|
var _;
|
|
16676
|
-
|
|
16677
|
-
var x = f % 26,
|
|
16678
|
-
if (_ -=
|
|
16679
|
-
for (var h = 0; h <
|
|
16676
|
+
d10 ? _ = (d10 - d10 % 26) / 26 : _ = 0;
|
|
16677
|
+
var x = f % 26, T = Math.min((f - x) / 26, this.length), y = 67108863 ^ 67108863 >>> x << x, w = S;
|
|
16678
|
+
if (_ -= T, _ = Math.max(0, _), w) {
|
|
16679
|
+
for (var h = 0; h < T; h++)
|
|
16680
16680
|
w.words[h] = this.words[h];
|
|
16681
|
-
w.length =
|
|
16681
|
+
w.length = T;
|
|
16682
16682
|
}
|
|
16683
|
-
if (
|
|
16684
|
-
if (this.length >
|
|
16685
|
-
for (this.length -=
|
|
16686
|
-
this.words[h] = this.words[h +
|
|
16683
|
+
if (T !== 0)
|
|
16684
|
+
if (this.length > T)
|
|
16685
|
+
for (this.length -= T, h = 0; h < this.length; h++)
|
|
16686
|
+
this.words[h] = this.words[h + T];
|
|
16687
16687
|
else
|
|
16688
16688
|
this.words[0] = 0, this.length = 1;
|
|
16689
16689
|
var R10 = 0;
|
|
@@ -16692,8 +16692,8 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16692
16692
|
this.words[h] = R10 << 26 - x | W >>> x, R10 = W & y;
|
|
16693
16693
|
}
|
|
16694
16694
|
return w && R10 !== 0 && (w.words[w.length++] = R10), this.length === 0 && (this.words[0] = 0, this.length = 1), this._strip();
|
|
16695
|
-
}, s.prototype.ishrn = function(f,
|
|
16696
|
-
return n(this.negative === 0), this.iushrn(f,
|
|
16695
|
+
}, s.prototype.ishrn = function(f, d10, S) {
|
|
16696
|
+
return n(this.negative === 0), this.iushrn(f, d10, S);
|
|
16697
16697
|
}, s.prototype.shln = function(f) {
|
|
16698
16698
|
return this.clone().ishln(f);
|
|
16699
16699
|
}, s.prototype.ushln = function(f) {
|
|
@@ -16704,18 +16704,18 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16704
16704
|
return this.clone().iushrn(f);
|
|
16705
16705
|
}, s.prototype.testn = function(f) {
|
|
16706
16706
|
n(typeof f == "number" && f >= 0);
|
|
16707
|
-
var
|
|
16707
|
+
var d10 = f % 26, S = (f - d10) / 26, _ = 1 << d10;
|
|
16708
16708
|
if (this.length <= S)
|
|
16709
16709
|
return false;
|
|
16710
16710
|
var x = this.words[S];
|
|
16711
16711
|
return !!(x & _);
|
|
16712
16712
|
}, s.prototype.imaskn = function(f) {
|
|
16713
16713
|
n(typeof f == "number" && f >= 0);
|
|
16714
|
-
var
|
|
16714
|
+
var d10 = f % 26, S = (f - d10) / 26;
|
|
16715
16715
|
if (n(this.negative === 0, "imaskn works only with positive numbers"), this.length <= S)
|
|
16716
16716
|
return this;
|
|
16717
|
-
if (
|
|
16718
|
-
var _ = 67108863 ^ 67108863 >>>
|
|
16717
|
+
if (d10 !== 0 && S++, this.length = Math.min(S, this.length), d10 !== 0) {
|
|
16718
|
+
var _ = 67108863 ^ 67108863 >>> d10 << d10;
|
|
16719
16719
|
this.words[this.length - 1] &= _;
|
|
16720
16720
|
}
|
|
16721
16721
|
return this._strip();
|
|
@@ -16725,9 +16725,9 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16725
16725
|
return n(typeof f == "number"), n(f < 67108864), f < 0 ? this.isubn(-f) : this.negative !== 0 ? this.length === 1 && (this.words[0] | 0) <= f ? (this.words[0] = f - (this.words[0] | 0), this.negative = 0, this) : (this.negative = 0, this.isubn(f), this.negative = 1, this) : this._iaddn(f);
|
|
16726
16726
|
}, s.prototype._iaddn = function(f) {
|
|
16727
16727
|
this.words[0] += f;
|
|
16728
|
-
for (var
|
|
16729
|
-
this.words[
|
|
16730
|
-
return this.length = Math.max(this.length,
|
|
16728
|
+
for (var d10 = 0; d10 < this.length && this.words[d10] >= 67108864; d10++)
|
|
16729
|
+
this.words[d10] -= 67108864, d10 === this.length - 1 ? this.words[d10 + 1] = 1 : this.words[d10 + 1]++;
|
|
16730
|
+
return this.length = Math.max(this.length, d10 + 1), this;
|
|
16731
16731
|
}, s.prototype.isubn = function(f) {
|
|
16732
16732
|
if (n(typeof f == "number"), n(f < 67108864), f < 0)
|
|
16733
16733
|
return this.iaddn(-f);
|
|
@@ -16736,8 +16736,8 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16736
16736
|
if (this.words[0] -= f, this.length === 1 && this.words[0] < 0)
|
|
16737
16737
|
this.words[0] = -this.words[0], this.negative = 1;
|
|
16738
16738
|
else
|
|
16739
|
-
for (var
|
|
16740
|
-
this.words[
|
|
16739
|
+
for (var d10 = 0; d10 < this.length && this.words[d10] < 0; d10++)
|
|
16740
|
+
this.words[d10] += 67108864, this.words[d10 + 1] -= 1;
|
|
16741
16741
|
return this._strip();
|
|
16742
16742
|
}, s.prototype.addn = function(f) {
|
|
16743
16743
|
return this.clone().iaddn(f);
|
|
@@ -16747,27 +16747,27 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16747
16747
|
return this.negative = 0, this;
|
|
16748
16748
|
}, s.prototype.abs = function() {
|
|
16749
16749
|
return this.clone().iabs();
|
|
16750
|
-
}, s.prototype._ishlnsubmul = function(f,
|
|
16750
|
+
}, s.prototype._ishlnsubmul = function(f, d10, S) {
|
|
16751
16751
|
var _ = f.length + S, x;
|
|
16752
16752
|
this._expand(_);
|
|
16753
|
-
var
|
|
16753
|
+
var T, y = 0;
|
|
16754
16754
|
for (x = 0; x < f.length; x++) {
|
|
16755
|
-
|
|
16756
|
-
var w = (f.words[x] | 0) *
|
|
16757
|
-
|
|
16755
|
+
T = (this.words[x + S] | 0) + y;
|
|
16756
|
+
var w = (f.words[x] | 0) * d10;
|
|
16757
|
+
T -= w & 67108863, y = (T >> 26) - (w / 67108864 | 0), this.words[x + S] = T & 67108863;
|
|
16758
16758
|
}
|
|
16759
16759
|
for (; x < this.length - S; x++)
|
|
16760
|
-
|
|
16760
|
+
T = (this.words[x + S] | 0) + y, y = T >> 26, this.words[x + S] = T & 67108863;
|
|
16761
16761
|
if (y === 0)
|
|
16762
16762
|
return this._strip();
|
|
16763
16763
|
for (n(y === -1), y = 0, x = 0; x < this.length; x++)
|
|
16764
|
-
|
|
16764
|
+
T = -(this.words[x] | 0) + y, y = T >> 26, this.words[x] = T & 67108863;
|
|
16765
16765
|
return this.negative = 1, this._strip();
|
|
16766
|
-
}, s.prototype._wordDiv = function(f,
|
|
16767
|
-
var S = this.length - f.length, _ = this.clone(), x = f,
|
|
16768
|
-
S = 26 - y, S !== 0 && (x = x.ushln(S), _.iushln(S),
|
|
16766
|
+
}, s.prototype._wordDiv = function(f, d10) {
|
|
16767
|
+
var S = this.length - f.length, _ = this.clone(), x = f, T = x.words[x.length - 1] | 0, y = this._countBits(T);
|
|
16768
|
+
S = 26 - y, S !== 0 && (x = x.ushln(S), _.iushln(S), T = x.words[x.length - 1] | 0);
|
|
16769
16769
|
var w = _.length - x.length, h;
|
|
16770
|
-
if (
|
|
16770
|
+
if (d10 !== "mod") {
|
|
16771
16771
|
h = new s(null), h.length = w + 1, h.words = new Array(h.length);
|
|
16772
16772
|
for (var R10 = 0; R10 < h.length; R10++)
|
|
16773
16773
|
h.words[R10] = 0;
|
|
@@ -16776,43 +16776,43 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16776
16776
|
W.negative === 0 && (_ = W, h && (h.words[w] = 1));
|
|
16777
16777
|
for (var Q = w - 1; Q >= 0; Q--) {
|
|
16778
16778
|
var U = (_.words[x.length + Q] | 0) * 67108864 + (_.words[x.length + Q - 1] | 0);
|
|
16779
|
-
for (U = Math.min(U /
|
|
16779
|
+
for (U = Math.min(U / T | 0, 67108863), _._ishlnsubmul(x, U, Q); _.negative !== 0; )
|
|
16780
16780
|
U--, _.negative = 0, _._ishlnsubmul(x, 1, Q), _.isZero() || (_.negative ^= 1);
|
|
16781
16781
|
h && (h.words[Q] = U);
|
|
16782
16782
|
}
|
|
16783
|
-
return h && h._strip(), _._strip(),
|
|
16783
|
+
return h && h._strip(), _._strip(), d10 !== "div" && S !== 0 && _.iushrn(S), {
|
|
16784
16784
|
div: h || null,
|
|
16785
16785
|
mod: _
|
|
16786
16786
|
};
|
|
16787
|
-
}, s.prototype.divmod = function(f,
|
|
16787
|
+
}, s.prototype.divmod = function(f, d10, S) {
|
|
16788
16788
|
if (n(!f.isZero()), this.isZero())
|
|
16789
16789
|
return {
|
|
16790
16790
|
div: new s(0),
|
|
16791
16791
|
mod: new s(0)
|
|
16792
16792
|
};
|
|
16793
|
-
var _, x,
|
|
16794
|
-
return this.negative !== 0 && f.negative === 0 ? (
|
|
16793
|
+
var _, x, T;
|
|
16794
|
+
return this.negative !== 0 && f.negative === 0 ? (T = this.neg().divmod(f, d10), d10 !== "mod" && (_ = T.div.neg()), d10 !== "div" && (x = T.mod.neg(), S && x.negative !== 0 && x.iadd(f)), {
|
|
16795
16795
|
div: _,
|
|
16796
16796
|
mod: x
|
|
16797
|
-
}) : this.negative === 0 && f.negative !== 0 ? (
|
|
16797
|
+
}) : this.negative === 0 && f.negative !== 0 ? (T = this.divmod(f.neg(), d10), d10 !== "mod" && (_ = T.div.neg()), {
|
|
16798
16798
|
div: _,
|
|
16799
|
-
mod:
|
|
16800
|
-
}) : this.negative & f.negative ? (
|
|
16801
|
-
div:
|
|
16799
|
+
mod: T.mod
|
|
16800
|
+
}) : this.negative & f.negative ? (T = this.neg().divmod(f.neg(), d10), d10 !== "div" && (x = T.mod.neg(), S && x.negative !== 0 && x.isub(f)), {
|
|
16801
|
+
div: T.div,
|
|
16802
16802
|
mod: x
|
|
16803
16803
|
}) : f.length > this.length || this.cmp(f) < 0 ? {
|
|
16804
16804
|
div: new s(0),
|
|
16805
16805
|
mod: this
|
|
16806
|
-
} : f.length === 1 ?
|
|
16806
|
+
} : f.length === 1 ? d10 === "div" ? {
|
|
16807
16807
|
div: this.divn(f.words[0]),
|
|
16808
16808
|
mod: null
|
|
16809
|
-
} :
|
|
16809
|
+
} : d10 === "mod" ? {
|
|
16810
16810
|
div: null,
|
|
16811
16811
|
mod: new s(this.modrn(f.words[0]))
|
|
16812
16812
|
} : {
|
|
16813
16813
|
div: this.divn(f.words[0]),
|
|
16814
16814
|
mod: new s(this.modrn(f.words[0]))
|
|
16815
|
-
} : this._wordDiv(f,
|
|
16815
|
+
} : this._wordDiv(f, d10);
|
|
16816
16816
|
}, s.prototype.div = function(f) {
|
|
16817
16817
|
return this.divmod(f, "div", false).div;
|
|
16818
16818
|
}, s.prototype.mod = function(f) {
|
|
@@ -16820,93 +16820,93 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16820
16820
|
}, s.prototype.umod = function(f) {
|
|
16821
16821
|
return this.divmod(f, "mod", true).mod;
|
|
16822
16822
|
}, s.prototype.divRound = function(f) {
|
|
16823
|
-
var
|
|
16824
|
-
if (
|
|
16825
|
-
return
|
|
16826
|
-
var S =
|
|
16827
|
-
return
|
|
16823
|
+
var d10 = this.divmod(f);
|
|
16824
|
+
if (d10.mod.isZero())
|
|
16825
|
+
return d10.div;
|
|
16826
|
+
var S = d10.div.negative !== 0 ? d10.mod.isub(f) : d10.mod, _ = f.ushrn(1), x = f.andln(1), T = S.cmp(_);
|
|
16827
|
+
return T < 0 || x === 1 && T === 0 ? d10.div : d10.div.negative !== 0 ? d10.div.isubn(1) : d10.div.iaddn(1);
|
|
16828
16828
|
}, s.prototype.modrn = function(f) {
|
|
16829
|
-
var
|
|
16830
|
-
|
|
16829
|
+
var d10 = f < 0;
|
|
16830
|
+
d10 && (f = -f), n(f <= 67108863);
|
|
16831
16831
|
for (var S = (1 << 26) % f, _ = 0, x = this.length - 1; x >= 0; x--)
|
|
16832
16832
|
_ = (S * _ + (this.words[x] | 0)) % f;
|
|
16833
|
-
return
|
|
16833
|
+
return d10 ? -_ : _;
|
|
16834
16834
|
}, s.prototype.modn = function(f) {
|
|
16835
16835
|
return this.modrn(f);
|
|
16836
16836
|
}, s.prototype.idivn = function(f) {
|
|
16837
|
-
var
|
|
16838
|
-
|
|
16837
|
+
var d10 = f < 0;
|
|
16838
|
+
d10 && (f = -f), n(f <= 67108863);
|
|
16839
16839
|
for (var S = 0, _ = this.length - 1; _ >= 0; _--) {
|
|
16840
16840
|
var x = (this.words[_] | 0) + S * 67108864;
|
|
16841
16841
|
this.words[_] = x / f | 0, S = x % f;
|
|
16842
16842
|
}
|
|
16843
|
-
return this._strip(),
|
|
16843
|
+
return this._strip(), d10 ? this.ineg() : this;
|
|
16844
16844
|
}, s.prototype.divn = function(f) {
|
|
16845
16845
|
return this.clone().idivn(f);
|
|
16846
16846
|
}, s.prototype.egcd = function(f) {
|
|
16847
16847
|
n(f.negative === 0), n(!f.isZero());
|
|
16848
|
-
var
|
|
16849
|
-
|
|
16850
|
-
for (var _ = new s(1), x = new s(0),
|
|
16851
|
-
|
|
16852
|
-
for (var h = S.clone(), R10 =
|
|
16853
|
-
for (var W = 0, Q = 1; !(
|
|
16848
|
+
var d10 = this, S = f.clone();
|
|
16849
|
+
d10.negative !== 0 ? d10 = d10.umod(f) : d10 = d10.clone();
|
|
16850
|
+
for (var _ = new s(1), x = new s(0), T = new s(0), y = new s(1), w = 0; d10.isEven() && S.isEven(); )
|
|
16851
|
+
d10.iushrn(1), S.iushrn(1), ++w;
|
|
16852
|
+
for (var h = S.clone(), R10 = d10.clone(); !d10.isZero(); ) {
|
|
16853
|
+
for (var W = 0, Q = 1; !(d10.words[0] & Q) && W < 26; ++W, Q <<= 1)
|
|
16854
16854
|
;
|
|
16855
16855
|
if (W > 0)
|
|
16856
|
-
for (
|
|
16856
|
+
for (d10.iushrn(W); W-- > 0; )
|
|
16857
16857
|
(_.isOdd() || x.isOdd()) && (_.iadd(h), x.isub(R10)), _.iushrn(1), x.iushrn(1);
|
|
16858
16858
|
for (var U = 0, G = 1; !(S.words[0] & G) && U < 26; ++U, G <<= 1)
|
|
16859
16859
|
;
|
|
16860
16860
|
if (U > 0)
|
|
16861
16861
|
for (S.iushrn(U); U-- > 0; )
|
|
16862
|
-
(
|
|
16863
|
-
|
|
16862
|
+
(T.isOdd() || y.isOdd()) && (T.iadd(h), y.isub(R10)), T.iushrn(1), y.iushrn(1);
|
|
16863
|
+
d10.cmp(S) >= 0 ? (d10.isub(S), _.isub(T), x.isub(y)) : (S.isub(d10), T.isub(_), y.isub(x));
|
|
16864
16864
|
}
|
|
16865
16865
|
return {
|
|
16866
|
-
a:
|
|
16866
|
+
a: T,
|
|
16867
16867
|
b: y,
|
|
16868
16868
|
gcd: S.iushln(w)
|
|
16869
16869
|
};
|
|
16870
16870
|
}, s.prototype._invmp = function(f) {
|
|
16871
16871
|
n(f.negative === 0), n(!f.isZero());
|
|
16872
|
-
var
|
|
16873
|
-
|
|
16874
|
-
for (var _ = new s(1), x = new s(0),
|
|
16875
|
-
for (var y = 0, w = 1; !(
|
|
16872
|
+
var d10 = this, S = f.clone();
|
|
16873
|
+
d10.negative !== 0 ? d10 = d10.umod(f) : d10 = d10.clone();
|
|
16874
|
+
for (var _ = new s(1), x = new s(0), T = S.clone(); d10.cmpn(1) > 0 && S.cmpn(1) > 0; ) {
|
|
16875
|
+
for (var y = 0, w = 1; !(d10.words[0] & w) && y < 26; ++y, w <<= 1)
|
|
16876
16876
|
;
|
|
16877
16877
|
if (y > 0)
|
|
16878
|
-
for (
|
|
16879
|
-
_.isOdd() && _.iadd(
|
|
16878
|
+
for (d10.iushrn(y); y-- > 0; )
|
|
16879
|
+
_.isOdd() && _.iadd(T), _.iushrn(1);
|
|
16880
16880
|
for (var h = 0, R10 = 1; !(S.words[0] & R10) && h < 26; ++h, R10 <<= 1)
|
|
16881
16881
|
;
|
|
16882
16882
|
if (h > 0)
|
|
16883
16883
|
for (S.iushrn(h); h-- > 0; )
|
|
16884
|
-
x.isOdd() && x.iadd(
|
|
16885
|
-
|
|
16884
|
+
x.isOdd() && x.iadd(T), x.iushrn(1);
|
|
16885
|
+
d10.cmp(S) >= 0 ? (d10.isub(S), _.isub(x)) : (S.isub(d10), x.isub(_));
|
|
16886
16886
|
}
|
|
16887
16887
|
var W;
|
|
16888
|
-
return
|
|
16888
|
+
return d10.cmpn(1) === 0 ? W = _ : W = x, W.cmpn(0) < 0 && W.iadd(f), W;
|
|
16889
16889
|
}, s.prototype.gcd = function(f) {
|
|
16890
16890
|
if (this.isZero())
|
|
16891
16891
|
return f.abs();
|
|
16892
16892
|
if (f.isZero())
|
|
16893
16893
|
return this.abs();
|
|
16894
|
-
var
|
|
16895
|
-
|
|
16896
|
-
for (var _ = 0;
|
|
16897
|
-
|
|
16894
|
+
var d10 = this.clone(), S = f.clone();
|
|
16895
|
+
d10.negative = 0, S.negative = 0;
|
|
16896
|
+
for (var _ = 0; d10.isEven() && S.isEven(); _++)
|
|
16897
|
+
d10.iushrn(1), S.iushrn(1);
|
|
16898
16898
|
do {
|
|
16899
|
-
for (;
|
|
16900
|
-
|
|
16899
|
+
for (; d10.isEven(); )
|
|
16900
|
+
d10.iushrn(1);
|
|
16901
16901
|
for (; S.isEven(); )
|
|
16902
16902
|
S.iushrn(1);
|
|
16903
|
-
var x =
|
|
16903
|
+
var x = d10.cmp(S);
|
|
16904
16904
|
if (x < 0) {
|
|
16905
|
-
var
|
|
16906
|
-
|
|
16905
|
+
var T = d10;
|
|
16906
|
+
d10 = S, S = T;
|
|
16907
16907
|
} else if (x === 0 || S.cmpn(1) === 0)
|
|
16908
16908
|
break;
|
|
16909
|
-
|
|
16909
|
+
d10.isub(S);
|
|
16910
16910
|
} while (true);
|
|
16911
16911
|
return S.iushln(_);
|
|
16912
16912
|
}, s.prototype.invm = function(f) {
|
|
@@ -16919,28 +16919,28 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16919
16919
|
return this.words[0] & f;
|
|
16920
16920
|
}, s.prototype.bincn = function(f) {
|
|
16921
16921
|
n(typeof f == "number");
|
|
16922
|
-
var
|
|
16922
|
+
var d10 = f % 26, S = (f - d10) / 26, _ = 1 << d10;
|
|
16923
16923
|
if (this.length <= S)
|
|
16924
16924
|
return this._expand(S + 1), this.words[S] |= _, this;
|
|
16925
|
-
for (var x = _,
|
|
16926
|
-
var y = this.words[
|
|
16927
|
-
y += x, x = y >>> 26, y &= 67108863, this.words[
|
|
16925
|
+
for (var x = _, T = S; x !== 0 && T < this.length; T++) {
|
|
16926
|
+
var y = this.words[T] | 0;
|
|
16927
|
+
y += x, x = y >>> 26, y &= 67108863, this.words[T] = y;
|
|
16928
16928
|
}
|
|
16929
|
-
return x !== 0 && (this.words[
|
|
16929
|
+
return x !== 0 && (this.words[T] = x, this.length++), this;
|
|
16930
16930
|
}, s.prototype.isZero = function() {
|
|
16931
16931
|
return this.length === 1 && this.words[0] === 0;
|
|
16932
16932
|
}, s.prototype.cmpn = function(f) {
|
|
16933
|
-
var
|
|
16934
|
-
if (this.negative !== 0 && !
|
|
16933
|
+
var d10 = f < 0;
|
|
16934
|
+
if (this.negative !== 0 && !d10)
|
|
16935
16935
|
return -1;
|
|
16936
|
-
if (this.negative === 0 &&
|
|
16936
|
+
if (this.negative === 0 && d10)
|
|
16937
16937
|
return 1;
|
|
16938
16938
|
this._strip();
|
|
16939
16939
|
var S;
|
|
16940
16940
|
if (this.length > 1)
|
|
16941
16941
|
S = 1;
|
|
16942
16942
|
else {
|
|
16943
|
-
|
|
16943
|
+
d10 && (f = -f), n(f <= 67108863, "Number is too big");
|
|
16944
16944
|
var _ = this.words[0] | 0;
|
|
16945
16945
|
S = _ === f ? 0 : _ < f ? -1 : 1;
|
|
16946
16946
|
}
|
|
@@ -16950,21 +16950,21 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16950
16950
|
return -1;
|
|
16951
16951
|
if (this.negative === 0 && f.negative !== 0)
|
|
16952
16952
|
return 1;
|
|
16953
|
-
var
|
|
16954
|
-
return this.negative !== 0 ? -
|
|
16953
|
+
var d10 = this.ucmp(f);
|
|
16954
|
+
return this.negative !== 0 ? -d10 | 0 : d10;
|
|
16955
16955
|
}, s.prototype.ucmp = function(f) {
|
|
16956
16956
|
if (this.length > f.length)
|
|
16957
16957
|
return 1;
|
|
16958
16958
|
if (this.length < f.length)
|
|
16959
16959
|
return -1;
|
|
16960
|
-
for (var
|
|
16960
|
+
for (var d10 = 0, S = this.length - 1; S >= 0; S--) {
|
|
16961
16961
|
var _ = this.words[S] | 0, x = f.words[S] | 0;
|
|
16962
16962
|
if (_ !== x) {
|
|
16963
|
-
_ < x ?
|
|
16963
|
+
_ < x ? d10 = -1 : _ > x && (d10 = 1);
|
|
16964
16964
|
break;
|
|
16965
16965
|
}
|
|
16966
16966
|
}
|
|
16967
|
-
return
|
|
16967
|
+
return d10;
|
|
16968
16968
|
}, s.prototype.gtn = function(f) {
|
|
16969
16969
|
return this.cmpn(f) === 1;
|
|
16970
16970
|
}, s.prototype.gt = function(f) {
|
|
@@ -16986,7 +16986,7 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
16986
16986
|
}, s.prototype.eq = function(f) {
|
|
16987
16987
|
return this.cmp(f) === 0;
|
|
16988
16988
|
}, s.red = function(f) {
|
|
16989
|
-
return new
|
|
16989
|
+
return new L6(f);
|
|
16990
16990
|
}, s.prototype.toRed = function(f) {
|
|
16991
16991
|
return n(!this.red, "Already a number in reduction context"), n(this.negative === 0, "red works only with positives"), f.convertTo(this)._forceRed(f);
|
|
16992
16992
|
}, s.prototype.fromRed = function() {
|
|
@@ -17035,14 +17035,14 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
17035
17035
|
var f = new s(null);
|
|
17036
17036
|
return f.words = new Array(Math.ceil(this.n / 13)), f;
|
|
17037
17037
|
}, Y.prototype.ireduce = function(f) {
|
|
17038
|
-
var
|
|
17038
|
+
var d10 = f, S;
|
|
17039
17039
|
do
|
|
17040
|
-
this.split(
|
|
17040
|
+
this.split(d10, this.tmp), d10 = this.imulK(d10), d10 = d10.iadd(this.tmp), S = d10.bitLength();
|
|
17041
17041
|
while (S > this.n);
|
|
17042
|
-
var _ = S < this.n ? -1 :
|
|
17043
|
-
return _ === 0 ? (
|
|
17044
|
-
}, Y.prototype.split = function(f,
|
|
17045
|
-
f.iushrn(this.n, 0,
|
|
17042
|
+
var _ = S < this.n ? -1 : d10.ucmp(this.p);
|
|
17043
|
+
return _ === 0 ? (d10.words[0] = 0, d10.length = 1) : _ > 0 ? d10.isub(this.p) : d10.strip !== void 0 ? d10.strip() : d10._strip(), d10;
|
|
17044
|
+
}, Y.prototype.split = function(f, d10) {
|
|
17045
|
+
f.iushrn(this.n, 0, d10);
|
|
17046
17046
|
}, Y.prototype.imulK = function(f) {
|
|
17047
17047
|
return f.imul(this.k);
|
|
17048
17048
|
};
|
|
@@ -17053,24 +17053,24 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
17053
17053
|
"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f"
|
|
17054
17054
|
);
|
|
17055
17055
|
}
|
|
17056
|
-
i10(ie, Y), ie.prototype.split = function(f,
|
|
17056
|
+
i10(ie, Y), ie.prototype.split = function(f, d10) {
|
|
17057
17057
|
for (var S = 4194303, _ = Math.min(f.length, 9), x = 0; x < _; x++)
|
|
17058
|
-
|
|
17059
|
-
if (
|
|
17058
|
+
d10.words[x] = f.words[x];
|
|
17059
|
+
if (d10.length = _, f.length <= 9) {
|
|
17060
17060
|
f.words[0] = 0, f.length = 1;
|
|
17061
17061
|
return;
|
|
17062
17062
|
}
|
|
17063
|
-
var
|
|
17064
|
-
for (
|
|
17063
|
+
var T = f.words[9];
|
|
17064
|
+
for (d10.words[d10.length++] = T & S, x = 10; x < f.length; x++) {
|
|
17065
17065
|
var y = f.words[x] | 0;
|
|
17066
|
-
f.words[x - 10] = (y & S) << 4 |
|
|
17066
|
+
f.words[x - 10] = (y & S) << 4 | T >>> 22, T = y;
|
|
17067
17067
|
}
|
|
17068
|
-
|
|
17068
|
+
T >>>= 22, f.words[x - 10] = T, T === 0 && f.length > 10 ? f.length -= 10 : f.length -= 9;
|
|
17069
17069
|
}, ie.prototype.imulK = function(f) {
|
|
17070
17070
|
f.words[f.length] = 0, f.words[f.length + 1] = 0, f.length += 2;
|
|
17071
|
-
for (var
|
|
17071
|
+
for (var d10 = 0, S = 0; S < f.length; S++) {
|
|
17072
17072
|
var _ = f.words[S] | 0;
|
|
17073
|
-
|
|
17073
|
+
d10 += _ * 977, f.words[S] = d10 & 67108863, d10 = _ * 64 + (d10 / 67108864 | 0);
|
|
17074
17074
|
}
|
|
17075
17075
|
return f.words[f.length - 1] === 0 && (f.length--, f.words[f.length - 1] === 0 && f.length--), f;
|
|
17076
17076
|
};
|
|
@@ -17098,148 +17098,148 @@ var Bf = { exports: {} }, T0 = { exports: {} };
|
|
|
17098
17098
|
);
|
|
17099
17099
|
}
|
|
17100
17100
|
i10(ve, Y), ve.prototype.imulK = function(f) {
|
|
17101
|
-
for (var
|
|
17102
|
-
var _ = (f.words[S] | 0) * 19 +
|
|
17103
|
-
_ >>>= 26, f.words[S] = x,
|
|
17101
|
+
for (var d10 = 0, S = 0; S < f.length; S++) {
|
|
17102
|
+
var _ = (f.words[S] | 0) * 19 + d10, x = _ & 67108863;
|
|
17103
|
+
_ >>>= 26, f.words[S] = x, d10 = _;
|
|
17104
17104
|
}
|
|
17105
|
-
return
|
|
17105
|
+
return d10 !== 0 && (f.words[f.length++] = d10), f;
|
|
17106
17106
|
}, s._prime = function(f) {
|
|
17107
17107
|
if (X[f])
|
|
17108
17108
|
return X[f];
|
|
17109
|
-
var
|
|
17109
|
+
var d10;
|
|
17110
17110
|
if (f === "k256")
|
|
17111
|
-
|
|
17111
|
+
d10 = new ie();
|
|
17112
17112
|
else if (f === "p224")
|
|
17113
|
-
|
|
17113
|
+
d10 = new ne();
|
|
17114
17114
|
else if (f === "p192")
|
|
17115
|
-
|
|
17115
|
+
d10 = new se();
|
|
17116
17116
|
else if (f === "p25519")
|
|
17117
|
-
|
|
17117
|
+
d10 = new ve();
|
|
17118
17118
|
else
|
|
17119
17119
|
throw new Error("Unknown prime " + f);
|
|
17120
|
-
return X[f] =
|
|
17120
|
+
return X[f] = d10, d10;
|
|
17121
17121
|
};
|
|
17122
|
-
function
|
|
17122
|
+
function L6(m) {
|
|
17123
17123
|
if (typeof m == "string") {
|
|
17124
17124
|
var f = s._prime(m);
|
|
17125
17125
|
this.m = f.p, this.prime = f;
|
|
17126
17126
|
} else
|
|
17127
17127
|
n(m.gtn(1), "modulus must be greater than 1"), this.m = m, this.prime = null;
|
|
17128
17128
|
}
|
|
17129
|
-
|
|
17129
|
+
L6.prototype._verify1 = function(f) {
|
|
17130
17130
|
n(f.negative === 0, "red works only with positives"), n(f.red, "red works only with red numbers");
|
|
17131
|
-
},
|
|
17132
|
-
n((f.negative |
|
|
17133
|
-
f.red && f.red ===
|
|
17131
|
+
}, L6.prototype._verify2 = function(f, d10) {
|
|
17132
|
+
n((f.negative | d10.negative) === 0, "red works only with positives"), n(
|
|
17133
|
+
f.red && f.red === d10.red,
|
|
17134
17134
|
"red works only with red numbers"
|
|
17135
17135
|
);
|
|
17136
|
-
},
|
|
17136
|
+
}, L6.prototype.imod = function(f) {
|
|
17137
17137
|
return this.prime ? this.prime.ireduce(f)._forceRed(this) : (b(f, f.umod(this.m)._forceRed(this)), f);
|
|
17138
|
-
},
|
|
17138
|
+
}, L6.prototype.neg = function(f) {
|
|
17139
17139
|
return f.isZero() ? f.clone() : this.m.sub(f)._forceRed(this);
|
|
17140
|
-
},
|
|
17141
|
-
this._verify2(f,
|
|
17142
|
-
var S = f.add(
|
|
17140
|
+
}, L6.prototype.add = function(f, d10) {
|
|
17141
|
+
this._verify2(f, d10);
|
|
17142
|
+
var S = f.add(d10);
|
|
17143
17143
|
return S.cmp(this.m) >= 0 && S.isub(this.m), S._forceRed(this);
|
|
17144
|
-
},
|
|
17145
|
-
this._verify2(f,
|
|
17146
|
-
var S = f.iadd(
|
|
17144
|
+
}, L6.prototype.iadd = function(f, d10) {
|
|
17145
|
+
this._verify2(f, d10);
|
|
17146
|
+
var S = f.iadd(d10);
|
|
17147
17147
|
return S.cmp(this.m) >= 0 && S.isub(this.m), S;
|
|
17148
|
-
},
|
|
17149
|
-
this._verify2(f,
|
|
17150
|
-
var S = f.sub(
|
|
17148
|
+
}, L6.prototype.sub = function(f, d10) {
|
|
17149
|
+
this._verify2(f, d10);
|
|
17150
|
+
var S = f.sub(d10);
|
|
17151
17151
|
return S.cmpn(0) < 0 && S.iadd(this.m), S._forceRed(this);
|
|
17152
|
-
},
|
|
17153
|
-
this._verify2(f,
|
|
17154
|
-
var S = f.isub(
|
|
17152
|
+
}, L6.prototype.isub = function(f, d10) {
|
|
17153
|
+
this._verify2(f, d10);
|
|
17154
|
+
var S = f.isub(d10);
|
|
17155
17155
|
return S.cmpn(0) < 0 && S.iadd(this.m), S;
|
|
17156
|
-
},
|
|
17157
|
-
return this._verify1(f), this.imod(f.ushln(
|
|
17158
|
-
},
|
|
17159
|
-
return this._verify2(f,
|
|
17160
|
-
},
|
|
17161
|
-
return this._verify2(f,
|
|
17162
|
-
},
|
|
17156
|
+
}, L6.prototype.shl = function(f, d10) {
|
|
17157
|
+
return this._verify1(f), this.imod(f.ushln(d10));
|
|
17158
|
+
}, L6.prototype.imul = function(f, d10) {
|
|
17159
|
+
return this._verify2(f, d10), this.imod(f.imul(d10));
|
|
17160
|
+
}, L6.prototype.mul = function(f, d10) {
|
|
17161
|
+
return this._verify2(f, d10), this.imod(f.mul(d10));
|
|
17162
|
+
}, L6.prototype.isqr = function(f) {
|
|
17163
17163
|
return this.imul(f, f.clone());
|
|
17164
|
-
},
|
|
17164
|
+
}, L6.prototype.sqr = function(f) {
|
|
17165
17165
|
return this.mul(f, f);
|
|
17166
|
-
},
|
|
17166
|
+
}, L6.prototype.sqrt = function(f) {
|
|
17167
17167
|
if (f.isZero())
|
|
17168
17168
|
return f.clone();
|
|
17169
|
-
var
|
|
17170
|
-
if (n(
|
|
17169
|
+
var d10 = this.m.andln(3);
|
|
17170
|
+
if (n(d10 % 2 === 1), d10 === 3) {
|
|
17171
17171
|
var S = this.m.add(new s(1)).iushrn(2);
|
|
17172
17172
|
return this.pow(f, S);
|
|
17173
17173
|
}
|
|
17174
17174
|
for (var _ = this.m.subn(1), x = 0; !_.isZero() && _.andln(1) === 0; )
|
|
17175
17175
|
x++, _.iushrn(1);
|
|
17176
17176
|
n(!_.isZero());
|
|
17177
|
-
var
|
|
17177
|
+
var T = new s(1).toRed(this), y = T.redNeg(), w = this.m.subn(1).iushrn(1), h = this.m.bitLength();
|
|
17178
17178
|
for (h = new s(2 * h * h).toRed(this); this.pow(h, w).cmp(y) !== 0; )
|
|
17179
17179
|
h.redIAdd(y);
|
|
17180
|
-
for (var R10 = this.pow(h, _), W = this.pow(f, _.addn(1).iushrn(1)), Q = this.pow(f, _), U = x; Q.cmp(
|
|
17181
|
-
for (var G = Q, Z = 0; G.cmp(
|
|
17180
|
+
for (var R10 = this.pow(h, _), W = this.pow(f, _.addn(1).iushrn(1)), Q = this.pow(f, _), U = x; Q.cmp(T) !== 0; ) {
|
|
17181
|
+
for (var G = Q, Z = 0; G.cmp(T) !== 0; Z++)
|
|
17182
17182
|
G = G.redSqr();
|
|
17183
17183
|
n(Z < U);
|
|
17184
17184
|
var ee = this.pow(R10, new s(1).iushln(U - Z - 1));
|
|
17185
17185
|
W = W.redMul(ee), R10 = ee.redSqr(), Q = Q.redMul(R10), U = Z;
|
|
17186
17186
|
}
|
|
17187
17187
|
return W;
|
|
17188
|
-
},
|
|
17189
|
-
var
|
|
17190
|
-
return
|
|
17191
|
-
},
|
|
17192
|
-
if (
|
|
17188
|
+
}, L6.prototype.invm = function(f) {
|
|
17189
|
+
var d10 = f._invmp(this.m);
|
|
17190
|
+
return d10.negative !== 0 ? (d10.negative = 0, this.imod(d10).redNeg()) : this.imod(d10);
|
|
17191
|
+
}, L6.prototype.pow = function(f, d10) {
|
|
17192
|
+
if (d10.isZero())
|
|
17193
17193
|
return new s(1).toRed(this);
|
|
17194
|
-
if (
|
|
17194
|
+
if (d10.cmpn(1) === 0)
|
|
17195
17195
|
return f.clone();
|
|
17196
17196
|
var S = 4, _ = new Array(1 << S);
|
|
17197
17197
|
_[0] = new s(1).toRed(this), _[1] = f;
|
|
17198
17198
|
for (var x = 2; x < _.length; x++)
|
|
17199
17199
|
_[x] = this.mul(_[x - 1], f);
|
|
17200
|
-
var
|
|
17201
|
-
for (h === 0 && (h = 26), x =
|
|
17202
|
-
for (var R10 =
|
|
17200
|
+
var T = _[0], y = 0, w = 0, h = d10.bitLength() % 26;
|
|
17201
|
+
for (h === 0 && (h = 26), x = d10.length - 1; x >= 0; x--) {
|
|
17202
|
+
for (var R10 = d10.words[x], W = h - 1; W >= 0; W--) {
|
|
17203
17203
|
var Q = R10 >> W & 1;
|
|
17204
|
-
if (
|
|
17204
|
+
if (T !== _[0] && (T = this.sqr(T)), Q === 0 && y === 0) {
|
|
17205
17205
|
w = 0;
|
|
17206
17206
|
continue;
|
|
17207
17207
|
}
|
|
17208
|
-
y <<= 1, y |= Q, w++, !(w !== S && (x !== 0 || W !== 0)) && (
|
|
17208
|
+
y <<= 1, y |= Q, w++, !(w !== S && (x !== 0 || W !== 0)) && (T = this.mul(T, _[y]), w = 0, y = 0);
|
|
17209
17209
|
}
|
|
17210
17210
|
h = 26;
|
|
17211
17211
|
}
|
|
17212
|
-
return
|
|
17213
|
-
},
|
|
17214
|
-
var
|
|
17215
|
-
return
|
|
17216
|
-
},
|
|
17217
|
-
var
|
|
17218
|
-
return
|
|
17212
|
+
return T;
|
|
17213
|
+
}, L6.prototype.convertTo = function(f) {
|
|
17214
|
+
var d10 = f.umod(this.m);
|
|
17215
|
+
return d10 === f ? d10.clone() : d10;
|
|
17216
|
+
}, L6.prototype.convertFrom = function(f) {
|
|
17217
|
+
var d10 = f.clone();
|
|
17218
|
+
return d10.red = null, d10;
|
|
17219
17219
|
}, s.mont = function(f) {
|
|
17220
17220
|
return new g(f);
|
|
17221
17221
|
};
|
|
17222
17222
|
function g(m) {
|
|
17223
|
-
|
|
17223
|
+
L6.call(this, m), this.shift = this.m.bitLength(), this.shift % 26 !== 0 && (this.shift += 26 - this.shift % 26), this.r = new s(1).iushln(this.shift), this.r2 = this.imod(this.r.sqr()), this.rinv = this.r._invmp(this.m), this.minv = this.rinv.mul(this.r).isubn(1).div(this.m), this.minv = this.minv.umod(this.r), this.minv = this.r.sub(this.minv);
|
|
17224
17224
|
}
|
|
17225
|
-
i10(g,
|
|
17225
|
+
i10(g, L6), g.prototype.convertTo = function(f) {
|
|
17226
17226
|
return this.imod(f.ushln(this.shift));
|
|
17227
17227
|
}, g.prototype.convertFrom = function(f) {
|
|
17228
|
-
var
|
|
17229
|
-
return
|
|
17230
|
-
}, g.prototype.imul = function(f,
|
|
17231
|
-
if (f.isZero() ||
|
|
17228
|
+
var d10 = this.imod(f.mul(this.rinv));
|
|
17229
|
+
return d10.red = null, d10;
|
|
17230
|
+
}, g.prototype.imul = function(f, d10) {
|
|
17231
|
+
if (f.isZero() || d10.isZero())
|
|
17232
17232
|
return f.words[0] = 0, f.length = 1, f;
|
|
17233
|
-
var S = f.imul(
|
|
17234
|
-
return x.cmp(this.m) >= 0 ?
|
|
17235
|
-
}, g.prototype.mul = function(f,
|
|
17236
|
-
if (f.isZero() ||
|
|
17233
|
+
var S = f.imul(d10), _ = S.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), x = S.isub(_).iushrn(this.shift), T = x;
|
|
17234
|
+
return x.cmp(this.m) >= 0 ? T = x.isub(this.m) : x.cmpn(0) < 0 && (T = x.iadd(this.m)), T._forceRed(this);
|
|
17235
|
+
}, g.prototype.mul = function(f, d10) {
|
|
17236
|
+
if (f.isZero() || d10.isZero())
|
|
17237
17237
|
return new s(0)._forceRed(this);
|
|
17238
|
-
var S = f.mul(
|
|
17239
|
-
return x.cmp(this.m) >= 0 ?
|
|
17238
|
+
var S = f.mul(d10), _ = S.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m), x = S.isub(_).iushrn(this.shift), T = x;
|
|
17239
|
+
return x.cmp(this.m) >= 0 ? T = x.isub(this.m) : x.cmpn(0) < 0 && (T = x.iadd(this.m)), T._forceRed(this);
|
|
17240
17240
|
}, g.prototype.invm = function(f) {
|
|
17241
|
-
var
|
|
17242
|
-
return
|
|
17241
|
+
var d10 = this.imod(f._invmp(this.m).mul(this.r2));
|
|
17242
|
+
return d10._forceRed(this);
|
|
17243
17243
|
};
|
|
17244
17244
|
})(e10, j);
|
|
17245
17245
|
})(T0);
|
|
@@ -17360,13 +17360,13 @@ var Rr = {}, A0 = {};
|
|
|
17360
17360
|
var t = e10, r = Ct, n = un, i10 = A0;
|
|
17361
17361
|
t.assert = n, t.toArray = i10.toArray, t.zero2 = i10.zero2, t.toHex = i10.toHex, t.encode = i10.encode;
|
|
17362
17362
|
function s(b, O, M) {
|
|
17363
|
-
var
|
|
17364
|
-
|
|
17365
|
-
for (var F = 1 << O + 1, $6 = b.clone(), J = 0; J <
|
|
17363
|
+
var D = new Array(Math.max(b.bitLength(), M) + 1);
|
|
17364
|
+
D.fill(0);
|
|
17365
|
+
for (var F = 1 << O + 1, $6 = b.clone(), J = 0; J < D.length; J++) {
|
|
17366
17366
|
var C, P = $6.andln(F - 1);
|
|
17367
|
-
$6.isOdd() ? (P > (F >> 1) - 1 ? C = (F >> 1) - P : C = P, $6.isubn(C)) : C = 0,
|
|
17367
|
+
$6.isOdd() ? (P > (F >> 1) - 1 ? C = (F >> 1) - P : C = P, $6.isubn(C)) : C = 0, D[J] = C, $6.iushrn(1);
|
|
17368
17368
|
}
|
|
17369
|
-
return
|
|
17369
|
+
return D;
|
|
17370
17370
|
}
|
|
17371
17371
|
t.getNAF = s;
|
|
17372
17372
|
function o(b, O) {
|
|
@@ -17375,21 +17375,21 @@ var Rr = {}, A0 = {};
|
|
|
17375
17375
|
[]
|
|
17376
17376
|
];
|
|
17377
17377
|
b = b.clone(), O = O.clone();
|
|
17378
|
-
for (var
|
|
17379
|
-
var J = b.andln(3) +
|
|
17378
|
+
for (var D = 0, F = 0, $6; b.cmpn(-D) > 0 || O.cmpn(-F) > 0; ) {
|
|
17379
|
+
var J = b.andln(3) + D & 3, C = O.andln(3) + F & 3;
|
|
17380
17380
|
J === 3 && (J = -1), C === 3 && (C = -1);
|
|
17381
17381
|
var P;
|
|
17382
|
-
J & 1 ? ($6 = b.andln(7) +
|
|
17382
|
+
J & 1 ? ($6 = b.andln(7) + D & 7, ($6 === 3 || $6 === 5) && C === 2 ? P = -J : P = J) : P = 0, M[0].push(P);
|
|
17383
17383
|
var k;
|
|
17384
|
-
C & 1 ? ($6 = O.andln(7) + F & 7, ($6 === 3 || $6 === 5) && J === 2 ? k = -C : k = C) : k = 0, M[1].push(k), 2 *
|
|
17384
|
+
C & 1 ? ($6 = O.andln(7) + F & 7, ($6 === 3 || $6 === 5) && J === 2 ? k = -C : k = C) : k = 0, M[1].push(k), 2 * D === P + 1 && (D = 1 - D), 2 * F === k + 1 && (F = 1 - F), b.iushrn(1), O.iushrn(1);
|
|
17385
17385
|
}
|
|
17386
17386
|
return M;
|
|
17387
17387
|
}
|
|
17388
17388
|
t.getJSF = o;
|
|
17389
17389
|
function a(b, O, M) {
|
|
17390
|
-
var
|
|
17390
|
+
var D = "_" + O;
|
|
17391
17391
|
b.prototype[O] = function() {
|
|
17392
|
-
return this[
|
|
17392
|
+
return this[D] !== void 0 ? this[D] : this[D] = M.call(this);
|
|
17393
17393
|
};
|
|
17394
17394
|
}
|
|
17395
17395
|
t.cachedProperty = a;
|
|
@@ -17450,8 +17450,8 @@ po.prototype._wnafMulAdd = function(t, r, n, i10, s) {
|
|
|
17450
17450
|
var o = this._wnafT1, a = this._wnafT2, u = this._wnafT3, l = 0, b, O, M;
|
|
17451
17451
|
for (b = 0; b < i10; b++) {
|
|
17452
17452
|
M = r[b];
|
|
17453
|
-
var
|
|
17454
|
-
o[b] =
|
|
17453
|
+
var D = M._getNAFPoints(t);
|
|
17454
|
+
o[b] = D.wnd, a[b] = D.points;
|
|
17455
17455
|
}
|
|
17456
17456
|
for (b = i10 - 1; b >= 1; b -= 2) {
|
|
17457
17457
|
var F = b - 1, $6 = b;
|
|
@@ -17636,7 +17636,7 @@ hn.prototype._getEndoRoots = function(t) {
|
|
|
17636
17636
|
return [o, a];
|
|
17637
17637
|
};
|
|
17638
17638
|
hn.prototype._getEndoBasis = function(t) {
|
|
17639
|
-
for (var r = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), n = t, i10 = this.n.clone(), s = new vt(1), o = new vt(0), a = new vt(0), u = new vt(1), l, b, O, M,
|
|
17639
|
+
for (var r = this.n.ushrn(Math.floor(this.n.bitLength() / 2)), n = t, i10 = this.n.clone(), s = new vt(1), o = new vt(0), a = new vt(0), u = new vt(1), l, b, O, M, D, F, $6, J = 0, C, P; n.cmpn(0) !== 0; ) {
|
|
17640
17640
|
var k = i10.div(n);
|
|
17641
17641
|
C = i10.sub(k.mul(n)), P = a.sub(k.mul(s));
|
|
17642
17642
|
var K = u.sub(k.mul(o));
|
|
@@ -17646,11 +17646,11 @@ hn.prototype._getEndoBasis = function(t) {
|
|
|
17646
17646
|
break;
|
|
17647
17647
|
$6 = C, i10 = n, n = C, a = s, s = P, u = o, o = K;
|
|
17648
17648
|
}
|
|
17649
|
-
|
|
17650
|
-
var X = O.sqr().add(M.sqr()), Y =
|
|
17651
|
-
return Y.cmp(X) >= 0 && (
|
|
17649
|
+
D = C.neg(), F = P;
|
|
17650
|
+
var X = O.sqr().add(M.sqr()), Y = D.sqr().add(F.sqr());
|
|
17651
|
+
return Y.cmp(X) >= 0 && (D = l, F = b), O.negative && (O = O.neg(), M = M.neg()), D.negative && (D = D.neg(), F = F.neg()), [
|
|
17652
17652
|
{ a: O, b: M },
|
|
17653
|
-
{ a:
|
|
17653
|
+
{ a: D, b: F }
|
|
17654
17654
|
];
|
|
17655
17655
|
};
|
|
17656
17656
|
hn.prototype._endoSplit = function(t) {
|
|
@@ -17850,8 +17850,8 @@ $t.prototype.add = function(t) {
|
|
|
17850
17850
|
var r = t.z.redSqr(), n = this.z.redSqr(), i10 = this.x.redMul(r), s = t.x.redMul(n), o = this.y.redMul(r.redMul(t.z)), a = t.y.redMul(n.redMul(this.z)), u = i10.redSub(s), l = o.redSub(a);
|
|
17851
17851
|
if (u.cmpn(0) === 0)
|
|
17852
17852
|
return l.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
|
|
17853
|
-
var b = u.redSqr(), O = b.redMul(u), M = i10.redMul(b),
|
|
17854
|
-
return this.curve.jpoint(
|
|
17853
|
+
var b = u.redSqr(), O = b.redMul(u), M = i10.redMul(b), D = l.redSqr().redIAdd(O).redISub(M).redISub(M), F = l.redMul(M.redISub(D)).redISub(o.redMul(O)), $6 = this.z.redMul(t.z).redMul(u);
|
|
17854
|
+
return this.curve.jpoint(D, F, $6);
|
|
17855
17855
|
};
|
|
17856
17856
|
$t.prototype.mixedAdd = function(t) {
|
|
17857
17857
|
if (this.isInfinity())
|
|
@@ -17861,8 +17861,8 @@ $t.prototype.mixedAdd = function(t) {
|
|
|
17861
17861
|
var r = this.z.redSqr(), n = this.x, i10 = t.x.redMul(r), s = this.y, o = t.y.redMul(r).redMul(this.z), a = n.redSub(i10), u = s.redSub(o);
|
|
17862
17862
|
if (a.cmpn(0) === 0)
|
|
17863
17863
|
return u.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();
|
|
17864
|
-
var l = a.redSqr(), b = l.redMul(a), O = n.redMul(l), M = u.redSqr().redIAdd(b).redISub(O).redISub(O),
|
|
17865
|
-
return this.curve.jpoint(M,
|
|
17864
|
+
var l = a.redSqr(), b = l.redMul(a), O = n.redMul(l), M = u.redSqr().redIAdd(b).redISub(O).redISub(O), D = u.redMul(O.redISub(M)).redISub(s.redMul(b)), F = this.z.redMul(a);
|
|
17865
|
+
return this.curve.jpoint(M, D, F);
|
|
17866
17866
|
};
|
|
17867
17867
|
$t.prototype.dblp = function(t) {
|
|
17868
17868
|
if (t === 0)
|
|
@@ -17880,10 +17880,10 @@ $t.prototype.dblp = function(t) {
|
|
|
17880
17880
|
}
|
|
17881
17881
|
var i10 = this.curve.a, s = this.curve.tinv, o = this.x, a = this.y, u = this.z, l = u.redSqr().redSqr(), b = a.redAdd(a);
|
|
17882
17882
|
for (r = 0; r < t; r++) {
|
|
17883
|
-
var O = o.redSqr(), M = b.redSqr(),
|
|
17884
|
-
P = P.redIAdd(P).redISub(
|
|
17883
|
+
var O = o.redSqr(), M = b.redSqr(), D = M.redSqr(), F = O.redAdd(O).redIAdd(O).redIAdd(i10.redMul(l)), $6 = o.redMul(M), J = F.redSqr().redISub($6.redAdd($6)), C = $6.redISub(J), P = F.redMul(C);
|
|
17884
|
+
P = P.redIAdd(P).redISub(D);
|
|
17885
17885
|
var k = b.redMul(u);
|
|
17886
|
-
r + 1 < t && (l = l.redMul(
|
|
17886
|
+
r + 1 < t && (l = l.redMul(D)), o = J, u = k, b = P;
|
|
17887
17887
|
}
|
|
17888
17888
|
return this.curve.jpoint(o, b.redMul(s), u);
|
|
17889
17889
|
};
|
|
@@ -17898,9 +17898,9 @@ $t.prototype._zeroDbl = function() {
|
|
|
17898
17898
|
var u = i10.redAdd(i10).redIAdd(i10), l = u.redSqr().redISub(a).redISub(a), b = o.redIAdd(o);
|
|
17899
17899
|
b = b.redIAdd(b), b = b.redIAdd(b), t = l, r = u.redMul(a.redISub(l)).redISub(b), n = this.y.redAdd(this.y);
|
|
17900
17900
|
} else {
|
|
17901
|
-
var O = this.x.redSqr(), M = this.y.redSqr(),
|
|
17901
|
+
var O = this.x.redSqr(), M = this.y.redSqr(), D = M.redSqr(), F = this.x.redAdd(M).redSqr().redISub(O).redISub(D);
|
|
17902
17902
|
F = F.redIAdd(F);
|
|
17903
|
-
var $6 = O.redAdd(O).redIAdd(O), J = $6.redSqr(), C =
|
|
17903
|
+
var $6 = O.redAdd(O).redIAdd(O), J = $6.redSqr(), C = D.redIAdd(D);
|
|
17904
17904
|
C = C.redIAdd(C), C = C.redIAdd(C), t = J.redISub(F).redISub(F), r = $6.redMul(F.redISub(t)).redISub(C), n = this.y.redMul(this.z), n = n.redIAdd(n);
|
|
17905
17905
|
}
|
|
17906
17906
|
return this.curve.jpoint(t, r, n);
|
|
@@ -17915,9 +17915,9 @@ $t.prototype._threeDbl = function() {
|
|
|
17915
17915
|
var b = o.redIAdd(o);
|
|
17916
17916
|
b = b.redIAdd(b), b = b.redIAdd(b), r = u.redMul(a.redISub(l)).redISub(b), n = this.y.redAdd(this.y);
|
|
17917
17917
|
} else {
|
|
17918
|
-
var O = this.z.redSqr(), M = this.y.redSqr(),
|
|
17918
|
+
var O = this.z.redSqr(), M = this.y.redSqr(), D = this.x.redMul(M), F = this.x.redSub(O).redMul(this.x.redAdd(O));
|
|
17919
17919
|
F = F.redAdd(F).redIAdd(F);
|
|
17920
|
-
var $6 =
|
|
17920
|
+
var $6 = D.redIAdd(D);
|
|
17921
17921
|
$6 = $6.redIAdd($6);
|
|
17922
17922
|
var J = $6.redAdd($6);
|
|
17923
17923
|
t = F.redSqr().redISub(J), n = this.y.redAdd(this.z).redSqr().redISub(M).redISub(O);
|
|
@@ -17929,9 +17929,9 @@ $t.prototype._threeDbl = function() {
|
|
|
17929
17929
|
$t.prototype._dbl = function() {
|
|
17930
17930
|
var t = this.curve.a, r = this.x, n = this.y, i10 = this.z, s = i10.redSqr().redSqr(), o = r.redSqr(), a = n.redSqr(), u = o.redAdd(o).redIAdd(o).redIAdd(t.redMul(s)), l = r.redAdd(r);
|
|
17931
17931
|
l = l.redIAdd(l);
|
|
17932
|
-
var b = l.redMul(a), O = u.redSqr().redISub(b.redAdd(b)), M = b.redISub(O),
|
|
17933
|
-
|
|
17934
|
-
var F = u.redMul(M).redISub(
|
|
17932
|
+
var b = l.redMul(a), O = u.redSqr().redISub(b.redAdd(b)), M = b.redISub(O), D = a.redSqr();
|
|
17933
|
+
D = D.redIAdd(D), D = D.redIAdd(D), D = D.redIAdd(D);
|
|
17934
|
+
var F = u.redMul(M).redISub(D), $6 = n.redAdd(n).redMul(i10);
|
|
17935
17935
|
return this.curve.jpoint(O, F, $6);
|
|
17936
17936
|
};
|
|
17937
17937
|
$t.prototype.trpl = function() {
|
|
@@ -17945,10 +17945,10 @@ $t.prototype.trpl = function() {
|
|
|
17945
17945
|
O = O.redIAdd(O), O = O.redIAdd(O);
|
|
17946
17946
|
var M = this.x.redMul(u).redISub(O);
|
|
17947
17947
|
M = M.redIAdd(M), M = M.redIAdd(M);
|
|
17948
|
-
var
|
|
17949
|
-
|
|
17948
|
+
var D = this.y.redMul(b.redMul(l.redISub(b)).redISub(a.redMul(u)));
|
|
17949
|
+
D = D.redIAdd(D), D = D.redIAdd(D), D = D.redIAdd(D);
|
|
17950
17950
|
var F = this.z.redAdd(a).redSqr().redISub(n).redISub(u);
|
|
17951
|
-
return this.curve.jpoint(M,
|
|
17951
|
+
return this.curve.jpoint(M, D, F);
|
|
17952
17952
|
};
|
|
17953
17953
|
$t.prototype.mul = function(t, r) {
|
|
17954
17954
|
return t = new vt(t, r), this.curve._wnafMul(this, t);
|
|
@@ -18133,8 +18133,8 @@ je.prototype.dbl = function() {
|
|
|
18133
18133
|
return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();
|
|
18134
18134
|
};
|
|
18135
18135
|
je.prototype._extAdd = function(t) {
|
|
18136
|
-
var r = this.y.redSub(this.x).redMul(t.y.redSub(t.x)), n = this.y.redAdd(this.x).redMul(t.y.redAdd(t.x)), i10 = this.t.redMul(this.curve.dd).redMul(t.t), s = this.z.redMul(t.z.redAdd(t.z)), o = n.redSub(r), a = s.redSub(i10), u = s.redAdd(i10), l = n.redAdd(r), b = o.redMul(a), O = u.redMul(l), M = o.redMul(l),
|
|
18137
|
-
return this.curve.point(b, O,
|
|
18136
|
+
var r = this.y.redSub(this.x).redMul(t.y.redSub(t.x)), n = this.y.redAdd(this.x).redMul(t.y.redAdd(t.x)), i10 = this.t.redMul(this.curve.dd).redMul(t.t), s = this.z.redMul(t.z.redAdd(t.z)), o = n.redSub(r), a = s.redSub(i10), u = s.redAdd(i10), l = n.redAdd(r), b = o.redMul(a), O = u.redMul(l), M = o.redMul(l), D = a.redMul(u);
|
|
18137
|
+
return this.curve.point(b, O, D, M);
|
|
18138
18138
|
};
|
|
18139
18139
|
je.prototype._projAdd = function(t) {
|
|
18140
18140
|
var r = this.z.redMul(t.z), n = r.redSqr(), i10 = this.x.redMul(t.x), s = this.y.redMul(t.y), o = this.curve.d.redMul(i10).redMul(s), a = n.redSub(o), u = n.redAdd(o), l = this.x.redAdd(this.y).redMul(t.x.redAdd(t.y)).redISub(i10).redISub(s), b = r.redMul(a).redMul(l), O, M;
|
|
@@ -18547,8 +18547,8 @@ Ns.prototype._update = function(t, r) {
|
|
|
18547
18547
|
n[i10] = XE(rF(n[i10 - 2]), n[i10 - 7], tF(n[i10 - 15]), n[i10 - 16]);
|
|
18548
18548
|
var s = this.h[0], o = this.h[1], a = this.h[2], u = this.h[3], l = this.h[4], b = this.h[5], O = this.h[6], M = this.h[7];
|
|
18549
18549
|
for (WE(this.k.length === n.length), i10 = 0; i10 < n.length; i10++) {
|
|
18550
|
-
var
|
|
18551
|
-
M = O, O = b, b = l, l = pn(u,
|
|
18550
|
+
var D = ZE(M, eF(l), YE(l, b, O), this.k[i10], n[i10]), F = pn(jE(s), QE(s, o, a));
|
|
18551
|
+
M = O, O = b, b = l, l = pn(u, D), u = a, a = o, o = s, s = pn(D, F);
|
|
18552
18552
|
}
|
|
18553
18553
|
this.h[0] = pn(this.h[0], s), this.h[1] = pn(this.h[1], o), this.h[2] = pn(this.h[2], a), this.h[3] = pn(this.h[3], u), this.h[4] = pn(this.h[4], l), this.h[5] = pn(this.h[5], b), this.h[6] = pn(this.h[6], O), this.h[7] = pn(this.h[7], M);
|
|
18554
18554
|
};
|
|
@@ -18797,17 +18797,17 @@ ii.prototype._prepareBlock = function(t, r) {
|
|
|
18797
18797
|
};
|
|
18798
18798
|
ii.prototype._update = function(t, r) {
|
|
18799
18799
|
this._prepareBlock(t, r);
|
|
18800
|
-
var n = this.W, i10 = this.h[0], s = this.h[1], o = this.h[2], a = this.h[3], u = this.h[4], l = this.h[5], b = this.h[6], O = this.h[7], M = this.h[8],
|
|
18800
|
+
var n = this.W, i10 = this.h[0], s = this.h[1], o = this.h[2], a = this.h[3], u = this.h[4], l = this.h[5], b = this.h[6], O = this.h[7], M = this.h[8], D = this.h[9], F = this.h[10], $6 = this.h[11], J = this.h[12], C = this.h[13], P = this.h[14], k = this.h[15];
|
|
18801
18801
|
oF(this.k.length === n.length);
|
|
18802
18802
|
for (var K = 0; K < n.length; K += 2) {
|
|
18803
|
-
var X = P, Y = k, ie = bF(M,
|
|
18803
|
+
var X = P, Y = k, ie = bF(M, D), ne = SF(M, D), se = hF(M, D, F, $6, J), ve = lF(M, D, F, $6, J, C), L6 = this.k[K], g = this.k[K + 1], m = n[K], f = n[K + 1], d10 = uF(
|
|
18804
18804
|
X,
|
|
18805
18805
|
Y,
|
|
18806
18806
|
ie,
|
|
18807
18807
|
ne,
|
|
18808
18808
|
se,
|
|
18809
18809
|
ve,
|
|
18810
|
-
|
|
18810
|
+
L6,
|
|
18811
18811
|
g,
|
|
18812
18812
|
m,
|
|
18813
18813
|
f
|
|
@@ -18818,16 +18818,16 @@ ii.prototype._update = function(t, r) {
|
|
|
18818
18818
|
ne,
|
|
18819
18819
|
se,
|
|
18820
18820
|
ve,
|
|
18821
|
-
|
|
18821
|
+
L6,
|
|
18822
18822
|
g,
|
|
18823
18823
|
m,
|
|
18824
18824
|
f
|
|
18825
18825
|
);
|
|
18826
18826
|
X = yF(i10, s), Y = gF(i10, s), ie = pF(i10, s, o, a, u), ne = mF(i10, s, o, a, u, l);
|
|
18827
18827
|
var _ = rh(X, Y, ie, ne), x = nh(X, Y, ie, ne);
|
|
18828
|
-
P = J, k = C, J = F, C = $6, F = M, $6 =
|
|
18828
|
+
P = J, k = C, J = F, C = $6, F = M, $6 = D, M = rh(b, O, d10, S), D = nh(O, O, d10, S), b = u, O = l, u = o, l = a, o = i10, a = s, i10 = rh(d10, S, _, x), s = nh(d10, S, _, x);
|
|
18829
18829
|
}
|
|
18830
|
-
eo(this.h, 0, i10, s), eo(this.h, 2, o, a), eo(this.h, 4, u, l), eo(this.h, 6, b, O), eo(this.h, 8, M,
|
|
18830
|
+
eo(this.h, 0, i10, s), eo(this.h, 2, o, a), eo(this.h, 4, u, l), eo(this.h, 6, b, O), eo(this.h, 8, M, D), eo(this.h, 10, F, $6), eo(this.h, 12, J, C), eo(this.h, 14, P, k);
|
|
18831
18831
|
};
|
|
18832
18832
|
ii.prototype._digest = function(t) {
|
|
18833
18833
|
return t === "hex" ? or.toHex32(this.h, "big") : or.split32(this.h, "big");
|
|
@@ -18930,18 +18930,18 @@ Ms.outSize = 160;
|
|
|
18930
18930
|
Ms.hmacStrength = 192;
|
|
18931
18931
|
Ms.padLength = 64;
|
|
18932
18932
|
Ms.prototype._update = function(t, r) {
|
|
18933
|
-
for (var n = this.h[0], i10 = this.h[1], s = this.h[2], o = this.h[3], a = this.h[4], u = n, l = i10, b = s, O = o, M = a,
|
|
18933
|
+
for (var n = this.h[0], i10 = this.h[1], s = this.h[2], o = this.h[3], a = this.h[4], u = n, l = i10, b = s, O = o, M = a, D = 0; D < 80; D++) {
|
|
18934
18934
|
var F = dp(
|
|
18935
18935
|
Ou(
|
|
18936
|
-
hp(n, lp(
|
|
18937
|
-
DF[
|
|
18936
|
+
hp(n, lp(D, i10, s, o), t[NF[D] + r], RF(D)),
|
|
18937
|
+
DF[D]
|
|
18938
18938
|
),
|
|
18939
18939
|
a
|
|
18940
18940
|
);
|
|
18941
18941
|
n = a, a = o, o = Ou(s, 10), s = i10, i10 = F, F = dp(
|
|
18942
18942
|
Ou(
|
|
18943
|
-
hp(u, lp(79 -
|
|
18944
|
-
EF[
|
|
18943
|
+
hp(u, lp(79 - D, l, b, O), t[MF[D] + r], xF(D)),
|
|
18944
|
+
EF[D]
|
|
18945
18945
|
),
|
|
18946
18946
|
M
|
|
18947
18947
|
), u = M, M = O, O = Ou(b, 10), b = l, l = F;
|
|
@@ -20438,24 +20438,24 @@ function GF() {
|
|
|
20438
20438
|
entropy: b.entropy || i10(this.hash.hmacStrength),
|
|
20439
20439
|
entropyEnc: b.entropy && b.entropyEnc || "utf8",
|
|
20440
20440
|
nonce: this.n.toArray()
|
|
20441
|
-
}), M = this.n.byteLength(),
|
|
20441
|
+
}), M = this.n.byteLength(), D = this.n.sub(new e10(2)); ; ) {
|
|
20442
20442
|
var F = new e10(O.generate(M));
|
|
20443
|
-
if (!(F.cmp(
|
|
20443
|
+
if (!(F.cmp(D) > 0))
|
|
20444
20444
|
return F.iaddn(1), this.keyFromPrivate(F);
|
|
20445
20445
|
}
|
|
20446
20446
|
}, u.prototype._truncateToN = function(b, O) {
|
|
20447
20447
|
var M = b.byteLength() * 8 - this.n.bitLength();
|
|
20448
20448
|
return M > 0 && (b = b.ushrn(M)), !O && b.cmp(this.n) >= 0 ? b.sub(this.n) : b;
|
|
20449
|
-
}, u.prototype.sign = function(b, O, M,
|
|
20450
|
-
typeof M == "object" && (
|
|
20449
|
+
}, u.prototype.sign = function(b, O, M, D) {
|
|
20450
|
+
typeof M == "object" && (D = M, M = null), D || (D = {}), O = this.keyFromPrivate(O, M), b = this._truncateToN(new e10(b, 16));
|
|
20451
20451
|
for (var F = this.n.byteLength(), $6 = O.getPrivate().toArray("be", F), J = b.toArray("be", F), C = new t({
|
|
20452
20452
|
hash: this.hash,
|
|
20453
20453
|
entropy: $6,
|
|
20454
20454
|
nonce: J,
|
|
20455
|
-
pers:
|
|
20456
|
-
persEnc:
|
|
20455
|
+
pers: D.pers,
|
|
20456
|
+
persEnc: D.persEnc || "utf8"
|
|
20457
20457
|
}), P = this.n.sub(new e10(1)), k = 0; ; k++) {
|
|
20458
|
-
var K =
|
|
20458
|
+
var K = D.k ? D.k(k) : new e10(C.generate(this.n.byteLength()));
|
|
20459
20459
|
if (K = this._truncateToN(K, true), !(K.cmpn(1) <= 0 || K.cmp(P) >= 0)) {
|
|
20460
20460
|
var X = this.g.mul(K);
|
|
20461
20461
|
if (!X.isInfinity()) {
|
|
@@ -20464,14 +20464,14 @@ function GF() {
|
|
|
20464
20464
|
var ne = K.invm(this.n).mul(ie.mul(O.getPrivate()).iadd(b));
|
|
20465
20465
|
if (ne = ne.umod(this.n), ne.cmpn(0) !== 0) {
|
|
20466
20466
|
var se = (X.getY().isOdd() ? 1 : 0) | (Y.cmp(ie) !== 0 ? 2 : 0);
|
|
20467
|
-
return
|
|
20467
|
+
return D.canonical && ne.cmp(this.nh) > 0 && (ne = this.n.sub(ne), se ^= 1), new a({ r: ie, s: ne, recoveryParam: se });
|
|
20468
20468
|
}
|
|
20469
20469
|
}
|
|
20470
20470
|
}
|
|
20471
20471
|
}
|
|
20472
20472
|
}
|
|
20473
|
-
}, u.prototype.verify = function(b, O, M,
|
|
20474
|
-
b = this._truncateToN(new e10(b, 16)), M = this.keyFromPublic(M,
|
|
20473
|
+
}, u.prototype.verify = function(b, O, M, D) {
|
|
20474
|
+
b = this._truncateToN(new e10(b, 16)), M = this.keyFromPublic(M, D), O = new a(O, "hex");
|
|
20475
20475
|
var F = O.r, $6 = O.s;
|
|
20476
20476
|
if (F.cmpn(1) < 0 || F.cmp(this.n) >= 0 || $6.cmpn(1) < 0 || $6.cmp(this.n) >= 0)
|
|
20477
20477
|
return false;
|
|
@@ -20479,24 +20479,24 @@ function GF() {
|
|
|
20479
20479
|
return this.curve._maxwellTrick ? (k = this.g.jmulAdd(C, M.getPublic(), P), k.isInfinity() ? false : k.eqXToP(F)) : (k = this.g.mulAdd(C, M.getPublic(), P), k.isInfinity() ? false : k.getX().umod(this.n).cmp(F) === 0);
|
|
20480
20480
|
}, u.prototype.recoverPubKey = function(l, b, O, M) {
|
|
20481
20481
|
s((3 & O) === O, "The recovery param is more than two bits"), b = new a(b, M);
|
|
20482
|
-
var
|
|
20482
|
+
var D = this.n, F = new e10(l), $6 = b.r, J = b.s, C = O & 1, P = O >> 1;
|
|
20483
20483
|
if ($6.cmp(this.curve.p.umod(this.curve.n)) >= 0 && P)
|
|
20484
20484
|
throw new Error("Unable to find sencond key candinate");
|
|
20485
20485
|
P ? $6 = this.curve.pointFromX($6.add(this.curve.n), C) : $6 = this.curve.pointFromX($6, C);
|
|
20486
|
-
var k = b.r.invm(
|
|
20486
|
+
var k = b.r.invm(D), K = D.sub(F).mul(k).umod(D), X = J.mul(k).umod(D);
|
|
20487
20487
|
return this.g.mulAdd(K, $6, X);
|
|
20488
20488
|
}, u.prototype.getKeyRecoveryParam = function(l, b, O, M) {
|
|
20489
20489
|
if (b = new a(b, M), b.recoveryParam !== null)
|
|
20490
20490
|
return b.recoveryParam;
|
|
20491
|
-
for (var
|
|
20491
|
+
for (var D = 0; D < 4; D++) {
|
|
20492
20492
|
var F;
|
|
20493
20493
|
try {
|
|
20494
|
-
F = this.recoverPubKey(l, b,
|
|
20494
|
+
F = this.recoverPubKey(l, b, D);
|
|
20495
20495
|
} catch {
|
|
20496
20496
|
continue;
|
|
20497
20497
|
}
|
|
20498
20498
|
if (F.eq(O))
|
|
20499
|
-
return
|
|
20499
|
+
return D;
|
|
20500
20500
|
}
|
|
20501
20501
|
throw new Error("Unable to find valid recovery factor");
|
|
20502
20502
|
}, ah;
|
|
@@ -21923,8 +21923,8 @@ function KB() {
|
|
|
21923
21923
|
return e10.from(X.toDER());
|
|
21924
21924
|
}
|
|
21925
21925
|
function l(J, C, P) {
|
|
21926
|
-
for (var k = C.params.priv_key, K = C.params.p, X = C.params.q, Y = C.params.g, ie = new i10(0), ne, se = M(J, X).mod(X), ve = false,
|
|
21927
|
-
ne = F(X,
|
|
21926
|
+
for (var k = C.params.priv_key, K = C.params.p, X = C.params.q, Y = C.params.g, ie = new i10(0), ne, se = M(J, X).mod(X), ve = false, L6 = O(k, X, J, P); ve === false; )
|
|
21927
|
+
ne = F(X, L6, P), ie = $6(Y, ne, K, X), ve = ne.invm(X).imul(se.add(k.mul(ie))).mod(X), ve.cmpn(0) === 0 && (ve = false, ie = new i10(0));
|
|
21928
21928
|
return b(ie, ve);
|
|
21929
21929
|
}
|
|
21930
21930
|
function b(J, C) {
|
|
@@ -21937,7 +21937,7 @@ function KB() {
|
|
|
21937
21937
|
var K = e10.alloc(C.byteLength() - J.length);
|
|
21938
21938
|
J = e10.concat([K, J]);
|
|
21939
21939
|
}
|
|
21940
|
-
var X = P.length, Y =
|
|
21940
|
+
var X = P.length, Y = D(P, C), ie = e10.alloc(X);
|
|
21941
21941
|
ie.fill(1);
|
|
21942
21942
|
var ne = e10.alloc(X);
|
|
21943
21943
|
return ne = t(k, ne).update(ie).update(e10.from([0])).update(J).update(Y).digest(), ie = t(k, ne).update(ie).digest(), ne = t(k, ne).update(ie).update(e10.from([1])).update(J).update(Y).digest(), ie = t(k, ne).update(ie).digest(), { k: ne, v: ie };
|
|
@@ -21946,7 +21946,7 @@ function KB() {
|
|
|
21946
21946
|
var P = new i10(J), k = (J.length << 3) - C.bitLength();
|
|
21947
21947
|
return k > 0 && P.ishrn(k), P;
|
|
21948
21948
|
}
|
|
21949
|
-
function
|
|
21949
|
+
function D(J, C) {
|
|
21950
21950
|
J = M(J, C), J = J.mod(C);
|
|
21951
21951
|
var P = e10.from(J.toArray());
|
|
21952
21952
|
if (P.length < C.byteLength()) {
|
|
@@ -21975,7 +21975,7 @@ function zB() {
|
|
|
21975
21975
|
return uh;
|
|
21976
21976
|
Ap = 1;
|
|
21977
21977
|
var e10 = qe.Buffer, t = _0, r = M0().ec, n = cd, i10 = r6;
|
|
21978
|
-
function s(l, b, O, M,
|
|
21978
|
+
function s(l, b, O, M, D) {
|
|
21979
21979
|
var F = n(O);
|
|
21980
21980
|
if (F.type === "ec") {
|
|
21981
21981
|
if (M !== "ecdsa" && M !== "ecdsa/rsa")
|
|
@@ -21987,7 +21987,7 @@ function zB() {
|
|
|
21987
21987
|
return a(l, b, F);
|
|
21988
21988
|
} else if (M !== "rsa" && M !== "ecdsa/rsa")
|
|
21989
21989
|
throw new Error("wrong public key type");
|
|
21990
|
-
b = e10.concat([
|
|
21990
|
+
b = e10.concat([D, b]);
|
|
21991
21991
|
for (var $6 = F.modulus.byteLength(), J = [1], C = 0; b.length + J.length + 2 < $6; )
|
|
21992
21992
|
J.push(255), C++;
|
|
21993
21993
|
J.push(0);
|
|
@@ -22005,13 +22005,13 @@ function zB() {
|
|
|
22005
22005
|
var M = i10[O.data.algorithm.curve.join(".")];
|
|
22006
22006
|
if (!M)
|
|
22007
22007
|
throw new Error("unknown curve " + O.data.algorithm.curve.join("."));
|
|
22008
|
-
var
|
|
22009
|
-
return
|
|
22008
|
+
var D = new r(M), F = O.data.subjectPrivateKey.data;
|
|
22009
|
+
return D.verify(b, l, F);
|
|
22010
22010
|
}
|
|
22011
22011
|
function a(l, b, O) {
|
|
22012
|
-
var M = O.data.p,
|
|
22013
|
-
u(C,
|
|
22014
|
-
var k = t.mont(M), K = C.invm(
|
|
22012
|
+
var M = O.data.p, D = O.data.q, F = O.data.g, $6 = O.data.pub_key, J = n.signature.decode(l, "der"), C = J.s, P = J.r;
|
|
22013
|
+
u(C, D), u(P, D);
|
|
22014
|
+
var k = t.mont(M), K = C.invm(D), X = F.toRed(k).redPow(new t(b).mul(K).mod(D)).fromRed().mul($6.toRed(k).redPow(P.mul(K).mod(D)).fromRed()).mod(M).mod(D);
|
|
22015
22015
|
return X.cmp(P) === 0;
|
|
22016
22016
|
}
|
|
22017
22017
|
function u(l, b) {
|
|
@@ -22038,14 +22038,14 @@ function WB() {
|
|
|
22038
22038
|
throw new Error("Unknown message digest");
|
|
22039
22039
|
this._hashType = M.hash, this._hash = t(M.hash), this._tag = M.id, this._signType = M.sign;
|
|
22040
22040
|
}
|
|
22041
|
-
n(a, r.Writable), a.prototype._write = function(M,
|
|
22041
|
+
n(a, r.Writable), a.prototype._write = function(M, D, F) {
|
|
22042
22042
|
this._hash.update(M), F();
|
|
22043
|
-
}, a.prototype.update = function(M,
|
|
22044
|
-
return typeof M == "string" && (M = e10.from(M,
|
|
22045
|
-
}, a.prototype.sign = function(M,
|
|
22043
|
+
}, a.prototype.update = function(M, D) {
|
|
22044
|
+
return typeof M == "string" && (M = e10.from(M, D)), this._hash.update(M), this;
|
|
22045
|
+
}, a.prototype.sign = function(M, D) {
|
|
22046
22046
|
this.end();
|
|
22047
22047
|
var F = this._hash.digest(), $6 = i10(F, M, this._hashType, this._signType, this._tag);
|
|
22048
|
-
return
|
|
22048
|
+
return D ? $6.toString(D) : $6;
|
|
22049
22049
|
};
|
|
22050
22050
|
function u(O) {
|
|
22051
22051
|
r.Writable.call(this);
|
|
@@ -22054,14 +22054,14 @@ function WB() {
|
|
|
22054
22054
|
throw new Error("Unknown message digest");
|
|
22055
22055
|
this._hash = t(M.hash), this._tag = M.id, this._signType = M.sign;
|
|
22056
22056
|
}
|
|
22057
|
-
n(u, r.Writable), u.prototype._write = function(M,
|
|
22057
|
+
n(u, r.Writable), u.prototype._write = function(M, D, F) {
|
|
22058
22058
|
this._hash.update(M), F();
|
|
22059
|
-
}, u.prototype.update = function(M,
|
|
22060
|
-
return typeof M == "string" && (M = e10.from(M,
|
|
22061
|
-
}, u.prototype.verify = function(M,
|
|
22062
|
-
typeof
|
|
22059
|
+
}, u.prototype.update = function(M, D) {
|
|
22060
|
+
return typeof M == "string" && (M = e10.from(M, D)), this._hash.update(M), this;
|
|
22061
|
+
}, u.prototype.verify = function(M, D, F) {
|
|
22062
|
+
typeof D == "string" && (D = e10.from(D, F)), this.end();
|
|
22063
22063
|
var $6 = this._hash.digest();
|
|
22064
|
-
return s(
|
|
22064
|
+
return s(D, $6, M, this._signType, this._tag);
|
|
22065
22065
|
};
|
|
22066
22066
|
function l(O) {
|
|
22067
22067
|
return new a(O);
|
|
@@ -22421,15 +22421,15 @@ class Ve {
|
|
|
22421
22421
|
}
|
|
22422
22422
|
equals(t) {
|
|
22423
22423
|
Lp(t);
|
|
22424
|
-
const { x: r, y: n, z: i10 } = this, { x: s, y: o, z: a } = t, u = ye(i10 * i10), l = ye(a * a), b = ye(r * l), O = ye(s * u), M = ye(ye(n * a) * l),
|
|
22425
|
-
return b === O && M ===
|
|
22424
|
+
const { x: r, y: n, z: i10 } = this, { x: s, y: o, z: a } = t, u = ye(i10 * i10), l = ye(a * a), b = ye(r * l), O = ye(s * u), M = ye(ye(n * a) * l), D = ye(ye(o * i10) * u);
|
|
22425
|
+
return b === O && M === D;
|
|
22426
22426
|
}
|
|
22427
22427
|
negate() {
|
|
22428
22428
|
return new Ve(this.x, ye(-this.y), this.z);
|
|
22429
22429
|
}
|
|
22430
22430
|
double() {
|
|
22431
|
-
const { x: t, y: r, z: n } = this, i10 = ye(t * t), s = ye(r * r), o = ye(s * s), a = t + s, u = ye(io * (ye(a * a) - i10 - o)), l = ye($f * i10), b = ye(l * l), O = ye(b - io * u), M = ye(l * (u - O) - Cp * o),
|
|
22432
|
-
return new Ve(O, M,
|
|
22431
|
+
const { x: t, y: r, z: n } = this, i10 = ye(t * t), s = ye(r * r), o = ye(s * s), a = t + s, u = ye(io * (ye(a * a) - i10 - o)), l = ye($f * i10), b = ye(l * l), O = ye(b - io * u), M = ye(l * (u - O) - Cp * o), D = ye(io * r * n);
|
|
22432
|
+
return new Ve(O, M, D);
|
|
22433
22433
|
}
|
|
22434
22434
|
add(t) {
|
|
22435
22435
|
Lp(t);
|
|
@@ -22438,7 +22438,7 @@ class Ve {
|
|
|
22438
22438
|
return this;
|
|
22439
22439
|
if (r === He || n === He)
|
|
22440
22440
|
return t;
|
|
22441
|
-
const u = ye(i10 * i10), l = ye(a * a), b = ye(r * l), O = ye(s * u), M = ye(ye(n * a) * l),
|
|
22441
|
+
const u = ye(i10 * i10), l = ye(a * a), b = ye(r * l), O = ye(s * u), M = ye(ye(n * a) * l), D = ye(ye(o * i10) * u), F = ye(O - b), $6 = ye(D - M);
|
|
22442
22442
|
if (F === He)
|
|
22443
22443
|
return $6 === He ? this.double() : Ve.ZERO;
|
|
22444
22444
|
const J = ye(F * F), C = ye(F * J), P = ye(b * J), k = ye($6 * $6 - C - io * P), K = ye($6 * (P - k) - M * C), X = ye(i10 * a * F);
|
|
@@ -22486,10 +22486,10 @@ class Ve {
|
|
|
22486
22486
|
let s = Ve.ZERO, o = Ve.BASE;
|
|
22487
22487
|
const a = 1 + (xu ? 128 / n : 256 / n), u = 2 ** (n - 1), l = BigInt(2 ** n - 1), b = 2 ** n, O = BigInt(n);
|
|
22488
22488
|
for (let M = 0; M < a; M++) {
|
|
22489
|
-
const
|
|
22489
|
+
const D = M * u;
|
|
22490
22490
|
let F = Number(t & l);
|
|
22491
22491
|
t >>= O, F > u && (F -= b, t += rt);
|
|
22492
|
-
const $6 =
|
|
22492
|
+
const $6 = D, J = D + Math.abs(F) - 1, C = M % 2 !== 0, P = F < 0;
|
|
22493
22493
|
F === 0 ? o = o.add(Nu(C, i10[$6])) : s = s.add(Nu(P, i10[J]));
|
|
22494
22494
|
}
|
|
22495
22495
|
return { p: s, f: o };
|
|
@@ -22498,8 +22498,8 @@ class Ve {
|
|
|
22498
22498
|
let n = Hp(t), i10, s;
|
|
22499
22499
|
if (xu) {
|
|
22500
22500
|
const { k1neg: o, k1: a, k2neg: u, k2: l } = Ru.splitScalar(n);
|
|
22501
|
-
let { p: b, f: O } = this.wNAF(a, r), { p: M, f:
|
|
22502
|
-
b = Nu(o, b), M = Nu(u, M), M = new Ve(ye(M.x * Ru.beta), M.y, M.z), i10 = b.add(M), s = O.add(
|
|
22501
|
+
let { p: b, f: O } = this.wNAF(a, r), { p: M, f: D } = this.wNAF(l, r);
|
|
22502
|
+
b = Nu(o, b), M = Nu(u, M), M = new Ve(ye(M.x * Ru.beta), M.y, M.z), i10 = b.add(M), s = O.add(D);
|
|
22503
22503
|
} else {
|
|
22504
22504
|
const { p: o, f: a } = this.wNAF(n, r);
|
|
22505
22505
|
i10 = o, s = a;
|
|
@@ -22566,7 +22566,7 @@ class Ke {
|
|
|
22566
22566
|
const { r: i10, s } = DJ(r);
|
|
22567
22567
|
if (![0, 1, 2, 3].includes(n))
|
|
22568
22568
|
throw new Error("Cannot recover: invalid recovery bit");
|
|
22569
|
-
const o = g6(Zf(t)), { n: a } = _t, u = n === 2 || n === 3 ? i10 + a : i10, l = yu(u, a), b = ye(-o * l, a), O = ye(s * l, a), M = n & 1 ? "03" : "02",
|
|
22569
|
+
const o = g6(Zf(t)), { n: a } = _t, u = n === 2 || n === 3 ? i10 + a : i10, l = yu(u, a), b = ye(-o * l, a), O = ye(s * l, a), M = n & 1 ? "03" : "02", D = Ke.fromHex(M + Ba(u)), F = Ke.BASE.multiplyAndAddUnsafe(D, b, O);
|
|
22570
22570
|
if (!F)
|
|
22571
22571
|
throw new Error("Cannot recover signature: point at infinify");
|
|
22572
22572
|
return F.assertValidity(), F;
|
|
@@ -22780,7 +22780,7 @@ function Er(e10, t) {
|
|
|
22780
22780
|
return n;
|
|
22781
22781
|
}
|
|
22782
22782
|
function OJ(e10) {
|
|
22783
|
-
const { P: t } = _t, r = BigInt(6), n = BigInt(11), i10 = BigInt(22), s = BigInt(23), o = BigInt(44), a = BigInt(88), u = e10 * e10 * e10 % t, l = u * u * e10 % t, b = Er(l, $f) * l % t, O = Er(b, $f) * l % t, M = Er(O, io) * u % t,
|
|
22783
|
+
const { P: t } = _t, r = BigInt(6), n = BigInt(11), i10 = BigInt(22), s = BigInt(23), o = BigInt(44), a = BigInt(88), u = e10 * e10 * e10 % t, l = u * u * e10 % t, b = Er(l, $f) * l % t, O = Er(b, $f) * l % t, M = Er(O, io) * u % t, D = Er(M, n) * M % t, F = Er(D, i10) * D % t, $6 = Er(F, o) * F % t, J = Er($6, a) * $6 % t, C = Er(J, o) * F % t, P = Er(C, $f) * l % t, k = Er(P, s) * D % t, K = Er(k, r) * u % t, X = Er(K, io);
|
|
22784
22784
|
if (X * X % t !== e10)
|
|
22785
22785
|
throw new Error("Cannot find square root");
|
|
22786
22786
|
return X;
|
|
@@ -24224,22 +24224,22 @@ class G0 extends tq {
|
|
|
24224
24224
|
throw new Error("Missing maxFeePerGas");
|
|
24225
24225
|
if (!M && !b)
|
|
24226
24226
|
throw new Error("Missing gasPrice");
|
|
24227
|
-
const { toHexString:
|
|
24227
|
+
const { toHexString: D } = await import("./index_169417bf.js"), $$1 = "0x" + BigInt(o || await this.provider.getTransactionCount(await this.getAddress(), "pending")).toString(16);
|
|
24228
24228
|
console.log("value: ", i11);
|
|
24229
24229
|
let J = {
|
|
24230
|
-
gas:
|
|
24230
|
+
gas: D(BigInt(s10)),
|
|
24231
24231
|
addressNList: [2147483692, 2147483708, 2147483648, 0, 0],
|
|
24232
24232
|
from: this.address,
|
|
24233
|
-
chainId:
|
|
24233
|
+
chainId: D(BigInt($[this.chain])),
|
|
24234
24234
|
to: n10,
|
|
24235
|
-
value:
|
|
24235
|
+
value: D(BigInt(i11 || 0)),
|
|
24236
24236
|
nonce: $$1,
|
|
24237
24237
|
data: a,
|
|
24238
24238
|
...M ? {
|
|
24239
|
-
maxFeePerGas:
|
|
24240
|
-
maxPriorityFeePerGas:
|
|
24239
|
+
maxFeePerGas: D(BigInt((u == null ? void 0 : u.toString()) || "0")),
|
|
24240
|
+
maxPriorityFeePerGas: D(BigInt((l == null ? void 0 : l.toString()) || "0"))
|
|
24241
24241
|
} : {
|
|
24242
|
-
gasPrice: "gasPrice" in O ?
|
|
24242
|
+
gasPrice: "gasPrice" in O ? D(BigInt((b == null ? void 0 : b.toString()) || "0")) : void 0
|
|
24243
24243
|
// Fixed syntax error and structure here
|
|
24244
24244
|
}
|
|
24245
24245
|
};
|
|
@@ -24267,10 +24267,10 @@ const rq = async ({ sdk: e10 }) => {
|
|
|
24267
24267
|
}) => {
|
|
24268
24268
|
var M;
|
|
24269
24269
|
try {
|
|
24270
|
-
const
|
|
24270
|
+
const D = await t.getAccount(b), F = await build.StargateClient.connect(I.THORChain), $6 = await e10.thorchain.thorchainSignAminoTransfer({
|
|
24271
24271
|
signDoc: {
|
|
24272
|
-
account_number: ((M =
|
|
24273
|
-
chain_id:
|
|
24272
|
+
account_number: ((M = D == null ? void 0 : D.accountNumber) == null ? void 0 : M.toString()) ?? "0",
|
|
24273
|
+
chain_id: d.THORChain,
|
|
24274
24274
|
fee: { gas: "500000000", amount: [] },
|
|
24275
24275
|
msgs: [
|
|
24276
24276
|
{
|
|
@@ -24283,15 +24283,15 @@ const rq = async ({ sdk: e10 }) => {
|
|
|
24283
24283
|
}
|
|
24284
24284
|
],
|
|
24285
24285
|
memo: O || "",
|
|
24286
|
-
sequence: (
|
|
24286
|
+
sequence: (D == null ? void 0 : D.sequence.toString()) ?? "0"
|
|
24287
24287
|
},
|
|
24288
24288
|
signerAddress: b
|
|
24289
24289
|
}), J = atob($6.serialized), C = new Uint8Array(J.length);
|
|
24290
24290
|
for (let k = 0; k < J.length; k++)
|
|
24291
24291
|
C[k] = J.charCodeAt(k);
|
|
24292
24292
|
return (await F.broadcastTx(C)).transactionHash;
|
|
24293
|
-
} catch (
|
|
24294
|
-
throw console.error(
|
|
24293
|
+
} catch (D) {
|
|
24294
|
+
throw console.error(D), D;
|
|
24295
24295
|
}
|
|
24296
24296
|
}, i$1 = async ({ assetValue: a, recipient: u, memo: l }) => n({
|
|
24297
24297
|
from: r,
|
|
@@ -24306,16 +24306,16 @@ const rq = async ({ sdk: e10 }) => {
|
|
|
24306
24306
|
}) => {
|
|
24307
24307
|
var b, O;
|
|
24308
24308
|
try {
|
|
24309
|
-
const M = Xa(i.THORChain, false),
|
|
24309
|
+
const M = Xa(i.THORChain, false), D = await t.getAccount(r), F = await e10.thorchain.thorchainSignAminoDeposit({
|
|
24310
24310
|
signerAddress: r,
|
|
24311
24311
|
signDoc: {
|
|
24312
24312
|
memo: l,
|
|
24313
|
-
sequence: (
|
|
24313
|
+
sequence: (D == null ? void 0 : D.sequence.toString()) ?? "0",
|
|
24314
24314
|
// FIXME: @highlander - this type is missing from source signature
|
|
24315
24315
|
// @ts-expect-error
|
|
24316
24316
|
source: ((b = M == null ? void 0 : M.source) == null ? void 0 : b.toString()) ?? "0",
|
|
24317
|
-
account_number: ((O =
|
|
24318
|
-
chain_id:
|
|
24317
|
+
account_number: ((O = D == null ? void 0 : D.accountNumber) == null ? void 0 : O.toString()) ?? "0",
|
|
24318
|
+
chain_id: d.THORChain,
|
|
24319
24319
|
fee: { gas: "500000000", amount: [{ amount: "2500", denom: "rune" }] },
|
|
24320
24320
|
msgs: [
|
|
24321
24321
|
{
|
|
@@ -24359,15 +24359,15 @@ function nq(e10) {
|
|
|
24359
24359
|
t[s] = n;
|
|
24360
24360
|
}
|
|
24361
24361
|
var o = e10.length, a = e10.charAt(0), u = Math.log(o) / Math.log(256), l = Math.log(256) / Math.log(o);
|
|
24362
|
-
function b(
|
|
24363
|
-
if ((Array.isArray(
|
|
24362
|
+
function b(D) {
|
|
24363
|
+
if ((Array.isArray(D) || D instanceof Uint8Array) && (D = Eu.from(D)), !Eu.isBuffer(D))
|
|
24364
24364
|
throw new TypeError("Expected Buffer");
|
|
24365
|
-
if (
|
|
24365
|
+
if (D.length === 0)
|
|
24366
24366
|
return "";
|
|
24367
|
-
for (var F = 0, $6 = 0, J = 0, C =
|
|
24367
|
+
for (var F = 0, $6 = 0, J = 0, C = D.length; J !== C && D[J] === 0; )
|
|
24368
24368
|
J++, F++;
|
|
24369
24369
|
for (var P = (C - J) * l + 1 >>> 0, k = new Uint8Array(P); J !== C; ) {
|
|
24370
|
-
for (var K =
|
|
24370
|
+
for (var K = D[J], X = 0, Y = P - 1; (K !== 0 || X < $6) && Y !== -1; Y--, X++)
|
|
24371
24371
|
K += 256 * k[Y] >>> 0, k[Y] = K % o >>> 0, K = K / o >>> 0;
|
|
24372
24372
|
if (K !== 0)
|
|
24373
24373
|
throw new Error("Non-zero carry");
|
|
@@ -24379,15 +24379,15 @@ function nq(e10) {
|
|
|
24379
24379
|
ne += e10.charAt(k[ie]);
|
|
24380
24380
|
return ne;
|
|
24381
24381
|
}
|
|
24382
|
-
function O(
|
|
24383
|
-
if (typeof
|
|
24382
|
+
function O(D) {
|
|
24383
|
+
if (typeof D != "string")
|
|
24384
24384
|
throw new TypeError("Expected String");
|
|
24385
|
-
if (
|
|
24385
|
+
if (D.length === 0)
|
|
24386
24386
|
return Eu.alloc(0);
|
|
24387
|
-
for (var F = 0, $6 = 0, J = 0;
|
|
24387
|
+
for (var F = 0, $6 = 0, J = 0; D[F] === a; )
|
|
24388
24388
|
$6++, F++;
|
|
24389
|
-
for (var C = (
|
|
24390
|
-
var k = t[
|
|
24389
|
+
for (var C = (D.length - F) * u + 1 >>> 0, P = new Uint8Array(C); D[F]; ) {
|
|
24390
|
+
var k = t[D.charCodeAt(F)];
|
|
24391
24391
|
if (k === 255)
|
|
24392
24392
|
return;
|
|
24393
24393
|
for (var K = 0, X = C - 1; (k !== 0 || K < J) && X !== -1; X--, K++)
|
|
@@ -24404,8 +24404,8 @@ function nq(e10) {
|
|
|
24404
24404
|
ie[ne++] = P[Y++];
|
|
24405
24405
|
return ie;
|
|
24406
24406
|
}
|
|
24407
|
-
function M(
|
|
24408
|
-
var F = O(
|
|
24407
|
+
function M(D) {
|
|
24408
|
+
var F = O(D);
|
|
24409
24409
|
if (F)
|
|
24410
24410
|
return F;
|
|
24411
24411
|
throw new Error("Non-base" + o + " character");
|
|
@@ -24552,7 +24552,7 @@ var gq = {
|
|
|
24552
24552
|
function M(A) {
|
|
24553
24553
|
return A < 1e7 ? [A] : A < 1e14 ? [A % 1e7, Math.floor(A / 1e7)] : [A % 1e7, Math.floor(A / 1e7) % 1e7, Math.floor(A / 1e14)];
|
|
24554
24554
|
}
|
|
24555
|
-
function
|
|
24555
|
+
function D(A) {
|
|
24556
24556
|
F(A);
|
|
24557
24557
|
var E = A.length;
|
|
24558
24558
|
if (E < 4 && x(A, o) < 0)
|
|
@@ -24637,13 +24637,13 @@ var gq = {
|
|
|
24637
24637
|
}
|
|
24638
24638
|
function X(A, E, V) {
|
|
24639
24639
|
var v;
|
|
24640
|
-
return x(A, E) >= 0 ? v = K(A, E) : (v = K(E, A), V = !V), v =
|
|
24640
|
+
return x(A, E) >= 0 ? v = K(A, E) : (v = K(E, A), V = !V), v = D(v), typeof v == "number" ? (V && (v = -v), new b(v)) : new l(v, V);
|
|
24641
24641
|
}
|
|
24642
24642
|
function Y(A, E, V) {
|
|
24643
24643
|
var v = A.length, c = new Array(v), p = -E, N = n, B, H;
|
|
24644
24644
|
for (B = 0; B < v; B++)
|
|
24645
24645
|
H = A[B] + p, p = Math.floor(H / N), H %= N, c[B] = H < 0 ? H + N : H;
|
|
24646
|
-
return c =
|
|
24646
|
+
return c = D(c), typeof c == "number" ? (V && (c = -c), new b(c)) : new l(c, V);
|
|
24647
24647
|
}
|
|
24648
24648
|
l.prototype.subtract = function(A) {
|
|
24649
24649
|
var E = le(A);
|
|
@@ -24697,7 +24697,7 @@ var gq = {
|
|
|
24697
24697
|
var v = A.slice(V), c = A.slice(0, V), p = E.slice(V), N = E.slice(0, V), B = ve(c, N), H = ve(v, p), z = ve(P(c, v), P(N, p)), ue = P(P(B, se(K(K(z, B), H), V)), se(H, 2 * V));
|
|
24698
24698
|
return F(ue), ue;
|
|
24699
24699
|
}
|
|
24700
|
-
function
|
|
24700
|
+
function L6(A, E) {
|
|
24701
24701
|
return -0.012 * A - 0.012 * E + 15e-6 * A * E > 0;
|
|
24702
24702
|
}
|
|
24703
24703
|
l.prototype.multiply = function(A) {
|
|
@@ -24713,7 +24713,7 @@ var gq = {
|
|
|
24713
24713
|
return new l(ne(V, p), c);
|
|
24714
24714
|
v = M(p);
|
|
24715
24715
|
}
|
|
24716
|
-
return
|
|
24716
|
+
return L6(V.length, v.length) ? new l(ve(V, v), c) : new l(ie(V, v), c);
|
|
24717
24717
|
}, l.prototype.times = l.prototype.multiply;
|
|
24718
24718
|
function g(A, E, V) {
|
|
24719
24719
|
return A < n ? new l(ne(E, A), V) : new l(ie(E, M(A)), V);
|
|
@@ -24753,9 +24753,9 @@ var gq = {
|
|
|
24753
24753
|
}
|
|
24754
24754
|
p[ce] = ue;
|
|
24755
24755
|
}
|
|
24756
|
-
return H = S(H, B)[0], [
|
|
24756
|
+
return H = S(H, B)[0], [D(p), D(H)];
|
|
24757
24757
|
}
|
|
24758
|
-
function
|
|
24758
|
+
function d10(A, E) {
|
|
24759
24759
|
for (var V = A.length, v = E.length, c = [], p = [], N = n, B, H, z, ue, ce; V; ) {
|
|
24760
24760
|
if (p.unshift(A[--V]), F(p), x(p, E) < 0) {
|
|
24761
24761
|
c.push(0);
|
|
@@ -24769,7 +24769,7 @@ var gq = {
|
|
|
24769
24769
|
} while (B);
|
|
24770
24770
|
c.push(B), p = K(p, ce);
|
|
24771
24771
|
}
|
|
24772
|
-
return c.reverse(), [
|
|
24772
|
+
return c.reverse(), [D(c), D(p)];
|
|
24773
24773
|
}
|
|
24774
24774
|
function S(A, E) {
|
|
24775
24775
|
var V = A.length, v = $6(V), c = n, p, N, B, H;
|
|
@@ -24790,7 +24790,7 @@ var gq = {
|
|
|
24790
24790
|
return [A.negate(), u[0]];
|
|
24791
24791
|
var B = Math.abs(p);
|
|
24792
24792
|
if (B < n) {
|
|
24793
|
-
V = S(c, B), N =
|
|
24793
|
+
V = S(c, B), N = D(V[0]);
|
|
24794
24794
|
var H = V[1];
|
|
24795
24795
|
return A.sign && (H = -H), typeof N == "number" ? (A.sign !== v.sign && (N = -N), [new b(N), new b(H)]) : [new l(N, A.sign !== v.sign), new b(H)];
|
|
24796
24796
|
}
|
|
@@ -24801,7 +24801,7 @@ var gq = {
|
|
|
24801
24801
|
return [u[0], A];
|
|
24802
24802
|
if (z === 0)
|
|
24803
24803
|
return [u[A.sign === v.sign ? 1 : -1], u[0]];
|
|
24804
|
-
c.length + p.length <= 200 ? V = f(c, p) : V =
|
|
24804
|
+
c.length + p.length <= 200 ? V = f(c, p) : V = d10(c, p), N = V[0];
|
|
24805
24805
|
var ue = A.sign !== v.sign, ce = V[1], fe = A.sign;
|
|
24806
24806
|
return typeof N == "number" ? (ue && (N = -N), N = new b(N)) : N = new l(N, ue), typeof ce == "number" ? (fe && (ce = -ce), ce = new b(ce)) : ce = new l(ce, fe), [N, ce];
|
|
24807
24807
|
}
|
|
@@ -24912,7 +24912,7 @@ var gq = {
|
|
|
24912
24912
|
var E = le(A), V = E.value;
|
|
24913
24913
|
return V === 0 ? false : V === 1 ? true : V === 2 ? this.isEven() : this.mod(E).equals(u[0]);
|
|
24914
24914
|
}, b.prototype.isDivisibleBy = l.prototype.isDivisibleBy;
|
|
24915
|
-
function
|
|
24915
|
+
function T(A) {
|
|
24916
24916
|
var E = A.abs();
|
|
24917
24917
|
if (E.isUnit())
|
|
24918
24918
|
return false;
|
|
@@ -24940,7 +24940,7 @@ var gq = {
|
|
|
24940
24940
|
return true;
|
|
24941
24941
|
}
|
|
24942
24942
|
l.prototype.isPrime = function(A) {
|
|
24943
|
-
var E =
|
|
24943
|
+
var E = T(this);
|
|
24944
24944
|
if (E !== r)
|
|
24945
24945
|
return E;
|
|
24946
24946
|
var V = this.abs(), v = V.bitLength();
|
|
@@ -24950,7 +24950,7 @@ var gq = {
|
|
|
24950
24950
|
N.push(t(B + 2));
|
|
24951
24951
|
return y(V, N);
|
|
24952
24952
|
}, b.prototype.isPrime = l.prototype.isPrime, l.prototype.isProbablePrime = function(A) {
|
|
24953
|
-
var E =
|
|
24953
|
+
var E = T(this);
|
|
24954
24954
|
if (E !== r)
|
|
24955
24955
|
return E;
|
|
24956
24956
|
for (var V = this.abs(), v = A === r ? 5 : A, c = [], p = 0; p < v; p++)
|
|
@@ -25080,7 +25080,7 @@ var gq = {
|
|
|
25080
25080
|
var z = B ? c.value[H] : n, ue = J(Math.random() * z);
|
|
25081
25081
|
N.unshift(ue), ue < z && (B = false);
|
|
25082
25082
|
}
|
|
25083
|
-
return N =
|
|
25083
|
+
return N = D(N), V.add(typeof N == "number" ? new b(N) : new l(N, false));
|
|
25084
25084
|
}
|
|
25085
25085
|
var he = function(A, E) {
|
|
25086
25086
|
for (var V = A.length, v, c = Math.abs(E), v = 0; v < V; v++) {
|
|
@@ -25689,7 +25689,7 @@ const Qq = async function({ sdk: e10, chain: t, utxoApiKey: r, api: n }) {
|
|
|
25689
25689
|
memo: P,
|
|
25690
25690
|
feeOptionKey: J,
|
|
25691
25691
|
recipient: $6,
|
|
25692
|
-
feeRate: C || (await i$1.getFeeRates())[J ||
|
|
25692
|
+
feeRate: C || (await i$1.getFeeRates())[J || L.Fast],
|
|
25693
25693
|
sender: F,
|
|
25694
25694
|
fetchTxHex: t
|
|
25695
25695
|
}), Y = [];
|