@gardenfi/utils 2.1.1 → 2.1.2-beta.0
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 +19 -3
- package/dist/index101.cjs +1 -1
- package/dist/index101.js +1 -1
- package/dist/index104.cjs +1 -1
- package/dist/index104.js +1 -1
- package/dist/index105.cjs +1 -1
- package/dist/index105.js +33 -638
- package/dist/index106.cjs +1 -1
- package/dist/index106.js +5 -173
- package/dist/index107.cjs +1 -1
- package/dist/index107.js +10 -18
- package/dist/index108.cjs +1 -1
- package/dist/index108.js +2 -128
- package/dist/index109.cjs +1 -1
- package/dist/index109.js +128 -2
- package/dist/index110.cjs +1 -1
- package/dist/index110.js +7 -2
- package/dist/index111.cjs +1 -1
- package/dist/index111.js +2 -38
- package/dist/index112.cjs +1 -1
- package/dist/index112.js +33 -34
- package/dist/index113.cjs +1 -2
- package/dist/index113.js +21 -3
- package/dist/index114.cjs +1 -1
- package/dist/index114.js +5 -5
- package/dist/index115.cjs +2 -1
- package/dist/index115.js +3 -11
- package/dist/index116.cjs +1 -1
- package/dist/index116.js +18 -6
- package/dist/index117.cjs +1 -1
- package/dist/index117.js +638 -15
- package/dist/index118.cjs +1 -1
- package/dist/index118.js +173 -5
- package/dist/index18.cjs +1 -1
- package/dist/index18.js +11 -11
- package/dist/index19.cjs +1 -1
- package/dist/index19.js +9 -9
- package/dist/index21.cjs +1 -1
- package/dist/index21.js +1 -1
- package/dist/index23.cjs +1 -1
- package/dist/index23.js +17 -41
- package/dist/index24.cjs +1 -1
- package/dist/index24.js +6 -44
- package/dist/index25.cjs +1 -1
- package/dist/index25.js +44 -24
- package/dist/index26.cjs +1 -1
- package/dist/index26.js +21 -6
- package/dist/index27.cjs +1 -1
- package/dist/index27.js +8 -13
- package/dist/index28.cjs +1 -1
- package/dist/index28.js +31 -15
- package/dist/index29.cjs +1 -1
- package/dist/index29.js +26 -5
- package/dist/index30.cjs +2 -1
- package/dist/index30.js +65 -13
- package/dist/index31.cjs +1 -1
- package/dist/index31.js +51 -10
- package/dist/index32.cjs +1 -1
- package/dist/index32.js +12 -12
- package/dist/index33.cjs +1 -1
- package/dist/index33.js +24 -11
- package/dist/index34.cjs +1 -1
- package/dist/index34.js +75 -13
- package/dist/index35.cjs +1 -1
- package/dist/index35.js +1 -1
- package/dist/index36.cjs +1 -1
- package/dist/index36.js +7 -55
- package/dist/index37.cjs +1 -1
- package/dist/index37.js +32 -16
- package/dist/index38.cjs +1 -1
- package/dist/index38.js +15 -5
- package/dist/index39.cjs +1 -1
- package/dist/index39.js +2 -9
- package/dist/index4.cjs +1 -1
- package/dist/index4.js +19 -18
- package/dist/index40.cjs +1 -1
- package/dist/index40.js +8 -171
- package/dist/index41.cjs +1 -1
- package/dist/index41.js +19 -102
- package/dist/index42.cjs +1 -1
- package/dist/index42.js +41 -21
- package/dist/index43.cjs +1 -1
- package/dist/index43.js +25 -17
- package/dist/index44.cjs +1 -1
- package/dist/index44.js +6 -7
- package/dist/index45.cjs +1 -1
- package/dist/index45.js +12 -20
- package/dist/index46.cjs +1 -1
- package/dist/index46.js +15 -8
- package/dist/index47.cjs +1 -1
- package/dist/index47.js +5 -31
- package/dist/index48.cjs +1 -1
- package/dist/index48.js +13 -26
- package/dist/index49.cjs +1 -2
- package/dist/index49.js +10 -65
- package/dist/index50.cjs +1 -1
- package/dist/index50.js +12 -51
- package/dist/index51.cjs +1 -1
- package/dist/index51.js +11 -12
- package/dist/index52.cjs +1 -1
- package/dist/index52.js +13 -24
- package/dist/index53.cjs +1 -1
- package/dist/index53.js +55 -75
- package/dist/index54.cjs +1 -1
- package/dist/index54.js +16 -7
- package/dist/index55.cjs +1 -1
- package/dist/index55.js +5 -32
- package/dist/index56.cjs +1 -1
- package/dist/index56.js +8 -15
- package/dist/index57.cjs +1 -1
- package/dist/index57.js +172 -2
- package/dist/index58.cjs +1 -1
- package/dist/index58.js +102 -7
- package/dist/index59.cjs +1 -1
- package/dist/index59.js +21 -20
- package/dist/index60.cjs +1 -1
- package/dist/index60.js +1 -1
- package/dist/index62.cjs +1 -1
- package/dist/index62.js +6 -112
- package/dist/index63.cjs +2 -1
- package/dist/index63.js +58 -15
- package/dist/index64.cjs +1 -1
- package/dist/index64.js +2 -224
- package/dist/index65.cjs +1 -2
- package/dist/index65.js +5 -58
- package/dist/index66.cjs +1 -1
- package/dist/index66.js +4 -21
- package/dist/index67.cjs +1 -1
- package/dist/index67.js +11 -40
- package/dist/index68.cjs +5 -1
- package/dist/index68.js +51 -29
- package/dist/index69.cjs +2 -1
- package/dist/index69.js +31 -66
- package/dist/index70.cjs +1 -1
- package/dist/index70.js +5 -67
- package/dist/index71.cjs +1 -1
- package/dist/index71.js +4 -2
- package/dist/index72.cjs +1 -1
- package/dist/index72.js +18 -228
- package/dist/index73.cjs +1 -1
- package/dist/index73.js +8 -18
- package/dist/index74.cjs +1 -1
- package/dist/index74.js +10 -42
- package/dist/index75.cjs +1 -1
- package/dist/index75.js +11 -4
- package/dist/index76.cjs +1 -1
- package/dist/index76.js +6 -3
- package/dist/index77.cjs +1 -1
- package/dist/index77.js +13 -8
- package/dist/index78.cjs +1 -1
- package/dist/index78.js +30 -102
- package/dist/index79.cjs +1 -1
- package/dist/index79.js +14 -17
- package/dist/index80.cjs +1 -1
- package/dist/index80.js +64 -8
- package/dist/index81.cjs +1 -1
- package/dist/index81.js +26 -9
- package/dist/index82.cjs +1 -1
- package/dist/index82.js +3 -12
- package/dist/index83.cjs +1 -1
- package/dist/index83.js +3 -13
- package/dist/index84.cjs +1 -1
- package/dist/index84.js +8 -6
- package/dist/index85.cjs +1 -1
- package/dist/index85.js +185 -72
- package/dist/index86.cjs +1 -1
- package/dist/index86.js +18 -14
- package/dist/index87.cjs +1 -1
- package/dist/index87.js +39 -17
- package/dist/index88.cjs +1 -1
- package/dist/index88.js +34 -191
- package/dist/index89.cjs +1 -1
- package/dist/index89.js +66 -61
- package/dist/index9.cjs +1 -1
- package/dist/index9.js +49 -41
- package/dist/index90.cjs +1 -1
- package/dist/index90.js +113 -2
- package/dist/index91.cjs +1 -1
- package/dist/index91.js +66 -5
- package/dist/index92.cjs +1 -1
- package/dist/index92.js +2 -12
- package/dist/index93.cjs +1 -5
- package/dist/index93.js +15 -55
- package/dist/index94.cjs +1 -2
- package/dist/index94.js +220 -31
- package/dist/index95.cjs +1 -1
- package/dist/index95.js +231 -5
- package/dist/index96.cjs +1 -1
- package/dist/index96.js +42 -3
- package/dist/index97.cjs +1 -1
- package/dist/index97.js +104 -6
- package/dist/index98.cjs +1 -1
- package/dist/index98.js +16 -31
- package/dist/index99.cjs +1 -1
- package/dist/index99.js +75 -24
- package/dist/src/lib/utils.d.ts +1 -1
- package/package.json +1 -1
package/dist/index70.js
CHANGED
|
@@ -1,70 +1,8 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
function
|
|
4
|
-
|
|
5
|
-
return o.setBigUint64(t, s, i);
|
|
6
|
-
const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), u = i ? 4 : 0, c = i ? 0 : 4;
|
|
7
|
-
o.setUint32(t + u, e, i), o.setUint32(t + c, r, i);
|
|
8
|
-
}
|
|
9
|
-
function B(o, t, s) {
|
|
10
|
-
return o & t ^ ~o & s;
|
|
11
|
-
}
|
|
12
|
-
function L(o, t, s) {
|
|
13
|
-
return o & t ^ o & s ^ t & s;
|
|
14
|
-
}
|
|
15
|
-
class U extends b {
|
|
16
|
-
constructor(t, s, i, n) {
|
|
17
|
-
super(), this.blockLen = t, this.outputLen = s, this.padOffset = i, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = p(this.buffer);
|
|
18
|
-
}
|
|
19
|
-
update(t) {
|
|
20
|
-
g(this);
|
|
21
|
-
const { view: s, buffer: i, blockLen: n } = this;
|
|
22
|
-
t = a(t);
|
|
23
|
-
const h = t.length;
|
|
24
|
-
for (let e = 0; e < h; ) {
|
|
25
|
-
const r = Math.min(n - this.pos, h - e);
|
|
26
|
-
if (r === n) {
|
|
27
|
-
const u = p(t);
|
|
28
|
-
for (; n <= h - e; e += n)
|
|
29
|
-
this.process(u, e);
|
|
30
|
-
continue;
|
|
31
|
-
}
|
|
32
|
-
i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
|
|
33
|
-
}
|
|
34
|
-
return this.length += t.length, this.roundClean(), this;
|
|
35
|
-
}
|
|
36
|
-
digestInto(t) {
|
|
37
|
-
g(this), d(t, this), this.finished = !0;
|
|
38
|
-
const { buffer: s, view: i, blockLen: n, isLE: h } = this;
|
|
39
|
-
let { pos: e } = this;
|
|
40
|
-
s[e++] = 128, this.buffer.subarray(e).fill(0), this.padOffset > n - e && (this.process(i, 0), e = 0);
|
|
41
|
-
for (let f = e; f < n; f++)
|
|
42
|
-
s[f] = 0;
|
|
43
|
-
w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
|
|
44
|
-
const r = p(t), u = this.outputLen;
|
|
45
|
-
if (u % 4)
|
|
46
|
-
throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
47
|
-
const c = u / 4, l = this.get();
|
|
48
|
-
if (c > l.length)
|
|
49
|
-
throw new Error("_sha2: outputLen bigger than state");
|
|
50
|
-
for (let f = 0; f < c; f++)
|
|
51
|
-
r.setUint32(4 * f, l[f], h);
|
|
52
|
-
}
|
|
53
|
-
digest() {
|
|
54
|
-
const { buffer: t, outputLen: s } = this;
|
|
55
|
-
this.digestInto(t);
|
|
56
|
-
const i = t.slice(0, s);
|
|
57
|
-
return this.destroy(), i;
|
|
58
|
-
}
|
|
59
|
-
_cloneInto(t) {
|
|
60
|
-
t || (t = new this.constructor()), t.set(...this.get());
|
|
61
|
-
const { blockLen: s, buffer: i, length: n, finished: h, destroyed: e, pos: r } = this;
|
|
62
|
-
return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
|
|
63
|
-
}
|
|
1
|
+
import { gweiUnits as i } from "./index106.js";
|
|
2
|
+
import { formatUnits as o } from "./index107.js";
|
|
3
|
+
function f(r, t = "wei") {
|
|
4
|
+
return o(r, i[t]);
|
|
64
5
|
}
|
|
65
6
|
export {
|
|
66
|
-
|
|
67
|
-
U as HashMD,
|
|
68
|
-
L as Maj,
|
|
69
|
-
w as setBigUint64
|
|
7
|
+
f as formatGwei
|
|
70
8
|
};
|
package/dist/index71.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});async function i(e){return new Promise(t=>setTimeout(t,e))}exports.wait=i;
|
package/dist/index71.js
CHANGED
package/dist/index72.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"})
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class i extends Map{constructor(e){super(),Object.defineProperty(this,"maxSize",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),this.maxSize=e}get(e){const t=super.get(e);return super.has(e)&&t!==void 0&&(this.delete(e),super.set(e,t)),t}set(e,t){if(super.set(e,t),this.maxSize&&this.size>this.maxSize){const s=this.keys().next().value;s&&this.delete(s)}return this}}exports.LruMap=i;
|
package/dist/index72.js
CHANGED
|
@@ -1,234 +1,24 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
}
|
|
10
|
-
function O(t, n) {
|
|
11
|
-
if (typeof n != "boolean")
|
|
12
|
-
throw new Error(t + " boolean expected, got " + n);
|
|
13
|
-
}
|
|
14
|
-
const T = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
|
|
15
|
-
function B(t) {
|
|
16
|
-
b(t);
|
|
17
|
-
let n = "";
|
|
18
|
-
for (let r = 0; r < t.length; r++)
|
|
19
|
-
n += T[t[r]];
|
|
20
|
-
return n;
|
|
21
|
-
}
|
|
22
|
-
function S(t) {
|
|
23
|
-
const n = t.toString(16);
|
|
24
|
-
return n.length & 1 ? "0" + n : n;
|
|
25
|
-
}
|
|
26
|
-
function U(t) {
|
|
27
|
-
if (typeof t != "string")
|
|
28
|
-
throw new Error("hex string expected, got " + typeof t);
|
|
29
|
-
return t === "" ? d : BigInt("0x" + t);
|
|
30
|
-
}
|
|
31
|
-
const s = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
32
|
-
function E(t) {
|
|
33
|
-
if (t >= s._0 && t <= s._9)
|
|
34
|
-
return t - s._0;
|
|
35
|
-
if (t >= s.A && t <= s.F)
|
|
36
|
-
return t - (s.A - 10);
|
|
37
|
-
if (t >= s.a && t <= s.f)
|
|
38
|
-
return t - (s.a - 10);
|
|
39
|
-
}
|
|
40
|
-
function m(t) {
|
|
41
|
-
if (typeof t != "string")
|
|
42
|
-
throw new Error("hex string expected, got " + typeof t);
|
|
43
|
-
const n = t.length, r = n / 2;
|
|
44
|
-
if (n % 2)
|
|
45
|
-
throw new Error("hex string expected, got unpadded hex of length " + n);
|
|
46
|
-
const e = new Uint8Array(r);
|
|
47
|
-
for (let o = 0, i = 0; o < r; o++, i += 2) {
|
|
48
|
-
const a = E(t.charCodeAt(i)), f = E(t.charCodeAt(i + 1));
|
|
49
|
-
if (a === void 0 || f === void 0) {
|
|
50
|
-
const c = t[i] + t[i + 1];
|
|
51
|
-
throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
|
|
52
|
-
}
|
|
53
|
-
e[o] = a * 16 + f;
|
|
54
|
-
}
|
|
55
|
-
return e;
|
|
56
|
-
}
|
|
57
|
-
function V(t) {
|
|
58
|
-
return U(B(t));
|
|
59
|
-
}
|
|
60
|
-
function H(t) {
|
|
61
|
-
return b(t), U(B(Uint8Array.from(t).reverse()));
|
|
62
|
-
}
|
|
63
|
-
function v(t, n) {
|
|
64
|
-
return m(t.toString(16).padStart(n * 2, "0"));
|
|
65
|
-
}
|
|
66
|
-
function C(t, n) {
|
|
67
|
-
return v(t, n).reverse();
|
|
68
|
-
}
|
|
69
|
-
function M(t) {
|
|
70
|
-
return m(S(t));
|
|
71
|
-
}
|
|
72
|
-
function R(t, n, r) {
|
|
73
|
-
let e;
|
|
74
|
-
if (typeof n == "string")
|
|
75
|
-
try {
|
|
76
|
-
e = m(n);
|
|
77
|
-
} catch (i) {
|
|
78
|
-
throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
|
|
79
|
-
}
|
|
80
|
-
else if (h(n))
|
|
81
|
-
e = Uint8Array.from(n);
|
|
82
|
-
else
|
|
83
|
-
throw new Error(t + " must be hex string or Uint8Array");
|
|
84
|
-
const o = e.length;
|
|
85
|
-
if (typeof r == "number" && o !== r)
|
|
86
|
-
throw new Error(t + " of length " + r + " expected, got " + o);
|
|
87
|
-
return e;
|
|
88
|
-
}
|
|
89
|
-
function _(...t) {
|
|
90
|
-
let n = 0;
|
|
91
|
-
for (let e = 0; e < t.length; e++) {
|
|
92
|
-
const o = t[e];
|
|
93
|
-
b(o), n += o.length;
|
|
1
|
+
class r extends Map {
|
|
2
|
+
constructor(e) {
|
|
3
|
+
super(), Object.defineProperty(this, "maxSize", {
|
|
4
|
+
enumerable: !0,
|
|
5
|
+
configurable: !0,
|
|
6
|
+
writable: !0,
|
|
7
|
+
value: void 0
|
|
8
|
+
}), this.maxSize = e;
|
|
94
9
|
}
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
r.set(i, o), o += i.length;
|
|
10
|
+
get(e) {
|
|
11
|
+
const t = super.get(e);
|
|
12
|
+
return super.has(e) && t !== void 0 && (this.delete(e), super.set(e, t)), t;
|
|
99
13
|
}
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
return !1;
|
|
105
|
-
let r = 0;
|
|
106
|
-
for (let e = 0; e < t.length; e++)
|
|
107
|
-
r |= t[e] ^ n[e];
|
|
108
|
-
return r === 0;
|
|
109
|
-
}
|
|
110
|
-
function z(t) {
|
|
111
|
-
if (typeof t != "string")
|
|
112
|
-
throw new Error("string expected");
|
|
113
|
-
return new Uint8Array(new TextEncoder().encode(t));
|
|
114
|
-
}
|
|
115
|
-
const w = (t) => typeof t == "bigint" && d <= t;
|
|
116
|
-
function N(t, n, r) {
|
|
117
|
-
return w(t) && w(n) && w(r) && n <= t && t < r;
|
|
118
|
-
}
|
|
119
|
-
function D(t, n, r, e) {
|
|
120
|
-
if (!N(n, r, e))
|
|
121
|
-
throw new Error("expected valid " + t + ": " + r + " <= n < " + e + ", got " + n);
|
|
122
|
-
}
|
|
123
|
-
function G(t) {
|
|
124
|
-
let n;
|
|
125
|
-
for (n = 0; t > d; t >>= y, n += 1)
|
|
126
|
-
;
|
|
127
|
-
return n;
|
|
128
|
-
}
|
|
129
|
-
function P(t, n) {
|
|
130
|
-
return t >> BigInt(n) & y;
|
|
131
|
-
}
|
|
132
|
-
function W(t, n, r) {
|
|
133
|
-
return t | (r ? y : d) << BigInt(n);
|
|
134
|
-
}
|
|
135
|
-
const q = (t) => (I << BigInt(t - 1)) - y, p = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
|
|
136
|
-
function J(t, n, r) {
|
|
137
|
-
if (typeof t != "number" || t < 2)
|
|
138
|
-
throw new Error("hashLen must be a number");
|
|
139
|
-
if (typeof n != "number" || n < 2)
|
|
140
|
-
throw new Error("qByteLen must be a number");
|
|
141
|
-
if (typeof r != "function")
|
|
142
|
-
throw new Error("hmacFn must be a function");
|
|
143
|
-
let e = p(t), o = p(t), i = 0;
|
|
144
|
-
const a = () => {
|
|
145
|
-
e.fill(1), o.fill(0), i = 0;
|
|
146
|
-
}, f = (...u) => r(o, e, ...u), c = (u = p()) => {
|
|
147
|
-
o = f(A([0]), u), e = f(), u.length !== 0 && (o = f(A([1]), u), e = f());
|
|
148
|
-
}, x = () => {
|
|
149
|
-
if (i++ >= 1e3)
|
|
150
|
-
throw new Error("drbg: tried 1000 values");
|
|
151
|
-
let u = 0;
|
|
152
|
-
const l = [];
|
|
153
|
-
for (; u < n; ) {
|
|
154
|
-
e = f();
|
|
155
|
-
const g = e.slice();
|
|
156
|
-
l.push(g), u += e.length;
|
|
14
|
+
set(e, t) {
|
|
15
|
+
if (super.set(e, t), this.maxSize && this.size > this.maxSize) {
|
|
16
|
+
const s = this.keys().next().value;
|
|
17
|
+
s && this.delete(s);
|
|
157
18
|
}
|
|
158
|
-
return
|
|
159
|
-
}
|
|
160
|
-
return (u, l) => {
|
|
161
|
-
a(), c(u);
|
|
162
|
-
let g;
|
|
163
|
-
for (; !(g = l(x())); )
|
|
164
|
-
c();
|
|
165
|
-
return a(), g;
|
|
166
|
-
};
|
|
167
|
-
}
|
|
168
|
-
const k = {
|
|
169
|
-
bigint: (t) => typeof t == "bigint",
|
|
170
|
-
function: (t) => typeof t == "function",
|
|
171
|
-
boolean: (t) => typeof t == "boolean",
|
|
172
|
-
string: (t) => typeof t == "string",
|
|
173
|
-
stringOrUint8Array: (t) => typeof t == "string" || h(t),
|
|
174
|
-
isSafeInteger: (t) => Number.isSafeInteger(t),
|
|
175
|
-
array: (t) => Array.isArray(t),
|
|
176
|
-
field: (t, n) => n.Fp.isValid(t),
|
|
177
|
-
hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
|
|
178
|
-
};
|
|
179
|
-
function K(t, n, r = {}) {
|
|
180
|
-
const e = (o, i, a) => {
|
|
181
|
-
const f = k[i];
|
|
182
|
-
if (typeof f != "function")
|
|
183
|
-
throw new Error("invalid validator function");
|
|
184
|
-
const c = t[o];
|
|
185
|
-
if (!(a && c === void 0) && !f(c, t))
|
|
186
|
-
throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
|
|
187
|
-
};
|
|
188
|
-
for (const [o, i] of Object.entries(n))
|
|
189
|
-
e(o, i, !1);
|
|
190
|
-
for (const [o, i] of Object.entries(r))
|
|
191
|
-
e(o, i, !0);
|
|
192
|
-
return t;
|
|
193
|
-
}
|
|
194
|
-
const Q = () => {
|
|
195
|
-
throw new Error("not implemented");
|
|
196
|
-
};
|
|
197
|
-
function X(t) {
|
|
198
|
-
const n = /* @__PURE__ */ new WeakMap();
|
|
199
|
-
return (r, ...e) => {
|
|
200
|
-
const o = n.get(r);
|
|
201
|
-
if (o !== void 0)
|
|
202
|
-
return o;
|
|
203
|
-
const i = t(r, ...e);
|
|
204
|
-
return n.set(r, i), i;
|
|
205
|
-
};
|
|
19
|
+
return this;
|
|
20
|
+
}
|
|
206
21
|
}
|
|
207
22
|
export {
|
|
208
|
-
|
|
209
|
-
O as abool,
|
|
210
|
-
b as abytes,
|
|
211
|
-
P as bitGet,
|
|
212
|
-
G as bitLen,
|
|
213
|
-
q as bitMask,
|
|
214
|
-
W as bitSet,
|
|
215
|
-
B as bytesToHex,
|
|
216
|
-
V as bytesToNumberBE,
|
|
217
|
-
H as bytesToNumberLE,
|
|
218
|
-
_ as concatBytes,
|
|
219
|
-
J as createHmacDrbg,
|
|
220
|
-
R as ensureBytes,
|
|
221
|
-
j as equalBytes,
|
|
222
|
-
m as hexToBytes,
|
|
223
|
-
U as hexToNumber,
|
|
224
|
-
N as inRange,
|
|
225
|
-
h as isBytes,
|
|
226
|
-
X as memoized,
|
|
227
|
-
Q as notImplemented,
|
|
228
|
-
v as numberToBytesBE,
|
|
229
|
-
C as numberToBytesLE,
|
|
230
|
-
S as numberToHexUnpadded,
|
|
231
|
-
M as numberToVarBytesBE,
|
|
232
|
-
z as utf8ToBytes,
|
|
233
|
-
K as validateObject
|
|
23
|
+
r as LruMap
|
|
234
24
|
};
|
package/dist/index73.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index53.cjs"),l=require("./index25.cjs");function c(o){const{kzg:s}=o,n=o.to??(typeof o.blobs[0]=="string"?"hex":"bytes"),e=typeof o.blobs[0]=="string"?o.blobs.map(t=>i.hexToBytes(t)):o.blobs,b=[];for(const t of e)b.push(Uint8Array.from(s.blobToKzgCommitment(t)));return n==="bytes"?b:b.map(t=>l.bytesToHex(t))}exports.blobsToCommitments=c;
|
package/dist/index73.js
CHANGED
|
@@ -1,21 +1,11 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
const r = new Uint8Array(n);
|
|
9
|
-
let o = 0;
|
|
10
|
-
for (const e of t)
|
|
11
|
-
r.set(e, o), o += e.length;
|
|
12
|
-
return r;
|
|
13
|
-
}
|
|
14
|
-
function f(t) {
|
|
15
|
-
return `0x${t.reduce((n, r) => n + r.replace("0x", ""), "")}`;
|
|
1
|
+
import { hexToBytes as i } from "./index53.js";
|
|
2
|
+
import { bytesToHex as f } from "./index25.js";
|
|
3
|
+
function y(o) {
|
|
4
|
+
const { kzg: s } = o, n = o.to ?? (typeof o.blobs[0] == "string" ? "hex" : "bytes"), m = typeof o.blobs[0] == "string" ? o.blobs.map((t) => i(t)) : o.blobs, b = [];
|
|
5
|
+
for (const t of m)
|
|
6
|
+
b.push(Uint8Array.from(s.blobToKzgCommitment(t)));
|
|
7
|
+
return n === "bytes" ? b : b.map((t) => f(t));
|
|
16
8
|
}
|
|
17
9
|
export {
|
|
18
|
-
|
|
19
|
-
c as concatBytes,
|
|
20
|
-
f as concatHex
|
|
10
|
+
y as blobsToCommitments
|
|
21
11
|
};
|
package/dist/index74.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./index53.cjs"),y=require("./index25.cjs");function f(t){const{kzg:c}=t,e=t.to??(typeof t.blobs[0]=="string"?"hex":"bytes"),n=typeof t.blobs[0]=="string"?t.blobs.map(o=>b.hexToBytes(o)):t.blobs,i=typeof t.commitments[0]=="string"?t.commitments.map(o=>b.hexToBytes(o)):t.commitments,s=[];for(let o=0;o<n.length;o++){const l=n[o],m=i[o];s.push(Uint8Array.from(c.computeBlobKzgProof(l,m)))}return e==="bytes"?s:s.map(o=>y.bytesToHex(o))}exports.blobsToProofs=f;
|
package/dist/index74.js
CHANGED
|
@@ -1,45 +1,13 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
}
|
|
9
|
-
|
|
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.");
|
|
1
|
+
import { hexToBytes as b } from "./index53.js";
|
|
2
|
+
import { bytesToHex as y } from "./index25.js";
|
|
3
|
+
function h(t) {
|
|
4
|
+
const { kzg: m } = t, c = t.to ?? (typeof t.blobs[0] == "string" ? "hex" : "bytes"), s = typeof t.blobs[0] == "string" ? t.blobs.map((o) => b(o)) : t.blobs, i = typeof t.commitments[0] == "string" ? t.commitments.map((o) => b(o)) : t.commitments, n = [];
|
|
5
|
+
for (let o = 0; o < s.length; o++) {
|
|
6
|
+
const f = s[o], l = i[o];
|
|
7
|
+
n.push(Uint8Array.from(m.computeBlobKzgProof(f, l)));
|
|
8
|
+
}
|
|
9
|
+
return c === "bytes" ? n : n.map((o) => y(o));
|
|
42
10
|
}
|
|
43
11
|
export {
|
|
44
|
-
|
|
12
|
+
h as blobsToProofs
|
|
45
13
|
};
|
package/dist/index75.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 i=require("./index76.cjs");function c(o){const{commitments:e,version:s}=o,n=o.to??(typeof e[0]=="string"?"hex":"bytes"),t=[];for(const m of e)t.push(i.commitmentToVersionedHash({commitment:m,to:n,version:s}));return t}exports.commitmentsToVersionedHashes=c;
|
package/dist/index75.js
CHANGED
|
@@ -1,7 +1,14 @@
|
|
|
1
|
-
import {
|
|
2
|
-
function
|
|
3
|
-
|
|
1
|
+
import { commitmentToVersionedHash as i } from "./index76.js";
|
|
2
|
+
function r(o) {
|
|
3
|
+
const { commitments: t, version: n } = o, e = o.to ?? (typeof t[0] == "string" ? "hex" : "bytes"), s = [];
|
|
4
|
+
for (const m of t)
|
|
5
|
+
s.push(i({
|
|
6
|
+
commitment: m,
|
|
7
|
+
to: e,
|
|
8
|
+
version: n
|
|
9
|
+
}));
|
|
10
|
+
return s;
|
|
4
11
|
}
|
|
5
12
|
export {
|
|
6
|
-
|
|
13
|
+
r as commitmentsToVersionedHashes
|
|
7
14
|
};
|
package/dist/index76.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index25.cjs"),r=require("./index110.cjs");function c(t){const{commitment:o,version:s=1}=t,n=t.to??(typeof o=="string"?"hex":"bytes"),e=r.sha256(o);return e.set([s],0),n==="bytes"?e:i.bytesToHex(e)}exports.commitmentToVersionedHash=c;
|
package/dist/index76.js
CHANGED
|
@@ -1,6 +1,9 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
1
|
+
import { bytesToHex as i } from "./index25.js";
|
|
2
|
+
import { sha256 as m } from "./index110.js";
|
|
3
|
+
function f(t) {
|
|
4
|
+
const { commitment: e, version: s = 1 } = t, n = t.to ?? (typeof e == "string" ? "hex" : "bytes"), o = m(e);
|
|
5
|
+
return o.set([s], 0), n === "bytes" ? o : i(o);
|
|
3
6
|
}
|
|
4
7
|
export {
|
|
5
|
-
|
|
8
|
+
f as commitmentToVersionedHash
|
|
6
9
|
};
|
package/dist/index77.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index73.cjs"),m=require("./index74.cjs"),u=require("./index78.cjs");function f(t){const{data:i,kzg:n,to:b}=t,s=t.blobs??u.toBlobs({data:i,to:b}),e=t.commitments??r.blobsToCommitments({blobs:s,kzg:n,to:b}),l=t.proofs??m.blobsToProofs({blobs:s,commitments:e,kzg:n,to:b}),c=[];for(let o=0;o<s.length;o++)c.push({blob:s[o],commitment:e[o],proof:l[o]});return c}exports.toBlobSidecars=f;
|
package/dist/index77.js
CHANGED
|
@@ -1,11 +1,16 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
import {
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
1
|
+
import { blobsToCommitments as f } from "./index73.js";
|
|
2
|
+
import { blobsToProofs as l } from "./index74.js";
|
|
3
|
+
import { toBlobs as p } from "./index78.js";
|
|
4
|
+
function k(t) {
|
|
5
|
+
const { data: i, kzg: n, to: m } = t, s = t.blobs ?? p({ data: i, to: m }), b = t.commitments ?? f({ blobs: s, kzg: n, to: m }), r = t.proofs ?? l({ blobs: s, commitments: b, kzg: n, to: m }), c = [];
|
|
6
|
+
for (let o = 0; o < s.length; o++)
|
|
7
|
+
c.push({
|
|
8
|
+
blob: s[o],
|
|
9
|
+
commitment: b[o],
|
|
10
|
+
proof: r[o]
|
|
11
|
+
});
|
|
12
|
+
return c;
|
|
8
13
|
}
|
|
9
14
|
export {
|
|
10
|
-
|
|
15
|
+
k as toBlobSidecars
|
|
11
16
|
};
|
package/dist/index78.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 o=require("./index114.cjs"),y=require("./index112.cjs"),u=require("./index109.cjs"),B=require("./index66.cjs"),h=require("./index53.cjs"),d=require("./index25.cjs");function f(t){const a=t.to??(typeof t.data=="string"?"hex":"bytes"),n=typeof t.data=="string"?h.hexToBytes(t.data):t.data,s=B.size(n);if(!s)throw new y.EmptyBlobError;if(s>o.maxBytesPerTransaction)throw new y.BlobSizeTooLargeError({maxSize:o.maxBytesPerTransaction,size:s});const r=[];let b=!0,i=0;for(;b;){const e=u.createCursor(new Uint8Array(o.bytesPerBlob));let l=0;for(;l<o.fieldElementsPerBlob;){const c=n.slice(i,i+(o.bytesPerFieldElement-1));if(e.pushByte(0),e.pushBytes(c),c.length<31){e.pushByte(128),b=!1;break}l++,i+=31}r.push(e)}return a==="bytes"?r.map(e=>e.bytes):r.map(e=>d.bytesToHex(e.bytes))}exports.toBlobs=f;
|