@coinbase/cdp-core 0.0.83 → 0.0.85
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/esm/index.native102.js +2 -2
- package/dist/esm/index.native104.js +1 -1
- package/dist/esm/index.native155.js +1 -1
- package/dist/esm/index.native157.js +102 -18
- package/dist/esm/index.native158.js +20 -80
- package/dist/esm/index.native159.js +79 -103
- package/dist/esm/index.native163.js +1 -1
- package/dist/esm/index.native172.js +38 -7
- package/dist/esm/index.native174.js +67 -375
- package/dist/esm/index.native175.js +34 -835
- package/dist/esm/index.native176.js +20 -38
- package/dist/esm/index.native177.js +8 -2
- package/dist/esm/index.native178.js +2 -70
- package/dist/esm/index.native179.js +373 -30
- package/dist/esm/index.native180.js +835 -20
- package/dist/esm/index.native194.js +2 -2
- package/dist/esm/index.native195.js +2 -2
- package/dist/esm/index.native196.js +2 -2
- package/dist/esm/index.native3.js +1 -1
- package/dist/esm/index.native9.js +1 -1
- package/dist/esm/index.web117.js +1 -1
- package/dist/esm/index.web118.js +1 -1
- package/dist/esm/index.web123.js +1 -1
- package/dist/esm/index.web126.js +6 -6
- package/dist/esm/index.web158.js +1 -1
- package/dist/esm/index.web159.js +32 -6
- package/dist/esm/index.web160.js +6 -32
- package/dist/esm/index.web161.js +1 -1
- package/dist/esm/index.web162.js +77 -19
- package/dist/esm/index.web163.js +21 -10
- package/dist/esm/index.web164.js +9 -19
- package/dist/esm/index.web165.js +15 -89
- package/dist/esm/index.web166.js +92 -19
- package/dist/esm/index.web167.js +18 -115
- package/dist/esm/index.web168.js +112 -73
- package/dist/esm/index.web181.js +2 -109
- package/dist/esm/index.web182.js +109 -2
- package/dist/esm/index.web183.js +2 -2
- package/dist/esm/index.web8.js +1 -1
- package/dist/native/index.native102.js +2 -2
- package/dist/native/index.native104.js +1 -1
- package/dist/native/index.native155.js +1 -1
- package/dist/native/index.native157.js +102 -18
- package/dist/native/index.native158.js +20 -80
- package/dist/native/index.native159.js +79 -103
- package/dist/native/index.native163.js +1 -1
- package/dist/native/index.native172.js +38 -7
- package/dist/native/index.native174.js +67 -375
- package/dist/native/index.native175.js +34 -835
- package/dist/native/index.native176.js +20 -38
- package/dist/native/index.native177.js +8 -2
- package/dist/native/index.native178.js +2 -70
- package/dist/native/index.native179.js +373 -30
- package/dist/native/index.native180.js +835 -20
- package/dist/native/index.native194.js +2 -2
- package/dist/native/index.native195.js +2 -2
- package/dist/native/index.native196.js +2 -2
- package/dist/native/index.native3.js +1 -1
- package/dist/native/index.native9.js +1 -1
- package/dist/native-types/version.d.ts +1 -1
- package/dist/types/version.d.ts +1 -1
- package/dist/web/index.web117.js +1 -1
- package/dist/web/index.web118.js +1 -1
- package/dist/web/index.web123.js +1 -1
- package/dist/web/index.web126.js +6 -6
- package/dist/web/index.web158.js +1 -1
- package/dist/web/index.web159.js +32 -6
- package/dist/web/index.web160.js +6 -32
- package/dist/web/index.web161.js +1 -1
- package/dist/web/index.web162.js +77 -19
- package/dist/web/index.web163.js +21 -10
- package/dist/web/index.web164.js +9 -19
- package/dist/web/index.web165.js +15 -89
- package/dist/web/index.web166.js +92 -19
- package/dist/web/index.web167.js +18 -115
- package/dist/web/index.web168.js +112 -73
- package/dist/web/index.web181.js +2 -109
- package/dist/web/index.web182.js +109 -2
- package/dist/web/index.web183.js +2 -2
- package/dist/web/index.web8.js +1 -1
- package/dist/web-types/version.d.ts +1 -1
- package/package.json +2 -2
|
@@ -1,5 +1,5 @@
|
|
|
1
|
-
import { split as L, rotlSH as T, rotlSL as S, rotlBH as m, rotlBL as F } from "./index.
|
|
2
|
-
import { createHasher as X, Hash as E, anumber as d, u32 as U, swap32IfBE as I, aexists as x, toBytes as P, abytes as k, aoutput as M, clean as y } from "./index.
|
|
1
|
+
import { split as L, rotlSH as T, rotlSL as S, rotlBH as m, rotlBL as F } from "./index.native158.js";
|
|
2
|
+
import { createHasher as X, Hash as E, anumber as d, u32 as U, swap32IfBE as I, aexists as x, toBytes as P, abytes as k, aoutput as M, clean as y } from "./index.native159.js";
|
|
3
3
|
const R = BigInt(0), f = BigInt(1), j = BigInt(2), q = BigInt(7), v = BigInt(256), z = BigInt(113), _ = [], g = [], B = [];
|
|
4
4
|
for (let n = 0, t = f, s = 1, i = 0; n < 24; n++) {
|
|
5
5
|
[s, i] = [i, (2 * s + 3 * i) % 5], _.push(2 * (5 * i + s)), g.push((n + 1) * (n + 2) / 2 % 64);
|
|
@@ -1,22 +1,106 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
1
|
+
import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index.native163.js";
|
|
2
|
+
import { createHasher as u, clean as C, rotr as i } from "./index.native159.js";
|
|
3
|
+
const B = /* @__PURE__ */ Uint32Array.from([
|
|
4
|
+
1116352408,
|
|
5
|
+
1899447441,
|
|
6
|
+
3049323471,
|
|
7
|
+
3921009573,
|
|
8
|
+
961987163,
|
|
9
|
+
1508970993,
|
|
10
|
+
2453635748,
|
|
11
|
+
2870763221,
|
|
12
|
+
3624381080,
|
|
13
|
+
310598401,
|
|
14
|
+
607225278,
|
|
15
|
+
1426881987,
|
|
16
|
+
1925078388,
|
|
17
|
+
2162078206,
|
|
18
|
+
2614888103,
|
|
19
|
+
3248222580,
|
|
20
|
+
3835390401,
|
|
21
|
+
4022224774,
|
|
22
|
+
264347078,
|
|
23
|
+
604807628,
|
|
24
|
+
770255983,
|
|
25
|
+
1249150122,
|
|
26
|
+
1555081692,
|
|
27
|
+
1996064986,
|
|
28
|
+
2554220882,
|
|
29
|
+
2821834349,
|
|
30
|
+
2952996808,
|
|
31
|
+
3210313671,
|
|
32
|
+
3336571891,
|
|
33
|
+
3584528711,
|
|
34
|
+
113926993,
|
|
35
|
+
338241895,
|
|
36
|
+
666307205,
|
|
37
|
+
773529912,
|
|
38
|
+
1294757372,
|
|
39
|
+
1396182291,
|
|
40
|
+
1695183700,
|
|
41
|
+
1986661051,
|
|
42
|
+
2177026350,
|
|
43
|
+
2456956037,
|
|
44
|
+
2730485921,
|
|
45
|
+
2820302411,
|
|
46
|
+
3259730800,
|
|
47
|
+
3345764771,
|
|
48
|
+
3516065817,
|
|
49
|
+
3600352804,
|
|
50
|
+
4094571909,
|
|
51
|
+
275423344,
|
|
52
|
+
430227734,
|
|
53
|
+
506948616,
|
|
54
|
+
659060556,
|
|
55
|
+
883997877,
|
|
56
|
+
958139571,
|
|
57
|
+
1322822218,
|
|
58
|
+
1537002063,
|
|
59
|
+
1747873779,
|
|
60
|
+
1955562222,
|
|
61
|
+
2024104815,
|
|
62
|
+
2227730452,
|
|
63
|
+
2361852424,
|
|
64
|
+
2428436474,
|
|
65
|
+
2756734187,
|
|
66
|
+
3204031479,
|
|
67
|
+
3329325298
|
|
68
|
+
]), h = /* @__PURE__ */ new Uint32Array(64);
|
|
69
|
+
class E extends D {
|
|
70
|
+
constructor(o = 32) {
|
|
71
|
+
super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
|
|
72
|
+
}
|
|
73
|
+
get() {
|
|
74
|
+
const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
|
|
75
|
+
return [o, r, t, s, a, f, c, e];
|
|
76
|
+
}
|
|
77
|
+
// prettier-ignore
|
|
78
|
+
set(o, r, t, s, a, f, c, e) {
|
|
79
|
+
this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
|
|
80
|
+
}
|
|
81
|
+
process(o, r) {
|
|
82
|
+
for (let x = 0; x < 16; x++, r += 4)
|
|
83
|
+
h[x] = o.getUint32(r, !1);
|
|
84
|
+
for (let x = 16; x < 64; x++) {
|
|
85
|
+
const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
|
|
86
|
+
h[x] = l + h[x - 7] + m + h[x - 16] | 0;
|
|
87
|
+
}
|
|
88
|
+
let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
|
|
89
|
+
for (let x = 0; x < 64; x++) {
|
|
90
|
+
const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
|
|
91
|
+
A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
|
|
92
|
+
}
|
|
93
|
+
t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
|
|
94
|
+
}
|
|
95
|
+
roundClean() {
|
|
96
|
+
C(h);
|
|
97
|
+
}
|
|
98
|
+
destroy() {
|
|
99
|
+
this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
|
|
11
100
|
}
|
|
12
|
-
return [l, c];
|
|
13
101
|
}
|
|
14
|
-
const
|
|
102
|
+
const y = /* @__PURE__ */ u(() => new E());
|
|
15
103
|
export {
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
a as rotlBL,
|
|
19
|
-
m as rotlSH,
|
|
20
|
-
A as rotlSL,
|
|
21
|
-
h as split
|
|
104
|
+
E as SHA256,
|
|
105
|
+
y as sha256
|
|
22
106
|
};
|
|
@@ -1,82 +1,22 @@
|
|
|
1
|
-
|
|
2
|
-
function
|
|
3
|
-
return
|
|
4
|
-
}
|
|
5
|
-
function
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
function h(e, t = !0) {
|
|
16
|
-
if (e.destroyed)
|
|
17
|
-
throw new Error("Hash instance has been destroyed");
|
|
18
|
-
if (t && e.finished)
|
|
19
|
-
throw new Error("Hash#digest() has already been called");
|
|
20
|
-
}
|
|
21
|
-
function l(e, t) {
|
|
22
|
-
r(e);
|
|
23
|
-
const n = t.outputLen;
|
|
24
|
-
if (e.length < n)
|
|
25
|
-
throw new Error("digestInto() expects output buffer of length at least " + n);
|
|
26
|
-
}
|
|
27
|
-
function a(e) {
|
|
28
|
-
return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
|
|
29
|
-
}
|
|
30
|
-
function g(...e) {
|
|
31
|
-
for (let t = 0; t < e.length; t++)
|
|
32
|
-
e[t].fill(0);
|
|
33
|
-
}
|
|
34
|
-
function p(e) {
|
|
35
|
-
return new DataView(e.buffer, e.byteOffset, e.byteLength);
|
|
36
|
-
}
|
|
37
|
-
function b(e, t) {
|
|
38
|
-
return e << 32 - t | e >>> t;
|
|
39
|
-
}
|
|
40
|
-
const i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
41
|
-
function u(e) {
|
|
42
|
-
return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
|
|
43
|
-
}
|
|
44
|
-
function c(e) {
|
|
45
|
-
for (let t = 0; t < e.length; t++)
|
|
46
|
-
e[t] = u(e[t]);
|
|
47
|
-
return e;
|
|
48
|
-
}
|
|
49
|
-
const x = i ? (e) => e : c;
|
|
50
|
-
function s(e) {
|
|
51
|
-
if (typeof e != "string")
|
|
52
|
-
throw new Error("string expected");
|
|
53
|
-
return new Uint8Array(new TextEncoder().encode(e));
|
|
54
|
-
}
|
|
55
|
-
function y(e) {
|
|
56
|
-
return typeof e == "string" && (e = s(e)), r(e), e;
|
|
57
|
-
}
|
|
58
|
-
class d {
|
|
59
|
-
}
|
|
60
|
-
function E(e) {
|
|
61
|
-
const t = (f) => e().update(y(f)).digest(), n = e();
|
|
62
|
-
return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
|
|
63
|
-
}
|
|
1
|
+
const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
|
|
2
|
+
function s(t, r = !1) {
|
|
3
|
+
return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
|
|
4
|
+
}
|
|
5
|
+
function h(t, r = !1) {
|
|
6
|
+
const n = t.length;
|
|
7
|
+
let l = new Uint32Array(n), c = new Uint32Array(n);
|
|
8
|
+
for (let e = 0; e < n; e++) {
|
|
9
|
+
const { h: u, l: f } = s(t[e], r);
|
|
10
|
+
[l[e], c[e]] = [u, f];
|
|
11
|
+
}
|
|
12
|
+
return [l, c];
|
|
13
|
+
}
|
|
14
|
+
const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
|
|
64
15
|
export {
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
c as byteSwap32,
|
|
72
|
-
g as clean,
|
|
73
|
-
E as createHasher,
|
|
74
|
-
p as createView,
|
|
75
|
-
o as isBytes,
|
|
76
|
-
i as isLE,
|
|
77
|
-
b as rotr,
|
|
78
|
-
x as swap32IfBE,
|
|
79
|
-
y as toBytes,
|
|
80
|
-
a as u32,
|
|
81
|
-
s as utf8ToBytes
|
|
16
|
+
s as fromBig,
|
|
17
|
+
B as rotlBH,
|
|
18
|
+
a as rotlBL,
|
|
19
|
+
m as rotlSH,
|
|
20
|
+
A as rotlSL,
|
|
21
|
+
h as split
|
|
82
22
|
};
|
|
@@ -1,106 +1,82 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
2361852424,
|
|
64
|
-
2428436474,
|
|
65
|
-
2756734187,
|
|
66
|
-
3204031479,
|
|
67
|
-
3329325298
|
|
68
|
-
]), h = /* @__PURE__ */ new Uint32Array(64);
|
|
69
|
-
class E extends D {
|
|
70
|
-
constructor(o = 32) {
|
|
71
|
-
super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
|
|
72
|
-
}
|
|
73
|
-
get() {
|
|
74
|
-
const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
|
|
75
|
-
return [o, r, t, s, a, f, c, e];
|
|
76
|
-
}
|
|
77
|
-
// prettier-ignore
|
|
78
|
-
set(o, r, t, s, a, f, c, e) {
|
|
79
|
-
this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
|
|
80
|
-
}
|
|
81
|
-
process(o, r) {
|
|
82
|
-
for (let x = 0; x < 16; x++, r += 4)
|
|
83
|
-
h[x] = o.getUint32(r, !1);
|
|
84
|
-
for (let x = 16; x < 64; x++) {
|
|
85
|
-
const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
|
|
86
|
-
h[x] = l + h[x - 7] + m + h[x - 16] | 0;
|
|
87
|
-
}
|
|
88
|
-
let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
|
|
89
|
-
for (let x = 0; x < 64; x++) {
|
|
90
|
-
const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
|
|
91
|
-
A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
|
|
92
|
-
}
|
|
93
|
-
t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
|
|
94
|
-
}
|
|
95
|
-
roundClean() {
|
|
96
|
-
C(h);
|
|
97
|
-
}
|
|
98
|
-
destroy() {
|
|
99
|
-
this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
|
|
100
|
-
}
|
|
1
|
+
/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
2
|
+
function o(e) {
|
|
3
|
+
return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
|
|
4
|
+
}
|
|
5
|
+
function w(e) {
|
|
6
|
+
if (!Number.isSafeInteger(e) || e < 0)
|
|
7
|
+
throw new Error("positive integer expected, got " + e);
|
|
8
|
+
}
|
|
9
|
+
function r(e, ...t) {
|
|
10
|
+
if (!o(e))
|
|
11
|
+
throw new Error("Uint8Array expected");
|
|
12
|
+
if (t.length > 0 && !t.includes(e.length))
|
|
13
|
+
throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
|
|
14
|
+
}
|
|
15
|
+
function h(e, t = !0) {
|
|
16
|
+
if (e.destroyed)
|
|
17
|
+
throw new Error("Hash instance has been destroyed");
|
|
18
|
+
if (t && e.finished)
|
|
19
|
+
throw new Error("Hash#digest() has already been called");
|
|
20
|
+
}
|
|
21
|
+
function l(e, t) {
|
|
22
|
+
r(e);
|
|
23
|
+
const n = t.outputLen;
|
|
24
|
+
if (e.length < n)
|
|
25
|
+
throw new Error("digestInto() expects output buffer of length at least " + n);
|
|
26
|
+
}
|
|
27
|
+
function a(e) {
|
|
28
|
+
return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
|
|
29
|
+
}
|
|
30
|
+
function g(...e) {
|
|
31
|
+
for (let t = 0; t < e.length; t++)
|
|
32
|
+
e[t].fill(0);
|
|
33
|
+
}
|
|
34
|
+
function p(e) {
|
|
35
|
+
return new DataView(e.buffer, e.byteOffset, e.byteLength);
|
|
36
|
+
}
|
|
37
|
+
function b(e, t) {
|
|
38
|
+
return e << 32 - t | e >>> t;
|
|
39
|
+
}
|
|
40
|
+
const i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
41
|
+
function u(e) {
|
|
42
|
+
return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
|
|
43
|
+
}
|
|
44
|
+
function c(e) {
|
|
45
|
+
for (let t = 0; t < e.length; t++)
|
|
46
|
+
e[t] = u(e[t]);
|
|
47
|
+
return e;
|
|
48
|
+
}
|
|
49
|
+
const x = i ? (e) => e : c;
|
|
50
|
+
function s(e) {
|
|
51
|
+
if (typeof e != "string")
|
|
52
|
+
throw new Error("string expected");
|
|
53
|
+
return new Uint8Array(new TextEncoder().encode(e));
|
|
54
|
+
}
|
|
55
|
+
function y(e) {
|
|
56
|
+
return typeof e == "string" && (e = s(e)), r(e), e;
|
|
57
|
+
}
|
|
58
|
+
class d {
|
|
59
|
+
}
|
|
60
|
+
function E(e) {
|
|
61
|
+
const t = (f) => e().update(y(f)).digest(), n = e();
|
|
62
|
+
return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
|
|
101
63
|
}
|
|
102
|
-
const y = /* @__PURE__ */ u(() => new E());
|
|
103
64
|
export {
|
|
104
|
-
|
|
105
|
-
|
|
65
|
+
d as Hash,
|
|
66
|
+
r as abytes,
|
|
67
|
+
h as aexists,
|
|
68
|
+
w as anumber,
|
|
69
|
+
l as aoutput,
|
|
70
|
+
u as byteSwap,
|
|
71
|
+
c as byteSwap32,
|
|
72
|
+
g as clean,
|
|
73
|
+
E as createHasher,
|
|
74
|
+
p as createView,
|
|
75
|
+
o as isBytes,
|
|
76
|
+
i as isLE,
|
|
77
|
+
b as rotr,
|
|
78
|
+
x as swap32IfBE,
|
|
79
|
+
y as toBytes,
|
|
80
|
+
a as u32,
|
|
81
|
+
s as utf8ToBytes
|
|
106
82
|
};
|
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index.
|
|
1
|
+
import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index.native159.js";
|
|
2
2
|
function y(o, t, s, n) {
|
|
3
3
|
if (typeof o.setBigUint64 == "function")
|
|
4
4
|
return o.setBigUint64(t, s, n);
|
|
@@ -1,10 +1,41 @@
|
|
|
1
|
-
import { __module as
|
|
2
|
-
import { __require as
|
|
3
|
-
import { __require as
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
1
|
+
import { __module as h } from "./index.native173.js";
|
|
2
|
+
import { __require as S } from "./index.native174.js";
|
|
3
|
+
import { __require as q } from "./index.native175.js";
|
|
4
|
+
import { __require as w } from "./index.native176.js";
|
|
5
|
+
var x;
|
|
6
|
+
function G() {
|
|
7
|
+
return x ? h.exports : (x = 1, function() {
|
|
8
|
+
var v = S(), p = q().utf8, B = w(), F = q().bin, d = function(o, f) {
|
|
9
|
+
o.constructor == String ? f && f.encoding === "binary" ? o = F.stringToBytes(o) : o = p.stringToBytes(o) : B(o) ? o = Array.prototype.slice.call(o, 0) : !Array.isArray(o) && o.constructor !== Uint8Array && (o = o.toString());
|
|
10
|
+
for (var u = v.bytesToWords(o), a = o.length * 8, n = 1732584193, r = -271733879, i = -1732584194, t = 271733878, e = 0; e < u.length; e++)
|
|
11
|
+
u[e] = (u[e] << 8 | u[e] >>> 24) & 16711935 | (u[e] << 24 | u[e] >>> 8) & 4278255360;
|
|
12
|
+
u[a >>> 5] |= 128 << a % 32, u[(a + 64 >>> 9 << 4) + 14] = a;
|
|
13
|
+
for (var _ = d._ff, c = d._gg, l = d._hh, y = d._ii, e = 0; e < u.length; e += 16) {
|
|
14
|
+
var T = n, b = r, A = i, I = t;
|
|
15
|
+
n = _(n, r, i, t, u[e + 0], 7, -680876936), t = _(t, n, r, i, u[e + 1], 12, -389564586), i = _(i, t, n, r, u[e + 2], 17, 606105819), r = _(r, i, t, n, u[e + 3], 22, -1044525330), n = _(n, r, i, t, u[e + 4], 7, -176418897), t = _(t, n, r, i, u[e + 5], 12, 1200080426), i = _(i, t, n, r, u[e + 6], 17, -1473231341), r = _(r, i, t, n, u[e + 7], 22, -45705983), n = _(n, r, i, t, u[e + 8], 7, 1770035416), t = _(t, n, r, i, u[e + 9], 12, -1958414417), i = _(i, t, n, r, u[e + 10], 17, -42063), r = _(r, i, t, n, u[e + 11], 22, -1990404162), n = _(n, r, i, t, u[e + 12], 7, 1804603682), t = _(t, n, r, i, u[e + 13], 12, -40341101), i = _(i, t, n, r, u[e + 14], 17, -1502002290), r = _(r, i, t, n, u[e + 15], 22, 1236535329), n = c(n, r, i, t, u[e + 1], 5, -165796510), t = c(t, n, r, i, u[e + 6], 9, -1069501632), i = c(i, t, n, r, u[e + 11], 14, 643717713), r = c(r, i, t, n, u[e + 0], 20, -373897302), n = c(n, r, i, t, u[e + 5], 5, -701558691), t = c(t, n, r, i, u[e + 10], 9, 38016083), i = c(i, t, n, r, u[e + 15], 14, -660478335), r = c(r, i, t, n, u[e + 4], 20, -405537848), n = c(n, r, i, t, u[e + 9], 5, 568446438), t = c(t, n, r, i, u[e + 14], 9, -1019803690), i = c(i, t, n, r, u[e + 3], 14, -187363961), r = c(r, i, t, n, u[e + 8], 20, 1163531501), n = c(n, r, i, t, u[e + 13], 5, -1444681467), t = c(t, n, r, i, u[e + 2], 9, -51403784), i = c(i, t, n, r, u[e + 7], 14, 1735328473), r = c(r, i, t, n, u[e + 12], 20, -1926607734), n = l(n, r, i, t, u[e + 5], 4, -378558), t = l(t, n, r, i, u[e + 8], 11, -2022574463), i = l(i, t, n, r, u[e + 11], 16, 1839030562), r = l(r, i, t, n, u[e + 14], 23, -35309556), n = l(n, r, i, t, u[e + 1], 4, -1530992060), t = l(t, n, r, i, u[e + 4], 11, 1272893353), i = l(i, t, n, r, u[e + 7], 16, -155497632), r = l(r, i, t, n, u[e + 10], 23, -1094730640), n = l(n, r, i, t, u[e + 13], 4, 681279174), t = l(t, n, r, i, u[e + 0], 11, -358537222), i = l(i, t, n, r, u[e + 3], 16, -722521979), r = l(r, i, t, n, u[e + 6], 23, 76029189), n = l(n, r, i, t, u[e + 9], 4, -640364487), t = l(t, n, r, i, u[e + 12], 11, -421815835), i = l(i, t, n, r, u[e + 15], 16, 530742520), r = l(r, i, t, n, u[e + 2], 23, -995338651), n = y(n, r, i, t, u[e + 0], 6, -198630844), t = y(t, n, r, i, u[e + 7], 10, 1126891415), i = y(i, t, n, r, u[e + 14], 15, -1416354905), r = y(r, i, t, n, u[e + 5], 21, -57434055), n = y(n, r, i, t, u[e + 12], 6, 1700485571), t = y(t, n, r, i, u[e + 3], 10, -1894986606), i = y(i, t, n, r, u[e + 10], 15, -1051523), r = y(r, i, t, n, u[e + 1], 21, -2054922799), n = y(n, r, i, t, u[e + 8], 6, 1873313359), t = y(t, n, r, i, u[e + 15], 10, -30611744), i = y(i, t, n, r, u[e + 6], 15, -1560198380), r = y(r, i, t, n, u[e + 13], 21, 1309151649), n = y(n, r, i, t, u[e + 4], 6, -145523070), t = y(t, n, r, i, u[e + 11], 10, -1120210379), i = y(i, t, n, r, u[e + 2], 15, 718787259), r = y(r, i, t, n, u[e + 9], 21, -343485551), n = n + T >>> 0, r = r + b >>> 0, i = i + A >>> 0, t = t + I >>> 0;
|
|
16
|
+
}
|
|
17
|
+
return v.endian([n, r, i, t]);
|
|
18
|
+
};
|
|
19
|
+
d._ff = function(o, f, u, a, n, r, i) {
|
|
20
|
+
var t = o + (f & u | ~f & a) + (n >>> 0) + i;
|
|
21
|
+
return (t << r | t >>> 32 - r) + f;
|
|
22
|
+
}, d._gg = function(o, f, u, a, n, r, i) {
|
|
23
|
+
var t = o + (f & a | u & ~a) + (n >>> 0) + i;
|
|
24
|
+
return (t << r | t >>> 32 - r) + f;
|
|
25
|
+
}, d._hh = function(o, f, u, a, n, r, i) {
|
|
26
|
+
var t = o + (f ^ u ^ a) + (n >>> 0) + i;
|
|
27
|
+
return (t << r | t >>> 32 - r) + f;
|
|
28
|
+
}, d._ii = function(o, f, u, a, n, r, i) {
|
|
29
|
+
var t = o + (u ^ (f | ~a)) + (n >>> 0) + i;
|
|
30
|
+
return (t << r | t >>> 32 - r) + f;
|
|
31
|
+
}, d._blocksize = 16, d._digestsize = 16, h.exports = function(o, f) {
|
|
32
|
+
if (o == null)
|
|
33
|
+
throw new Error("Illegal argument " + o);
|
|
34
|
+
var u = v.wordsToBytes(d(o, f));
|
|
35
|
+
return f && f.asBytes ? u : f && f.asString ? F.bytesToString(u) : v.bytesToHex(u);
|
|
36
|
+
};
|
|
37
|
+
}(), h.exports);
|
|
7
38
|
}
|
|
8
39
|
export {
|
|
9
|
-
|
|
40
|
+
G as __require
|
|
10
41
|
};
|