@btc-vision/transaction 1.8.0-beta.0 → 1.8.0-beta.3
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/browser/_version.d.ts +1 -1
- package/browser/btc-vision-bitcoin.js +1862 -2431
- package/browser/index.js +1020 -1012
- package/browser/keypair/EcKeyPair.d.ts +1 -0
- package/browser/noble-curves.js +2006 -2150
- package/browser/noble-hashes.js +2761 -1003
- package/browser/vendors.js +5354 -5123
- package/build/_version.d.ts +1 -1
- package/build/_version.js +1 -1
- package/build/keypair/Address.js +1 -1
- package/build/keypair/EcKeyPair.d.ts +1 -0
- package/build/keypair/EcKeyPair.js +16 -7
- package/build/tsconfig.build.tsbuildinfo +1 -1
- package/package.json +8 -8
- package/src/_version.ts +1 -1
- package/src/crypto/crypto-browser.js +3 -4
- package/src/keypair/Address.ts +1 -1
- package/src/keypair/EcKeyPair.ts +19 -8
package/browser/noble-hashes.js
CHANGED
|
@@ -1,187 +1,425 @@
|
|
|
1
|
-
|
|
2
|
-
function
|
|
1
|
+
import { g as ne } from "./vendors.js";
|
|
2
|
+
function x0(t) {
|
|
3
3
|
return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
|
|
4
4
|
}
|
|
5
|
-
function
|
|
6
|
-
if (!
|
|
7
|
-
throw new Error("positive integer expected, got " + t);
|
|
8
|
-
}
|
|
9
|
-
function ht(t, ...e) {
|
|
10
|
-
if (!Ae(t))
|
|
5
|
+
function re(t, ...e) {
|
|
6
|
+
if (!x0(t))
|
|
11
7
|
throw new Error("Uint8Array expected");
|
|
12
8
|
if (e.length > 0 && !e.includes(t.length))
|
|
13
9
|
throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
|
|
14
10
|
}
|
|
15
|
-
function
|
|
11
|
+
function he(t, e = !0) {
|
|
12
|
+
if (t.destroyed)
|
|
13
|
+
throw new Error("Hash instance has been destroyed");
|
|
14
|
+
if (e && t.finished)
|
|
15
|
+
throw new Error("Hash#digest() has already been called");
|
|
16
|
+
}
|
|
17
|
+
function H0(t, e) {
|
|
18
|
+
re(t);
|
|
19
|
+
const n = e.outputLen;
|
|
20
|
+
if (t.length < n)
|
|
21
|
+
throw new Error("digestInto() expects output buffer of length at least " + n);
|
|
22
|
+
}
|
|
23
|
+
function se(...t) {
|
|
24
|
+
for (let e = 0; e < t.length; e++)
|
|
25
|
+
t[e].fill(0);
|
|
26
|
+
}
|
|
27
|
+
function zt(t) {
|
|
28
|
+
return new DataView(t.buffer, t.byteOffset, t.byteLength);
|
|
29
|
+
}
|
|
30
|
+
function dt(t, e) {
|
|
31
|
+
return t << 32 - e | t >>> e;
|
|
32
|
+
}
|
|
33
|
+
function A0(t) {
|
|
34
|
+
if (typeof t != "string")
|
|
35
|
+
throw new Error("string expected");
|
|
36
|
+
return new Uint8Array(new TextEncoder().encode(t));
|
|
37
|
+
}
|
|
38
|
+
function je(t) {
|
|
39
|
+
return typeof t == "string" && (t = A0(t)), re(t), t;
|
|
40
|
+
}
|
|
41
|
+
class y0 {
|
|
42
|
+
}
|
|
43
|
+
function p0(t) {
|
|
44
|
+
const e = (h) => t().update(je(h)).digest(), n = t();
|
|
45
|
+
return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
|
|
46
|
+
}
|
|
47
|
+
function _0(t, e, n, h) {
|
|
48
|
+
if (typeof t.setBigUint64 == "function")
|
|
49
|
+
return t.setBigUint64(e, n, h);
|
|
50
|
+
const c = BigInt(32), i = BigInt(4294967295), r = Number(n >> c & i), a = Number(n & i), b = h ? 4 : 0, x = h ? 0 : 4;
|
|
51
|
+
t.setUint32(e + b, r, h), t.setUint32(e + x, a, h);
|
|
52
|
+
}
|
|
53
|
+
function g0(t, e, n) {
|
|
54
|
+
return t & e ^ ~t & n;
|
|
55
|
+
}
|
|
56
|
+
function S0(t, e, n) {
|
|
57
|
+
return t & e ^ t & n ^ e & n;
|
|
58
|
+
}
|
|
59
|
+
let w0 = class extends y0 {
|
|
60
|
+
constructor(e, n, h, c) {
|
|
61
|
+
super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = e, this.outputLen = n, this.padOffset = h, this.isLE = c, this.buffer = new Uint8Array(e), this.view = zt(this.buffer);
|
|
62
|
+
}
|
|
63
|
+
update(e) {
|
|
64
|
+
he(this), e = je(e), re(e);
|
|
65
|
+
const { view: n, buffer: h, blockLen: c } = this, i = e.length;
|
|
66
|
+
for (let r = 0; r < i; ) {
|
|
67
|
+
const a = Math.min(c - this.pos, i - r);
|
|
68
|
+
if (a === c) {
|
|
69
|
+
const b = zt(e);
|
|
70
|
+
for (; c <= i - r; r += c)
|
|
71
|
+
this.process(b, r);
|
|
72
|
+
continue;
|
|
73
|
+
}
|
|
74
|
+
h.set(e.subarray(r, r + a), this.pos), this.pos += a, r += a, this.pos === c && (this.process(n, 0), this.pos = 0);
|
|
75
|
+
}
|
|
76
|
+
return this.length += e.length, this.roundClean(), this;
|
|
77
|
+
}
|
|
78
|
+
digestInto(e) {
|
|
79
|
+
he(this), H0(e, this), this.finished = !0;
|
|
80
|
+
const { buffer: n, view: h, blockLen: c, isLE: i } = this;
|
|
81
|
+
let { pos: r } = this;
|
|
82
|
+
n[r++] = 128, se(this.buffer.subarray(r)), this.padOffset > c - r && (this.process(h, 0), r = 0);
|
|
83
|
+
for (let u = r; u < c; u++)
|
|
84
|
+
n[u] = 0;
|
|
85
|
+
_0(h, c - 8, BigInt(this.length * 8), i), this.process(h, 0);
|
|
86
|
+
const a = zt(e), b = this.outputLen;
|
|
87
|
+
if (b % 4)
|
|
88
|
+
throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
89
|
+
const x = b / 4, H = this.get();
|
|
90
|
+
if (x > H.length)
|
|
91
|
+
throw new Error("_sha2: outputLen bigger than state");
|
|
92
|
+
for (let u = 0; u < x; u++)
|
|
93
|
+
a.setUint32(4 * u, H[u], i);
|
|
94
|
+
}
|
|
95
|
+
digest() {
|
|
96
|
+
const { buffer: e, outputLen: n } = this;
|
|
97
|
+
this.digestInto(e);
|
|
98
|
+
const h = e.slice(0, n);
|
|
99
|
+
return this.destroy(), h;
|
|
100
|
+
}
|
|
101
|
+
_cloneInto(e) {
|
|
102
|
+
e || (e = new this.constructor()), e.set(...this.get());
|
|
103
|
+
const { blockLen: n, buffer: h, length: c, finished: i, destroyed: r, pos: a } = this;
|
|
104
|
+
return e.destroyed = r, e.finished = i, e.length = c, e.pos = a, c % n && e.buffer.set(h), e;
|
|
105
|
+
}
|
|
106
|
+
clone() {
|
|
107
|
+
return this._cloneInto();
|
|
108
|
+
}
|
|
109
|
+
};
|
|
110
|
+
const yt = /* @__PURE__ */ Uint32Array.from([
|
|
111
|
+
1779033703,
|
|
112
|
+
3144134277,
|
|
113
|
+
1013904242,
|
|
114
|
+
2773480762,
|
|
115
|
+
1359893119,
|
|
116
|
+
2600822924,
|
|
117
|
+
528734635,
|
|
118
|
+
1541459225
|
|
119
|
+
]), I0 = /* @__PURE__ */ Uint32Array.from([
|
|
120
|
+
1116352408,
|
|
121
|
+
1899447441,
|
|
122
|
+
3049323471,
|
|
123
|
+
3921009573,
|
|
124
|
+
961987163,
|
|
125
|
+
1508970993,
|
|
126
|
+
2453635748,
|
|
127
|
+
2870763221,
|
|
128
|
+
3624381080,
|
|
129
|
+
310598401,
|
|
130
|
+
607225278,
|
|
131
|
+
1426881987,
|
|
132
|
+
1925078388,
|
|
133
|
+
2162078206,
|
|
134
|
+
2614888103,
|
|
135
|
+
3248222580,
|
|
136
|
+
3835390401,
|
|
137
|
+
4022224774,
|
|
138
|
+
264347078,
|
|
139
|
+
604807628,
|
|
140
|
+
770255983,
|
|
141
|
+
1249150122,
|
|
142
|
+
1555081692,
|
|
143
|
+
1996064986,
|
|
144
|
+
2554220882,
|
|
145
|
+
2821834349,
|
|
146
|
+
2952996808,
|
|
147
|
+
3210313671,
|
|
148
|
+
3336571891,
|
|
149
|
+
3584528711,
|
|
150
|
+
113926993,
|
|
151
|
+
338241895,
|
|
152
|
+
666307205,
|
|
153
|
+
773529912,
|
|
154
|
+
1294757372,
|
|
155
|
+
1396182291,
|
|
156
|
+
1695183700,
|
|
157
|
+
1986661051,
|
|
158
|
+
2177026350,
|
|
159
|
+
2456956037,
|
|
160
|
+
2730485921,
|
|
161
|
+
2820302411,
|
|
162
|
+
3259730800,
|
|
163
|
+
3345764771,
|
|
164
|
+
3516065817,
|
|
165
|
+
3600352804,
|
|
166
|
+
4094571909,
|
|
167
|
+
275423344,
|
|
168
|
+
430227734,
|
|
169
|
+
506948616,
|
|
170
|
+
659060556,
|
|
171
|
+
883997877,
|
|
172
|
+
958139571,
|
|
173
|
+
1322822218,
|
|
174
|
+
1537002063,
|
|
175
|
+
1747873779,
|
|
176
|
+
1955562222,
|
|
177
|
+
2024104815,
|
|
178
|
+
2227730452,
|
|
179
|
+
2361852424,
|
|
180
|
+
2428436474,
|
|
181
|
+
2756734187,
|
|
182
|
+
3204031479,
|
|
183
|
+
3329325298
|
|
184
|
+
]), pt = /* @__PURE__ */ new Uint32Array(64);
|
|
185
|
+
class B0 extends w0 {
|
|
186
|
+
constructor(e = 32) {
|
|
187
|
+
super(64, e, 8, !1), this.A = yt[0] | 0, this.B = yt[1] | 0, this.C = yt[2] | 0, this.D = yt[3] | 0, this.E = yt[4] | 0, this.F = yt[5] | 0, this.G = yt[6] | 0, this.H = yt[7] | 0;
|
|
188
|
+
}
|
|
189
|
+
get() {
|
|
190
|
+
const { A: e, B: n, C: h, D: c, E: i, F: r, G: a, H: b } = this;
|
|
191
|
+
return [e, n, h, c, i, r, a, b];
|
|
192
|
+
}
|
|
193
|
+
// prettier-ignore
|
|
194
|
+
set(e, n, h, c, i, r, a, b) {
|
|
195
|
+
this.A = e | 0, this.B = n | 0, this.C = h | 0, this.D = c | 0, this.E = i | 0, this.F = r | 0, this.G = a | 0, this.H = b | 0;
|
|
196
|
+
}
|
|
197
|
+
process(e, n) {
|
|
198
|
+
for (let u = 0; u < 16; u++, n += 4)
|
|
199
|
+
pt[u] = e.getUint32(n, !1);
|
|
200
|
+
for (let u = 16; u < 64; u++) {
|
|
201
|
+
const S = pt[u - 15], B = pt[u - 2], g = dt(S, 7) ^ dt(S, 18) ^ S >>> 3, I = dt(B, 17) ^ dt(B, 19) ^ B >>> 10;
|
|
202
|
+
pt[u] = I + pt[u - 7] + g + pt[u - 16] | 0;
|
|
203
|
+
}
|
|
204
|
+
let { A: h, B: c, C: i, D: r, E: a, F: b, G: x, H } = this;
|
|
205
|
+
for (let u = 0; u < 64; u++) {
|
|
206
|
+
const S = dt(a, 6) ^ dt(a, 11) ^ dt(a, 25), B = H + S + g0(a, b, x) + I0[u] + pt[u] | 0, I = (dt(h, 2) ^ dt(h, 13) ^ dt(h, 22)) + S0(h, c, i) | 0;
|
|
207
|
+
H = x, x = b, b = a, a = r + B | 0, r = i, i = c, c = h, h = B + I | 0;
|
|
208
|
+
}
|
|
209
|
+
h = h + this.A | 0, c = c + this.B | 0, i = i + this.C | 0, r = r + this.D | 0, a = a + this.E | 0, b = b + this.F | 0, x = x + this.G | 0, H = H + this.H | 0, this.set(h, c, i, r, a, b, x, H);
|
|
210
|
+
}
|
|
211
|
+
roundClean() {
|
|
212
|
+
se(pt);
|
|
213
|
+
}
|
|
214
|
+
destroy() {
|
|
215
|
+
this.set(0, 0, 0, 0, 0, 0, 0, 0), se(this.buffer);
|
|
216
|
+
}
|
|
217
|
+
}
|
|
218
|
+
const L0 = /* @__PURE__ */ p0(() => new B0()), Ms = L0;
|
|
219
|
+
function m0(t) {
|
|
220
|
+
return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
|
|
221
|
+
}
|
|
222
|
+
function Vt(t, e = "") {
|
|
223
|
+
if (!Number.isSafeInteger(t) || t < 0) {
|
|
224
|
+
const n = e && `"${e}" `;
|
|
225
|
+
throw new Error(`${n}expected integer >= 0, got ${t}`);
|
|
226
|
+
}
|
|
227
|
+
}
|
|
228
|
+
function Ht(t, e, n = "") {
|
|
229
|
+
const h = m0(t), c = t?.length, i = e !== void 0;
|
|
230
|
+
if (!h || i && c !== e) {
|
|
231
|
+
const r = n && `"${n}" `, a = i ? ` of length ${e}` : "", b = h ? `length=${c}` : `type=${typeof t}`;
|
|
232
|
+
throw new Error(r + "expected Uint8Array" + a + ", got " + b);
|
|
233
|
+
}
|
|
234
|
+
return t;
|
|
235
|
+
}
|
|
236
|
+
function We(t) {
|
|
16
237
|
if (typeof t != "function" || typeof t.create != "function")
|
|
17
|
-
throw new Error("Hash
|
|
18
|
-
|
|
238
|
+
throw new Error("Hash must wrapped by utils.createHasher");
|
|
239
|
+
Vt(t.outputLen), Vt(t.blockLen);
|
|
19
240
|
}
|
|
20
|
-
function
|
|
241
|
+
function kt(t, e = !0) {
|
|
21
242
|
if (t.destroyed)
|
|
22
243
|
throw new Error("Hash instance has been destroyed");
|
|
23
244
|
if (e && t.finished)
|
|
24
245
|
throw new Error("Hash#digest() has already been called");
|
|
25
246
|
}
|
|
26
|
-
function
|
|
27
|
-
|
|
28
|
-
const
|
|
29
|
-
if (t.length <
|
|
30
|
-
throw new Error("digestInto()
|
|
247
|
+
function Re(t, e) {
|
|
248
|
+
Ht(t, void 0, "digestInto() output");
|
|
249
|
+
const n = e.outputLen;
|
|
250
|
+
if (t.length < n)
|
|
251
|
+
throw new Error('"digestInto() output" expected to be of length >=' + n);
|
|
252
|
+
}
|
|
253
|
+
function V0(t) {
|
|
254
|
+
return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
|
|
31
255
|
}
|
|
32
|
-
function
|
|
256
|
+
function rt(...t) {
|
|
33
257
|
for (let e = 0; e < t.length; e++)
|
|
34
258
|
t[e].fill(0);
|
|
35
259
|
}
|
|
36
|
-
function
|
|
260
|
+
function Kt(t) {
|
|
37
261
|
return new DataView(t.buffer, t.byteOffset, t.byteLength);
|
|
38
262
|
}
|
|
39
|
-
function
|
|
263
|
+
function ut(t, e) {
|
|
40
264
|
return t << 32 - e | t >>> e;
|
|
41
265
|
}
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
266
|
+
function Lt(t, e) {
|
|
267
|
+
return t << e | t >>> 32 - e >>> 0;
|
|
268
|
+
}
|
|
269
|
+
const U0 = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
270
|
+
function E0(t) {
|
|
271
|
+
return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
|
|
272
|
+
}
|
|
273
|
+
function C0(t) {
|
|
274
|
+
for (let e = 0; e < t.length; e++)
|
|
275
|
+
t[e] = E0(t[e]);
|
|
276
|
+
return t;
|
|
277
|
+
}
|
|
278
|
+
const fe = U0 ? (t) => t : C0, qe = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", k0 = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
|
|
279
|
+
function Gs(t) {
|
|
280
|
+
if (Ht(t), qe)
|
|
45
281
|
return t.toHex();
|
|
46
282
|
let e = "";
|
|
47
|
-
for (let
|
|
48
|
-
e +=
|
|
283
|
+
for (let n = 0; n < t.length; n++)
|
|
284
|
+
e += k0[t[n]];
|
|
49
285
|
return e;
|
|
50
286
|
}
|
|
51
|
-
const
|
|
52
|
-
function
|
|
53
|
-
if (t >=
|
|
54
|
-
return t -
|
|
55
|
-
if (t >=
|
|
56
|
-
return t - (
|
|
57
|
-
if (t >=
|
|
58
|
-
return t - (
|
|
287
|
+
const bt = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
288
|
+
function de(t) {
|
|
289
|
+
if (t >= bt._0 && t <= bt._9)
|
|
290
|
+
return t - bt._0;
|
|
291
|
+
if (t >= bt.A && t <= bt.F)
|
|
292
|
+
return t - (bt.A - 10);
|
|
293
|
+
if (t >= bt.a && t <= bt.f)
|
|
294
|
+
return t - (bt.a - 10);
|
|
59
295
|
}
|
|
60
|
-
function
|
|
296
|
+
function js(t) {
|
|
61
297
|
if (typeof t != "string")
|
|
62
298
|
throw new Error("hex string expected, got " + typeof t);
|
|
63
|
-
if (
|
|
299
|
+
if (qe)
|
|
64
300
|
return Uint8Array.fromHex(t);
|
|
65
|
-
const e = t.length,
|
|
301
|
+
const e = t.length, n = e / 2;
|
|
66
302
|
if (e % 2)
|
|
67
303
|
throw new Error("hex string expected, got unpadded hex of length " + e);
|
|
68
|
-
const
|
|
69
|
-
for (let
|
|
70
|
-
const
|
|
71
|
-
if (
|
|
72
|
-
const b = t[
|
|
73
|
-
throw new Error('hex string expected, got non-hex character "' + b + '" at index ' +
|
|
304
|
+
const h = new Uint8Array(n);
|
|
305
|
+
for (let c = 0, i = 0; c < n; c++, i += 2) {
|
|
306
|
+
const r = de(t.charCodeAt(i)), a = de(t.charCodeAt(i + 1));
|
|
307
|
+
if (r === void 0 || a === void 0) {
|
|
308
|
+
const b = t[i] + t[i + 1];
|
|
309
|
+
throw new Error('hex string expected, got non-hex character "' + b + '" at index ' + i);
|
|
74
310
|
}
|
|
75
|
-
|
|
311
|
+
h[c] = r * 16 + a;
|
|
76
312
|
}
|
|
77
|
-
return
|
|
313
|
+
return h;
|
|
78
314
|
}
|
|
79
|
-
function
|
|
315
|
+
function D0(t) {
|
|
80
316
|
if (typeof t != "string")
|
|
81
317
|
throw new Error("string expected");
|
|
82
318
|
return new Uint8Array(new TextEncoder().encode(t));
|
|
83
319
|
}
|
|
84
|
-
function
|
|
85
|
-
return typeof t == "string"
|
|
320
|
+
function ue(t, e = "") {
|
|
321
|
+
return typeof t == "string" ? D0(t) : Ht(t, void 0, e);
|
|
86
322
|
}
|
|
87
|
-
function
|
|
88
|
-
return typeof t == "string" && (t = ee(t)), ht(t), t;
|
|
89
|
-
}
|
|
90
|
-
function xs(...t) {
|
|
323
|
+
function Ws(...t) {
|
|
91
324
|
let e = 0;
|
|
92
|
-
for (let
|
|
93
|
-
const
|
|
94
|
-
|
|
325
|
+
for (let h = 0; h < t.length; h++) {
|
|
326
|
+
const c = t[h];
|
|
327
|
+
Ht(c), e += c.length;
|
|
95
328
|
}
|
|
96
|
-
const
|
|
97
|
-
for (let
|
|
98
|
-
const
|
|
99
|
-
|
|
329
|
+
const n = new Uint8Array(e);
|
|
330
|
+
for (let h = 0, c = 0; h < t.length; h++) {
|
|
331
|
+
const i = t[h];
|
|
332
|
+
n.set(i, c), c += i.length;
|
|
100
333
|
}
|
|
101
|
-
return
|
|
334
|
+
return n;
|
|
102
335
|
}
|
|
103
|
-
function
|
|
336
|
+
function F0(t, e) {
|
|
104
337
|
if (e !== void 0 && {}.toString.call(e) !== "[object Object]")
|
|
105
|
-
throw new Error("options
|
|
338
|
+
throw new Error("options must be object or undefined");
|
|
106
339
|
return Object.assign(t, e);
|
|
107
340
|
}
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
const e = (i) => t().update(Ut(i)).digest(), s = t();
|
|
112
|
-
return e.outputLen = s.outputLen, e.blockLen = s.blockLen, e.create = () => t(), e;
|
|
341
|
+
function lt(t, e = {}) {
|
|
342
|
+
const n = (c, i) => t(i).update(c).digest(), h = t(void 0);
|
|
343
|
+
return n.outputLen = h.outputLen, n.blockLen = h.blockLen, n.create = (c) => t(c), Object.assign(n, e), Object.freeze(n);
|
|
113
344
|
}
|
|
114
|
-
function
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
throw new Error("crypto.getRandomValues must be defined");
|
|
120
|
-
}
|
|
121
|
-
function we(t, e, s, i) {
|
|
122
|
-
if (typeof t.setBigUint64 == "function")
|
|
123
|
-
return t.setBigUint64(e, s, i);
|
|
124
|
-
const o = BigInt(32), r = BigInt(4294967295), n = Number(s >> o & r), h = Number(s & r), b = i ? 4 : 0, x = i ? 0 : 4;
|
|
125
|
-
t.setUint32(e + b, n, i), t.setUint32(e + x, h, i);
|
|
345
|
+
function Rs(t = 32) {
|
|
346
|
+
const e = typeof globalThis == "object" ? globalThis.crypto : null;
|
|
347
|
+
if (typeof e?.getRandomValues != "function")
|
|
348
|
+
throw new Error("crypto.getRandomValues must be defined");
|
|
349
|
+
return e.getRandomValues(new Uint8Array(t));
|
|
126
350
|
}
|
|
127
|
-
|
|
128
|
-
|
|
351
|
+
const mt = (t) => ({
|
|
352
|
+
oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, t])
|
|
353
|
+
});
|
|
354
|
+
function Nt(t, e, n) {
|
|
355
|
+
return t & e ^ ~t & n;
|
|
129
356
|
}
|
|
130
|
-
function
|
|
131
|
-
return t & e ^ t &
|
|
357
|
+
function Pe(t, e, n) {
|
|
358
|
+
return t & e ^ t & n ^ e & n;
|
|
132
359
|
}
|
|
133
|
-
class
|
|
134
|
-
|
|
135
|
-
|
|
360
|
+
class Gt {
|
|
361
|
+
blockLen;
|
|
362
|
+
outputLen;
|
|
363
|
+
padOffset;
|
|
364
|
+
isLE;
|
|
365
|
+
// For partial updates less than block size
|
|
366
|
+
buffer;
|
|
367
|
+
view;
|
|
368
|
+
finished = !1;
|
|
369
|
+
length = 0;
|
|
370
|
+
pos = 0;
|
|
371
|
+
destroyed = !1;
|
|
372
|
+
constructor(e, n, h, c) {
|
|
373
|
+
this.blockLen = e, this.outputLen = n, this.padOffset = h, this.isLE = c, this.buffer = new Uint8Array(e), this.view = Kt(this.buffer);
|
|
136
374
|
}
|
|
137
375
|
update(e) {
|
|
138
|
-
|
|
139
|
-
const { view:
|
|
140
|
-
for (let
|
|
141
|
-
const
|
|
142
|
-
if (
|
|
143
|
-
const b =
|
|
144
|
-
for (;
|
|
145
|
-
this.process(b,
|
|
376
|
+
kt(this), Ht(e);
|
|
377
|
+
const { view: n, buffer: h, blockLen: c } = this, i = e.length;
|
|
378
|
+
for (let r = 0; r < i; ) {
|
|
379
|
+
const a = Math.min(c - this.pos, i - r);
|
|
380
|
+
if (a === c) {
|
|
381
|
+
const b = Kt(e);
|
|
382
|
+
for (; c <= i - r; r += c)
|
|
383
|
+
this.process(b, r);
|
|
146
384
|
continue;
|
|
147
385
|
}
|
|
148
|
-
|
|
386
|
+
h.set(e.subarray(r, r + a), this.pos), this.pos += a, r += a, this.pos === c && (this.process(n, 0), this.pos = 0);
|
|
149
387
|
}
|
|
150
388
|
return this.length += e.length, this.roundClean(), this;
|
|
151
389
|
}
|
|
152
390
|
digestInto(e) {
|
|
153
|
-
|
|
154
|
-
const { buffer:
|
|
155
|
-
let { pos:
|
|
156
|
-
|
|
157
|
-
for (let u =
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
const
|
|
391
|
+
kt(this), Re(e, this), this.finished = !0;
|
|
392
|
+
const { buffer: n, view: h, blockLen: c, isLE: i } = this;
|
|
393
|
+
let { pos: r } = this;
|
|
394
|
+
n[r++] = 128, rt(this.buffer.subarray(r)), this.padOffset > c - r && (this.process(h, 0), r = 0);
|
|
395
|
+
for (let u = r; u < c; u++)
|
|
396
|
+
n[u] = 0;
|
|
397
|
+
h.setBigUint64(c - 8, BigInt(this.length * 8), i), this.process(h, 0);
|
|
398
|
+
const a = Kt(e), b = this.outputLen;
|
|
161
399
|
if (b % 4)
|
|
162
|
-
throw new Error("_sha2: outputLen
|
|
400
|
+
throw new Error("_sha2: outputLen must be aligned to 32bit");
|
|
163
401
|
const x = b / 4, H = this.get();
|
|
164
402
|
if (x > H.length)
|
|
165
403
|
throw new Error("_sha2: outputLen bigger than state");
|
|
166
404
|
for (let u = 0; u < x; u++)
|
|
167
|
-
|
|
405
|
+
a.setUint32(4 * u, H[u], i);
|
|
168
406
|
}
|
|
169
407
|
digest() {
|
|
170
|
-
const { buffer: e, outputLen:
|
|
408
|
+
const { buffer: e, outputLen: n } = this;
|
|
171
409
|
this.digestInto(e);
|
|
172
|
-
const
|
|
173
|
-
return this.destroy(),
|
|
410
|
+
const h = e.slice(0, n);
|
|
411
|
+
return this.destroy(), h;
|
|
174
412
|
}
|
|
175
413
|
_cloneInto(e) {
|
|
176
|
-
e
|
|
177
|
-
const { blockLen:
|
|
178
|
-
return e.destroyed =
|
|
414
|
+
e ||= new this.constructor(), e.set(...this.get());
|
|
415
|
+
const { blockLen: n, buffer: h, length: c, finished: i, destroyed: r, pos: a } = this;
|
|
416
|
+
return e.destroyed = r, e.finished = i, e.length = c, e.pos = a, c % n && e.buffer.set(h), e;
|
|
179
417
|
}
|
|
180
418
|
clone() {
|
|
181
419
|
return this._cloneInto();
|
|
182
420
|
}
|
|
183
421
|
}
|
|
184
|
-
const
|
|
422
|
+
const _t = /* @__PURE__ */ Uint32Array.from([
|
|
185
423
|
1779033703,
|
|
186
424
|
3144134277,
|
|
187
425
|
1013904242,
|
|
@@ -190,7 +428,33 @@ const st = /* @__PURE__ */ Uint32Array.from([
|
|
|
190
428
|
2600822924,
|
|
191
429
|
528734635,
|
|
192
430
|
1541459225
|
|
193
|
-
]),
|
|
431
|
+
]), gt = /* @__PURE__ */ Uint32Array.from([
|
|
432
|
+
3238371032,
|
|
433
|
+
914150663,
|
|
434
|
+
812702999,
|
|
435
|
+
4144912697,
|
|
436
|
+
4290775857,
|
|
437
|
+
1750603025,
|
|
438
|
+
1694076839,
|
|
439
|
+
3204075428
|
|
440
|
+
]), Y = /* @__PURE__ */ Uint32Array.from([
|
|
441
|
+
3418070365,
|
|
442
|
+
3238371032,
|
|
443
|
+
1654270250,
|
|
444
|
+
914150663,
|
|
445
|
+
2438529370,
|
|
446
|
+
812702999,
|
|
447
|
+
355462360,
|
|
448
|
+
4144912697,
|
|
449
|
+
1731405415,
|
|
450
|
+
4290775857,
|
|
451
|
+
2394180231,
|
|
452
|
+
1750603025,
|
|
453
|
+
3675008525,
|
|
454
|
+
1694076839,
|
|
455
|
+
1203062813,
|
|
456
|
+
3204075428
|
|
457
|
+
]), Z = /* @__PURE__ */ Uint32Array.from([
|
|
194
458
|
1779033703,
|
|
195
459
|
4089235720,
|
|
196
460
|
3144134277,
|
|
@@ -207,25 +471,196 @@ const st = /* @__PURE__ */ Uint32Array.from([
|
|
|
207
471
|
4215389547,
|
|
208
472
|
1541459225,
|
|
209
473
|
327033209
|
|
210
|
-
]),
|
|
211
|
-
|
|
212
|
-
|
|
474
|
+
]), Ct = /* @__PURE__ */ Uint32Array.from([
|
|
475
|
+
1732584193,
|
|
476
|
+
4023233417,
|
|
477
|
+
2562383102,
|
|
478
|
+
271733878,
|
|
479
|
+
3285377520
|
|
480
|
+
]), St = /* @__PURE__ */ new Uint32Array(80);
|
|
481
|
+
class Ke extends Gt {
|
|
482
|
+
A = Ct[0] | 0;
|
|
483
|
+
B = Ct[1] | 0;
|
|
484
|
+
C = Ct[2] | 0;
|
|
485
|
+
D = Ct[3] | 0;
|
|
486
|
+
E = Ct[4] | 0;
|
|
487
|
+
constructor() {
|
|
488
|
+
super(64, 20, 8, !1);
|
|
489
|
+
}
|
|
490
|
+
get() {
|
|
491
|
+
const { A: e, B: n, C: h, D: c, E: i } = this;
|
|
492
|
+
return [e, n, h, c, i];
|
|
493
|
+
}
|
|
494
|
+
set(e, n, h, c, i) {
|
|
495
|
+
this.A = e | 0, this.B = n | 0, this.C = h | 0, this.D = c | 0, this.E = i | 0;
|
|
496
|
+
}
|
|
497
|
+
process(e, n) {
|
|
498
|
+
for (let b = 0; b < 16; b++, n += 4)
|
|
499
|
+
St[b] = e.getUint32(n, !1);
|
|
500
|
+
for (let b = 16; b < 80; b++)
|
|
501
|
+
St[b] = Lt(St[b - 3] ^ St[b - 8] ^ St[b - 14] ^ St[b - 16], 1);
|
|
502
|
+
let { A: h, B: c, C: i, D: r, E: a } = this;
|
|
503
|
+
for (let b = 0; b < 80; b++) {
|
|
504
|
+
let x, H;
|
|
505
|
+
b < 20 ? (x = Nt(c, i, r), H = 1518500249) : b < 40 ? (x = c ^ i ^ r, H = 1859775393) : b < 60 ? (x = Pe(c, i, r), H = 2400959708) : (x = c ^ i ^ r, H = 3395469782);
|
|
506
|
+
const u = Lt(h, 5) + x + a + H + St[b] | 0;
|
|
507
|
+
a = r, r = i, i = Lt(c, 30), c = h, h = u;
|
|
508
|
+
}
|
|
509
|
+
h = h + this.A | 0, c = c + this.B | 0, i = i + this.C | 0, r = r + this.D | 0, a = a + this.E | 0, this.set(h, c, i, r, a);
|
|
510
|
+
}
|
|
511
|
+
roundClean() {
|
|
512
|
+
rt(St);
|
|
513
|
+
}
|
|
514
|
+
destroy() {
|
|
515
|
+
this.set(0, 0, 0, 0, 0), rt(this.buffer);
|
|
516
|
+
}
|
|
517
|
+
}
|
|
518
|
+
const T0 = /* @__PURE__ */ lt(() => new Ke()), O0 = /* @__PURE__ */ Math.pow(2, 32), v0 = /* @__PURE__ */ Array.from({ length: 64 }, (t, e) => Math.floor(O0 * Math.abs(Math.sin(e + 1)))), jt = /* @__PURE__ */ Ct.slice(0, 4), Qt = /* @__PURE__ */ new Uint32Array(16);
|
|
519
|
+
class Ne extends Gt {
|
|
520
|
+
A = jt[0] | 0;
|
|
521
|
+
B = jt[1] | 0;
|
|
522
|
+
C = jt[2] | 0;
|
|
523
|
+
D = jt[3] | 0;
|
|
524
|
+
constructor() {
|
|
525
|
+
super(64, 16, 8, !0);
|
|
526
|
+
}
|
|
527
|
+
get() {
|
|
528
|
+
const { A: e, B: n, C: h, D: c } = this;
|
|
529
|
+
return [e, n, h, c];
|
|
530
|
+
}
|
|
531
|
+
set(e, n, h, c) {
|
|
532
|
+
this.A = e | 0, this.B = n | 0, this.C = h | 0, this.D = c | 0;
|
|
533
|
+
}
|
|
534
|
+
process(e, n) {
|
|
535
|
+
for (let a = 0; a < 16; a++, n += 4)
|
|
536
|
+
Qt[a] = e.getUint32(n, !0);
|
|
537
|
+
let { A: h, B: c, C: i, D: r } = this;
|
|
538
|
+
for (let a = 0; a < 64; a++) {
|
|
539
|
+
let b, x, H;
|
|
540
|
+
a < 16 ? (b = Nt(c, i, r), x = a, H = [7, 12, 17, 22]) : a < 32 ? (b = Nt(r, c, i), x = (5 * a + 1) % 16, H = [5, 9, 14, 20]) : a < 48 ? (b = c ^ i ^ r, x = (3 * a + 5) % 16, H = [4, 11, 16, 23]) : (b = i ^ (c | ~r), x = 7 * a % 16, H = [6, 10, 15, 21]), b = b + h + v0[a] + Qt[x], h = r, r = i, i = c, c = c + Lt(b, H[a % 4]);
|
|
541
|
+
}
|
|
542
|
+
h = h + this.A | 0, c = c + this.B | 0, i = i + this.C | 0, r = r + this.D | 0, this.set(h, c, i, r);
|
|
543
|
+
}
|
|
544
|
+
roundClean() {
|
|
545
|
+
rt(Qt);
|
|
546
|
+
}
|
|
547
|
+
destroy() {
|
|
548
|
+
this.set(0, 0, 0, 0), rt(this.buffer);
|
|
549
|
+
}
|
|
213
550
|
}
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
551
|
+
const M0 = /* @__PURE__ */ lt(() => new Ne()), G0 = /* @__PURE__ */ Uint8Array.from([
|
|
552
|
+
7,
|
|
553
|
+
4,
|
|
554
|
+
13,
|
|
555
|
+
1,
|
|
556
|
+
10,
|
|
557
|
+
6,
|
|
558
|
+
15,
|
|
559
|
+
3,
|
|
560
|
+
12,
|
|
561
|
+
0,
|
|
562
|
+
9,
|
|
563
|
+
5,
|
|
564
|
+
2,
|
|
565
|
+
14,
|
|
566
|
+
11,
|
|
567
|
+
8
|
|
568
|
+
]), Xe = Uint8Array.from(new Array(16).fill(0).map((t, e) => e)), j0 = Xe.map((t) => (9 * t + 5) % 16), Je = /* @__PURE__ */ (() => {
|
|
569
|
+
const n = [[Xe], [j0]];
|
|
570
|
+
for (let h = 0; h < 4; h++)
|
|
571
|
+
for (let c of n)
|
|
572
|
+
c.push(c[h].map((i) => G0[i]));
|
|
573
|
+
return n;
|
|
574
|
+
})(), ze = Je[0], Qe = Je[1], Ye = /* @__PURE__ */ [
|
|
575
|
+
[11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
|
|
576
|
+
[12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],
|
|
577
|
+
[13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],
|
|
578
|
+
[14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],
|
|
579
|
+
[15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5]
|
|
580
|
+
].map((t) => Uint8Array.from(t)), W0 = /* @__PURE__ */ ze.map((t, e) => t.map((n) => Ye[e][n])), R0 = /* @__PURE__ */ Qe.map((t, e) => t.map((n) => Ye[e][n])), q0 = /* @__PURE__ */ Uint32Array.from([
|
|
581
|
+
0,
|
|
582
|
+
1518500249,
|
|
583
|
+
1859775393,
|
|
584
|
+
2400959708,
|
|
585
|
+
2840853838
|
|
586
|
+
]), P0 = /* @__PURE__ */ Uint32Array.from([
|
|
587
|
+
1352829926,
|
|
588
|
+
1548603684,
|
|
589
|
+
1836072691,
|
|
590
|
+
2053994217,
|
|
591
|
+
0
|
|
592
|
+
]);
|
|
593
|
+
function le(t, e, n, h) {
|
|
594
|
+
return t === 0 ? e ^ n ^ h : t === 1 ? e & n | ~e & h : t === 2 ? (e | ~n) ^ h : t === 3 ? e & h | n & ~h : e ^ (n | ~h);
|
|
595
|
+
}
|
|
596
|
+
const Wt = /* @__PURE__ */ new Uint32Array(16);
|
|
597
|
+
class Ze extends Gt {
|
|
598
|
+
h0 = 1732584193;
|
|
599
|
+
h1 = -271733879;
|
|
600
|
+
h2 = -1732584194;
|
|
601
|
+
h3 = 271733878;
|
|
602
|
+
h4 = -1009589776;
|
|
603
|
+
constructor() {
|
|
604
|
+
super(64, 20, 8, !0);
|
|
605
|
+
}
|
|
606
|
+
get() {
|
|
607
|
+
const { h0: e, h1: n, h2: h, h3: c, h4: i } = this;
|
|
608
|
+
return [e, n, h, c, i];
|
|
609
|
+
}
|
|
610
|
+
set(e, n, h, c, i) {
|
|
611
|
+
this.h0 = e | 0, this.h1 = n | 0, this.h2 = h | 0, this.h3 = c | 0, this.h4 = i | 0;
|
|
612
|
+
}
|
|
613
|
+
process(e, n) {
|
|
614
|
+
for (let B = 0; B < 16; B++, n += 4)
|
|
615
|
+
Wt[B] = e.getUint32(n, !0);
|
|
616
|
+
let h = this.h0 | 0, c = h, i = this.h1 | 0, r = i, a = this.h2 | 0, b = a, x = this.h3 | 0, H = x, u = this.h4 | 0, S = u;
|
|
617
|
+
for (let B = 0; B < 5; B++) {
|
|
618
|
+
const g = 4 - B, I = q0[B], D = P0[B], R = ze[B], T = Qe[B], _ = W0[B], C = R0[B];
|
|
619
|
+
for (let p = 0; p < 16; p++) {
|
|
620
|
+
const w = Lt(h + le(B, i, a, x) + Wt[R[p]] + I, _[p]) + u | 0;
|
|
621
|
+
h = u, u = x, x = Lt(a, 10) | 0, a = i, i = w;
|
|
622
|
+
}
|
|
623
|
+
for (let p = 0; p < 16; p++) {
|
|
624
|
+
const w = Lt(c + le(g, r, b, H) + Wt[T[p]] + D, C[p]) + S | 0;
|
|
625
|
+
c = S, S = H, H = Lt(b, 10) | 0, b = r, r = w;
|
|
626
|
+
}
|
|
627
|
+
}
|
|
628
|
+
this.set(this.h1 + a + H | 0, this.h2 + x + S | 0, this.h3 + u + c | 0, this.h4 + h + r | 0, this.h0 + i + b | 0);
|
|
629
|
+
}
|
|
630
|
+
roundClean() {
|
|
631
|
+
rt(Wt);
|
|
220
632
|
}
|
|
221
|
-
|
|
633
|
+
destroy() {
|
|
634
|
+
this.destroyed = !0, rt(this.buffer), this.set(0, 0, 0, 0, 0);
|
|
635
|
+
}
|
|
636
|
+
}
|
|
637
|
+
const K0 = /* @__PURE__ */ lt(() => new Ze()), N0 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
638
|
+
__proto__: null,
|
|
639
|
+
_MD5: Ne,
|
|
640
|
+
_RIPEMD160: Ze,
|
|
641
|
+
_SHA1: Ke,
|
|
642
|
+
md5: M0,
|
|
643
|
+
ripemd160: K0,
|
|
644
|
+
sha1: T0
|
|
645
|
+
}, Symbol.toStringTag, { value: "Module" })), Rt = /* @__PURE__ */ BigInt(2 ** 32 - 1), be = /* @__PURE__ */ BigInt(32);
|
|
646
|
+
function X0(t, e = !1) {
|
|
647
|
+
return e ? { h: Number(t & Rt), l: Number(t >> be & Rt) } : { h: Number(t >> be & Rt) | 0, l: Number(t & Rt) | 0 };
|
|
648
|
+
}
|
|
649
|
+
function $e(t, e = !1) {
|
|
650
|
+
const n = t.length;
|
|
651
|
+
let h = new Uint32Array(n), c = new Uint32Array(n);
|
|
652
|
+
for (let i = 0; i < n; i++) {
|
|
653
|
+
const { h: r, l: a } = X0(t[i], e);
|
|
654
|
+
[h[i], c[i]] = [r, a];
|
|
655
|
+
}
|
|
656
|
+
return [h, c];
|
|
222
657
|
}
|
|
223
|
-
const
|
|
224
|
-
function
|
|
225
|
-
const
|
|
226
|
-
return { h: t +
|
|
658
|
+
const xe = (t, e, n) => t >>> n, He = (t, e, n) => t << 32 - n | e >>> n, Ut = (t, e, n) => t >>> n | e << 32 - n, Et = (t, e, n) => t << 32 - n | e >>> n, qt = (t, e, n) => t << 64 - n | e >>> n - 32, Pt = (t, e, n) => t >>> n - 32 | e << 64 - n, J0 = (t, e, n) => t << n | e >>> 32 - n, z0 = (t, e, n) => e << n | t >>> 32 - n, Q0 = (t, e, n) => e << n - 32 | t >>> 64 - n, Y0 = (t, e, n) => t << n - 32 | e >>> 64 - n;
|
|
659
|
+
function xt(t, e, n, h) {
|
|
660
|
+
const c = (e >>> 0) + (h >>> 0);
|
|
661
|
+
return { h: t + n + (c / 2 ** 32 | 0) | 0, l: c | 0 };
|
|
227
662
|
}
|
|
228
|
-
const
|
|
663
|
+
const Z0 = (t, e, n) => (t >>> 0) + (e >>> 0) + (n >>> 0), $0 = (t, e, n, h) => e + n + h + (t / 2 ** 32 | 0) | 0, ts = (t, e, n, h) => (t >>> 0) + (e >>> 0) + (n >>> 0) + (h >>> 0), es = (t, e, n, h, c) => e + n + h + c + (t / 2 ** 32 | 0) | 0, ss = (t, e, n, h, c) => (t >>> 0) + (e >>> 0) + (n >>> 0) + (h >>> 0) + (c >>> 0), ns = (t, e, n, h, c, i) => e + n + h + c + i + (t / 2 ** 32 | 0) | 0, rs = /* @__PURE__ */ Uint32Array.from([
|
|
229
664
|
1116352408,
|
|
230
665
|
1899447441,
|
|
231
666
|
3049323471,
|
|
@@ -290,41 +725,69 @@ const me = (t, e, s) => (t >>> 0) + (e >>> 0) + (s >>> 0), Ue = (t, e, s, i) =>
|
|
|
290
725
|
2756734187,
|
|
291
726
|
3204031479,
|
|
292
727
|
3329325298
|
|
293
|
-
]),
|
|
294
|
-
class
|
|
295
|
-
constructor(e
|
|
296
|
-
super(64, e, 8, !1)
|
|
728
|
+
]), wt = /* @__PURE__ */ new Uint32Array(64);
|
|
729
|
+
class t0 extends Gt {
|
|
730
|
+
constructor(e) {
|
|
731
|
+
super(64, e, 8, !1);
|
|
297
732
|
}
|
|
298
733
|
get() {
|
|
299
|
-
const { A: e, B:
|
|
300
|
-
return [e,
|
|
734
|
+
const { A: e, B: n, C: h, D: c, E: i, F: r, G: a, H: b } = this;
|
|
735
|
+
return [e, n, h, c, i, r, a, b];
|
|
301
736
|
}
|
|
302
737
|
// prettier-ignore
|
|
303
|
-
set(e,
|
|
304
|
-
this.A = e | 0, this.B =
|
|
738
|
+
set(e, n, h, c, i, r, a, b) {
|
|
739
|
+
this.A = e | 0, this.B = n | 0, this.C = h | 0, this.D = c | 0, this.E = i | 0, this.F = r | 0, this.G = a | 0, this.H = b | 0;
|
|
305
740
|
}
|
|
306
|
-
process(e,
|
|
307
|
-
for (let u = 0; u < 16; u++,
|
|
308
|
-
|
|
741
|
+
process(e, n) {
|
|
742
|
+
for (let u = 0; u < 16; u++, n += 4)
|
|
743
|
+
wt[u] = e.getUint32(n, !1);
|
|
309
744
|
for (let u = 16; u < 64; u++) {
|
|
310
|
-
const
|
|
311
|
-
|
|
745
|
+
const S = wt[u - 15], B = wt[u - 2], g = ut(S, 7) ^ ut(S, 18) ^ S >>> 3, I = ut(B, 17) ^ ut(B, 19) ^ B >>> 10;
|
|
746
|
+
wt[u] = I + wt[u - 7] + g + wt[u - 16] | 0;
|
|
312
747
|
}
|
|
313
|
-
let { A:
|
|
748
|
+
let { A: h, B: c, C: i, D: r, E: a, F: b, G: x, H } = this;
|
|
314
749
|
for (let u = 0; u < 64; u++) {
|
|
315
|
-
const
|
|
316
|
-
H = x, x = b, b =
|
|
750
|
+
const S = ut(a, 6) ^ ut(a, 11) ^ ut(a, 25), B = H + S + Nt(a, b, x) + rs[u] + wt[u] | 0, I = (ut(h, 2) ^ ut(h, 13) ^ ut(h, 22)) + Pe(h, c, i) | 0;
|
|
751
|
+
H = x, x = b, b = a, a = r + B | 0, r = i, i = c, c = h, h = B + I | 0;
|
|
317
752
|
}
|
|
318
|
-
|
|
753
|
+
h = h + this.A | 0, c = c + this.B | 0, i = i + this.C | 0, r = r + this.D | 0, a = a + this.E | 0, b = b + this.F | 0, x = x + this.G | 0, H = H + this.H | 0, this.set(h, c, i, r, a, b, x, H);
|
|
319
754
|
}
|
|
320
755
|
roundClean() {
|
|
321
|
-
|
|
756
|
+
rt(wt);
|
|
322
757
|
}
|
|
323
758
|
destroy() {
|
|
324
|
-
this.set(0, 0, 0, 0, 0, 0, 0, 0),
|
|
759
|
+
this.set(0, 0, 0, 0, 0, 0, 0, 0), rt(this.buffer);
|
|
760
|
+
}
|
|
761
|
+
}
|
|
762
|
+
class e0 extends t0 {
|
|
763
|
+
// We cannot use array here since array allows indexing by variable
|
|
764
|
+
// which means optimizer/compiler cannot use registers.
|
|
765
|
+
A = _t[0] | 0;
|
|
766
|
+
B = _t[1] | 0;
|
|
767
|
+
C = _t[2] | 0;
|
|
768
|
+
D = _t[3] | 0;
|
|
769
|
+
E = _t[4] | 0;
|
|
770
|
+
F = _t[5] | 0;
|
|
771
|
+
G = _t[6] | 0;
|
|
772
|
+
H = _t[7] | 0;
|
|
773
|
+
constructor() {
|
|
774
|
+
super(32);
|
|
775
|
+
}
|
|
776
|
+
}
|
|
777
|
+
class s0 extends t0 {
|
|
778
|
+
A = gt[0] | 0;
|
|
779
|
+
B = gt[1] | 0;
|
|
780
|
+
C = gt[2] | 0;
|
|
781
|
+
D = gt[3] | 0;
|
|
782
|
+
E = gt[4] | 0;
|
|
783
|
+
F = gt[5] | 0;
|
|
784
|
+
G = gt[6] | 0;
|
|
785
|
+
H = gt[7] | 0;
|
|
786
|
+
constructor() {
|
|
787
|
+
super(28);
|
|
325
788
|
}
|
|
326
789
|
}
|
|
327
|
-
const
|
|
790
|
+
const n0 = $e([
|
|
328
791
|
"0x428a2f98d728ae22",
|
|
329
792
|
"0x7137449123ef65cd",
|
|
330
793
|
"0xb5c0fbcfec4d3b2f",
|
|
@@ -405,287 +868,438 @@ const ie = Be([
|
|
|
405
868
|
"0x597f299cfc657e2a",
|
|
406
869
|
"0x5fcb6fab3ad6faec",
|
|
407
870
|
"0x6c44198c4a475817"
|
|
408
|
-
].map((t) => BigInt(t))),
|
|
409
|
-
class
|
|
410
|
-
constructor(e
|
|
411
|
-
super(128, e, 16, !1)
|
|
871
|
+
].map((t) => BigInt(t))), is = n0[0], cs = n0[1], It = /* @__PURE__ */ new Uint32Array(80), Bt = /* @__PURE__ */ new Uint32Array(80);
|
|
872
|
+
class Xt extends Gt {
|
|
873
|
+
constructor(e) {
|
|
874
|
+
super(128, e, 16, !1);
|
|
412
875
|
}
|
|
413
876
|
// prettier-ignore
|
|
414
877
|
get() {
|
|
415
|
-
const { Ah: e, Al:
|
|
416
|
-
return [e,
|
|
878
|
+
const { Ah: e, Al: n, Bh: h, Bl: c, Ch: i, Cl: r, Dh: a, Dl: b, Eh: x, El: H, Fh: u, Fl: S, Gh: B, Gl: g, Hh: I, Hl: D } = this;
|
|
879
|
+
return [e, n, h, c, i, r, a, b, x, H, u, S, B, g, I, D];
|
|
417
880
|
}
|
|
418
881
|
// prettier-ignore
|
|
419
|
-
set(e,
|
|
420
|
-
this.Ah = e | 0, this.Al =
|
|
882
|
+
set(e, n, h, c, i, r, a, b, x, H, u, S, B, g, I, D) {
|
|
883
|
+
this.Ah = e | 0, this.Al = n | 0, this.Bh = h | 0, this.Bl = c | 0, this.Ch = i | 0, this.Cl = r | 0, this.Dh = a | 0, this.Dl = b | 0, this.Eh = x | 0, this.El = H | 0, this.Fh = u | 0, this.Fl = S | 0, this.Gh = B | 0, this.Gl = g | 0, this.Hh = I | 0, this.Hl = D | 0;
|
|
421
884
|
}
|
|
422
|
-
process(e,
|
|
423
|
-
for (let
|
|
424
|
-
|
|
425
|
-
for (let
|
|
426
|
-
const
|
|
427
|
-
|
|
885
|
+
process(e, n) {
|
|
886
|
+
for (let _ = 0; _ < 16; _++, n += 4)
|
|
887
|
+
It[_] = e.getUint32(n), Bt[_] = e.getUint32(n += 4);
|
|
888
|
+
for (let _ = 16; _ < 80; _++) {
|
|
889
|
+
const C = It[_ - 15] | 0, p = Bt[_ - 15] | 0, w = Ut(C, p, 1) ^ Ut(C, p, 8) ^ xe(C, p, 7), U = Et(C, p, 1) ^ Et(C, p, 8) ^ He(C, p, 7), E = It[_ - 2] | 0, o = Bt[_ - 2] | 0, f = Ut(E, o, 19) ^ qt(E, o, 61) ^ xe(E, o, 6), d = Et(E, o, 19) ^ Pt(E, o, 61) ^ He(E, o, 6), L = ts(U, d, Bt[_ - 7], Bt[_ - 16]), A = es(L, w, f, It[_ - 7], It[_ - 16]);
|
|
890
|
+
It[_] = A | 0, Bt[_] = L | 0;
|
|
428
891
|
}
|
|
429
|
-
let { Ah:
|
|
430
|
-
for (let
|
|
431
|
-
const
|
|
432
|
-
R = I | 0,
|
|
433
|
-
const
|
|
434
|
-
|
|
892
|
+
let { Ah: h, Al: c, Bh: i, Bl: r, Ch: a, Cl: b, Dh: x, Dl: H, Eh: u, El: S, Fh: B, Fl: g, Gh: I, Gl: D, Hh: R, Hl: T } = this;
|
|
893
|
+
for (let _ = 0; _ < 80; _++) {
|
|
894
|
+
const C = Ut(u, S, 14) ^ Ut(u, S, 18) ^ qt(u, S, 41), p = Et(u, S, 14) ^ Et(u, S, 18) ^ Pt(u, S, 41), w = u & B ^ ~u & I, U = S & g ^ ~S & D, E = ss(T, p, U, cs[_], Bt[_]), o = ns(E, R, C, w, is[_], It[_]), f = E | 0, d = Ut(h, c, 28) ^ qt(h, c, 34) ^ qt(h, c, 39), L = Et(h, c, 28) ^ Pt(h, c, 34) ^ Pt(h, c, 39), A = h & i ^ h & a ^ i & a, m = c & r ^ c & b ^ r & b;
|
|
895
|
+
R = I | 0, T = D | 0, I = B | 0, D = g | 0, B = u | 0, g = S | 0, { h: u, l: S } = xt(x | 0, H | 0, o | 0, f | 0), x = a | 0, H = b | 0, a = i | 0, b = r | 0, i = h | 0, r = c | 0;
|
|
896
|
+
const F = Z0(f, L, m);
|
|
897
|
+
h = $0(F, o, d, A), c = F | 0;
|
|
435
898
|
}
|
|
436
|
-
({ h
|
|
899
|
+
({ h, l: c } = xt(this.Ah | 0, this.Al | 0, h | 0, c | 0)), { h: i, l: r } = xt(this.Bh | 0, this.Bl | 0, i | 0, r | 0), { h: a, l: b } = xt(this.Ch | 0, this.Cl | 0, a | 0, b | 0), { h: x, l: H } = xt(this.Dh | 0, this.Dl | 0, x | 0, H | 0), { h: u, l: S } = xt(this.Eh | 0, this.El | 0, u | 0, S | 0), { h: B, l: g } = xt(this.Fh | 0, this.Fl | 0, B | 0, g | 0), { h: I, l: D } = xt(this.Gh | 0, this.Gl | 0, I | 0, D | 0), { h: R, l: T } = xt(this.Hh | 0, this.Hl | 0, R | 0, T | 0), this.set(h, c, i, r, a, b, x, H, u, S, B, g, I, D, R, T);
|
|
437
900
|
}
|
|
438
901
|
roundClean() {
|
|
439
|
-
|
|
902
|
+
rt(It, Bt);
|
|
440
903
|
}
|
|
441
904
|
destroy() {
|
|
442
|
-
|
|
905
|
+
rt(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
|
|
443
906
|
}
|
|
444
907
|
}
|
|
445
|
-
|
|
446
|
-
|
|
447
|
-
|
|
448
|
-
|
|
908
|
+
class r0 extends Xt {
|
|
909
|
+
Ah = Z[0] | 0;
|
|
910
|
+
Al = Z[1] | 0;
|
|
911
|
+
Bh = Z[2] | 0;
|
|
912
|
+
Bl = Z[3] | 0;
|
|
913
|
+
Ch = Z[4] | 0;
|
|
914
|
+
Cl = Z[5] | 0;
|
|
915
|
+
Dh = Z[6] | 0;
|
|
916
|
+
Dl = Z[7] | 0;
|
|
917
|
+
Eh = Z[8] | 0;
|
|
918
|
+
El = Z[9] | 0;
|
|
919
|
+
Fh = Z[10] | 0;
|
|
920
|
+
Fl = Z[11] | 0;
|
|
921
|
+
Gh = Z[12] | 0;
|
|
922
|
+
Gl = Z[13] | 0;
|
|
923
|
+
Hh = Z[14] | 0;
|
|
924
|
+
Hl = Z[15] | 0;
|
|
925
|
+
constructor() {
|
|
926
|
+
super(64);
|
|
927
|
+
}
|
|
449
928
|
}
|
|
450
|
-
|
|
451
|
-
|
|
452
|
-
|
|
453
|
-
|
|
454
|
-
|
|
455
|
-
|
|
456
|
-
|
|
457
|
-
|
|
458
|
-
|
|
459
|
-
|
|
460
|
-
|
|
461
|
-
|
|
462
|
-
|
|
463
|
-
|
|
929
|
+
class i0 extends Xt {
|
|
930
|
+
Ah = Y[0] | 0;
|
|
931
|
+
Al = Y[1] | 0;
|
|
932
|
+
Bh = Y[2] | 0;
|
|
933
|
+
Bl = Y[3] | 0;
|
|
934
|
+
Ch = Y[4] | 0;
|
|
935
|
+
Cl = Y[5] | 0;
|
|
936
|
+
Dh = Y[6] | 0;
|
|
937
|
+
Dl = Y[7] | 0;
|
|
938
|
+
Eh = Y[8] | 0;
|
|
939
|
+
El = Y[9] | 0;
|
|
940
|
+
Fh = Y[10] | 0;
|
|
941
|
+
Fl = Y[11] | 0;
|
|
942
|
+
Gh = Y[12] | 0;
|
|
943
|
+
Gl = Y[13] | 0;
|
|
944
|
+
Hh = Y[14] | 0;
|
|
945
|
+
Hl = Y[15] | 0;
|
|
946
|
+
constructor() {
|
|
947
|
+
super(48);
|
|
948
|
+
}
|
|
949
|
+
}
|
|
950
|
+
const $ = /* @__PURE__ */ Uint32Array.from([
|
|
951
|
+
2352822216,
|
|
952
|
+
424955298,
|
|
953
|
+
1944164710,
|
|
954
|
+
2312950998,
|
|
955
|
+
502970286,
|
|
956
|
+
855612546,
|
|
957
|
+
1738396948,
|
|
958
|
+
1479516111,
|
|
959
|
+
258812777,
|
|
960
|
+
2077511080,
|
|
961
|
+
2011393907,
|
|
962
|
+
79989058,
|
|
963
|
+
1067287976,
|
|
964
|
+
1780299464,
|
|
965
|
+
286451373,
|
|
966
|
+
2446758561
|
|
967
|
+
]), tt = /* @__PURE__ */ Uint32Array.from([
|
|
968
|
+
573645204,
|
|
969
|
+
4230739756,
|
|
970
|
+
2673172387,
|
|
971
|
+
3360449730,
|
|
972
|
+
596883563,
|
|
973
|
+
1867755857,
|
|
974
|
+
2520282905,
|
|
975
|
+
1497426621,
|
|
976
|
+
2519219938,
|
|
977
|
+
2827943907,
|
|
978
|
+
3193839141,
|
|
979
|
+
1401305490,
|
|
980
|
+
721525244,
|
|
981
|
+
746961066,
|
|
982
|
+
246885852,
|
|
983
|
+
2177182882
|
|
984
|
+
]);
|
|
985
|
+
class c0 extends Xt {
|
|
986
|
+
Ah = $[0] | 0;
|
|
987
|
+
Al = $[1] | 0;
|
|
988
|
+
Bh = $[2] | 0;
|
|
989
|
+
Bl = $[3] | 0;
|
|
990
|
+
Ch = $[4] | 0;
|
|
991
|
+
Cl = $[5] | 0;
|
|
992
|
+
Dh = $[6] | 0;
|
|
993
|
+
Dl = $[7] | 0;
|
|
994
|
+
Eh = $[8] | 0;
|
|
995
|
+
El = $[9] | 0;
|
|
996
|
+
Fh = $[10] | 0;
|
|
997
|
+
Fl = $[11] | 0;
|
|
998
|
+
Gh = $[12] | 0;
|
|
999
|
+
Gl = $[13] | 0;
|
|
1000
|
+
Hh = $[14] | 0;
|
|
1001
|
+
Hl = $[15] | 0;
|
|
1002
|
+
constructor() {
|
|
1003
|
+
super(28);
|
|
1004
|
+
}
|
|
1005
|
+
}
|
|
1006
|
+
class o0 extends Xt {
|
|
1007
|
+
Ah = tt[0] | 0;
|
|
1008
|
+
Al = tt[1] | 0;
|
|
1009
|
+
Bh = tt[2] | 0;
|
|
1010
|
+
Bl = tt[3] | 0;
|
|
1011
|
+
Ch = tt[4] | 0;
|
|
1012
|
+
Cl = tt[5] | 0;
|
|
1013
|
+
Dh = tt[6] | 0;
|
|
1014
|
+
Dl = tt[7] | 0;
|
|
1015
|
+
Eh = tt[8] | 0;
|
|
1016
|
+
El = tt[9] | 0;
|
|
1017
|
+
Fh = tt[10] | 0;
|
|
1018
|
+
Fl = tt[11] | 0;
|
|
1019
|
+
Gh = tt[12] | 0;
|
|
1020
|
+
Gl = tt[13] | 0;
|
|
1021
|
+
Hh = tt[14] | 0;
|
|
1022
|
+
Hl = tt[15] | 0;
|
|
1023
|
+
constructor() {
|
|
1024
|
+
super(32);
|
|
1025
|
+
}
|
|
1026
|
+
}
|
|
1027
|
+
const os = /* @__PURE__ */ lt(
|
|
1028
|
+
() => new e0(),
|
|
1029
|
+
/* @__PURE__ */ mt(1)
|
|
1030
|
+
), as = /* @__PURE__ */ lt(
|
|
1031
|
+
() => new s0(),
|
|
1032
|
+
/* @__PURE__ */ mt(4)
|
|
1033
|
+
), hs = /* @__PURE__ */ lt(
|
|
1034
|
+
() => new r0(),
|
|
1035
|
+
/* @__PURE__ */ mt(3)
|
|
1036
|
+
), fs = /* @__PURE__ */ lt(
|
|
1037
|
+
() => new i0(),
|
|
1038
|
+
/* @__PURE__ */ mt(2)
|
|
1039
|
+
), ds = /* @__PURE__ */ lt(
|
|
1040
|
+
() => new o0(),
|
|
1041
|
+
/* @__PURE__ */ mt(6)
|
|
1042
|
+
), us = /* @__PURE__ */ lt(
|
|
1043
|
+
() => new c0(),
|
|
1044
|
+
/* @__PURE__ */ mt(5)
|
|
1045
|
+
), ls = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
1046
|
+
__proto__: null,
|
|
1047
|
+
_SHA224: s0,
|
|
1048
|
+
_SHA256: e0,
|
|
1049
|
+
_SHA384: i0,
|
|
1050
|
+
_SHA512: r0,
|
|
1051
|
+
_SHA512_224: c0,
|
|
1052
|
+
_SHA512_256: o0,
|
|
1053
|
+
sha224: as,
|
|
1054
|
+
sha256: os,
|
|
1055
|
+
sha384: fs,
|
|
1056
|
+
sha512: hs,
|
|
1057
|
+
sha512_224: us,
|
|
1058
|
+
sha512_256: ds
|
|
1059
|
+
}, Symbol.toStringTag, { value: "Module" }));
|
|
1060
|
+
var N = {}, et = {}, Yt = {}, Ft = {}, Ae;
|
|
1061
|
+
function bs() {
|
|
1062
|
+
return Ae || (Ae = 1, Object.defineProperty(Ft, "__esModule", { value: !0 }), Ft.crypto = void 0, Ft.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), Ft;
|
|
1063
|
+
}
|
|
1064
|
+
var ye;
|
|
1065
|
+
function ie() {
|
|
1066
|
+
return ye || (ye = 1, (function(t) {
|
|
1067
|
+
Object.defineProperty(t, "__esModule", { value: !0 }), t.wrapXOFConstructorWithOpts = t.wrapConstructorWithOpts = t.wrapConstructor = t.Hash = t.nextTick = t.swap32IfBE = t.byteSwapIfBE = t.swap8IfBE = t.isLE = void 0, t.isBytes = n, t.anumber = h, t.abytes = c, t.ahash = i, t.aexists = r, t.aoutput = a, t.u8 = b, t.u32 = x, t.clean = H, t.createView = u, t.rotr = S, t.rotl = B, t.byteSwap = g, t.byteSwap32 = I, t.bytesToHex = T, t.hexToBytes = p, t.asyncLoop = U, t.utf8ToBytes = E, t.bytesToUtf8 = o, t.toBytes = f, t.kdfInputToBytes = d, t.concatBytes = L, t.checkOpts = A, t.createHasher = F, t.createOptHasher = O, t.createXOFer = v, t.randomBytes = q;
|
|
1068
|
+
const e = /* @__PURE__ */ bs();
|
|
1069
|
+
function n(s) {
|
|
1070
|
+
return s instanceof Uint8Array || ArrayBuffer.isView(s) && s.constructor.name === "Uint8Array";
|
|
1071
|
+
}
|
|
1072
|
+
function h(s) {
|
|
1073
|
+
if (!Number.isSafeInteger(s) || s < 0)
|
|
1074
|
+
throw new Error("positive integer expected, got " + s);
|
|
1075
|
+
}
|
|
1076
|
+
function c(s, ...l) {
|
|
1077
|
+
if (!n(s))
|
|
464
1078
|
throw new Error("Uint8Array expected");
|
|
465
|
-
if (
|
|
466
|
-
throw new Error("Uint8Array expected of length " +
|
|
1079
|
+
if (l.length > 0 && !l.includes(s.length))
|
|
1080
|
+
throw new Error("Uint8Array expected of length " + l + ", got length=" + s.length);
|
|
467
1081
|
}
|
|
468
|
-
function
|
|
469
|
-
if (typeof
|
|
1082
|
+
function i(s) {
|
|
1083
|
+
if (typeof s != "function" || typeof s.create != "function")
|
|
470
1084
|
throw new Error("Hash should be wrapped by utils.createHasher");
|
|
471
|
-
|
|
1085
|
+
h(s.outputLen), h(s.blockLen);
|
|
472
1086
|
}
|
|
473
|
-
function
|
|
474
|
-
if (
|
|
1087
|
+
function r(s, l = !0) {
|
|
1088
|
+
if (s.destroyed)
|
|
475
1089
|
throw new Error("Hash instance has been destroyed");
|
|
476
|
-
if (
|
|
1090
|
+
if (l && s.finished)
|
|
477
1091
|
throw new Error("Hash#digest() has already been called");
|
|
478
1092
|
}
|
|
479
|
-
function
|
|
480
|
-
|
|
481
|
-
const
|
|
482
|
-
if (
|
|
483
|
-
throw new Error("digestInto() expects output buffer of length at least " +
|
|
1093
|
+
function a(s, l) {
|
|
1094
|
+
c(s);
|
|
1095
|
+
const y = l.outputLen;
|
|
1096
|
+
if (s.length < y)
|
|
1097
|
+
throw new Error("digestInto() expects output buffer of length at least " + y);
|
|
484
1098
|
}
|
|
485
|
-
function b(
|
|
486
|
-
return new Uint8Array(
|
|
1099
|
+
function b(s) {
|
|
1100
|
+
return new Uint8Array(s.buffer, s.byteOffset, s.byteLength);
|
|
487
1101
|
}
|
|
488
|
-
function x(
|
|
489
|
-
return new Uint32Array(
|
|
1102
|
+
function x(s) {
|
|
1103
|
+
return new Uint32Array(s.buffer, s.byteOffset, Math.floor(s.byteLength / 4));
|
|
490
1104
|
}
|
|
491
|
-
function H(...
|
|
492
|
-
for (let
|
|
493
|
-
|
|
1105
|
+
function H(...s) {
|
|
1106
|
+
for (let l = 0; l < s.length; l++)
|
|
1107
|
+
s[l].fill(0);
|
|
494
1108
|
}
|
|
495
|
-
function u(
|
|
496
|
-
return new DataView(
|
|
1109
|
+
function u(s) {
|
|
1110
|
+
return new DataView(s.buffer, s.byteOffset, s.byteLength);
|
|
497
1111
|
}
|
|
498
|
-
function
|
|
499
|
-
return
|
|
1112
|
+
function S(s, l) {
|
|
1113
|
+
return s << 32 - l | s >>> l;
|
|
500
1114
|
}
|
|
501
|
-
function
|
|
502
|
-
return
|
|
1115
|
+
function B(s, l) {
|
|
1116
|
+
return s << l | s >>> 32 - l >>> 0;
|
|
503
1117
|
}
|
|
504
1118
|
t.isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
505
|
-
function
|
|
506
|
-
return
|
|
507
|
-
}
|
|
508
|
-
t.swap8IfBE = t.isLE ? (
|
|
509
|
-
function I(
|
|
510
|
-
for (let
|
|
511
|
-
|
|
512
|
-
return
|
|
513
|
-
}
|
|
514
|
-
t.swap32IfBE = t.isLE ? (
|
|
515
|
-
const
|
|
516
|
-
function
|
|
517
|
-
if (
|
|
518
|
-
return
|
|
519
|
-
let
|
|
520
|
-
for (let
|
|
521
|
-
|
|
522
|
-
return
|
|
523
|
-
}
|
|
524
|
-
const
|
|
525
|
-
function
|
|
526
|
-
if (
|
|
527
|
-
return
|
|
528
|
-
if (
|
|
529
|
-
return
|
|
530
|
-
if (
|
|
531
|
-
return
|
|
532
|
-
}
|
|
533
|
-
function
|
|
534
|
-
if (typeof
|
|
535
|
-
throw new Error("hex string expected, got " + typeof
|
|
536
|
-
if (
|
|
537
|
-
return Uint8Array.fromHex(
|
|
538
|
-
const
|
|
539
|
-
if (
|
|
540
|
-
throw new Error("hex string expected, got unpadded hex of length " +
|
|
541
|
-
const
|
|
542
|
-
for (let
|
|
543
|
-
const
|
|
544
|
-
if (
|
|
545
|
-
const
|
|
546
|
-
throw new Error('hex string expected, got non-hex character "' +
|
|
1119
|
+
function g(s) {
|
|
1120
|
+
return s << 24 & 4278190080 | s << 8 & 16711680 | s >>> 8 & 65280 | s >>> 24 & 255;
|
|
1121
|
+
}
|
|
1122
|
+
t.swap8IfBE = t.isLE ? (s) => s : (s) => g(s), t.byteSwapIfBE = t.swap8IfBE;
|
|
1123
|
+
function I(s) {
|
|
1124
|
+
for (let l = 0; l < s.length; l++)
|
|
1125
|
+
s[l] = g(s[l]);
|
|
1126
|
+
return s;
|
|
1127
|
+
}
|
|
1128
|
+
t.swap32IfBE = t.isLE ? (s) => s : I;
|
|
1129
|
+
const D = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", R = /* @__PURE__ */ Array.from({ length: 256 }, (s, l) => l.toString(16).padStart(2, "0"));
|
|
1130
|
+
function T(s) {
|
|
1131
|
+
if (c(s), D)
|
|
1132
|
+
return s.toHex();
|
|
1133
|
+
let l = "";
|
|
1134
|
+
for (let y = 0; y < s.length; y++)
|
|
1135
|
+
l += R[s[y]];
|
|
1136
|
+
return l;
|
|
1137
|
+
}
|
|
1138
|
+
const _ = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
1139
|
+
function C(s) {
|
|
1140
|
+
if (s >= _._0 && s <= _._9)
|
|
1141
|
+
return s - _._0;
|
|
1142
|
+
if (s >= _.A && s <= _.F)
|
|
1143
|
+
return s - (_.A - 10);
|
|
1144
|
+
if (s >= _.a && s <= _.f)
|
|
1145
|
+
return s - (_.a - 10);
|
|
1146
|
+
}
|
|
1147
|
+
function p(s) {
|
|
1148
|
+
if (typeof s != "string")
|
|
1149
|
+
throw new Error("hex string expected, got " + typeof s);
|
|
1150
|
+
if (D)
|
|
1151
|
+
return Uint8Array.fromHex(s);
|
|
1152
|
+
const l = s.length, y = l / 2;
|
|
1153
|
+
if (l % 2)
|
|
1154
|
+
throw new Error("hex string expected, got unpadded hex of length " + l);
|
|
1155
|
+
const V = new Uint8Array(y);
|
|
1156
|
+
for (let k = 0, M = 0; k < y; k++, M += 2) {
|
|
1157
|
+
const z = C(s.charCodeAt(M)), P = C(s.charCodeAt(M + 1));
|
|
1158
|
+
if (z === void 0 || P === void 0) {
|
|
1159
|
+
const K = s[M] + s[M + 1];
|
|
1160
|
+
throw new Error('hex string expected, got non-hex character "' + K + '" at index ' + M);
|
|
547
1161
|
}
|
|
548
|
-
|
|
1162
|
+
V[k] = z * 16 + P;
|
|
549
1163
|
}
|
|
550
|
-
return
|
|
1164
|
+
return V;
|
|
551
1165
|
}
|
|
552
|
-
const
|
|
1166
|
+
const w = async () => {
|
|
553
1167
|
};
|
|
554
|
-
t.nextTick =
|
|
555
|
-
async function
|
|
556
|
-
let
|
|
557
|
-
for (let
|
|
558
|
-
|
|
559
|
-
const
|
|
560
|
-
|
|
1168
|
+
t.nextTick = w;
|
|
1169
|
+
async function U(s, l, y) {
|
|
1170
|
+
let V = Date.now();
|
|
1171
|
+
for (let k = 0; k < s; k++) {
|
|
1172
|
+
y(k);
|
|
1173
|
+
const M = Date.now() - V;
|
|
1174
|
+
M >= 0 && M < l || (await (0, t.nextTick)(), V += M);
|
|
561
1175
|
}
|
|
562
1176
|
}
|
|
563
|
-
function
|
|
564
|
-
if (typeof
|
|
1177
|
+
function E(s) {
|
|
1178
|
+
if (typeof s != "string")
|
|
565
1179
|
throw new Error("string expected");
|
|
566
|
-
return new Uint8Array(new TextEncoder().encode(
|
|
1180
|
+
return new Uint8Array(new TextEncoder().encode(s));
|
|
567
1181
|
}
|
|
568
|
-
function
|
|
569
|
-
return new TextDecoder().decode(
|
|
1182
|
+
function o(s) {
|
|
1183
|
+
return new TextDecoder().decode(s);
|
|
570
1184
|
}
|
|
571
|
-
function
|
|
572
|
-
return typeof
|
|
1185
|
+
function f(s) {
|
|
1186
|
+
return typeof s == "string" && (s = E(s)), c(s), s;
|
|
573
1187
|
}
|
|
574
|
-
function
|
|
575
|
-
return typeof
|
|
1188
|
+
function d(s) {
|
|
1189
|
+
return typeof s == "string" && (s = E(s)), c(s), s;
|
|
576
1190
|
}
|
|
577
|
-
function
|
|
578
|
-
let
|
|
579
|
-
for (let
|
|
580
|
-
const
|
|
581
|
-
|
|
1191
|
+
function L(...s) {
|
|
1192
|
+
let l = 0;
|
|
1193
|
+
for (let V = 0; V < s.length; V++) {
|
|
1194
|
+
const k = s[V];
|
|
1195
|
+
c(k), l += k.length;
|
|
582
1196
|
}
|
|
583
|
-
const
|
|
584
|
-
for (let
|
|
585
|
-
const
|
|
586
|
-
|
|
1197
|
+
const y = new Uint8Array(l);
|
|
1198
|
+
for (let V = 0, k = 0; V < s.length; V++) {
|
|
1199
|
+
const M = s[V];
|
|
1200
|
+
y.set(M, k), k += M.length;
|
|
587
1201
|
}
|
|
588
|
-
return
|
|
1202
|
+
return y;
|
|
589
1203
|
}
|
|
590
|
-
function
|
|
591
|
-
if (
|
|
1204
|
+
function A(s, l) {
|
|
1205
|
+
if (l !== void 0 && {}.toString.call(l) !== "[object Object]")
|
|
592
1206
|
throw new Error("options should be object or undefined");
|
|
593
|
-
return Object.assign(
|
|
1207
|
+
return Object.assign(s, l);
|
|
594
1208
|
}
|
|
595
|
-
class
|
|
1209
|
+
class m {
|
|
596
1210
|
}
|
|
597
|
-
t.Hash =
|
|
598
|
-
function
|
|
599
|
-
const
|
|
600
|
-
return
|
|
1211
|
+
t.Hash = m;
|
|
1212
|
+
function F(s) {
|
|
1213
|
+
const l = (V) => s().update(f(V)).digest(), y = s();
|
|
1214
|
+
return l.outputLen = y.outputLen, l.blockLen = y.blockLen, l.create = () => s(), l;
|
|
601
1215
|
}
|
|
602
|
-
function
|
|
603
|
-
const
|
|
604
|
-
return
|
|
1216
|
+
function O(s) {
|
|
1217
|
+
const l = (V, k) => s(k).update(f(V)).digest(), y = s({});
|
|
1218
|
+
return l.outputLen = y.outputLen, l.blockLen = y.blockLen, l.create = (V) => s(V), l;
|
|
605
1219
|
}
|
|
606
|
-
function
|
|
607
|
-
const
|
|
608
|
-
return
|
|
1220
|
+
function v(s) {
|
|
1221
|
+
const l = (V, k) => s(k).update(f(V)).digest(), y = s({});
|
|
1222
|
+
return l.outputLen = y.outputLen, l.blockLen = y.blockLen, l.create = (V) => s(V), l;
|
|
609
1223
|
}
|
|
610
|
-
t.wrapConstructor =
|
|
611
|
-
function
|
|
1224
|
+
t.wrapConstructor = F, t.wrapConstructorWithOpts = O, t.wrapXOFConstructorWithOpts = v;
|
|
1225
|
+
function q(s = 32) {
|
|
612
1226
|
if (e.crypto && typeof e.crypto.getRandomValues == "function")
|
|
613
|
-
return e.crypto.getRandomValues(new Uint8Array(
|
|
1227
|
+
return e.crypto.getRandomValues(new Uint8Array(s));
|
|
614
1228
|
if (e.crypto && typeof e.crypto.randomBytes == "function")
|
|
615
|
-
return Uint8Array.from(e.crypto.randomBytes(
|
|
1229
|
+
return Uint8Array.from(e.crypto.randomBytes(s));
|
|
616
1230
|
throw new Error("crypto.getRandomValues must be defined");
|
|
617
1231
|
}
|
|
618
|
-
})(
|
|
1232
|
+
})(Yt)), Yt;
|
|
619
1233
|
}
|
|
620
|
-
var
|
|
621
|
-
function
|
|
622
|
-
if (
|
|
623
|
-
|
|
624
|
-
const t = /* @__PURE__ */
|
|
625
|
-
function e(
|
|
626
|
-
if (typeof
|
|
627
|
-
return
|
|
628
|
-
const x = BigInt(32), H = BigInt(4294967295), u = Number(
|
|
629
|
-
|
|
630
|
-
}
|
|
631
|
-
function
|
|
632
|
-
return
|
|
633
|
-
}
|
|
634
|
-
function i
|
|
635
|
-
return
|
|
636
|
-
}
|
|
637
|
-
class
|
|
638
|
-
constructor(
|
|
639
|
-
super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen =
|
|
640
|
-
}
|
|
641
|
-
update(
|
|
642
|
-
(0, t.aexists)(this),
|
|
643
|
-
const { view:
|
|
1234
|
+
var pe;
|
|
1235
|
+
function xs() {
|
|
1236
|
+
if (pe) return et;
|
|
1237
|
+
pe = 1, Object.defineProperty(et, "__esModule", { value: !0 }), et.SHA512_IV = et.SHA384_IV = et.SHA224_IV = et.SHA256_IV = et.HashMD = void 0, et.setBigUint64 = e, et.Chi = n, et.Maj = h;
|
|
1238
|
+
const t = /* @__PURE__ */ ie();
|
|
1239
|
+
function e(i, r, a, b) {
|
|
1240
|
+
if (typeof i.setBigUint64 == "function")
|
|
1241
|
+
return i.setBigUint64(r, a, b);
|
|
1242
|
+
const x = BigInt(32), H = BigInt(4294967295), u = Number(a >> x & H), S = Number(a & H), B = b ? 4 : 0, g = b ? 0 : 4;
|
|
1243
|
+
i.setUint32(r + B, u, b), i.setUint32(r + g, S, b);
|
|
1244
|
+
}
|
|
1245
|
+
function n(i, r, a) {
|
|
1246
|
+
return i & r ^ ~i & a;
|
|
1247
|
+
}
|
|
1248
|
+
function h(i, r, a) {
|
|
1249
|
+
return i & r ^ i & a ^ r & a;
|
|
1250
|
+
}
|
|
1251
|
+
class c extends t.Hash {
|
|
1252
|
+
constructor(r, a, b, x) {
|
|
1253
|
+
super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = r, this.outputLen = a, this.padOffset = b, this.isLE = x, this.buffer = new Uint8Array(r), this.view = (0, t.createView)(this.buffer);
|
|
1254
|
+
}
|
|
1255
|
+
update(r) {
|
|
1256
|
+
(0, t.aexists)(this), r = (0, t.toBytes)(r), (0, t.abytes)(r);
|
|
1257
|
+
const { view: a, buffer: b, blockLen: x } = this, H = r.length;
|
|
644
1258
|
for (let u = 0; u < H; ) {
|
|
645
|
-
const
|
|
646
|
-
if (
|
|
647
|
-
const
|
|
1259
|
+
const S = Math.min(x - this.pos, H - u);
|
|
1260
|
+
if (S === x) {
|
|
1261
|
+
const B = (0, t.createView)(r);
|
|
648
1262
|
for (; x <= H - u; u += x)
|
|
649
|
-
this.process(
|
|
1263
|
+
this.process(B, u);
|
|
650
1264
|
continue;
|
|
651
1265
|
}
|
|
652
|
-
b.set(
|
|
1266
|
+
b.set(r.subarray(u, u + S), this.pos), this.pos += S, u += S, this.pos === x && (this.process(a, 0), this.pos = 0);
|
|
653
1267
|
}
|
|
654
|
-
return this.length +=
|
|
1268
|
+
return this.length += r.length, this.roundClean(), this;
|
|
655
1269
|
}
|
|
656
|
-
digestInto(
|
|
657
|
-
(0, t.aexists)(this), (0, t.aoutput)(
|
|
658
|
-
const { buffer:
|
|
1270
|
+
digestInto(r) {
|
|
1271
|
+
(0, t.aexists)(this), (0, t.aoutput)(r, this), this.finished = !0;
|
|
1272
|
+
const { buffer: a, view: b, blockLen: x, isLE: H } = this;
|
|
659
1273
|
let { pos: u } = this;
|
|
660
|
-
|
|
661
|
-
for (let
|
|
662
|
-
|
|
1274
|
+
a[u++] = 128, (0, t.clean)(this.buffer.subarray(u)), this.padOffset > x - u && (this.process(b, 0), u = 0);
|
|
1275
|
+
for (let D = u; D < x; D++)
|
|
1276
|
+
a[D] = 0;
|
|
663
1277
|
e(b, x - 8, BigInt(this.length * 8), H), this.process(b, 0);
|
|
664
|
-
const
|
|
665
|
-
if (
|
|
1278
|
+
const S = (0, t.createView)(r), B = this.outputLen;
|
|
1279
|
+
if (B % 4)
|
|
666
1280
|
throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
667
|
-
const
|
|
668
|
-
if (
|
|
1281
|
+
const g = B / 4, I = this.get();
|
|
1282
|
+
if (g > I.length)
|
|
669
1283
|
throw new Error("_sha2: outputLen bigger than state");
|
|
670
|
-
for (let
|
|
671
|
-
|
|
1284
|
+
for (let D = 0; D < g; D++)
|
|
1285
|
+
S.setUint32(4 * D, I[D], H);
|
|
672
1286
|
}
|
|
673
1287
|
digest() {
|
|
674
|
-
const { buffer:
|
|
675
|
-
this.digestInto(
|
|
676
|
-
const b =
|
|
1288
|
+
const { buffer: r, outputLen: a } = this;
|
|
1289
|
+
this.digestInto(r);
|
|
1290
|
+
const b = r.slice(0, a);
|
|
677
1291
|
return this.destroy(), b;
|
|
678
1292
|
}
|
|
679
|
-
_cloneInto(
|
|
680
|
-
|
|
681
|
-
const { blockLen:
|
|
682
|
-
return
|
|
1293
|
+
_cloneInto(r) {
|
|
1294
|
+
r || (r = new this.constructor()), r.set(...this.get());
|
|
1295
|
+
const { blockLen: a, buffer: b, length: x, finished: H, destroyed: u, pos: S } = this;
|
|
1296
|
+
return r.destroyed = u, r.finished = H, r.length = x, r.pos = S, x % a && r.buffer.set(b), r;
|
|
683
1297
|
}
|
|
684
1298
|
clone() {
|
|
685
1299
|
return this._cloneInto();
|
|
686
1300
|
}
|
|
687
1301
|
}
|
|
688
|
-
return
|
|
1302
|
+
return et.HashMD = c, et.SHA256_IV = Uint32Array.from([
|
|
689
1303
|
1779033703,
|
|
690
1304
|
3144134277,
|
|
691
1305
|
1013904242,
|
|
@@ -694,7 +1308,7 @@ function oe() {
|
|
|
694
1308
|
2600822924,
|
|
695
1309
|
528734635,
|
|
696
1310
|
1541459225
|
|
697
|
-
]),
|
|
1311
|
+
]), et.SHA224_IV = Uint32Array.from([
|
|
698
1312
|
3238371032,
|
|
699
1313
|
914150663,
|
|
700
1314
|
812702999,
|
|
@@ -703,7 +1317,7 @@ function oe() {
|
|
|
703
1317
|
1750603025,
|
|
704
1318
|
1694076839,
|
|
705
1319
|
3204075428
|
|
706
|
-
]),
|
|
1320
|
+
]), et.SHA384_IV = Uint32Array.from([
|
|
707
1321
|
3418070365,
|
|
708
1322
|
3238371032,
|
|
709
1323
|
1654270250,
|
|
@@ -720,7 +1334,7 @@ function oe() {
|
|
|
720
1334
|
1694076839,
|
|
721
1335
|
1203062813,
|
|
722
1336
|
3204075428
|
|
723
|
-
]),
|
|
1337
|
+
]), et.SHA512_IV = Uint32Array.from([
|
|
724
1338
|
1779033703,
|
|
725
1339
|
4089235720,
|
|
726
1340
|
3144134277,
|
|
@@ -737,98 +1351,98 @@ function oe() {
|
|
|
737
1351
|
4215389547,
|
|
738
1352
|
1541459225,
|
|
739
1353
|
327033209
|
|
740
|
-
]),
|
|
1354
|
+
]), et;
|
|
741
1355
|
}
|
|
742
|
-
var
|
|
743
|
-
function
|
|
744
|
-
if (
|
|
745
|
-
|
|
1356
|
+
var G = {}, _e;
|
|
1357
|
+
function Hs() {
|
|
1358
|
+
if (_e) return G;
|
|
1359
|
+
_e = 1, Object.defineProperty(G, "__esModule", { value: !0 }), G.toBig = G.shrSL = G.shrSH = G.rotrSL = G.rotrSH = G.rotrBL = G.rotrBH = G.rotr32L = G.rotr32H = G.rotlSL = G.rotlSH = G.rotlBL = G.rotlBH = G.add5L = G.add5H = G.add4L = G.add4H = G.add3L = G.add3H = void 0, G.add = R, G.fromBig = n, G.split = h;
|
|
746
1360
|
const t = /* @__PURE__ */ BigInt(2 ** 32 - 1), e = /* @__PURE__ */ BigInt(32);
|
|
747
|
-
function
|
|
748
|
-
return
|
|
749
|
-
}
|
|
750
|
-
function
|
|
751
|
-
const
|
|
752
|
-
let
|
|
753
|
-
for (let
|
|
754
|
-
const { h:
|
|
755
|
-
[
|
|
756
|
-
}
|
|
757
|
-
return [
|
|
758
|
-
}
|
|
759
|
-
const
|
|
760
|
-
|
|
761
|
-
const
|
|
762
|
-
|
|
763
|
-
const
|
|
764
|
-
|
|
765
|
-
const
|
|
766
|
-
|
|
767
|
-
const b = (
|
|
768
|
-
|
|
769
|
-
const x = (
|
|
770
|
-
|
|
771
|
-
const H = (
|
|
772
|
-
|
|
773
|
-
const u = (
|
|
774
|
-
|
|
775
|
-
const
|
|
776
|
-
|
|
777
|
-
const
|
|
778
|
-
|
|
779
|
-
const
|
|
780
|
-
|
|
781
|
-
const I = (
|
|
782
|
-
|
|
783
|
-
const
|
|
784
|
-
|
|
785
|
-
function R(
|
|
786
|
-
const
|
|
787
|
-
return { h:
|
|
788
|
-
}
|
|
789
|
-
const
|
|
790
|
-
|
|
791
|
-
const
|
|
792
|
-
|
|
793
|
-
const
|
|
794
|
-
|
|
795
|
-
const
|
|
796
|
-
|
|
797
|
-
const
|
|
798
|
-
|
|
799
|
-
const
|
|
800
|
-
|
|
801
|
-
const
|
|
802
|
-
fromBig:
|
|
803
|
-
split:
|
|
804
|
-
toBig:
|
|
805
|
-
shrSH:
|
|
806
|
-
shrSL:
|
|
807
|
-
rotrSH:
|
|
1361
|
+
function n(o, f = !1) {
|
|
1362
|
+
return f ? { h: Number(o & t), l: Number(o >> e & t) } : { h: Number(o >> e & t) | 0, l: Number(o & t) | 0 };
|
|
1363
|
+
}
|
|
1364
|
+
function h(o, f = !1) {
|
|
1365
|
+
const d = o.length;
|
|
1366
|
+
let L = new Uint32Array(d), A = new Uint32Array(d);
|
|
1367
|
+
for (let m = 0; m < d; m++) {
|
|
1368
|
+
const { h: F, l: O } = n(o[m], f);
|
|
1369
|
+
[L[m], A[m]] = [F, O];
|
|
1370
|
+
}
|
|
1371
|
+
return [L, A];
|
|
1372
|
+
}
|
|
1373
|
+
const c = (o, f) => BigInt(o >>> 0) << e | BigInt(f >>> 0);
|
|
1374
|
+
G.toBig = c;
|
|
1375
|
+
const i = (o, f, d) => o >>> d;
|
|
1376
|
+
G.shrSH = i;
|
|
1377
|
+
const r = (o, f, d) => o << 32 - d | f >>> d;
|
|
1378
|
+
G.shrSL = r;
|
|
1379
|
+
const a = (o, f, d) => o >>> d | f << 32 - d;
|
|
1380
|
+
G.rotrSH = a;
|
|
1381
|
+
const b = (o, f, d) => o << 32 - d | f >>> d;
|
|
1382
|
+
G.rotrSL = b;
|
|
1383
|
+
const x = (o, f, d) => o << 64 - d | f >>> d - 32;
|
|
1384
|
+
G.rotrBH = x;
|
|
1385
|
+
const H = (o, f, d) => o >>> d - 32 | f << 64 - d;
|
|
1386
|
+
G.rotrBL = H;
|
|
1387
|
+
const u = (o, f) => f;
|
|
1388
|
+
G.rotr32H = u;
|
|
1389
|
+
const S = (o, f) => o;
|
|
1390
|
+
G.rotr32L = S;
|
|
1391
|
+
const B = (o, f, d) => o << d | f >>> 32 - d;
|
|
1392
|
+
G.rotlSH = B;
|
|
1393
|
+
const g = (o, f, d) => f << d | o >>> 32 - d;
|
|
1394
|
+
G.rotlSL = g;
|
|
1395
|
+
const I = (o, f, d) => f << d - 32 | o >>> 64 - d;
|
|
1396
|
+
G.rotlBH = I;
|
|
1397
|
+
const D = (o, f, d) => o << d - 32 | f >>> 64 - d;
|
|
1398
|
+
G.rotlBL = D;
|
|
1399
|
+
function R(o, f, d, L) {
|
|
1400
|
+
const A = (f >>> 0) + (L >>> 0);
|
|
1401
|
+
return { h: o + d + (A / 2 ** 32 | 0) | 0, l: A | 0 };
|
|
1402
|
+
}
|
|
1403
|
+
const T = (o, f, d) => (o >>> 0) + (f >>> 0) + (d >>> 0);
|
|
1404
|
+
G.add3L = T;
|
|
1405
|
+
const _ = (o, f, d, L) => f + d + L + (o / 2 ** 32 | 0) | 0;
|
|
1406
|
+
G.add3H = _;
|
|
1407
|
+
const C = (o, f, d, L) => (o >>> 0) + (f >>> 0) + (d >>> 0) + (L >>> 0);
|
|
1408
|
+
G.add4L = C;
|
|
1409
|
+
const p = (o, f, d, L, A) => f + d + L + A + (o / 2 ** 32 | 0) | 0;
|
|
1410
|
+
G.add4H = p;
|
|
1411
|
+
const w = (o, f, d, L, A) => (o >>> 0) + (f >>> 0) + (d >>> 0) + (L >>> 0) + (A >>> 0);
|
|
1412
|
+
G.add5L = w;
|
|
1413
|
+
const U = (o, f, d, L, A, m) => f + d + L + A + m + (o / 2 ** 32 | 0) | 0;
|
|
1414
|
+
G.add5H = U;
|
|
1415
|
+
const E = {
|
|
1416
|
+
fromBig: n,
|
|
1417
|
+
split: h,
|
|
1418
|
+
toBig: c,
|
|
1419
|
+
shrSH: i,
|
|
1420
|
+
shrSL: r,
|
|
1421
|
+
rotrSH: a,
|
|
808
1422
|
rotrSL: b,
|
|
809
1423
|
rotrBH: x,
|
|
810
1424
|
rotrBL: H,
|
|
811
1425
|
rotr32H: u,
|
|
812
|
-
rotr32L:
|
|
813
|
-
rotlSH:
|
|
814
|
-
rotlSL:
|
|
1426
|
+
rotr32L: S,
|
|
1427
|
+
rotlSH: B,
|
|
1428
|
+
rotlSL: g,
|
|
815
1429
|
rotlBH: I,
|
|
816
|
-
rotlBL:
|
|
1430
|
+
rotlBL: D,
|
|
817
1431
|
add: R,
|
|
818
|
-
add3L:
|
|
819
|
-
add3H:
|
|
820
|
-
add4L:
|
|
821
|
-
add4H:
|
|
822
|
-
add5H:
|
|
823
|
-
add5L:
|
|
1432
|
+
add3L: T,
|
|
1433
|
+
add3H: _,
|
|
1434
|
+
add4L: C,
|
|
1435
|
+
add4H: p,
|
|
1436
|
+
add5H: U,
|
|
1437
|
+
add5L: w
|
|
824
1438
|
};
|
|
825
|
-
return
|
|
1439
|
+
return G.default = E, G;
|
|
826
1440
|
}
|
|
827
|
-
var
|
|
828
|
-
function
|
|
829
|
-
if (
|
|
830
|
-
|
|
831
|
-
const t = /* @__PURE__ */
|
|
1441
|
+
var ge;
|
|
1442
|
+
function qs() {
|
|
1443
|
+
if (ge) return N;
|
|
1444
|
+
ge = 1, Object.defineProperty(N, "__esModule", { value: !0 }), N.sha512_224 = N.sha512_256 = N.sha384 = N.sha512 = N.sha224 = N.sha256 = N.SHA512_256 = N.SHA512_224 = N.SHA384 = N.SHA512 = N.SHA224 = N.SHA256 = void 0;
|
|
1445
|
+
const t = /* @__PURE__ */ xs(), e = /* @__PURE__ */ Hs(), n = /* @__PURE__ */ ie(), h = /* @__PURE__ */ Uint32Array.from([
|
|
832
1446
|
1116352408,
|
|
833
1447
|
1899447441,
|
|
834
1448
|
3049323471,
|
|
@@ -893,48 +1507,48 @@ function ce() {
|
|
|
893
1507
|
2756734187,
|
|
894
1508
|
3204031479,
|
|
895
1509
|
3329325298
|
|
896
|
-
]),
|
|
897
|
-
class
|
|
898
|
-
constructor(
|
|
899
|
-
super(64,
|
|
1510
|
+
]), c = /* @__PURE__ */ new Uint32Array(64);
|
|
1511
|
+
class i extends t.HashMD {
|
|
1512
|
+
constructor(_ = 32) {
|
|
1513
|
+
super(64, _, 8, !1), this.A = t.SHA256_IV[0] | 0, this.B = t.SHA256_IV[1] | 0, this.C = t.SHA256_IV[2] | 0, this.D = t.SHA256_IV[3] | 0, this.E = t.SHA256_IV[4] | 0, this.F = t.SHA256_IV[5] | 0, this.G = t.SHA256_IV[6] | 0, this.H = t.SHA256_IV[7] | 0;
|
|
900
1514
|
}
|
|
901
1515
|
get() {
|
|
902
|
-
const { A:
|
|
903
|
-
return [
|
|
1516
|
+
const { A: _, B: C, C: p, D: w, E: U, F: E, G: o, H: f } = this;
|
|
1517
|
+
return [_, C, p, w, U, E, o, f];
|
|
904
1518
|
}
|
|
905
1519
|
// prettier-ignore
|
|
906
|
-
set(
|
|
907
|
-
this.A =
|
|
908
|
-
}
|
|
909
|
-
process(
|
|
910
|
-
for (let
|
|
911
|
-
|
|
912
|
-
for (let
|
|
913
|
-
const
|
|
914
|
-
|
|
1520
|
+
set(_, C, p, w, U, E, o, f) {
|
|
1521
|
+
this.A = _ | 0, this.B = C | 0, this.C = p | 0, this.D = w | 0, this.E = U | 0, this.F = E | 0, this.G = o | 0, this.H = f | 0;
|
|
1522
|
+
}
|
|
1523
|
+
process(_, C) {
|
|
1524
|
+
for (let A = 0; A < 16; A++, C += 4)
|
|
1525
|
+
c[A] = _.getUint32(C, !1);
|
|
1526
|
+
for (let A = 16; A < 64; A++) {
|
|
1527
|
+
const m = c[A - 15], F = c[A - 2], O = (0, n.rotr)(m, 7) ^ (0, n.rotr)(m, 18) ^ m >>> 3, v = (0, n.rotr)(F, 17) ^ (0, n.rotr)(F, 19) ^ F >>> 10;
|
|
1528
|
+
c[A] = v + c[A - 7] + O + c[A - 16] | 0;
|
|
915
1529
|
}
|
|
916
|
-
let { A:
|
|
917
|
-
for (let
|
|
918
|
-
const
|
|
919
|
-
|
|
1530
|
+
let { A: p, B: w, C: U, D: E, E: o, F: f, G: d, H: L } = this;
|
|
1531
|
+
for (let A = 0; A < 64; A++) {
|
|
1532
|
+
const m = (0, n.rotr)(o, 6) ^ (0, n.rotr)(o, 11) ^ (0, n.rotr)(o, 25), F = L + m + (0, t.Chi)(o, f, d) + h[A] + c[A] | 0, v = ((0, n.rotr)(p, 2) ^ (0, n.rotr)(p, 13) ^ (0, n.rotr)(p, 22)) + (0, t.Maj)(p, w, U) | 0;
|
|
1533
|
+
L = d, d = f, f = o, o = E + F | 0, E = U, U = w, w = p, p = F + v | 0;
|
|
920
1534
|
}
|
|
921
|
-
|
|
1535
|
+
p = p + this.A | 0, w = w + this.B | 0, U = U + this.C | 0, E = E + this.D | 0, o = o + this.E | 0, f = f + this.F | 0, d = d + this.G | 0, L = L + this.H | 0, this.set(p, w, U, E, o, f, d, L);
|
|
922
1536
|
}
|
|
923
1537
|
roundClean() {
|
|
924
|
-
(0,
|
|
1538
|
+
(0, n.clean)(c);
|
|
925
1539
|
}
|
|
926
1540
|
destroy() {
|
|
927
|
-
this.set(0, 0, 0, 0, 0, 0, 0, 0), (0,
|
|
1541
|
+
this.set(0, 0, 0, 0, 0, 0, 0, 0), (0, n.clean)(this.buffer);
|
|
928
1542
|
}
|
|
929
1543
|
}
|
|
930
|
-
|
|
931
|
-
class
|
|
1544
|
+
N.SHA256 = i;
|
|
1545
|
+
class r extends i {
|
|
932
1546
|
constructor() {
|
|
933
1547
|
super(28), this.A = t.SHA224_IV[0] | 0, this.B = t.SHA224_IV[1] | 0, this.C = t.SHA224_IV[2] | 0, this.D = t.SHA224_IV[3] | 0, this.E = t.SHA224_IV[4] | 0, this.F = t.SHA224_IV[5] | 0, this.G = t.SHA224_IV[6] | 0, this.H = t.SHA224_IV[7] | 0;
|
|
934
1548
|
}
|
|
935
1549
|
}
|
|
936
|
-
|
|
937
|
-
const
|
|
1550
|
+
N.SHA224 = r;
|
|
1551
|
+
const a = e.split([
|
|
938
1552
|
"0x428a2f98d728ae22",
|
|
939
1553
|
"0x7137449123ef65cd",
|
|
940
1554
|
"0xb5c0fbcfec4d3b2f",
|
|
@@ -1015,51 +1629,51 @@ function ce() {
|
|
|
1015
1629
|
"0x597f299cfc657e2a",
|
|
1016
1630
|
"0x5fcb6fab3ad6faec",
|
|
1017
1631
|
"0x6c44198c4a475817"
|
|
1018
|
-
].map((
|
|
1019
|
-
class
|
|
1020
|
-
constructor(
|
|
1021
|
-
super(128,
|
|
1632
|
+
].map((T) => BigInt(T))), b = a[0], x = a[1], H = /* @__PURE__ */ new Uint32Array(80), u = /* @__PURE__ */ new Uint32Array(80);
|
|
1633
|
+
class S extends t.HashMD {
|
|
1634
|
+
constructor(_ = 64) {
|
|
1635
|
+
super(128, _, 16, !1), this.Ah = t.SHA512_IV[0] | 0, this.Al = t.SHA512_IV[1] | 0, this.Bh = t.SHA512_IV[2] | 0, this.Bl = t.SHA512_IV[3] | 0, this.Ch = t.SHA512_IV[4] | 0, this.Cl = t.SHA512_IV[5] | 0, this.Dh = t.SHA512_IV[6] | 0, this.Dl = t.SHA512_IV[7] | 0, this.Eh = t.SHA512_IV[8] | 0, this.El = t.SHA512_IV[9] | 0, this.Fh = t.SHA512_IV[10] | 0, this.Fl = t.SHA512_IV[11] | 0, this.Gh = t.SHA512_IV[12] | 0, this.Gl = t.SHA512_IV[13] | 0, this.Hh = t.SHA512_IV[14] | 0, this.Hl = t.SHA512_IV[15] | 0;
|
|
1022
1636
|
}
|
|
1023
1637
|
// prettier-ignore
|
|
1024
1638
|
get() {
|
|
1025
|
-
const { Ah:
|
|
1026
|
-
return [
|
|
1639
|
+
const { Ah: _, Al: C, Bh: p, Bl: w, Ch: U, Cl: E, Dh: o, Dl: f, Eh: d, El: L, Fh: A, Fl: m, Gh: F, Gl: O, Hh: v, Hl: q } = this;
|
|
1640
|
+
return [_, C, p, w, U, E, o, f, d, L, A, m, F, O, v, q];
|
|
1027
1641
|
}
|
|
1028
1642
|
// prettier-ignore
|
|
1029
|
-
set(
|
|
1030
|
-
this.Ah =
|
|
1031
|
-
}
|
|
1032
|
-
process(
|
|
1033
|
-
for (let
|
|
1034
|
-
H[
|
|
1035
|
-
for (let
|
|
1036
|
-
const
|
|
1037
|
-
H[
|
|
1643
|
+
set(_, C, p, w, U, E, o, f, d, L, A, m, F, O, v, q) {
|
|
1644
|
+
this.Ah = _ | 0, this.Al = C | 0, this.Bh = p | 0, this.Bl = w | 0, this.Ch = U | 0, this.Cl = E | 0, this.Dh = o | 0, this.Dl = f | 0, this.Eh = d | 0, this.El = L | 0, this.Fh = A | 0, this.Fl = m | 0, this.Gh = F | 0, this.Gl = O | 0, this.Hh = v | 0, this.Hl = q | 0;
|
|
1645
|
+
}
|
|
1646
|
+
process(_, C) {
|
|
1647
|
+
for (let y = 0; y < 16; y++, C += 4)
|
|
1648
|
+
H[y] = _.getUint32(C), u[y] = _.getUint32(C += 4);
|
|
1649
|
+
for (let y = 16; y < 80; y++) {
|
|
1650
|
+
const V = H[y - 15] | 0, k = u[y - 15] | 0, M = e.rotrSH(V, k, 1) ^ e.rotrSH(V, k, 8) ^ e.shrSH(V, k, 7), z = e.rotrSL(V, k, 1) ^ e.rotrSL(V, k, 8) ^ e.shrSL(V, k, 7), P = H[y - 2] | 0, K = u[y - 2] | 0, it = e.rotrSH(P, K, 19) ^ e.rotrBH(P, K, 61) ^ e.shrSH(P, K, 6), ot = e.rotrSL(P, K, 19) ^ e.rotrBL(P, K, 61) ^ e.shrSL(P, K, 6), ct = e.add4L(z, ot, u[y - 7], u[y - 16]), at = e.add4H(ct, M, it, H[y - 7], H[y - 16]);
|
|
1651
|
+
H[y] = at | 0, u[y] = ct | 0;
|
|
1038
1652
|
}
|
|
1039
|
-
let { Ah:
|
|
1040
|
-
for (let
|
|
1041
|
-
const
|
|
1042
|
-
|
|
1043
|
-
const
|
|
1044
|
-
|
|
1653
|
+
let { Ah: p, Al: w, Bh: U, Bl: E, Ch: o, Cl: f, Dh: d, Dl: L, Eh: A, El: m, Fh: F, Fl: O, Gh: v, Gl: q, Hh: s, Hl: l } = this;
|
|
1654
|
+
for (let y = 0; y < 80; y++) {
|
|
1655
|
+
const V = e.rotrSH(A, m, 14) ^ e.rotrSH(A, m, 18) ^ e.rotrBH(A, m, 41), k = e.rotrSL(A, m, 14) ^ e.rotrSL(A, m, 18) ^ e.rotrBL(A, m, 41), M = A & F ^ ~A & v, z = m & O ^ ~m & q, P = e.add5L(l, k, z, x[y], u[y]), K = e.add5H(P, s, V, M, b[y], H[y]), it = P | 0, ot = e.rotrSH(p, w, 28) ^ e.rotrBH(p, w, 34) ^ e.rotrBH(p, w, 39), ct = e.rotrSL(p, w, 28) ^ e.rotrBL(p, w, 34) ^ e.rotrBL(p, w, 39), at = p & U ^ p & o ^ U & o, Dt = w & E ^ w & f ^ E & f;
|
|
1656
|
+
s = v | 0, l = q | 0, v = F | 0, q = O | 0, F = A | 0, O = m | 0, { h: A, l: m } = e.add(d | 0, L | 0, K | 0, it | 0), d = o | 0, L = f | 0, o = U | 0, f = E | 0, U = p | 0, E = w | 0;
|
|
1657
|
+
const At = e.add3L(it, ct, Dt);
|
|
1658
|
+
p = e.add3H(At, K, ot, at), w = At | 0;
|
|
1045
1659
|
}
|
|
1046
|
-
({ h:
|
|
1660
|
+
({ h: p, l: w } = e.add(this.Ah | 0, this.Al | 0, p | 0, w | 0)), { h: U, l: E } = e.add(this.Bh | 0, this.Bl | 0, U | 0, E | 0), { h: o, l: f } = e.add(this.Ch | 0, this.Cl | 0, o | 0, f | 0), { h: d, l: L } = e.add(this.Dh | 0, this.Dl | 0, d | 0, L | 0), { h: A, l: m } = e.add(this.Eh | 0, this.El | 0, A | 0, m | 0), { h: F, l: O } = e.add(this.Fh | 0, this.Fl | 0, F | 0, O | 0), { h: v, l: q } = e.add(this.Gh | 0, this.Gl | 0, v | 0, q | 0), { h: s, l } = e.add(this.Hh | 0, this.Hl | 0, s | 0, l | 0), this.set(p, w, U, E, o, f, d, L, A, m, F, O, v, q, s, l);
|
|
1047
1661
|
}
|
|
1048
1662
|
roundClean() {
|
|
1049
|
-
(0,
|
|
1663
|
+
(0, n.clean)(H, u);
|
|
1050
1664
|
}
|
|
1051
1665
|
destroy() {
|
|
1052
|
-
(0,
|
|
1666
|
+
(0, n.clean)(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
|
|
1053
1667
|
}
|
|
1054
1668
|
}
|
|
1055
|
-
|
|
1056
|
-
class
|
|
1669
|
+
N.SHA512 = S;
|
|
1670
|
+
class B extends S {
|
|
1057
1671
|
constructor() {
|
|
1058
1672
|
super(48), this.Ah = t.SHA384_IV[0] | 0, this.Al = t.SHA384_IV[1] | 0, this.Bh = t.SHA384_IV[2] | 0, this.Bl = t.SHA384_IV[3] | 0, this.Ch = t.SHA384_IV[4] | 0, this.Cl = t.SHA384_IV[5] | 0, this.Dh = t.SHA384_IV[6] | 0, this.Dl = t.SHA384_IV[7] | 0, this.Eh = t.SHA384_IV[8] | 0, this.El = t.SHA384_IV[9] | 0, this.Fh = t.SHA384_IV[10] | 0, this.Fl = t.SHA384_IV[11] | 0, this.Gh = t.SHA384_IV[12] | 0, this.Gl = t.SHA384_IV[13] | 0, this.Hh = t.SHA384_IV[14] | 0, this.Hl = t.SHA384_IV[15] | 0;
|
|
1059
1673
|
}
|
|
1060
1674
|
}
|
|
1061
|
-
|
|
1062
|
-
const
|
|
1675
|
+
N.SHA384 = B;
|
|
1676
|
+
const g = /* @__PURE__ */ Uint32Array.from([
|
|
1063
1677
|
2352822216,
|
|
1064
1678
|
424955298,
|
|
1065
1679
|
1944164710,
|
|
@@ -1094,54 +1708,54 @@ function ce() {
|
|
|
1094
1708
|
246885852,
|
|
1095
1709
|
2177182882
|
|
1096
1710
|
]);
|
|
1097
|
-
class
|
|
1711
|
+
class D extends S {
|
|
1098
1712
|
constructor() {
|
|
1099
|
-
super(28), this.Ah =
|
|
1713
|
+
super(28), this.Ah = g[0] | 0, this.Al = g[1] | 0, this.Bh = g[2] | 0, this.Bl = g[3] | 0, this.Ch = g[4] | 0, this.Cl = g[5] | 0, this.Dh = g[6] | 0, this.Dl = g[7] | 0, this.Eh = g[8] | 0, this.El = g[9] | 0, this.Fh = g[10] | 0, this.Fl = g[11] | 0, this.Gh = g[12] | 0, this.Gl = g[13] | 0, this.Hh = g[14] | 0, this.Hl = g[15] | 0;
|
|
1100
1714
|
}
|
|
1101
1715
|
}
|
|
1102
|
-
|
|
1103
|
-
class R extends
|
|
1716
|
+
N.SHA512_224 = D;
|
|
1717
|
+
class R extends S {
|
|
1104
1718
|
constructor() {
|
|
1105
1719
|
super(32), this.Ah = I[0] | 0, this.Al = I[1] | 0, this.Bh = I[2] | 0, this.Bl = I[3] | 0, this.Ch = I[4] | 0, this.Cl = I[5] | 0, this.Dh = I[6] | 0, this.Dl = I[7] | 0, this.Eh = I[8] | 0, this.El = I[9] | 0, this.Fh = I[10] | 0, this.Fl = I[11] | 0, this.Gh = I[12] | 0, this.Gl = I[13] | 0, this.Hh = I[14] | 0, this.Hl = I[15] | 0;
|
|
1106
1720
|
}
|
|
1107
1721
|
}
|
|
1108
|
-
return
|
|
1722
|
+
return N.SHA512_256 = R, N.sha256 = (0, n.createHasher)(() => new i()), N.sha224 = (0, n.createHasher)(() => new r()), N.sha512 = (0, n.createHasher)(() => new S()), N.sha384 = (0, n.createHasher)(() => new B()), N.sha512_256 = (0, n.createHasher)(() => new R()), N.sha512_224 = (0, n.createHasher)(() => new D()), N;
|
|
1109
1723
|
}
|
|
1110
|
-
var
|
|
1111
|
-
function
|
|
1112
|
-
return
|
|
1724
|
+
var Zt = {}, Se;
|
|
1725
|
+
function Ps() {
|
|
1726
|
+
return Se || (Se = 1, (function(t) {
|
|
1113
1727
|
Object.defineProperty(t, "__esModule", { value: !0 }), t.hmac = t.HMAC = void 0;
|
|
1114
|
-
const e = /* @__PURE__ */
|
|
1115
|
-
class
|
|
1116
|
-
constructor(
|
|
1117
|
-
super(), this.finished = !1, this.destroyed = !1, (0, e.ahash)(
|
|
1118
|
-
const
|
|
1119
|
-
if (this.iHash =
|
|
1728
|
+
const e = /* @__PURE__ */ ie();
|
|
1729
|
+
class n extends e.Hash {
|
|
1730
|
+
constructor(i, r) {
|
|
1731
|
+
super(), this.finished = !1, this.destroyed = !1, (0, e.ahash)(i);
|
|
1732
|
+
const a = (0, e.toBytes)(r);
|
|
1733
|
+
if (this.iHash = i.create(), typeof this.iHash.update != "function")
|
|
1120
1734
|
throw new Error("Expected instance of class which extends utils.Hash");
|
|
1121
1735
|
this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
|
|
1122
1736
|
const b = this.blockLen, x = new Uint8Array(b);
|
|
1123
|
-
x.set(
|
|
1737
|
+
x.set(a.length > b ? i.create().update(a).digest() : a);
|
|
1124
1738
|
for (let H = 0; H < x.length; H++)
|
|
1125
1739
|
x[H] ^= 54;
|
|
1126
|
-
this.iHash.update(x), this.oHash =
|
|
1740
|
+
this.iHash.update(x), this.oHash = i.create();
|
|
1127
1741
|
for (let H = 0; H < x.length; H++)
|
|
1128
1742
|
x[H] ^= 106;
|
|
1129
1743
|
this.oHash.update(x), (0, e.clean)(x);
|
|
1130
1744
|
}
|
|
1131
|
-
update(
|
|
1132
|
-
return (0, e.aexists)(this), this.iHash.update(
|
|
1745
|
+
update(i) {
|
|
1746
|
+
return (0, e.aexists)(this), this.iHash.update(i), this;
|
|
1133
1747
|
}
|
|
1134
|
-
digestInto(
|
|
1135
|
-
(0, e.aexists)(this), (0, e.abytes)(
|
|
1748
|
+
digestInto(i) {
|
|
1749
|
+
(0, e.aexists)(this), (0, e.abytes)(i, this.outputLen), this.finished = !0, this.iHash.digestInto(i), this.oHash.update(i), this.oHash.digestInto(i), this.destroy();
|
|
1136
1750
|
}
|
|
1137
1751
|
digest() {
|
|
1138
|
-
const
|
|
1139
|
-
return this.digestInto(
|
|
1752
|
+
const i = new Uint8Array(this.oHash.outputLen);
|
|
1753
|
+
return this.digestInto(i), i;
|
|
1140
1754
|
}
|
|
1141
|
-
_cloneInto(
|
|
1142
|
-
|
|
1143
|
-
const { oHash:
|
|
1144
|
-
return
|
|
1755
|
+
_cloneInto(i) {
|
|
1756
|
+
i || (i = Object.create(Object.getPrototypeOf(this), {}));
|
|
1757
|
+
const { oHash: r, iHash: a, finished: b, destroyed: x, blockLen: H, outputLen: u } = this;
|
|
1758
|
+
return i = i, i.finished = b, i.destroyed = x, i.blockLen = H, i.outputLen = u, i.oHash = r._cloneInto(i.oHash), i.iHash = a._cloneInto(i.iHash), i;
|
|
1145
1759
|
}
|
|
1146
1760
|
clone() {
|
|
1147
1761
|
return this._cloneInto();
|
|
@@ -1150,524 +1764,1668 @@ function Pe() {
|
|
|
1150
1764
|
this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
|
|
1151
1765
|
}
|
|
1152
1766
|
}
|
|
1153
|
-
t.HMAC =
|
|
1154
|
-
const
|
|
1155
|
-
t.hmac =
|
|
1156
|
-
})(
|
|
1157
|
-
}
|
|
1158
|
-
|
|
1159
|
-
|
|
1160
|
-
|
|
1161
|
-
|
|
1162
|
-
|
|
1163
|
-
|
|
1164
|
-
|
|
1165
|
-
|
|
1166
|
-
|
|
1167
|
-
|
|
1168
|
-
|
|
1169
|
-
|
|
1170
|
-
|
|
1171
|
-
|
|
1767
|
+
t.HMAC = n;
|
|
1768
|
+
const h = (c, i, r) => new n(c, i).update(r).digest();
|
|
1769
|
+
t.hmac = h, t.hmac.create = (c, i) => new n(c, i);
|
|
1770
|
+
})(Zt)), Zt;
|
|
1771
|
+
}
|
|
1772
|
+
class ce {
|
|
1773
|
+
oHash;
|
|
1774
|
+
iHash;
|
|
1775
|
+
blockLen;
|
|
1776
|
+
outputLen;
|
|
1777
|
+
finished = !1;
|
|
1778
|
+
destroyed = !1;
|
|
1779
|
+
constructor(e, n) {
|
|
1780
|
+
if (We(e), Ht(n, void 0, "key"), this.iHash = e.create(), typeof this.iHash.update != "function")
|
|
1781
|
+
throw new Error("Expected instance of class which extends utils.Hash");
|
|
1782
|
+
this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
|
|
1783
|
+
const h = this.blockLen, c = new Uint8Array(h);
|
|
1784
|
+
c.set(n.length > h ? e.create().update(n).digest() : n);
|
|
1785
|
+
for (let i = 0; i < c.length; i++)
|
|
1786
|
+
c[i] ^= 54;
|
|
1787
|
+
this.iHash.update(c), this.oHash = e.create();
|
|
1788
|
+
for (let i = 0; i < c.length; i++)
|
|
1789
|
+
c[i] ^= 106;
|
|
1790
|
+
this.oHash.update(c), rt(c);
|
|
1791
|
+
}
|
|
1792
|
+
update(e) {
|
|
1793
|
+
return kt(this), this.iHash.update(e), this;
|
|
1794
|
+
}
|
|
1795
|
+
digestInto(e) {
|
|
1796
|
+
kt(this), Ht(e, this.outputLen, "output"), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy();
|
|
1797
|
+
}
|
|
1798
|
+
digest() {
|
|
1799
|
+
const e = new Uint8Array(this.oHash.outputLen);
|
|
1800
|
+
return this.digestInto(e), e;
|
|
1801
|
+
}
|
|
1802
|
+
_cloneInto(e) {
|
|
1803
|
+
e ||= Object.create(Object.getPrototypeOf(this), {});
|
|
1804
|
+
const { oHash: n, iHash: h, finished: c, destroyed: i, blockLen: r, outputLen: a } = this;
|
|
1805
|
+
return e = e, e.finished = c, e.destroyed = i, e.blockLen = r, e.outputLen = a, e.oHash = n._cloneInto(e.oHash), e.iHash = h._cloneInto(e.iHash), e;
|
|
1806
|
+
}
|
|
1807
|
+
clone() {
|
|
1808
|
+
return this._cloneInto();
|
|
1809
|
+
}
|
|
1810
|
+
destroy() {
|
|
1811
|
+
this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
|
|
1812
|
+
}
|
|
1813
|
+
}
|
|
1814
|
+
const oe = (t, e, n) => new ce(t, e).update(n).digest();
|
|
1815
|
+
oe.create = (t, e) => new ce(t, e);
|
|
1816
|
+
const As = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
1817
|
+
__proto__: null,
|
|
1818
|
+
_HMAC: ce,
|
|
1819
|
+
hmac: oe
|
|
1820
|
+
}, Symbol.toStringTag, { value: "Module" })), Ks = /* @__PURE__ */ ne(As), Ns = /* @__PURE__ */ ne(N0), Xs = /* @__PURE__ */ ne(ls);
|
|
1821
|
+
var ht = {}, X = {}, st = {}, $t = {}, Tt = {}, we;
|
|
1822
|
+
function ys() {
|
|
1823
|
+
return we || (we = 1, Object.defineProperty(Tt, "__esModule", { value: !0 }), Tt.crypto = void 0, Tt.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), Tt;
|
|
1824
|
+
}
|
|
1825
|
+
var Ie;
|
|
1826
|
+
function a0() {
|
|
1827
|
+
return Ie || (Ie = 1, (function(t) {
|
|
1828
|
+
Object.defineProperty(t, "__esModule", { value: !0 }), t.wrapXOFConstructorWithOpts = t.wrapConstructorWithOpts = t.wrapConstructor = t.Hash = t.nextTick = t.swap32IfBE = t.byteSwapIfBE = t.swap8IfBE = t.isLE = void 0, t.isBytes = n, t.anumber = h, t.abytes = c, t.ahash = i, t.aexists = r, t.aoutput = a, t.u8 = b, t.u32 = x, t.clean = H, t.createView = u, t.rotr = S, t.rotl = B, t.byteSwap = g, t.byteSwap32 = I, t.bytesToHex = T, t.hexToBytes = p, t.asyncLoop = U, t.utf8ToBytes = E, t.bytesToUtf8 = o, t.toBytes = f, t.kdfInputToBytes = d, t.concatBytes = L, t.checkOpts = A, t.createHasher = F, t.createOptHasher = O, t.createXOFer = v, t.randomBytes = q;
|
|
1829
|
+
const e = /* @__PURE__ */ ys();
|
|
1830
|
+
function n(s) {
|
|
1831
|
+
return s instanceof Uint8Array || ArrayBuffer.isView(s) && s.constructor.name === "Uint8Array";
|
|
1832
|
+
}
|
|
1833
|
+
function h(s) {
|
|
1834
|
+
if (!Number.isSafeInteger(s) || s < 0)
|
|
1835
|
+
throw new Error("positive integer expected, got " + s);
|
|
1836
|
+
}
|
|
1837
|
+
function c(s, ...l) {
|
|
1838
|
+
if (!n(s))
|
|
1839
|
+
throw new Error("Uint8Array expected");
|
|
1840
|
+
if (l.length > 0 && !l.includes(s.length))
|
|
1841
|
+
throw new Error("Uint8Array expected of length " + l + ", got length=" + s.length);
|
|
1172
1842
|
}
|
|
1173
|
-
|
|
1174
|
-
|
|
1175
|
-
|
|
1176
|
-
|
|
1177
|
-
set(a, d, f, p, l) {
|
|
1178
|
-
this.A = a | 0, this.B = d | 0, this.C = f | 0, this.D = p | 0, this.E = l | 0;
|
|
1179
|
-
}
|
|
1180
|
-
process(a, d) {
|
|
1181
|
-
for (let k = 0; k < 16; k++, d += 4)
|
|
1182
|
-
i[k] = a.getUint32(d, !1);
|
|
1183
|
-
for (let k = 16; k < 80; k++)
|
|
1184
|
-
i[k] = (0, e.rotl)(i[k - 3] ^ i[k - 8] ^ i[k - 14] ^ i[k - 16], 1);
|
|
1185
|
-
let { A: f, B: p, C: l, D: S, E: U } = this;
|
|
1186
|
-
for (let k = 0; k < 80; k++) {
|
|
1187
|
-
let F, v;
|
|
1188
|
-
k < 20 ? (F = (0, t.Chi)(p, l, S), v = 1518500249) : k < 40 ? (F = p ^ l ^ S, v = 1859775393) : k < 60 ? (F = (0, t.Maj)(p, l, S), v = 2400959708) : (F = p ^ l ^ S, v = 3395469782);
|
|
1189
|
-
const c = (0, e.rotl)(f, 5) + F + U + v + i[k] | 0;
|
|
1190
|
-
U = S, S = l, l = (0, e.rotl)(p, 30), p = f, f = c;
|
|
1191
|
-
}
|
|
1192
|
-
f = f + this.A | 0, p = p + this.B | 0, l = l + this.C | 0, S = S + this.D | 0, U = U + this.E | 0, this.set(f, p, l, S, U);
|
|
1843
|
+
function i(s) {
|
|
1844
|
+
if (typeof s != "function" || typeof s.create != "function")
|
|
1845
|
+
throw new Error("Hash should be wrapped by utils.createHasher");
|
|
1846
|
+
h(s.outputLen), h(s.blockLen);
|
|
1193
1847
|
}
|
|
1194
|
-
|
|
1195
|
-
(
|
|
1848
|
+
function r(s, l = !0) {
|
|
1849
|
+
if (s.destroyed)
|
|
1850
|
+
throw new Error("Hash instance has been destroyed");
|
|
1851
|
+
if (l && s.finished)
|
|
1852
|
+
throw new Error("Hash#digest() has already been called");
|
|
1196
1853
|
}
|
|
1197
|
-
|
|
1198
|
-
|
|
1854
|
+
function a(s, l) {
|
|
1855
|
+
c(s);
|
|
1856
|
+
const y = l.outputLen;
|
|
1857
|
+
if (s.length < y)
|
|
1858
|
+
throw new Error("digestInto() expects output buffer of length at least " + y);
|
|
1199
1859
|
}
|
|
1200
|
-
|
|
1201
|
-
|
|
1202
|
-
|
|
1203
|
-
|
|
1860
|
+
function b(s) {
|
|
1861
|
+
return new Uint8Array(s.buffer, s.byteOffset, s.byteLength);
|
|
1862
|
+
}
|
|
1863
|
+
function x(s) {
|
|
1864
|
+
return new Uint32Array(s.buffer, s.byteOffset, Math.floor(s.byteLength / 4));
|
|
1865
|
+
}
|
|
1866
|
+
function H(...s) {
|
|
1867
|
+
for (let l = 0; l < s.length; l++)
|
|
1868
|
+
s[l].fill(0);
|
|
1869
|
+
}
|
|
1870
|
+
function u(s) {
|
|
1871
|
+
return new DataView(s.buffer, s.byteOffset, s.byteLength);
|
|
1872
|
+
}
|
|
1873
|
+
function S(s, l) {
|
|
1874
|
+
return s << 32 - l | s >>> l;
|
|
1875
|
+
}
|
|
1876
|
+
function B(s, l) {
|
|
1877
|
+
return s << l | s >>> 32 - l >>> 0;
|
|
1878
|
+
}
|
|
1879
|
+
t.isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
1880
|
+
function g(s) {
|
|
1881
|
+
return s << 24 & 4278190080 | s << 8 & 16711680 | s >>> 8 & 65280 | s >>> 24 & 255;
|
|
1882
|
+
}
|
|
1883
|
+
t.swap8IfBE = t.isLE ? (s) => s : (s) => g(s), t.byteSwapIfBE = t.swap8IfBE;
|
|
1884
|
+
function I(s) {
|
|
1885
|
+
for (let l = 0; l < s.length; l++)
|
|
1886
|
+
s[l] = g(s[l]);
|
|
1887
|
+
return s;
|
|
1888
|
+
}
|
|
1889
|
+
t.swap32IfBE = t.isLE ? (s) => s : I;
|
|
1890
|
+
const D = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", R = /* @__PURE__ */ Array.from({ length: 256 }, (s, l) => l.toString(16).padStart(2, "0"));
|
|
1891
|
+
function T(s) {
|
|
1892
|
+
if (c(s), D)
|
|
1893
|
+
return s.toHex();
|
|
1894
|
+
let l = "";
|
|
1895
|
+
for (let y = 0; y < s.length; y++)
|
|
1896
|
+
l += R[s[y]];
|
|
1897
|
+
return l;
|
|
1898
|
+
}
|
|
1899
|
+
const _ = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
1900
|
+
function C(s) {
|
|
1901
|
+
if (s >= _._0 && s <= _._9)
|
|
1902
|
+
return s - _._0;
|
|
1903
|
+
if (s >= _.A && s <= _.F)
|
|
1904
|
+
return s - (_.A - 10);
|
|
1905
|
+
if (s >= _.a && s <= _.f)
|
|
1906
|
+
return s - (_.a - 10);
|
|
1907
|
+
}
|
|
1908
|
+
function p(s) {
|
|
1909
|
+
if (typeof s != "string")
|
|
1910
|
+
throw new Error("hex string expected, got " + typeof s);
|
|
1911
|
+
if (D)
|
|
1912
|
+
return Uint8Array.fromHex(s);
|
|
1913
|
+
const l = s.length, y = l / 2;
|
|
1914
|
+
if (l % 2)
|
|
1915
|
+
throw new Error("hex string expected, got unpadded hex of length " + l);
|
|
1916
|
+
const V = new Uint8Array(y);
|
|
1917
|
+
for (let k = 0, M = 0; k < y; k++, M += 2) {
|
|
1918
|
+
const z = C(s.charCodeAt(M)), P = C(s.charCodeAt(M + 1));
|
|
1919
|
+
if (z === void 0 || P === void 0) {
|
|
1920
|
+
const K = s[M] + s[M + 1];
|
|
1921
|
+
throw new Error('hex string expected, got non-hex character "' + K + '" at index ' + M);
|
|
1922
|
+
}
|
|
1923
|
+
V[k] = z * 16 + P;
|
|
1924
|
+
}
|
|
1925
|
+
return V;
|
|
1926
|
+
}
|
|
1927
|
+
const w = async () => {
|
|
1928
|
+
};
|
|
1929
|
+
t.nextTick = w;
|
|
1930
|
+
async function U(s, l, y) {
|
|
1931
|
+
let V = Date.now();
|
|
1932
|
+
for (let k = 0; k < s; k++) {
|
|
1933
|
+
y(k);
|
|
1934
|
+
const M = Date.now() - V;
|
|
1935
|
+
M >= 0 && M < l || (await (0, t.nextTick)(), V += M);
|
|
1936
|
+
}
|
|
1937
|
+
}
|
|
1938
|
+
function E(s) {
|
|
1939
|
+
if (typeof s != "string")
|
|
1940
|
+
throw new Error("string expected");
|
|
1941
|
+
return new Uint8Array(new TextEncoder().encode(s));
|
|
1942
|
+
}
|
|
1943
|
+
function o(s) {
|
|
1944
|
+
return new TextDecoder().decode(s);
|
|
1945
|
+
}
|
|
1946
|
+
function f(s) {
|
|
1947
|
+
return typeof s == "string" && (s = E(s)), c(s), s;
|
|
1948
|
+
}
|
|
1949
|
+
function d(s) {
|
|
1950
|
+
return typeof s == "string" && (s = E(s)), c(s), s;
|
|
1951
|
+
}
|
|
1952
|
+
function L(...s) {
|
|
1953
|
+
let l = 0;
|
|
1954
|
+
for (let V = 0; V < s.length; V++) {
|
|
1955
|
+
const k = s[V];
|
|
1956
|
+
c(k), l += k.length;
|
|
1957
|
+
}
|
|
1958
|
+
const y = new Uint8Array(l);
|
|
1959
|
+
for (let V = 0, k = 0; V < s.length; V++) {
|
|
1960
|
+
const M = s[V];
|
|
1961
|
+
y.set(M, k), k += M.length;
|
|
1962
|
+
}
|
|
1963
|
+
return y;
|
|
1964
|
+
}
|
|
1965
|
+
function A(s, l) {
|
|
1966
|
+
if (l !== void 0 && {}.toString.call(l) !== "[object Object]")
|
|
1967
|
+
throw new Error("options should be object or undefined");
|
|
1968
|
+
return Object.assign(s, l);
|
|
1969
|
+
}
|
|
1970
|
+
class m {
|
|
1971
|
+
}
|
|
1972
|
+
t.Hash = m;
|
|
1973
|
+
function F(s) {
|
|
1974
|
+
const l = (V) => s().update(f(V)).digest(), y = s();
|
|
1975
|
+
return l.outputLen = y.outputLen, l.blockLen = y.blockLen, l.create = () => s(), l;
|
|
1976
|
+
}
|
|
1977
|
+
function O(s) {
|
|
1978
|
+
const l = (V, k) => s(k).update(f(V)).digest(), y = s({});
|
|
1979
|
+
return l.outputLen = y.outputLen, l.blockLen = y.blockLen, l.create = (V) => s(V), l;
|
|
1980
|
+
}
|
|
1981
|
+
function v(s) {
|
|
1982
|
+
const l = (V, k) => s(k).update(f(V)).digest(), y = s({});
|
|
1983
|
+
return l.outputLen = y.outputLen, l.blockLen = y.blockLen, l.create = (V) => s(V), l;
|
|
1984
|
+
}
|
|
1985
|
+
t.wrapConstructor = F, t.wrapConstructorWithOpts = O, t.wrapXOFConstructorWithOpts = v;
|
|
1986
|
+
function q(s = 32) {
|
|
1987
|
+
if (e.crypto && typeof e.crypto.getRandomValues == "function")
|
|
1988
|
+
return e.crypto.getRandomValues(new Uint8Array(s));
|
|
1989
|
+
if (e.crypto && typeof e.crypto.randomBytes == "function")
|
|
1990
|
+
return Uint8Array.from(e.crypto.randomBytes(s));
|
|
1991
|
+
throw new Error("crypto.getRandomValues must be defined");
|
|
1992
|
+
}
|
|
1993
|
+
})($t)), $t;
|
|
1994
|
+
}
|
|
1995
|
+
var Be;
|
|
1996
|
+
function ps() {
|
|
1997
|
+
if (Be) return st;
|
|
1998
|
+
Be = 1, Object.defineProperty(st, "__esModule", { value: !0 }), st.SHA512_IV = st.SHA384_IV = st.SHA224_IV = st.SHA256_IV = st.HashMD = void 0, st.setBigUint64 = e, st.Chi = n, st.Maj = h;
|
|
1999
|
+
const t = /* @__PURE__ */ a0();
|
|
2000
|
+
function e(i, r, a, b) {
|
|
2001
|
+
if (typeof i.setBigUint64 == "function")
|
|
2002
|
+
return i.setBigUint64(r, a, b);
|
|
2003
|
+
const x = BigInt(32), H = BigInt(4294967295), u = Number(a >> x & H), S = Number(a & H), B = b ? 4 : 0, g = b ? 0 : 4;
|
|
2004
|
+
i.setUint32(r + B, u, b), i.setUint32(r + g, S, b);
|
|
2005
|
+
}
|
|
2006
|
+
function n(i, r, a) {
|
|
2007
|
+
return i & r ^ ~i & a;
|
|
2008
|
+
}
|
|
2009
|
+
function h(i, r, a) {
|
|
2010
|
+
return i & r ^ i & a ^ r & a;
|
|
2011
|
+
}
|
|
2012
|
+
class c extends t.Hash {
|
|
2013
|
+
constructor(r, a, b, x) {
|
|
2014
|
+
super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = r, this.outputLen = a, this.padOffset = b, this.isLE = x, this.buffer = new Uint8Array(r), this.view = (0, t.createView)(this.buffer);
|
|
2015
|
+
}
|
|
2016
|
+
update(r) {
|
|
2017
|
+
(0, t.aexists)(this), r = (0, t.toBytes)(r), (0, t.abytes)(r);
|
|
2018
|
+
const { view: a, buffer: b, blockLen: x } = this, H = r.length;
|
|
2019
|
+
for (let u = 0; u < H; ) {
|
|
2020
|
+
const S = Math.min(x - this.pos, H - u);
|
|
2021
|
+
if (S === x) {
|
|
2022
|
+
const B = (0, t.createView)(r);
|
|
2023
|
+
for (; x <= H - u; u += x)
|
|
2024
|
+
this.process(B, u);
|
|
2025
|
+
continue;
|
|
2026
|
+
}
|
|
2027
|
+
b.set(r.subarray(u, u + S), this.pos), this.pos += S, u += S, this.pos === x && (this.process(a, 0), this.pos = 0);
|
|
2028
|
+
}
|
|
2029
|
+
return this.length += r.length, this.roundClean(), this;
|
|
2030
|
+
}
|
|
2031
|
+
digestInto(r) {
|
|
2032
|
+
(0, t.aexists)(this), (0, t.aoutput)(r, this), this.finished = !0;
|
|
2033
|
+
const { buffer: a, view: b, blockLen: x, isLE: H } = this;
|
|
2034
|
+
let { pos: u } = this;
|
|
2035
|
+
a[u++] = 128, (0, t.clean)(this.buffer.subarray(u)), this.padOffset > x - u && (this.process(b, 0), u = 0);
|
|
2036
|
+
for (let D = u; D < x; D++)
|
|
2037
|
+
a[D] = 0;
|
|
2038
|
+
e(b, x - 8, BigInt(this.length * 8), H), this.process(b, 0);
|
|
2039
|
+
const S = (0, t.createView)(r), B = this.outputLen;
|
|
2040
|
+
if (B % 4)
|
|
2041
|
+
throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
2042
|
+
const g = B / 4, I = this.get();
|
|
2043
|
+
if (g > I.length)
|
|
2044
|
+
throw new Error("_sha2: outputLen bigger than state");
|
|
2045
|
+
for (let D = 0; D < g; D++)
|
|
2046
|
+
S.setUint32(4 * D, I[D], H);
|
|
2047
|
+
}
|
|
2048
|
+
digest() {
|
|
2049
|
+
const { buffer: r, outputLen: a } = this;
|
|
2050
|
+
this.digestInto(r);
|
|
2051
|
+
const b = r.slice(0, a);
|
|
2052
|
+
return this.destroy(), b;
|
|
2053
|
+
}
|
|
2054
|
+
_cloneInto(r) {
|
|
2055
|
+
r || (r = new this.constructor()), r.set(...this.get());
|
|
2056
|
+
const { blockLen: a, buffer: b, length: x, finished: H, destroyed: u, pos: S } = this;
|
|
2057
|
+
return r.destroyed = u, r.finished = H, r.length = x, r.pos = S, x % a && r.buffer.set(b), r;
|
|
2058
|
+
}
|
|
2059
|
+
clone() {
|
|
2060
|
+
return this._cloneInto();
|
|
2061
|
+
}
|
|
2062
|
+
}
|
|
2063
|
+
return st.HashMD = c, st.SHA256_IV = Uint32Array.from([
|
|
2064
|
+
1779033703,
|
|
2065
|
+
3144134277,
|
|
2066
|
+
1013904242,
|
|
2067
|
+
2773480762,
|
|
2068
|
+
1359893119,
|
|
2069
|
+
2600822924,
|
|
2070
|
+
528734635,
|
|
2071
|
+
1541459225
|
|
2072
|
+
]), st.SHA224_IV = Uint32Array.from([
|
|
2073
|
+
3238371032,
|
|
2074
|
+
914150663,
|
|
2075
|
+
812702999,
|
|
2076
|
+
4144912697,
|
|
2077
|
+
4290775857,
|
|
2078
|
+
1750603025,
|
|
2079
|
+
1694076839,
|
|
2080
|
+
3204075428
|
|
2081
|
+
]), st.SHA384_IV = Uint32Array.from([
|
|
2082
|
+
3418070365,
|
|
2083
|
+
3238371032,
|
|
2084
|
+
1654270250,
|
|
2085
|
+
914150663,
|
|
2086
|
+
2438529370,
|
|
2087
|
+
812702999,
|
|
2088
|
+
355462360,
|
|
2089
|
+
4144912697,
|
|
2090
|
+
1731405415,
|
|
2091
|
+
4290775857,
|
|
2092
|
+
2394180231,
|
|
2093
|
+
1750603025,
|
|
2094
|
+
3675008525,
|
|
2095
|
+
1694076839,
|
|
2096
|
+
1203062813,
|
|
2097
|
+
3204075428
|
|
2098
|
+
]), st.SHA512_IV = Uint32Array.from([
|
|
2099
|
+
1779033703,
|
|
2100
|
+
4089235720,
|
|
2101
|
+
3144134277,
|
|
2102
|
+
2227873595,
|
|
2103
|
+
1013904242,
|
|
2104
|
+
4271175723,
|
|
2105
|
+
2773480762,
|
|
2106
|
+
1595750129,
|
|
2107
|
+
1359893119,
|
|
2108
|
+
2917565137,
|
|
2109
|
+
2600822924,
|
|
2110
|
+
725511199,
|
|
2111
|
+
528734635,
|
|
2112
|
+
4215389547,
|
|
2113
|
+
1541459225,
|
|
2114
|
+
327033209
|
|
2115
|
+
]), st;
|
|
2116
|
+
}
|
|
2117
|
+
var j = {}, Le;
|
|
2118
|
+
function _s() {
|
|
2119
|
+
if (Le) return j;
|
|
2120
|
+
Le = 1, Object.defineProperty(j, "__esModule", { value: !0 }), j.toBig = j.shrSL = j.shrSH = j.rotrSL = j.rotrSH = j.rotrBL = j.rotrBH = j.rotr32L = j.rotr32H = j.rotlSL = j.rotlSH = j.rotlBL = j.rotlBH = j.add5L = j.add5H = j.add4L = j.add4H = j.add3L = j.add3H = void 0, j.add = R, j.fromBig = n, j.split = h;
|
|
2121
|
+
const t = /* @__PURE__ */ BigInt(2 ** 32 - 1), e = /* @__PURE__ */ BigInt(32);
|
|
2122
|
+
function n(o, f = !1) {
|
|
2123
|
+
return f ? { h: Number(o & t), l: Number(o >> e & t) } : { h: Number(o >> e & t) | 0, l: Number(o & t) | 0 };
|
|
2124
|
+
}
|
|
2125
|
+
function h(o, f = !1) {
|
|
2126
|
+
const d = o.length;
|
|
2127
|
+
let L = new Uint32Array(d), A = new Uint32Array(d);
|
|
2128
|
+
for (let m = 0; m < d; m++) {
|
|
2129
|
+
const { h: F, l: O } = n(o[m], f);
|
|
2130
|
+
[L[m], A[m]] = [F, O];
|
|
2131
|
+
}
|
|
2132
|
+
return [L, A];
|
|
2133
|
+
}
|
|
2134
|
+
const c = (o, f) => BigInt(o >>> 0) << e | BigInt(f >>> 0);
|
|
2135
|
+
j.toBig = c;
|
|
2136
|
+
const i = (o, f, d) => o >>> d;
|
|
2137
|
+
j.shrSH = i;
|
|
2138
|
+
const r = (o, f, d) => o << 32 - d | f >>> d;
|
|
2139
|
+
j.shrSL = r;
|
|
2140
|
+
const a = (o, f, d) => o >>> d | f << 32 - d;
|
|
2141
|
+
j.rotrSH = a;
|
|
2142
|
+
const b = (o, f, d) => o << 32 - d | f >>> d;
|
|
2143
|
+
j.rotrSL = b;
|
|
2144
|
+
const x = (o, f, d) => o << 64 - d | f >>> d - 32;
|
|
2145
|
+
j.rotrBH = x;
|
|
2146
|
+
const H = (o, f, d) => o >>> d - 32 | f << 64 - d;
|
|
2147
|
+
j.rotrBL = H;
|
|
2148
|
+
const u = (o, f) => f;
|
|
2149
|
+
j.rotr32H = u;
|
|
2150
|
+
const S = (o, f) => o;
|
|
2151
|
+
j.rotr32L = S;
|
|
2152
|
+
const B = (o, f, d) => o << d | f >>> 32 - d;
|
|
2153
|
+
j.rotlSH = B;
|
|
2154
|
+
const g = (o, f, d) => f << d | o >>> 32 - d;
|
|
2155
|
+
j.rotlSL = g;
|
|
2156
|
+
const I = (o, f, d) => f << d - 32 | o >>> 64 - d;
|
|
2157
|
+
j.rotlBH = I;
|
|
2158
|
+
const D = (o, f, d) => o << d - 32 | f >>> 64 - d;
|
|
2159
|
+
j.rotlBL = D;
|
|
2160
|
+
function R(o, f, d, L) {
|
|
2161
|
+
const A = (f >>> 0) + (L >>> 0);
|
|
2162
|
+
return { h: o + d + (A / 2 ** 32 | 0) | 0, l: A | 0 };
|
|
2163
|
+
}
|
|
2164
|
+
const T = (o, f, d) => (o >>> 0) + (f >>> 0) + (d >>> 0);
|
|
2165
|
+
j.add3L = T;
|
|
2166
|
+
const _ = (o, f, d, L) => f + d + L + (o / 2 ** 32 | 0) | 0;
|
|
2167
|
+
j.add3H = _;
|
|
2168
|
+
const C = (o, f, d, L) => (o >>> 0) + (f >>> 0) + (d >>> 0) + (L >>> 0);
|
|
2169
|
+
j.add4L = C;
|
|
2170
|
+
const p = (o, f, d, L, A) => f + d + L + A + (o / 2 ** 32 | 0) | 0;
|
|
2171
|
+
j.add4H = p;
|
|
2172
|
+
const w = (o, f, d, L, A) => (o >>> 0) + (f >>> 0) + (d >>> 0) + (L >>> 0) + (A >>> 0);
|
|
2173
|
+
j.add5L = w;
|
|
2174
|
+
const U = (o, f, d, L, A, m) => f + d + L + A + m + (o / 2 ** 32 | 0) | 0;
|
|
2175
|
+
j.add5H = U;
|
|
2176
|
+
const E = {
|
|
2177
|
+
fromBig: n,
|
|
2178
|
+
split: h,
|
|
2179
|
+
toBig: c,
|
|
2180
|
+
shrSH: i,
|
|
2181
|
+
shrSL: r,
|
|
2182
|
+
rotrSH: a,
|
|
2183
|
+
rotrSL: b,
|
|
2184
|
+
rotrBH: x,
|
|
2185
|
+
rotrBL: H,
|
|
2186
|
+
rotr32H: u,
|
|
2187
|
+
rotr32L: S,
|
|
2188
|
+
rotlSH: B,
|
|
2189
|
+
rotlSL: g,
|
|
2190
|
+
rotlBH: I,
|
|
2191
|
+
rotlBL: D,
|
|
2192
|
+
add: R,
|
|
2193
|
+
add3L: T,
|
|
2194
|
+
add3H: _,
|
|
2195
|
+
add4L: C,
|
|
2196
|
+
add4H: p,
|
|
2197
|
+
add5H: U,
|
|
2198
|
+
add5L: w
|
|
2199
|
+
};
|
|
2200
|
+
return j.default = E, j;
|
|
2201
|
+
}
|
|
2202
|
+
var me;
|
|
2203
|
+
function gs() {
|
|
2204
|
+
if (me) return X;
|
|
2205
|
+
me = 1, Object.defineProperty(X, "__esModule", { value: !0 }), X.sha512_224 = X.sha512_256 = X.sha384 = X.sha512 = X.sha224 = X.sha256 = X.SHA512_256 = X.SHA512_224 = X.SHA384 = X.SHA512 = X.SHA224 = X.SHA256 = void 0;
|
|
2206
|
+
const t = /* @__PURE__ */ ps(), e = /* @__PURE__ */ _s(), n = /* @__PURE__ */ a0(), h = /* @__PURE__ */ Uint32Array.from([
|
|
2207
|
+
1116352408,
|
|
2208
|
+
1899447441,
|
|
2209
|
+
3049323471,
|
|
2210
|
+
3921009573,
|
|
2211
|
+
961987163,
|
|
2212
|
+
1508970993,
|
|
2213
|
+
2453635748,
|
|
2214
|
+
2870763221,
|
|
2215
|
+
3624381080,
|
|
2216
|
+
310598401,
|
|
2217
|
+
607225278,
|
|
2218
|
+
1426881987,
|
|
2219
|
+
1925078388,
|
|
2220
|
+
2162078206,
|
|
2221
|
+
2614888103,
|
|
2222
|
+
3248222580,
|
|
2223
|
+
3835390401,
|
|
2224
|
+
4022224774,
|
|
2225
|
+
264347078,
|
|
2226
|
+
604807628,
|
|
2227
|
+
770255983,
|
|
2228
|
+
1249150122,
|
|
2229
|
+
1555081692,
|
|
2230
|
+
1996064986,
|
|
2231
|
+
2554220882,
|
|
2232
|
+
2821834349,
|
|
2233
|
+
2952996808,
|
|
2234
|
+
3210313671,
|
|
2235
|
+
3336571891,
|
|
2236
|
+
3584528711,
|
|
2237
|
+
113926993,
|
|
2238
|
+
338241895,
|
|
2239
|
+
666307205,
|
|
2240
|
+
773529912,
|
|
2241
|
+
1294757372,
|
|
2242
|
+
1396182291,
|
|
2243
|
+
1695183700,
|
|
2244
|
+
1986661051,
|
|
2245
|
+
2177026350,
|
|
2246
|
+
2456956037,
|
|
2247
|
+
2730485921,
|
|
2248
|
+
2820302411,
|
|
2249
|
+
3259730800,
|
|
2250
|
+
3345764771,
|
|
2251
|
+
3516065817,
|
|
2252
|
+
3600352804,
|
|
2253
|
+
4094571909,
|
|
2254
|
+
275423344,
|
|
2255
|
+
430227734,
|
|
2256
|
+
506948616,
|
|
2257
|
+
659060556,
|
|
2258
|
+
883997877,
|
|
2259
|
+
958139571,
|
|
2260
|
+
1322822218,
|
|
2261
|
+
1537002063,
|
|
2262
|
+
1747873779,
|
|
2263
|
+
1955562222,
|
|
2264
|
+
2024104815,
|
|
2265
|
+
2227730452,
|
|
2266
|
+
2361852424,
|
|
2267
|
+
2428436474,
|
|
2268
|
+
2756734187,
|
|
2269
|
+
3204031479,
|
|
2270
|
+
3329325298
|
|
2271
|
+
]), c = /* @__PURE__ */ new Uint32Array(64);
|
|
2272
|
+
class i extends t.HashMD {
|
|
2273
|
+
constructor(_ = 32) {
|
|
2274
|
+
super(64, _, 8, !1), this.A = t.SHA256_IV[0] | 0, this.B = t.SHA256_IV[1] | 0, this.C = t.SHA256_IV[2] | 0, this.D = t.SHA256_IV[3] | 0, this.E = t.SHA256_IV[4] | 0, this.F = t.SHA256_IV[5] | 0, this.G = t.SHA256_IV[6] | 0, this.H = t.SHA256_IV[7] | 0;
|
|
2275
|
+
}
|
|
2276
|
+
get() {
|
|
2277
|
+
const { A: _, B: C, C: p, D: w, E: U, F: E, G: o, H: f } = this;
|
|
2278
|
+
return [_, C, p, w, U, E, o, f];
|
|
2279
|
+
}
|
|
2280
|
+
// prettier-ignore
|
|
2281
|
+
set(_, C, p, w, U, E, o, f) {
|
|
2282
|
+
this.A = _ | 0, this.B = C | 0, this.C = p | 0, this.D = w | 0, this.E = U | 0, this.F = E | 0, this.G = o | 0, this.H = f | 0;
|
|
2283
|
+
}
|
|
2284
|
+
process(_, C) {
|
|
2285
|
+
for (let A = 0; A < 16; A++, C += 4)
|
|
2286
|
+
c[A] = _.getUint32(C, !1);
|
|
2287
|
+
for (let A = 16; A < 64; A++) {
|
|
2288
|
+
const m = c[A - 15], F = c[A - 2], O = (0, n.rotr)(m, 7) ^ (0, n.rotr)(m, 18) ^ m >>> 3, v = (0, n.rotr)(F, 17) ^ (0, n.rotr)(F, 19) ^ F >>> 10;
|
|
2289
|
+
c[A] = v + c[A - 7] + O + c[A - 16] | 0;
|
|
2290
|
+
}
|
|
2291
|
+
let { A: p, B: w, C: U, D: E, E: o, F: f, G: d, H: L } = this;
|
|
2292
|
+
for (let A = 0; A < 64; A++) {
|
|
2293
|
+
const m = (0, n.rotr)(o, 6) ^ (0, n.rotr)(o, 11) ^ (0, n.rotr)(o, 25), F = L + m + (0, t.Chi)(o, f, d) + h[A] + c[A] | 0, v = ((0, n.rotr)(p, 2) ^ (0, n.rotr)(p, 13) ^ (0, n.rotr)(p, 22)) + (0, t.Maj)(p, w, U) | 0;
|
|
2294
|
+
L = d, d = f, f = o, o = E + F | 0, E = U, U = w, w = p, p = F + v | 0;
|
|
2295
|
+
}
|
|
2296
|
+
p = p + this.A | 0, w = w + this.B | 0, U = U + this.C | 0, E = E + this.D | 0, o = o + this.E | 0, f = f + this.F | 0, d = d + this.G | 0, L = L + this.H | 0, this.set(p, w, U, E, o, f, d, L);
|
|
2297
|
+
}
|
|
2298
|
+
roundClean() {
|
|
2299
|
+
(0, n.clean)(c);
|
|
2300
|
+
}
|
|
2301
|
+
destroy() {
|
|
2302
|
+
this.set(0, 0, 0, 0, 0, 0, 0, 0), (0, n.clean)(this.buffer);
|
|
2303
|
+
}
|
|
2304
|
+
}
|
|
2305
|
+
X.SHA256 = i;
|
|
2306
|
+
class r extends i {
|
|
2307
|
+
constructor() {
|
|
2308
|
+
super(28), this.A = t.SHA224_IV[0] | 0, this.B = t.SHA224_IV[1] | 0, this.C = t.SHA224_IV[2] | 0, this.D = t.SHA224_IV[3] | 0, this.E = t.SHA224_IV[4] | 0, this.F = t.SHA224_IV[5] | 0, this.G = t.SHA224_IV[6] | 0, this.H = t.SHA224_IV[7] | 0;
|
|
2309
|
+
}
|
|
2310
|
+
}
|
|
2311
|
+
X.SHA224 = r;
|
|
2312
|
+
const a = e.split([
|
|
2313
|
+
"0x428a2f98d728ae22",
|
|
2314
|
+
"0x7137449123ef65cd",
|
|
2315
|
+
"0xb5c0fbcfec4d3b2f",
|
|
2316
|
+
"0xe9b5dba58189dbbc",
|
|
2317
|
+
"0x3956c25bf348b538",
|
|
2318
|
+
"0x59f111f1b605d019",
|
|
2319
|
+
"0x923f82a4af194f9b",
|
|
2320
|
+
"0xab1c5ed5da6d8118",
|
|
2321
|
+
"0xd807aa98a3030242",
|
|
2322
|
+
"0x12835b0145706fbe",
|
|
2323
|
+
"0x243185be4ee4b28c",
|
|
2324
|
+
"0x550c7dc3d5ffb4e2",
|
|
2325
|
+
"0x72be5d74f27b896f",
|
|
2326
|
+
"0x80deb1fe3b1696b1",
|
|
2327
|
+
"0x9bdc06a725c71235",
|
|
2328
|
+
"0xc19bf174cf692694",
|
|
2329
|
+
"0xe49b69c19ef14ad2",
|
|
2330
|
+
"0xefbe4786384f25e3",
|
|
2331
|
+
"0x0fc19dc68b8cd5b5",
|
|
2332
|
+
"0x240ca1cc77ac9c65",
|
|
2333
|
+
"0x2de92c6f592b0275",
|
|
2334
|
+
"0x4a7484aa6ea6e483",
|
|
2335
|
+
"0x5cb0a9dcbd41fbd4",
|
|
2336
|
+
"0x76f988da831153b5",
|
|
2337
|
+
"0x983e5152ee66dfab",
|
|
2338
|
+
"0xa831c66d2db43210",
|
|
2339
|
+
"0xb00327c898fb213f",
|
|
2340
|
+
"0xbf597fc7beef0ee4",
|
|
2341
|
+
"0xc6e00bf33da88fc2",
|
|
2342
|
+
"0xd5a79147930aa725",
|
|
2343
|
+
"0x06ca6351e003826f",
|
|
2344
|
+
"0x142929670a0e6e70",
|
|
2345
|
+
"0x27b70a8546d22ffc",
|
|
2346
|
+
"0x2e1b21385c26c926",
|
|
2347
|
+
"0x4d2c6dfc5ac42aed",
|
|
2348
|
+
"0x53380d139d95b3df",
|
|
2349
|
+
"0x650a73548baf63de",
|
|
2350
|
+
"0x766a0abb3c77b2a8",
|
|
2351
|
+
"0x81c2c92e47edaee6",
|
|
2352
|
+
"0x92722c851482353b",
|
|
2353
|
+
"0xa2bfe8a14cf10364",
|
|
2354
|
+
"0xa81a664bbc423001",
|
|
2355
|
+
"0xc24b8b70d0f89791",
|
|
2356
|
+
"0xc76c51a30654be30",
|
|
2357
|
+
"0xd192e819d6ef5218",
|
|
2358
|
+
"0xd69906245565a910",
|
|
2359
|
+
"0xf40e35855771202a",
|
|
2360
|
+
"0x106aa07032bbd1b8",
|
|
2361
|
+
"0x19a4c116b8d2d0c8",
|
|
2362
|
+
"0x1e376c085141ab53",
|
|
2363
|
+
"0x2748774cdf8eeb99",
|
|
2364
|
+
"0x34b0bcb5e19b48a8",
|
|
2365
|
+
"0x391c0cb3c5c95a63",
|
|
2366
|
+
"0x4ed8aa4ae3418acb",
|
|
2367
|
+
"0x5b9cca4f7763e373",
|
|
2368
|
+
"0x682e6ff3d6b2b8a3",
|
|
2369
|
+
"0x748f82ee5defb2fc",
|
|
2370
|
+
"0x78a5636f43172f60",
|
|
2371
|
+
"0x84c87814a1f0ab72",
|
|
2372
|
+
"0x8cc702081a6439ec",
|
|
2373
|
+
"0x90befffa23631e28",
|
|
2374
|
+
"0xa4506cebde82bde9",
|
|
2375
|
+
"0xbef9a3f7b2c67915",
|
|
2376
|
+
"0xc67178f2e372532b",
|
|
2377
|
+
"0xca273eceea26619c",
|
|
2378
|
+
"0xd186b8c721c0c207",
|
|
2379
|
+
"0xeada7dd6cde0eb1e",
|
|
2380
|
+
"0xf57d4f7fee6ed178",
|
|
2381
|
+
"0x06f067aa72176fba",
|
|
2382
|
+
"0x0a637dc5a2c898a6",
|
|
2383
|
+
"0x113f9804bef90dae",
|
|
2384
|
+
"0x1b710b35131c471b",
|
|
2385
|
+
"0x28db77f523047d84",
|
|
2386
|
+
"0x32caab7b40c72493",
|
|
2387
|
+
"0x3c9ebe0a15c9bebc",
|
|
2388
|
+
"0x431d67c49c100d4c",
|
|
2389
|
+
"0x4cc5d4becb3e42b6",
|
|
2390
|
+
"0x597f299cfc657e2a",
|
|
2391
|
+
"0x5fcb6fab3ad6faec",
|
|
2392
|
+
"0x6c44198c4a475817"
|
|
2393
|
+
].map((T) => BigInt(T))), b = a[0], x = a[1], H = /* @__PURE__ */ new Uint32Array(80), u = /* @__PURE__ */ new Uint32Array(80);
|
|
2394
|
+
class S extends t.HashMD {
|
|
2395
|
+
constructor(_ = 64) {
|
|
2396
|
+
super(128, _, 16, !1), this.Ah = t.SHA512_IV[0] | 0, this.Al = t.SHA512_IV[1] | 0, this.Bh = t.SHA512_IV[2] | 0, this.Bl = t.SHA512_IV[3] | 0, this.Ch = t.SHA512_IV[4] | 0, this.Cl = t.SHA512_IV[5] | 0, this.Dh = t.SHA512_IV[6] | 0, this.Dl = t.SHA512_IV[7] | 0, this.Eh = t.SHA512_IV[8] | 0, this.El = t.SHA512_IV[9] | 0, this.Fh = t.SHA512_IV[10] | 0, this.Fl = t.SHA512_IV[11] | 0, this.Gh = t.SHA512_IV[12] | 0, this.Gl = t.SHA512_IV[13] | 0, this.Hh = t.SHA512_IV[14] | 0, this.Hl = t.SHA512_IV[15] | 0;
|
|
2397
|
+
}
|
|
2398
|
+
// prettier-ignore
|
|
2399
|
+
get() {
|
|
2400
|
+
const { Ah: _, Al: C, Bh: p, Bl: w, Ch: U, Cl: E, Dh: o, Dl: f, Eh: d, El: L, Fh: A, Fl: m, Gh: F, Gl: O, Hh: v, Hl: q } = this;
|
|
2401
|
+
return [_, C, p, w, U, E, o, f, d, L, A, m, F, O, v, q];
|
|
2402
|
+
}
|
|
2403
|
+
// prettier-ignore
|
|
2404
|
+
set(_, C, p, w, U, E, o, f, d, L, A, m, F, O, v, q) {
|
|
2405
|
+
this.Ah = _ | 0, this.Al = C | 0, this.Bh = p | 0, this.Bl = w | 0, this.Ch = U | 0, this.Cl = E | 0, this.Dh = o | 0, this.Dl = f | 0, this.Eh = d | 0, this.El = L | 0, this.Fh = A | 0, this.Fl = m | 0, this.Gh = F | 0, this.Gl = O | 0, this.Hh = v | 0, this.Hl = q | 0;
|
|
2406
|
+
}
|
|
2407
|
+
process(_, C) {
|
|
2408
|
+
for (let y = 0; y < 16; y++, C += 4)
|
|
2409
|
+
H[y] = _.getUint32(C), u[y] = _.getUint32(C += 4);
|
|
2410
|
+
for (let y = 16; y < 80; y++) {
|
|
2411
|
+
const V = H[y - 15] | 0, k = u[y - 15] | 0, M = e.rotrSH(V, k, 1) ^ e.rotrSH(V, k, 8) ^ e.shrSH(V, k, 7), z = e.rotrSL(V, k, 1) ^ e.rotrSL(V, k, 8) ^ e.shrSL(V, k, 7), P = H[y - 2] | 0, K = u[y - 2] | 0, it = e.rotrSH(P, K, 19) ^ e.rotrBH(P, K, 61) ^ e.shrSH(P, K, 6), ot = e.rotrSL(P, K, 19) ^ e.rotrBL(P, K, 61) ^ e.shrSL(P, K, 6), ct = e.add4L(z, ot, u[y - 7], u[y - 16]), at = e.add4H(ct, M, it, H[y - 7], H[y - 16]);
|
|
2412
|
+
H[y] = at | 0, u[y] = ct | 0;
|
|
2413
|
+
}
|
|
2414
|
+
let { Ah: p, Al: w, Bh: U, Bl: E, Ch: o, Cl: f, Dh: d, Dl: L, Eh: A, El: m, Fh: F, Fl: O, Gh: v, Gl: q, Hh: s, Hl: l } = this;
|
|
2415
|
+
for (let y = 0; y < 80; y++) {
|
|
2416
|
+
const V = e.rotrSH(A, m, 14) ^ e.rotrSH(A, m, 18) ^ e.rotrBH(A, m, 41), k = e.rotrSL(A, m, 14) ^ e.rotrSL(A, m, 18) ^ e.rotrBL(A, m, 41), M = A & F ^ ~A & v, z = m & O ^ ~m & q, P = e.add5L(l, k, z, x[y], u[y]), K = e.add5H(P, s, V, M, b[y], H[y]), it = P | 0, ot = e.rotrSH(p, w, 28) ^ e.rotrBH(p, w, 34) ^ e.rotrBH(p, w, 39), ct = e.rotrSL(p, w, 28) ^ e.rotrBL(p, w, 34) ^ e.rotrBL(p, w, 39), at = p & U ^ p & o ^ U & o, Dt = w & E ^ w & f ^ E & f;
|
|
2417
|
+
s = v | 0, l = q | 0, v = F | 0, q = O | 0, F = A | 0, O = m | 0, { h: A, l: m } = e.add(d | 0, L | 0, K | 0, it | 0), d = o | 0, L = f | 0, o = U | 0, f = E | 0, U = p | 0, E = w | 0;
|
|
2418
|
+
const At = e.add3L(it, ct, Dt);
|
|
2419
|
+
p = e.add3H(At, K, ot, at), w = At | 0;
|
|
2420
|
+
}
|
|
2421
|
+
({ h: p, l: w } = e.add(this.Ah | 0, this.Al | 0, p | 0, w | 0)), { h: U, l: E } = e.add(this.Bh | 0, this.Bl | 0, U | 0, E | 0), { h: o, l: f } = e.add(this.Ch | 0, this.Cl | 0, o | 0, f | 0), { h: d, l: L } = e.add(this.Dh | 0, this.Dl | 0, d | 0, L | 0), { h: A, l: m } = e.add(this.Eh | 0, this.El | 0, A | 0, m | 0), { h: F, l: O } = e.add(this.Fh | 0, this.Fl | 0, F | 0, O | 0), { h: v, l: q } = e.add(this.Gh | 0, this.Gl | 0, v | 0, q | 0), { h: s, l } = e.add(this.Hh | 0, this.Hl | 0, s | 0, l | 0), this.set(p, w, U, E, o, f, d, L, A, m, F, O, v, q, s, l);
|
|
2422
|
+
}
|
|
2423
|
+
roundClean() {
|
|
2424
|
+
(0, n.clean)(H, u);
|
|
2425
|
+
}
|
|
2426
|
+
destroy() {
|
|
2427
|
+
(0, n.clean)(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
|
|
2428
|
+
}
|
|
2429
|
+
}
|
|
2430
|
+
X.SHA512 = S;
|
|
2431
|
+
class B extends S {
|
|
2432
|
+
constructor() {
|
|
2433
|
+
super(48), this.Ah = t.SHA384_IV[0] | 0, this.Al = t.SHA384_IV[1] | 0, this.Bh = t.SHA384_IV[2] | 0, this.Bl = t.SHA384_IV[3] | 0, this.Ch = t.SHA384_IV[4] | 0, this.Cl = t.SHA384_IV[5] | 0, this.Dh = t.SHA384_IV[6] | 0, this.Dl = t.SHA384_IV[7] | 0, this.Eh = t.SHA384_IV[8] | 0, this.El = t.SHA384_IV[9] | 0, this.Fh = t.SHA384_IV[10] | 0, this.Fl = t.SHA384_IV[11] | 0, this.Gh = t.SHA384_IV[12] | 0, this.Gl = t.SHA384_IV[13] | 0, this.Hh = t.SHA384_IV[14] | 0, this.Hl = t.SHA384_IV[15] | 0;
|
|
2434
|
+
}
|
|
2435
|
+
}
|
|
2436
|
+
X.SHA384 = B;
|
|
2437
|
+
const g = /* @__PURE__ */ Uint32Array.from([
|
|
2438
|
+
2352822216,
|
|
2439
|
+
424955298,
|
|
2440
|
+
1944164710,
|
|
2441
|
+
2312950998,
|
|
2442
|
+
502970286,
|
|
2443
|
+
855612546,
|
|
2444
|
+
1738396948,
|
|
2445
|
+
1479516111,
|
|
2446
|
+
258812777,
|
|
2447
|
+
2077511080,
|
|
2448
|
+
2011393907,
|
|
2449
|
+
79989058,
|
|
2450
|
+
1067287976,
|
|
2451
|
+
1780299464,
|
|
2452
|
+
286451373,
|
|
2453
|
+
2446758561
|
|
2454
|
+
]), I = /* @__PURE__ */ Uint32Array.from([
|
|
2455
|
+
573645204,
|
|
2456
|
+
4230739756,
|
|
2457
|
+
2673172387,
|
|
2458
|
+
3360449730,
|
|
2459
|
+
596883563,
|
|
2460
|
+
1867755857,
|
|
2461
|
+
2520282905,
|
|
2462
|
+
1497426621,
|
|
2463
|
+
2519219938,
|
|
2464
|
+
2827943907,
|
|
2465
|
+
3193839141,
|
|
2466
|
+
1401305490,
|
|
2467
|
+
721525244,
|
|
2468
|
+
746961066,
|
|
2469
|
+
246885852,
|
|
2470
|
+
2177182882
|
|
2471
|
+
]);
|
|
2472
|
+
class D extends S {
|
|
2473
|
+
constructor() {
|
|
2474
|
+
super(28), this.Ah = g[0] | 0, this.Al = g[1] | 0, this.Bh = g[2] | 0, this.Bl = g[3] | 0, this.Ch = g[4] | 0, this.Cl = g[5] | 0, this.Dh = g[6] | 0, this.Dl = g[7] | 0, this.Eh = g[8] | 0, this.El = g[9] | 0, this.Fh = g[10] | 0, this.Fl = g[11] | 0, this.Gh = g[12] | 0, this.Gl = g[13] | 0, this.Hh = g[14] | 0, this.Hl = g[15] | 0;
|
|
2475
|
+
}
|
|
2476
|
+
}
|
|
2477
|
+
X.SHA512_224 = D;
|
|
2478
|
+
class R extends S {
|
|
2479
|
+
constructor() {
|
|
2480
|
+
super(32), this.Ah = I[0] | 0, this.Al = I[1] | 0, this.Bh = I[2] | 0, this.Bl = I[3] | 0, this.Ch = I[4] | 0, this.Cl = I[5] | 0, this.Dh = I[6] | 0, this.Dl = I[7] | 0, this.Eh = I[8] | 0, this.El = I[9] | 0, this.Fh = I[10] | 0, this.Fl = I[11] | 0, this.Gh = I[12] | 0, this.Gl = I[13] | 0, this.Hh = I[14] | 0, this.Hl = I[15] | 0;
|
|
2481
|
+
}
|
|
2482
|
+
}
|
|
2483
|
+
return X.SHA512_256 = R, X.sha256 = (0, n.createHasher)(() => new i()), X.sha224 = (0, n.createHasher)(() => new r()), X.sha512 = (0, n.createHasher)(() => new S()), X.sha384 = (0, n.createHasher)(() => new B()), X.sha512_256 = (0, n.createHasher)(() => new R()), X.sha512_224 = (0, n.createHasher)(() => new D()), X;
|
|
2484
|
+
}
|
|
2485
|
+
var Ve;
|
|
2486
|
+
function Js() {
|
|
2487
|
+
if (Ve) return ht;
|
|
2488
|
+
Ve = 1, Object.defineProperty(ht, "__esModule", { value: !0 }), ht.sha224 = ht.SHA224 = ht.sha256 = ht.SHA256 = void 0;
|
|
2489
|
+
const t = /* @__PURE__ */ gs();
|
|
2490
|
+
return ht.SHA256 = t.SHA256, ht.sha256 = t.sha256, ht.SHA224 = t.SHA224, ht.sha224 = t.sha224, ht;
|
|
2491
|
+
}
|
|
2492
|
+
const Ss = BigInt(0), Ot = BigInt(1), ws = BigInt(2), Is = BigInt(7), Bs = BigInt(256), Ls = BigInt(113), h0 = [], f0 = [], d0 = [];
|
|
2493
|
+
for (let t = 0, e = Ot, n = 1, h = 0; t < 24; t++) {
|
|
2494
|
+
[n, h] = [h, (2 * n + 3 * h) % 5], h0.push(2 * (5 * h + n)), f0.push((t + 1) * (t + 2) / 2 % 64);
|
|
2495
|
+
let c = Ss;
|
|
2496
|
+
for (let i = 0; i < 7; i++)
|
|
2497
|
+
e = (e << Ot ^ (e >> Is) * Ls) % Bs, e & ws && (c ^= Ot << (Ot << BigInt(i)) - Ot);
|
|
2498
|
+
d0.push(c);
|
|
2499
|
+
}
|
|
2500
|
+
const u0 = $e(d0, !0), ms = u0[0], Vs = u0[1], Ue = (t, e, n) => n > 32 ? Q0(t, e, n) : J0(t, e, n), Ee = (t, e, n) => n > 32 ? Y0(t, e, n) : z0(t, e, n);
|
|
2501
|
+
function Us(t, e = 24) {
|
|
2502
|
+
const n = new Uint32Array(10);
|
|
2503
|
+
for (let h = 24 - e; h < 24; h++) {
|
|
2504
|
+
for (let r = 0; r < 10; r++)
|
|
2505
|
+
n[r] = t[r] ^ t[r + 10] ^ t[r + 20] ^ t[r + 30] ^ t[r + 40];
|
|
2506
|
+
for (let r = 0; r < 10; r += 2) {
|
|
2507
|
+
const a = (r + 8) % 10, b = (r + 2) % 10, x = n[b], H = n[b + 1], u = Ue(x, H, 1) ^ n[a], S = Ee(x, H, 1) ^ n[a + 1];
|
|
2508
|
+
for (let B = 0; B < 50; B += 10)
|
|
2509
|
+
t[r + B] ^= u, t[r + B + 1] ^= S;
|
|
2510
|
+
}
|
|
2511
|
+
let c = t[2], i = t[3];
|
|
2512
|
+
for (let r = 0; r < 24; r++) {
|
|
2513
|
+
const a = f0[r], b = Ue(c, i, a), x = Ee(c, i, a), H = h0[r];
|
|
2514
|
+
c = t[H], i = t[H + 1], t[H] = b, t[H + 1] = x;
|
|
2515
|
+
}
|
|
2516
|
+
for (let r = 0; r < 50; r += 10) {
|
|
2517
|
+
for (let a = 0; a < 10; a++)
|
|
2518
|
+
n[a] = t[r + a];
|
|
2519
|
+
for (let a = 0; a < 10; a++)
|
|
2520
|
+
t[r + a] ^= ~n[(a + 2) % 10] & n[(a + 4) % 10];
|
|
2521
|
+
}
|
|
2522
|
+
t[0] ^= ms[h], t[1] ^= Vs[h];
|
|
2523
|
+
}
|
|
2524
|
+
rt(n);
|
|
2525
|
+
}
|
|
2526
|
+
class ae {
|
|
2527
|
+
state;
|
|
2528
|
+
pos = 0;
|
|
2529
|
+
posOut = 0;
|
|
2530
|
+
finished = !1;
|
|
2531
|
+
state32;
|
|
2532
|
+
destroyed = !1;
|
|
2533
|
+
blockLen;
|
|
2534
|
+
suffix;
|
|
2535
|
+
outputLen;
|
|
2536
|
+
enableXOF = !1;
|
|
2537
|
+
rounds;
|
|
2538
|
+
// NOTE: we accept arguments in bytes instead of bits here.
|
|
2539
|
+
constructor(e, n, h, c = !1, i = 24) {
|
|
2540
|
+
if (this.blockLen = e, this.suffix = n, this.outputLen = h, this.enableXOF = c, this.rounds = i, Vt(h, "outputLen"), !(0 < e && e < 200))
|
|
2541
|
+
throw new Error("only keccak-f1600 function is supported");
|
|
2542
|
+
this.state = new Uint8Array(200), this.state32 = V0(this.state);
|
|
2543
|
+
}
|
|
2544
|
+
clone() {
|
|
2545
|
+
return this._cloneInto();
|
|
2546
|
+
}
|
|
2547
|
+
keccak() {
|
|
2548
|
+
fe(this.state32), Us(this.state32, this.rounds), fe(this.state32), this.posOut = 0, this.pos = 0;
|
|
2549
|
+
}
|
|
2550
|
+
update(e) {
|
|
2551
|
+
kt(this), Ht(e);
|
|
2552
|
+
const { blockLen: n, state: h } = this, c = e.length;
|
|
2553
|
+
for (let i = 0; i < c; ) {
|
|
2554
|
+
const r = Math.min(n - this.pos, c - i);
|
|
2555
|
+
for (let a = 0; a < r; a++)
|
|
2556
|
+
h[this.pos++] ^= e[i++];
|
|
2557
|
+
this.pos === n && this.keccak();
|
|
2558
|
+
}
|
|
2559
|
+
return this;
|
|
2560
|
+
}
|
|
2561
|
+
finish() {
|
|
2562
|
+
if (this.finished)
|
|
2563
|
+
return;
|
|
2564
|
+
this.finished = !0;
|
|
2565
|
+
const { state: e, suffix: n, pos: h, blockLen: c } = this;
|
|
2566
|
+
e[h] ^= n, (n & 128) !== 0 && h === c - 1 && this.keccak(), e[c - 1] ^= 128, this.keccak();
|
|
2567
|
+
}
|
|
2568
|
+
writeInto(e) {
|
|
2569
|
+
kt(this, !1), Ht(e), this.finish();
|
|
2570
|
+
const n = this.state, { blockLen: h } = this;
|
|
2571
|
+
for (let c = 0, i = e.length; c < i; ) {
|
|
2572
|
+
this.posOut >= h && this.keccak();
|
|
2573
|
+
const r = Math.min(h - this.posOut, i - c);
|
|
2574
|
+
e.set(n.subarray(this.posOut, this.posOut + r), c), this.posOut += r, c += r;
|
|
2575
|
+
}
|
|
2576
|
+
return e;
|
|
2577
|
+
}
|
|
2578
|
+
xofInto(e) {
|
|
2579
|
+
if (!this.enableXOF)
|
|
2580
|
+
throw new Error("XOF is not possible for this instance");
|
|
2581
|
+
return this.writeInto(e);
|
|
2582
|
+
}
|
|
2583
|
+
xof(e) {
|
|
2584
|
+
return Vt(e), this.xofInto(new Uint8Array(e));
|
|
2585
|
+
}
|
|
2586
|
+
digestInto(e) {
|
|
2587
|
+
if (Re(e, this), this.finished)
|
|
2588
|
+
throw new Error("digest() was already called");
|
|
2589
|
+
return this.writeInto(e), this.destroy(), e;
|
|
2590
|
+
}
|
|
2591
|
+
digest() {
|
|
2592
|
+
return this.digestInto(new Uint8Array(this.outputLen));
|
|
2593
|
+
}
|
|
2594
|
+
destroy() {
|
|
2595
|
+
this.destroyed = !0, rt(this.state);
|
|
2596
|
+
}
|
|
2597
|
+
_cloneInto(e) {
|
|
2598
|
+
const { blockLen: n, suffix: h, outputLen: c, rounds: i, enableXOF: r } = this;
|
|
2599
|
+
return e ||= new ae(n, h, c, r, i), e.state32.set(this.state32), e.pos = this.pos, e.posOut = this.posOut, e.finished = this.finished, e.rounds = i, e.suffix = h, e.outputLen = c, e.enableXOF = r, e.destroyed = this.destroyed, e;
|
|
2600
|
+
}
|
|
2601
|
+
}
|
|
2602
|
+
const l0 = (t, e, n, h = {}) => lt((c = {}) => new ae(e, t, c.dkLen === void 0 ? n : c.dkLen, !0), h), zs = /* @__PURE__ */ l0(31, 168, 16, /* @__PURE__ */ mt(11)), Qs = /* @__PURE__ */ l0(31, 136, 32, /* @__PURE__ */ mt(12));
|
|
2603
|
+
function Es(t, e, n, h) {
|
|
2604
|
+
We(t);
|
|
2605
|
+
const c = F0({ dkLen: 32, asyncTick: 10 }, h), { c: i, dkLen: r, asyncTick: a } = c;
|
|
2606
|
+
if (Vt(i, "c"), Vt(r, "dkLen"), Vt(a, "asyncTick"), i < 1)
|
|
2607
|
+
throw new Error("iterations (c) must be >= 1");
|
|
2608
|
+
const b = ue(e, "password"), x = ue(n, "salt"), H = new Uint8Array(r), u = oe.create(t, b), S = u._cloneInto().update(x);
|
|
2609
|
+
return { c: i, dkLen: r, asyncTick: a, DK: H, PRF: u, PRFSalt: S };
|
|
2610
|
+
}
|
|
2611
|
+
function Cs(t, e, n, h, c) {
|
|
2612
|
+
return t.destroy(), e.destroy(), h && h.destroy(), rt(c), n;
|
|
2613
|
+
}
|
|
2614
|
+
function Ys(t, e, n, h) {
|
|
2615
|
+
const { c, dkLen: i, DK: r, PRF: a, PRFSalt: b } = Es(t, e, n, h);
|
|
2616
|
+
let x;
|
|
2617
|
+
const H = new Uint8Array(4), u = Kt(H), S = new Uint8Array(a.outputLen);
|
|
2618
|
+
for (let B = 1, g = 0; g < i; B++, g += a.outputLen) {
|
|
2619
|
+
const I = r.subarray(g, g + a.outputLen);
|
|
2620
|
+
u.setInt32(0, B, !1), (x = b._cloneInto(x)).update(H).digestInto(S), I.set(S.subarray(0, I.length));
|
|
2621
|
+
for (let D = 1; D < c; D++) {
|
|
2622
|
+
a._cloneInto(x).update(S).digestInto(S);
|
|
2623
|
+
for (let R = 0; R < I.length; R++)
|
|
2624
|
+
I[R] ^= S[R];
|
|
2625
|
+
}
|
|
2626
|
+
}
|
|
2627
|
+
return Cs(a, b, r, x, S);
|
|
2628
|
+
}
|
|
2629
|
+
var ft = {}, J = {}, nt = {}, te = {}, vt = {}, Ce;
|
|
2630
|
+
function ks() {
|
|
2631
|
+
return Ce || (Ce = 1, Object.defineProperty(vt, "__esModule", { value: !0 }), vt.crypto = void 0, vt.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0), vt;
|
|
2632
|
+
}
|
|
2633
|
+
var ke;
|
|
2634
|
+
function Jt() {
|
|
2635
|
+
return ke || (ke = 1, (function(t) {
|
|
2636
|
+
Object.defineProperty(t, "__esModule", { value: !0 }), t.wrapXOFConstructorWithOpts = t.wrapConstructorWithOpts = t.wrapConstructor = t.Hash = t.nextTick = t.swap32IfBE = t.byteSwapIfBE = t.swap8IfBE = t.isLE = void 0, t.isBytes = n, t.anumber = h, t.abytes = c, t.ahash = i, t.aexists = r, t.aoutput = a, t.u8 = b, t.u32 = x, t.clean = H, t.createView = u, t.rotr = S, t.rotl = B, t.byteSwap = g, t.byteSwap32 = I, t.bytesToHex = T, t.hexToBytes = p, t.asyncLoop = U, t.utf8ToBytes = E, t.bytesToUtf8 = o, t.toBytes = f, t.kdfInputToBytes = d, t.concatBytes = L, t.checkOpts = A, t.createHasher = F, t.createOptHasher = O, t.createXOFer = v, t.randomBytes = q;
|
|
2637
|
+
const e = /* @__PURE__ */ ks();
|
|
2638
|
+
function n(s) {
|
|
2639
|
+
return s instanceof Uint8Array || ArrayBuffer.isView(s) && s.constructor.name === "Uint8Array";
|
|
2640
|
+
}
|
|
2641
|
+
function h(s) {
|
|
2642
|
+
if (!Number.isSafeInteger(s) || s < 0)
|
|
2643
|
+
throw new Error("positive integer expected, got " + s);
|
|
2644
|
+
}
|
|
2645
|
+
function c(s, ...l) {
|
|
2646
|
+
if (!n(s))
|
|
2647
|
+
throw new Error("Uint8Array expected");
|
|
2648
|
+
if (l.length > 0 && !l.includes(s.length))
|
|
2649
|
+
throw new Error("Uint8Array expected of length " + l + ", got length=" + s.length);
|
|
2650
|
+
}
|
|
2651
|
+
function i(s) {
|
|
2652
|
+
if (typeof s != "function" || typeof s.create != "function")
|
|
2653
|
+
throw new Error("Hash should be wrapped by utils.createHasher");
|
|
2654
|
+
h(s.outputLen), h(s.blockLen);
|
|
2655
|
+
}
|
|
2656
|
+
function r(s, l = !0) {
|
|
2657
|
+
if (s.destroyed)
|
|
2658
|
+
throw new Error("Hash instance has been destroyed");
|
|
2659
|
+
if (l && s.finished)
|
|
2660
|
+
throw new Error("Hash#digest() has already been called");
|
|
2661
|
+
}
|
|
2662
|
+
function a(s, l) {
|
|
2663
|
+
c(s);
|
|
2664
|
+
const y = l.outputLen;
|
|
2665
|
+
if (s.length < y)
|
|
2666
|
+
throw new Error("digestInto() expects output buffer of length at least " + y);
|
|
2667
|
+
}
|
|
2668
|
+
function b(s) {
|
|
2669
|
+
return new Uint8Array(s.buffer, s.byteOffset, s.byteLength);
|
|
2670
|
+
}
|
|
2671
|
+
function x(s) {
|
|
2672
|
+
return new Uint32Array(s.buffer, s.byteOffset, Math.floor(s.byteLength / 4));
|
|
2673
|
+
}
|
|
2674
|
+
function H(...s) {
|
|
2675
|
+
for (let l = 0; l < s.length; l++)
|
|
2676
|
+
s[l].fill(0);
|
|
2677
|
+
}
|
|
2678
|
+
function u(s) {
|
|
2679
|
+
return new DataView(s.buffer, s.byteOffset, s.byteLength);
|
|
2680
|
+
}
|
|
2681
|
+
function S(s, l) {
|
|
2682
|
+
return s << 32 - l | s >>> l;
|
|
2683
|
+
}
|
|
2684
|
+
function B(s, l) {
|
|
2685
|
+
return s << l | s >>> 32 - l >>> 0;
|
|
2686
|
+
}
|
|
2687
|
+
t.isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
2688
|
+
function g(s) {
|
|
2689
|
+
return s << 24 & 4278190080 | s << 8 & 16711680 | s >>> 8 & 65280 | s >>> 24 & 255;
|
|
2690
|
+
}
|
|
2691
|
+
t.swap8IfBE = t.isLE ? (s) => s : (s) => g(s), t.byteSwapIfBE = t.swap8IfBE;
|
|
2692
|
+
function I(s) {
|
|
2693
|
+
for (let l = 0; l < s.length; l++)
|
|
2694
|
+
s[l] = g(s[l]);
|
|
2695
|
+
return s;
|
|
2696
|
+
}
|
|
2697
|
+
t.swap32IfBE = t.isLE ? (s) => s : I;
|
|
2698
|
+
const D = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", R = /* @__PURE__ */ Array.from({ length: 256 }, (s, l) => l.toString(16).padStart(2, "0"));
|
|
2699
|
+
function T(s) {
|
|
2700
|
+
if (c(s), D)
|
|
2701
|
+
return s.toHex();
|
|
2702
|
+
let l = "";
|
|
2703
|
+
for (let y = 0; y < s.length; y++)
|
|
2704
|
+
l += R[s[y]];
|
|
2705
|
+
return l;
|
|
2706
|
+
}
|
|
2707
|
+
const _ = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
2708
|
+
function C(s) {
|
|
2709
|
+
if (s >= _._0 && s <= _._9)
|
|
2710
|
+
return s - _._0;
|
|
2711
|
+
if (s >= _.A && s <= _.F)
|
|
2712
|
+
return s - (_.A - 10);
|
|
2713
|
+
if (s >= _.a && s <= _.f)
|
|
2714
|
+
return s - (_.a - 10);
|
|
2715
|
+
}
|
|
2716
|
+
function p(s) {
|
|
2717
|
+
if (typeof s != "string")
|
|
2718
|
+
throw new Error("hex string expected, got " + typeof s);
|
|
2719
|
+
if (D)
|
|
2720
|
+
return Uint8Array.fromHex(s);
|
|
2721
|
+
const l = s.length, y = l / 2;
|
|
2722
|
+
if (l % 2)
|
|
2723
|
+
throw new Error("hex string expected, got unpadded hex of length " + l);
|
|
2724
|
+
const V = new Uint8Array(y);
|
|
2725
|
+
for (let k = 0, M = 0; k < y; k++, M += 2) {
|
|
2726
|
+
const z = C(s.charCodeAt(M)), P = C(s.charCodeAt(M + 1));
|
|
2727
|
+
if (z === void 0 || P === void 0) {
|
|
2728
|
+
const K = s[M] + s[M + 1];
|
|
2729
|
+
throw new Error('hex string expected, got non-hex character "' + K + '" at index ' + M);
|
|
2730
|
+
}
|
|
2731
|
+
V[k] = z * 16 + P;
|
|
2732
|
+
}
|
|
2733
|
+
return V;
|
|
2734
|
+
}
|
|
2735
|
+
const w = async () => {
|
|
2736
|
+
};
|
|
2737
|
+
t.nextTick = w;
|
|
2738
|
+
async function U(s, l, y) {
|
|
2739
|
+
let V = Date.now();
|
|
2740
|
+
for (let k = 0; k < s; k++) {
|
|
2741
|
+
y(k);
|
|
2742
|
+
const M = Date.now() - V;
|
|
2743
|
+
M >= 0 && M < l || (await (0, t.nextTick)(), V += M);
|
|
2744
|
+
}
|
|
2745
|
+
}
|
|
2746
|
+
function E(s) {
|
|
2747
|
+
if (typeof s != "string")
|
|
2748
|
+
throw new Error("string expected");
|
|
2749
|
+
return new Uint8Array(new TextEncoder().encode(s));
|
|
2750
|
+
}
|
|
2751
|
+
function o(s) {
|
|
2752
|
+
return new TextDecoder().decode(s);
|
|
2753
|
+
}
|
|
2754
|
+
function f(s) {
|
|
2755
|
+
return typeof s == "string" && (s = E(s)), c(s), s;
|
|
2756
|
+
}
|
|
2757
|
+
function d(s) {
|
|
2758
|
+
return typeof s == "string" && (s = E(s)), c(s), s;
|
|
2759
|
+
}
|
|
2760
|
+
function L(...s) {
|
|
2761
|
+
let l = 0;
|
|
2762
|
+
for (let V = 0; V < s.length; V++) {
|
|
2763
|
+
const k = s[V];
|
|
2764
|
+
c(k), l += k.length;
|
|
2765
|
+
}
|
|
2766
|
+
const y = new Uint8Array(l);
|
|
2767
|
+
for (let V = 0, k = 0; V < s.length; V++) {
|
|
2768
|
+
const M = s[V];
|
|
2769
|
+
y.set(M, k), k += M.length;
|
|
2770
|
+
}
|
|
2771
|
+
return y;
|
|
2772
|
+
}
|
|
2773
|
+
function A(s, l) {
|
|
2774
|
+
if (l !== void 0 && {}.toString.call(l) !== "[object Object]")
|
|
2775
|
+
throw new Error("options should be object or undefined");
|
|
2776
|
+
return Object.assign(s, l);
|
|
2777
|
+
}
|
|
2778
|
+
class m {
|
|
2779
|
+
}
|
|
2780
|
+
t.Hash = m;
|
|
2781
|
+
function F(s) {
|
|
2782
|
+
const l = (V) => s().update(f(V)).digest(), y = s();
|
|
2783
|
+
return l.outputLen = y.outputLen, l.blockLen = y.blockLen, l.create = () => s(), l;
|
|
2784
|
+
}
|
|
2785
|
+
function O(s) {
|
|
2786
|
+
const l = (V, k) => s(k).update(f(V)).digest(), y = s({});
|
|
2787
|
+
return l.outputLen = y.outputLen, l.blockLen = y.blockLen, l.create = (V) => s(V), l;
|
|
2788
|
+
}
|
|
2789
|
+
function v(s) {
|
|
2790
|
+
const l = (V, k) => s(k).update(f(V)).digest(), y = s({});
|
|
2791
|
+
return l.outputLen = y.outputLen, l.blockLen = y.blockLen, l.create = (V) => s(V), l;
|
|
2792
|
+
}
|
|
2793
|
+
t.wrapConstructor = F, t.wrapConstructorWithOpts = O, t.wrapXOFConstructorWithOpts = v;
|
|
2794
|
+
function q(s = 32) {
|
|
2795
|
+
if (e.crypto && typeof e.crypto.getRandomValues == "function")
|
|
2796
|
+
return e.crypto.getRandomValues(new Uint8Array(s));
|
|
2797
|
+
if (e.crypto && typeof e.crypto.randomBytes == "function")
|
|
2798
|
+
return Uint8Array.from(e.crypto.randomBytes(s));
|
|
2799
|
+
throw new Error("crypto.getRandomValues must be defined");
|
|
2800
|
+
}
|
|
2801
|
+
})(te)), te;
|
|
2802
|
+
}
|
|
2803
|
+
var De;
|
|
2804
|
+
function Ds() {
|
|
2805
|
+
if (De) return nt;
|
|
2806
|
+
De = 1, Object.defineProperty(nt, "__esModule", { value: !0 }), nt.SHA512_IV = nt.SHA384_IV = nt.SHA224_IV = nt.SHA256_IV = nt.HashMD = void 0, nt.setBigUint64 = e, nt.Chi = n, nt.Maj = h;
|
|
2807
|
+
const t = /* @__PURE__ */ Jt();
|
|
2808
|
+
function e(i, r, a, b) {
|
|
2809
|
+
if (typeof i.setBigUint64 == "function")
|
|
2810
|
+
return i.setBigUint64(r, a, b);
|
|
2811
|
+
const x = BigInt(32), H = BigInt(4294967295), u = Number(a >> x & H), S = Number(a & H), B = b ? 4 : 0, g = b ? 0 : 4;
|
|
2812
|
+
i.setUint32(r + B, u, b), i.setUint32(r + g, S, b);
|
|
2813
|
+
}
|
|
2814
|
+
function n(i, r, a) {
|
|
2815
|
+
return i & r ^ ~i & a;
|
|
2816
|
+
}
|
|
2817
|
+
function h(i, r, a) {
|
|
2818
|
+
return i & r ^ i & a ^ r & a;
|
|
2819
|
+
}
|
|
2820
|
+
class c extends t.Hash {
|
|
2821
|
+
constructor(r, a, b, x) {
|
|
2822
|
+
super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = r, this.outputLen = a, this.padOffset = b, this.isLE = x, this.buffer = new Uint8Array(r), this.view = (0, t.createView)(this.buffer);
|
|
2823
|
+
}
|
|
2824
|
+
update(r) {
|
|
2825
|
+
(0, t.aexists)(this), r = (0, t.toBytes)(r), (0, t.abytes)(r);
|
|
2826
|
+
const { view: a, buffer: b, blockLen: x } = this, H = r.length;
|
|
2827
|
+
for (let u = 0; u < H; ) {
|
|
2828
|
+
const S = Math.min(x - this.pos, H - u);
|
|
2829
|
+
if (S === x) {
|
|
2830
|
+
const B = (0, t.createView)(r);
|
|
2831
|
+
for (; x <= H - u; u += x)
|
|
2832
|
+
this.process(B, u);
|
|
2833
|
+
continue;
|
|
2834
|
+
}
|
|
2835
|
+
b.set(r.subarray(u, u + S), this.pos), this.pos += S, u += S, this.pos === x && (this.process(a, 0), this.pos = 0);
|
|
2836
|
+
}
|
|
2837
|
+
return this.length += r.length, this.roundClean(), this;
|
|
2838
|
+
}
|
|
2839
|
+
digestInto(r) {
|
|
2840
|
+
(0, t.aexists)(this), (0, t.aoutput)(r, this), this.finished = !0;
|
|
2841
|
+
const { buffer: a, view: b, blockLen: x, isLE: H } = this;
|
|
2842
|
+
let { pos: u } = this;
|
|
2843
|
+
a[u++] = 128, (0, t.clean)(this.buffer.subarray(u)), this.padOffset > x - u && (this.process(b, 0), u = 0);
|
|
2844
|
+
for (let D = u; D < x; D++)
|
|
2845
|
+
a[D] = 0;
|
|
2846
|
+
e(b, x - 8, BigInt(this.length * 8), H), this.process(b, 0);
|
|
2847
|
+
const S = (0, t.createView)(r), B = this.outputLen;
|
|
2848
|
+
if (B % 4)
|
|
2849
|
+
throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
2850
|
+
const g = B / 4, I = this.get();
|
|
2851
|
+
if (g > I.length)
|
|
2852
|
+
throw new Error("_sha2: outputLen bigger than state");
|
|
2853
|
+
for (let D = 0; D < g; D++)
|
|
2854
|
+
S.setUint32(4 * D, I[D], H);
|
|
2855
|
+
}
|
|
2856
|
+
digest() {
|
|
2857
|
+
const { buffer: r, outputLen: a } = this;
|
|
2858
|
+
this.digestInto(r);
|
|
2859
|
+
const b = r.slice(0, a);
|
|
2860
|
+
return this.destroy(), b;
|
|
2861
|
+
}
|
|
2862
|
+
_cloneInto(r) {
|
|
2863
|
+
r || (r = new this.constructor()), r.set(...this.get());
|
|
2864
|
+
const { blockLen: a, buffer: b, length: x, finished: H, destroyed: u, pos: S } = this;
|
|
2865
|
+
return r.destroyed = u, r.finished = H, r.length = x, r.pos = S, x % a && r.buffer.set(b), r;
|
|
2866
|
+
}
|
|
2867
|
+
clone() {
|
|
2868
|
+
return this._cloneInto();
|
|
2869
|
+
}
|
|
2870
|
+
}
|
|
2871
|
+
return nt.HashMD = c, nt.SHA256_IV = Uint32Array.from([
|
|
2872
|
+
1779033703,
|
|
2873
|
+
3144134277,
|
|
2874
|
+
1013904242,
|
|
2875
|
+
2773480762,
|
|
2876
|
+
1359893119,
|
|
2877
|
+
2600822924,
|
|
2878
|
+
528734635,
|
|
2879
|
+
1541459225
|
|
2880
|
+
]), nt.SHA224_IV = Uint32Array.from([
|
|
2881
|
+
3238371032,
|
|
2882
|
+
914150663,
|
|
2883
|
+
812702999,
|
|
2884
|
+
4144912697,
|
|
2885
|
+
4290775857,
|
|
2886
|
+
1750603025,
|
|
2887
|
+
1694076839,
|
|
2888
|
+
3204075428
|
|
2889
|
+
]), nt.SHA384_IV = Uint32Array.from([
|
|
2890
|
+
3418070365,
|
|
2891
|
+
3238371032,
|
|
2892
|
+
1654270250,
|
|
2893
|
+
914150663,
|
|
2894
|
+
2438529370,
|
|
2895
|
+
812702999,
|
|
2896
|
+
355462360,
|
|
2897
|
+
4144912697,
|
|
2898
|
+
1731405415,
|
|
2899
|
+
4290775857,
|
|
2900
|
+
2394180231,
|
|
2901
|
+
1750603025,
|
|
2902
|
+
3675008525,
|
|
2903
|
+
1694076839,
|
|
2904
|
+
1203062813,
|
|
2905
|
+
3204075428
|
|
2906
|
+
]), nt.SHA512_IV = Uint32Array.from([
|
|
2907
|
+
1779033703,
|
|
2908
|
+
4089235720,
|
|
2909
|
+
3144134277,
|
|
2910
|
+
2227873595,
|
|
2911
|
+
1013904242,
|
|
2912
|
+
4271175723,
|
|
2913
|
+
2773480762,
|
|
2914
|
+
1595750129,
|
|
2915
|
+
1359893119,
|
|
2916
|
+
2917565137,
|
|
2917
|
+
2600822924,
|
|
2918
|
+
725511199,
|
|
2919
|
+
528734635,
|
|
2920
|
+
4215389547,
|
|
2921
|
+
1541459225,
|
|
2922
|
+
327033209
|
|
2923
|
+
]), nt;
|
|
2924
|
+
}
|
|
2925
|
+
var W = {}, Fe;
|
|
2926
|
+
function Fs() {
|
|
2927
|
+
if (Fe) return W;
|
|
2928
|
+
Fe = 1, Object.defineProperty(W, "__esModule", { value: !0 }), W.toBig = W.shrSL = W.shrSH = W.rotrSL = W.rotrSH = W.rotrBL = W.rotrBH = W.rotr32L = W.rotr32H = W.rotlSL = W.rotlSH = W.rotlBL = W.rotlBH = W.add5L = W.add5H = W.add4L = W.add4H = W.add3L = W.add3H = void 0, W.add = R, W.fromBig = n, W.split = h;
|
|
2929
|
+
const t = /* @__PURE__ */ BigInt(2 ** 32 - 1), e = /* @__PURE__ */ BigInt(32);
|
|
2930
|
+
function n(o, f = !1) {
|
|
2931
|
+
return f ? { h: Number(o & t), l: Number(o >> e & t) } : { h: Number(o >> e & t) | 0, l: Number(o & t) | 0 };
|
|
2932
|
+
}
|
|
2933
|
+
function h(o, f = !1) {
|
|
2934
|
+
const d = o.length;
|
|
2935
|
+
let L = new Uint32Array(d), A = new Uint32Array(d);
|
|
2936
|
+
for (let m = 0; m < d; m++) {
|
|
2937
|
+
const { h: F, l: O } = n(o[m], f);
|
|
2938
|
+
[L[m], A[m]] = [F, O];
|
|
2939
|
+
}
|
|
2940
|
+
return [L, A];
|
|
2941
|
+
}
|
|
2942
|
+
const c = (o, f) => BigInt(o >>> 0) << e | BigInt(f >>> 0);
|
|
2943
|
+
W.toBig = c;
|
|
2944
|
+
const i = (o, f, d) => o >>> d;
|
|
2945
|
+
W.shrSH = i;
|
|
2946
|
+
const r = (o, f, d) => o << 32 - d | f >>> d;
|
|
2947
|
+
W.shrSL = r;
|
|
2948
|
+
const a = (o, f, d) => o >>> d | f << 32 - d;
|
|
2949
|
+
W.rotrSH = a;
|
|
2950
|
+
const b = (o, f, d) => o << 32 - d | f >>> d;
|
|
2951
|
+
W.rotrSL = b;
|
|
2952
|
+
const x = (o, f, d) => o << 64 - d | f >>> d - 32;
|
|
2953
|
+
W.rotrBH = x;
|
|
2954
|
+
const H = (o, f, d) => o >>> d - 32 | f << 64 - d;
|
|
2955
|
+
W.rotrBL = H;
|
|
2956
|
+
const u = (o, f) => f;
|
|
2957
|
+
W.rotr32H = u;
|
|
2958
|
+
const S = (o, f) => o;
|
|
2959
|
+
W.rotr32L = S;
|
|
2960
|
+
const B = (o, f, d) => o << d | f >>> 32 - d;
|
|
2961
|
+
W.rotlSH = B;
|
|
2962
|
+
const g = (o, f, d) => f << d | o >>> 32 - d;
|
|
2963
|
+
W.rotlSL = g;
|
|
2964
|
+
const I = (o, f, d) => f << d - 32 | o >>> 64 - d;
|
|
2965
|
+
W.rotlBH = I;
|
|
2966
|
+
const D = (o, f, d) => o << d - 32 | f >>> 64 - d;
|
|
2967
|
+
W.rotlBL = D;
|
|
2968
|
+
function R(o, f, d, L) {
|
|
2969
|
+
const A = (f >>> 0) + (L >>> 0);
|
|
2970
|
+
return { h: o + d + (A / 2 ** 32 | 0) | 0, l: A | 0 };
|
|
2971
|
+
}
|
|
2972
|
+
const T = (o, f, d) => (o >>> 0) + (f >>> 0) + (d >>> 0);
|
|
2973
|
+
W.add3L = T;
|
|
2974
|
+
const _ = (o, f, d, L) => f + d + L + (o / 2 ** 32 | 0) | 0;
|
|
2975
|
+
W.add3H = _;
|
|
2976
|
+
const C = (o, f, d, L) => (o >>> 0) + (f >>> 0) + (d >>> 0) + (L >>> 0);
|
|
2977
|
+
W.add4L = C;
|
|
2978
|
+
const p = (o, f, d, L, A) => f + d + L + A + (o / 2 ** 32 | 0) | 0;
|
|
2979
|
+
W.add4H = p;
|
|
2980
|
+
const w = (o, f, d, L, A) => (o >>> 0) + (f >>> 0) + (d >>> 0) + (L >>> 0) + (A >>> 0);
|
|
2981
|
+
W.add5L = w;
|
|
2982
|
+
const U = (o, f, d, L, A, m) => f + d + L + A + m + (o / 2 ** 32 | 0) | 0;
|
|
2983
|
+
W.add5H = U;
|
|
2984
|
+
const E = {
|
|
2985
|
+
fromBig: n,
|
|
2986
|
+
split: h,
|
|
2987
|
+
toBig: c,
|
|
2988
|
+
shrSH: i,
|
|
2989
|
+
shrSL: r,
|
|
2990
|
+
rotrSH: a,
|
|
2991
|
+
rotrSL: b,
|
|
2992
|
+
rotrBH: x,
|
|
2993
|
+
rotrBL: H,
|
|
2994
|
+
rotr32H: u,
|
|
2995
|
+
rotr32L: S,
|
|
2996
|
+
rotlSH: B,
|
|
2997
|
+
rotlSL: g,
|
|
2998
|
+
rotlBH: I,
|
|
2999
|
+
rotlBL: D,
|
|
3000
|
+
add: R,
|
|
3001
|
+
add3L: T,
|
|
3002
|
+
add3H: _,
|
|
3003
|
+
add4L: C,
|
|
3004
|
+
add4H: p,
|
|
3005
|
+
add5H: U,
|
|
3006
|
+
add5L: w
|
|
3007
|
+
};
|
|
3008
|
+
return W.default = E, W;
|
|
3009
|
+
}
|
|
3010
|
+
var Te;
|
|
3011
|
+
function b0() {
|
|
3012
|
+
if (Te) return J;
|
|
3013
|
+
Te = 1, Object.defineProperty(J, "__esModule", { value: !0 }), J.sha512_224 = J.sha512_256 = J.sha384 = J.sha512 = J.sha224 = J.sha256 = J.SHA512_256 = J.SHA512_224 = J.SHA384 = J.SHA512 = J.SHA224 = J.SHA256 = void 0;
|
|
3014
|
+
const t = /* @__PURE__ */ Ds(), e = /* @__PURE__ */ Fs(), n = /* @__PURE__ */ Jt(), h = /* @__PURE__ */ Uint32Array.from([
|
|
3015
|
+
1116352408,
|
|
3016
|
+
1899447441,
|
|
3017
|
+
3049323471,
|
|
3018
|
+
3921009573,
|
|
3019
|
+
961987163,
|
|
3020
|
+
1508970993,
|
|
3021
|
+
2453635748,
|
|
3022
|
+
2870763221,
|
|
3023
|
+
3624381080,
|
|
3024
|
+
310598401,
|
|
3025
|
+
607225278,
|
|
3026
|
+
1426881987,
|
|
3027
|
+
1925078388,
|
|
3028
|
+
2162078206,
|
|
3029
|
+
2614888103,
|
|
3030
|
+
3248222580,
|
|
3031
|
+
3835390401,
|
|
3032
|
+
4022224774,
|
|
3033
|
+
264347078,
|
|
3034
|
+
604807628,
|
|
3035
|
+
770255983,
|
|
3036
|
+
1249150122,
|
|
3037
|
+
1555081692,
|
|
3038
|
+
1996064986,
|
|
3039
|
+
2554220882,
|
|
3040
|
+
2821834349,
|
|
3041
|
+
2952996808,
|
|
3042
|
+
3210313671,
|
|
3043
|
+
3336571891,
|
|
3044
|
+
3584528711,
|
|
3045
|
+
113926993,
|
|
3046
|
+
338241895,
|
|
3047
|
+
666307205,
|
|
3048
|
+
773529912,
|
|
3049
|
+
1294757372,
|
|
3050
|
+
1396182291,
|
|
3051
|
+
1695183700,
|
|
3052
|
+
1986661051,
|
|
3053
|
+
2177026350,
|
|
3054
|
+
2456956037,
|
|
3055
|
+
2730485921,
|
|
3056
|
+
2820302411,
|
|
3057
|
+
3259730800,
|
|
3058
|
+
3345764771,
|
|
3059
|
+
3516065817,
|
|
3060
|
+
3600352804,
|
|
3061
|
+
4094571909,
|
|
3062
|
+
275423344,
|
|
3063
|
+
430227734,
|
|
3064
|
+
506948616,
|
|
3065
|
+
659060556,
|
|
3066
|
+
883997877,
|
|
3067
|
+
958139571,
|
|
3068
|
+
1322822218,
|
|
3069
|
+
1537002063,
|
|
3070
|
+
1747873779,
|
|
3071
|
+
1955562222,
|
|
3072
|
+
2024104815,
|
|
3073
|
+
2227730452,
|
|
3074
|
+
2361852424,
|
|
3075
|
+
2428436474,
|
|
3076
|
+
2756734187,
|
|
3077
|
+
3204031479,
|
|
3078
|
+
3329325298
|
|
3079
|
+
]), c = /* @__PURE__ */ new Uint32Array(64);
|
|
3080
|
+
class i extends t.HashMD {
|
|
3081
|
+
constructor(_ = 32) {
|
|
3082
|
+
super(64, _, 8, !1), this.A = t.SHA256_IV[0] | 0, this.B = t.SHA256_IV[1] | 0, this.C = t.SHA256_IV[2] | 0, this.D = t.SHA256_IV[3] | 0, this.E = t.SHA256_IV[4] | 0, this.F = t.SHA256_IV[5] | 0, this.G = t.SHA256_IV[6] | 0, this.H = t.SHA256_IV[7] | 0;
|
|
3083
|
+
}
|
|
3084
|
+
get() {
|
|
3085
|
+
const { A: _, B: C, C: p, D: w, E: U, F: E, G: o, H: f } = this;
|
|
3086
|
+
return [_, C, p, w, U, E, o, f];
|
|
3087
|
+
}
|
|
3088
|
+
// prettier-ignore
|
|
3089
|
+
set(_, C, p, w, U, E, o, f) {
|
|
3090
|
+
this.A = _ | 0, this.B = C | 0, this.C = p | 0, this.D = w | 0, this.E = U | 0, this.F = E | 0, this.G = o | 0, this.H = f | 0;
|
|
3091
|
+
}
|
|
3092
|
+
process(_, C) {
|
|
3093
|
+
for (let A = 0; A < 16; A++, C += 4)
|
|
3094
|
+
c[A] = _.getUint32(C, !1);
|
|
3095
|
+
for (let A = 16; A < 64; A++) {
|
|
3096
|
+
const m = c[A - 15], F = c[A - 2], O = (0, n.rotr)(m, 7) ^ (0, n.rotr)(m, 18) ^ m >>> 3, v = (0, n.rotr)(F, 17) ^ (0, n.rotr)(F, 19) ^ F >>> 10;
|
|
3097
|
+
c[A] = v + c[A - 7] + O + c[A - 16] | 0;
|
|
3098
|
+
}
|
|
3099
|
+
let { A: p, B: w, C: U, D: E, E: o, F: f, G: d, H: L } = this;
|
|
3100
|
+
for (let A = 0; A < 64; A++) {
|
|
3101
|
+
const m = (0, n.rotr)(o, 6) ^ (0, n.rotr)(o, 11) ^ (0, n.rotr)(o, 25), F = L + m + (0, t.Chi)(o, f, d) + h[A] + c[A] | 0, v = ((0, n.rotr)(p, 2) ^ (0, n.rotr)(p, 13) ^ (0, n.rotr)(p, 22)) + (0, t.Maj)(p, w, U) | 0;
|
|
3102
|
+
L = d, d = f, f = o, o = E + F | 0, E = U, U = w, w = p, p = F + v | 0;
|
|
3103
|
+
}
|
|
3104
|
+
p = p + this.A | 0, w = w + this.B | 0, U = U + this.C | 0, E = E + this.D | 0, o = o + this.E | 0, f = f + this.F | 0, d = d + this.G | 0, L = L + this.H | 0, this.set(p, w, U, E, o, f, d, L);
|
|
3105
|
+
}
|
|
3106
|
+
roundClean() {
|
|
3107
|
+
(0, n.clean)(c);
|
|
3108
|
+
}
|
|
3109
|
+
destroy() {
|
|
3110
|
+
this.set(0, 0, 0, 0, 0, 0, 0, 0), (0, n.clean)(this.buffer);
|
|
3111
|
+
}
|
|
3112
|
+
}
|
|
3113
|
+
J.SHA256 = i;
|
|
3114
|
+
class r extends i {
|
|
1204
3115
|
constructor() {
|
|
1205
|
-
super(
|
|
3116
|
+
super(28), this.A = t.SHA224_IV[0] | 0, this.B = t.SHA224_IV[1] | 0, this.C = t.SHA224_IV[2] | 0, this.D = t.SHA224_IV[3] | 0, this.E = t.SHA224_IV[4] | 0, this.F = t.SHA224_IV[5] | 0, this.G = t.SHA224_IV[6] | 0, this.H = t.SHA224_IV[7] | 0;
|
|
3117
|
+
}
|
|
3118
|
+
}
|
|
3119
|
+
J.SHA224 = r;
|
|
3120
|
+
const a = e.split([
|
|
3121
|
+
"0x428a2f98d728ae22",
|
|
3122
|
+
"0x7137449123ef65cd",
|
|
3123
|
+
"0xb5c0fbcfec4d3b2f",
|
|
3124
|
+
"0xe9b5dba58189dbbc",
|
|
3125
|
+
"0x3956c25bf348b538",
|
|
3126
|
+
"0x59f111f1b605d019",
|
|
3127
|
+
"0x923f82a4af194f9b",
|
|
3128
|
+
"0xab1c5ed5da6d8118",
|
|
3129
|
+
"0xd807aa98a3030242",
|
|
3130
|
+
"0x12835b0145706fbe",
|
|
3131
|
+
"0x243185be4ee4b28c",
|
|
3132
|
+
"0x550c7dc3d5ffb4e2",
|
|
3133
|
+
"0x72be5d74f27b896f",
|
|
3134
|
+
"0x80deb1fe3b1696b1",
|
|
3135
|
+
"0x9bdc06a725c71235",
|
|
3136
|
+
"0xc19bf174cf692694",
|
|
3137
|
+
"0xe49b69c19ef14ad2",
|
|
3138
|
+
"0xefbe4786384f25e3",
|
|
3139
|
+
"0x0fc19dc68b8cd5b5",
|
|
3140
|
+
"0x240ca1cc77ac9c65",
|
|
3141
|
+
"0x2de92c6f592b0275",
|
|
3142
|
+
"0x4a7484aa6ea6e483",
|
|
3143
|
+
"0x5cb0a9dcbd41fbd4",
|
|
3144
|
+
"0x76f988da831153b5",
|
|
3145
|
+
"0x983e5152ee66dfab",
|
|
3146
|
+
"0xa831c66d2db43210",
|
|
3147
|
+
"0xb00327c898fb213f",
|
|
3148
|
+
"0xbf597fc7beef0ee4",
|
|
3149
|
+
"0xc6e00bf33da88fc2",
|
|
3150
|
+
"0xd5a79147930aa725",
|
|
3151
|
+
"0x06ca6351e003826f",
|
|
3152
|
+
"0x142929670a0e6e70",
|
|
3153
|
+
"0x27b70a8546d22ffc",
|
|
3154
|
+
"0x2e1b21385c26c926",
|
|
3155
|
+
"0x4d2c6dfc5ac42aed",
|
|
3156
|
+
"0x53380d139d95b3df",
|
|
3157
|
+
"0x650a73548baf63de",
|
|
3158
|
+
"0x766a0abb3c77b2a8",
|
|
3159
|
+
"0x81c2c92e47edaee6",
|
|
3160
|
+
"0x92722c851482353b",
|
|
3161
|
+
"0xa2bfe8a14cf10364",
|
|
3162
|
+
"0xa81a664bbc423001",
|
|
3163
|
+
"0xc24b8b70d0f89791",
|
|
3164
|
+
"0xc76c51a30654be30",
|
|
3165
|
+
"0xd192e819d6ef5218",
|
|
3166
|
+
"0xd69906245565a910",
|
|
3167
|
+
"0xf40e35855771202a",
|
|
3168
|
+
"0x106aa07032bbd1b8",
|
|
3169
|
+
"0x19a4c116b8d2d0c8",
|
|
3170
|
+
"0x1e376c085141ab53",
|
|
3171
|
+
"0x2748774cdf8eeb99",
|
|
3172
|
+
"0x34b0bcb5e19b48a8",
|
|
3173
|
+
"0x391c0cb3c5c95a63",
|
|
3174
|
+
"0x4ed8aa4ae3418acb",
|
|
3175
|
+
"0x5b9cca4f7763e373",
|
|
3176
|
+
"0x682e6ff3d6b2b8a3",
|
|
3177
|
+
"0x748f82ee5defb2fc",
|
|
3178
|
+
"0x78a5636f43172f60",
|
|
3179
|
+
"0x84c87814a1f0ab72",
|
|
3180
|
+
"0x8cc702081a6439ec",
|
|
3181
|
+
"0x90befffa23631e28",
|
|
3182
|
+
"0xa4506cebde82bde9",
|
|
3183
|
+
"0xbef9a3f7b2c67915",
|
|
3184
|
+
"0xc67178f2e372532b",
|
|
3185
|
+
"0xca273eceea26619c",
|
|
3186
|
+
"0xd186b8c721c0c207",
|
|
3187
|
+
"0xeada7dd6cde0eb1e",
|
|
3188
|
+
"0xf57d4f7fee6ed178",
|
|
3189
|
+
"0x06f067aa72176fba",
|
|
3190
|
+
"0x0a637dc5a2c898a6",
|
|
3191
|
+
"0x113f9804bef90dae",
|
|
3192
|
+
"0x1b710b35131c471b",
|
|
3193
|
+
"0x28db77f523047d84",
|
|
3194
|
+
"0x32caab7b40c72493",
|
|
3195
|
+
"0x3c9ebe0a15c9bebc",
|
|
3196
|
+
"0x431d67c49c100d4c",
|
|
3197
|
+
"0x4cc5d4becb3e42b6",
|
|
3198
|
+
"0x597f299cfc657e2a",
|
|
3199
|
+
"0x5fcb6fab3ad6faec",
|
|
3200
|
+
"0x6c44198c4a475817"
|
|
3201
|
+
].map((T) => BigInt(T))), b = a[0], x = a[1], H = /* @__PURE__ */ new Uint32Array(80), u = /* @__PURE__ */ new Uint32Array(80);
|
|
3202
|
+
class S extends t.HashMD {
|
|
3203
|
+
constructor(_ = 64) {
|
|
3204
|
+
super(128, _, 16, !1), this.Ah = t.SHA512_IV[0] | 0, this.Al = t.SHA512_IV[1] | 0, this.Bh = t.SHA512_IV[2] | 0, this.Bl = t.SHA512_IV[3] | 0, this.Ch = t.SHA512_IV[4] | 0, this.Cl = t.SHA512_IV[5] | 0, this.Dh = t.SHA512_IV[6] | 0, this.Dl = t.SHA512_IV[7] | 0, this.Eh = t.SHA512_IV[8] | 0, this.El = t.SHA512_IV[9] | 0, this.Fh = t.SHA512_IV[10] | 0, this.Fl = t.SHA512_IV[11] | 0, this.Gh = t.SHA512_IV[12] | 0, this.Gl = t.SHA512_IV[13] | 0, this.Hh = t.SHA512_IV[14] | 0, this.Hl = t.SHA512_IV[15] | 0;
|
|
1206
3205
|
}
|
|
3206
|
+
// prettier-ignore
|
|
1207
3207
|
get() {
|
|
1208
|
-
const {
|
|
1209
|
-
return [
|
|
1210
|
-
}
|
|
1211
|
-
set(a, d, f, p) {
|
|
1212
|
-
this.A = a | 0, this.B = d | 0, this.C = f | 0, this.D = p | 0;
|
|
1213
|
-
}
|
|
1214
|
-
process(a, d) {
|
|
1215
|
-
for (let U = 0; U < 16; U++, d += 4)
|
|
1216
|
-
b[U] = a.getUint32(d, !0);
|
|
1217
|
-
let { A: f, B: p, C: l, D: S } = this;
|
|
1218
|
-
for (let U = 0; U < 64; U++) {
|
|
1219
|
-
let k, F, v;
|
|
1220
|
-
U < 16 ? (k = (0, t.Chi)(p, l, S), F = U, v = [7, 12, 17, 22]) : U < 32 ? (k = (0, t.Chi)(S, p, l), F = (5 * U + 1) % 16, v = [5, 9, 14, 20]) : U < 48 ? (k = p ^ l ^ S, F = (3 * U + 5) % 16, v = [4, 11, 16, 23]) : (k = l ^ (p | ~S), F = 7 * U % 16, v = [6, 10, 15, 21]), k = k + f + n[U] + b[F], f = S, S = l, l = p, p = p + (0, e.rotl)(k, v[U % 4]);
|
|
1221
|
-
}
|
|
1222
|
-
f = f + this.A | 0, p = p + this.B | 0, l = l + this.C | 0, S = S + this.D | 0, this.set(f, p, l, S);
|
|
1223
|
-
}
|
|
1224
|
-
roundClean() {
|
|
1225
|
-
(0, e.clean)(b);
|
|
1226
|
-
}
|
|
1227
|
-
destroy() {
|
|
1228
|
-
this.set(0, 0, 0, 0), (0, e.clean)(this.buffer);
|
|
1229
|
-
}
|
|
1230
|
-
}
|
|
1231
|
-
N.MD5 = x, N.md5 = (0, e.createHasher)(() => new x());
|
|
1232
|
-
const H = /* @__PURE__ */ Uint8Array.from([
|
|
1233
|
-
7,
|
|
1234
|
-
4,
|
|
1235
|
-
13,
|
|
1236
|
-
1,
|
|
1237
|
-
10,
|
|
1238
|
-
6,
|
|
1239
|
-
15,
|
|
1240
|
-
3,
|
|
1241
|
-
12,
|
|
1242
|
-
0,
|
|
1243
|
-
9,
|
|
1244
|
-
5,
|
|
1245
|
-
2,
|
|
1246
|
-
14,
|
|
1247
|
-
11,
|
|
1248
|
-
8
|
|
1249
|
-
]), u = Uint8Array.from(new Array(16).fill(0).map((B, a) => a)), A = u.map((B) => (9 * B + 5) % 16), m = /* @__PURE__ */ (() => {
|
|
1250
|
-
const d = [[u], [A]];
|
|
1251
|
-
for (let f = 0; f < 4; f++)
|
|
1252
|
-
for (let p of d)
|
|
1253
|
-
p.push(p[f].map((l) => H[l]));
|
|
1254
|
-
return d;
|
|
1255
|
-
})(), w = m[0], I = m[1], C = /* @__PURE__ */ [
|
|
1256
|
-
[11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],
|
|
1257
|
-
[12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],
|
|
1258
|
-
[13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],
|
|
1259
|
-
[14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],
|
|
1260
|
-
[15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5]
|
|
1261
|
-
].map((B) => Uint8Array.from(B)), R = /* @__PURE__ */ w.map((B, a) => B.map((d) => C[a][d])), M = /* @__PURE__ */ I.map((B, a) => B.map((d) => C[a][d])), y = /* @__PURE__ */ Uint32Array.from([
|
|
1262
|
-
0,
|
|
1263
|
-
1518500249,
|
|
1264
|
-
1859775393,
|
|
1265
|
-
2400959708,
|
|
1266
|
-
2840853838
|
|
1267
|
-
]), O = /* @__PURE__ */ Uint32Array.from([
|
|
1268
|
-
1352829926,
|
|
1269
|
-
1548603684,
|
|
1270
|
-
1836072691,
|
|
1271
|
-
2053994217,
|
|
1272
|
-
0
|
|
1273
|
-
]);
|
|
1274
|
-
function L(B, a, d, f) {
|
|
1275
|
-
return B === 0 ? a ^ d ^ f : B === 1 ? a & d | ~a & f : B === 2 ? (a | ~d) ^ f : B === 3 ? a & f | d & ~f : a ^ (d | ~f);
|
|
1276
|
-
}
|
|
1277
|
-
const E = /* @__PURE__ */ new Uint32Array(16);
|
|
1278
|
-
class D extends t.HashMD {
|
|
1279
|
-
constructor() {
|
|
1280
|
-
super(64, 20, 8, !0), this.h0 = 1732584193, this.h1 = -271733879, this.h2 = -1732584194, this.h3 = 271733878, this.h4 = -1009589776;
|
|
3208
|
+
const { Ah: _, Al: C, Bh: p, Bl: w, Ch: U, Cl: E, Dh: o, Dl: f, Eh: d, El: L, Fh: A, Fl: m, Gh: F, Gl: O, Hh: v, Hl: q } = this;
|
|
3209
|
+
return [_, C, p, w, U, E, o, f, d, L, A, m, F, O, v, q];
|
|
1281
3210
|
}
|
|
1282
|
-
|
|
1283
|
-
|
|
1284
|
-
|
|
1285
|
-
}
|
|
1286
|
-
|
|
1287
|
-
|
|
1288
|
-
|
|
1289
|
-
|
|
1290
|
-
|
|
1291
|
-
|
|
1292
|
-
|
|
1293
|
-
|
|
1294
|
-
|
|
1295
|
-
|
|
1296
|
-
|
|
1297
|
-
|
|
1298
|
-
|
|
1299
|
-
for (let Q = 0; Q < 16; Q++) {
|
|
1300
|
-
const et = (0, e.rotl)(p + L(T, S, k, v) + E[X[Q]] + P, at[Q]) + g | 0;
|
|
1301
|
-
p = g, g = v, v = (0, e.rotl)(k, 10) | 0, k = S, S = et;
|
|
1302
|
-
}
|
|
3211
|
+
// prettier-ignore
|
|
3212
|
+
set(_, C, p, w, U, E, o, f, d, L, A, m, F, O, v, q) {
|
|
3213
|
+
this.Ah = _ | 0, this.Al = C | 0, this.Bh = p | 0, this.Bl = w | 0, this.Ch = U | 0, this.Cl = E | 0, this.Dh = o | 0, this.Dl = f | 0, this.Eh = d | 0, this.El = L | 0, this.Fh = A | 0, this.Fl = m | 0, this.Gh = F | 0, this.Gl = O | 0, this.Hh = v | 0, this.Hl = q | 0;
|
|
3214
|
+
}
|
|
3215
|
+
process(_, C) {
|
|
3216
|
+
for (let y = 0; y < 16; y++, C += 4)
|
|
3217
|
+
H[y] = _.getUint32(C), u[y] = _.getUint32(C += 4);
|
|
3218
|
+
for (let y = 16; y < 80; y++) {
|
|
3219
|
+
const V = H[y - 15] | 0, k = u[y - 15] | 0, M = e.rotrSH(V, k, 1) ^ e.rotrSH(V, k, 8) ^ e.shrSH(V, k, 7), z = e.rotrSL(V, k, 1) ^ e.rotrSL(V, k, 8) ^ e.shrSL(V, k, 7), P = H[y - 2] | 0, K = u[y - 2] | 0, it = e.rotrSH(P, K, 19) ^ e.rotrBH(P, K, 61) ^ e.shrSH(P, K, 6), ot = e.rotrSL(P, K, 19) ^ e.rotrBL(P, K, 61) ^ e.shrSL(P, K, 6), ct = e.add4L(z, ot, u[y - 7], u[y - 16]), at = e.add4H(ct, M, it, H[y - 7], H[y - 16]);
|
|
3220
|
+
H[y] = at | 0, u[y] = ct | 0;
|
|
3221
|
+
}
|
|
3222
|
+
let { Ah: p, Al: w, Bh: U, Bl: E, Ch: o, Cl: f, Dh: d, Dl: L, Eh: A, El: m, Fh: F, Fl: O, Gh: v, Gl: q, Hh: s, Hl: l } = this;
|
|
3223
|
+
for (let y = 0; y < 80; y++) {
|
|
3224
|
+
const V = e.rotrSH(A, m, 14) ^ e.rotrSH(A, m, 18) ^ e.rotrBH(A, m, 41), k = e.rotrSL(A, m, 14) ^ e.rotrSL(A, m, 18) ^ e.rotrBL(A, m, 41), M = A & F ^ ~A & v, z = m & O ^ ~m & q, P = e.add5L(l, k, z, x[y], u[y]), K = e.add5H(P, s, V, M, b[y], H[y]), it = P | 0, ot = e.rotrSH(p, w, 28) ^ e.rotrBH(p, w, 34) ^ e.rotrBH(p, w, 39), ct = e.rotrSL(p, w, 28) ^ e.rotrBL(p, w, 34) ^ e.rotrBL(p, w, 39), at = p & U ^ p & o ^ U & o, Dt = w & E ^ w & f ^ E & f;
|
|
3225
|
+
s = v | 0, l = q | 0, v = F | 0, q = O | 0, F = A | 0, O = m | 0, { h: A, l: m } = e.add(d | 0, L | 0, K | 0, it | 0), d = o | 0, L = f | 0, o = U | 0, f = E | 0, U = p | 0, E = w | 0;
|
|
3226
|
+
const At = e.add3L(it, ct, Dt);
|
|
3227
|
+
p = e.add3H(At, K, ot, at), w = At | 0;
|
|
1303
3228
|
}
|
|
1304
|
-
this.
|
|
3229
|
+
({ h: p, l: w } = e.add(this.Ah | 0, this.Al | 0, p | 0, w | 0)), { h: U, l: E } = e.add(this.Bh | 0, this.Bl | 0, U | 0, E | 0), { h: o, l: f } = e.add(this.Ch | 0, this.Cl | 0, o | 0, f | 0), { h: d, l: L } = e.add(this.Dh | 0, this.Dl | 0, d | 0, L | 0), { h: A, l: m } = e.add(this.Eh | 0, this.El | 0, A | 0, m | 0), { h: F, l: O } = e.add(this.Fh | 0, this.Fl | 0, F | 0, O | 0), { h: v, l: q } = e.add(this.Gh | 0, this.Gl | 0, v | 0, q | 0), { h: s, l } = e.add(this.Hh | 0, this.Hl | 0, s | 0, l | 0), this.set(p, w, U, E, o, f, d, L, A, m, F, O, v, q, s, l);
|
|
1305
3230
|
}
|
|
1306
3231
|
roundClean() {
|
|
1307
|
-
(0,
|
|
3232
|
+
(0, n.clean)(H, u);
|
|
1308
3233
|
}
|
|
1309
3234
|
destroy() {
|
|
1310
|
-
|
|
3235
|
+
(0, n.clean)(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
|
|
1311
3236
|
}
|
|
1312
3237
|
}
|
|
1313
|
-
|
|
1314
|
-
|
|
1315
|
-
|
|
1316
|
-
|
|
1317
|
-
if (Wt) return ot;
|
|
1318
|
-
Wt = 1, Object.defineProperty(ot, "__esModule", { value: !0 }), ot.ripemd160 = ot.RIPEMD160 = void 0;
|
|
1319
|
-
const t = /* @__PURE__ */ We();
|
|
1320
|
-
return ot.RIPEMD160 = t.RIPEMD160, ot.ripemd160 = t.ripemd160, ot;
|
|
1321
|
-
}
|
|
1322
|
-
var Y = {}, qt;
|
|
1323
|
-
function ys() {
|
|
1324
|
-
if (qt) return Y;
|
|
1325
|
-
qt = 1, Object.defineProperty(Y, "__esModule", { value: !0 }), Y.sha224 = Y.SHA224 = Y.sha256 = Y.SHA256 = void 0;
|
|
1326
|
-
const t = /* @__PURE__ */ ce();
|
|
1327
|
-
return Y.SHA256 = t.SHA256, Y.sha256 = t.sha256, Y.SHA224 = t.SHA224, Y.sha224 = t.sha224, Y;
|
|
1328
|
-
}
|
|
1329
|
-
var W = {}, Kt;
|
|
1330
|
-
function gs() {
|
|
1331
|
-
if (Kt) return W;
|
|
1332
|
-
Kt = 1, Object.defineProperty(W, "__esModule", { value: !0 }), W.sha512_256 = W.SHA512_256 = W.sha512_224 = W.SHA512_224 = W.sha384 = W.SHA384 = W.sha512 = W.SHA512 = void 0;
|
|
1333
|
-
const t = /* @__PURE__ */ ce();
|
|
1334
|
-
return W.SHA512 = t.SHA512, W.sha512 = t.sha512, W.SHA384 = t.SHA384, W.sha384 = t.sha384, W.SHA512_224 = t.SHA512_224, W.sha512_224 = t.sha512_224, W.SHA512_256 = t.SHA512_256, W.sha512_256 = t.sha512_256, W;
|
|
1335
|
-
}
|
|
1336
|
-
function qe(t) {
|
|
1337
|
-
return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
|
|
1338
|
-
}
|
|
1339
|
-
function Nt(t, e = "") {
|
|
1340
|
-
if (!Number.isSafeInteger(t) || t < 0) {
|
|
1341
|
-
const s = e && `"${e}" `;
|
|
1342
|
-
throw new Error(`${s}expected integer >= 0, got ${t}`);
|
|
1343
|
-
}
|
|
1344
|
-
}
|
|
1345
|
-
function It(t, e, s = "") {
|
|
1346
|
-
const i = qe(t), o = t?.length, r = e !== void 0;
|
|
1347
|
-
if (!i || r && o !== e) {
|
|
1348
|
-
const n = s && `"${s}" `, h = r ? ` of length ${e}` : "", b = i ? `length=${o}` : `type=${typeof t}`;
|
|
1349
|
-
throw new Error(n + "expected Uint8Array" + h + ", got " + b);
|
|
1350
|
-
}
|
|
1351
|
-
return t;
|
|
1352
|
-
}
|
|
1353
|
-
function Xt(t, e = !0) {
|
|
1354
|
-
if (t.destroyed)
|
|
1355
|
-
throw new Error("Hash instance has been destroyed");
|
|
1356
|
-
if (e && t.finished)
|
|
1357
|
-
throw new Error("Hash#digest() has already been called");
|
|
1358
|
-
}
|
|
1359
|
-
function Ke(t, e) {
|
|
1360
|
-
It(t, void 0, "digestInto() output");
|
|
1361
|
-
const s = e.outputLen;
|
|
1362
|
-
if (t.length < s)
|
|
1363
|
-
throw new Error('"digestInto() output" expected to be of length >=' + s);
|
|
1364
|
-
}
|
|
1365
|
-
function Ne(t) {
|
|
1366
|
-
return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
|
|
1367
|
-
}
|
|
1368
|
-
function he(...t) {
|
|
1369
|
-
for (let e = 0; e < t.length; e++)
|
|
1370
|
-
t[e].fill(0);
|
|
1371
|
-
}
|
|
1372
|
-
const Xe = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
1373
|
-
function Je(t) {
|
|
1374
|
-
return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
|
|
1375
|
-
}
|
|
1376
|
-
function Qe(t) {
|
|
1377
|
-
for (let e = 0; e < t.length; e++)
|
|
1378
|
-
t[e] = Je(t[e]);
|
|
1379
|
-
return t;
|
|
1380
|
-
}
|
|
1381
|
-
const Jt = Xe ? (t) => t : Qe;
|
|
1382
|
-
function _s(...t) {
|
|
1383
|
-
let e = 0;
|
|
1384
|
-
for (let i = 0; i < t.length; i++) {
|
|
1385
|
-
const o = t[i];
|
|
1386
|
-
It(o), e += o.length;
|
|
1387
|
-
}
|
|
1388
|
-
const s = new Uint8Array(e);
|
|
1389
|
-
for (let i = 0, o = 0; i < t.length; i++) {
|
|
1390
|
-
const r = t[i];
|
|
1391
|
-
s.set(r, o), o += r.length;
|
|
1392
|
-
}
|
|
1393
|
-
return s;
|
|
1394
|
-
}
|
|
1395
|
-
function Ye(t, e = {}) {
|
|
1396
|
-
const s = (o, r) => t(r).update(o).digest(), i = t(void 0);
|
|
1397
|
-
return s.outputLen = i.outputLen, s.blockLen = i.blockLen, s.create = (o) => t(o), Object.assign(s, e), Object.freeze(s);
|
|
1398
|
-
}
|
|
1399
|
-
function ws(t = 32) {
|
|
1400
|
-
const e = typeof globalThis == "object" ? globalThis.crypto : null;
|
|
1401
|
-
if (typeof e?.getRandomValues != "function")
|
|
1402
|
-
throw new Error("crypto.getRandomValues must be defined");
|
|
1403
|
-
return e.getRandomValues(new Uint8Array(t));
|
|
1404
|
-
}
|
|
1405
|
-
const ae = (t) => ({
|
|
1406
|
-
oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, t])
|
|
1407
|
-
}), _t = /* @__PURE__ */ BigInt(2 ** 32 - 1), Qt = /* @__PURE__ */ BigInt(32);
|
|
1408
|
-
function Ze(t, e = !1) {
|
|
1409
|
-
return e ? { h: Number(t & _t), l: Number(t >> Qt & _t) } : { h: Number(t >> Qt & _t) | 0, l: Number(t & _t) | 0 };
|
|
1410
|
-
}
|
|
1411
|
-
function ze(t, e = !1) {
|
|
1412
|
-
const s = t.length;
|
|
1413
|
-
let i = new Uint32Array(s), o = new Uint32Array(s);
|
|
1414
|
-
for (let r = 0; r < s; r++) {
|
|
1415
|
-
const { h: n, l: h } = Ze(t[r], e);
|
|
1416
|
-
[i[r], o[r]] = [n, h];
|
|
1417
|
-
}
|
|
1418
|
-
return [i, o];
|
|
1419
|
-
}
|
|
1420
|
-
const $e = (t, e, s) => t << s | e >>> 32 - s, ts = (t, e, s) => e << s | t >>> 32 - s, es = (t, e, s) => e << s - 32 | t >>> 64 - s, ss = (t, e, s) => t << s - 32 | e >>> 64 - s, ns = BigInt(0), bt = BigInt(1), rs = BigInt(2), is = BigInt(7), os = BigInt(256), cs = BigInt(113), fe = [], de = [], ue = [];
|
|
1421
|
-
for (let t = 0, e = bt, s = 1, i = 0; t < 24; t++) {
|
|
1422
|
-
[s, i] = [i, (2 * s + 3 * i) % 5], fe.push(2 * (5 * i + s)), de.push((t + 1) * (t + 2) / 2 % 64);
|
|
1423
|
-
let o = ns;
|
|
1424
|
-
for (let r = 0; r < 7; r++)
|
|
1425
|
-
e = (e << bt ^ (e >> is) * cs) % os, e & rs && (o ^= bt << (bt << BigInt(r)) - bt);
|
|
1426
|
-
ue.push(o);
|
|
1427
|
-
}
|
|
1428
|
-
const le = ze(ue, !0), hs = le[0], as = le[1], Yt = (t, e, s) => s > 32 ? es(t, e, s) : $e(t, e, s), Zt = (t, e, s) => s > 32 ? ss(t, e, s) : ts(t, e, s);
|
|
1429
|
-
function fs(t, e = 24) {
|
|
1430
|
-
const s = new Uint32Array(10);
|
|
1431
|
-
for (let i = 24 - e; i < 24; i++) {
|
|
1432
|
-
for (let n = 0; n < 10; n++)
|
|
1433
|
-
s[n] = t[n] ^ t[n + 10] ^ t[n + 20] ^ t[n + 30] ^ t[n + 40];
|
|
1434
|
-
for (let n = 0; n < 10; n += 2) {
|
|
1435
|
-
const h = (n + 8) % 10, b = (n + 2) % 10, x = s[b], H = s[b + 1], u = Yt(x, H, 1) ^ s[h], A = Zt(x, H, 1) ^ s[h + 1];
|
|
1436
|
-
for (let m = 0; m < 50; m += 10)
|
|
1437
|
-
t[n + m] ^= u, t[n + m + 1] ^= A;
|
|
1438
|
-
}
|
|
1439
|
-
let o = t[2], r = t[3];
|
|
1440
|
-
for (let n = 0; n < 24; n++) {
|
|
1441
|
-
const h = de[n], b = Yt(o, r, h), x = Zt(o, r, h), H = fe[n];
|
|
1442
|
-
o = t[H], r = t[H + 1], t[H] = b, t[H + 1] = x;
|
|
1443
|
-
}
|
|
1444
|
-
for (let n = 0; n < 50; n += 10) {
|
|
1445
|
-
for (let h = 0; h < 10; h++)
|
|
1446
|
-
s[h] = t[n + h];
|
|
1447
|
-
for (let h = 0; h < 10; h++)
|
|
1448
|
-
t[n + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
|
|
1449
|
-
}
|
|
1450
|
-
t[0] ^= hs[i], t[1] ^= as[i];
|
|
1451
|
-
}
|
|
1452
|
-
he(s);
|
|
1453
|
-
}
|
|
1454
|
-
class Et {
|
|
1455
|
-
state;
|
|
1456
|
-
pos = 0;
|
|
1457
|
-
posOut = 0;
|
|
1458
|
-
finished = !1;
|
|
1459
|
-
state32;
|
|
1460
|
-
destroyed = !1;
|
|
1461
|
-
blockLen;
|
|
1462
|
-
suffix;
|
|
1463
|
-
outputLen;
|
|
1464
|
-
enableXOF = !1;
|
|
1465
|
-
rounds;
|
|
1466
|
-
// NOTE: we accept arguments in bytes instead of bits here.
|
|
1467
|
-
constructor(e, s, i, o = !1, r = 24) {
|
|
1468
|
-
if (this.blockLen = e, this.suffix = s, this.outputLen = i, this.enableXOF = o, this.rounds = r, Nt(i, "outputLen"), !(0 < e && e < 200))
|
|
1469
|
-
throw new Error("only keccak-f1600 function is supported");
|
|
1470
|
-
this.state = new Uint8Array(200), this.state32 = Ne(this.state);
|
|
1471
|
-
}
|
|
1472
|
-
clone() {
|
|
1473
|
-
return this._cloneInto();
|
|
1474
|
-
}
|
|
1475
|
-
keccak() {
|
|
1476
|
-
Jt(this.state32), fs(this.state32, this.rounds), Jt(this.state32), this.posOut = 0, this.pos = 0;
|
|
1477
|
-
}
|
|
1478
|
-
update(e) {
|
|
1479
|
-
Xt(this), It(e);
|
|
1480
|
-
const { blockLen: s, state: i } = this, o = e.length;
|
|
1481
|
-
for (let r = 0; r < o; ) {
|
|
1482
|
-
const n = Math.min(s - this.pos, o - r);
|
|
1483
|
-
for (let h = 0; h < n; h++)
|
|
1484
|
-
i[this.pos++] ^= e[r++];
|
|
1485
|
-
this.pos === s && this.keccak();
|
|
3238
|
+
J.SHA512 = S;
|
|
3239
|
+
class B extends S {
|
|
3240
|
+
constructor() {
|
|
3241
|
+
super(48), this.Ah = t.SHA384_IV[0] | 0, this.Al = t.SHA384_IV[1] | 0, this.Bh = t.SHA384_IV[2] | 0, this.Bl = t.SHA384_IV[3] | 0, this.Ch = t.SHA384_IV[4] | 0, this.Cl = t.SHA384_IV[5] | 0, this.Dh = t.SHA384_IV[6] | 0, this.Dl = t.SHA384_IV[7] | 0, this.Eh = t.SHA384_IV[8] | 0, this.El = t.SHA384_IV[9] | 0, this.Fh = t.SHA384_IV[10] | 0, this.Fl = t.SHA384_IV[11] | 0, this.Gh = t.SHA384_IV[12] | 0, this.Gl = t.SHA384_IV[13] | 0, this.Hh = t.SHA384_IV[14] | 0, this.Hl = t.SHA384_IV[15] | 0;
|
|
1486
3242
|
}
|
|
1487
|
-
return this;
|
|
1488
|
-
}
|
|
1489
|
-
finish() {
|
|
1490
|
-
if (this.finished)
|
|
1491
|
-
return;
|
|
1492
|
-
this.finished = !0;
|
|
1493
|
-
const { state: e, suffix: s, pos: i, blockLen: o } = this;
|
|
1494
|
-
e[i] ^= s, (s & 128) !== 0 && i === o - 1 && this.keccak(), e[o - 1] ^= 128, this.keccak();
|
|
1495
3243
|
}
|
|
1496
|
-
|
|
1497
|
-
|
|
1498
|
-
|
|
1499
|
-
|
|
1500
|
-
|
|
1501
|
-
|
|
1502
|
-
|
|
3244
|
+
J.SHA384 = B;
|
|
3245
|
+
const g = /* @__PURE__ */ Uint32Array.from([
|
|
3246
|
+
2352822216,
|
|
3247
|
+
424955298,
|
|
3248
|
+
1944164710,
|
|
3249
|
+
2312950998,
|
|
3250
|
+
502970286,
|
|
3251
|
+
855612546,
|
|
3252
|
+
1738396948,
|
|
3253
|
+
1479516111,
|
|
3254
|
+
258812777,
|
|
3255
|
+
2077511080,
|
|
3256
|
+
2011393907,
|
|
3257
|
+
79989058,
|
|
3258
|
+
1067287976,
|
|
3259
|
+
1780299464,
|
|
3260
|
+
286451373,
|
|
3261
|
+
2446758561
|
|
3262
|
+
]), I = /* @__PURE__ */ Uint32Array.from([
|
|
3263
|
+
573645204,
|
|
3264
|
+
4230739756,
|
|
3265
|
+
2673172387,
|
|
3266
|
+
3360449730,
|
|
3267
|
+
596883563,
|
|
3268
|
+
1867755857,
|
|
3269
|
+
2520282905,
|
|
3270
|
+
1497426621,
|
|
3271
|
+
2519219938,
|
|
3272
|
+
2827943907,
|
|
3273
|
+
3193839141,
|
|
3274
|
+
1401305490,
|
|
3275
|
+
721525244,
|
|
3276
|
+
746961066,
|
|
3277
|
+
246885852,
|
|
3278
|
+
2177182882
|
|
3279
|
+
]);
|
|
3280
|
+
class D extends S {
|
|
3281
|
+
constructor() {
|
|
3282
|
+
super(28), this.Ah = g[0] | 0, this.Al = g[1] | 0, this.Bh = g[2] | 0, this.Bl = g[3] | 0, this.Ch = g[4] | 0, this.Cl = g[5] | 0, this.Dh = g[6] | 0, this.Dl = g[7] | 0, this.Eh = g[8] | 0, this.El = g[9] | 0, this.Fh = g[10] | 0, this.Fl = g[11] | 0, this.Gh = g[12] | 0, this.Gl = g[13] | 0, this.Hh = g[14] | 0, this.Hl = g[15] | 0;
|
|
1503
3283
|
}
|
|
1504
|
-
return e;
|
|
1505
3284
|
}
|
|
1506
|
-
|
|
1507
|
-
|
|
1508
|
-
|
|
1509
|
-
|
|
1510
|
-
|
|
1511
|
-
xof(e) {
|
|
1512
|
-
return Nt(e), this.xofInto(new Uint8Array(e));
|
|
1513
|
-
}
|
|
1514
|
-
digestInto(e) {
|
|
1515
|
-
if (Ke(e, this), this.finished)
|
|
1516
|
-
throw new Error("digest() was already called");
|
|
1517
|
-
return this.writeInto(e), this.destroy(), e;
|
|
1518
|
-
}
|
|
1519
|
-
digest() {
|
|
1520
|
-
return this.digestInto(new Uint8Array(this.outputLen));
|
|
1521
|
-
}
|
|
1522
|
-
destroy() {
|
|
1523
|
-
this.destroyed = !0, he(this.state);
|
|
1524
|
-
}
|
|
1525
|
-
_cloneInto(e) {
|
|
1526
|
-
const { blockLen: s, suffix: i, outputLen: o, rounds: r, enableXOF: n } = this;
|
|
1527
|
-
return e ||= new Et(s, i, o, n, r), e.state32.set(this.state32), e.pos = this.pos, e.posOut = this.posOut, e.finished = this.finished, e.rounds = r, e.suffix = i, e.outputLen = o, e.enableXOF = n, e.destroyed = this.destroyed, e;
|
|
1528
|
-
}
|
|
1529
|
-
}
|
|
1530
|
-
const be = (t, e, s, i = {}) => Ye((o = {}) => new Et(e, t, o.dkLen === void 0 ? s : o.dkLen, !0), i), Ss = /* @__PURE__ */ be(31, 168, 16, /* @__PURE__ */ ae(11)), Is = /* @__PURE__ */ be(31, 136, 32, /* @__PURE__ */ ae(12));
|
|
1531
|
-
class xe extends se {
|
|
1532
|
-
constructor(e, s) {
|
|
1533
|
-
super(), this.finished = !1, this.destroyed = !1, $t(e);
|
|
1534
|
-
const i = Ut(s);
|
|
1535
|
-
if (this.iHash = e.create(), typeof this.iHash.update != "function")
|
|
1536
|
-
throw new Error("Expected instance of class which extends utils.Hash");
|
|
1537
|
-
this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
|
|
1538
|
-
const o = this.blockLen, r = new Uint8Array(o);
|
|
1539
|
-
r.set(i.length > o ? e.create().update(i).digest() : i);
|
|
1540
|
-
for (let n = 0; n < r.length; n++)
|
|
1541
|
-
r[n] ^= 54;
|
|
1542
|
-
this.iHash.update(r), this.oHash = e.create();
|
|
1543
|
-
for (let n = 0; n < r.length; n++)
|
|
1544
|
-
r[n] ^= 106;
|
|
1545
|
-
this.oHash.update(r), ct(r);
|
|
1546
|
-
}
|
|
1547
|
-
update(e) {
|
|
1548
|
-
return St(this), this.iHash.update(e), this;
|
|
1549
|
-
}
|
|
1550
|
-
digestInto(e) {
|
|
1551
|
-
St(this), ht(e, this.outputLen), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy();
|
|
1552
|
-
}
|
|
1553
|
-
digest() {
|
|
1554
|
-
const e = new Uint8Array(this.oHash.outputLen);
|
|
1555
|
-
return this.digestInto(e), e;
|
|
1556
|
-
}
|
|
1557
|
-
_cloneInto(e) {
|
|
1558
|
-
e || (e = Object.create(Object.getPrototypeOf(this), {}));
|
|
1559
|
-
const { oHash: s, iHash: i, finished: o, destroyed: r, blockLen: n, outputLen: h } = this;
|
|
1560
|
-
return e = e, e.finished = o, e.destroyed = r, e.blockLen = n, e.outputLen = h, e.oHash = s._cloneInto(e.oHash), e.iHash = i._cloneInto(e.iHash), e;
|
|
1561
|
-
}
|
|
1562
|
-
clone() {
|
|
1563
|
-
return this._cloneInto();
|
|
1564
|
-
}
|
|
1565
|
-
destroy() {
|
|
1566
|
-
this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
|
|
3285
|
+
J.SHA512_224 = D;
|
|
3286
|
+
class R extends S {
|
|
3287
|
+
constructor() {
|
|
3288
|
+
super(32), this.Ah = I[0] | 0, this.Al = I[1] | 0, this.Bh = I[2] | 0, this.Bl = I[3] | 0, this.Ch = I[4] | 0, this.Cl = I[5] | 0, this.Dh = I[6] | 0, this.Dl = I[7] | 0, this.Eh = I[8] | 0, this.El = I[9] | 0, this.Fh = I[10] | 0, this.Fl = I[11] | 0, this.Gh = I[12] | 0, this.Gl = I[13] | 0, this.Hh = I[14] | 0, this.Hl = I[15] | 0;
|
|
3289
|
+
}
|
|
1567
3290
|
}
|
|
3291
|
+
return J.SHA512_256 = R, J.sha256 = (0, n.createHasher)(() => new i()), J.sha224 = (0, n.createHasher)(() => new r()), J.sha512 = (0, n.createHasher)(() => new S()), J.sha384 = (0, n.createHasher)(() => new B()), J.sha512_256 = (0, n.createHasher)(() => new R()), J.sha512_224 = (0, n.createHasher)(() => new D()), J;
|
|
1568
3292
|
}
|
|
1569
|
-
|
|
1570
|
-
|
|
1571
|
-
|
|
1572
|
-
|
|
1573
|
-
const
|
|
1574
|
-
|
|
1575
|
-
throw new Error("iterations (c) should be >= 1");
|
|
1576
|
-
const b = Ct(e), x = Ct(s), H = new Uint8Array(n), u = He.create(t, b), A = u._cloneInto().update(x);
|
|
1577
|
-
return { c: r, dkLen: n, asyncTick: h, DK: H, PRF: u, PRFSalt: A };
|
|
3293
|
+
var Oe;
|
|
3294
|
+
function Zs() {
|
|
3295
|
+
if (Oe) return ft;
|
|
3296
|
+
Oe = 1, Object.defineProperty(ft, "__esModule", { value: !0 }), ft.sha224 = ft.SHA224 = ft.sha256 = ft.SHA256 = void 0;
|
|
3297
|
+
const t = /* @__PURE__ */ b0();
|
|
3298
|
+
return ft.SHA256 = t.SHA256, ft.sha256 = t.sha256, ft.SHA224 = t.SHA224, ft.sha224 = t.sha224, ft;
|
|
1578
3299
|
}
|
|
1579
|
-
|
|
1580
|
-
|
|
3300
|
+
var Q = {}, ve;
|
|
3301
|
+
function $s() {
|
|
3302
|
+
if (ve) return Q;
|
|
3303
|
+
ve = 1, Object.defineProperty(Q, "__esModule", { value: !0 }), Q.sha512_256 = Q.SHA512_256 = Q.sha512_224 = Q.SHA512_224 = Q.sha384 = Q.SHA384 = Q.sha512 = Q.SHA512 = void 0;
|
|
3304
|
+
const t = /* @__PURE__ */ b0();
|
|
3305
|
+
return Q.SHA512 = t.SHA512, Q.sha512 = t.sha512, Q.SHA384 = t.SHA384, Q.sha384 = t.sha384, Q.SHA512_224 = t.SHA512_224, Q.sha512_224 = t.sha512_224, Q.SHA512_256 = t.SHA512_256, Q.sha512_256 = t.sha512_256, Q;
|
|
1581
3306
|
}
|
|
1582
|
-
|
|
1583
|
-
|
|
1584
|
-
|
|
1585
|
-
|
|
1586
|
-
|
|
1587
|
-
|
|
1588
|
-
|
|
1589
|
-
|
|
1590
|
-
|
|
1591
|
-
|
|
1592
|
-
|
|
3307
|
+
var Mt = {}, ee = {}, Me;
|
|
3308
|
+
function Ts() {
|
|
3309
|
+
return Me || (Me = 1, (function(t) {
|
|
3310
|
+
Object.defineProperty(t, "__esModule", { value: !0 }), t.hmac = t.HMAC = void 0;
|
|
3311
|
+
const e = /* @__PURE__ */ Jt();
|
|
3312
|
+
class n extends e.Hash {
|
|
3313
|
+
constructor(i, r) {
|
|
3314
|
+
super(), this.finished = !1, this.destroyed = !1, (0, e.ahash)(i);
|
|
3315
|
+
const a = (0, e.toBytes)(r);
|
|
3316
|
+
if (this.iHash = i.create(), typeof this.iHash.update != "function")
|
|
3317
|
+
throw new Error("Expected instance of class which extends utils.Hash");
|
|
3318
|
+
this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
|
|
3319
|
+
const b = this.blockLen, x = new Uint8Array(b);
|
|
3320
|
+
x.set(a.length > b ? i.create().update(a).digest() : a);
|
|
3321
|
+
for (let H = 0; H < x.length; H++)
|
|
3322
|
+
x[H] ^= 54;
|
|
3323
|
+
this.iHash.update(x), this.oHash = i.create();
|
|
3324
|
+
for (let H = 0; H < x.length; H++)
|
|
3325
|
+
x[H] ^= 106;
|
|
3326
|
+
this.oHash.update(x), (0, e.clean)(x);
|
|
3327
|
+
}
|
|
3328
|
+
update(i) {
|
|
3329
|
+
return (0, e.aexists)(this), this.iHash.update(i), this;
|
|
3330
|
+
}
|
|
3331
|
+
digestInto(i) {
|
|
3332
|
+
(0, e.aexists)(this), (0, e.abytes)(i, this.outputLen), this.finished = !0, this.iHash.digestInto(i), this.oHash.update(i), this.oHash.digestInto(i), this.destroy();
|
|
3333
|
+
}
|
|
3334
|
+
digest() {
|
|
3335
|
+
const i = new Uint8Array(this.oHash.outputLen);
|
|
3336
|
+
return this.digestInto(i), i;
|
|
3337
|
+
}
|
|
3338
|
+
_cloneInto(i) {
|
|
3339
|
+
i || (i = Object.create(Object.getPrototypeOf(this), {}));
|
|
3340
|
+
const { oHash: r, iHash: a, finished: b, destroyed: x, blockLen: H, outputLen: u } = this;
|
|
3341
|
+
return i = i, i.finished = b, i.destroyed = x, i.blockLen = H, i.outputLen = u, i.oHash = r._cloneInto(i.oHash), i.iHash = a._cloneInto(i.iHash), i;
|
|
3342
|
+
}
|
|
3343
|
+
clone() {
|
|
3344
|
+
return this._cloneInto();
|
|
3345
|
+
}
|
|
3346
|
+
destroy() {
|
|
3347
|
+
this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
|
|
3348
|
+
}
|
|
1593
3349
|
}
|
|
1594
|
-
|
|
1595
|
-
|
|
3350
|
+
t.HMAC = n;
|
|
3351
|
+
const h = (c, i, r) => new n(c, i).update(r).digest();
|
|
3352
|
+
t.hmac = h, t.hmac.create = (c, i) => new n(c, i);
|
|
3353
|
+
})(ee)), ee;
|
|
1596
3354
|
}
|
|
1597
|
-
|
|
1598
|
-
|
|
1599
|
-
|
|
1600
|
-
|
|
1601
|
-
|
|
1602
|
-
|
|
1603
|
-
|
|
1604
|
-
(0, e.
|
|
1605
|
-
|
|
1606
|
-
if ((0, e.anumber)(u), (0, e.anumber)(A), (0, e.anumber)(m), u < 1)
|
|
3355
|
+
var Ge;
|
|
3356
|
+
function tn() {
|
|
3357
|
+
if (Ge) return Mt;
|
|
3358
|
+
Ge = 1, Object.defineProperty(Mt, "__esModule", { value: !0 }), Mt.pbkdf2 = c, Mt.pbkdf2Async = i;
|
|
3359
|
+
const t = /* @__PURE__ */ Ts(), e = /* @__PURE__ */ Jt();
|
|
3360
|
+
function n(r, a, b, x) {
|
|
3361
|
+
(0, e.ahash)(r);
|
|
3362
|
+
const H = (0, e.checkOpts)({ dkLen: 32, asyncTick: 10 }, x), { c: u, dkLen: S, asyncTick: B } = H;
|
|
3363
|
+
if ((0, e.anumber)(u), (0, e.anumber)(S), (0, e.anumber)(B), u < 1)
|
|
1607
3364
|
throw new Error("iterations (c) should be >= 1");
|
|
1608
|
-
const
|
|
1609
|
-
return { c: u, dkLen:
|
|
3365
|
+
const g = (0, e.kdfInputToBytes)(a), I = (0, e.kdfInputToBytes)(b), D = new Uint8Array(S), R = t.hmac.create(r, g), T = R._cloneInto().update(I);
|
|
3366
|
+
return { c: u, dkLen: S, asyncTick: B, DK: D, PRF: R, PRFSalt: T };
|
|
1610
3367
|
}
|
|
1611
|
-
function
|
|
1612
|
-
return
|
|
3368
|
+
function h(r, a, b, x, H) {
|
|
3369
|
+
return r.destroy(), a.destroy(), x && x.destroy(), (0, e.clean)(H), b;
|
|
1613
3370
|
}
|
|
1614
|
-
function
|
|
1615
|
-
const { c: H, dkLen: u, DK:
|
|
3371
|
+
function c(r, a, b, x) {
|
|
3372
|
+
const { c: H, dkLen: u, DK: S, PRF: B, PRFSalt: g } = n(r, a, b, x);
|
|
1616
3373
|
let I;
|
|
1617
|
-
const
|
|
1618
|
-
for (let
|
|
1619
|
-
const
|
|
1620
|
-
R.setInt32(0,
|
|
1621
|
-
for (let
|
|
1622
|
-
|
|
1623
|
-
for (let
|
|
1624
|
-
|
|
3374
|
+
const D = new Uint8Array(4), R = (0, e.createView)(D), T = new Uint8Array(B.outputLen);
|
|
3375
|
+
for (let _ = 1, C = 0; C < u; _++, C += B.outputLen) {
|
|
3376
|
+
const p = S.subarray(C, C + B.outputLen);
|
|
3377
|
+
R.setInt32(0, _, !1), (I = g._cloneInto(I)).update(D).digestInto(T), p.set(T.subarray(0, p.length));
|
|
3378
|
+
for (let w = 1; w < H; w++) {
|
|
3379
|
+
B._cloneInto(I).update(T).digestInto(T);
|
|
3380
|
+
for (let U = 0; U < p.length; U++)
|
|
3381
|
+
p[U] ^= T[U];
|
|
1625
3382
|
}
|
|
1626
3383
|
}
|
|
1627
|
-
return
|
|
1628
|
-
}
|
|
1629
|
-
async function r
|
|
1630
|
-
const { c: H, dkLen: u, asyncTick:
|
|
1631
|
-
let
|
|
1632
|
-
const R = new Uint8Array(4),
|
|
1633
|
-
for (let
|
|
1634
|
-
const
|
|
1635
|
-
|
|
1636
|
-
|
|
1637
|
-
for (let
|
|
1638
|
-
|
|
3384
|
+
return h(B, g, S, I, T);
|
|
3385
|
+
}
|
|
3386
|
+
async function i(r, a, b, x) {
|
|
3387
|
+
const { c: H, dkLen: u, asyncTick: S, DK: B, PRF: g, PRFSalt: I } = n(r, a, b, x);
|
|
3388
|
+
let D;
|
|
3389
|
+
const R = new Uint8Array(4), T = (0, e.createView)(R), _ = new Uint8Array(g.outputLen);
|
|
3390
|
+
for (let C = 1, p = 0; p < u; C++, p += g.outputLen) {
|
|
3391
|
+
const w = B.subarray(p, p + g.outputLen);
|
|
3392
|
+
T.setInt32(0, C, !1), (D = I._cloneInto(D)).update(R).digestInto(_), w.set(_.subarray(0, w.length)), await (0, e.asyncLoop)(H - 1, S, () => {
|
|
3393
|
+
g._cloneInto(D).update(_).digestInto(_);
|
|
3394
|
+
for (let U = 0; U < w.length; U++)
|
|
3395
|
+
w[U] ^= _[U];
|
|
1639
3396
|
});
|
|
1640
3397
|
}
|
|
1641
|
-
return
|
|
3398
|
+
return h(g, I, B, D, _);
|
|
1642
3399
|
}
|
|
1643
|
-
return
|
|
3400
|
+
return Mt;
|
|
1644
3401
|
}
|
|
1645
3402
|
export {
|
|
1646
|
-
|
|
1647
|
-
|
|
1648
|
-
|
|
1649
|
-
|
|
1650
|
-
|
|
1651
|
-
|
|
1652
|
-
|
|
1653
|
-
|
|
1654
|
-
|
|
1655
|
-
|
|
1656
|
-
|
|
1657
|
-
|
|
1658
|
-
|
|
1659
|
-
|
|
1660
|
-
|
|
1661
|
-
|
|
1662
|
-
|
|
1663
|
-
|
|
1664
|
-
|
|
1665
|
-
|
|
1666
|
-
|
|
1667
|
-
|
|
1668
|
-
|
|
1669
|
-
|
|
1670
|
-
|
|
1671
|
-
|
|
1672
|
-
|
|
3403
|
+
js as A,
|
|
3404
|
+
We as B,
|
|
3405
|
+
Xs as a,
|
|
3406
|
+
Ks as b,
|
|
3407
|
+
Js as c,
|
|
3408
|
+
Rs as d,
|
|
3409
|
+
Ht as e,
|
|
3410
|
+
Ws as f,
|
|
3411
|
+
zs as g,
|
|
3412
|
+
Qs as h,
|
|
3413
|
+
m0 as i,
|
|
3414
|
+
hs as j,
|
|
3415
|
+
os as k,
|
|
3416
|
+
oe as l,
|
|
3417
|
+
tn as m,
|
|
3418
|
+
$s as n,
|
|
3419
|
+
Zs as o,
|
|
3420
|
+
Ys as p,
|
|
3421
|
+
Jt as q,
|
|
3422
|
+
Ns as r,
|
|
3423
|
+
Ms as s,
|
|
3424
|
+
K0 as t,
|
|
3425
|
+
T0 as u,
|
|
3426
|
+
ie as v,
|
|
3427
|
+
Ps as w,
|
|
3428
|
+
qs as x,
|
|
3429
|
+
Gs as y,
|
|
3430
|
+
Vt as z
|
|
1673
3431
|
};
|