@gardenfi/utils 2.1.2-beta.6 → 2.1.2-beta.7
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/index102.cjs +1 -1
- package/dist/index102.js +6 -20
- package/dist/index103.cjs +1 -1
- package/dist/index103.js +20 -6
- package/dist/index23.cjs +1 -1
- package/dist/index23.js +3 -3
- package/dist/index24.cjs +1 -1
- package/dist/index24.js +2 -2
- package/dist/index35.cjs +1 -1
- package/dist/index35.js +2 -2
- package/dist/index36.cjs +1 -1
- package/dist/index36.js +1 -1
- package/dist/index41.cjs +1 -1
- package/dist/index41.js +2 -2
- package/dist/index45.cjs +1 -1
- package/dist/index45.js +10 -38
- package/dist/index46.cjs +1 -1
- package/dist/index46.js +32 -32
- package/dist/index47.cjs +1 -1
- package/dist/index47.js +37 -66
- package/dist/index48.cjs +1 -1
- package/dist/index48.js +34 -112
- package/dist/index49.cjs +1 -1
- package/dist/index49.js +63 -61
- package/dist/index50.cjs +1 -1
- package/dist/index50.js +113 -2
- package/dist/index51.cjs +1 -1
- package/dist/index51.js +66 -15
- package/dist/index52.cjs +1 -1
- package/dist/index52.js +2 -224
- package/dist/index53.cjs +1 -1
- package/dist/index53.js +13 -228
- package/dist/index54.cjs +1 -1
- package/dist/index54.js +220 -9
- package/dist/index55.cjs +1 -1
- package/dist/index55.js +229 -32
- package/dist/index58.cjs +1 -1
- package/dist/index58.js +3 -3
- package/dist/index68.cjs +1 -1
- package/dist/index68.js +2 -2
- package/dist/index71.cjs +1 -1
- package/dist/index71.js +1 -1
- package/dist/index72.cjs +1 -1
- package/dist/index72.js +191 -4
- package/dist/index73.cjs +1 -1
- package/dist/index73.js +58 -185
- package/dist/index74.cjs +1 -1
- package/dist/index74.js +4 -64
- package/dist/index79.cjs +1 -1
- package/dist/index79.js +1 -1
- package/dist/index80.cjs +2 -1
- package/dist/index80.js +35 -2
- package/dist/index81.cjs +1 -2
- package/dist/index81.js +5 -34
- package/dist/index82.cjs +1 -1
- package/dist/index82.js +2 -6
- package/dist/index83.cjs +1 -1
- package/dist/index83.js +1 -1
- package/dist/index84.cjs +1 -1
- package/dist/index84.js +1 -1
- package/dist/index85.cjs +1 -1
- package/dist/index85.js +1 -1
- package/dist/index90.cjs +1 -1
- package/dist/index90.js +10 -16
- package/dist/index91.cjs +1 -1
- package/dist/index91.js +16 -641
- package/dist/index92.cjs +1 -1
- package/dist/index92.js +624 -153
- package/dist/index93.cjs +1 -1
- package/dist/index93.js +170 -10
- package/dist/index94.cjs +1 -1
- package/dist/index94.js +1 -1
- package/dist/index99.cjs +1 -1
- package/dist/index99.js +2 -2
- package/package.json +1 -1
package/dist/index73.js
CHANGED
|
@@ -1,194 +1,67 @@
|
|
|
1
|
-
import {
|
|
1
|
+
import { BytesSizeMismatchError as m } from "./index79.js";
|
|
2
2
|
import { InvalidAddressError as w } from "./index32.js";
|
|
3
|
-
import {
|
|
4
|
-
import {
|
|
5
|
-
import {
|
|
6
|
-
import {
|
|
7
|
-
import {
|
|
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
|
-
if (o) {
|
|
33
|
-
const [n, r] = o;
|
|
34
|
-
return M(t, { length: n, param: { ...e, type: r } });
|
|
35
|
-
}
|
|
36
|
-
if (e.type === "tuple")
|
|
37
|
-
return H(t, {
|
|
38
|
-
param: e
|
|
39
|
-
});
|
|
40
|
-
if (e.type === "address")
|
|
41
|
-
return B(t);
|
|
42
|
-
if (e.type === "bool")
|
|
43
|
-
return T(t);
|
|
44
|
-
if (e.type.startsWith("uint") || e.type.startsWith("int")) {
|
|
45
|
-
const n = e.type.startsWith("int"), [, , r = "256"] = I.exec(e.type) ?? [];
|
|
46
|
-
return $(t, {
|
|
47
|
-
signed: n,
|
|
48
|
-
size: Number(r)
|
|
49
|
-
});
|
|
50
|
-
}
|
|
51
|
-
if (e.type.startsWith("bytes"))
|
|
52
|
-
return N(t, { param: e });
|
|
53
|
-
if (e.type === "string")
|
|
54
|
-
return C(t);
|
|
55
|
-
throw new u(e.type, {
|
|
56
|
-
docsPath: "/docs/contract/encodeAbiParameters"
|
|
57
|
-
});
|
|
58
|
-
}
|
|
59
|
-
function h(e) {
|
|
60
|
-
let t = 0;
|
|
61
|
-
for (let i = 0; i < e.length; i++) {
|
|
62
|
-
const { dynamic: c, encoded: s } = e[i];
|
|
63
|
-
c ? t += 32 : t += a(s);
|
|
64
|
-
}
|
|
65
|
-
const o = [], n = [];
|
|
66
|
-
let r = 0;
|
|
67
|
-
for (let i = 0; i < e.length; i++) {
|
|
68
|
-
const { dynamic: c, encoded: s } = e[i];
|
|
69
|
-
c ? (o.push(m(t + r, { size: 32 })), n.push(s), r += a(s)) : o.push(s);
|
|
70
|
-
}
|
|
71
|
-
return f([...o, ...n]);
|
|
72
|
-
}
|
|
73
|
-
function B(e) {
|
|
74
|
-
if (!z(e))
|
|
75
|
-
throw new w({ address: e });
|
|
76
|
-
return { dynamic: !1, encoded: d(e.toLowerCase()) };
|
|
77
|
-
}
|
|
78
|
-
function M(e, { length: t, param: o }) {
|
|
79
|
-
const n = t === null;
|
|
80
|
-
if (!Array.isArray(e))
|
|
81
|
-
throw new g(e);
|
|
82
|
-
if (!n && e.length !== t)
|
|
83
|
-
throw new l({
|
|
84
|
-
expectedLength: t,
|
|
85
|
-
givenLength: e.length,
|
|
86
|
-
type: `${o.type}[${t}]`
|
|
87
|
-
});
|
|
88
|
-
let r = !1;
|
|
89
|
-
const i = [];
|
|
90
|
-
for (let c = 0; c < e.length; c++) {
|
|
91
|
-
const s = p({ param: o, value: e[c] });
|
|
92
|
-
s.dynamic && (r = !0), i.push(s);
|
|
93
|
-
}
|
|
94
|
-
if (n || r) {
|
|
95
|
-
const c = h(i);
|
|
96
|
-
if (n) {
|
|
97
|
-
const s = m(i.length, { size: 32 });
|
|
98
|
-
return {
|
|
99
|
-
dynamic: !0,
|
|
100
|
-
encoded: i.length > 0 ? f([s, c]) : s
|
|
101
|
-
};
|
|
3
|
+
import { InvalidDomainError as E, InvalidPrimaryTypeError as z, InvalidStructTypeError as D } from "./index85.js";
|
|
4
|
+
import { isAddress as T } from "./index33.js";
|
|
5
|
+
import { size as y } from "./index74.js";
|
|
6
|
+
import { numberToHex as x } from "./index24.js";
|
|
7
|
+
import { integerRegex as P, bytesRegex as S } from "./index86.js";
|
|
8
|
+
function j(e) {
|
|
9
|
+
const { domain: n, message: g, primaryType: o, types: r } = e, f = (h, b) => {
|
|
10
|
+
for (const u of h) {
|
|
11
|
+
const { name: l, type: s } = u, t = b[l], a = s.match(P);
|
|
12
|
+
if (a && (typeof t == "number" || typeof t == "bigint")) {
|
|
13
|
+
const [I, i, v] = a;
|
|
14
|
+
x(t, {
|
|
15
|
+
signed: i === "int",
|
|
16
|
+
size: Number.parseInt(v) / 8
|
|
17
|
+
});
|
|
18
|
+
}
|
|
19
|
+
if (s === "address" && typeof t == "string" && !T(t))
|
|
20
|
+
throw new w({ address: t });
|
|
21
|
+
const p = s.match(S);
|
|
22
|
+
if (p) {
|
|
23
|
+
const [I, i] = p;
|
|
24
|
+
if (i && y(t) !== Number.parseInt(i))
|
|
25
|
+
throw new m({
|
|
26
|
+
expectedSize: Number.parseInt(i),
|
|
27
|
+
givenSize: y(t)
|
|
28
|
+
});
|
|
29
|
+
}
|
|
30
|
+
const c = r[s];
|
|
31
|
+
c && (_(s), f(c, t));
|
|
102
32
|
}
|
|
103
|
-
if (r)
|
|
104
|
-
return { dynamic: !0, encoded: c };
|
|
105
|
-
}
|
|
106
|
-
return {
|
|
107
|
-
dynamic: !1,
|
|
108
|
-
encoded: f(i.map(({ encoded: c }) => c))
|
|
109
33
|
};
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
let r = e;
|
|
115
|
-
return n % 32 !== 0 && (r = d(r, {
|
|
116
|
-
dir: "right",
|
|
117
|
-
size: Math.ceil((e.length - 2) / 2 / 32) * 32
|
|
118
|
-
})), {
|
|
119
|
-
dynamic: !0,
|
|
120
|
-
encoded: f([d(m(n, { size: 32 })), r])
|
|
121
|
-
};
|
|
122
|
-
}
|
|
123
|
-
if (n !== Number.parseInt(o))
|
|
124
|
-
throw new b({
|
|
125
|
-
expectedSize: Number.parseInt(o),
|
|
126
|
-
value: e
|
|
127
|
-
});
|
|
128
|
-
return { dynamic: !1, encoded: d(e, { dir: "right" }) };
|
|
129
|
-
}
|
|
130
|
-
function T(e) {
|
|
131
|
-
if (typeof e != "boolean")
|
|
132
|
-
throw new A(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);
|
|
133
|
-
return { dynamic: !1, encoded: d(P(e)) };
|
|
134
|
-
}
|
|
135
|
-
function $(e, { signed: t, size: o = 256 }) {
|
|
136
|
-
if (typeof o == "number") {
|
|
137
|
-
const n = 2n ** (BigInt(o) - (t ? 1n : 0n)) - 1n, r = t ? -n - 1n : 0n;
|
|
138
|
-
if (e > n || e < r)
|
|
139
|
-
throw new x({
|
|
140
|
-
max: n.toString(),
|
|
141
|
-
min: r.toString(),
|
|
142
|
-
signed: t,
|
|
143
|
-
size: o / 8,
|
|
144
|
-
value: e.toString()
|
|
145
|
-
});
|
|
34
|
+
if (r.EIP712Domain && n) {
|
|
35
|
+
if (typeof n != "object")
|
|
36
|
+
throw new E({ domain: n });
|
|
37
|
+
f(r.EIP712Domain, n);
|
|
146
38
|
}
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
})
|
|
153
|
-
};
|
|
154
|
-
}
|
|
155
|
-
function C(e) {
|
|
156
|
-
const t = S(e), o = Math.ceil(a(t) / 32), n = [];
|
|
157
|
-
for (let r = 0; r < o; r++)
|
|
158
|
-
n.push(d(E(t, r * 32, (r + 1) * 32), {
|
|
159
|
-
dir: "right"
|
|
160
|
-
}));
|
|
161
|
-
return {
|
|
162
|
-
dynamic: !0,
|
|
163
|
-
encoded: f([
|
|
164
|
-
d(m(a(t), { size: 32 })),
|
|
165
|
-
...n
|
|
166
|
-
])
|
|
167
|
-
};
|
|
39
|
+
if (o !== "EIP712Domain")
|
|
40
|
+
if (r[o])
|
|
41
|
+
f(r[o], g);
|
|
42
|
+
else
|
|
43
|
+
throw new z({ primaryType: o, types: r });
|
|
168
44
|
}
|
|
169
|
-
function
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
|
|
173
|
-
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
}
|
|
177
|
-
|
|
178
|
-
|
|
179
|
-
|
|
180
|
-
|
|
181
|
-
|
|
182
|
-
|
|
45
|
+
function F({ domain: e }) {
|
|
46
|
+
return [
|
|
47
|
+
typeof (e == null ? void 0 : e.name) == "string" && { name: "name", type: "string" },
|
|
48
|
+
(e == null ? void 0 : e.version) && { name: "version", type: "string" },
|
|
49
|
+
(typeof (e == null ? void 0 : e.chainId) == "number" || typeof (e == null ? void 0 : e.chainId) == "bigint") && {
|
|
50
|
+
name: "chainId",
|
|
51
|
+
type: "uint256"
|
|
52
|
+
},
|
|
53
|
+
(e == null ? void 0 : e.verifyingContract) && {
|
|
54
|
+
name: "verifyingContract",
|
|
55
|
+
type: "address"
|
|
56
|
+
},
|
|
57
|
+
(e == null ? void 0 : e.salt) && { name: "salt", type: "bytes32" }
|
|
58
|
+
].filter(Boolean);
|
|
183
59
|
}
|
|
184
|
-
function
|
|
185
|
-
|
|
186
|
-
|
|
187
|
-
// Return `null` if the array is dynamic.
|
|
188
|
-
[t[2] ? Number(t[2]) : null, t[1]]
|
|
189
|
-
) : void 0;
|
|
60
|
+
function _(e) {
|
|
61
|
+
if (e === "address" || e === "bool" || e === "string" || e.startsWith("bytes") || e.startsWith("uint") || e.startsWith("int"))
|
|
62
|
+
throw new D({ type: e });
|
|
190
63
|
}
|
|
191
64
|
export {
|
|
192
|
-
|
|
193
|
-
|
|
65
|
+
F as getTypesForEIP712Domain,
|
|
66
|
+
j as validateTypedData
|
|
194
67
|
};
|
package/dist/index74.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index59.cjs");function i(e){return t.isHex(e,{strict:!1})?Math.ceil((e.length-2)/2):e.length}exports.size=i;
|
package/dist/index74.js
CHANGED
|
@@ -1,67 +1,7 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
import { isAddress as T } from "./index33.js";
|
|
5
|
-
import { size as y } from "./index72.js";
|
|
6
|
-
import { numberToHex as x } from "./index24.js";
|
|
7
|
-
import { integerRegex as P, bytesRegex as S } from "./index86.js";
|
|
8
|
-
function j(e) {
|
|
9
|
-
const { domain: n, message: g, primaryType: o, types: r } = e, f = (h, b) => {
|
|
10
|
-
for (const u of h) {
|
|
11
|
-
const { name: l, type: s } = u, t = b[l], a = s.match(P);
|
|
12
|
-
if (a && (typeof t == "number" || typeof t == "bigint")) {
|
|
13
|
-
const [I, i, v] = a;
|
|
14
|
-
x(t, {
|
|
15
|
-
signed: i === "int",
|
|
16
|
-
size: Number.parseInt(v) / 8
|
|
17
|
-
});
|
|
18
|
-
}
|
|
19
|
-
if (s === "address" && typeof t == "string" && !T(t))
|
|
20
|
-
throw new w({ address: t });
|
|
21
|
-
const p = s.match(S);
|
|
22
|
-
if (p) {
|
|
23
|
-
const [I, i] = p;
|
|
24
|
-
if (i && y(t) !== Number.parseInt(i))
|
|
25
|
-
throw new m({
|
|
26
|
-
expectedSize: Number.parseInt(i),
|
|
27
|
-
givenSize: y(t)
|
|
28
|
-
});
|
|
29
|
-
}
|
|
30
|
-
const c = r[s];
|
|
31
|
-
c && (_(s), f(c, t));
|
|
32
|
-
}
|
|
33
|
-
};
|
|
34
|
-
if (r.EIP712Domain && n) {
|
|
35
|
-
if (typeof n != "object")
|
|
36
|
-
throw new E({ domain: n });
|
|
37
|
-
f(r.EIP712Domain, n);
|
|
38
|
-
}
|
|
39
|
-
if (o !== "EIP712Domain")
|
|
40
|
-
if (r[o])
|
|
41
|
-
f(r[o], g);
|
|
42
|
-
else
|
|
43
|
-
throw new z({ primaryType: o, types: r });
|
|
44
|
-
}
|
|
45
|
-
function F({ domain: e }) {
|
|
46
|
-
return [
|
|
47
|
-
typeof (e == null ? void 0 : e.name) == "string" && { name: "name", type: "string" },
|
|
48
|
-
(e == null ? void 0 : e.version) && { name: "version", type: "string" },
|
|
49
|
-
(typeof (e == null ? void 0 : e.chainId) == "number" || typeof (e == null ? void 0 : e.chainId) == "bigint") && {
|
|
50
|
-
name: "chainId",
|
|
51
|
-
type: "uint256"
|
|
52
|
-
},
|
|
53
|
-
(e == null ? void 0 : e.verifyingContract) && {
|
|
54
|
-
name: "verifyingContract",
|
|
55
|
-
type: "address"
|
|
56
|
-
},
|
|
57
|
-
(e == null ? void 0 : e.salt) && { name: "salt", type: "bytes32" }
|
|
58
|
-
].filter(Boolean);
|
|
59
|
-
}
|
|
60
|
-
function _(e) {
|
|
61
|
-
if (e === "address" || e === "bool" || e === "string" || e.startsWith("bytes") || e.startsWith("uint") || e.startsWith("int"))
|
|
62
|
-
throw new D({ type: e });
|
|
1
|
+
import { isHex as r } from "./index59.js";
|
|
2
|
+
function i(t) {
|
|
3
|
+
return r(t, { strict: !1 }) ? Math.ceil((t.length - 2) / 2) : t.length;
|
|
63
4
|
}
|
|
64
5
|
export {
|
|
65
|
-
|
|
66
|
-
j as validateTypedData
|
|
6
|
+
i as size
|
|
67
7
|
};
|
package/dist/index79.cjs
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index74.cjs"),n=require("./index56.cjs");class o extends n.BaseError{constructor({expectedLength:r,givenLength:e,type:t}){super([`ABI encoding array length mismatch for type ${t}.`,`Expected length: ${r}`,`Given length: ${e}`].join(`
|
|
2
2
|
`),{name:"AbiEncodingArrayLengthMismatchError"})}}class a extends n.BaseError{constructor({expectedSize:r,value:e}){super(`Size of bytes "${e}" (bytes${i.size(e)}) does not match expected size (bytes${r}).`,{name:"AbiEncodingBytesSizeMismatchError"})}}class c extends n.BaseError{constructor({expectedLength:r,givenLength:e}){super(["ABI encoding params/values length mismatch.",`Expected length (params): ${r}`,`Given length (values): ${e}`].join(`
|
|
3
3
|
`),{name:"AbiEncodingLengthMismatchError"})}}class d extends n.BaseError{constructor({expectedSize:r,givenSize:e}){super(`Expected bytes${r}, got bytes${e}.`,{name:"BytesSizeMismatchError"})}}class E extends n.BaseError{constructor(r,{docsPath:e}){super([`Type "${r}" is not a valid encoding type.`,"Please provide a valid ABI type."].join(`
|
|
4
4
|
`),{docsPath:e,name:"InvalidAbiEncodingType"})}}class g extends n.BaseError{constructor(r){super([`Value "${r}" is not a valid array.`].join(`
|
package/dist/index79.js
CHANGED
package/dist/index80.cjs
CHANGED
|
@@ -1 +1,2 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=(e,
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index81.cjs"),t=require("./index56.cjs");class i extends t.BaseError{constructor({cause:r,maxFeePerGas:e}={}){super(`The fee cap (\`maxFeePerGas\`${e?` = ${a.formatGwei(e)} gwei`:""}) cannot be higher than the maximum allowed value (2^256-1).`,{cause:r,name:"FeeCapTooHighError"})}}Object.defineProperty(i,"nodeMessage",{enumerable:!0,configurable:!0,writable:!0,value:/max fee per gas higher than 2\^256-1|fee cap higher than 2\^256-1/});class n extends t.BaseError{constructor({cause:r,maxPriorityFeePerGas:e,maxFeePerGas:o}={}){super([`The provided tip (\`maxPriorityFeePerGas\`${e?` = ${a.formatGwei(e)} gwei`:""}) cannot be higher than the fee cap (\`maxFeePerGas\`${o?` = ${a.formatGwei(o)} gwei`:""}).`].join(`
|
|
2
|
+
`),{cause:r,name:"TipAboveFeeCapError"})}}Object.defineProperty(n,"nodeMessage",{enumerable:!0,configurable:!0,writable:!0,value:/max priority fee per gas higher than max fee per gas|tip higher than fee cap/});exports.FeeCapTooHighError=i;exports.TipAboveFeeCapError=n;
|
package/dist/index80.js
CHANGED
|
@@ -1,4 +1,37 @@
|
|
|
1
|
-
|
|
1
|
+
import { formatGwei as a } from "./index81.js";
|
|
2
|
+
import { BaseError as o } from "./index56.js";
|
|
3
|
+
class n extends o {
|
|
4
|
+
constructor({ cause: r, maxFeePerGas: e } = {}) {
|
|
5
|
+
super(`The fee cap (\`maxFeePerGas\`${e ? ` = ${a(e)} gwei` : ""}) cannot be higher than the maximum allowed value (2^256-1).`, {
|
|
6
|
+
cause: r,
|
|
7
|
+
name: "FeeCapTooHighError"
|
|
8
|
+
});
|
|
9
|
+
}
|
|
10
|
+
}
|
|
11
|
+
Object.defineProperty(n, "nodeMessage", {
|
|
12
|
+
enumerable: !0,
|
|
13
|
+
configurable: !0,
|
|
14
|
+
writable: !0,
|
|
15
|
+
value: /max fee per gas higher than 2\^256-1|fee cap higher than 2\^256-1/
|
|
16
|
+
});
|
|
17
|
+
class h extends o {
|
|
18
|
+
constructor({ cause: r, maxPriorityFeePerGas: e, maxFeePerGas: t } = {}) {
|
|
19
|
+
super([
|
|
20
|
+
`The provided tip (\`maxPriorityFeePerGas\`${e ? ` = ${a(e)} gwei` : ""}) cannot be higher than the fee cap (\`maxFeePerGas\`${t ? ` = ${a(t)} gwei` : ""}).`
|
|
21
|
+
].join(`
|
|
22
|
+
`), {
|
|
23
|
+
cause: r,
|
|
24
|
+
name: "TipAboveFeeCapError"
|
|
25
|
+
});
|
|
26
|
+
}
|
|
27
|
+
}
|
|
28
|
+
Object.defineProperty(h, "nodeMessage", {
|
|
29
|
+
enumerable: !0,
|
|
30
|
+
configurable: !0,
|
|
31
|
+
writable: !0,
|
|
32
|
+
value: /max priority fee per gas higher than max fee per gas|tip higher than fee cap/
|
|
33
|
+
});
|
|
2
34
|
export {
|
|
3
|
-
|
|
35
|
+
n as FeeCapTooHighError,
|
|
36
|
+
h as TipAboveFeeCapError
|
|
4
37
|
};
|
package/dist/index81.cjs
CHANGED
|
@@ -1,2 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
2
|
-
`),{cause:r,name:"TipAboveFeeCapError"})}}Object.defineProperty(n,"nodeMessage",{enumerable:!0,configurable:!0,writable:!0,value:/max priority fee per gas higher than max fee per gas|tip higher than fee cap/});exports.FeeCapTooHighError=i;exports.TipAboveFeeCapError=n;
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index100.cjs"),r=require("./index101.cjs");function n(t,e="wei"){return r.formatUnits(t,i.gweiUnits[e])}exports.formatGwei=n;
|
package/dist/index81.js
CHANGED
|
@@ -1,37 +1,8 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
super(`The fee cap (\`maxFeePerGas\`${e ? ` = ${a(e)} gwei` : ""}) cannot be higher than the maximum allowed value (2^256-1).`, {
|
|
6
|
-
cause: r,
|
|
7
|
-
name: "FeeCapTooHighError"
|
|
8
|
-
});
|
|
9
|
-
}
|
|
1
|
+
import { gweiUnits as i } from "./index100.js";
|
|
2
|
+
import { formatUnits as o } from "./index101.js";
|
|
3
|
+
function f(r, t = "wei") {
|
|
4
|
+
return o(r, i[t]);
|
|
10
5
|
}
|
|
11
|
-
Object.defineProperty(n, "nodeMessage", {
|
|
12
|
-
enumerable: !0,
|
|
13
|
-
configurable: !0,
|
|
14
|
-
writable: !0,
|
|
15
|
-
value: /max fee per gas higher than 2\^256-1|fee cap higher than 2\^256-1/
|
|
16
|
-
});
|
|
17
|
-
class h extends o {
|
|
18
|
-
constructor({ cause: r, maxPriorityFeePerGas: e, maxFeePerGas: t } = {}) {
|
|
19
|
-
super([
|
|
20
|
-
`The provided tip (\`maxPriorityFeePerGas\`${e ? ` = ${a(e)} gwei` : ""}) cannot be higher than the fee cap (\`maxFeePerGas\`${t ? ` = ${a(t)} gwei` : ""}).`
|
|
21
|
-
].join(`
|
|
22
|
-
`), {
|
|
23
|
-
cause: r,
|
|
24
|
-
name: "TipAboveFeeCapError"
|
|
25
|
-
});
|
|
26
|
-
}
|
|
27
|
-
}
|
|
28
|
-
Object.defineProperty(h, "nodeMessage", {
|
|
29
|
-
enumerable: !0,
|
|
30
|
-
configurable: !0,
|
|
31
|
-
writable: !0,
|
|
32
|
-
value: /max priority fee per gas higher than max fee per gas|tip higher than fee cap/
|
|
33
|
-
});
|
|
34
6
|
export {
|
|
35
|
-
|
|
36
|
-
h as TipAboveFeeCapError
|
|
7
|
+
f as formatGwei
|
|
37
8
|
};
|
package/dist/index82.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=(e,n,i)=>JSON.stringify(e,(o,t)=>typeof t=="bigint"?t.toString():t,i);exports.stringify=r;
|
package/dist/index82.js
CHANGED
|
@@ -1,8 +1,4 @@
|
|
|
1
|
-
|
|
2
|
-
import { formatUnits as o } from "./index101.js";
|
|
3
|
-
function f(r, t = "wei") {
|
|
4
|
-
return o(r, i[t]);
|
|
5
|
-
}
|
|
1
|
+
const g = (r, n, i) => JSON.stringify(r, (e, t) => typeof t == "bigint" ? t.toString() : t, i);
|
|
6
2
|
export {
|
|
7
|
-
|
|
3
|
+
g as stringify
|
|
8
4
|
};
|
package/dist/index83.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index24.cjs"),r=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index24.cjs"),r=require("./index102.cjs");function c(t){const{commitment:o,version:s=1}=t,n=t.to??(typeof o=="string"?"hex":"bytes"),e=r.sha256(o);return e.set([s],0),n==="bytes"?e:i.bytesToHex(e)}exports.commitmentToVersionedHash=c;
|
package/dist/index83.js
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
import { bytesToHex as i } from "./index24.js";
|
|
2
|
-
import { sha256 as m } from "./
|
|
2
|
+
import { sha256 as m } from "./index102.js";
|
|
3
3
|
function f(t) {
|
|
4
4
|
const { commitment: e, version: s = 1 } = t, n = t.to ?? (typeof e == "string" ? "hex" : "bytes"), o = m(e);
|
|
5
5
|
return o.set([s], 0), n === "bytes" ? o : i(o);
|
package/dist/index84.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index104.cjs"),y=require("./index98.cjs"),u=require("./index94.cjs"),B=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index104.cjs"),y=require("./index98.cjs"),u=require("./index94.cjs"),B=require("./index74.cjs"),h=require("./index36.cjs"),d=require("./index24.cjs");function f(t){const a=t.to??(typeof t.data=="string"?"hex":"bytes"),n=typeof t.data=="string"?h.hexToBytes(t.data):t.data,s=B.size(n);if(!s)throw new y.EmptyBlobError;if(s>o.maxBytesPerTransaction)throw new y.BlobSizeTooLargeError({maxSize:o.maxBytesPerTransaction,size:s});const r=[];let b=!0,i=0;for(;b;){const e=u.createCursor(new Uint8Array(o.bytesPerBlob));let l=0;for(;l<o.fieldElementsPerBlob;){const c=n.slice(i,i+(o.bytesPerFieldElement-1));if(e.pushByte(0),e.pushBytes(c),c.length<31){e.pushByte(128),b=!1;break}l++,i+=31}r.push(e)}return a==="bytes"?r.map(e=>e.bytes):r.map(e=>d.bytesToHex(e.bytes))}exports.toBlobs=f;
|
package/dist/index84.js
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
import { maxBytesPerTransaction as y, bytesPerBlob as a, fieldElementsPerBlob as f, bytesPerFieldElement as p } from "./index104.js";
|
|
2
2
|
import { EmptyBlobError as c, BlobSizeTooLargeError as h } from "./index98.js";
|
|
3
3
|
import { createCursor as B } from "./index94.js";
|
|
4
|
-
import { size as u } from "./
|
|
4
|
+
import { size as u } from "./index74.js";
|
|
5
5
|
import { hexToBytes as x } from "./index36.js";
|
|
6
6
|
import { bytesToHex as d } from "./index24.js";
|
|
7
7
|
function S(e) {
|
package/dist/index85.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index82.cjs"),e=require("./index56.cjs");class i extends e.BaseError{constructor({domain:r}){super(`Invalid domain "${s.stringify(r)}".`,{metaMessages:["Must be a valid EIP-712 domain."]})}}class o extends e.BaseError{constructor({primaryType:r,types:a}){super(`Invalid primary type \`${r}\` must be one of \`${JSON.stringify(Object.keys(a))}\`.`,{docsPath:"/api/glossary/Errors#typeddatainvalidprimarytypeerror",metaMessages:["Check that the primary type is a key in `types`."]})}}class n extends e.BaseError{constructor({type:r}){super(`Struct type "${r}" is invalid.`,{metaMessages:["Struct type must not be a Solidity type."],name:"InvalidStructTypeError"})}}exports.InvalidDomainError=i;exports.InvalidPrimaryTypeError=o;exports.InvalidStructTypeError=n;
|
package/dist/index85.js
CHANGED
package/dist/index90.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index56.cjs");class i extends t.BaseError{constructor({offset:r,position:s,size:e}){super(`Slice ${s==="start"?"starting":"ending"} at offset "${r}" is out-of-bounds (size: ${e}).`,{name:"SliceOffsetOutOfBoundsError"})}}class d extends t.BaseError{constructor({size:r,targetSize:s,type:e}){super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`,{name:"SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=d;exports.SliceOffsetOutOfBoundsError=i;
|
package/dist/index90.js
CHANGED
|
@@ -1,21 +1,15 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
1
|
+
import { BaseError as o } from "./index56.js";
|
|
2
|
+
class d extends o {
|
|
3
|
+
constructor({ offset: r, position: s, size: e }) {
|
|
4
|
+
super(`Slice ${s === "start" ? "starting" : "ending"} at offset "${r}" is out-of-bounds (size: ${e}).`, { name: "SliceOffsetOutOfBoundsError" });
|
|
5
|
+
}
|
|
4
6
|
}
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
const { h: c, l: u } = f(t[e], r);
|
|
9
|
-
[n[e], l[e]] = [c, u];
|
|
7
|
+
class n extends o {
|
|
8
|
+
constructor({ size: r, targetSize: s, type: e }) {
|
|
9
|
+
super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`, { name: "SizeExceedsPaddingSizeError" });
|
|
10
10
|
}
|
|
11
|
-
return [n, l];
|
|
12
11
|
}
|
|
13
|
-
const g = (t, r, n) => t << n | r >>> 32 - n, m = (t, r, n) => r << n | t >>> 32 - n, A = (t, r, n) => r << n - 32 | t >>> 64 - n, B = (t, r, n) => t << n - 32 | r >>> 64 - n;
|
|
14
12
|
export {
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
B as rotlBL,
|
|
18
|
-
g as rotlSH,
|
|
19
|
-
m as rotlSL,
|
|
20
|
-
h as split
|
|
13
|
+
n as SizeExceedsPaddingSizeError,
|
|
14
|
+
d as SliceOffsetOutOfBoundsError
|
|
21
15
|
};
|
package/dist/index91.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const tt=require("./index92.cjs"),Q=require("./index52.cjs"),a=require("./index53.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function ot(h){h.lowS!==void 0&&a.abool("lowS",h.lowS),h.prehash!==void 0&&a.abool("prehash",h.prehash)}function ct(h){const n=tt.validateBasic(h);a.validateObject(n,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:t,Fp:b,a:O}=n;if(t){if(!b.eql(O,b.ZERO))throw new Error("invalid endomorphism, can only be defined for Koblitz curves that have a=0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error("invalid endomorphism, expected beta: bigint and splitScalar: function")}return Object.freeze({...n})}const{bytesToNumberBE:lt,hexToBytes:ut}=a;class it extends Error{constructor(n=""){super(n)}}const Y={Err:it,_tlv:{encode:(h,n)=>{const{Err:t}=Y;if(h<0||h>256)throw new t("tlv.encode: wrong tag");if(n.length&1)throw new t("tlv.encode: unpadded data");const b=n.length/2,O=a.numberToHexUnpadded(b);if(O.length/2&128)throw new t("tlv.encode: long form length too big");const Z=b>127?a.numberToHexUnpadded(O.length/2|128):"";return a.numberToHexUnpadded(h)+Z+O+n},decode(h,n){const{Err:t}=Y;let b=0;if(h<0||h>256)throw new t("tlv.encode: wrong tag");if(n.length<2||n[b++]!==h)throw new t("tlv.decode: wrong tlv");const O=n[b++],Z=!!(O&128);let x=0;if(!Z)x=O;else{const R=O&127;if(!R)throw new t("tlv.decode(long): indefinite length not supported");if(R>4)throw new t("tlv.decode(long): byte length is too big");const L=n.subarray(b,b+R);if(L.length!==R)throw new t("tlv.decode: length bytes not complete");if(L[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const P of L)x=x<<8|P;if(b+=R,x<128)throw new t("tlv.decode(long): not minimal encoding")}const V=n.subarray(b,b+x);if(V.length!==x)throw new t("tlv.decode: wrong value length");return{v:V,l:n.subarray(b+x)}}},_int:{encode(h){const{Err:n}=Y;if(h<C)throw new n("integer: negative integers are not allowed");let t=a.numberToHexUnpadded(h);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new n("unexpected DER parsing assertion: unpadded hex");return t},decode(h){const{Err:n}=Y;if(h[0]&128)throw new n("invalid signature integer: negative");if(h[0]===0&&!(h[1]&128))throw new n("invalid signature integer: unnecessary leading zero");return lt(h)}},toSig(h){const{Err:n,_int:t,_tlv:b}=Y,O=typeof h=="string"?ut(h):h;a.abytes(O);const{v:Z,l:x}=b.decode(48,O);if(x.length)throw new n("invalid signature: left bytes after parsing");const{v:V,l:R}=b.decode(2,Z),{v:L,l:P}=b.decode(2,R);if(P.length)throw new n("invalid signature: left bytes after parsing");return{r:t.decode(V),s:t.decode(L)}},hexFromSig(h){const{_tlv:n,_int:t}=Y,b=n.encode(2,t.encode(h.r)),O=n.encode(2,t.encode(h.s)),Z=b+O;return n.encode(48,Z)}},C=BigInt(0),T=BigInt(1);BigInt(2);const st=BigInt(3);BigInt(4);function at(h){const n=ct(h),{Fp:t}=n,b=Q.Field(n.n,n.nBitLength),O=n.toBytes||((m,e,s)=>{const c=e.toAffine();return a.concatBytes(Uint8Array.from([4]),t.toBytes(c.x),t.toBytes(c.y))}),Z=n.fromBytes||(m=>{const e=m.subarray(1),s=t.fromBytes(e.subarray(0,t.BYTES)),c=t.fromBytes(e.subarray(t.BYTES,2*t.BYTES));return{x:s,y:c}});function x(m){const{a:e,b:s}=n,c=t.sqr(m),d=t.mul(c,m);return t.add(t.add(d,t.mul(m,e)),s)}if(!t.eql(t.sqr(n.Gy),x(n.Gx)))throw new Error("bad generator point: equation left != right");function V(m){return a.inRange(m,T,n.n)}function R(m){const{allowedPrivateKeyLengths:e,nByteLength:s,wrapPrivateKey:c,n:d}=n;if(e&&typeof m!="bigint"){if(a.isBytes(m)&&(m=a.bytesToHex(m)),typeof m!="string"||!e.includes(m.length))throw new Error("invalid private key");m=m.padStart(s*2,"0")}let p;try{p=typeof m=="bigint"?m:a.bytesToNumberBE(a.ensureBytes("private key",m,s))}catch{throw new Error("invalid private key, expected hex or "+s+" bytes, got "+typeof m)}return c&&(p=Q.mod(p,d)),a.aInRange("private key",p,T,d),p}function L(m){if(!(m instanceof w))throw new Error("ProjectivePoint expected")}const P=a.memoized((m,e)=>{const{px:s,py:c,pz:d}=m;if(t.eql(d,t.ONE))return{x:s,y:c};const p=m.is0();e==null&&(e=p?t.ONE:t.inv(d));const v=t.mul(s,e),g=t.mul(c,e),l=t.mul(d,e);if(p)return{x:t.ZERO,y:t.ZERO};if(!t.eql(l,t.ONE))throw new Error("invZ was invalid");return{x:v,y:g}}),et=a.memoized(m=>{if(m.is0()){if(n.allowInfinityPoint&&!t.is0(m.py))return;throw new Error("bad point: ZERO")}const{x:e,y:s}=m.toAffine();if(!t.isValid(e)||!t.isValid(s))throw new Error("bad point: x or y not FE");const c=t.sqr(s),d=x(e);if(!t.eql(c,d))throw new Error("bad point: equation left != right");if(!m.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class w{constructor(e,s,c){if(this.px=e,this.py=s,this.pz=c,e==null||!t.isValid(e))throw new Error("x required");if(s==null||!t.isValid(s))throw new Error("y required");if(c==null||!t.isValid(c))throw new Error("z required");Object.freeze(this)}static fromAffine(e){const{x:s,y:c}=e||{};if(!e||!t.isValid(s)||!t.isValid(c))throw new Error("invalid affine point");if(e instanceof w)throw new Error("projective point not allowed");const d=p=>t.eql(p,t.ZERO);return d(s)&&d(c)?w.ZERO:new w(s,c,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(e){const s=t.invertBatch(e.map(c=>c.pz));return e.map((c,d)=>c.toAffine(s[d])).map(w.fromAffine)}static fromHex(e){const s=w.fromAffine(Z(a.ensureBytes("pointHex",e)));return s.assertValidity(),s}static fromPrivateKey(e){return w.BASE.multiply(R(e))}static msm(e,s){return tt.pippenger(w,b,e,s)}_setWindowSize(e){j.setWindowSize(this,e)}assertValidity(){et(this)}hasEvenY(){const{y:e}=this.toAffine();if(t.isOdd)return!t.isOdd(e);throw new Error("Field doesn't support isOdd")}equals(e){L(e);const{px:s,py:c,pz:d}=this,{px:p,py:v,pz:g}=e,l=t.eql(t.mul(s,g),t.mul(p,d)),y=t.eql(t.mul(c,g),t.mul(v,d));return l&&y}negate(){return new w(this.px,t.neg(this.py),this.pz)}double(){const{a:e,b:s}=n,c=t.mul(s,st),{px:d,py:p,pz:v}=this;let g=t.ZERO,l=t.ZERO,y=t.ZERO,u=t.mul(d,d),N=t.mul(p,p),S=t.mul(v,v),B=t.mul(d,p);return B=t.add(B,B),y=t.mul(d,v),y=t.add(y,y),g=t.mul(e,y),l=t.mul(c,S),l=t.add(g,l),g=t.sub(N,l),l=t.add(N,l),l=t.mul(g,l),g=t.mul(B,g),y=t.mul(c,y),S=t.mul(e,S),B=t.sub(u,S),B=t.mul(e,B),B=t.add(B,y),y=t.add(u,u),u=t.add(y,u),u=t.add(u,S),u=t.mul(u,B),l=t.add(l,u),S=t.mul(p,v),S=t.add(S,S),u=t.mul(S,B),g=t.sub(g,u),y=t.mul(S,N),y=t.add(y,y),y=t.add(y,y),new w(g,l,y)}add(e){L(e);const{px:s,py:c,pz:d}=this,{px:p,py:v,pz:g}=e;let l=t.ZERO,y=t.ZERO,u=t.ZERO;const N=n.a,S=t.mul(n.b,st);let B=t.mul(s,p),F=t.mul(c,v),r=t.mul(d,g),o=t.add(s,c),i=t.add(p,v);o=t.mul(o,i),i=t.add(B,F),o=t.sub(o,i),i=t.add(s,d);let f=t.add(p,g);return i=t.mul(i,f),f=t.add(B,r),i=t.sub(i,f),f=t.add(c,d),l=t.add(v,g),f=t.mul(f,l),l=t.add(F,r),f=t.sub(f,l),u=t.mul(N,i),l=t.mul(S,r),u=t.add(l,u),l=t.sub(F,u),u=t.add(F,u),y=t.mul(l,u),F=t.add(B,B),F=t.add(F,B),r=t.mul(N,r),i=t.mul(S,i),F=t.add(F,r),r=t.sub(B,r),r=t.mul(N,r),i=t.add(i,r),B=t.mul(F,i),y=t.add(y,B),B=t.mul(f,i),l=t.mul(o,l),l=t.sub(l,B),B=t.mul(o,F),u=t.mul(f,u),u=t.add(u,B),new w(l,y,u)}subtract(e){return this.add(e.negate())}is0(){return this.equals(w.ZERO)}wNAF(e){return j.wNAFCached(this,e,w.normalizeZ)}multiplyUnsafe(e){const{endo:s,n:c}=n;a.aInRange("scalar",e,C,c);const d=w.ZERO;if(e===C)return d;if(this.is0()||e===T)return this;if(!s||j.hasPrecomputes(this))return j.wNAFCachedUnsafe(this,e,w.normalizeZ);let{k1neg:p,k1:v,k2neg:g,k2:l}=s.splitScalar(e),y=d,u=d,N=this;for(;v>C||l>C;)v&T&&(y=y.add(N)),l&T&&(u=u.add(N)),N=N.double(),v>>=T,l>>=T;return p&&(y=y.negate()),g&&(u=u.negate()),u=new w(t.mul(u.px,s.beta),u.py,u.pz),y.add(u)}multiply(e){const{endo:s,n:c}=n;a.aInRange("scalar",e,T,c);let d,p;if(s){const{k1neg:v,k1:g,k2neg:l,k2:y}=s.splitScalar(e);let{p:u,f:N}=this.wNAF(g),{p:S,f:B}=this.wNAF(y);u=j.constTimeNegate(v,u),S=j.constTimeNegate(l,S),S=new w(t.mul(S.px,s.beta),S.py,S.pz),d=u.add(S),p=N.add(B)}else{const{p:v,f:g}=this.wNAF(e);d=v,p=g}return w.normalizeZ([d,p])[0]}multiplyAndAddUnsafe(e,s,c){const d=w.BASE,p=(g,l)=>l===C||l===T||!g.equals(d)?g.multiplyUnsafe(l):g.multiply(l),v=p(this,s).add(p(e,c));return v.is0()?void 0:v}toAffine(e){return P(this,e)}isTorsionFree(){const{h:e,isTorsionFree:s}=n;if(e===T)return!0;if(s)return s(w,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:e,clearCofactor:s}=n;return e===T?this:s?s(w,this):this.multiplyUnsafe(n.h)}toRawBytes(e=!0){return a.abool("isCompressed",e),this.assertValidity(),O(w,this,e)}toHex(e=!0){return a.abool("isCompressed",e),a.bytesToHex(this.toRawBytes(e))}}w.BASE=new w(n.Gx,n.Gy,t.ONE),w.ZERO=new w(t.ZERO,t.ONE,t.ZERO);const M=n.nBitLength,j=tt.wNAF(w,n.endo?Math.ceil(M/2):M);return{CURVE:n,ProjectivePoint:w,normPrivateKeyToScalar:R,weierstrassEquation:x,isWithinCurveOrder:V}}function dt(h){const n=tt.validateBasic(h);return a.validateObject(n,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...n})}function ft(h){const n=dt(h),{Fp:t,n:b}=n,O=t.BYTES+1,Z=2*t.BYTES+1;function x(r){return Q.mod(r,b)}function V(r){return Q.invert(r,b)}const{ProjectivePoint:R,normPrivateKeyToScalar:L,weierstrassEquation:P,isWithinCurveOrder:et}=at({...n,toBytes(r,o,i){const f=o.toAffine(),E=t.toBytes(f.x),A=a.concatBytes;return a.abool("isCompressed",i),i?A(Uint8Array.from([o.hasEvenY()?2:3]),E):A(Uint8Array.from([4]),E,t.toBytes(f.y))},fromBytes(r){const o=r.length,i=r[0],f=r.subarray(1);if(o===O&&(i===2||i===3)){const E=a.bytesToNumberBE(f);if(!a.inRange(E,T,t.ORDER))throw new Error("Point is not on curve");const A=P(E);let z;try{z=t.sqrt(A)}catch(U){const H=U instanceof Error?": "+U.message:"";throw new Error("Point is not on curve"+H)}const q=(z&T)===T;return(i&1)===1!==q&&(z=t.neg(z)),{x:E,y:z}}else if(o===Z&&i===4){const E=t.fromBytes(f.subarray(0,t.BYTES)),A=t.fromBytes(f.subarray(t.BYTES,2*t.BYTES));return{x:E,y:A}}else{const E=O,A=Z;throw new Error("invalid Point, expected length of "+E+", or uncompressed "+A+", got "+o)}}}),w=r=>a.bytesToHex(a.numberToBytesBE(r,n.nByteLength));function M(r){const o=b>>T;return r>o}function j(r){return M(r)?x(-r):r}const m=(r,o,i)=>a.bytesToNumberBE(r.slice(o,i));class e{constructor(o,i,f){this.r=o,this.s=i,this.recovery=f,this.assertValidity()}static fromCompact(o){const i=n.nByteLength;return o=a.ensureBytes("compactSignature",o,i*2),new e(m(o,0,i),m(o,i,2*i))}static fromDER(o){const{r:i,s:f}=Y.toSig(a.ensureBytes("DER",o));return new e(i,f)}assertValidity(){a.aInRange("r",this.r,T,b),a.aInRange("s",this.s,T,b)}addRecoveryBit(o){return new e(this.r,this.s,o)}recoverPublicKey(o){const{r:i,s:f,recovery:E}=this,A=g(a.ensureBytes("msgHash",o));if(E==null||![0,1,2,3].includes(E))throw new Error("recovery id invalid");const z=E===2||E===3?i+n.n:i;if(z>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const q=E&1?"03":"02",I=R.fromHex(q+w(z)),U=V(z),H=x(-A*U),X=x(f*U),D=R.BASE.multiplyAndAddUnsafe(I,H,X);if(!D)throw new Error("point at infinify");return D.assertValidity(),D}hasHighS(){return M(this.s)}normalizeS(){return this.hasHighS()?new e(this.r,x(-this.s),this.recovery):this}toDERRawBytes(){return a.hexToBytes(this.toDERHex())}toDERHex(){return Y.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return a.hexToBytes(this.toCompactHex())}toCompactHex(){return w(this.r)+w(this.s)}}const s={isValidPrivateKey(r){try{return L(r),!0}catch{return!1}},normPrivateKeyToScalar:L,randomPrivateKey:()=>{const r=Q.getMinHashLength(n.n);return Q.mapHashToField(n.randomBytes(r),n.n)},precompute(r=8,o=R.BASE){return o._setWindowSize(r),o.multiply(BigInt(3)),o}};function c(r,o=!0){return R.fromPrivateKey(r).toRawBytes(o)}function d(r){const o=a.isBytes(r),i=typeof r=="string",f=(o||i)&&r.length;return o?f===O||f===Z:i?f===2*O||f===2*Z:r instanceof R}function p(r,o,i=!0){if(d(r))throw new Error("first arg must be private key");if(!d(o))throw new Error("second arg must be public key");return R.fromHex(o).multiply(L(r)).toRawBytes(i)}const v=n.bits2int||function(r){if(r.length>8192)throw new Error("input is too large");const o=a.bytesToNumberBE(r),i=r.length*8-n.nBitLength;return i>0?o>>BigInt(i):o},g=n.bits2int_modN||function(r){return x(v(r))},l=a.bitMask(n.nBitLength);function y(r){return a.aInRange("num < 2^"+n.nBitLength,r,C,l),a.numberToBytesBE(r,n.nByteLength)}function u(r,o,i=N){if(["recovered","canonical"].some(K=>K in i))throw new Error("sign() legacy options not supported");const{hash:f,randomBytes:E}=n;let{lowS:A,prehash:z,extraEntropy:q}=i;A==null&&(A=!0),r=a.ensureBytes("msgHash",r),ot(i),z&&(r=a.ensureBytes("prehashed msgHash",f(r)));const I=g(r),U=L(o),H=[y(U),y(I)];if(q!=null&&q!==!1){const K=q===!0?E(t.BYTES):q;H.push(a.ensureBytes("extraEntropy",K))}const X=a.concatBytes(...H),D=I;function nt(K){const W=v(K);if(!et(W))return;const rt=V(W),$=R.BASE.multiply(W).toAffine(),k=x($.x);if(k===C)return;const J=x(rt*x(D+k*U));if(J===C)return;let _=($.x===k?0:2)|Number($.y&T),G=J;return A&&M(J)&&(G=j(J),_^=1),new e(k,G,_)}return{seed:X,k2sig:nt}}const N={lowS:n.lowS,prehash:!1},S={lowS:n.lowS,prehash:!1};function B(r,o,i=N){const{seed:f,k2sig:E}=u(r,o,i),A=n;return a.createHmacDrbg(A.hash.outputLen,A.nByteLength,A.hmac)(f,E)}R.BASE._setWindowSize(8);function F(r,o,i,f=S){var _;const E=r;o=a.ensureBytes("msgHash",o),i=a.ensureBytes("publicKey",i);const{lowS:A,prehash:z,format:q}=f;if(ot(f),"strict"in f)throw new Error("options.strict was renamed to lowS");if(q!==void 0&&q!=="compact"&&q!=="der")throw new Error("format must be compact or der");const I=typeof E=="string"||a.isBytes(E),U=!I&&!q&&typeof E=="object"&&E!==null&&typeof E.r=="bigint"&&typeof E.s=="bigint";if(!I&&!U)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let H,X;try{if(U&&(H=new e(E.r,E.s)),I){try{q!=="compact"&&(H=e.fromDER(E))}catch(G){if(!(G instanceof Y.Err))throw G}!H&&q!=="der"&&(H=e.fromCompact(E))}X=R.fromHex(i)}catch{return!1}if(!H||A&&H.hasHighS())return!1;z&&(o=n.hash(o));const{r:D,s:nt}=H,K=g(o),W=V(nt),rt=x(K*W),$=x(D*W),k=(_=R.BASE.multiplyAndAddUnsafe(X,rt,$))==null?void 0:_.toAffine();return k?x(k.x)===D:!1}return{CURVE:n,getPublicKey:c,getSharedSecret:p,sign:B,verify:F,ProjectivePoint:R,Signature:e,utils:s}}exports.DER=Y;exports.DERErr=it;exports.weierstrass=ft;exports.weierstrassPoints=at;
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=BigInt(2**32-1),i=BigInt(32);function u(t,e=!1){return e?{h:Number(t&n),l:Number(t>>i&n)}:{h:Number(t>>i&n)|0,l:Number(t&n)|0}}function g(t,e=!1){let r=new Uint32Array(t.length),l=new Uint32Array(t.length);for(let o=0;o<t.length;o++){const{h:c,l:f}=u(t[o],e);[r[o],l[o]]=[c,f]}return[r,l]}const B=(t,e,r)=>t<<r|e>>>32-r,h=(t,e,r)=>e<<r|t>>>32-r,m=(t,e,r)=>e<<r-32|t>>>64-r,S=(t,e,r)=>t<<r-32|e>>>64-r;exports.fromBig=u;exports.rotlBH=m;exports.rotlBL=S;exports.rotlSH=B;exports.rotlSL=h;exports.split=g;
|