@gardenfi/utils 3.1.0-beta.2 → 3.1.0-beta.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index10.cjs +1 -1
- package/dist/index10.js +4 -4
- package/dist/index102.cjs +1 -1
- package/dist/index102.js +4 -4
- package/dist/index104.cjs +1 -1
- package/dist/index104.js +3 -3
- package/dist/index111.cjs +1 -1
- package/dist/index111.js +2 -2
- package/dist/index112.cjs +1 -1
- package/dist/index112.js +1 -1
- package/dist/index113.cjs +1 -1
- package/dist/index113.js +1 -1
- package/dist/index114.cjs +1 -1
- package/dist/index114.js +1 -1
- package/dist/index115.cjs +1 -1
- package/dist/index115.js +1 -1
- package/dist/index132.cjs +1 -1
- package/dist/index132.js +5 -5
- package/dist/index138.cjs +1 -1
- package/dist/index138.js +13 -33
- package/dist/index139.cjs +1 -1
- package/dist/index139.js +34 -9
- package/dist/index140.cjs +1 -1
- package/dist/index140.js +55 -60
- package/dist/index141.cjs +1 -1
- package/dist/index141.js +23 -17
- package/dist/index142.cjs +1 -1
- package/dist/index142.js +6 -106
- package/dist/index143.cjs +1 -1
- package/dist/index143.js +18 -78
- package/dist/index144.cjs +1 -1
- package/dist/index144.js +15 -9
- package/dist/index145.cjs +1 -1
- package/dist/index145.js +5 -90
- package/dist/index146.cjs +1 -2
- package/dist/index146.js +14 -3
- package/dist/index147.cjs +1 -1
- package/dist/index147.js +11 -9
- package/dist/index148.cjs +1 -1
- package/dist/index148.js +12 -13
- package/dist/index149.cjs +1 -1
- package/dist/index149.js +11 -4
- package/dist/index150.cjs +1 -1
- package/dist/index150.js +8 -12
- package/dist/index151.cjs +1 -1
- package/dist/index151.js +4 -2
- package/dist/index152.cjs +1 -1
- package/dist/index152.js +17 -32
- package/dist/index153.cjs +1 -1
- package/dist/index153.js +5 -21
- package/dist/index154.cjs +1 -1
- package/dist/index154.js +171 -5
- package/dist/index155.cjs +1 -1
- package/dist/index155.js +103 -5
- package/dist/index156.cjs +1 -1
- package/dist/index156.js +33 -5
- package/dist/index157.cjs +1 -9
- package/dist/index157.js +8 -34
- package/dist/index158.cjs +1 -1
- package/dist/index158.js +61 -3
- package/dist/index159.cjs +1 -1
- package/dist/index159.js +19 -18
- package/dist/index160.cjs +1 -1
- package/dist/index160.js +105 -19
- package/dist/index161.cjs +1 -1
- package/dist/index161.js +70 -27
- package/dist/index162.cjs +1 -1
- package/dist/index162.js +7 -6
- package/dist/index163.cjs +1 -4
- package/dist/index163.js +88 -192
- package/dist/index164.cjs +2 -1
- package/dist/index164.js +3 -28
- package/dist/index165.cjs +1 -1
- package/dist/index165.js +9 -162
- package/dist/index166.cjs +1 -1
- package/dist/index166.js +13 -127
- package/dist/index167.cjs +1 -1
- package/dist/index167.js +4 -27
- package/dist/index168.cjs +1 -1
- package/dist/index168.js +2 -56
- package/dist/index169.cjs +1 -1
- package/dist/index169.js +31 -191
- package/dist/index17.cjs +1 -1
- package/dist/index17.js +2 -2
- package/dist/index170.cjs +1 -1
- package/dist/index170.js +22 -4
- package/dist/index171.cjs +1 -1
- package/dist/index171.js +5 -20
- package/dist/index172.cjs +1 -1
- package/dist/index172.js +6 -3
- package/dist/index173.cjs +1 -1
- package/dist/index173.js +5 -16
- package/dist/index174.cjs +9 -1
- package/dist/index174.js +35 -11
- package/dist/index175.cjs +1 -1
- package/dist/index175.js +3 -35
- package/dist/index176.cjs +1 -1
- package/dist/index176.js +19 -3
- package/dist/index177.cjs +1 -1
- package/dist/index177.js +18 -25
- package/dist/index178.cjs +1 -1
- package/dist/index178.js +35 -8
- package/dist/index179.cjs +1 -1
- package/dist/index179.js +6 -23
- package/dist/index180.cjs +4 -1
- package/dist/index180.js +194 -28
- package/dist/index181.cjs +1 -1
- package/dist/index181.js +27 -3
- package/dist/index182.cjs +1 -1
- package/dist/index182.js +161 -6
- package/dist/index183.cjs +1 -1
- package/dist/index183.js +127 -6
- package/dist/index184.cjs +1 -1
- package/dist/index184.js +27 -32
- package/dist/index185.cjs +1 -1
- package/dist/index185.js +192 -5
- package/dist/index186.cjs +1 -1
- package/dist/index186.js +4 -38
- package/dist/index187.cjs +1 -1
- package/dist/index187.js +14 -43
- package/dist/index188.cjs +1 -1
- package/dist/index188.js +3 -33
- package/dist/index189.cjs +1 -1
- package/dist/index189.js +15 -16
- package/dist/index190.cjs +1 -1
- package/dist/index190.js +32 -40
- package/dist/index191.cjs +1 -1
- package/dist/index191.js +3 -105
- package/dist/index192.cjs +1 -1
- package/dist/index192.js +28 -3
- package/dist/index193.cjs +1 -1
- package/dist/index193.js +25 -5
- package/dist/index194.cjs +1 -1
- package/dist/index194.js +28 -3
- package/dist/index195.cjs +1 -1
- package/dist/index195.js +6 -17
- package/dist/index196.cjs +1 -1
- package/dist/index196.js +6 -5
- package/dist/index197.cjs +1 -1
- package/dist/index197.js +32 -8
- package/dist/index198.cjs +1 -1
- package/dist/index198.js +5 -104
- package/dist/index199.cjs +1 -1
- package/dist/index199.js +37 -5
- package/dist/index200.cjs +1 -1
- package/dist/index200.js +49 -6
- package/dist/index201.cjs +1 -1
- package/dist/index201.js +30 -25
- package/dist/index202.cjs +1 -1
- package/dist/index202.js +17 -34
- package/dist/index203.cjs +1 -1
- package/dist/index203.js +42 -13
- package/dist/index204.cjs +1 -1
- package/dist/index204.js +100 -74
- package/dist/index205.cjs +1 -1
- package/dist/index205.js +3 -2
- package/dist/index206.cjs +1 -1
- package/dist/index206.js +4 -17
- package/dist/index207.cjs +1 -1
- package/dist/index207.js +3 -171
- package/dist/index208.cjs +1 -1
- package/dist/index208.js +17 -17
- package/dist/index209.cjs +1 -1
- package/dist/index209.js +8 -10
- package/dist/index210.cjs +1 -1
- package/dist/index210.js +5 -25
- package/dist/index211.cjs +1 -1
- package/dist/index211.js +27 -18
- package/dist/index212.cjs +1 -1
- package/dist/index212.js +78 -15
- package/dist/index213.cjs +1 -1
- package/dist/index213.js +2 -6
- package/dist/index214.cjs +1 -1
- package/dist/index214.js +18 -13
- package/dist/index215.cjs +1 -1
- package/dist/index215.js +17 -10
- package/dist/index216.cjs +1 -1
- package/dist/index216.js +10 -16
- package/dist/index217.cjs +1 -1
- package/dist/index217.js +1 -1
- package/dist/index22.cjs +1 -1
- package/dist/index22.js +8 -8
- package/dist/index220.cjs +1 -2
- package/dist/index220.js +213 -40
- package/dist/index221.cjs +1 -1
- package/dist/index221.js +109 -2
- package/dist/index222.cjs +1 -1
- package/dist/index222.js +206 -5
- package/dist/index223.cjs +1 -1
- package/dist/index223.js +103 -10
- package/dist/index224.cjs +1 -1
- package/dist/index224.js +16 -19
- package/dist/index225.cjs +1 -1
- package/dist/index225.js +42 -8
- package/dist/index226.cjs +1 -1
- package/dist/index226.js +74 -62
- package/dist/index227.cjs +1 -1
- package/dist/index227.js +2 -66
- package/dist/index228.cjs +2 -1
- package/dist/index228.js +40 -187
- package/dist/index229.cjs +1 -1
- package/dist/index229.js +2 -29
- package/dist/index23.cjs +1 -1
- package/dist/index23.js +26 -12
- package/dist/index230.cjs +1 -1
- package/dist/index230.js +5 -76
- package/dist/index231.cjs +1 -1
- package/dist/index231.js +9 -39
- package/dist/index232.cjs +1 -1
- package/dist/index232.js +17 -14
- package/dist/index233.cjs +1 -1
- package/dist/index233.js +8 -13
- package/dist/index234.cjs +1 -1
- package/dist/index234.js +66 -11
- package/dist/index235.cjs +1 -1
- package/dist/index235.js +64 -11
- package/dist/index236.cjs +1 -1
- package/dist/index236.js +187 -18
- package/dist/index237.cjs +1 -1
- package/dist/index237.js +26 -106
- package/dist/index238.cjs +1 -1
- package/dist/index238.js +77 -7
- package/dist/index239.cjs +1 -1
- package/dist/index239.js +39 -25
- package/dist/index24.cjs +1 -1
- package/dist/index24.js +8 -59
- package/dist/index240.cjs +1 -1
- package/dist/index240.js +16 -6
- package/dist/index241.cjs +1 -1
- package/dist/index241.js +12 -102
- package/dist/index242.cjs +1 -1
- package/dist/index242.js +11 -16
- package/dist/index243.cjs +1 -1
- package/dist/index243.js +10 -212
- package/dist/index244.cjs +1 -1
- package/dist/index244.js +18 -205
- package/dist/index245.cjs +1 -1
- package/dist/index245.js +6 -42
- package/dist/index246.cjs +1 -1
- package/dist/index246.js +7 -79
- package/dist/index247.cjs +1 -1
- package/dist/index247.js +27 -2
- package/dist/index25.cjs +1 -16
- package/dist/index25.js +12 -113
- package/dist/index252.cjs +1 -1
- package/dist/index252.js +657 -68
- package/dist/index253.cjs +1 -1
- package/dist/index253.js +154 -634
- package/dist/index254.cjs +1 -1
- package/dist/index254.js +67 -176
- package/dist/index26.cjs +1 -1
- package/dist/index26.js +59 -30
- package/dist/index27.cjs +16 -1
- package/dist/index27.js +111 -24
- package/dist/index28.cjs +1 -1
- package/dist/index28.js +29 -7
- package/dist/index30.cjs +1 -1
- package/dist/index30.js +6 -6
- package/dist/index35.cjs +1 -1
- package/dist/index35.js +1 -1
- package/dist/index37.cjs +1 -1
- package/dist/index37.js +8 -8
- package/dist/index38.cjs +1 -1
- package/dist/index38.js +1 -1
- package/dist/index39.cjs +1 -1
- package/dist/index39.js +1 -1
- package/dist/index40.cjs +1 -1
- package/dist/index40.js +2 -2
- package/dist/index42.cjs +1 -1
- package/dist/index42.js +2 -2
- package/dist/index43.cjs +1 -1
- package/dist/index43.js +1 -1
- package/dist/index47.cjs +1 -1
- package/dist/index47.js +4 -4
- package/dist/index48.cjs +1 -1
- package/dist/index48.js +3 -3
- package/dist/index49.cjs +1 -1
- package/dist/index49.js +3 -3
- package/dist/index51.cjs +1 -1
- package/dist/index51.js +6 -6
- package/dist/index54.cjs +1 -1
- package/dist/index54.js +1 -1
- package/dist/index58.cjs +1 -1
- package/dist/index58.js +1 -1
- package/dist/index62.cjs +1 -1
- package/dist/index62.js +2 -2
- package/dist/index63.cjs +1 -1
- package/dist/index63.js +2 -2
- package/dist/index65.cjs +1 -1
- package/dist/index65.js +2 -2
- package/dist/index67.cjs +1 -1
- package/dist/index67.js +1 -1
- package/dist/index75.cjs +1 -1
- package/dist/index75.js +4 -4
- package/dist/index78.cjs +1 -1
- package/dist/index78.js +3 -3
- package/dist/index81.cjs +1 -1
- package/dist/index81.js +2 -2
- package/dist/index90.cjs +1 -1
- package/dist/index90.js +1 -1
- package/dist/index93.cjs +1 -1
- package/dist/index93.js +1 -1
- package/dist/index95.cjs +1 -1
- package/dist/index95.js +2 -2
- package/dist/index96.cjs +1 -1
- package/dist/index96.js +1 -1
- package/dist/index97.cjs +1 -1
- package/dist/index97.js +5 -5
- package/package.json +1 -1
package/dist/index244.js
CHANGED
|
@@ -1,209 +1,22 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
}
|
|
10
|
-
|
|
11
|
-
if (typeof n != "boolean")
|
|
12
|
-
throw new Error(t + " boolean expected, got " + n);
|
|
13
|
-
}
|
|
14
|
-
function F(t) {
|
|
15
|
-
const n = t.toString(16);
|
|
16
|
-
return n.length & 1 ? "0" + n : n;
|
|
17
|
-
}
|
|
18
|
-
function E(t) {
|
|
19
|
-
if (typeof t != "string")
|
|
20
|
-
throw new Error("hex string expected, got " + typeof t);
|
|
21
|
-
return t === "" ? w : BigInt("0x" + t);
|
|
22
|
-
}
|
|
23
|
-
const U = (
|
|
24
|
-
// @ts-ignore
|
|
25
|
-
typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function"
|
|
26
|
-
), S = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
|
|
27
|
-
function x(t) {
|
|
28
|
-
if (h(t), U)
|
|
29
|
-
return t.toHex();
|
|
30
|
-
let n = "";
|
|
31
|
-
for (let e = 0; e < t.length; e++)
|
|
32
|
-
n += S[t[e]];
|
|
33
|
-
return n;
|
|
34
|
-
}
|
|
35
|
-
const u = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
36
|
-
function m(t) {
|
|
37
|
-
if (t >= u._0 && t <= u._9)
|
|
38
|
-
return t - u._0;
|
|
39
|
-
if (t >= u.A && t <= u.F)
|
|
40
|
-
return t - (u.A - 10);
|
|
41
|
-
if (t >= u.a && t <= u.f)
|
|
42
|
-
return t - (u.a - 10);
|
|
43
|
-
}
|
|
44
|
-
function B(t) {
|
|
45
|
-
if (typeof t != "string")
|
|
46
|
-
throw new Error("hex string expected, got " + typeof t);
|
|
47
|
-
if (U)
|
|
48
|
-
return Uint8Array.fromHex(t);
|
|
49
|
-
const n = t.length, e = n / 2;
|
|
50
|
-
if (n % 2)
|
|
51
|
-
throw new Error("hex string expected, got unpadded hex of length " + n);
|
|
52
|
-
const r = new Uint8Array(e);
|
|
53
|
-
for (let o = 0, i = 0; o < e; o++, i += 2) {
|
|
54
|
-
const a = m(t.charCodeAt(i)), f = m(t.charCodeAt(i + 1));
|
|
55
|
-
if (a === void 0 || f === void 0) {
|
|
56
|
-
const c = t[i] + t[i + 1];
|
|
57
|
-
throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
|
|
58
|
-
}
|
|
59
|
-
r[o] = a * 16 + f;
|
|
60
|
-
}
|
|
61
|
-
return r;
|
|
62
|
-
}
|
|
63
|
-
function O(t) {
|
|
64
|
-
return E(x(t));
|
|
65
|
-
}
|
|
66
|
-
function V(t) {
|
|
67
|
-
return h(t), E(x(Uint8Array.from(t).reverse()));
|
|
68
|
-
}
|
|
69
|
-
function T(t, n) {
|
|
70
|
-
return B(t.toString(16).padStart(n * 2, "0"));
|
|
71
|
-
}
|
|
72
|
-
function C(t, n) {
|
|
73
|
-
return T(t, n).reverse();
|
|
74
|
-
}
|
|
75
|
-
function M(t, n, e) {
|
|
76
|
-
let r;
|
|
77
|
-
if (typeof n == "string")
|
|
78
|
-
try {
|
|
79
|
-
r = B(n);
|
|
80
|
-
} catch (i) {
|
|
81
|
-
throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
|
|
82
|
-
}
|
|
83
|
-
else if (b(n))
|
|
84
|
-
r = Uint8Array.from(n);
|
|
85
|
-
else
|
|
86
|
-
throw new Error(t + " must be hex string or Uint8Array");
|
|
87
|
-
const o = r.length;
|
|
88
|
-
if (typeof e == "number" && o !== e)
|
|
89
|
-
throw new Error(t + " of length " + e + " expected, got " + o);
|
|
90
|
-
return r;
|
|
91
|
-
}
|
|
92
|
-
function H(...t) {
|
|
93
|
-
let n = 0;
|
|
94
|
-
for (let r = 0; r < t.length; r++) {
|
|
95
|
-
const o = t[r];
|
|
96
|
-
h(o), n += o.length;
|
|
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];
|
|
97
11
|
}
|
|
98
|
-
|
|
99
|
-
for (let r = 0, o = 0; r < t.length; r++) {
|
|
100
|
-
const i = t[r];
|
|
101
|
-
e.set(i, o), o += i.length;
|
|
102
|
-
}
|
|
103
|
-
return e;
|
|
104
|
-
}
|
|
105
|
-
const y = (t) => typeof t == "bigint" && w <= t;
|
|
106
|
-
function I(t, n, e) {
|
|
107
|
-
return y(t) && y(n) && y(e) && n <= t && t < e;
|
|
108
|
-
}
|
|
109
|
-
function R(t, n, e, r) {
|
|
110
|
-
if (!I(n, e, r))
|
|
111
|
-
throw new Error("expected valid " + t + ": " + e + " <= n < " + r + ", got " + n);
|
|
112
|
-
}
|
|
113
|
-
function j(t) {
|
|
114
|
-
let n;
|
|
115
|
-
for (n = 0; t > w; t >>= p, n += 1)
|
|
116
|
-
;
|
|
117
|
-
return n;
|
|
118
|
-
}
|
|
119
|
-
const z = (t) => (p << BigInt(t)) - p, d = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
|
|
120
|
-
function D(t, n, e) {
|
|
121
|
-
if (typeof t != "number" || t < 2)
|
|
122
|
-
throw new Error("hashLen must be a number");
|
|
123
|
-
if (typeof n != "number" || n < 2)
|
|
124
|
-
throw new Error("qByteLen must be a number");
|
|
125
|
-
if (typeof e != "function")
|
|
126
|
-
throw new Error("hmacFn must be a function");
|
|
127
|
-
let r = d(t), o = d(t), i = 0;
|
|
128
|
-
const a = () => {
|
|
129
|
-
r.fill(1), o.fill(0), i = 0;
|
|
130
|
-
}, f = (...s) => e(o, r, ...s), c = (s = d(0)) => {
|
|
131
|
-
o = f(A([0]), s), r = f(), s.length !== 0 && (o = f(A([1]), s), r = f());
|
|
132
|
-
}, v = () => {
|
|
133
|
-
if (i++ >= 1e3)
|
|
134
|
-
throw new Error("drbg: tried 1000 values");
|
|
135
|
-
let s = 0;
|
|
136
|
-
const l = [];
|
|
137
|
-
for (; s < n; ) {
|
|
138
|
-
r = f();
|
|
139
|
-
const g = r.slice();
|
|
140
|
-
l.push(g), s += r.length;
|
|
141
|
-
}
|
|
142
|
-
return H(...l);
|
|
143
|
-
};
|
|
144
|
-
return (s, l) => {
|
|
145
|
-
a(), c(s);
|
|
146
|
-
let g;
|
|
147
|
-
for (; !(g = l(v())); )
|
|
148
|
-
c();
|
|
149
|
-
return a(), g;
|
|
150
|
-
};
|
|
151
|
-
}
|
|
152
|
-
const _ = {
|
|
153
|
-
bigint: (t) => typeof t == "bigint",
|
|
154
|
-
function: (t) => typeof t == "function",
|
|
155
|
-
boolean: (t) => typeof t == "boolean",
|
|
156
|
-
string: (t) => typeof t == "string",
|
|
157
|
-
stringOrUint8Array: (t) => typeof t == "string" || b(t),
|
|
158
|
-
isSafeInteger: (t) => Number.isSafeInteger(t),
|
|
159
|
-
array: (t) => Array.isArray(t),
|
|
160
|
-
field: (t, n) => n.Fp.isValid(t),
|
|
161
|
-
hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
|
|
162
|
-
};
|
|
163
|
-
function P(t, n, e = {}) {
|
|
164
|
-
const r = (o, i, a) => {
|
|
165
|
-
const f = _[i];
|
|
166
|
-
if (typeof f != "function")
|
|
167
|
-
throw new Error("invalid validator function");
|
|
168
|
-
const c = t[o];
|
|
169
|
-
if (!(a && c === void 0) && !f(c, t))
|
|
170
|
-
throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
|
|
171
|
-
};
|
|
172
|
-
for (const [o, i] of Object.entries(n))
|
|
173
|
-
r(o, i, !1);
|
|
174
|
-
for (const [o, i] of Object.entries(e))
|
|
175
|
-
r(o, i, !0);
|
|
176
|
-
return t;
|
|
177
|
-
}
|
|
178
|
-
function W(t) {
|
|
179
|
-
const n = /* @__PURE__ */ new WeakMap();
|
|
180
|
-
return (e, ...r) => {
|
|
181
|
-
const o = n.get(e);
|
|
182
|
-
if (o !== void 0)
|
|
183
|
-
return o;
|
|
184
|
-
const i = t(e, ...r);
|
|
185
|
-
return n.set(e, i), i;
|
|
186
|
-
};
|
|
12
|
+
return [l, c];
|
|
187
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;
|
|
188
15
|
export {
|
|
189
|
-
|
|
190
|
-
|
|
191
|
-
|
|
192
|
-
|
|
193
|
-
|
|
194
|
-
|
|
195
|
-
O as bytesToNumberBE,
|
|
196
|
-
V as bytesToNumberLE,
|
|
197
|
-
H as concatBytes,
|
|
198
|
-
D as createHmacDrbg,
|
|
199
|
-
M as ensureBytes,
|
|
200
|
-
B as hexToBytes,
|
|
201
|
-
E as hexToNumber,
|
|
202
|
-
I as inRange,
|
|
203
|
-
b as isBytes,
|
|
204
|
-
W as memoized,
|
|
205
|
-
T as numberToBytesBE,
|
|
206
|
-
C as numberToBytesLE,
|
|
207
|
-
F as numberToHexUnpadded,
|
|
208
|
-
P as validateObject
|
|
16
|
+
s as fromBig,
|
|
17
|
+
B as rotlBH,
|
|
18
|
+
a as rotlBL,
|
|
19
|
+
m as rotlSH,
|
|
20
|
+
A as rotlSL,
|
|
21
|
+
h as split
|
|
209
22
|
};
|
package/dist/index245.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("./index140.cjs"),r=require("./index150.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;
|
package/dist/index245.js
CHANGED
|
@@ -1,45 +1,9 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
if (this.iHash = t.create(), typeof this.iHash.update != "function")
|
|
7
|
-
throw new Error("Expected instance of class which extends utils.Hash");
|
|
8
|
-
this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
|
|
9
|
-
const o = this.blockLen, e = new Uint8Array(o);
|
|
10
|
-
e.set(h.length > o ? t.create().update(h).digest() : h);
|
|
11
|
-
for (let s = 0; s < e.length; s++)
|
|
12
|
-
e[s] ^= 54;
|
|
13
|
-
this.iHash.update(e), this.oHash = t.create();
|
|
14
|
-
for (let s = 0; s < e.length; s++)
|
|
15
|
-
e[s] ^= 106;
|
|
16
|
-
this.oHash.update(e), l(e);
|
|
17
|
-
}
|
|
18
|
-
update(t) {
|
|
19
|
-
return a(this), this.iHash.update(t), this;
|
|
20
|
-
}
|
|
21
|
-
digestInto(t) {
|
|
22
|
-
a(this), p(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
|
|
23
|
-
}
|
|
24
|
-
digest() {
|
|
25
|
-
const t = new Uint8Array(this.oHash.outputLen);
|
|
26
|
-
return this.digestInto(t), t;
|
|
27
|
-
}
|
|
28
|
-
_cloneInto(t) {
|
|
29
|
-
t || (t = Object.create(Object.getPrototypeOf(this), {}));
|
|
30
|
-
const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: c } = this;
|
|
31
|
-
return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = c, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
|
|
32
|
-
}
|
|
33
|
-
clone() {
|
|
34
|
-
return this._cloneInto();
|
|
35
|
-
}
|
|
36
|
-
destroy() {
|
|
37
|
-
this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
|
|
38
|
-
}
|
|
1
|
+
import { toBytes as o } from "./index140.js";
|
|
2
|
+
import { keccak256 as r } from "./index150.js";
|
|
3
|
+
const e = (t) => r(o(t));
|
|
4
|
+
function c(t) {
|
|
5
|
+
return e(t);
|
|
39
6
|
}
|
|
40
|
-
const y = (n, t, i) => new r(n, t).update(i).digest();
|
|
41
|
-
y.create = (n, t) => new r(n, t);
|
|
42
7
|
export {
|
|
43
|
-
|
|
44
|
-
y as hmac
|
|
8
|
+
c as hashSignature
|
|
45
9
|
};
|
package/dist/index246.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=require("./index247.cjs"),n=require("./index230.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;
|
package/dist/index246.js
CHANGED
|
@@ -1,81 +1,9 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
}
|
|
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
|
-
]);
|
|
1
|
+
import { normalizeSignature as o } from "./index247.js";
|
|
2
|
+
import { formatAbiItem as n } from "./index230.js";
|
|
3
|
+
const m = (r) => {
|
|
4
|
+
const t = typeof r == "string" ? r : n(r);
|
|
5
|
+
return o(t);
|
|
6
|
+
};
|
|
75
7
|
export {
|
|
76
|
-
|
|
77
|
-
m as HashMD,
|
|
78
|
-
_ as Maj,
|
|
79
|
-
B as SHA256_IV,
|
|
80
|
-
y as setBigUint64
|
|
8
|
+
m as toSignature
|
|
81
9
|
};
|
package/dist/index247.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index35.cjs");function a(r){let l=!0,i="",o=0,t="",u=!1;for(let n=0;n<r.length;n++){const e=r[n];if(["(",")",","].includes(e)&&(l=!0),e==="("&&o++,e===")"&&o--,!!l){if(o===0){if(e===" "&&["event","function",""].includes(t))t="";else if(t+=e,e===")"){u=!0;break}continue}if(e===" "){r[n-1]!==","&&i!==","&&i!==",("&&(i="",l=!1);continue}t+=e,i+=e}}if(!u)throw new f.BaseError("Unable to normalize signature.");return t}exports.normalizeSignature=a;
|
package/dist/index247.js
CHANGED
|
@@ -1,4 +1,29 @@
|
|
|
1
|
-
|
|
1
|
+
import { BaseError as u } from "./index35.js";
|
|
2
|
+
function a(r) {
|
|
3
|
+
let l = !0, i = "", f = 0, t = "", o = !1;
|
|
4
|
+
for (let n = 0; n < r.length; n++) {
|
|
5
|
+
const e = r[n];
|
|
6
|
+
if (["(", ")", ","].includes(e) && (l = !0), e === "(" && f++, e === ")" && f--, !!l) {
|
|
7
|
+
if (f === 0) {
|
|
8
|
+
if (e === " " && ["event", "function", ""].includes(t))
|
|
9
|
+
t = "";
|
|
10
|
+
else if (t += e, e === ")") {
|
|
11
|
+
o = !0;
|
|
12
|
+
break;
|
|
13
|
+
}
|
|
14
|
+
continue;
|
|
15
|
+
}
|
|
16
|
+
if (e === " ") {
|
|
17
|
+
r[n - 1] !== "," && i !== "," && i !== ",(" && (i = "", l = !1);
|
|
18
|
+
continue;
|
|
19
|
+
}
|
|
20
|
+
t += e, i += e;
|
|
21
|
+
}
|
|
22
|
+
}
|
|
23
|
+
if (!o)
|
|
24
|
+
throw new u("Unable to normalize signature.");
|
|
25
|
+
return t;
|
|
26
|
+
}
|
|
2
27
|
export {
|
|
3
|
-
|
|
28
|
+
a as normalizeSignature
|
|
4
29
|
};
|
package/dist/index25.cjs
CHANGED
|
@@ -1,16 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
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
|
-
`:"",S=`${v} wants you to sign in with your Ethereum account:
|
|
4
|
-
${$}
|
|
5
|
-
|
|
6
|
-
${I}`;let n=`URI: ${c}
|
|
7
|
-
Version: ${d}
|
|
8
|
-
Chain ID: ${o}
|
|
9
|
-
Nonce: ${a}
|
|
10
|
-
Issued At: ${m.toISOString()}`;if(l&&(n+=`
|
|
11
|
-
Expiration Time: ${l.toISOString()}`),f&&(n+=`
|
|
12
|
-
Not Before: ${f.toISOString()}`),w&&(n+=`
|
|
13
|
-
Request ID: ${w}`),g){let t=`
|
|
14
|
-
Resources:`;for(const u of g){if(!h.isUri(u))throw new e.SiweInvalidMessageFieldError({field:"resources",metaMessages:["- Every resource must be a RFC 3986 URI.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${u}`]});t+=`
|
|
15
|
-
- ${u}`}n+=t}return`${S}
|
|
16
|
-
${n}`}const E=/^([a-zA-Z0-9]([a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?\.)+[a-zA-Z]{2,}(:[0-9]{1,5})?$/,F=/^(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)(:[0-9]{1,5})?$/,b=/^localhost(:[0-9]{1,5})?$/,A=/^[a-zA-Z0-9]{8,}$/,P=/^([a-zA-Z][a-zA-Z0-9+-.]*)$/;exports.createSiweMessage=R;
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index156.cjs"),c=require("./index158.cjs");function r(e){const{key:t="wallet",name:l="Wallet Client",transport:n}=e;return i.createClient({...e,key:t,name:l,transport:n,type:"walletClient"}).extend(c.walletActions)}exports.createWalletClient=r;
|
package/dist/index25.js
CHANGED
|
@@ -1,116 +1,15 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
"- See https://eips.ethereum.org/EIPS/eip-155",
|
|
13
|
-
"",
|
|
14
|
-
`Provided value: ${i}`
|
|
15
|
-
]
|
|
16
|
-
});
|
|
17
|
-
if (!(p.test(s) || M.test(s) || x.test(s)))
|
|
18
|
-
throw new e({
|
|
19
|
-
field: "domain",
|
|
20
|
-
metaMessages: [
|
|
21
|
-
"- Domain must be an RFC 3986 authority.",
|
|
22
|
-
"- See https://www.rfc-editor.org/rfc/rfc3986",
|
|
23
|
-
"",
|
|
24
|
-
`Provided value: ${s}`
|
|
25
|
-
]
|
|
26
|
-
});
|
|
27
|
-
if (!A.test(a))
|
|
28
|
-
throw new e({
|
|
29
|
-
field: "nonce",
|
|
30
|
-
metaMessages: [
|
|
31
|
-
"- Nonce must be at least 8 characters.",
|
|
32
|
-
"- Nonce must be alphanumeric.",
|
|
33
|
-
"",
|
|
34
|
-
`Provided value: ${a}`
|
|
35
|
-
]
|
|
36
|
-
});
|
|
37
|
-
if (!$(c))
|
|
38
|
-
throw new e({
|
|
39
|
-
field: "uri",
|
|
40
|
-
metaMessages: [
|
|
41
|
-
"- URI must be a RFC 3986 URI referring to the resource that is the subject of the signing.",
|
|
42
|
-
"- See https://www.rfc-editor.org/rfc/rfc3986",
|
|
43
|
-
"",
|
|
44
|
-
`Provided value: ${c}`
|
|
45
|
-
]
|
|
46
|
-
});
|
|
47
|
-
if (f !== "1")
|
|
48
|
-
throw new e({
|
|
49
|
-
field: "version",
|
|
50
|
-
metaMessages: [
|
|
51
|
-
"- Version must be '1'.",
|
|
52
|
-
"",
|
|
53
|
-
`Provided value: ${f}`
|
|
54
|
-
]
|
|
55
|
-
});
|
|
56
|
-
if (o && !P.test(o))
|
|
57
|
-
throw new e({
|
|
58
|
-
field: "scheme",
|
|
59
|
-
metaMessages: [
|
|
60
|
-
"- Scheme must be an RFC 3986 URI scheme.",
|
|
61
|
-
"- See https://www.rfc-editor.org/rfc/rfc3986#section-3.1",
|
|
62
|
-
"",
|
|
63
|
-
`Provided value: ${o}`
|
|
64
|
-
]
|
|
65
|
-
});
|
|
66
|
-
const t = n.statement;
|
|
67
|
-
if (t != null && t.includes(`
|
|
68
|
-
`))
|
|
69
|
-
throw new e({
|
|
70
|
-
field: "statement",
|
|
71
|
-
metaMessages: [
|
|
72
|
-
"- Statement must not include '\\n'.",
|
|
73
|
-
"",
|
|
74
|
-
`Provided value: ${t}`
|
|
75
|
-
]
|
|
76
|
-
});
|
|
77
|
-
}
|
|
78
|
-
const l = S(n.address), v = o ? `${o}://${s}` : s, I = n.statement ? `${n.statement}
|
|
79
|
-
` : "", R = `${v} wants you to sign in with your Ethereum account:
|
|
80
|
-
${l}
|
|
81
|
-
|
|
82
|
-
${I}`;
|
|
83
|
-
let r = `URI: ${c}
|
|
84
|
-
Version: ${f}
|
|
85
|
-
Chain ID: ${i}
|
|
86
|
-
Nonce: ${a}
|
|
87
|
-
Issued At: ${g.toISOString()}`;
|
|
88
|
-
if (u && (r += `
|
|
89
|
-
Expiration Time: ${u.toISOString()}`), m && (r += `
|
|
90
|
-
Not Before: ${m.toISOString()}`), h && (r += `
|
|
91
|
-
Request ID: ${h}`), w) {
|
|
92
|
-
let t = `
|
|
93
|
-
Resources:`;
|
|
94
|
-
for (const d of w) {
|
|
95
|
-
if (!$(d))
|
|
96
|
-
throw new e({
|
|
97
|
-
field: "resources",
|
|
98
|
-
metaMessages: [
|
|
99
|
-
"- Every resource must be a RFC 3986 URI.",
|
|
100
|
-
"- See https://www.rfc-editor.org/rfc/rfc3986",
|
|
101
|
-
"",
|
|
102
|
-
`Provided value: ${d}`
|
|
103
|
-
]
|
|
104
|
-
});
|
|
105
|
-
t += `
|
|
106
|
-
- ${d}`;
|
|
107
|
-
}
|
|
108
|
-
r += t;
|
|
109
|
-
}
|
|
110
|
-
return `${R}
|
|
111
|
-
${r}`;
|
|
1
|
+
import { createClient as i } from "./index156.js";
|
|
2
|
+
import { walletActions as o } from "./index158.js";
|
|
3
|
+
function m(t) {
|
|
4
|
+
const { key: e = "wallet", name: l = "Wallet Client", transport: n } = t;
|
|
5
|
+
return i({
|
|
6
|
+
...t,
|
|
7
|
+
key: e,
|
|
8
|
+
name: l,
|
|
9
|
+
transport: n,
|
|
10
|
+
type: "walletClient"
|
|
11
|
+
}).extend(o);
|
|
112
12
|
}
|
|
113
|
-
const p = /^([a-zA-Z0-9]([a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?\.)+[a-zA-Z]{2,}(:[0-9]{1,5})?$/, M = /^(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)(:[0-9]{1,5})?$/, x = /^localhost(:[0-9]{1,5})?$/, A = /^[a-zA-Z0-9]{8,}$/, P = /^([a-zA-Z][a-zA-Z0-9+-.]*)$/;
|
|
114
13
|
export {
|
|
115
|
-
|
|
14
|
+
m as createWalletClient
|
|
116
15
|
};
|
package/dist/index252.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(a,y,i){let e="";if(i)for(const t of Object.entries(i)){if(!t)continue;let s="";for(const n of t[1])s+=`[${n.type}${n.name?`:${n.name}`:""}]`;e+=`(${t[0]}{${s}})`}return y?`${y}:${a}${e}`:`${a}${e}`}const d=new Map([["address",{type:"address"}],["bool",{type:"bool"}],["bytes",{type:"bytes"}],["bytes32",{type:"bytes32"}],["int",{type:"int256"}],["int256",{type:"int256"}],["string",{type:"string"}],["uint",{type:"uint256"}],["uint8",{type:"uint8"}],["uint16",{type:"uint16"}],["uint24",{type:"uint24"}],["uint32",{type:"uint32"}],["uint64",{type:"uint64"}],["uint96",{type:"uint96"}],["uint112",{type:"uint112"}],["uint160",{type:"uint160"}],["uint192",{type:"uint192"}],["uint256",{type:"uint256"}],["address owner",{type:"address",name:"owner"}],["address to",{type:"address",name:"to"}],["bool approved",{type:"bool",name:"approved"}],["bytes _data",{type:"bytes",name:"_data"}],["bytes data",{type:"bytes",name:"data"}],["bytes signature",{type:"bytes",name:"signature"}],["bytes32 hash",{type:"bytes32",name:"hash"}],["bytes32 r",{type:"bytes32",name:"r"}],["bytes32 root",{type:"bytes32",name:"root"}],["bytes32 s",{type:"bytes32",name:"s"}],["string name",{type:"string",name:"name"}],["string symbol",{type:"string",name:"symbol"}],["string tokenURI",{type:"string",name:"tokenURI"}],["uint tokenId",{type:"uint256",name:"tokenId"}],["uint8 v",{type:"uint8",name:"v"}],["uint256 balance",{type:"uint256",name:"balance"}],["uint256 tokenId",{type:"uint256",name:"tokenId"}],["uint256 value",{type:"uint256",name:"value"}],["event:address indexed from",{type:"address",name:"from",indexed:!0}],["event:address indexed to",{type:"address",name:"to",indexed:!0}],["event:uint indexed tokenId",{type:"uint256",name:"tokenId",indexed:!0}],["event:uint256 indexed tokenId",{type:"uint256",name:"tokenId",indexed:!0}]]);exports.getParameterCacheKey=r;exports.parameterCache=d;
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const et=require("./index253.cjs"),K=require("./index220.cjs"),a=require("./index222.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function at(y){y.lowS!==void 0&&a.abool("lowS",y.lowS),y.prehash!==void 0&&a.abool("prehash",y.prehash)}function ut(y){const r=et.validateBasic(y);a.validateObject(r,{a:"field",b:"field"},{allowInfinityPoint:"boolean",allowedPrivateKeyLengths:"array",clearCofactor:"function",fromBytes:"function",isTorsionFree:"function",toBytes:"function",wrapPrivateKey:"boolean"});const{endo:t,Fp:B,a:R}=r;if(t){if(!B.eql(R,B.ZERO))throw new Error("invalid endo: CURVE.a must be 0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function')}return Object.freeze({...r})}class ct extends Error{constructor(r=""){super(r)}}const U={Err:ct,_tlv:{encode:(y,r)=>{const{Err:t}=U;if(y<0||y>256)throw new t("tlv.encode: wrong tag");if(r.length&1)throw new t("tlv.encode: unpadded data");const B=r.length/2,R=a.numberToHexUnpadded(B);if(R.length/2&128)throw new t("tlv.encode: long form length too big");const z=B>127?a.numberToHexUnpadded(R.length/2|128):"";return a.numberToHexUnpadded(y)+z+R+r},decode(y,r){const{Err:t}=U;let B=0;if(y<0||y>256)throw new t("tlv.encode: wrong tag");if(r.length<2||r[B++]!==y)throw new t("tlv.decode: wrong tlv");const R=r[B++],z=!!(R&128);let T=0;if(!z)T=R;else{const S=R&127;if(!S)throw new t("tlv.decode(long): indefinite length not supported");if(S>4)throw new t("tlv.decode(long): byte length is too big");const F=r.subarray(B,B+S);if(F.length!==S)throw new t("tlv.decode: length bytes not complete");if(F[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const A of F)T=T<<8|A;if(B+=S,T<128)throw new t("tlv.decode(long): not minimal encoding")}const Y=r.subarray(B,B+T);if(Y.length!==T)throw new t("tlv.decode: wrong value length");return{v:Y,l:r.subarray(B+T)}}},_int:{encode(y){const{Err:r}=U;if(y<I)throw new r("integer: negative integers are not allowed");let t=a.numberToHexUnpadded(y);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new r("unexpected DER parsing assertion: unpadded hex");return t},decode(y){const{Err:r}=U;if(y[0]&128)throw new r("invalid signature integer: negative");if(y[0]===0&&!(y[1]&128))throw new r("invalid signature integer: unnecessary leading zero");return a.bytesToNumberBE(y)}},toSig(y){const{Err:r,_int:t,_tlv:B}=U,R=a.ensureBytes("signature",y),{v:z,l:T}=B.decode(48,R);if(T.length)throw new r("invalid signature: left bytes after parsing");const{v:Y,l:S}=B.decode(2,z),{v:F,l:A}=B.decode(2,S);if(A.length)throw new r("invalid signature: left bytes after parsing");return{r:t.decode(Y),s:t.decode(F)}},hexFromSig(y){const{_tlv:r,_int:t}=U,B=r.encode(2,t.encode(y.r)),R=r.encode(2,t.encode(y.s)),z=B+R;return r.encode(48,z)}};function st(y,r){return a.bytesToHex(a.numberToBytesBE(y,r))}const I=BigInt(0),O=BigInt(1);BigInt(2);const it=BigInt(3),dt=BigInt(4);function lt(y){const r=ut(y),{Fp:t}=r,B=K.Field(r.n,r.nBitLength),R=r.toBytes||((w,e,s)=>{const c=e.toAffine();return a.concatBytes(Uint8Array.from([4]),t.toBytes(c.x),t.toBytes(c.y))}),z=r.fromBytes||(w=>{const e=w.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 T(w){const{a:e,b:s}=r,c=t.sqr(w),f=t.mul(c,w);return t.add(t.add(f,t.mul(w,e)),s)}function Y(w,e){const s=t.sqr(e),c=T(w);return t.eql(s,c)}if(!Y(r.Gx,r.Gy))throw new Error("bad curve params: generator point");const S=t.mul(t.pow(r.a,it),dt),F=t.mul(t.sqr(r.b),BigInt(27));if(t.is0(t.add(S,F)))throw new Error("bad curve params: a or b");function A(w){return a.inRange(w,O,r.n)}function D(w){const{allowedPrivateKeyLengths:e,nByteLength:s,wrapPrivateKey:c,n:f}=r;if(e&&typeof w!="bigint"){if(a.isBytes(w)&&(w=a.bytesToHex(w)),typeof w!="string"||!e.includes(w.length))throw new Error("invalid private key");w=w.padStart(s*2,"0")}let g;try{g=typeof w=="bigint"?w:a.bytesToNumberBE(a.ensureBytes("private key",w,s))}catch{throw new Error("invalid private key, expected hex or "+s+" bytes, got "+typeof w)}return c&&(g=K.mod(g,f)),a.aInRange("private key",g,O,f),g}function _(w){if(!(w instanceof E))throw new Error("ProjectivePoint expected")}const nt=a.memoized((w,e)=>{const{px:s,py:c,pz:f}=w;if(t.eql(f,t.ONE))return{x:s,y:c};const g=w.is0();e==null&&(e=g?t.ONE:t.inv(f));const v=t.mul(s,e),b=t.mul(c,e),l=t.mul(f,e);if(g)return{x:t.ZERO,y:t.ZERO};if(!t.eql(l,t.ONE))throw new Error("invZ was invalid");return{x:v,y:b}}),G=a.memoized(w=>{if(w.is0()){if(r.allowInfinityPoint&&!t.is0(w.py))return;throw new Error("bad point: ZERO")}const{x:e,y:s}=w.toAffine();if(!t.isValid(e)||!t.isValid(s))throw new Error("bad point: x or y not FE");if(!Y(e,s))throw new Error("bad point: equation left != right");if(!w.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class E{constructor(e,s,c){if(e==null||!t.isValid(e))throw new Error("x required");if(s==null||!t.isValid(s)||t.is0(s))throw new Error("y required");if(c==null||!t.isValid(c))throw new Error("z required");this.px=e,this.py=s,this.pz=c,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 E)throw new Error("projective point not allowed");const f=g=>t.eql(g,t.ZERO);return f(s)&&f(c)?E.ZERO:new E(s,c,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(e){const s=K.FpInvertBatch(t,e.map(c=>c.pz));return e.map((c,f)=>c.toAffine(s[f])).map(E.fromAffine)}static fromHex(e){const s=E.fromAffine(z(a.ensureBytes("pointHex",e)));return s.assertValidity(),s}static fromPrivateKey(e){return E.BASE.multiply(D(e))}static msm(e,s){return et.pippenger(E,B,e,s)}_setWindowSize(e){C.setWindowSize(this,e)}assertValidity(){G(this)}hasEvenY(){const{y:e}=this.toAffine();if(t.isOdd)return!t.isOdd(e);throw new Error("Field doesn't support isOdd")}equals(e){_(e);const{px:s,py:c,pz:f}=this,{px:g,py:v,pz:b}=e,l=t.eql(t.mul(s,b),t.mul(g,f)),p=t.eql(t.mul(c,b),t.mul(v,f));return l&&p}negate(){return new E(this.px,t.neg(this.py),this.pz)}double(){const{a:e,b:s}=r,c=t.mul(s,it),{px:f,py:g,pz:v}=this;let b=t.ZERO,l=t.ZERO,p=t.ZERO,u=t.mul(f,f),N=t.mul(g,g),o=t.mul(v,v),n=t.mul(f,g);return n=t.add(n,n),p=t.mul(f,v),p=t.add(p,p),b=t.mul(e,p),l=t.mul(c,o),l=t.add(b,l),b=t.sub(N,l),l=t.add(N,l),l=t.mul(b,l),b=t.mul(n,b),p=t.mul(c,p),o=t.mul(e,o),n=t.sub(u,o),n=t.mul(e,n),n=t.add(n,p),p=t.add(u,u),u=t.add(p,u),u=t.add(u,o),u=t.mul(u,n),l=t.add(l,u),o=t.mul(g,v),o=t.add(o,o),u=t.mul(o,n),b=t.sub(b,u),p=t.mul(o,N),p=t.add(p,p),p=t.add(p,p),new E(b,l,p)}add(e){_(e);const{px:s,py:c,pz:f}=this,{px:g,py:v,pz:b}=e;let l=t.ZERO,p=t.ZERO,u=t.ZERO;const N=r.a,o=t.mul(r.b,it);let n=t.mul(s,g),i=t.mul(c,v),m=t.mul(f,b),d=t.add(s,c),h=t.add(g,v);d=t.mul(d,h),h=t.add(n,i),d=t.sub(d,h),h=t.add(s,f);let x=t.add(g,b);return h=t.mul(h,x),x=t.add(n,m),h=t.sub(h,x),x=t.add(c,f),l=t.add(v,b),x=t.mul(x,l),l=t.add(i,m),x=t.sub(x,l),u=t.mul(N,h),l=t.mul(o,m),u=t.add(l,u),l=t.sub(i,u),u=t.add(i,u),p=t.mul(l,u),i=t.add(n,n),i=t.add(i,n),m=t.mul(N,m),h=t.mul(o,h),i=t.add(i,m),m=t.sub(n,m),m=t.mul(N,m),h=t.add(h,m),n=t.mul(i,h),p=t.add(p,n),n=t.mul(x,h),l=t.mul(d,l),l=t.sub(l,n),n=t.mul(d,i),u=t.mul(x,u),u=t.add(u,n),new E(l,p,u)}subtract(e){return this.add(e.negate())}is0(){return this.equals(E.ZERO)}wNAF(e){return C.wNAFCached(this,e,E.normalizeZ)}multiplyUnsafe(e){const{endo:s,n:c}=r;a.aInRange("scalar",e,I,c);const f=E.ZERO;if(e===I)return f;if(this.is0()||e===O)return this;if(!s||C.hasPrecomputes(this))return C.wNAFCachedUnsafe(this,e,E.normalizeZ);let{k1neg:g,k1:v,k2neg:b,k2:l}=s.splitScalar(e),p=f,u=f,N=this;for(;v>I||l>I;)v&O&&(p=p.add(N)),l&O&&(u=u.add(N)),N=N.double(),v>>=O,l>>=O;return g&&(p=p.negate()),b&&(u=u.negate()),u=new E(t.mul(u.px,s.beta),u.py,u.pz),p.add(u)}multiply(e){const{endo:s,n:c}=r;a.aInRange("scalar",e,O,c);let f,g;if(s){const{k1neg:v,k1:b,k2neg:l,k2:p}=s.splitScalar(e);let{p:u,f:N}=this.wNAF(b),{p:o,f:n}=this.wNAF(p);u=C.constTimeNegate(v,u),o=C.constTimeNegate(l,o),o=new E(t.mul(o.px,s.beta),o.py,o.pz),f=u.add(o),g=N.add(n)}else{const{p:v,f:b}=this.wNAF(e);f=v,g=b}return E.normalizeZ([f,g])[0]}multiplyAndAddUnsafe(e,s,c){const f=E.BASE,g=(b,l)=>l===I||l===O||!b.equals(f)?b.multiplyUnsafe(l):b.multiply(l),v=g(this,s).add(g(e,c));return v.is0()?void 0:v}toAffine(e){return nt(this,e)}isTorsionFree(){const{h:e,isTorsionFree:s}=r;if(e===O)return!0;if(s)return s(E,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:e,clearCofactor:s}=r;return e===O?this:s?s(E,this):this.multiplyUnsafe(r.h)}toRawBytes(e=!0){return a.abool("isCompressed",e),this.assertValidity(),R(E,this,e)}toHex(e=!0){return a.abool("isCompressed",e),a.bytesToHex(this.toRawBytes(e))}}E.BASE=new E(r.Gx,r.Gy,t.ONE),E.ZERO=new E(t.ZERO,t.ONE,t.ZERO);const{endo:tt,nBitLength:H}=r,C=et.wNAF(E,tt?Math.ceil(H/2):H);return{CURVE:r,ProjectivePoint:E,normPrivateKeyToScalar:D,weierstrassEquation:T,isWithinCurveOrder:A}}function ft(y){const r=et.validateBasic(y);return a.validateObject(r,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...r})}function ht(y){const r=ft(y),{Fp:t,n:B,nByteLength:R,nBitLength:z}=r,T=t.BYTES+1,Y=2*t.BYTES+1;function S(o){return K.mod(o,B)}function F(o){return K.invert(o,B)}const{ProjectivePoint:A,normPrivateKeyToScalar:D,weierstrassEquation:_,isWithinCurveOrder:nt}=lt({...r,toBytes(o,n,i){const m=n.toAffine(),d=t.toBytes(m.x),h=a.concatBytes;return a.abool("isCompressed",i),i?h(Uint8Array.from([n.hasEvenY()?2:3]),d):h(Uint8Array.from([4]),d,t.toBytes(m.y))},fromBytes(o){const n=o.length,i=o[0],m=o.subarray(1);if(n===T&&(i===2||i===3)){const d=a.bytesToNumberBE(m);if(!a.inRange(d,O,t.ORDER))throw new Error("Point is not on curve");const h=_(d);let x;try{x=t.sqrt(h)}catch(L){const q=L instanceof Error?": "+L.message:"";throw new Error("Point is not on curve"+q)}const Z=(x&O)===O;return(i&1)===1!==Z&&(x=t.neg(x)),{x:d,y:x}}else if(n===Y&&i===4){const d=t.fromBytes(m.subarray(0,t.BYTES)),h=t.fromBytes(m.subarray(t.BYTES,2*t.BYTES));return{x:d,y:h}}else{const d=T,h=Y;throw new Error("invalid Point, expected length of "+d+", or uncompressed "+h+", got "+n)}}});function G(o){const n=B>>O;return o>n}function E(o){return G(o)?S(-o):o}const tt=(o,n,i)=>a.bytesToNumberBE(o.slice(n,i));class H{constructor(n,i,m){a.aInRange("r",n,O,B),a.aInRange("s",i,O,B),this.r=n,this.s=i,m!=null&&(this.recovery=m),Object.freeze(this)}static fromCompact(n){const i=R;return n=a.ensureBytes("compactSignature",n,i*2),new H(tt(n,0,i),tt(n,i,2*i))}static fromDER(n){const{r:i,s:m}=U.toSig(a.ensureBytes("DER",n));return new H(i,m)}assertValidity(){}addRecoveryBit(n){return new H(this.r,this.s,n)}recoverPublicKey(n){const{r:i,s:m,recovery:d}=this,h=f(a.ensureBytes("msgHash",n));if(d==null||![0,1,2,3].includes(d))throw new Error("recovery id invalid");const x=d===2||d===3?i+r.n:i;if(x>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const Z=d&1?"03":"02",V=A.fromHex(Z+st(x,t.BYTES)),L=F(x),q=S(-h*L),X=S(m*L),j=A.BASE.multiplyAndAddUnsafe(V,q,X);if(!j)throw new Error("point at infinify");return j.assertValidity(),j}hasHighS(){return G(this.s)}normalizeS(){return this.hasHighS()?new H(this.r,S(-this.s),this.recovery):this}toDERRawBytes(){return a.hexToBytes(this.toDERHex())}toDERHex(){return U.hexFromSig(this)}toCompactRawBytes(){return a.hexToBytes(this.toCompactHex())}toCompactHex(){const n=R;return st(this.r,n)+st(this.s,n)}}const C={isValidPrivateKey(o){try{return D(o),!0}catch{return!1}},normPrivateKeyToScalar:D,randomPrivateKey:()=>{const o=K.getMinHashLength(r.n);return K.mapHashToField(r.randomBytes(o),r.n)},precompute(o=8,n=A.BASE){return n._setWindowSize(o),n.multiply(BigInt(3)),n}};function w(o,n=!0){return A.fromPrivateKey(o).toRawBytes(n)}function e(o){if(typeof o=="bigint")return!1;if(o instanceof A)return!0;const i=a.ensureBytes("key",o).length,m=t.BYTES,d=m+1,h=2*m+1;if(!(r.allowedPrivateKeyLengths||R===d))return i===d||i===h}function s(o,n,i=!0){if(e(o)===!0)throw new Error("first arg must be private key");if(e(n)===!1)throw new Error("second arg must be public key");return A.fromHex(n).multiply(D(o)).toRawBytes(i)}const c=r.bits2int||function(o){if(o.length>8192)throw new Error("input is too large");const n=a.bytesToNumberBE(o),i=o.length*8-z;return i>0?n>>BigInt(i):n},f=r.bits2int_modN||function(o){return S(c(o))},g=a.bitMask(z);function v(o){return a.aInRange("num < 2^"+z,o,I,g),a.numberToBytesBE(o,R)}function b(o,n,i=l){if(["recovered","canonical"].some(P=>P in i))throw new Error("sign() legacy options not supported");const{hash:m,randomBytes:d}=r;let{lowS:h,prehash:x,extraEntropy:Z}=i;h==null&&(h=!0),o=a.ensureBytes("msgHash",o),at(i),x&&(o=a.ensureBytes("prehashed msgHash",m(o)));const V=f(o),L=D(n),q=[v(L),v(V)];if(Z!=null&&Z!==!1){const P=Z===!0?d(t.BYTES):Z;q.push(a.ensureBytes("extraEntropy",P))}const X=a.concatBytes(...q),j=V;function rt(P){const M=c(P);if(!nt(M))return;const ot=F(M),Q=A.BASE.multiply(M).toAffine(),k=S(Q.x);if(k===I)return;const $=S(ot*S(j+k*L));if($===I)return;let J=(Q.x===k?0:2)|Number(Q.y&O),W=$;return h&&G($)&&(W=E($),J^=1),new H(k,W,J)}return{seed:X,k2sig:rt}}const l={lowS:r.lowS,prehash:!1},p={lowS:r.lowS,prehash:!1};function u(o,n,i=l){const{seed:m,k2sig:d}=b(o,n,i),h=r;return a.createHmacDrbg(h.hash.outputLen,h.nByteLength,h.hmac)(m,d)}A.BASE._setWindowSize(8);function N(o,n,i,m=p){var J;const d=o;n=a.ensureBytes("msgHash",n),i=a.ensureBytes("publicKey",i);const{lowS:h,prehash:x,format:Z}=m;if(at(m),"strict"in m)throw new Error("options.strict was renamed to lowS");if(Z!==void 0&&Z!=="compact"&&Z!=="der")throw new Error("format must be compact or der");const V=typeof d=="string"||a.isBytes(d),L=!V&&!Z&&typeof d=="object"&&d!==null&&typeof d.r=="bigint"&&typeof d.s=="bigint";if(!V&&!L)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let q,X;try{if(L&&(q=new H(d.r,d.s)),V){try{Z!=="compact"&&(q=H.fromDER(d))}catch(W){if(!(W instanceof U.Err))throw W}!q&&Z!=="der"&&(q=H.fromCompact(d))}X=A.fromHex(i)}catch{return!1}if(!q||h&&q.hasHighS())return!1;x&&(n=r.hash(n));const{r:j,s:rt}=q,P=f(n),M=F(rt),ot=S(P*M),Q=S(j*M),k=(J=A.BASE.multiplyAndAddUnsafe(X,ot,Q))==null?void 0:J.toAffine();return k?S(k.x)===j:!1}return{CURVE:r,getPublicKey:w,getSharedSecret:s,sign:u,verify:N,ProjectivePoint:A,Signature:H,utils:C}}exports.DER=U;exports.DERErr=ct;exports.weierstrass=ht;exports.weierstrassPoints=lt;
|