@gardenfi/utils 2.0.6-beta.16 → 2.0.6-beta.18
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/index101.cjs +1 -1
- package/dist/index101.js +11 -10
- package/dist/index102.cjs +1 -1
- package/dist/index102.js +17 -18
- package/dist/index103.cjs +1 -1
- package/dist/index103.js +641 -6
- package/dist/index104.cjs +1 -1
- package/dist/index104.js +170 -10
- package/dist/index105.cjs +1 -1
- package/dist/index105.js +126 -17
- package/dist/index106.cjs +2 -1
- package/dist/index106.js +3 -644
- package/dist/index107.cjs +1 -1
- package/dist/index107.js +36 -170
- package/dist/index108.cjs +1 -1
- package/dist/index108.js +2 -128
- package/dist/index109.cjs +1 -2
- package/dist/index109.js +2 -3
- package/dist/index110.cjs +1 -1
- package/dist/index110.js +33 -34
- package/dist/index111.cjs +1 -1
- package/dist/index111.js +12 -2
- package/dist/index112.cjs +1 -1
- package/dist/index112.js +20 -2
- package/dist/index113.cjs +1 -1
- package/dist/index113.js +8 -37
- package/dist/index116.cjs +1 -1
- package/dist/index116.js +1 -1
- package/dist/index117.cjs +1 -1
- package/dist/index117.js +1 -1
- package/dist/index20.cjs +1 -1
- package/dist/index20.js +1 -1
- package/dist/index21.cjs +1 -1
- package/dist/index21.js +2 -2
- package/dist/index22.cjs +1 -1
- package/dist/index22.js +1 -1
- package/dist/index23.cjs +1 -1
- package/dist/index23.js +3 -3
- package/dist/index32.cjs +1 -1
- package/dist/index32.js +1 -1
- package/dist/index33.cjs +1 -1
- package/dist/index33.js +1 -1
- package/dist/index36.cjs +1 -1
- package/dist/index36.js +1 -1
- package/dist/index42.cjs +1 -1
- package/dist/index42.js +1 -1
- package/dist/index44.cjs +1 -1
- package/dist/index44.js +1 -1
- package/dist/index49.cjs +1 -1
- package/dist/index49.js +1 -1
- package/dist/index60.cjs +1 -1
- package/dist/index60.js +1 -1
- package/dist/index61.cjs +1 -1
- package/dist/index61.js +1 -1
- package/dist/index62.cjs +2 -1
- package/dist/index62.js +57 -38
- package/dist/index63.cjs +1 -1
- package/dist/index63.js +21 -34
- package/dist/index64.cjs +1 -1
- package/dist/index64.js +37 -66
- package/dist/index65.cjs +1 -1
- package/dist/index65.js +34 -112
- package/dist/index66.cjs +1 -1
- package/dist/index66.js +63 -61
- package/dist/index67.cjs +1 -1
- package/dist/index67.js +113 -2
- package/dist/index68.cjs +1 -1
- package/dist/index68.js +66 -15
- package/dist/index69.cjs +1 -1
- package/dist/index69.js +2 -224
- package/dist/index70.cjs +1 -1
- package/dist/index70.js +13 -228
- package/dist/index71.cjs +1 -2
- package/dist/index71.js +220 -56
- package/dist/index72.cjs +1 -1
- package/dist/index72.js +228 -18
- package/dist/index74.cjs +1 -1
- package/dist/index74.js +2 -2
- package/dist/index77.cjs +1 -1
- package/dist/index77.js +1 -1
- package/dist/index78.cjs +1 -1
- package/dist/index78.js +3 -3
- package/dist/index85.cjs +1 -1
- package/dist/index85.js +5 -5
- package/dist/index88.cjs +1 -1
- package/dist/index88.js +2 -2
- package/dist/index9.cjs +1 -1
- package/dist/index9.js +41 -49
- package/dist/index91.cjs +1 -1
- package/dist/index91.js +1 -1
- package/dist/index93.cjs +1 -1
- package/dist/index93.js +1 -1
- package/dist/index94.cjs +1 -1
- package/dist/index94.js +1 -1
- package/dist/index98.cjs +1 -1
- package/dist/index98.js +2 -2
- package/dist/index99.cjs +1 -1
- package/dist/index99.js +1 -1
- package/package.json +1 -1
package/dist/index107.js
CHANGED
|
@@ -1,175 +1,41 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
function A(e, r) {
|
|
10
|
-
if (!Number.isSafeInteger(e) || e <= 0 || e > r)
|
|
11
|
-
throw new Error("invalid window size, expected [1.." + r + "], got W=" + e);
|
|
12
|
-
}
|
|
13
|
-
function b(e, r) {
|
|
14
|
-
A(e, r);
|
|
15
|
-
const t = Math.ceil(r / e) + 1, n = 2 ** (e - 1);
|
|
16
|
-
return { windows: t, windowSize: n };
|
|
17
|
-
}
|
|
18
|
-
function L(e, r) {
|
|
19
|
-
if (!Array.isArray(e))
|
|
20
|
-
throw new Error("array expected");
|
|
21
|
-
e.forEach((t, n) => {
|
|
22
|
-
if (!(t instanceof r))
|
|
23
|
-
throw new Error("invalid point at index " + n);
|
|
24
|
-
});
|
|
25
|
-
}
|
|
26
|
-
function k(e, r) {
|
|
27
|
-
if (!Array.isArray(e))
|
|
28
|
-
throw new Error("array of scalars expected");
|
|
29
|
-
e.forEach((t, n) => {
|
|
30
|
-
if (!r.isValid(t))
|
|
31
|
-
throw new Error("invalid scalar at index " + n);
|
|
1
|
+
import { SliceOffsetOutOfBoundsError as t } from "./index101.js";
|
|
2
|
+
import { isHex as p } from "./index76.js";
|
|
3
|
+
import { size as r } from "./index75.js";
|
|
4
|
+
function w(e, f, i, { strict: o } = {}) {
|
|
5
|
+
return p(e, { strict: !1 }) ? u(e, f, i, {
|
|
6
|
+
strict: o
|
|
7
|
+
}) : m(e, f, i, {
|
|
8
|
+
strict: o
|
|
32
9
|
});
|
|
33
10
|
}
|
|
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
|
-
* @param elm Point instance
|
|
60
|
-
* @param W window size
|
|
61
|
-
* @returns precomputed point tables flattened to a single array
|
|
62
|
-
*/
|
|
63
|
-
precomputeWindow(t, n) {
|
|
64
|
-
const { windows: i, windowSize: o } = b(n, r), a = [];
|
|
65
|
-
let c = t, d = c;
|
|
66
|
-
for (let h = 0; h < i; h++) {
|
|
67
|
-
d = c, a.push(d);
|
|
68
|
-
for (let w = 1; w < o; w++)
|
|
69
|
-
d = d.add(c), a.push(d);
|
|
70
|
-
c = d.double();
|
|
71
|
-
}
|
|
72
|
-
return a;
|
|
73
|
-
},
|
|
74
|
-
/**
|
|
75
|
-
* Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
|
|
76
|
-
* @param W window size
|
|
77
|
-
* @param precomputes precomputed tables
|
|
78
|
-
* @param n scalar (we don't check here, but should be less than curve order)
|
|
79
|
-
* @returns real and fake (for const-time) points
|
|
80
|
-
*/
|
|
81
|
-
wNAF(t, n, i) {
|
|
82
|
-
const { windows: o, windowSize: a } = b(t, r);
|
|
83
|
-
let c = e.ZERO, d = e.BASE;
|
|
84
|
-
const h = BigInt(2 ** t - 1), w = 2 ** t, l = BigInt(t);
|
|
85
|
-
for (let u = 0; u < o; u++) {
|
|
86
|
-
const s = u * a;
|
|
87
|
-
let f = Number(i & h);
|
|
88
|
-
i >>= l, f > a && (f -= w, i += p);
|
|
89
|
-
const g = s, N = s + Math.abs(f) - 1, y = u % 2 !== 0, M = f < 0;
|
|
90
|
-
f === 0 ? d = d.add(m(y, n[g])) : c = c.add(m(M, n[N]));
|
|
91
|
-
}
|
|
92
|
-
return { p: c, f: d };
|
|
93
|
-
},
|
|
94
|
-
/**
|
|
95
|
-
* Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
|
|
96
|
-
* @param W window size
|
|
97
|
-
* @param precomputes precomputed tables
|
|
98
|
-
* @param n scalar (we don't check here, but should be less than curve order)
|
|
99
|
-
* @param acc accumulator point to add result of multiplication
|
|
100
|
-
* @returns point
|
|
101
|
-
*/
|
|
102
|
-
wNAFUnsafe(t, n, i, o = e.ZERO) {
|
|
103
|
-
const { windows: a, windowSize: c } = b(t, r), d = BigInt(2 ** t - 1), h = 2 ** t, w = BigInt(t);
|
|
104
|
-
for (let l = 0; l < a; l++) {
|
|
105
|
-
const u = l * c;
|
|
106
|
-
if (i === I)
|
|
107
|
-
break;
|
|
108
|
-
let s = Number(i & d);
|
|
109
|
-
if (i >>= w, s > c && (s -= h, i += p), s === 0)
|
|
110
|
-
continue;
|
|
111
|
-
let f = n[u + Math.abs(s) - 1];
|
|
112
|
-
s < 0 && (f = f.negate()), o = o.add(f);
|
|
113
|
-
}
|
|
114
|
-
return o;
|
|
115
|
-
},
|
|
116
|
-
getPrecomputes(t, n, i) {
|
|
117
|
-
let o = B.get(n);
|
|
118
|
-
return o || (o = this.precomputeWindow(n, t), t !== 1 && B.set(n, i(o))), o;
|
|
119
|
-
},
|
|
120
|
-
wNAFCached(t, n, i) {
|
|
121
|
-
const o = S(t);
|
|
122
|
-
return this.wNAF(o, this.getPrecomputes(o, t, i), n);
|
|
123
|
-
},
|
|
124
|
-
wNAFCachedUnsafe(t, n, i, o) {
|
|
125
|
-
const a = S(t);
|
|
126
|
-
return a === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(a, this.getPrecomputes(a, t, i), n, o);
|
|
127
|
-
},
|
|
128
|
-
// We calculate precomputes for elliptic curve point multiplication
|
|
129
|
-
// using windowed method. This specifies window size and
|
|
130
|
-
// stores precomputed values. Usually only base point would be precomputed.
|
|
131
|
-
setWindowSize(t, n) {
|
|
132
|
-
A(n, r), E.set(t, n), B.delete(t);
|
|
133
|
-
}
|
|
134
|
-
};
|
|
135
|
-
}
|
|
136
|
-
function Z(e, r, t, n) {
|
|
137
|
-
if (L(t, e), k(n, r), t.length !== n.length)
|
|
138
|
-
throw new Error("arrays of points and scalars must have equal length");
|
|
139
|
-
const i = e.ZERO, o = O(BigInt(t.length)), a = o > 12 ? o - 3 : o > 4 ? o - 2 : o ? 2 : 1, c = (1 << a) - 1, d = new Array(c + 1).fill(i), h = Math.floor((r.BITS - 1) / a) * a;
|
|
140
|
-
let w = i;
|
|
141
|
-
for (let l = h; l >= 0; l -= a) {
|
|
142
|
-
d.fill(i);
|
|
143
|
-
for (let s = 0; s < n.length; s++) {
|
|
144
|
-
const f = n[s], g = Number(f >> BigInt(l) & BigInt(c));
|
|
145
|
-
d[g] = d[g].add(t[s]);
|
|
146
|
-
}
|
|
147
|
-
let u = i;
|
|
148
|
-
for (let s = d.length - 1, f = i; s > 0; s--)
|
|
149
|
-
f = f.add(d[s]), u = u.add(f);
|
|
150
|
-
if (w = w.add(u), l !== 0)
|
|
151
|
-
for (let s = 0; s < a; s++)
|
|
152
|
-
w = w.double();
|
|
153
|
-
}
|
|
154
|
-
return w;
|
|
155
|
-
}
|
|
156
|
-
function U(e) {
|
|
157
|
-
return z(e.Fp), x(e, {
|
|
158
|
-
n: "bigint",
|
|
159
|
-
h: "bigint",
|
|
160
|
-
Gx: "field",
|
|
161
|
-
Gy: "field"
|
|
162
|
-
}, {
|
|
163
|
-
nBitLength: "isSafeInteger",
|
|
164
|
-
nByteLength: "isSafeInteger"
|
|
165
|
-
}), Object.freeze({
|
|
166
|
-
...F(e.n, e.nBitLength),
|
|
167
|
-
...e,
|
|
168
|
-
p: e.Fp.ORDER
|
|
169
|
-
});
|
|
11
|
+
function s(e, f) {
|
|
12
|
+
if (typeof f == "number" && f > 0 && f > r(e) - 1)
|
|
13
|
+
throw new t({
|
|
14
|
+
offset: f,
|
|
15
|
+
position: "start",
|
|
16
|
+
size: r(e)
|
|
17
|
+
});
|
|
18
|
+
}
|
|
19
|
+
function c(e, f, i) {
|
|
20
|
+
if (typeof f == "number" && typeof i == "number" && r(e) !== i - f)
|
|
21
|
+
throw new t({
|
|
22
|
+
offset: i,
|
|
23
|
+
position: "end",
|
|
24
|
+
size: r(e)
|
|
25
|
+
});
|
|
26
|
+
}
|
|
27
|
+
function m(e, f, i, { strict: o } = {}) {
|
|
28
|
+
s(e, f);
|
|
29
|
+
const n = e.slice(f, i);
|
|
30
|
+
return o && c(n, f, i), n;
|
|
31
|
+
}
|
|
32
|
+
function u(e, f, i, { strict: o } = {}) {
|
|
33
|
+
s(e, f);
|
|
34
|
+
const n = `0x${e.replace("0x", "").slice((f ?? 0) * 2, (i ?? e.length) * 2)}`;
|
|
35
|
+
return o && c(n, f, i), n;
|
|
170
36
|
}
|
|
171
37
|
export {
|
|
172
|
-
|
|
173
|
-
|
|
174
|
-
|
|
38
|
+
w as slice,
|
|
39
|
+
m as sliceBytes,
|
|
40
|
+
u as sliceHex
|
|
175
41
|
};
|
package/dist/index108.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 e=1;exports.versionedHashVersionKzg=e;
|
package/dist/index108.js
CHANGED
|
@@ -1,130 +1,4 @@
|
|
|
1
|
-
|
|
2
|
-
const h = {
|
|
3
|
-
bytes: new Uint8Array(),
|
|
4
|
-
dataView: new DataView(new ArrayBuffer(0)),
|
|
5
|
-
position: 0,
|
|
6
|
-
positionReadCount: /* @__PURE__ */ new Map(),
|
|
7
|
-
recursiveReadCount: 0,
|
|
8
|
-
recursiveReadLimit: Number.POSITIVE_INFINITY,
|
|
9
|
-
assertReadLimit() {
|
|
10
|
-
if (this.recursiveReadCount >= this.recursiveReadLimit)
|
|
11
|
-
throw new n({
|
|
12
|
-
count: this.recursiveReadCount + 1,
|
|
13
|
-
limit: this.recursiveReadLimit
|
|
14
|
-
});
|
|
15
|
-
},
|
|
16
|
-
assertPosition(t) {
|
|
17
|
-
if (t < 0 || t > this.bytes.length - 1)
|
|
18
|
-
throw new e({
|
|
19
|
-
length: this.bytes.length,
|
|
20
|
-
position: t
|
|
21
|
-
});
|
|
22
|
-
},
|
|
23
|
-
decrementPosition(t) {
|
|
24
|
-
if (t < 0)
|
|
25
|
-
throw new o({ offset: t });
|
|
26
|
-
const i = this.position - t;
|
|
27
|
-
this.assertPosition(i), this.position = i;
|
|
28
|
-
},
|
|
29
|
-
getReadCount(t) {
|
|
30
|
-
return this.positionReadCount.get(t || this.position) || 0;
|
|
31
|
-
},
|
|
32
|
-
incrementPosition(t) {
|
|
33
|
-
if (t < 0)
|
|
34
|
-
throw new o({ offset: t });
|
|
35
|
-
const i = this.position + t;
|
|
36
|
-
this.assertPosition(i), this.position = i;
|
|
37
|
-
},
|
|
38
|
-
inspectByte(t) {
|
|
39
|
-
const i = t ?? this.position;
|
|
40
|
-
return this.assertPosition(i), this.bytes[i];
|
|
41
|
-
},
|
|
42
|
-
inspectBytes(t, i) {
|
|
43
|
-
const s = i ?? this.position;
|
|
44
|
-
return this.assertPosition(s + t - 1), this.bytes.subarray(s, s + t);
|
|
45
|
-
},
|
|
46
|
-
inspectUint8(t) {
|
|
47
|
-
const i = t ?? this.position;
|
|
48
|
-
return this.assertPosition(i), this.bytes[i];
|
|
49
|
-
},
|
|
50
|
-
inspectUint16(t) {
|
|
51
|
-
const i = t ?? this.position;
|
|
52
|
-
return this.assertPosition(i + 1), this.dataView.getUint16(i);
|
|
53
|
-
},
|
|
54
|
-
inspectUint24(t) {
|
|
55
|
-
const i = t ?? this.position;
|
|
56
|
-
return this.assertPosition(i + 2), (this.dataView.getUint16(i) << 8) + this.dataView.getUint8(i + 2);
|
|
57
|
-
},
|
|
58
|
-
inspectUint32(t) {
|
|
59
|
-
const i = t ?? this.position;
|
|
60
|
-
return this.assertPosition(i + 3), this.dataView.getUint32(i);
|
|
61
|
-
},
|
|
62
|
-
pushByte(t) {
|
|
63
|
-
this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
|
|
64
|
-
},
|
|
65
|
-
pushBytes(t) {
|
|
66
|
-
this.assertPosition(this.position + t.length - 1), this.bytes.set(t, this.position), this.position += t.length;
|
|
67
|
-
},
|
|
68
|
-
pushUint8(t) {
|
|
69
|
-
this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
|
|
70
|
-
},
|
|
71
|
-
pushUint16(t) {
|
|
72
|
-
this.assertPosition(this.position + 1), this.dataView.setUint16(this.position, t), this.position += 2;
|
|
73
|
-
},
|
|
74
|
-
pushUint24(t) {
|
|
75
|
-
this.assertPosition(this.position + 2), this.dataView.setUint16(this.position, t >> 8), this.dataView.setUint8(this.position + 2, t & 255), this.position += 3;
|
|
76
|
-
},
|
|
77
|
-
pushUint32(t) {
|
|
78
|
-
this.assertPosition(this.position + 3), this.dataView.setUint32(this.position, t), this.position += 4;
|
|
79
|
-
},
|
|
80
|
-
readByte() {
|
|
81
|
-
this.assertReadLimit(), this._touch();
|
|
82
|
-
const t = this.inspectByte();
|
|
83
|
-
return this.position++, t;
|
|
84
|
-
},
|
|
85
|
-
readBytes(t, i) {
|
|
86
|
-
this.assertReadLimit(), this._touch();
|
|
87
|
-
const s = this.inspectBytes(t);
|
|
88
|
-
return this.position += i ?? t, s;
|
|
89
|
-
},
|
|
90
|
-
readUint8() {
|
|
91
|
-
this.assertReadLimit(), this._touch();
|
|
92
|
-
const t = this.inspectUint8();
|
|
93
|
-
return this.position += 1, t;
|
|
94
|
-
},
|
|
95
|
-
readUint16() {
|
|
96
|
-
this.assertReadLimit(), this._touch();
|
|
97
|
-
const t = this.inspectUint16();
|
|
98
|
-
return this.position += 2, t;
|
|
99
|
-
},
|
|
100
|
-
readUint24() {
|
|
101
|
-
this.assertReadLimit(), this._touch();
|
|
102
|
-
const t = this.inspectUint24();
|
|
103
|
-
return this.position += 3, t;
|
|
104
|
-
},
|
|
105
|
-
readUint32() {
|
|
106
|
-
this.assertReadLimit(), this._touch();
|
|
107
|
-
const t = this.inspectUint32();
|
|
108
|
-
return this.position += 4, t;
|
|
109
|
-
},
|
|
110
|
-
get remaining() {
|
|
111
|
-
return this.bytes.length - this.position;
|
|
112
|
-
},
|
|
113
|
-
setPosition(t) {
|
|
114
|
-
const i = this.position;
|
|
115
|
-
return this.assertPosition(t), this.position = t, () => this.position = i;
|
|
116
|
-
},
|
|
117
|
-
_touch() {
|
|
118
|
-
if (this.recursiveReadLimit === Number.POSITIVE_INFINITY)
|
|
119
|
-
return;
|
|
120
|
-
const t = this.getReadCount();
|
|
121
|
-
this.positionReadCount.set(this.position, t + 1), t > 0 && this.recursiveReadCount++;
|
|
122
|
-
}
|
|
123
|
-
};
|
|
124
|
-
function a(t, { recursiveReadLimit: i = 8192 } = {}) {
|
|
125
|
-
const s = Object.create(h);
|
|
126
|
-
return s.bytes = t, s.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength), s.positionReadCount = /* @__PURE__ */ new Map(), s.recursiveReadLimit = i, s;
|
|
127
|
-
}
|
|
1
|
+
const e = 1;
|
|
128
2
|
export {
|
|
129
|
-
|
|
3
|
+
e as versionedHashVersionKzg
|
|
130
4
|
};
|
package/dist/index109.cjs
CHANGED
|
@@ -1,2 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
2
|
-
`;exports.presignMessagePrefix=e;
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=2n**256n-1n;exports.maxUint256=t;
|
package/dist/index109.js
CHANGED
package/dist/index110.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 a=require("./index108.cjs"),s=require("./index62.cjs");class i extends s.BaseError{constructor({maxSize:e,size:r}){super("Blob size is too large.",{metaMessages:[`Max: ${e} bytes`,`Given: ${r} bytes`],name:"BlobSizeTooLargeError"})}}class n extends s.BaseError{constructor(){super("Blob data must not be empty.",{name:"EmptyBlobError"})}}class t extends s.BaseError{constructor({hash:e,size:r}){super(`Versioned hash "${e}" size is invalid.`,{metaMessages:["Expected: 32",`Received: ${r}`],name:"InvalidVersionedHashSizeError"})}}class d extends s.BaseError{constructor({hash:e,version:r}){super(`Versioned hash "${e}" version is invalid.`,{metaMessages:[`Expected: ${a.versionedHashVersionKzg}`,`Received: ${r}`],name:"InvalidVersionedHashVersionError"})}}exports.BlobSizeTooLargeError=i;exports.EmptyBlobError=n;exports.InvalidVersionedHashSizeError=t;exports.InvalidVersionedHashVersionError=d;
|
package/dist/index110.js
CHANGED
|
@@ -1,41 +1,40 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
strict: o
|
|
9
|
-
});
|
|
10
|
-
}
|
|
11
|
-
function s(e, f) {
|
|
12
|
-
if (typeof f == "number" && f > 0 && f > r(e) - 1)
|
|
13
|
-
throw new t({
|
|
14
|
-
offset: f,
|
|
15
|
-
position: "start",
|
|
16
|
-
size: r(e)
|
|
1
|
+
import { versionedHashVersionKzg as a } from "./index108.js";
|
|
2
|
+
import { BaseError as s } from "./index62.js";
|
|
3
|
+
class t extends s {
|
|
4
|
+
constructor({ maxSize: e, size: r }) {
|
|
5
|
+
super("Blob size is too large.", {
|
|
6
|
+
metaMessages: [`Max: ${e} bytes`, `Given: ${r} bytes`],
|
|
7
|
+
name: "BlobSizeTooLargeError"
|
|
17
8
|
});
|
|
9
|
+
}
|
|
18
10
|
}
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
position: "end",
|
|
24
|
-
size: r(e)
|
|
25
|
-
});
|
|
11
|
+
class d extends s {
|
|
12
|
+
constructor() {
|
|
13
|
+
super("Blob data must not be empty.", { name: "EmptyBlobError" });
|
|
14
|
+
}
|
|
26
15
|
}
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
16
|
+
class l extends s {
|
|
17
|
+
constructor({ hash: e, size: r }) {
|
|
18
|
+
super(`Versioned hash "${e}" size is invalid.`, {
|
|
19
|
+
metaMessages: ["Expected: 32", `Received: ${r}`],
|
|
20
|
+
name: "InvalidVersionedHashSizeError"
|
|
21
|
+
});
|
|
22
|
+
}
|
|
31
23
|
}
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
24
|
+
class c extends s {
|
|
25
|
+
constructor({ hash: e, version: r }) {
|
|
26
|
+
super(`Versioned hash "${e}" version is invalid.`, {
|
|
27
|
+
metaMessages: [
|
|
28
|
+
`Expected: ${a}`,
|
|
29
|
+
`Received: ${r}`
|
|
30
|
+
],
|
|
31
|
+
name: "InvalidVersionedHashVersionError"
|
|
32
|
+
});
|
|
33
|
+
}
|
|
36
34
|
}
|
|
37
35
|
export {
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
36
|
+
t as BlobSizeTooLargeError,
|
|
37
|
+
d as EmptyBlobError,
|
|
38
|
+
l as InvalidVersionedHashSizeError,
|
|
39
|
+
c as InvalidVersionedHashVersionError
|
|
41
40
|
};
|
package/dist/index111.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index62.cjs");class t extends a.BaseError{constructor(e){const{docsPath:s,field:r,metaMessages:i}=e;super(`Invalid Sign-In with Ethereum message field "${r}".`,{docsPath:s,metaMessages:i,name:"SiweInvalidMessageFieldError"})}}exports.SiweInvalidMessageFieldError=t;
|
package/dist/index111.js
CHANGED
|
@@ -1,4 +1,14 @@
|
|
|
1
|
-
|
|
1
|
+
import { BaseError as i } from "./index62.js";
|
|
2
|
+
class d extends i {
|
|
3
|
+
constructor(e) {
|
|
4
|
+
const { docsPath: s, field: r, metaMessages: a } = e;
|
|
5
|
+
super(`Invalid Sign-In with Ethereum message field "${r}".`, {
|
|
6
|
+
docsPath: s,
|
|
7
|
+
metaMessages: a,
|
|
8
|
+
name: "SiweInvalidMessageFieldError"
|
|
9
|
+
});
|
|
10
|
+
}
|
|
11
|
+
}
|
|
2
12
|
export {
|
|
3
|
-
|
|
13
|
+
d as SiweInvalidMessageFieldError
|
|
4
14
|
};
|
package/dist/index112.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(e){if(/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e)||/%[^0-9a-f]/i.test(e)||/%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))return!1;const s=a(e),f=s[1],t=s[2],i=s[3],r=s[4],l=s[5];if(!(f!=null&&f.length&&i.length>=0))return!1;if(t!=null&&t.length){if(!(i.length===0||/^\//.test(i)))return!1}else if(/^\/\//.test(i))return!1;if(!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))return!1;let n="";return n+=`${f}:`,t!=null&&t.length&&(n+=`//${t}`),n+=i,r!=null&&r.length&&(n+=`?${r}`),l!=null&&l.length&&(n+=`#${l}`),n}function a(e){return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/)}exports.isUri=o;
|
package/dist/index112.js
CHANGED
|
@@ -1,4 +1,22 @@
|
|
|
1
|
-
|
|
1
|
+
function o(e) {
|
|
2
|
+
if (/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e) || /%[^0-9a-f]/i.test(e) || /%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))
|
|
3
|
+
return !1;
|
|
4
|
+
const s = a(e), f = s[1], t = s[2], i = s[3], r = s[4], l = s[5];
|
|
5
|
+
if (!(f != null && f.length && i.length >= 0))
|
|
6
|
+
return !1;
|
|
7
|
+
if (t != null && t.length) {
|
|
8
|
+
if (!(i.length === 0 || /^\//.test(i)))
|
|
9
|
+
return !1;
|
|
10
|
+
} else if (/^\/\//.test(i))
|
|
11
|
+
return !1;
|
|
12
|
+
if (!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))
|
|
13
|
+
return !1;
|
|
14
|
+
let n = "";
|
|
15
|
+
return n += `${f}:`, t != null && t.length && (n += `//${t}`), n += i, r != null && r.length && (n += `?${r}`), l != null && l.length && (n += `#${l}`), n;
|
|
16
|
+
}
|
|
17
|
+
function a(e) {
|
|
18
|
+
return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/);
|
|
19
|
+
}
|
|
2
20
|
export {
|
|
3
|
-
|
|
21
|
+
o as isUri
|
|
4
22
|
};
|
package/dist/index113.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function n(e){return{formatters:void 0,fees:void 0,serializers:void 0,...e}}exports.defineChain=n;
|
package/dist/index113.js
CHANGED
|
@@ -1,40 +1,11 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
});
|
|
9
|
-
}
|
|
10
|
-
}
|
|
11
|
-
class d extends s {
|
|
12
|
-
constructor() {
|
|
13
|
-
super("Blob data must not be empty.", { name: "EmptyBlobError" });
|
|
14
|
-
}
|
|
15
|
-
}
|
|
16
|
-
class l extends s {
|
|
17
|
-
constructor({ hash: e, size: r }) {
|
|
18
|
-
super(`Versioned hash "${e}" size is invalid.`, {
|
|
19
|
-
metaMessages: ["Expected: 32", `Received: ${r}`],
|
|
20
|
-
name: "InvalidVersionedHashSizeError"
|
|
21
|
-
});
|
|
22
|
-
}
|
|
23
|
-
}
|
|
24
|
-
class c extends s {
|
|
25
|
-
constructor({ hash: e, version: r }) {
|
|
26
|
-
super(`Versioned hash "${e}" version is invalid.`, {
|
|
27
|
-
metaMessages: [
|
|
28
|
-
`Expected: ${a}`,
|
|
29
|
-
`Received: ${r}`
|
|
30
|
-
],
|
|
31
|
-
name: "InvalidVersionedHashVersionError"
|
|
32
|
-
});
|
|
33
|
-
}
|
|
1
|
+
function n(e) {
|
|
2
|
+
return {
|
|
3
|
+
formatters: void 0,
|
|
4
|
+
fees: void 0,
|
|
5
|
+
serializers: void 0,
|
|
6
|
+
...e
|
|
7
|
+
};
|
|
34
8
|
}
|
|
35
9
|
export {
|
|
36
|
-
|
|
37
|
-
d as EmptyBlobError,
|
|
38
|
-
l as InvalidVersionedHashSizeError,
|
|
39
|
-
c as InvalidVersionedHashVersionError
|
|
10
|
+
n as defineChain
|
|
40
11
|
};
|
package/dist/index116.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index67.cjs"),s=require("./index76.cjs"),r=require("./index36.cjs");function o(t,i){return e.sha256(s.isHex(t,{strict:!1})?r.toBytes(t):t)}exports.sha256=o;
|
package/dist/index116.js
CHANGED
package/dist/index117.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index62.cjs");class t extends o.BaseError{constructor({offset:e}){super(`Offset \`${e}\` cannot be negative.`,{name:"NegativeOffsetError"})}}class i extends o.BaseError{constructor({length:e,position:r}){super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`,{name:"PositionOutOfBoundsError"})}}class n extends o.BaseError{constructor({count:e,limit:r}){super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`,{name:"RecursiveReadLimitExceededError"})}}exports.NegativeOffsetError=t;exports.PositionOutOfBoundsError=i;exports.RecursiveReadLimitExceededError=n;
|
package/dist/index117.js
CHANGED
package/dist/index20.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index113.cjs"),t=e.defineChain({id:1,name:"Ethereum",nativeCurrency:{name:"Ether",symbol:"ETH",decimals:18},rpcUrls:{default:{http:["https://eth.merkle.io"]}},blockExplorers:{default:{name:"Etherscan",url:"https://etherscan.io",apiUrl:"https://api.etherscan.io/api"}},contracts:{ensRegistry:{address:"0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e"},ensUniversalResolver:{address:"0xce01f8eee7E479C928F8919abD53E553a36CeF67",blockCreated:19258213},multicall3:{address:"0xca11bde05977b3631167028862be2a173976ca11",blockCreated:14353601}}});exports.mainnet=t;
|
package/dist/index20.js
CHANGED
package/dist/index21.cjs
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index111.cjs"),M=require("./index42.cjs"),h=require("./index112.cjs");function R(r){const{chainId:o,domain:s,expirationTime:l,issuedAt:m=new Date,nonce:a,notBefore:f,requestId:w,resources:g,scheme:i,uri:c,version:d}=r;{if(o!==Math.floor(o))throw new e.SiweInvalidMessageFieldError({field:"chainId",metaMessages:["- Chain ID must be a EIP-155 chain ID.","- See https://eips.ethereum.org/EIPS/eip-155","",`Provided value: ${o}`]});if(!(E.test(s)||F.test(s)||b.test(s)))throw new e.SiweInvalidMessageFieldError({field:"domain",metaMessages:["- Domain must be an RFC 3986 authority.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${s}`]});if(!A.test(a))throw new e.SiweInvalidMessageFieldError({field:"nonce",metaMessages:["- Nonce must be at least 8 characters.","- Nonce must be alphanumeric.","",`Provided value: ${a}`]});if(!h.isUri(c))throw new e.SiweInvalidMessageFieldError({field:"uri",metaMessages:["- URI must be a RFC 3986 URI referring to the resource that is the subject of the signing.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${c}`]});if(d!=="1")throw new e.SiweInvalidMessageFieldError({field:"version",metaMessages:["- Version must be '1'.","",`Provided value: ${d}`]});if(i&&!P.test(i))throw new e.SiweInvalidMessageFieldError({field:"scheme",metaMessages:["- Scheme must be an RFC 3986 URI scheme.","- See https://www.rfc-editor.org/rfc/rfc3986#section-3.1","",`Provided value: ${i}`]});const t=r.statement;if(t!=null&&t.includes(`
|
|
2
2
|
`))throw new e.SiweInvalidMessageFieldError({field:"statement",metaMessages:["- Statement must not include '\\n'.","",`Provided value: ${t}`]})}const $=M.getAddress(r.address),v=i?`${i}://${s}`:s,I=r.statement?`${r.statement}
|
|
3
3
|
`:"",S=`${v} wants you to sign in with your Ethereum account:
|
|
4
4
|
${$}
|
package/dist/index21.js
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
import { SiweInvalidMessageFieldError as e } from "./
|
|
1
|
+
import { SiweInvalidMessageFieldError as e } from "./index111.js";
|
|
2
2
|
import { getAddress as S } from "./index42.js";
|
|
3
|
-
import { isUri as $ } from "./
|
|
3
|
+
import { isUri as $ } from "./index112.js";
|
|
4
4
|
function C(n) {
|
|
5
5
|
const { chainId: i, domain: s, expirationTime: u, issuedAt: g = /* @__PURE__ */ new Date(), nonce: a, notBefore: m, requestId: h, resources: w, scheme: o, uri: c, version: f } = n;
|
|
6
6
|
{
|
package/dist/index22.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index113.cjs"),a=e.defineChain({id:11155111,name:"Sepolia",nativeCurrency:{name:"Sepolia Ether",symbol:"ETH",decimals:18},rpcUrls:{default:{http:["https://sepolia.drpc.org"]}},blockExplorers:{default:{name:"Etherscan",url:"https://sepolia.etherscan.io",apiUrl:"https://api-sepolia.etherscan.io/api"}},contracts:{multicall3:{address:"0xca11bde05977b3631167028862be2a173976ca11",blockCreated:751532},ensRegistry:{address:"0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e"},ensUniversalResolver:{address:"0xc8Af999e38273D658BE1b921b88A9Ddf005769cC",blockCreated:5317080}},testnet:!0});exports.sepolia=a;
|
package/dist/index22.js
CHANGED