@coinbase/cdp-core 0.0.18 → 0.0.20
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +13 -5
- package/dist/esm/index.js +24 -21
- package/dist/esm/index103.js +1 -1
- package/dist/esm/index13.js +9 -3
- package/dist/esm/index15.js +8 -8
- package/dist/esm/index16.js +2 -2
- package/dist/esm/index17.js +158 -39
- package/dist/esm/index18.js +47 -16
- package/dist/esm/index19.js +152 -4
- package/dist/esm/index2.js +138 -124
- package/dist/esm/index20.js +56 -5
- package/dist/esm/index21.js +39 -158
- package/dist/esm/index22.js +16 -47
- package/dist/esm/index23.js +4 -152
- package/dist/esm/index24.js +5 -56
- package/dist/esm/index25.js +12 -8
- package/dist/esm/index26.js +11 -17
- package/dist/esm/index27.js +8 -45
- package/dist/esm/index28.js +17 -13
- package/dist/esm/index29.js +40 -50
- package/dist/esm/index3.js +4 -4
- package/dist/esm/index30.js +13 -6
- package/dist/esm/index31.js +54 -20
- package/dist/esm/index32.js +6 -11
- package/dist/esm/index33.js +21 -3
- package/dist/esm/index34.js +3 -3
- package/dist/esm/index35.js +3 -34
- package/dist/esm/index36.js +32 -10
- package/dist/esm/index37.js +12 -4
- package/dist/esm/index38.js +4 -28
- package/dist/esm/index39.js +28 -6
- package/dist/esm/index40.js +6 -24
- package/dist/esm/index41.js +24 -16
- package/dist/esm/index42.js +16 -54
- package/dist/esm/index43.js +53 -22
- package/dist/esm/index44.js +23 -11
- package/dist/esm/index45.js +10 -26
- package/dist/esm/index46.js +26 -41
- package/dist/esm/index47.js +41 -54
- package/dist/esm/index48.js +54 -126
- package/dist/esm/index49.js +126 -11
- package/dist/esm/index50.js +9 -101
- package/dist/esm/index51.js +104 -6
- package/dist/esm/index52.js +7 -3
- package/dist/esm/index53.js +3 -15
- package/dist/esm/index54.js +14 -42
- package/dist/esm/index55.js +38 -74
- package/dist/esm/index56.js +79 -2
- package/dist/esm/index57.js +2 -2
- package/dist/esm/index58.js +2 -13
- package/dist/esm/index59.js +2 -2
- package/dist/esm/index6.js +4 -4
- package/dist/esm/index60.js +1 -1
- package/dist/esm/index61.js +1 -1
- package/dist/esm/index62.js +2 -2
- package/dist/esm/index63.js +2 -2
- package/dist/esm/index64.js +1 -1
- package/dist/esm/index65.js +1 -1
- package/dist/esm/index66.js +3 -3
- package/dist/esm/index70.js +1 -1
- package/dist/esm/index72.js +4 -4
- package/dist/esm/index73.js +104 -2
- package/dist/esm/index74.js +75 -17
- package/dist/esm/index75.js +80 -20
- package/dist/esm/index76.js +2 -80
- package/dist/esm/index77.js +17 -100
- package/dist/esm/index78.js +18 -31
- package/dist/esm/index79.js +32 -6
- package/dist/esm/index80.js +6 -78
- package/dist/esm/index81.js +10 -55
- package/dist/esm/index82.js +54 -10
- package/dist/esm/index83.js +11 -2
- package/dist/esm/index84.js +2 -45
- package/dist/esm/index85.js +44 -13
- package/dist/esm/index86.js +13 -9
- package/dist/esm/index88.js +12 -20
- package/dist/esm/index89.js +35 -9
- package/dist/esm/index90.js +41 -19
- package/dist/esm/index91.js +20 -93
- package/dist/esm/index92.js +9 -20
- package/dist/esm/index93.js +16 -114
- package/dist/esm/index94.js +92 -11
- package/dist/esm/index95.js +20 -35
- package/dist/esm/index96.js +117 -41
- package/dist/types/index.d.ts +32 -2
- package/package.json +3 -3
package/dist/esm/index75.js
CHANGED
|
@@ -1,22 +1,82 @@
|
|
|
1
|
-
|
|
2
|
-
function
|
|
3
|
-
return
|
|
4
|
-
}
|
|
5
|
-
function
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
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;
|
|
63
|
+
}
|
|
15
64
|
export {
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
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
|
|
22
82
|
};
|
package/dist/esm/index76.js
CHANGED
|
@@ -1,82 +1,4 @@
|
|
|
1
|
-
|
|
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;
|
|
63
|
-
}
|
|
1
|
+
const o = "2.33.0";
|
|
64
2
|
export {
|
|
65
|
-
|
|
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
|
|
3
|
+
o as version
|
|
82
4
|
};
|
package/dist/esm/index77.js
CHANGED
|
@@ -1,106 +1,23 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
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;
|
|
1
|
+
import { BaseError as o } from "./index48.js";
|
|
2
|
+
class i extends o {
|
|
3
|
+
constructor({ offset: e }) {
|
|
4
|
+
super(`Offset \`${e}\` cannot be negative.`, {
|
|
5
|
+
name: "NegativeOffsetError"
|
|
6
|
+
});
|
|
72
7
|
}
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
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);
|
|
8
|
+
}
|
|
9
|
+
class n extends o {
|
|
10
|
+
constructor({ length: e, position: r }) {
|
|
11
|
+
super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
|
|
97
12
|
}
|
|
98
|
-
|
|
99
|
-
|
|
13
|
+
}
|
|
14
|
+
class c extends o {
|
|
15
|
+
constructor({ count: e, limit: r }) {
|
|
16
|
+
super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
|
|
100
17
|
}
|
|
101
18
|
}
|
|
102
|
-
const y = /* @__PURE__ */ u(() => new E());
|
|
103
19
|
export {
|
|
104
|
-
|
|
105
|
-
|
|
20
|
+
i as NegativeOffsetError,
|
|
21
|
+
n as PositionOutOfBoundsError,
|
|
22
|
+
c as RecursiveReadLimitExceededError
|
|
106
23
|
};
|
package/dist/esm/index78.js
CHANGED
|
@@ -1,35 +1,22 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
if (o > y)
|
|
12
|
-
throw new h({
|
|
13
|
-
maxSize: y,
|
|
14
|
-
size: o
|
|
15
|
-
});
|
|
16
|
-
const s = [];
|
|
17
|
-
let n = !0, r = 0;
|
|
18
|
-
for (; n; ) {
|
|
19
|
-
const t = B(new Uint8Array(a));
|
|
20
|
-
let l = 0;
|
|
21
|
-
for (; l < f; ) {
|
|
22
|
-
const b = i.slice(r, r + (p - 1));
|
|
23
|
-
if (t.pushByte(0), t.pushBytes(b), b.length < 31) {
|
|
24
|
-
t.pushByte(128), n = !1;
|
|
25
|
-
break;
|
|
26
|
-
}
|
|
27
|
-
l++, r += 31;
|
|
28
|
-
}
|
|
29
|
-
s.push(t);
|
|
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];
|
|
30
11
|
}
|
|
31
|
-
return
|
|
12
|
+
return [l, c];
|
|
32
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;
|
|
33
15
|
export {
|
|
34
|
-
|
|
16
|
+
s as fromBig,
|
|
17
|
+
B as rotlBH,
|
|
18
|
+
a as rotlBL,
|
|
19
|
+
m as rotlSH,
|
|
20
|
+
A as rotlSL,
|
|
21
|
+
h as split
|
|
35
22
|
};
|
package/dist/esm/index79.js
CHANGED
|
@@ -1,9 +1,35 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
1
|
+
import { maxBytesPerTransaction as y, bytesPerBlob as a, fieldElementsPerBlob as f, bytesPerFieldElement as p } from "./index87.js";
|
|
2
|
+
import { EmptyBlobError as c, BlobSizeTooLargeError as h } from "./index59.js";
|
|
3
|
+
import { createCursor as B } from "./index49.js";
|
|
4
|
+
import { size as u } from "./index38.js";
|
|
5
|
+
import { hexToBytes as x } from "./index31.js";
|
|
6
|
+
import { bytesToHex as d } from "./index29.js";
|
|
7
|
+
function S(e) {
|
|
8
|
+
const m = e.to ?? (typeof e.data == "string" ? "hex" : "bytes"), i = typeof e.data == "string" ? x(e.data) : e.data, o = u(i);
|
|
9
|
+
if (!o)
|
|
10
|
+
throw new c();
|
|
11
|
+
if (o > y)
|
|
12
|
+
throw new h({
|
|
13
|
+
maxSize: y,
|
|
14
|
+
size: o
|
|
15
|
+
});
|
|
16
|
+
const s = [];
|
|
17
|
+
let n = !0, r = 0;
|
|
18
|
+
for (; n; ) {
|
|
19
|
+
const t = B(new Uint8Array(a));
|
|
20
|
+
let l = 0;
|
|
21
|
+
for (; l < f; ) {
|
|
22
|
+
const b = i.slice(r, r + (p - 1));
|
|
23
|
+
if (t.pushByte(0), t.pushBytes(b), b.length < 31) {
|
|
24
|
+
t.pushByte(128), n = !1;
|
|
25
|
+
break;
|
|
26
|
+
}
|
|
27
|
+
l++, r += 31;
|
|
28
|
+
}
|
|
29
|
+
s.push(t);
|
|
30
|
+
}
|
|
31
|
+
return m === "bytes" ? s.map((t) => t.bytes) : s.map((t) => d(t.bytes));
|
|
6
32
|
}
|
|
7
33
|
export {
|
|
8
|
-
|
|
34
|
+
S as toBlobs
|
|
9
35
|
};
|
package/dist/esm/index80.js
CHANGED
|
@@ -1,81 +1,9 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
o.setUint32(t + c, e, n), o.setUint32(t + u, r, n);
|
|
1
|
+
import { bytesToHex as i } from "./index29.js";
|
|
2
|
+
import { sha256 as m } from "./index52.js";
|
|
3
|
+
function f(t) {
|
|
4
|
+
const { commitment: e, version: s = 1 } = t, n = t.to ?? (typeof e == "string" ? "hex" : "bytes"), o = m(e);
|
|
5
|
+
return o.set([s], 0), n === "bytes" ? o : i(o);
|
|
7
6
|
}
|
|
8
|
-
function U(o, t, s) {
|
|
9
|
-
return o & t ^ ~o & s;
|
|
10
|
-
}
|
|
11
|
-
function _(o, t, s) {
|
|
12
|
-
return o & t ^ o & s ^ t & s;
|
|
13
|
-
}
|
|
14
|
-
class m extends g {
|
|
15
|
-
constructor(t, s, n, i) {
|
|
16
|
-
super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = s, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = l(this.buffer);
|
|
17
|
-
}
|
|
18
|
-
update(t) {
|
|
19
|
-
b(this), t = a(t), d(t);
|
|
20
|
-
const { view: s, buffer: n, blockLen: i } = this, h = t.length;
|
|
21
|
-
for (let e = 0; e < h; ) {
|
|
22
|
-
const r = Math.min(i - this.pos, h - e);
|
|
23
|
-
if (r === i) {
|
|
24
|
-
const c = l(t);
|
|
25
|
-
for (; i <= h - e; e += i)
|
|
26
|
-
this.process(c, e);
|
|
27
|
-
continue;
|
|
28
|
-
}
|
|
29
|
-
n.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === i && (this.process(s, 0), this.pos = 0);
|
|
30
|
-
}
|
|
31
|
-
return this.length += t.length, this.roundClean(), this;
|
|
32
|
-
}
|
|
33
|
-
digestInto(t) {
|
|
34
|
-
b(this), x(t, this), this.finished = !0;
|
|
35
|
-
const { buffer: s, view: n, blockLen: i, isLE: h } = this;
|
|
36
|
-
let { pos: e } = this;
|
|
37
|
-
s[e++] = 128, w(this.buffer.subarray(e)), this.padOffset > i - e && (this.process(n, 0), e = 0);
|
|
38
|
-
for (let f = e; f < i; f++)
|
|
39
|
-
s[f] = 0;
|
|
40
|
-
y(n, i - 8, BigInt(this.length * 8), h), this.process(n, 0);
|
|
41
|
-
const r = l(t), c = this.outputLen;
|
|
42
|
-
if (c % 4)
|
|
43
|
-
throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
44
|
-
const u = c / 4, p = this.get();
|
|
45
|
-
if (u > p.length)
|
|
46
|
-
throw new Error("_sha2: outputLen bigger than state");
|
|
47
|
-
for (let f = 0; f < u; f++)
|
|
48
|
-
r.setUint32(4 * f, p[f], h);
|
|
49
|
-
}
|
|
50
|
-
digest() {
|
|
51
|
-
const { buffer: t, outputLen: s } = this;
|
|
52
|
-
this.digestInto(t);
|
|
53
|
-
const n = t.slice(0, s);
|
|
54
|
-
return this.destroy(), n;
|
|
55
|
-
}
|
|
56
|
-
_cloneInto(t) {
|
|
57
|
-
t || (t = new this.constructor()), t.set(...this.get());
|
|
58
|
-
const { blockLen: s, buffer: n, length: i, finished: h, destroyed: e, pos: r } = this;
|
|
59
|
-
return t.destroyed = e, t.finished = h, t.length = i, t.pos = r, i % s && t.buffer.set(n), t;
|
|
60
|
-
}
|
|
61
|
-
clone() {
|
|
62
|
-
return this._cloneInto();
|
|
63
|
-
}
|
|
64
|
-
}
|
|
65
|
-
const B = /* @__PURE__ */ Uint32Array.from([
|
|
66
|
-
1779033703,
|
|
67
|
-
3144134277,
|
|
68
|
-
1013904242,
|
|
69
|
-
2773480762,
|
|
70
|
-
1359893119,
|
|
71
|
-
2600822924,
|
|
72
|
-
528734635,
|
|
73
|
-
1541459225
|
|
74
|
-
]);
|
|
75
7
|
export {
|
|
76
|
-
|
|
77
|
-
m as HashMD,
|
|
78
|
-
_ as Maj,
|
|
79
|
-
B as SHA256_IV,
|
|
80
|
-
y as setBigUint64
|
|
8
|
+
f as commitmentToVersionedHash
|
|
81
9
|
};
|
package/dist/esm/index81.js
CHANGED
|
@@ -1,57 +1,12 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import
|
|
3
|
-
import
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
#r;
|
|
11
|
-
#e;
|
|
12
|
-
#t;
|
|
13
|
-
constructor(e) {
|
|
14
|
-
if (!(e instanceof Uint8Array))
|
|
15
|
-
throw new TypeError("payload must be an instance of Uint8Array");
|
|
16
|
-
this.#r = e;
|
|
17
|
-
}
|
|
18
|
-
setProtectedHeader(e) {
|
|
19
|
-
if (this.#e)
|
|
20
|
-
throw new TypeError("setProtectedHeader can only be called once");
|
|
21
|
-
return this.#e = e, this;
|
|
22
|
-
}
|
|
23
|
-
setUnprotectedHeader(e) {
|
|
24
|
-
if (this.#t)
|
|
25
|
-
throw new TypeError("setUnprotectedHeader can only be called once");
|
|
26
|
-
return this.#t = e, this;
|
|
27
|
-
}
|
|
28
|
-
async sign(e, l) {
|
|
29
|
-
if (!this.#e && !this.#t)
|
|
30
|
-
throw new r("either setProtectedHeader or setUnprotectedHeader must be called before #sign()");
|
|
31
|
-
if (!b(this.#e, this.#t))
|
|
32
|
-
throw new r("JWS Protected and JWS Unprotected Header Parameter names must be disjoint");
|
|
33
|
-
const c = {
|
|
34
|
-
...this.#e,
|
|
35
|
-
...this.#t
|
|
36
|
-
}, p = H(r, /* @__PURE__ */ new Map([["b64", !0]]), l?.crit, this.#e, c);
|
|
37
|
-
let o = !0;
|
|
38
|
-
if (p.has("b64") && (o = this.#e.b64, typeof o != "boolean"))
|
|
39
|
-
throw new r('The "b64" (base64url-encode payload) Header Parameter must be a boolean');
|
|
40
|
-
const { alg: t } = c;
|
|
41
|
-
if (typeof t != "string" || !t)
|
|
42
|
-
throw new r('JWS "alg" (Algorithm) Header Parameter missing or invalid');
|
|
43
|
-
g(t, e, "sign");
|
|
44
|
-
let i = this.#r;
|
|
45
|
-
o && (i = s.encode(d(i)));
|
|
46
|
-
let n;
|
|
47
|
-
this.#e ? n = s.encode(d(JSON.stringify(this.#e))) : n = s.encode("");
|
|
48
|
-
const f = u(n, s.encode("."), i), m = await P(e, t), w = await y(t, m, f), a = {
|
|
49
|
-
signature: d(w),
|
|
50
|
-
payload: ""
|
|
51
|
-
};
|
|
52
|
-
return o && (a.payload = h.decode(i)), this.#t && (a.header = this.#t), this.#e && (a.protected = h.decode(n)), a;
|
|
53
|
-
}
|
|
54
|
-
}
|
|
1
|
+
import { contracts as o } from "./index88.js";
|
|
2
|
+
import { formatters as r } from "./index89.js";
|
|
3
|
+
import { serializers as t } from "./index90.js";
|
|
4
|
+
const e = {
|
|
5
|
+
blockTime: 2e3,
|
|
6
|
+
contracts: o,
|
|
7
|
+
formatters: r,
|
|
8
|
+
serializers: t
|
|
9
|
+
};
|
|
55
10
|
export {
|
|
56
|
-
|
|
11
|
+
e as chainConfig
|
|
57
12
|
};
|
package/dist/esm/index82.js
CHANGED
|
@@ -1,13 +1,57 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
1
|
+
import { encode as d } from "./index91.js";
|
|
2
|
+
import y from "./index92.js";
|
|
3
|
+
import b from "./index93.js";
|
|
4
|
+
import { JWSInvalid as r } from "./index71.js";
|
|
5
|
+
import { encoder as s, concat as u, decoder as h } from "./index83.js";
|
|
6
|
+
import g from "./index94.js";
|
|
7
|
+
import H from "./index95.js";
|
|
8
|
+
import P from "./index96.js";
|
|
9
|
+
class x {
|
|
10
|
+
#r;
|
|
11
|
+
#e;
|
|
12
|
+
#t;
|
|
13
|
+
constructor(e) {
|
|
14
|
+
if (!(e instanceof Uint8Array))
|
|
15
|
+
throw new TypeError("payload must be an instance of Uint8Array");
|
|
16
|
+
this.#r = e;
|
|
17
|
+
}
|
|
18
|
+
setProtectedHeader(e) {
|
|
19
|
+
if (this.#e)
|
|
20
|
+
throw new TypeError("setProtectedHeader can only be called once");
|
|
21
|
+
return this.#e = e, this;
|
|
22
|
+
}
|
|
23
|
+
setUnprotectedHeader(e) {
|
|
24
|
+
if (this.#t)
|
|
25
|
+
throw new TypeError("setUnprotectedHeader can only be called once");
|
|
26
|
+
return this.#t = e, this;
|
|
27
|
+
}
|
|
28
|
+
async sign(e, l) {
|
|
29
|
+
if (!this.#e && !this.#t)
|
|
30
|
+
throw new r("either setProtectedHeader or setUnprotectedHeader must be called before #sign()");
|
|
31
|
+
if (!b(this.#e, this.#t))
|
|
32
|
+
throw new r("JWS Protected and JWS Unprotected Header Parameter names must be disjoint");
|
|
33
|
+
const c = {
|
|
34
|
+
...this.#e,
|
|
35
|
+
...this.#t
|
|
36
|
+
}, p = H(r, /* @__PURE__ */ new Map([["b64", !0]]), l?.crit, this.#e, c);
|
|
37
|
+
let o = !0;
|
|
38
|
+
if (p.has("b64") && (o = this.#e.b64, typeof o != "boolean"))
|
|
39
|
+
throw new r('The "b64" (base64url-encode payload) Header Parameter must be a boolean');
|
|
40
|
+
const { alg: t } = c;
|
|
41
|
+
if (typeof t != "string" || !t)
|
|
42
|
+
throw new r('JWS "alg" (Algorithm) Header Parameter missing or invalid');
|
|
43
|
+
g(t, e, "sign");
|
|
44
|
+
let i = this.#r;
|
|
45
|
+
o && (i = s.encode(d(i)));
|
|
46
|
+
let n;
|
|
47
|
+
this.#e ? n = s.encode(d(JSON.stringify(this.#e))) : n = s.encode("");
|
|
48
|
+
const f = u(n, s.encode("."), i), m = await P(e, t), w = await y(t, m, f), a = {
|
|
49
|
+
signature: d(w),
|
|
50
|
+
payload: ""
|
|
51
|
+
};
|
|
52
|
+
return o && (a.payload = h.decode(i)), this.#t && (a.header = this.#t), this.#e && (a.protected = h.decode(n)), a;
|
|
53
|
+
}
|
|
8
54
|
}
|
|
9
55
|
export {
|
|
10
|
-
|
|
11
|
-
s as decoder,
|
|
12
|
-
d as encoder
|
|
56
|
+
x as FlattenedSign
|
|
13
57
|
};
|
package/dist/esm/index83.js
CHANGED
|
@@ -1,4 +1,13 @@
|
|
|
1
|
-
const
|
|
1
|
+
const d = new TextEncoder(), s = new TextDecoder();
|
|
2
|
+
function f(...n) {
|
|
3
|
+
const c = n.reduce((e, { length: r }) => e + r, 0), t = new Uint8Array(c);
|
|
4
|
+
let o = 0;
|
|
5
|
+
for (const e of n)
|
|
6
|
+
t.set(e, o), o += e.length;
|
|
7
|
+
return t;
|
|
8
|
+
}
|
|
2
9
|
export {
|
|
3
|
-
|
|
10
|
+
f as concat,
|
|
11
|
+
s as decoder,
|
|
12
|
+
d as encoder
|
|
4
13
|
};
|