@gardenfi/utils 2.0.6-beta.9 → 2.1.0-beta.1
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/index100.cjs +1 -1
- package/dist/index100.js +28 -5
- package/dist/index101.cjs +1 -1
- package/dist/index101.js +3 -11
- package/dist/index102.cjs +1 -1
- package/dist/index102.js +12 -2
- package/dist/index103.cjs +1 -1
- package/dist/index103.js +18 -19
- package/dist/index104.cjs +1 -1
- package/dist/index104.js +18 -6
- package/dist/index105.cjs +1 -1
- package/dist/index105.js +644 -5
- package/dist/index106.cjs +1 -1
- package/dist/index106.js +168 -33
- package/dist/index107.cjs +1 -1
- package/dist/index107.js +11 -126
- package/dist/index108.cjs +1 -1
- package/dist/index108.js +128 -2
- package/dist/index109.cjs +1 -2
- package/dist/index109.js +2 -3
- package/dist/index110.cjs +1 -1
- package/dist/index110.js +2 -68
- package/dist/index111.cjs +1 -1
- package/dist/index111.js +32 -64
- package/dist/index112.cjs +1 -1
- package/dist/index112.js +39 -2
- package/dist/index113.cjs +2 -1
- package/dist/index113.js +3 -35
- package/dist/index114.cjs +1 -1
- package/dist/index114.js +5 -41
- package/dist/index115.cjs +1 -1
- package/dist/index115.js +10 -643
- package/dist/index116.cjs +1 -1
- package/dist/index116.js +16 -227
- package/dist/index117.cjs +1 -1
- package/dist/index117.js +6 -172
- package/dist/index118.cjs +1 -1
- package/dist/index118.js +5 -19
- package/dist/index15.cjs +1 -1
- package/dist/index15.js +5 -5
- package/dist/index18.cjs +1 -1
- package/dist/index18.js +11 -11
- package/dist/index19.cjs +1 -1
- package/dist/index19.js +23 -23
- package/dist/index20.cjs +1 -1
- package/dist/index20.js +1 -1
- package/dist/index21.cjs +1 -1
- package/dist/index21.js +3 -3
- package/dist/index22.cjs +1 -1
- package/dist/index22.js +1 -1
- package/dist/index23.cjs +1 -1
- package/dist/index23.js +41 -17
- package/dist/index24.cjs +1 -1
- package/dist/index24.js +44 -6
- package/dist/index25.cjs +1 -1
- package/dist/index25.js +24 -44
- package/dist/index26.cjs +1 -1
- package/dist/index26.js +6 -21
- package/dist/index27.cjs +1 -1
- package/dist/index27.js +13 -8
- package/dist/index28.cjs +1 -1
- package/dist/index28.js +15 -31
- package/dist/index29.cjs +1 -1
- package/dist/index29.js +5 -26
- package/dist/index30.cjs +1 -2
- package/dist/index30.js +13 -65
- package/dist/index31.cjs +1 -1
- package/dist/index31.js +10 -51
- package/dist/index32.cjs +1 -1
- package/dist/index32.js +12 -12
- package/dist/index33.cjs +1 -1
- package/dist/index33.js +11 -24
- package/dist/index34.cjs +1 -1
- package/dist/index34.js +13 -75
- package/dist/index35.cjs +1 -1
- package/dist/index35.js +2 -2
- package/dist/index36.cjs +1 -1
- package/dist/index36.js +55 -7
- package/dist/index37.cjs +1 -1
- package/dist/index37.js +16 -32
- package/dist/index38.cjs +1 -1
- package/dist/index38.js +5 -15
- package/dist/index39.cjs +1 -1
- package/dist/index39.js +9 -2
- package/dist/index40.cjs +1 -1
- package/dist/index40.js +171 -8
- package/dist/index41.cjs +1 -1
- package/dist/index41.js +102 -19
- package/dist/index42.cjs +1 -1
- package/dist/index42.js +21 -41
- package/dist/index43.cjs +1 -1
- package/dist/index43.js +17 -25
- package/dist/index44.cjs +1 -1
- package/dist/index44.js +7 -6
- package/dist/index45.cjs +1 -1
- package/dist/index45.js +20 -12
- package/dist/index46.cjs +1 -1
- package/dist/index46.js +8 -15
- package/dist/index47.cjs +1 -1
- package/dist/index47.js +31 -5
- package/dist/index48.cjs +1 -1
- package/dist/index48.js +26 -13
- package/dist/index49.cjs +2 -1
- package/dist/index49.js +65 -10
- package/dist/index50.cjs +1 -1
- package/dist/index50.js +51 -12
- package/dist/index51.cjs +1 -1
- package/dist/index51.js +12 -11
- package/dist/index52.cjs +1 -1
- package/dist/index52.js +24 -13
- package/dist/index53.cjs +1 -1
- package/dist/index53.js +75 -55
- package/dist/index54.cjs +1 -1
- package/dist/index54.js +7 -16
- package/dist/index55.cjs +1 -1
- package/dist/index55.js +32 -5
- package/dist/index56.cjs +1 -1
- package/dist/index56.js +15 -8
- package/dist/index57.cjs +1 -1
- package/dist/index57.js +2 -172
- package/dist/index58.cjs +1 -1
- package/dist/index58.js +7 -102
- package/dist/index59.cjs +1 -1
- package/dist/index59.js +20 -21
- package/dist/index60.cjs +1 -1
- package/dist/index60.js +40 -6
- package/dist/index61.cjs +1 -1
- package/dist/index61.js +33 -11
- package/dist/index62.cjs +1 -1
- package/dist/index62.js +68 -33
- package/dist/index63.cjs +1 -1
- package/dist/index63.js +112 -8
- package/dist/index64.cjs +1 -2
- package/dist/index64.js +65 -57
- package/dist/index65.cjs +1 -1
- package/dist/index65.js +2 -2
- package/dist/index66.cjs +1 -1
- package/dist/index66.js +16 -6
- package/dist/index67.cjs +1 -1
- package/dist/index67.js +223 -4
- package/dist/index68.cjs +1 -1
- package/dist/index68.js +230 -10
- package/dist/index69.cjs +1 -5
- package/dist/index69.js +9 -53
- package/dist/index70.cjs +1 -1
- package/dist/index70.js +34 -3
- package/dist/index71.cjs +2 -2
- package/dist/index71.js +57 -32
- package/dist/index72.cjs +1 -1
- package/dist/index72.js +21 -5
- package/dist/index73.cjs +1 -1
- package/dist/index73.js +8 -21
- package/dist/index74.cjs +1 -1
- package/dist/index74.js +18 -8
- package/dist/index75.cjs +1 -1
- package/dist/index75.js +42 -10
- package/dist/index76.cjs +1 -1
- package/dist/index76.js +8 -11
- package/dist/index77.cjs +1 -1
- package/dist/index77.js +104 -6
- package/dist/index78.cjs +1 -1
- package/dist/index78.js +3 -13
- package/dist/index79.cjs +1 -1
- package/dist/index79.js +16 -31
- package/dist/index80.cjs +1 -1
- package/dist/index80.js +8 -14
- package/dist/index81.cjs +1 -1
- package/dist/index81.js +9 -63
- package/dist/index82.cjs +1 -1
- package/dist/index82.js +11 -27
- package/dist/index83.cjs +1 -1
- package/dist/index83.js +14 -3
- package/dist/index84.cjs +1 -1
- package/dist/index84.js +6 -3
- package/dist/index85.cjs +1 -1
- package/dist/index85.js +78 -8
- package/dist/index86.cjs +1 -1
- package/dist/index86.js +14 -191
- package/dist/index87.cjs +1 -1
- package/dist/index87.js +18 -18
- package/dist/index88.cjs +1 -1
- package/dist/index88.js +184 -105
- package/dist/index89.cjs +1 -1
- package/dist/index89.js +62 -14
- package/dist/index9.cjs +1 -1
- package/dist/index9.js +84 -69
- package/dist/index90.cjs +1 -1
- package/dist/index90.js +4 -223
- package/dist/index91.cjs +1 -1
- package/dist/index91.js +2 -43
- package/dist/index92.cjs +1 -1
- package/dist/index92.js +5 -103
- package/dist/index93.cjs +1 -1
- package/dist/index93.js +11 -17
- package/dist/index94.cjs +5 -1
- package/dist/index94.js +51 -73
- package/dist/index95.cjs +2 -1
- package/dist/index95.js +33 -17
- package/dist/index96.cjs +1 -1
- package/dist/index96.js +5 -11
- package/dist/index97.cjs +1 -1
- package/dist/index97.js +3 -19
- package/dist/index98.cjs +1 -1
- package/dist/index98.js +6 -38
- package/dist/index99.cjs +1 -1
- package/dist/index99.js +31 -11
- package/dist/src/lib/auth/siwe/siwe.d.ts +1 -1
- package/package.json +3 -1
package/dist/index9.js
CHANGED
|
@@ -1,102 +1,117 @@
|
|
|
1
|
-
import {
|
|
1
|
+
import { CookieJar as f } from "tough-cookie";
|
|
2
|
+
import m from "fetch-cookie";
|
|
3
|
+
import { Ok as a, Err as r } from "./index17.js";
|
|
2
4
|
import { MemoryStorage as u } from "./index13.js";
|
|
3
|
-
import { StoreKeys as
|
|
4
|
-
import { createWalletClient as
|
|
5
|
-
import { add0x as
|
|
6
|
-
import {
|
|
7
|
-
import { privateKeyToAccount as
|
|
8
|
-
import {
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
5
|
+
import { StoreKeys as w } from "./index14.js";
|
|
6
|
+
import { createWalletClient as g, http as p } from "viem";
|
|
7
|
+
import { add0x as k, parseJwt as y, Authorization as C } from "./index3.js";
|
|
8
|
+
import { mainnet as T } from "./index20.js";
|
|
9
|
+
import { privateKeyToAccount as v } from "./index19.js";
|
|
10
|
+
import { createSiweMessage as S } from "./index21.js";
|
|
11
|
+
class d {
|
|
12
|
+
constructor(e, n, t) {
|
|
13
|
+
if (this.url = e.endpoint("siwe"), this.walletClient = n, this.domain = (t == null ? void 0 : t.domain) || "app.garden.finance", this.domain.startsWith("https://") && (this.domain = this.domain.split("https://")[1]), this.signingStatement = (t == null ? void 0 : t.signingStatement) ?? "Garden.fi", this.store = (t == null ? void 0 : t.store) ?? (typeof window < "u" ? window.localStorage : new u()), typeof window > "u") {
|
|
14
|
+
const i = new f();
|
|
15
|
+
this.fetchWithCookies = m(fetch, i);
|
|
16
|
+
} else
|
|
17
|
+
this.fetchWithCookies = window.fetch.bind(window);
|
|
13
18
|
}
|
|
14
|
-
static fromDigestKey(e,
|
|
15
|
-
const
|
|
16
|
-
account:
|
|
17
|
-
transport:
|
|
18
|
-
chain:
|
|
19
|
+
static fromDigestKey(e, n, t) {
|
|
20
|
+
const i = g({
|
|
21
|
+
account: v(k(n.digestKey)),
|
|
22
|
+
transport: p(),
|
|
23
|
+
chain: T
|
|
19
24
|
});
|
|
20
|
-
return new
|
|
25
|
+
return new d(e, i, t);
|
|
21
26
|
}
|
|
22
|
-
verifyToken(e,
|
|
27
|
+
verifyToken(e, n) {
|
|
23
28
|
try {
|
|
24
29
|
const t = y(e);
|
|
25
|
-
if (!t) return
|
|
26
|
-
const
|
|
27
|
-
return
|
|
28
|
-
t.exp >
|
|
30
|
+
if (!t) return a(!1);
|
|
31
|
+
const i = Math.floor(Date.now() / 1e3) + 120;
|
|
32
|
+
return a(
|
|
33
|
+
t.exp > i && t.user_id.toLowerCase() === n.toLowerCase()
|
|
29
34
|
);
|
|
30
35
|
} catch {
|
|
31
|
-
return
|
|
36
|
+
return a(!1);
|
|
32
37
|
}
|
|
33
38
|
}
|
|
34
39
|
async getToken() {
|
|
35
|
-
var
|
|
36
|
-
if (!((
|
|
37
|
-
return
|
|
38
|
-
const e = this.
|
|
39
|
-
if (e)
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
}),
|
|
55
|
-
headers: {
|
|
56
|
-
"Content-Type": "application/json"
|
|
40
|
+
var i;
|
|
41
|
+
if (!((i = this.walletClient.account) != null && i.address))
|
|
42
|
+
return r("Wallet client does not have an account");
|
|
43
|
+
const e = await this.signStatement();
|
|
44
|
+
if (e.error)
|
|
45
|
+
return r(e.error);
|
|
46
|
+
let n;
|
|
47
|
+
try {
|
|
48
|
+
const o = await (await this.fetchWithCookies(
|
|
49
|
+
this.url.endpoint("tokens"),
|
|
50
|
+
{
|
|
51
|
+
method: "POST",
|
|
52
|
+
body: JSON.stringify({
|
|
53
|
+
...e.val
|
|
54
|
+
}),
|
|
55
|
+
headers: {
|
|
56
|
+
"Content-Type": "application/json"
|
|
57
|
+
},
|
|
58
|
+
credentials: "include"
|
|
57
59
|
}
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
60
|
+
)).json();
|
|
61
|
+
if (o.error || !o.result)
|
|
62
|
+
return r(o.error ?? "Failed to get token");
|
|
63
|
+
n = o.result;
|
|
64
|
+
} catch (s) {
|
|
65
|
+
return r("Failed to get token", s);
|
|
66
|
+
}
|
|
63
67
|
if (!this.verifyToken(n, this.walletClient.account.address).val)
|
|
64
68
|
throw new Error("Token verification failed");
|
|
65
|
-
return this.store.setItem(
|
|
69
|
+
return this.store.setItem(w.AUTH_TOKEN, n), a(n);
|
|
66
70
|
}
|
|
67
71
|
async signStatement() {
|
|
68
72
|
var l;
|
|
69
73
|
if (!((l = this.walletClient.account) != null && l.address))
|
|
70
|
-
return
|
|
71
|
-
const e = /* @__PURE__ */ new Date(),
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
74
|
+
return r("Wallet client does not have a valid account");
|
|
75
|
+
const e = /* @__PURE__ */ new Date(), n = new Date(e.getTime() + 300 * 1e3);
|
|
76
|
+
let t;
|
|
77
|
+
try {
|
|
78
|
+
const c = await (await this.fetchWithCookies(this.url.endpoint("challenges"), {
|
|
79
|
+
method: "POST",
|
|
80
|
+
headers: {
|
|
81
|
+
"Content-Type": "application/json"
|
|
82
|
+
},
|
|
83
|
+
credentials: "include"
|
|
84
|
+
})).json();
|
|
85
|
+
if (c.error || !c.result)
|
|
86
|
+
return r("Failed to get nonce");
|
|
87
|
+
t = c.result;
|
|
88
|
+
} catch (h) {
|
|
89
|
+
return r("Failed to get nonce", h);
|
|
90
|
+
}
|
|
91
|
+
const i = await this.walletClient.getChainId(), s = S({
|
|
77
92
|
domain: this.domain,
|
|
78
93
|
address: this.walletClient.account.address,
|
|
79
94
|
statement: this.signingStatement,
|
|
80
|
-
nonce:
|
|
95
|
+
nonce: t,
|
|
81
96
|
uri: "https://" + this.domain,
|
|
82
97
|
version: "1",
|
|
83
|
-
chainId:
|
|
84
|
-
notBefore:
|
|
85
|
-
}),
|
|
98
|
+
chainId: i,
|
|
99
|
+
notBefore: n
|
|
100
|
+
}), o = await this.walletClient.signMessage({
|
|
86
101
|
account: this.walletClient.account,
|
|
87
|
-
message:
|
|
102
|
+
message: s
|
|
88
103
|
});
|
|
89
|
-
return
|
|
90
|
-
message:
|
|
91
|
-
signature:
|
|
92
|
-
nonce:
|
|
104
|
+
return a({
|
|
105
|
+
message: s,
|
|
106
|
+
signature: o,
|
|
107
|
+
nonce: t
|
|
93
108
|
});
|
|
94
109
|
}
|
|
95
110
|
async getAuthHeaders() {
|
|
96
111
|
const e = await this.getToken();
|
|
97
|
-
return e.error ?
|
|
112
|
+
return e.error ? r(e.error) : a({ Authorization: C(e.val) });
|
|
98
113
|
}
|
|
99
114
|
}
|
|
100
115
|
export {
|
|
101
|
-
|
|
116
|
+
d as Siwe
|
|
102
117
|
};
|
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("./index78.cjs");function i(e){return t.isHex(e,{strict:!1})?Math.ceil((e.length-2)/2):e.length}exports.size=i;
|
package/dist/index90.js
CHANGED
|
@@ -1,226 +1,7 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
function g(t, i) {
|
|
5
|
-
const r = t % i;
|
|
6
|
-
return r >= d ? r : i + r;
|
|
7
|
-
}
|
|
8
|
-
function Z(t, i, r) {
|
|
9
|
-
if (i < d)
|
|
10
|
-
throw new Error("invalid exponent, negatives unsupported");
|
|
11
|
-
if (r <= d)
|
|
12
|
-
throw new Error("invalid modulus");
|
|
13
|
-
if (r === c)
|
|
14
|
-
return d;
|
|
15
|
-
let e = c;
|
|
16
|
-
for (; i > d; )
|
|
17
|
-
i & c && (e = e * t % r), t = t * t % r, i >>= c;
|
|
18
|
-
return e;
|
|
19
|
-
}
|
|
20
|
-
function V(t, i, r) {
|
|
21
|
-
let e = t;
|
|
22
|
-
for (; i-- > d; )
|
|
23
|
-
e *= e, e %= r;
|
|
24
|
-
return e;
|
|
25
|
-
}
|
|
26
|
-
function I(t, i) {
|
|
27
|
-
if (t === d)
|
|
28
|
-
throw new Error("invert: expected non-zero number");
|
|
29
|
-
if (i <= d)
|
|
30
|
-
throw new Error("invert: expected positive modulus, got " + i);
|
|
31
|
-
let r = g(t, i), e = i, s = d, u = c;
|
|
32
|
-
for (; r !== d; ) {
|
|
33
|
-
const o = e / r, n = e % r, l = s - u * o;
|
|
34
|
-
e = r, r = n, s = u, u = l;
|
|
35
|
-
}
|
|
36
|
-
if (e !== c)
|
|
37
|
-
throw new Error("invert: does not exist");
|
|
38
|
-
return g(s, i);
|
|
39
|
-
}
|
|
40
|
-
function j(t) {
|
|
41
|
-
const i = (t - c) / w;
|
|
42
|
-
let r, e, s;
|
|
43
|
-
for (r = t - c, e = 0; r % w === d; r /= w, e++)
|
|
44
|
-
;
|
|
45
|
-
for (s = w; s < t && Z(s, i, t) !== t - c; s++)
|
|
46
|
-
if (s > 1e3)
|
|
47
|
-
throw new Error("Cannot find square root: likely non-prime P");
|
|
48
|
-
if (e === 1) {
|
|
49
|
-
const f = (t + c) / b;
|
|
50
|
-
return function(n, l) {
|
|
51
|
-
const h = n.pow(l, f);
|
|
52
|
-
if (!n.eql(n.sqr(h), l))
|
|
53
|
-
throw new Error("Cannot find square root");
|
|
54
|
-
return h;
|
|
55
|
-
};
|
|
56
|
-
}
|
|
57
|
-
const u = (r + c) / w;
|
|
58
|
-
return function(o, n) {
|
|
59
|
-
if (o.pow(n, i) === o.neg(o.ONE))
|
|
60
|
-
throw new Error("Cannot find square root");
|
|
61
|
-
let l = e, h = o.pow(o.mul(o.ONE, s), r), v = o.pow(n, u), a = o.pow(n, r);
|
|
62
|
-
for (; !o.eql(a, o.ONE); ) {
|
|
63
|
-
if (o.eql(a, o.ZERO))
|
|
64
|
-
return o.ZERO;
|
|
65
|
-
let q = 1;
|
|
66
|
-
for (let B = o.sqr(a); q < l && !o.eql(B, o.ONE); q++)
|
|
67
|
-
B = o.sqr(B);
|
|
68
|
-
const E = o.pow(h, c << BigInt(l - q - 1));
|
|
69
|
-
h = o.sqr(E), v = o.mul(v, E), a = o.mul(a, h), l = q;
|
|
70
|
-
}
|
|
71
|
-
return v;
|
|
72
|
-
};
|
|
73
|
-
}
|
|
74
|
-
function z(t) {
|
|
75
|
-
if (t % b === C) {
|
|
76
|
-
const i = (t + c) / b;
|
|
77
|
-
return function(e, s) {
|
|
78
|
-
const u = e.pow(s, i);
|
|
79
|
-
if (!e.eql(e.sqr(u), s))
|
|
80
|
-
throw new Error("Cannot find square root");
|
|
81
|
-
return u;
|
|
82
|
-
};
|
|
83
|
-
}
|
|
84
|
-
if (t % m === N) {
|
|
85
|
-
const i = (t - N) / m;
|
|
86
|
-
return function(e, s) {
|
|
87
|
-
const u = e.mul(s, w), f = e.pow(u, i), o = e.mul(s, f), n = e.mul(e.mul(o, w), f), l = e.mul(o, e.sub(n, e.ONE));
|
|
88
|
-
if (!e.eql(e.sqr(l), s))
|
|
89
|
-
throw new Error("Cannot find square root");
|
|
90
|
-
return l;
|
|
91
|
-
};
|
|
92
|
-
}
|
|
93
|
-
return j(t);
|
|
94
|
-
}
|
|
95
|
-
const A = [
|
|
96
|
-
"create",
|
|
97
|
-
"isValid",
|
|
98
|
-
"is0",
|
|
99
|
-
"neg",
|
|
100
|
-
"inv",
|
|
101
|
-
"sqrt",
|
|
102
|
-
"sqr",
|
|
103
|
-
"eql",
|
|
104
|
-
"add",
|
|
105
|
-
"sub",
|
|
106
|
-
"mul",
|
|
107
|
-
"pow",
|
|
108
|
-
"div",
|
|
109
|
-
"addN",
|
|
110
|
-
"subN",
|
|
111
|
-
"mulN",
|
|
112
|
-
"sqrN"
|
|
113
|
-
];
|
|
114
|
-
function Y(t) {
|
|
115
|
-
const i = {
|
|
116
|
-
ORDER: "bigint",
|
|
117
|
-
MASK: "bigint",
|
|
118
|
-
BYTES: "isSafeInteger",
|
|
119
|
-
BITS: "isSafeInteger"
|
|
120
|
-
}, r = A.reduce((e, s) => (e[s] = "function", e), i);
|
|
121
|
-
return M(t, r);
|
|
122
|
-
}
|
|
123
|
-
function k(t, i, r) {
|
|
124
|
-
if (r < d)
|
|
125
|
-
throw new Error("invalid exponent, negatives unsupported");
|
|
126
|
-
if (r === d)
|
|
127
|
-
return t.ONE;
|
|
128
|
-
if (r === c)
|
|
129
|
-
return i;
|
|
130
|
-
let e = t.ONE, s = i;
|
|
131
|
-
for (; r > d; )
|
|
132
|
-
r & c && (e = t.mul(e, s)), s = t.sqr(s), r >>= c;
|
|
133
|
-
return e;
|
|
134
|
-
}
|
|
135
|
-
function H(t, i) {
|
|
136
|
-
const r = new Array(i.length), e = i.reduce((u, f, o) => t.is0(f) ? u : (r[o] = u, t.mul(u, f)), t.ONE), s = t.inv(e);
|
|
137
|
-
return i.reduceRight((u, f, o) => t.is0(f) ? u : (r[o] = t.mul(u, r[o]), t.mul(u, f)), s), r;
|
|
138
|
-
}
|
|
139
|
-
function K(t, i) {
|
|
140
|
-
const r = i !== void 0 ? i : t.toString(2).length, e = Math.ceil(r / 8);
|
|
141
|
-
return { nBitLength: r, nByteLength: e };
|
|
142
|
-
}
|
|
143
|
-
function p(t, i, r = !1, e = {}) {
|
|
144
|
-
if (t <= d)
|
|
145
|
-
throw new Error("invalid field: expected ORDER > 0, got " + t);
|
|
146
|
-
const { nBitLength: s, nByteLength: u } = K(t, i);
|
|
147
|
-
if (u > 2048)
|
|
148
|
-
throw new Error("invalid field: expected ORDER of <= 2048 bytes");
|
|
149
|
-
let f;
|
|
150
|
-
const o = Object.freeze({
|
|
151
|
-
ORDER: t,
|
|
152
|
-
isLE: r,
|
|
153
|
-
BITS: s,
|
|
154
|
-
BYTES: u,
|
|
155
|
-
MASK: _(s),
|
|
156
|
-
ZERO: d,
|
|
157
|
-
ONE: c,
|
|
158
|
-
create: (n) => g(n, t),
|
|
159
|
-
isValid: (n) => {
|
|
160
|
-
if (typeof n != "bigint")
|
|
161
|
-
throw new Error("invalid field element: expected bigint, got " + typeof n);
|
|
162
|
-
return d <= n && n < t;
|
|
163
|
-
},
|
|
164
|
-
is0: (n) => n === d,
|
|
165
|
-
isOdd: (n) => (n & c) === c,
|
|
166
|
-
neg: (n) => g(-n, t),
|
|
167
|
-
eql: (n, l) => n === l,
|
|
168
|
-
sqr: (n) => g(n * n, t),
|
|
169
|
-
add: (n, l) => g(n + l, t),
|
|
170
|
-
sub: (n, l) => g(n - l, t),
|
|
171
|
-
mul: (n, l) => g(n * l, t),
|
|
172
|
-
pow: (n, l) => k(o, n, l),
|
|
173
|
-
div: (n, l) => g(n * I(l, t), t),
|
|
174
|
-
// Same as above, but doesn't normalize
|
|
175
|
-
sqrN: (n) => n * n,
|
|
176
|
-
addN: (n, l) => n + l,
|
|
177
|
-
subN: (n, l) => n - l,
|
|
178
|
-
mulN: (n, l) => n * l,
|
|
179
|
-
inv: (n) => I(n, t),
|
|
180
|
-
sqrt: e.sqrt || ((n) => (f || (f = z(t)), f(o, n))),
|
|
181
|
-
invertBatch: (n) => H(o, n),
|
|
182
|
-
// TODO: do we really need constant cmov?
|
|
183
|
-
// We don't have const-time bigints anyway, so probably will be not very useful
|
|
184
|
-
cmov: (n, l, h) => h ? l : n,
|
|
185
|
-
toBytes: (n) => r ? S(n, u) : x(n, u),
|
|
186
|
-
fromBytes: (n) => {
|
|
187
|
-
if (n.length !== u)
|
|
188
|
-
throw new Error("Field.fromBytes: expected " + u + " bytes, got " + n.length);
|
|
189
|
-
return r ? y(n) : L(n);
|
|
190
|
-
}
|
|
191
|
-
});
|
|
192
|
-
return Object.freeze(o);
|
|
193
|
-
}
|
|
194
|
-
function T(t) {
|
|
195
|
-
if (typeof t != "bigint")
|
|
196
|
-
throw new Error("field order must be bigint");
|
|
197
|
-
const i = t.toString(2).length;
|
|
198
|
-
return Math.ceil(i / 8);
|
|
199
|
-
}
|
|
200
|
-
function O(t) {
|
|
201
|
-
const i = T(t);
|
|
202
|
-
return i + Math.ceil(i / 2);
|
|
203
|
-
}
|
|
204
|
-
function G(t, i, r = !1) {
|
|
205
|
-
const e = t.length, s = T(i), u = O(i);
|
|
206
|
-
if (e < 16 || e < u || e > 1024)
|
|
207
|
-
throw new Error("expected " + u + "-1024 bytes of input, got " + e);
|
|
208
|
-
const f = r ? y(t) : L(t), o = g(f, i - c) + c;
|
|
209
|
-
return r ? S(o, s) : x(o, s);
|
|
1
|
+
import { isHex as r } from "./index78.js";
|
|
2
|
+
function i(t) {
|
|
3
|
+
return r(t, { strict: !1 }) ? Math.ceil((t.length - 2) / 2) : t.length;
|
|
210
4
|
}
|
|
211
5
|
export {
|
|
212
|
-
|
|
213
|
-
H as FpInvertBatch,
|
|
214
|
-
k as FpPow,
|
|
215
|
-
z as FpSqrt,
|
|
216
|
-
T as getFieldBytesLength,
|
|
217
|
-
O as getMinHashLength,
|
|
218
|
-
I as invert,
|
|
219
|
-
G as mapHashToField,
|
|
220
|
-
g as mod,
|
|
221
|
-
K as nLength,
|
|
222
|
-
Z as pow,
|
|
223
|
-
V as pow2,
|
|
224
|
-
j as tonelliShanks,
|
|
225
|
-
Y as validateField
|
|
6
|
+
i as size
|
|
226
7
|
};
|
package/dist/index91.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="2.26.3";exports.version=e;
|
package/dist/index91.js
CHANGED
|
@@ -1,45 +1,4 @@
|
|
|
1
|
-
|
|
2
|
-
import { createCursor as r } from "./index107.js";
|
|
3
|
-
import { hexToBytes as g } from "./index53.js";
|
|
4
|
-
import { bytesToHex as u } from "./index25.js";
|
|
5
|
-
function m(n, e = "hex") {
|
|
6
|
-
const i = s(n), h = r(new Uint8Array(i.length));
|
|
7
|
-
return i.encode(h), e === "hex" ? u(h.bytes) : h.bytes;
|
|
8
|
-
}
|
|
9
|
-
function s(n) {
|
|
10
|
-
return Array.isArray(n) ? p(n.map((e) => s(e))) : y(n);
|
|
11
|
-
}
|
|
12
|
-
function p(n) {
|
|
13
|
-
const e = n.reduce((t, f) => t + f.length, 0), i = o(e);
|
|
14
|
-
return {
|
|
15
|
-
length: e <= 55 ? 1 + e : 1 + i + e,
|
|
16
|
-
encode(t) {
|
|
17
|
-
e <= 55 ? t.pushByte(192 + e) : (t.pushByte(247 + i), i === 1 ? t.pushUint8(e) : i === 2 ? t.pushUint16(e) : i === 3 ? t.pushUint24(e) : t.pushUint32(e));
|
|
18
|
-
for (const { encode: f } of n)
|
|
19
|
-
f(t);
|
|
20
|
-
}
|
|
21
|
-
};
|
|
22
|
-
}
|
|
23
|
-
function y(n) {
|
|
24
|
-
const e = typeof n == "string" ? g(n) : n, i = o(e.length);
|
|
25
|
-
return {
|
|
26
|
-
length: e.length === 1 && e[0] < 128 ? 1 : e.length <= 55 ? 1 + e.length : 1 + i + e.length,
|
|
27
|
-
encode(t) {
|
|
28
|
-
e.length === 1 && e[0] < 128 ? t.pushBytes(e) : e.length <= 55 ? (t.pushByte(128 + e.length), t.pushBytes(e)) : (t.pushByte(183 + i), i === 1 ? t.pushUint8(e.length) : i === 2 ? t.pushUint16(e.length) : i === 3 ? t.pushUint24(e.length) : t.pushUint32(e.length), t.pushBytes(e));
|
|
29
|
-
}
|
|
30
|
-
};
|
|
31
|
-
}
|
|
32
|
-
function o(n) {
|
|
33
|
-
if (n < 2 ** 8)
|
|
34
|
-
return 1;
|
|
35
|
-
if (n < 2 ** 16)
|
|
36
|
-
return 2;
|
|
37
|
-
if (n < 2 ** 24)
|
|
38
|
-
return 3;
|
|
39
|
-
if (n < 2 ** 32)
|
|
40
|
-
return 4;
|
|
41
|
-
throw new l("Length is too large.");
|
|
42
|
-
}
|
|
1
|
+
const o = "2.26.3";
|
|
43
2
|
export {
|
|
44
|
-
|
|
3
|
+
o as version
|
|
45
4
|
};
|
package/dist/index92.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("./index71.cjs");class i extends e.BaseError{constructor({chainId:r}){super(typeof r=="number"?`Chain ID "${r}" is invalid.`:"Chain ID is invalid.",{name:"InvalidChainIdError"})}}exports.InvalidChainIdError=i;
|
package/dist/index92.js
CHANGED
|
@@ -1,107 +1,9 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
for (let e = 0, t = f, s = 1, n = 0; e < 24; e++) {
|
|
6
|
-
[s, n] = [n, (2 * s + 3 * n) % 5], y.push(2 * (5 * n + s)), L.push((e + 1) * (e + 2) / 2 % 64);
|
|
7
|
-
let o = M;
|
|
8
|
-
for (let r = 0; r < 7; r++)
|
|
9
|
-
t = (t << f ^ (t >> j) * q) % C, t & R && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
|
|
10
|
-
b.push(o);
|
|
11
|
-
}
|
|
12
|
-
const [v, z] = /* @__PURE__ */ H(b, !0), O = (e, t, s) => s > 32 ? m(e, t, s) : S(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : F(e, t, s);
|
|
13
|
-
function D(e, t = 24) {
|
|
14
|
-
const s = new Uint32Array(10);
|
|
15
|
-
for (let n = 24 - t; n < 24; n++) {
|
|
16
|
-
for (let i = 0; i < 10; i++)
|
|
17
|
-
s[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
|
|
18
|
-
for (let i = 0; i < 10; i += 2) {
|
|
19
|
-
const h = (i + 8) % 10, l = (i + 2) % 10, u = s[l], c = s[l + 1], _ = O(u, c, 1) ^ s[h], g = w(u, c, 1) ^ s[h + 1];
|
|
20
|
-
for (let a = 0; a < 50; a += 10)
|
|
21
|
-
e[i + a] ^= _, e[i + a + 1] ^= g;
|
|
22
|
-
}
|
|
23
|
-
let o = e[2], r = e[3];
|
|
24
|
-
for (let i = 0; i < 24; i++) {
|
|
25
|
-
const h = L[i], l = O(o, r, h), u = w(o, r, h), c = y[i];
|
|
26
|
-
o = e[c], r = e[c + 1], e[c] = l, e[c + 1] = u;
|
|
27
|
-
}
|
|
28
|
-
for (let i = 0; i < 50; i += 10) {
|
|
29
|
-
for (let h = 0; h < 10; h++)
|
|
30
|
-
s[h] = e[i + h];
|
|
31
|
-
for (let h = 0; h < 10; h++)
|
|
32
|
-
e[i + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
|
|
33
|
-
}
|
|
34
|
-
e[0] ^= v[n], e[1] ^= z[n];
|
|
35
|
-
}
|
|
36
|
-
s.fill(0);
|
|
37
|
-
}
|
|
38
|
-
class p extends E {
|
|
39
|
-
// NOTE: we accept arguments in bytes instead of bits here.
|
|
40
|
-
constructor(t, s, n, o = !1, r = 24) {
|
|
41
|
-
if (super(), this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = o, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, d(n), 0 >= this.blockLen || this.blockLen >= 200)
|
|
42
|
-
throw new Error("Sha3 supports only keccak-f1600 function");
|
|
43
|
-
this.state = new Uint8Array(200), this.state32 = U(this.state);
|
|
44
|
-
}
|
|
45
|
-
keccak() {
|
|
46
|
-
x || I(this.state32), D(this.state32, this.rounds), x || I(this.state32), this.posOut = 0, this.pos = 0;
|
|
47
|
-
}
|
|
48
|
-
update(t) {
|
|
49
|
-
k(this);
|
|
50
|
-
const { blockLen: s, state: n } = this;
|
|
51
|
-
t = P(t);
|
|
52
|
-
const o = t.length;
|
|
53
|
-
for (let r = 0; r < o; ) {
|
|
54
|
-
const i = Math.min(s - this.pos, o - r);
|
|
55
|
-
for (let h = 0; h < i; h++)
|
|
56
|
-
n[this.pos++] ^= t[r++];
|
|
57
|
-
this.pos === s && this.keccak();
|
|
58
|
-
}
|
|
59
|
-
return this;
|
|
60
|
-
}
|
|
61
|
-
finish() {
|
|
62
|
-
if (this.finished)
|
|
63
|
-
return;
|
|
64
|
-
this.finished = !0;
|
|
65
|
-
const { state: t, suffix: s, pos: n, blockLen: o } = this;
|
|
66
|
-
t[n] ^= s, s & 128 && n === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
|
|
67
|
-
}
|
|
68
|
-
writeInto(t) {
|
|
69
|
-
k(this, !1), B(t), this.finish();
|
|
70
|
-
const s = this.state, { blockLen: n } = this;
|
|
71
|
-
for (let o = 0, r = t.length; o < r; ) {
|
|
72
|
-
this.posOut >= n && this.keccak();
|
|
73
|
-
const i = Math.min(n - this.posOut, r - o);
|
|
74
|
-
t.set(s.subarray(this.posOut, this.posOut + i), o), this.posOut += i, o += i;
|
|
75
|
-
}
|
|
76
|
-
return t;
|
|
77
|
-
}
|
|
78
|
-
xofInto(t) {
|
|
79
|
-
if (!this.enableXOF)
|
|
80
|
-
throw new Error("XOF is not possible for this instance");
|
|
81
|
-
return this.writeInto(t);
|
|
82
|
-
}
|
|
83
|
-
xof(t) {
|
|
84
|
-
return d(t), this.xofInto(new Uint8Array(t));
|
|
85
|
-
}
|
|
86
|
-
digestInto(t) {
|
|
87
|
-
if (A(t, this), this.finished)
|
|
88
|
-
throw new Error("digest() was already called");
|
|
89
|
-
return this.writeInto(t), this.destroy(), t;
|
|
90
|
-
}
|
|
91
|
-
digest() {
|
|
92
|
-
return this.digestInto(new Uint8Array(this.outputLen));
|
|
93
|
-
}
|
|
94
|
-
destroy() {
|
|
95
|
-
this.destroyed = !0, this.state.fill(0);
|
|
96
|
-
}
|
|
97
|
-
_cloneInto(t) {
|
|
98
|
-
const { blockLen: s, suffix: n, outputLen: o, rounds: r, enableXOF: i } = this;
|
|
99
|
-
return t || (t = new p(s, n, o, i, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = n, t.outputLen = o, t.enableXOF = i, t.destroyed = this.destroyed, t;
|
|
1
|
+
import { BaseError as i } from "./index71.js";
|
|
2
|
+
class o extends i {
|
|
3
|
+
constructor({ chainId: r }) {
|
|
4
|
+
super(typeof r == "number" ? `Chain ID "${r}" is invalid.` : "Chain ID is invalid.", { name: "InvalidChainIdError" });
|
|
100
5
|
}
|
|
101
6
|
}
|
|
102
|
-
const G = (e, t, s) => X(() => new p(t, e, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
|
|
103
7
|
export {
|
|
104
|
-
|
|
105
|
-
D as keccakP,
|
|
106
|
-
Q as keccak_256
|
|
8
|
+
o as InvalidChainIdError
|
|
107
9
|
};
|
package/dist/index93.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 r(n,{args:a,eventName:t}={}){return{...n,blockHash:n.blockHash?n.blockHash:null,blockNumber:n.blockNumber?BigInt(n.blockNumber):null,logIndex:n.logIndex?Number(n.logIndex):null,transactionHash:n.transactionHash?n.transactionHash:null,transactionIndex:n.transactionIndex?Number(n.transactionIndex):null,...t?{args:a,eventName:t}:{}}}exports.formatLog=r;
|
package/dist/index93.js
CHANGED
|
@@ -1,20 +1,14 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
t
|
|
10
|
-
|
|
11
|
-
s,
|
|
12
|
-
n ? i(n) : "0x",
|
|
13
|
-
...c({}, a)
|
|
14
|
-
]);
|
|
15
|
-
}
|
|
16
|
-
return t;
|
|
1
|
+
function r(n, { args: t, eventName: a } = {}) {
|
|
2
|
+
return {
|
|
3
|
+
...n,
|
|
4
|
+
blockHash: n.blockHash ? n.blockHash : null,
|
|
5
|
+
blockNumber: n.blockNumber ? BigInt(n.blockNumber) : null,
|
|
6
|
+
logIndex: n.logIndex ? Number(n.logIndex) : null,
|
|
7
|
+
transactionHash: n.transactionHash ? n.transactionHash : null,
|
|
8
|
+
transactionIndex: n.transactionIndex ? Number(n.transactionIndex) : null,
|
|
9
|
+
...a ? { args: t, eventName: a } : {}
|
|
10
|
+
};
|
|
17
11
|
}
|
|
18
12
|
export {
|
|
19
|
-
|
|
13
|
+
r as formatLog
|
|
20
14
|
};
|