@gardenfi/orderbook 0.2.0-beta.18 → 0.2.0-beta.19
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/index.cjs +1 -1
- package/dist/index.js +12 -13
- package/dist/index3.cjs +1 -1
- package/dist/index3.js +9 -24
- package/dist/index4.cjs +1 -1
- package/dist/index4.js +1 -1
- package/dist/index7.cjs +1 -1
- package/dist/index7.js +7 -32
- package/dist/src/index.d.ts +1 -1
- package/dist/src/lib/asset.d.ts +0 -3
- package/package.json +1 -1
- package/dist/index10.cjs +0 -1
- package/dist/index10.js +0 -32
- package/dist/index11.cjs +0 -1
- package/dist/index11.js +0 -55
- package/dist/index12.cjs +0 -1
- package/dist/index12.js +0 -9
- package/dist/index13.cjs +0 -1
- package/dist/index13.js +0 -11
- package/dist/index14.cjs +0 -1
- package/dist/index14.js +0 -11
- package/dist/index15.cjs +0 -1
- package/dist/index15.js +0 -15
- package/dist/index16.cjs +0 -1
- package/dist/index16.js +0 -39
- package/dist/index17.cjs +0 -1
- package/dist/index17.js +0 -44
- package/dist/index18.cjs +0 -1
- package/dist/index18.js +0 -26
- package/dist/index19.cjs +0 -1
- package/dist/index19.js +0 -28
- package/dist/index20.cjs +0 -1
- package/dist/index20.js +0 -57
- package/dist/index21.cjs +0 -1
- package/dist/index21.js +0 -30
- package/dist/index22.cjs +0 -1
- package/dist/index22.js +0 -15
- package/dist/index23.cjs +0 -1
- package/dist/index23.js +0 -14
- package/dist/index24.cjs +0 -1
- package/dist/index24.js +0 -6
- package/dist/index25.cjs +0 -1
- package/dist/index25.js +0 -48
- package/dist/index26.cjs +0 -1
- package/dist/index26.js +0 -45
- package/dist/index27.cjs +0 -1
- package/dist/index27.js +0 -174
- package/dist/index28.cjs +0 -1
- package/dist/index28.js +0 -15
- package/dist/index29.cjs +0 -1
- package/dist/index29.js +0 -7
- package/dist/index30.cjs +0 -1
- package/dist/index30.js +0 -19
- package/dist/index31.cjs +0 -1
- package/dist/index31.js +0 -14
- package/dist/index32.cjs +0 -1
- package/dist/index32.js +0 -37
- package/dist/index33.cjs +0 -2
- package/dist/index33.js +0 -62
- package/dist/index34.cjs +0 -1
- package/dist/index34.js +0 -130
- package/dist/index35.cjs +0 -1
- package/dist/index35.js +0 -58
- package/dist/index36.cjs +0 -2
- package/dist/index36.js +0 -45
- package/dist/index37.cjs +0 -1
- package/dist/index37.js +0 -11
- package/dist/index38.cjs +0 -1
- package/dist/index38.js +0 -13
- package/dist/index39.cjs +0 -1
- package/dist/index39.js +0 -14
- package/dist/index40.cjs +0 -1
- package/dist/index40.js +0 -16
- package/dist/index41.cjs +0 -1
- package/dist/index41.js +0 -9
- package/dist/index42.cjs +0 -1
- package/dist/index42.js +0 -20
- package/dist/index43.cjs +0 -1
- package/dist/index43.js +0 -81
- package/dist/index44.cjs +0 -1
- package/dist/index44.js +0 -17
- package/dist/index45.cjs +0 -1
- package/dist/index45.js +0 -21
- package/dist/index46.cjs +0 -1
- package/dist/index46.js +0 -6
- package/dist/index47.cjs +0 -1
- package/dist/index47.js +0 -24
- package/dist/index48.cjs +0 -1
- package/dist/index48.js +0 -16
- package/dist/index49.cjs +0 -1
- package/dist/index49.js +0 -9
- package/dist/index50.cjs +0 -1
- package/dist/index50.js +0 -4
- package/dist/index51.cjs +0 -1
- package/dist/index51.js +0 -4
- package/dist/index52.cjs +0 -2
- package/dist/index52.js +0 -37
- package/dist/index53.cjs +0 -1
- package/dist/index53.js +0 -8
- package/dist/index54.cjs +0 -1
- package/dist/index54.js +0 -15
- package/dist/index55.cjs +0 -1
- package/dist/index55.js +0 -23
- package/dist/index56.cjs +0 -1
- package/dist/index56.js +0 -9
- package/dist/index57.cjs +0 -1
- package/dist/index57.js +0 -35
- package/dist/index58.cjs +0 -1
- package/dist/index58.js +0 -4
- package/dist/index59.cjs +0 -1
- package/dist/index59.js +0 -40
- package/dist/index60.cjs +0 -1
- package/dist/index60.js +0 -31
- package/dist/index61.cjs +0 -1
- package/dist/index61.js +0 -9
- package/dist/index62.cjs +0 -1
- package/dist/index62.js +0 -115
- package/dist/index63.cjs +0 -1
- package/dist/index63.js +0 -9
- package/dist/index64.cjs +0 -1
- package/dist/index64.js +0 -7
- package/dist/index65.cjs +0 -1
- package/dist/index65.js +0 -13
- package/dist/index66.cjs +0 -1
- package/dist/index66.js +0 -7
- package/dist/index67.cjs +0 -1
- package/dist/index67.js +0 -64
- package/dist/index68.cjs +0 -1
- package/dist/index68.js +0 -37
- package/dist/index69.cjs +0 -1
- package/dist/index69.js +0 -107
- package/dist/index70.cjs +0 -1
- package/dist/index70.js +0 -32
- package/dist/index71.cjs +0 -1
- package/dist/index71.js +0 -21
- package/dist/index8.cjs +0 -1
- package/dist/index8.js +0 -27
- package/dist/index9.cjs +0 -1
- package/dist/index9.js +0 -33
package/dist/index59.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index58.cjs"),s=require("./index33.cjs");class i extends s.BaseError{constructor({maxSize:e,size:r}){super("Blob size is too large.",{metaMessages:[`Max: ${e} bytes`,`Given: ${r} bytes`],name:"BlobSizeTooLargeError"})}}class n extends s.BaseError{constructor(){super("Blob data must not be empty.",{name:"EmptyBlobError"})}}class t extends s.BaseError{constructor({hash:e,size:r}){super(`Versioned hash "${e}" size is invalid.`,{metaMessages:["Expected: 32",`Received: ${r}`],name:"InvalidVersionedHashSizeError"})}}class d extends s.BaseError{constructor({hash:e,version:r}){super(`Versioned hash "${e}" version is invalid.`,{metaMessages:[`Expected: ${a.versionedHashVersionKzg}`,`Received: ${r}`],name:"InvalidVersionedHashVersionError"})}}exports.BlobSizeTooLargeError=i;exports.EmptyBlobError=n;exports.InvalidVersionedHashSizeError=t;exports.InvalidVersionedHashVersionError=d;
|
package/dist/index59.js
DELETED
|
@@ -1,40 +0,0 @@
|
|
|
1
|
-
import { versionedHashVersionKzg as a } from "./index58.js";
|
|
2
|
-
import { BaseError as s } from "./index33.js";
|
|
3
|
-
class t extends s {
|
|
4
|
-
constructor({ maxSize: e, size: r }) {
|
|
5
|
-
super("Blob size is too large.", {
|
|
6
|
-
metaMessages: [`Max: ${e} bytes`, `Given: ${r} bytes`],
|
|
7
|
-
name: "BlobSizeTooLargeError"
|
|
8
|
-
});
|
|
9
|
-
}
|
|
10
|
-
}
|
|
11
|
-
class d extends s {
|
|
12
|
-
constructor() {
|
|
13
|
-
super("Blob data must not be empty.", { name: "EmptyBlobError" });
|
|
14
|
-
}
|
|
15
|
-
}
|
|
16
|
-
class l extends s {
|
|
17
|
-
constructor({ hash: e, size: r }) {
|
|
18
|
-
super(`Versioned hash "${e}" size is invalid.`, {
|
|
19
|
-
metaMessages: ["Expected: 32", `Received: ${r}`],
|
|
20
|
-
name: "InvalidVersionedHashSizeError"
|
|
21
|
-
});
|
|
22
|
-
}
|
|
23
|
-
}
|
|
24
|
-
class c extends s {
|
|
25
|
-
constructor({ hash: e, version: r }) {
|
|
26
|
-
super(`Versioned hash "${e}" version is invalid.`, {
|
|
27
|
-
metaMessages: [
|
|
28
|
-
`Expected: ${a}`,
|
|
29
|
-
`Received: ${r}`
|
|
30
|
-
],
|
|
31
|
-
name: "InvalidVersionedHashVersionError"
|
|
32
|
-
});
|
|
33
|
-
}
|
|
34
|
-
}
|
|
35
|
-
export {
|
|
36
|
-
t as BlobSizeTooLargeError,
|
|
37
|
-
d as EmptyBlobError,
|
|
38
|
-
l as InvalidVersionedHashSizeError,
|
|
39
|
-
c as InvalidVersionedHashVersionError
|
|
40
|
-
};
|
package/dist/index60.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index54.cjs"),l=require("./index46.cjs"),r=require("./index29.cjs");function x(i,s,e,{strict:t}={}){return l.isHex(i,{strict:!1})?f(i,s,e,{strict:t}):o(i,s,e,{strict:t})}function n(i,s,e){if(r.size(i)!==e-s)throw new u.SliceOffsetOutOfBoundsError({offset:e,position:"end",size:r.size(i)})}function o(i,s,e,{strict:t}={}){const c=i.slice(s,e);return t&&n(c,s,e),c}function f(i,s,e,{strict:t}={}){const c=`0x${i.replace("0x","").slice(s*2,e*2)}`;return t&&n(c,s,e),c}exports.slice=x;exports.sliceBytes=o;exports.sliceHex=f;
|
package/dist/index60.js
DELETED
|
@@ -1,31 +0,0 @@
|
|
|
1
|
-
import { SliceOffsetOutOfBoundsError as n } from "./index54.js";
|
|
2
|
-
import { isHex as c } from "./index46.js";
|
|
3
|
-
import { size as s } from "./index29.js";
|
|
4
|
-
function O(e, f, i, { strict: o } = {}) {
|
|
5
|
-
return c(e, { strict: !1 }) ? l(e, f, i, {
|
|
6
|
-
strict: o
|
|
7
|
-
}) : u(e, f, i, {
|
|
8
|
-
strict: o
|
|
9
|
-
});
|
|
10
|
-
}
|
|
11
|
-
function t(e, f, i) {
|
|
12
|
-
if (s(e) !== i - f)
|
|
13
|
-
throw new n({
|
|
14
|
-
offset: i,
|
|
15
|
-
position: "end",
|
|
16
|
-
size: s(e)
|
|
17
|
-
});
|
|
18
|
-
}
|
|
19
|
-
function u(e, f, i, { strict: o } = {}) {
|
|
20
|
-
const r = e.slice(f, i);
|
|
21
|
-
return o && t(r, f, i), r;
|
|
22
|
-
}
|
|
23
|
-
function l(e, f, i, { strict: o } = {}) {
|
|
24
|
-
const r = `0x${e.replace("0x", "").slice(f * 2, i * 2)}`;
|
|
25
|
-
return o && t(r, f, i), r;
|
|
26
|
-
}
|
|
27
|
-
export {
|
|
28
|
-
O as slice,
|
|
29
|
-
u as sliceBytes,
|
|
30
|
-
l as sliceHex
|
|
31
|
-
};
|
package/dist/index61.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index62.cjs"),s=require("./index46.cjs"),r=require("./index35.cjs");function o(t,i){return e.sha256(s.isHex(t,{strict:!1})?r.toBytes(t):t)}exports.sha256=o;
|
package/dist/index61.js
DELETED
package/dist/index62.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index67.cjs"),s=require("./index68.cjs"),S=new Uint32Array([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),b=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),f=new Uint32Array(64);class g extends H.HashMD{constructor(){super(64,32,8,!1),this.A=b[0]|0,this.B=b[1]|0,this.C=b[2]|0,this.D=b[3]|0,this.E=b[4]|0,this.F=b[5]|0,this.G=b[6]|0,this.H=b[7]|0}get(){const{A:d,B:o,C:x,D:e,E:a,F:i,G:c,H:r}=this;return[d,o,x,e,a,i,c,r]}set(d,o,x,e,a,i,c,r){this.A=d|0,this.B=o|0,this.C=x|0,this.D=e|0,this.E=a|0,this.F=i|0,this.G=c|0,this.H=r|0}process(d,o){for(let t=0;t<16;t++,o+=4)f[t]=d.getUint32(o,!1);for(let t=16;t<64;t++){const A=f[t-15],n=f[t-2],C=s.rotr(A,7)^s.rotr(A,18)^A>>>3,u=s.rotr(n,17)^s.rotr(n,19)^n>>>10;f[t]=u+f[t-7]+C+f[t-16]|0}let{A:x,B:e,C:a,D:i,E:c,F:r,G:h,H:l}=this;for(let t=0;t<64;t++){const A=s.rotr(c,6)^s.rotr(c,11)^s.rotr(c,25),n=l+A+H.Chi(c,r,h)+S[t]+f[t]|0,u=(s.rotr(x,2)^s.rotr(x,13)^s.rotr(x,22))+H.Maj(x,e,a)|0;l=h,h=r,r=c,c=i+n|0,i=a,a=e,e=x,x=n+u|0}x=x+this.A|0,e=e+this.B|0,a=a+this.C|0,i=i+this.D|0,c=c+this.E|0,r=r+this.F|0,h=h+this.G|0,l=l+this.H|0,this.set(x,e,a,i,c,r,h,l)}roundClean(){f.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const y=s.wrapConstructor(()=>new g);exports.SHA256=g;exports.sha256=y;
|
package/dist/index62.js
DELETED
|
@@ -1,115 +0,0 @@
|
|
|
1
|
-
import { HashMD as m, Chi as p, Maj as u } from "./index67.js";
|
|
2
|
-
import { wrapConstructor as D, rotr as i } from "./index68.js";
|
|
3
|
-
const g = /* @__PURE__ */ new Uint32Array([
|
|
4
|
-
1116352408,
|
|
5
|
-
1899447441,
|
|
6
|
-
3049323471,
|
|
7
|
-
3921009573,
|
|
8
|
-
961987163,
|
|
9
|
-
1508970993,
|
|
10
|
-
2453635748,
|
|
11
|
-
2870763221,
|
|
12
|
-
3624381080,
|
|
13
|
-
310598401,
|
|
14
|
-
607225278,
|
|
15
|
-
1426881987,
|
|
16
|
-
1925078388,
|
|
17
|
-
2162078206,
|
|
18
|
-
2614888103,
|
|
19
|
-
3248222580,
|
|
20
|
-
3835390401,
|
|
21
|
-
4022224774,
|
|
22
|
-
264347078,
|
|
23
|
-
604807628,
|
|
24
|
-
770255983,
|
|
25
|
-
1249150122,
|
|
26
|
-
1555081692,
|
|
27
|
-
1996064986,
|
|
28
|
-
2554220882,
|
|
29
|
-
2821834349,
|
|
30
|
-
2952996808,
|
|
31
|
-
3210313671,
|
|
32
|
-
3336571891,
|
|
33
|
-
3584528711,
|
|
34
|
-
113926993,
|
|
35
|
-
338241895,
|
|
36
|
-
666307205,
|
|
37
|
-
773529912,
|
|
38
|
-
1294757372,
|
|
39
|
-
1396182291,
|
|
40
|
-
1695183700,
|
|
41
|
-
1986661051,
|
|
42
|
-
2177026350,
|
|
43
|
-
2456956037,
|
|
44
|
-
2730485921,
|
|
45
|
-
2820302411,
|
|
46
|
-
3259730800,
|
|
47
|
-
3345764771,
|
|
48
|
-
3516065817,
|
|
49
|
-
3600352804,
|
|
50
|
-
4094571909,
|
|
51
|
-
275423344,
|
|
52
|
-
430227734,
|
|
53
|
-
506948616,
|
|
54
|
-
659060556,
|
|
55
|
-
883997877,
|
|
56
|
-
958139571,
|
|
57
|
-
1322822218,
|
|
58
|
-
1537002063,
|
|
59
|
-
1747873779,
|
|
60
|
-
1955562222,
|
|
61
|
-
2024104815,
|
|
62
|
-
2227730452,
|
|
63
|
-
2361852424,
|
|
64
|
-
2428436474,
|
|
65
|
-
2756734187,
|
|
66
|
-
3204031479,
|
|
67
|
-
3329325298
|
|
68
|
-
]), b = /* @__PURE__ */ new Uint32Array([
|
|
69
|
-
1779033703,
|
|
70
|
-
3144134277,
|
|
71
|
-
1013904242,
|
|
72
|
-
2773480762,
|
|
73
|
-
1359893119,
|
|
74
|
-
2600822924,
|
|
75
|
-
528734635,
|
|
76
|
-
1541459225
|
|
77
|
-
]), h = /* @__PURE__ */ new Uint32Array(64);
|
|
78
|
-
class w extends m {
|
|
79
|
-
constructor() {
|
|
80
|
-
super(64, 32, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
|
|
81
|
-
}
|
|
82
|
-
get() {
|
|
83
|
-
const { A: d, B: o, C: t, D: s, E: a, F: f, G: c, H: e } = this;
|
|
84
|
-
return [d, o, t, s, a, f, c, e];
|
|
85
|
-
}
|
|
86
|
-
// prettier-ignore
|
|
87
|
-
set(d, o, t, s, a, f, c, e) {
|
|
88
|
-
this.A = d | 0, this.B = o | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
|
|
89
|
-
}
|
|
90
|
-
process(d, o) {
|
|
91
|
-
for (let x = 0; x < 16; x++, o += 4)
|
|
92
|
-
h[x] = d.getUint32(o, !1);
|
|
93
|
-
for (let x = 16; x < 64; x++) {
|
|
94
|
-
const A = h[x - 15], n = h[x - 2], C = i(A, 7) ^ i(A, 18) ^ A >>> 3, H = i(n, 17) ^ i(n, 19) ^ n >>> 10;
|
|
95
|
-
h[x] = H + h[x - 7] + C + h[x - 16] | 0;
|
|
96
|
-
}
|
|
97
|
-
let { A: t, B: s, C: a, D: f, E: c, F: e, G: r, H: l } = this;
|
|
98
|
-
for (let x = 0; x < 64; x++) {
|
|
99
|
-
const A = i(c, 6) ^ i(c, 11) ^ i(c, 25), n = l + A + p(c, e, r) + g[x] + h[x] | 0, H = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + u(t, s, a) | 0;
|
|
100
|
-
l = r, r = e, e = c, c = f + n | 0, f = a, a = s, s = t, t = n + H | 0;
|
|
101
|
-
}
|
|
102
|
-
t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, r = r + this.G | 0, l = l + this.H | 0, this.set(t, s, a, f, c, e, r, l);
|
|
103
|
-
}
|
|
104
|
-
roundClean() {
|
|
105
|
-
h.fill(0);
|
|
106
|
-
}
|
|
107
|
-
destroy() {
|
|
108
|
-
this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
|
|
109
|
-
}
|
|
110
|
-
}
|
|
111
|
-
const G = /* @__PURE__ */ D(() => new w());
|
|
112
|
-
export {
|
|
113
|
-
w as SHA256,
|
|
114
|
-
G as sha256
|
|
115
|
-
};
|
package/dist/index63.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index69.cjs"),s=require("./index46.cjs"),c=require("./index35.cjs");function r(e,o){return t.keccak_256(s.isHex(e,{strict:!1})?c.toBytes(e):e)}exports.keccak256=r;
|
package/dist/index63.js
DELETED
package/dist/index64.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e={ether:-9,wei:9};exports.gweiUnits=e;
|
package/dist/index64.js
DELETED
package/dist/index65.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(r,i){let t=r.toString();const n=t.startsWith("-");n&&(t=t.slice(1)),t=t.padStart(i,"0");let[l,e]=[t.slice(0,t.length-i),t.slice(t.length-i)];return e=e.replace(/(0+)$/,""),`${n?"-":""}${l||"0"}${e?`.${e}`:""}`}exports.formatUnits=o;
|
package/dist/index65.js
DELETED
|
@@ -1,13 +0,0 @@
|
|
|
1
|
-
function a(r, n) {
|
|
2
|
-
let t = r.toString();
|
|
3
|
-
const i = t.startsWith("-");
|
|
4
|
-
i && (t = t.slice(1)), t = t.padStart(n, "0");
|
|
5
|
-
let [l, e] = [
|
|
6
|
-
t.slice(0, t.length - n),
|
|
7
|
-
t.slice(t.length - n)
|
|
8
|
-
];
|
|
9
|
-
return e = e.replace(/(0+)$/, ""), `${i ? "-" : ""}${l || "0"}${e ? `.${e}` : ""}`;
|
|
10
|
-
}
|
|
11
|
-
export {
|
|
12
|
-
a as formatUnits
|
|
13
|
-
};
|
package/dist/index66.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=6,s=32,e=4096,n=s*e,o=n*t-1-1*e*t;exports.bytesPerBlob=n;exports.bytesPerFieldElement=s;exports.fieldElementsPerBlob=e;exports.maxBytesPerTransaction=o;
|
package/dist/index66.js
DELETED
package/dist/index67.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./index70.cjs"),u=require("./index68.cjs");function a(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),h=BigInt(4294967295),e=Number(s>>n&h),r=Number(s&h),c=i?4:0,l=i?0:4;o.setUint32(t+c,e,i),o.setUint32(t+l,r,i)}const d=(o,t,s)=>o&t^~o&s,b=(o,t,s)=>o&t^o&s^t&s;class w extends u.Hash{constructor(t,s,i,n){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=u.createView(this.buffer)}update(t){p.exists(this);const{view:s,buffer:i,blockLen:n}=this;t=u.toBytes(t);const h=t.length;for(let e=0;e<h;){const r=Math.min(n-this.pos,h-e);if(r===n){const c=u.createView(t);for(;n<=h-e;e+=n)this.process(c,e);continue}i.set(t.subarray(e,e+r),this.pos),this.pos+=r,e+=r,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){p.exists(this),p.output(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:h}=this;let{pos:e}=this;s[e++]=128,this.buffer.subarray(e).fill(0),this.padOffset>n-e&&(this.process(i,0),e=0);for(let f=e;f<n;f++)s[f]=0;a(i,n-8,BigInt(this.length*8),h),this.process(i,0);const r=u.createView(t),c=this.outputLen;if(c%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=c/4,g=this.get();if(l>g.length)throw new Error("_sha2: outputLen bigger than state");for(let f=0;f<l;f++)r.setUint32(4*f,g[f],h)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:h,destroyed:e,pos:r}=this;return t.length=n,t.pos=r,t.finished=h,t.destroyed=e,n%s&&t.buffer.set(i),t}}exports.Chi=d;exports.HashMD=w;exports.Maj=b;
|
package/dist/index67.js
DELETED
|
@@ -1,64 +0,0 @@
|
|
|
1
|
-
import { exists as g, output as d } from "./index70.js";
|
|
2
|
-
import { Hash as b, createView as p, toBytes as a } from "./index68.js";
|
|
3
|
-
function w(o, t, s, i) {
|
|
4
|
-
if (typeof o.setBigUint64 == "function")
|
|
5
|
-
return o.setBigUint64(t, s, i);
|
|
6
|
-
const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), c = i ? 4 : 0, u = i ? 0 : 4;
|
|
7
|
-
o.setUint32(t + c, e, i), o.setUint32(t + u, r, i);
|
|
8
|
-
}
|
|
9
|
-
const B = (o, t, s) => o & t ^ ~o & s, L = (o, t, s) => o & t ^ o & s ^ t & s;
|
|
10
|
-
class U extends b {
|
|
11
|
-
constructor(t, s, i, n) {
|
|
12
|
-
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);
|
|
13
|
-
}
|
|
14
|
-
update(t) {
|
|
15
|
-
g(this);
|
|
16
|
-
const { view: s, buffer: i, blockLen: n } = this;
|
|
17
|
-
t = a(t);
|
|
18
|
-
const h = t.length;
|
|
19
|
-
for (let e = 0; e < h; ) {
|
|
20
|
-
const r = Math.min(n - this.pos, h - e);
|
|
21
|
-
if (r === n) {
|
|
22
|
-
const c = p(t);
|
|
23
|
-
for (; n <= h - e; e += n)
|
|
24
|
-
this.process(c, e);
|
|
25
|
-
continue;
|
|
26
|
-
}
|
|
27
|
-
i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
|
|
28
|
-
}
|
|
29
|
-
return this.length += t.length, this.roundClean(), this;
|
|
30
|
-
}
|
|
31
|
-
digestInto(t) {
|
|
32
|
-
g(this), d(t, this), this.finished = !0;
|
|
33
|
-
const { buffer: s, view: i, blockLen: n, isLE: h } = this;
|
|
34
|
-
let { pos: e } = this;
|
|
35
|
-
s[e++] = 128, this.buffer.subarray(e).fill(0), this.padOffset > n - e && (this.process(i, 0), e = 0);
|
|
36
|
-
for (let f = e; f < n; f++)
|
|
37
|
-
s[f] = 0;
|
|
38
|
-
w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
|
|
39
|
-
const r = p(t), c = this.outputLen;
|
|
40
|
-
if (c % 4)
|
|
41
|
-
throw new Error("_sha2: outputLen should be aligned to 32bit");
|
|
42
|
-
const u = c / 4, l = this.get();
|
|
43
|
-
if (u > l.length)
|
|
44
|
-
throw new Error("_sha2: outputLen bigger than state");
|
|
45
|
-
for (let f = 0; f < u; f++)
|
|
46
|
-
r.setUint32(4 * f, l[f], h);
|
|
47
|
-
}
|
|
48
|
-
digest() {
|
|
49
|
-
const { buffer: t, outputLen: s } = this;
|
|
50
|
-
this.digestInto(t);
|
|
51
|
-
const i = t.slice(0, s);
|
|
52
|
-
return this.destroy(), i;
|
|
53
|
-
}
|
|
54
|
-
_cloneInto(t) {
|
|
55
|
-
t || (t = new this.constructor()), t.set(...this.get());
|
|
56
|
-
const { blockLen: s, buffer: i, length: n, finished: h, destroyed: e, pos: r } = this;
|
|
57
|
-
return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
|
|
58
|
-
}
|
|
59
|
-
}
|
|
60
|
-
export {
|
|
61
|
-
B as Chi,
|
|
62
|
-
U as HashMD,
|
|
63
|
-
L as Maj
|
|
64
|
-
};
|
package/dist/index68.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index70.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */const u=t=>new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4)),i=t=>new DataView(t.buffer,t.byteOffset,t.byteLength),y=(t,e)=>t<<32-e|t>>>e,b=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68,o=t=>t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255;function p(t){for(let e=0;e<t.length;e++)t[e]=o(t[e])}function f(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new Uint8Array(new TextEncoder().encode(t))}function r(t){return typeof t=="string"&&(t=f(t)),s.bytes(t),t}class w{clone(){return this._cloneInto()}}function l(t){const e=c=>t().update(r(c)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}exports.Hash=w;exports.byteSwap=o;exports.byteSwap32=p;exports.createView=i;exports.isLE=b;exports.rotr=y;exports.toBytes=r;exports.u32=u;exports.utf8ToBytes=f;exports.wrapConstructor=l;
|
package/dist/index68.js
DELETED
|
@@ -1,37 +0,0 @@
|
|
|
1
|
-
import { bytes as f } from "./index70.js";
|
|
2
|
-
/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
3
|
-
const s = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4)), y = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), p = (t, e) => t << 32 - e | t >>> e, b = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68, c = (t) => t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
|
|
4
|
-
function w(t) {
|
|
5
|
-
for (let e = 0; e < t.length; e++)
|
|
6
|
-
t[e] = c(t[e]);
|
|
7
|
-
}
|
|
8
|
-
function r(t) {
|
|
9
|
-
if (typeof t != "string")
|
|
10
|
-
throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
|
|
11
|
-
return new Uint8Array(new TextEncoder().encode(t));
|
|
12
|
-
}
|
|
13
|
-
function u(t) {
|
|
14
|
-
return typeof t == "string" && (t = r(t)), f(t), t;
|
|
15
|
-
}
|
|
16
|
-
class x {
|
|
17
|
-
// Safe version that clones internal state
|
|
18
|
-
clone() {
|
|
19
|
-
return this._cloneInto();
|
|
20
|
-
}
|
|
21
|
-
}
|
|
22
|
-
function g(t) {
|
|
23
|
-
const e = (o) => t().update(u(o)).digest(), n = t();
|
|
24
|
-
return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
|
|
25
|
-
}
|
|
26
|
-
export {
|
|
27
|
-
x as Hash,
|
|
28
|
-
c as byteSwap,
|
|
29
|
-
w as byteSwap32,
|
|
30
|
-
y as createView,
|
|
31
|
-
b as isLE,
|
|
32
|
-
p as rotr,
|
|
33
|
-
u as toBytes,
|
|
34
|
-
s as u32,
|
|
35
|
-
r as utf8ToBytes,
|
|
36
|
-
g as wrapConstructor
|
|
37
|
-
};
|
package/dist/index69.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./index70.cjs"),a=require("./index71.cjs"),c=require("./index68.cjs"),I=[],O=[],w=[],B=BigInt(0),f=BigInt(1),A=BigInt(2),S=BigInt(7),H=BigInt(256),T=BigInt(113);for(let i=0,t=f,s=1,n=0;i<24;i++){[s,n]=[n,(2*s+3*n)%5],I.push(2*(5*n+s)),O.push((i+1)*(i+2)/2%64);let o=B;for(let r=0;r<7;r++)t=(t<<f^(t>>S)*T)%H,t&A&&(o^=f<<(f<<BigInt(r))-f);w.push(o)}const[m,E]=a.split(w,!0),y=(i,t,s)=>s>32?a.rotlBH(i,t,s):a.rotlSH(i,t,s),b=(i,t,s)=>s>32?a.rotlBL(i,t,s):a.rotlSL(i,t,s);function L(i,t=24){const s=new Uint32Array(10);for(let n=24-t;n<24;n++){for(let e=0;e<10;e++)s[e]=i[e]^i[e+10]^i[e+20]^i[e+30]^i[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,p=(e+2)%10,d=s[p],u=s[p+1],_=y(d,u,1)^s[h],g=b(d,u,1)^s[h+1];for(let k=0;k<50;k+=10)i[e+k]^=_,i[e+k+1]^=g}let o=i[2],r=i[3];for(let e=0;e<24;e++){const h=O[e],p=y(o,r,h),d=b(o,r,h),u=I[e];o=i[u],r=i[u+1],i[u]=p,i[u+1]=d}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=i[e+h];for(let h=0;h<10;h++)i[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}i[0]^=m[n],i[1]^=E[n]}s.fill(0)}class x extends c.Hash{constructor(t,s,n,o=!1,r=24){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,l.number(n),0>=this.blockLen||this.blockLen>=200)throw new Error("Sha3 supports only keccak-f1600 function");this.state=new Uint8Array(200),this.state32=c.u32(this.state)}keccak(){c.isLE||c.byteSwap32(this.state32),L(this.state32,this.rounds),c.isLE||c.byteSwap32(this.state32),this.posOut=0,this.pos=0}update(t){l.exists(this);const{blockLen:s,state:n}=this;t=c.toBytes(t);const o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)n[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:n,blockLen:o}=this;t[n]^=s,s&128&&n===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){l.exists(this,!1),l.bytes(t),this.finish();const s=this.state,{blockLen:n}=this;for(let o=0,r=t.length;o<r;){this.posOut>=n&&this.keccak();const e=Math.min(n-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return l.number(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(l.output(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(t){const{blockLen:s,suffix:n,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new x(s,n,o,e,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=e,t.destroyed=this.destroyed,t}}const F=(i,t,s)=>c.wrapConstructor(()=>new x(t,i,s)),P=F(1,136,256/8);exports.Keccak=x;exports.keccakP=L;exports.keccak_256=P;
|
package/dist/index69.js
DELETED
|
@@ -1,107 +0,0 @@
|
|
|
1
|
-
import { number as d, exists as k, bytes as B, output as A } from "./index70.js";
|
|
2
|
-
import { split as H, rotlBH as m, rotlSH as S, rotlBL as T, rotlSL as F } from "./index71.js";
|
|
3
|
-
import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index68.js";
|
|
4
|
-
const y = [], L = [], b = [], M = /* @__PURE__ */ BigInt(0), f = /* @__PURE__ */ BigInt(1), R = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(7), C = /* @__PURE__ */ BigInt(256), q = /* @__PURE__ */ BigInt(113);
|
|
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;
|
|
100
|
-
}
|
|
101
|
-
}
|
|
102
|
-
const G = (e, t, s) => X(() => new p(t, e, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
|
|
103
|
-
export {
|
|
104
|
-
p as Keccak,
|
|
105
|
-
D as keccakP,
|
|
106
|
-
Q as keccak_256
|
|
107
|
-
};
|
package/dist/index70.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`positive integer expected, not ${e}`)}function n(e){return e instanceof Uint8Array||e!=null&&typeof e=="object"&&e.constructor.name==="Uint8Array"}function o(e,...t){if(!n(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`)}function s(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}function u(e,t){o(e);const r=t.outputLen;if(e.length<r)throw new Error(`digestInto() expects output buffer of length at least ${r}`)}exports.bytes=o;exports.exists=s;exports.isBytes=n;exports.number=i;exports.output=u;
|
package/dist/index70.js
DELETED
|
@@ -1,32 +0,0 @@
|
|
|
1
|
-
function i(e) {
|
|
2
|
-
if (!Number.isSafeInteger(e) || e < 0)
|
|
3
|
-
throw new Error(`positive integer expected, not ${e}`);
|
|
4
|
-
}
|
|
5
|
-
function n(e) {
|
|
6
|
-
return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
|
|
7
|
-
}
|
|
8
|
-
function o(e, ...t) {
|
|
9
|
-
if (!n(e))
|
|
10
|
-
throw new Error("Uint8Array expected");
|
|
11
|
-
if (t.length > 0 && !t.includes(e.length))
|
|
12
|
-
throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
|
|
13
|
-
}
|
|
14
|
-
function f(e, t = !0) {
|
|
15
|
-
if (e.destroyed)
|
|
16
|
-
throw new Error("Hash instance has been destroyed");
|
|
17
|
-
if (t && e.finished)
|
|
18
|
-
throw new Error("Hash#digest() has already been called");
|
|
19
|
-
}
|
|
20
|
-
function s(e, t) {
|
|
21
|
-
o(e);
|
|
22
|
-
const r = t.outputLen;
|
|
23
|
-
if (e.length < r)
|
|
24
|
-
throw new Error(`digestInto() expects output buffer of length at least ${r}`);
|
|
25
|
-
}
|
|
26
|
-
export {
|
|
27
|
-
o as bytes,
|
|
28
|
-
f as exists,
|
|
29
|
-
n as isBytes,
|
|
30
|
-
i as number,
|
|
31
|
-
s as output
|
|
32
|
-
};
|
package/dist/index71.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=BigInt(2**32-1),i=BigInt(32);function u(t,e=!1){return e?{h:Number(t&n),l:Number(t>>i&n)}:{h:Number(t>>i&n)|0,l:Number(t&n)|0}}function g(t,e=!1){let r=new Uint32Array(t.length),l=new Uint32Array(t.length);for(let o=0;o<t.length;o++){const{h:c,l:f}=u(t[o],e);[r[o],l[o]]=[c,f]}return[r,l]}const B=(t,e,r)=>t<<r|e>>>32-r,h=(t,e,r)=>e<<r|t>>>32-r,m=(t,e,r)=>e<<r-32|t>>>64-r,S=(t,e,r)=>t<<r-32|e>>>64-r;exports.fromBig=u;exports.rotlBH=m;exports.rotlBL=S;exports.rotlSH=B;exports.rotlSL=h;exports.split=g;
|
package/dist/index71.js
DELETED
|
@@ -1,21 +0,0 @@
|
|
|
1
|
-
const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
|
|
2
|
-
function f(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
|
-
let n = new Uint32Array(t.length), l = new Uint32Array(t.length);
|
|
7
|
-
for (let e = 0; e < t.length; e++) {
|
|
8
|
-
const { h: c, l: u } = f(t[e], r);
|
|
9
|
-
[n[e], l[e]] = [c, u];
|
|
10
|
-
}
|
|
11
|
-
return [n, l];
|
|
12
|
-
}
|
|
13
|
-
const g = (t, r, n) => t << n | r >>> 32 - n, m = (t, r, n) => r << n | t >>> 32 - n, A = (t, r, n) => r << n - 32 | t >>> 64 - n, B = (t, r, n) => t << n - 32 | r >>> 64 - n;
|
|
14
|
-
export {
|
|
15
|
-
f as fromBig,
|
|
16
|
-
A as rotlBH,
|
|
17
|
-
B as rotlBL,
|
|
18
|
-
g as rotlSH,
|
|
19
|
-
m as rotlSL,
|
|
20
|
-
h as split
|
|
21
|
-
};
|
package/dist/index8.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index13.cjs"),a=r.defineChain({id:42161,name:"Arbitrum One",nativeCurrency:{name:"Ether",symbol:"ETH",decimals:18},rpcUrls:{default:{http:["https://arb1.arbitrum.io/rpc"]}},blockExplorers:{default:{name:"Arbiscan",url:"https://arbiscan.io",apiUrl:"https://api.arbiscan.io/api"}},contracts:{multicall3:{address:"0xca11bde05977b3631167028862be2a173976ca11",blockCreated:7654707}}});exports.arbitrum=a;
|
package/dist/index8.js
DELETED
|
@@ -1,27 +0,0 @@
|
|
|
1
|
-
import { defineChain as a } from "./index13.js";
|
|
2
|
-
const t = /* @__PURE__ */ a({
|
|
3
|
-
id: 42161,
|
|
4
|
-
name: "Arbitrum One",
|
|
5
|
-
nativeCurrency: { name: "Ether", symbol: "ETH", decimals: 18 },
|
|
6
|
-
rpcUrls: {
|
|
7
|
-
default: {
|
|
8
|
-
http: ["https://arb1.arbitrum.io/rpc"]
|
|
9
|
-
}
|
|
10
|
-
},
|
|
11
|
-
blockExplorers: {
|
|
12
|
-
default: {
|
|
13
|
-
name: "Arbiscan",
|
|
14
|
-
url: "https://arbiscan.io",
|
|
15
|
-
apiUrl: "https://api.arbiscan.io/api"
|
|
16
|
-
}
|
|
17
|
-
},
|
|
18
|
-
contracts: {
|
|
19
|
-
multicall3: {
|
|
20
|
-
address: "0xca11bde05977b3631167028862be2a173976ca11",
|
|
21
|
-
blockCreated: 7654707
|
|
22
|
-
}
|
|
23
|
-
}
|
|
24
|
-
});
|
|
25
|
-
export {
|
|
26
|
-
t as arbitrum
|
|
27
|
-
};
|
package/dist/index9.cjs
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index13.cjs"),a=e.defineChain({id:11155111,name:"Sepolia",nativeCurrency:{name:"Sepolia Ether",symbol:"ETH",decimals:18},rpcUrls:{default:{http:["https://rpc2.sepolia.org"]}},blockExplorers:{default:{name:"Etherscan",url:"https://sepolia.etherscan.io",apiUrl:"https://api-sepolia.etherscan.io/api"}},contracts:{multicall3:{address:"0xca11bde05977b3631167028862be2a173976ca11",blockCreated:751532},ensRegistry:{address:"0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e"},ensUniversalResolver:{address:"0xc8Af999e38273D658BE1b921b88A9Ddf005769cC",blockCreated:5317080}},testnet:!0});exports.sepolia=a;
|
package/dist/index9.js
DELETED
|
@@ -1,33 +0,0 @@
|
|
|
1
|
-
import { defineChain as e } from "./index13.js";
|
|
2
|
-
const s = /* @__PURE__ */ e({
|
|
3
|
-
id: 11155111,
|
|
4
|
-
name: "Sepolia",
|
|
5
|
-
nativeCurrency: { name: "Sepolia Ether", symbol: "ETH", decimals: 18 },
|
|
6
|
-
rpcUrls: {
|
|
7
|
-
default: {
|
|
8
|
-
http: ["https://rpc2.sepolia.org"]
|
|
9
|
-
}
|
|
10
|
-
},
|
|
11
|
-
blockExplorers: {
|
|
12
|
-
default: {
|
|
13
|
-
name: "Etherscan",
|
|
14
|
-
url: "https://sepolia.etherscan.io",
|
|
15
|
-
apiUrl: "https://api-sepolia.etherscan.io/api"
|
|
16
|
-
}
|
|
17
|
-
},
|
|
18
|
-
contracts: {
|
|
19
|
-
multicall3: {
|
|
20
|
-
address: "0xca11bde05977b3631167028862be2a173976ca11",
|
|
21
|
-
blockCreated: 751532
|
|
22
|
-
},
|
|
23
|
-
ensRegistry: { address: "0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e" },
|
|
24
|
-
ensUniversalResolver: {
|
|
25
|
-
address: "0xc8Af999e38273D658BE1b921b88A9Ddf005769cC",
|
|
26
|
-
blockCreated: 5317080
|
|
27
|
-
}
|
|
28
|
-
},
|
|
29
|
-
testnet: !0
|
|
30
|
-
});
|
|
31
|
-
export {
|
|
32
|
-
s as sepolia
|
|
33
|
-
};
|