@gardenfi/utils 2.2.0-beta.1 → 2.2.1-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/index195.cjs +1 -1
- package/dist/index195.js +3 -3
- package/dist/index225.cjs +1 -1
- package/dist/index225.js +2 -2
- package/dist/index228.cjs +1 -1
- package/dist/index228.js +2 -2
- package/dist/index229.cjs +1 -1
- package/dist/index229.js +1 -1
- package/dist/index234.cjs +1 -1
- package/dist/index234.js +1 -1
- package/dist/index235.cjs +1 -1
- package/dist/index235.js +1 -1
- package/dist/index236.cjs +1 -1
- package/dist/index236.js +2 -2
- package/dist/index248.cjs +1 -1
- package/dist/index248.js +1 -1
- package/dist/index249.cjs +1 -1
- package/dist/index249.js +1 -1
- package/dist/index28.cjs +1 -1
- package/dist/index28.js +2 -2
- package/dist/index280.cjs +1 -1
- package/dist/index280.js +103 -6
- package/dist/index281.cjs +1 -1
- package/dist/index281.js +7 -7
- package/dist/index282.cjs +1 -1
- package/dist/index282.js +223 -25
- package/dist/index283.cjs +1 -1
- package/dist/index283.js +6 -19
- package/dist/index284.cjs +1 -1
- package/dist/index284.js +7 -147
- package/dist/index285.cjs +1 -1
- package/dist/index285.js +24 -101
- package/dist/index286.cjs +1 -1
- package/dist/index286.js +19 -3
- package/dist/index287.cjs +1 -1
- package/dist/index287.js +140 -134
- package/dist/index288.cjs +1 -1
- package/dist/index288.js +3 -155
- package/dist/index289.cjs +1 -1
- package/dist/index289.js +138 -7
- package/dist/index290.cjs +1 -1
- package/dist/index290.js +155 -6
- package/dist/index291.cjs +1 -1
- package/dist/index291.js +8 -223
- package/dist/index292.cjs +1 -1
- package/dist/index292.js +2 -2
- package/dist/index293.cjs +1 -1
- package/dist/index293.js +2 -2
- package/dist/index294.cjs +1 -1
- package/dist/index294.js +138 -10
- package/dist/index295.cjs +1 -1
- package/dist/index295.js +42 -19
- package/dist/index296.cjs +1 -1
- package/dist/index296.js +73 -134
- package/dist/index297.cjs +1 -1
- package/dist/index297.js +2 -43
- package/dist/index298.cjs +1 -1
- package/dist/index298.js +10 -77
- package/dist/index299.cjs +1 -1
- package/dist/index299.js +20 -2
- package/dist/index301.cjs +1 -2
- package/dist/index301.js +695 -63
- package/dist/index302.cjs +1 -1
- package/dist/index302.js +201 -4
- package/dist/index303.cjs +2 -1
- package/dist/index303.js +65 -39
- package/dist/index304.cjs +1 -1
- package/dist/index304.js +4 -698
- package/dist/index305.cjs +1 -1
- package/dist/index305.js +40 -201
- package/dist/index306.cjs +1 -1
- package/dist/index306.js +1 -1
- package/dist/index307.cjs +1 -1
- package/dist/index307.js +1 -1
- package/dist/index308.cjs +1 -1
- package/dist/index308.js +1 -1
- package/dist/index310.cjs +1 -1
- package/dist/index310.js +2 -2
- package/dist/index311.cjs +1 -1
- package/dist/index311.js +3 -3
- package/package.json +1 -1
package/dist/index284.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("./index285.cjs"),n=require("./index263.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;
|
package/dist/index284.js
CHANGED
|
@@ -1,149 +1,9 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
if (!Number.isSafeInteger(t) || t < 0)
|
|
8
|
-
throw new Error("positive integer expected, got " + t);
|
|
9
|
-
}
|
|
10
|
-
function c(t, ...e) {
|
|
11
|
-
if (!w(t))
|
|
12
|
-
throw new Error("Uint8Array expected");
|
|
13
|
-
if (e.length > 0 && !e.includes(t.length))
|
|
14
|
-
throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
|
|
15
|
-
}
|
|
16
|
-
function U(t) {
|
|
17
|
-
if (typeof t != "function" || typeof t.create != "function")
|
|
18
|
-
throw new Error("Hash should be wrapped by utils.createHasher");
|
|
19
|
-
l(t.outputLen), l(t.blockLen);
|
|
20
|
-
}
|
|
21
|
-
function B(t, e = !0) {
|
|
22
|
-
if (t.destroyed)
|
|
23
|
-
throw new Error("Hash instance has been destroyed");
|
|
24
|
-
if (e && t.finished)
|
|
25
|
-
throw new Error("Hash#digest() has already been called");
|
|
26
|
-
}
|
|
27
|
-
function H(t, e) {
|
|
28
|
-
c(t);
|
|
29
|
-
const n = e.outputLen;
|
|
30
|
-
if (t.length < n)
|
|
31
|
-
throw new Error("digestInto() expects output buffer of length at least " + n);
|
|
32
|
-
}
|
|
33
|
-
function L(t) {
|
|
34
|
-
return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
|
|
35
|
-
}
|
|
36
|
-
function V(...t) {
|
|
37
|
-
for (let e = 0; e < t.length; e++)
|
|
38
|
-
t[e].fill(0);
|
|
39
|
-
}
|
|
40
|
-
function _(t) {
|
|
41
|
-
return new DataView(t.buffer, t.byteOffset, t.byteLength);
|
|
42
|
-
}
|
|
43
|
-
function S(t, e) {
|
|
44
|
-
return t << 32 - e | t >>> e;
|
|
45
|
-
}
|
|
46
|
-
const d = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
47
|
-
function h(t) {
|
|
48
|
-
return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
|
|
49
|
-
}
|
|
50
|
-
function x(t) {
|
|
51
|
-
for (let e = 0; e < t.length; e++)
|
|
52
|
-
t[e] = h(t[e]);
|
|
53
|
-
return t;
|
|
54
|
-
}
|
|
55
|
-
const T = d ? (t) => t : x, p = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", A = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
|
|
56
|
-
function k(t) {
|
|
57
|
-
if (c(t), p)
|
|
58
|
-
return t.toHex();
|
|
59
|
-
let e = "";
|
|
60
|
-
for (let n = 0; n < t.length; n++)
|
|
61
|
-
e += A[t[n]];
|
|
62
|
-
return e;
|
|
63
|
-
}
|
|
64
|
-
const f = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
65
|
-
function y(t) {
|
|
66
|
-
if (t >= f._0 && t <= f._9)
|
|
67
|
-
return t - f._0;
|
|
68
|
-
if (t >= f.A && t <= f.F)
|
|
69
|
-
return t - (f.A - 10);
|
|
70
|
-
if (t >= f.a && t <= f.f)
|
|
71
|
-
return t - (f.a - 10);
|
|
72
|
-
}
|
|
73
|
-
function I(t) {
|
|
74
|
-
if (typeof t != "string")
|
|
75
|
-
throw new Error("hex string expected, got " + typeof t);
|
|
76
|
-
if (p)
|
|
77
|
-
return Uint8Array.fromHex(t);
|
|
78
|
-
const e = t.length, n = e / 2;
|
|
79
|
-
if (e % 2)
|
|
80
|
-
throw new Error("hex string expected, got unpadded hex of length " + e);
|
|
81
|
-
const r = new Uint8Array(n);
|
|
82
|
-
for (let o = 0, i = 0; o < n; o++, i += 2) {
|
|
83
|
-
const s = y(t.charCodeAt(i)), a = y(t.charCodeAt(i + 1));
|
|
84
|
-
if (s === void 0 || a === void 0) {
|
|
85
|
-
const g = t[i] + t[i + 1];
|
|
86
|
-
throw new Error('hex string expected, got non-hex character "' + g + '" at index ' + i);
|
|
87
|
-
}
|
|
88
|
-
r[o] = s * 16 + a;
|
|
89
|
-
}
|
|
90
|
-
return r;
|
|
91
|
-
}
|
|
92
|
-
function m(t) {
|
|
93
|
-
if (typeof t != "string")
|
|
94
|
-
throw new Error("string expected");
|
|
95
|
-
return new Uint8Array(new TextEncoder().encode(t));
|
|
96
|
-
}
|
|
97
|
-
function b(t) {
|
|
98
|
-
return typeof t == "string" && (t = m(t)), c(t), t;
|
|
99
|
-
}
|
|
100
|
-
function R(...t) {
|
|
101
|
-
let e = 0;
|
|
102
|
-
for (let r = 0; r < t.length; r++) {
|
|
103
|
-
const o = t[r];
|
|
104
|
-
c(o), e += o.length;
|
|
105
|
-
}
|
|
106
|
-
const n = new Uint8Array(e);
|
|
107
|
-
for (let r = 0, o = 0; r < t.length; r++) {
|
|
108
|
-
const i = t[r];
|
|
109
|
-
n.set(i, o), o += i.length;
|
|
110
|
-
}
|
|
111
|
-
return n;
|
|
112
|
-
}
|
|
113
|
-
class F {
|
|
114
|
-
}
|
|
115
|
-
function O(t) {
|
|
116
|
-
const e = (r) => t().update(b(r)).digest(), n = t();
|
|
117
|
-
return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
|
|
118
|
-
}
|
|
119
|
-
function v(t = 32) {
|
|
120
|
-
if (u && typeof u.getRandomValues == "function")
|
|
121
|
-
return u.getRandomValues(new Uint8Array(t));
|
|
122
|
-
if (u && typeof u.randomBytes == "function")
|
|
123
|
-
return Uint8Array.from(u.randomBytes(t));
|
|
124
|
-
throw new Error("crypto.getRandomValues must be defined");
|
|
125
|
-
}
|
|
1
|
+
import { normalizeSignature as o } from "./index285.js";
|
|
2
|
+
import { formatAbiItem as n } from "./index263.js";
|
|
3
|
+
const m = (r) => {
|
|
4
|
+
const t = typeof r == "string" ? r : n(r);
|
|
5
|
+
return o(t);
|
|
6
|
+
};
|
|
126
7
|
export {
|
|
127
|
-
|
|
128
|
-
c as abytes,
|
|
129
|
-
B as aexists,
|
|
130
|
-
U as ahash,
|
|
131
|
-
l as anumber,
|
|
132
|
-
H as aoutput,
|
|
133
|
-
h as byteSwap,
|
|
134
|
-
x as byteSwap32,
|
|
135
|
-
k as bytesToHex,
|
|
136
|
-
V as clean,
|
|
137
|
-
R as concatBytes,
|
|
138
|
-
O as createHasher,
|
|
139
|
-
_ as createView,
|
|
140
|
-
I as hexToBytes,
|
|
141
|
-
w as isBytes,
|
|
142
|
-
d as isLE,
|
|
143
|
-
v as randomBytes,
|
|
144
|
-
S as rotr,
|
|
145
|
-
T as swap32IfBE,
|
|
146
|
-
b as toBytes,
|
|
147
|
-
L as u32,
|
|
148
|
-
m as utf8ToBytes
|
|
8
|
+
m as toSignature
|
|
149
9
|
};
|
package/dist/index285.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 f=require("./index41.cjs");function a(r){let l=!0,i="",o=0,t="",u=!1;for(let n=0;n<r.length;n++){const e=r[n];if(["(",")",","].includes(e)&&(l=!0),e==="("&&o++,e===")"&&o--,!!l){if(o===0){if(e===" "&&["event","function",""].includes(t))t="";else if(t+=e,e===")"){u=!0;break}continue}if(e===" "){r[n-1]!==","&&i!==","&&i!==",("&&(i="",l=!1);continue}t+=e,i+=e}}if(!u)throw new f.BaseError("Unable to normalize signature.");return t}exports.normalizeSignature=a;
|
package/dist/index285.js
CHANGED
|
@@ -1,106 +1,29 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
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
|
-
]), h = /* @__PURE__ */ new Uint32Array(64);
|
|
69
|
-
class E extends D {
|
|
70
|
-
constructor(o = 32) {
|
|
71
|
-
super(64, o, 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;
|
|
72
|
-
}
|
|
73
|
-
get() {
|
|
74
|
-
const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
|
|
75
|
-
return [o, r, t, s, a, f, c, e];
|
|
76
|
-
}
|
|
77
|
-
// prettier-ignore
|
|
78
|
-
set(o, r, t, s, a, f, c, e) {
|
|
79
|
-
this.A = o | 0, this.B = r | 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;
|
|
80
|
-
}
|
|
81
|
-
process(o, r) {
|
|
82
|
-
for (let x = 0; x < 16; x++, r += 4)
|
|
83
|
-
h[x] = o.getUint32(r, !1);
|
|
84
|
-
for (let x = 16; x < 64; x++) {
|
|
85
|
-
const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
|
|
86
|
-
h[x] = l + h[x - 7] + m + h[x - 16] | 0;
|
|
1
|
+
import { BaseError as u } from "./index41.js";
|
|
2
|
+
function a(r) {
|
|
3
|
+
let l = !0, i = "", f = 0, t = "", o = !1;
|
|
4
|
+
for (let n = 0; n < r.length; n++) {
|
|
5
|
+
const e = r[n];
|
|
6
|
+
if (["(", ")", ","].includes(e) && (l = !0), e === "(" && f++, e === ")" && f--, !!l) {
|
|
7
|
+
if (f === 0) {
|
|
8
|
+
if (e === " " && ["event", "function", ""].includes(t))
|
|
9
|
+
t = "";
|
|
10
|
+
else if (t += e, e === ")") {
|
|
11
|
+
o = !0;
|
|
12
|
+
break;
|
|
13
|
+
}
|
|
14
|
+
continue;
|
|
15
|
+
}
|
|
16
|
+
if (e === " ") {
|
|
17
|
+
r[n - 1] !== "," && i !== "," && i !== ",(" && (i = "", l = !1);
|
|
18
|
+
continue;
|
|
19
|
+
}
|
|
20
|
+
t += e, i += e;
|
|
87
21
|
}
|
|
88
|
-
let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
|
|
89
|
-
for (let x = 0; x < 64; x++) {
|
|
90
|
-
const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
|
|
91
|
-
A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
|
|
92
|
-
}
|
|
93
|
-
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, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
|
|
94
|
-
}
|
|
95
|
-
roundClean() {
|
|
96
|
-
C(h);
|
|
97
|
-
}
|
|
98
|
-
destroy() {
|
|
99
|
-
this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
|
|
100
22
|
}
|
|
23
|
+
if (!o)
|
|
24
|
+
throw new u("Unable to normalize signature.");
|
|
25
|
+
return t;
|
|
101
26
|
}
|
|
102
|
-
const y = /* @__PURE__ */ u(() => new E());
|
|
103
27
|
export {
|
|
104
|
-
|
|
105
|
-
y as sha256
|
|
28
|
+
a as normalizeSignature
|
|
106
29
|
};
|
package/dist/index286.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=BigInt(2**32-1),c=BigInt(32);function u(t,o=!1){return o?{h:Number(t&l),l:Number(t>>c&l)}:{h:Number(t>>c&l)|0,l:Number(t&l)|0}}function B(t,o=!1){const r=t.length;let n=new Uint32Array(r),i=new Uint32Array(r);for(let e=0;e<r;e++){const{h:f,l:s}=u(t[e],o);[n[e],i[e]]=[f,s]}return[n,i]}const g=(t,o,r)=>t<<r|o>>>32-r,m=(t,o,r)=>o<<r|t>>>32-r,S=(t,o,r)=>o<<r-32|t>>>64-r,a=(t,o,r)=>t<<r-32|o>>>64-r;exports.fromBig=u;exports.rotlBH=S;exports.rotlBL=a;exports.rotlSH=g;exports.rotlSL=m;exports.split=B;
|
package/dist/index286.js
CHANGED
|
@@ -1,6 +1,22 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
1
|
+
const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
|
|
2
|
+
function s(t, r = !1) {
|
|
3
|
+
return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
|
|
3
4
|
}
|
|
5
|
+
function h(t, r = !1) {
|
|
6
|
+
const n = t.length;
|
|
7
|
+
let l = new Uint32Array(n), c = new Uint32Array(n);
|
|
8
|
+
for (let e = 0; e < n; e++) {
|
|
9
|
+
const { h: u, l: f } = s(t[e], r);
|
|
10
|
+
[l[e], c[e]] = [u, f];
|
|
11
|
+
}
|
|
12
|
+
return [l, c];
|
|
13
|
+
}
|
|
14
|
+
const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
|
|
4
15
|
export {
|
|
5
|
-
|
|
16
|
+
s as fromBig,
|
|
17
|
+
B as rotlBH,
|
|
18
|
+
a as rotlBL,
|
|
19
|
+
m as rotlSH,
|
|
20
|
+
A as rotlSL,
|
|
21
|
+
h as split
|
|
6
22
|
};
|
package/dist/index287.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 u=require("./index297.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function p(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function s(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function c(t,...e){if(!p(t))throw new Error("Uint8Array expected");if(e.length>0&&!e.includes(t.length))throw new Error("Uint8Array expected of length "+e+", got length="+t.length)}function m(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.createHasher");s(t.outputLen),s(t.blockLen)}function B(t,e=!0){if(t.destroyed)throw new Error("Hash instance has been destroyed");if(e&&t.finished)throw new Error("Hash#digest() has already been called")}function E(t,e){c(t);const n=e.outputLen;if(t.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}function H(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function U(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function L(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function S(t,e){return t<<32-e|t>>>e}const h=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function w(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function g(t){for(let e=0;e<t.length;e++)t[e]=w(t[e]);return t}const T=h?t=>t:g,d=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",V=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function _(t){if(c(t),d)return t.toHex();let e="";for(let n=0;n<t.length;n++)e+=V[t[n]];return e}const f={_0:48,_9:57,A:65,F:70,a:97,f:102};function l(t){if(t>=f._0&&t<=f._9)return t-f._0;if(t>=f.A&&t<=f.F)return t-(f.A-10);if(t>=f.a&&t<=f.f)return t-(f.a-10)}function I(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(d)return Uint8Array.fromHex(t);const e=t.length,n=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(n);for(let o=0,i=0;o<n;o++,i+=2){const a=l(t.charCodeAt(i)),y=l(t.charCodeAt(i+1));if(a===void 0||y===void 0){const A=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+A+'" at index '+i)}r[o]=a*16+y}return r}function x(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}function b(t){return typeof t=="string"&&(t=x(t)),c(t),t}function k(...t){let e=0;for(let r=0;r<t.length;r++){const o=t[r];c(o),e+=o.length}const n=new Uint8Array(e);for(let r=0,o=0;r<t.length;r++){const i=t[r];n.set(i,o),o+=i.length}return n}class O{}function R(t){const e=r=>t().update(b(r)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}function v(t=32){if(u.crypto&&typeof u.crypto.getRandomValues=="function")return u.crypto.getRandomValues(new Uint8Array(t));if(u.crypto&&typeof u.crypto.randomBytes=="function")return Uint8Array.from(u.crypto.randomBytes(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=O;exports.abytes=c;exports.aexists=B;exports.ahash=m;exports.anumber=s;exports.aoutput=E;exports.byteSwap=w;exports.byteSwap32=g;exports.bytesToHex=_;exports.clean=U;exports.concatBytes=k;exports.createHasher=R;exports.createView=L;exports.hexToBytes=I;exports.isBytes=p;exports.isLE=h;exports.randomBytes=v;exports.rotr=S;exports.swap32IfBE=T;exports.toBytes=b;exports.u32=H;exports.utf8ToBytes=x;
|
package/dist/index287.js
CHANGED
|
@@ -1,143 +1,149 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
1
|
+
import { crypto as u } from "./index297.js";
|
|
2
|
+
/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
3
|
+
function w(t) {
|
|
4
|
+
return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
|
|
5
|
+
}
|
|
6
|
+
function l(t) {
|
|
7
|
+
if (!Number.isSafeInteger(t) || t < 0)
|
|
8
|
+
throw new Error("positive integer expected, got " + t);
|
|
9
|
+
}
|
|
10
|
+
function c(t, ...e) {
|
|
11
|
+
if (!w(t))
|
|
12
|
+
throw new Error("Uint8Array expected");
|
|
13
|
+
if (e.length > 0 && !e.includes(t.length))
|
|
14
|
+
throw new Error("Uint8Array expected of length " + e + ", got length=" + t.length);
|
|
15
|
+
}
|
|
16
|
+
function U(t) {
|
|
17
|
+
if (typeof t != "function" || typeof t.create != "function")
|
|
18
|
+
throw new Error("Hash should be wrapped by utils.createHasher");
|
|
19
|
+
l(t.outputLen), l(t.blockLen);
|
|
20
|
+
}
|
|
21
|
+
function B(t, e = !0) {
|
|
22
|
+
if (t.destroyed)
|
|
23
|
+
throw new Error("Hash instance has been destroyed");
|
|
24
|
+
if (e && t.finished)
|
|
25
|
+
throw new Error("Hash#digest() has already been called");
|
|
26
|
+
}
|
|
27
|
+
function H(t, e) {
|
|
28
|
+
c(t);
|
|
29
|
+
const n = e.outputLen;
|
|
30
|
+
if (t.length < n)
|
|
31
|
+
throw new Error("digestInto() expects output buffer of length at least " + n);
|
|
32
|
+
}
|
|
33
|
+
function L(t) {
|
|
34
|
+
return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
|
|
35
|
+
}
|
|
36
|
+
function V(...t) {
|
|
37
|
+
for (let e = 0; e < t.length; e++)
|
|
38
|
+
t[e].fill(0);
|
|
39
|
+
}
|
|
40
|
+
function _(t) {
|
|
41
|
+
return new DataView(t.buffer, t.byteOffset, t.byteLength);
|
|
42
|
+
}
|
|
43
|
+
function S(t, e) {
|
|
44
|
+
return t << 32 - e | t >>> e;
|
|
45
|
+
}
|
|
46
|
+
const d = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
47
|
+
function h(t) {
|
|
48
|
+
return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
|
|
49
|
+
}
|
|
50
|
+
function x(t) {
|
|
51
|
+
for (let e = 0; e < t.length; e++)
|
|
52
|
+
t[e] = h(t[e]);
|
|
53
|
+
return t;
|
|
54
|
+
}
|
|
55
|
+
const T = d ? (t) => t : x, p = /* @ts-ignore */ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", A = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
|
|
56
|
+
function k(t) {
|
|
57
|
+
if (c(t), p)
|
|
58
|
+
return t.toHex();
|
|
59
|
+
let e = "";
|
|
60
|
+
for (let n = 0; n < t.length; n++)
|
|
61
|
+
e += A[t[n]];
|
|
62
|
+
return e;
|
|
63
|
+
}
|
|
64
|
+
const f = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
65
|
+
function y(t) {
|
|
66
|
+
if (t >= f._0 && t <= f._9)
|
|
67
|
+
return t - f._0;
|
|
68
|
+
if (t >= f.A && t <= f.F)
|
|
69
|
+
return t - (f.A - 10);
|
|
70
|
+
if (t >= f.a && t <= f.f)
|
|
71
|
+
return t - (f.a - 10);
|
|
72
|
+
}
|
|
73
|
+
function I(t) {
|
|
74
|
+
if (typeof t != "string")
|
|
75
|
+
throw new Error("hex string expected, got " + typeof t);
|
|
76
|
+
if (p)
|
|
77
|
+
return Uint8Array.fromHex(t);
|
|
78
|
+
const e = t.length, n = e / 2;
|
|
79
|
+
if (e % 2)
|
|
80
|
+
throw new Error("hex string expected, got unpadded hex of length " + e);
|
|
81
|
+
const r = new Uint8Array(n);
|
|
82
|
+
for (let o = 0, i = 0; o < n; o++, i += 2) {
|
|
83
|
+
const s = y(t.charCodeAt(i)), a = y(t.charCodeAt(i + 1));
|
|
84
|
+
if (s === void 0 || a === void 0) {
|
|
85
|
+
const g = t[i] + t[i + 1];
|
|
86
|
+
throw new Error('hex string expected, got non-hex character "' + g + '" at index ' + i);
|
|
10
87
|
}
|
|
11
|
-
|
|
12
|
-
} catch (e) {
|
|
13
|
-
return typeof e == "object" && typeof e.response < "u" || !globalThis.hasOwnProperty("Image") ? !1 : new Promise((n) => {
|
|
14
|
-
const r = new Image();
|
|
15
|
-
r.onload = () => {
|
|
16
|
-
n(!0);
|
|
17
|
-
}, r.onerror = () => {
|
|
18
|
-
n(!1);
|
|
19
|
-
}, r.src = t;
|
|
20
|
-
});
|
|
88
|
+
r[o] = s * 16 + a;
|
|
21
89
|
}
|
|
90
|
+
return r;
|
|
22
91
|
}
|
|
23
|
-
function
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
92
|
+
function m(t) {
|
|
93
|
+
if (typeof t != "string")
|
|
94
|
+
throw new Error("string expected");
|
|
95
|
+
return new Uint8Array(new TextEncoder().encode(t));
|
|
96
|
+
}
|
|
97
|
+
function b(t) {
|
|
98
|
+
return typeof t == "string" && (t = m(t)), c(t), t;
|
|
99
|
+
}
|
|
100
|
+
function R(...t) {
|
|
101
|
+
let e = 0;
|
|
102
|
+
for (let r = 0; r < t.length; r++) {
|
|
103
|
+
const o = t[r];
|
|
104
|
+
c(o), e += o.length;
|
|
34
105
|
}
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
isEncoded: !1
|
|
40
|
-
};
|
|
41
|
-
if (o === "ar:/" && s)
|
|
42
|
-
return {
|
|
43
|
-
uri: `${a}/${s}${m || ""}`,
|
|
44
|
-
isOnChain: !1,
|
|
45
|
-
isEncoded: !1
|
|
46
|
-
};
|
|
47
|
-
let c = t.replace(C, "");
|
|
48
|
-
if (c.startsWith("<svg") && (c = `data:image/svg+xml;base64,${btoa(c)}`), c.startsWith("data:") || c.startsWith("{"))
|
|
49
|
-
return {
|
|
50
|
-
uri: c,
|
|
51
|
-
isOnChain: !0,
|
|
52
|
-
isEncoded: !1
|
|
53
|
-
};
|
|
54
|
-
throw new d({ uri: t });
|
|
55
|
-
}
|
|
56
|
-
function R(t) {
|
|
57
|
-
if (typeof t != "object" || !("image" in t) && !("image_url" in t) && !("image_data" in t))
|
|
58
|
-
throw new A({ data: t });
|
|
59
|
-
return t.image || t.image_url || t.image_data;
|
|
60
|
-
}
|
|
61
|
-
async function O({ gatewayUrls: t, uri: e }) {
|
|
62
|
-
try {
|
|
63
|
-
const n = await fetch(e).then((a) => a.json());
|
|
64
|
-
return await _({
|
|
65
|
-
gatewayUrls: t,
|
|
66
|
-
uri: R(n)
|
|
67
|
-
});
|
|
68
|
-
} catch {
|
|
69
|
-
throw new d({ uri: e });
|
|
106
|
+
const n = new Uint8Array(e);
|
|
107
|
+
for (let r = 0, o = 0; r < t.length; r++) {
|
|
108
|
+
const i = t[r];
|
|
109
|
+
n.set(i, o), o += i.length;
|
|
70
110
|
}
|
|
111
|
+
return n;
|
|
112
|
+
}
|
|
113
|
+
class F {
|
|
114
|
+
}
|
|
115
|
+
function O(t) {
|
|
116
|
+
const e = (r) => t().update(b(r)).digest(), n = t();
|
|
117
|
+
return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
|
|
71
118
|
}
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
function z(t) {
|
|
79
|
-
let e = t;
|
|
80
|
-
e.startsWith("did:nft:") && (e = e.replace("did:nft:", "").replace(/_/g, "/"));
|
|
81
|
-
const [n, r, a] = e.split("/"), [i, o] = n.split(":"), [p, s] = r.split(":");
|
|
82
|
-
if (!i || i.toLowerCase() !== "eip155")
|
|
83
|
-
throw new f({ reason: "Only EIP-155 supported" });
|
|
84
|
-
if (!o)
|
|
85
|
-
throw new f({ reason: "Chain ID not found" });
|
|
86
|
-
if (!s)
|
|
87
|
-
throw new f({
|
|
88
|
-
reason: "Contract address not found"
|
|
89
|
-
});
|
|
90
|
-
if (!a)
|
|
91
|
-
throw new f({ reason: "Token ID not found" });
|
|
92
|
-
if (!p)
|
|
93
|
-
throw new f({ reason: "ERC namespace not found" });
|
|
94
|
-
return {
|
|
95
|
-
chainID: Number.parseInt(o),
|
|
96
|
-
namespace: p.toLowerCase(),
|
|
97
|
-
contractAddress: s,
|
|
98
|
-
tokenID: a
|
|
99
|
-
};
|
|
100
|
-
}
|
|
101
|
-
async function P(t, { nft: e }) {
|
|
102
|
-
if (e.namespace === "erc721")
|
|
103
|
-
return g(t, {
|
|
104
|
-
address: e.contractAddress,
|
|
105
|
-
abi: [
|
|
106
|
-
{
|
|
107
|
-
name: "tokenURI",
|
|
108
|
-
type: "function",
|
|
109
|
-
stateMutability: "view",
|
|
110
|
-
inputs: [{ name: "tokenId", type: "uint256" }],
|
|
111
|
-
outputs: [{ name: "", type: "string" }]
|
|
112
|
-
}
|
|
113
|
-
],
|
|
114
|
-
functionName: "tokenURI",
|
|
115
|
-
args: [BigInt(e.tokenID)]
|
|
116
|
-
});
|
|
117
|
-
if (e.namespace === "erc1155")
|
|
118
|
-
return g(t, {
|
|
119
|
-
address: e.contractAddress,
|
|
120
|
-
abi: [
|
|
121
|
-
{
|
|
122
|
-
name: "uri",
|
|
123
|
-
type: "function",
|
|
124
|
-
stateMutability: "view",
|
|
125
|
-
inputs: [{ name: "_id", type: "uint256" }],
|
|
126
|
-
outputs: [{ name: "", type: "string" }]
|
|
127
|
-
}
|
|
128
|
-
],
|
|
129
|
-
functionName: "uri",
|
|
130
|
-
args: [BigInt(e.tokenID)]
|
|
131
|
-
});
|
|
132
|
-
throw new v({ namespace: e.namespace });
|
|
119
|
+
function v(t = 32) {
|
|
120
|
+
if (u && typeof u.getRandomValues == "function")
|
|
121
|
+
return u.getRandomValues(new Uint8Array(t));
|
|
122
|
+
if (u && typeof u.randomBytes == "function")
|
|
123
|
+
return Uint8Array.from(u.randomBytes(t));
|
|
124
|
+
throw new Error("crypto.getRandomValues must be defined");
|
|
133
125
|
}
|
|
134
126
|
export {
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
127
|
+
F as Hash,
|
|
128
|
+
c as abytes,
|
|
129
|
+
B as aexists,
|
|
130
|
+
U as ahash,
|
|
131
|
+
l as anumber,
|
|
132
|
+
H as aoutput,
|
|
133
|
+
h as byteSwap,
|
|
134
|
+
x as byteSwap32,
|
|
135
|
+
k as bytesToHex,
|
|
136
|
+
V as clean,
|
|
137
|
+
R as concatBytes,
|
|
138
|
+
O as createHasher,
|
|
139
|
+
_ as createView,
|
|
140
|
+
I as hexToBytes,
|
|
141
|
+
w as isBytes,
|
|
142
|
+
d as isLE,
|
|
143
|
+
v as randomBytes,
|
|
144
|
+
S as rotr,
|
|
145
|
+
T as swap32IfBE,
|
|
146
|
+
b as toBytes,
|
|
147
|
+
L as u32,
|
|
148
|
+
m as utf8ToBytes
|
|
143
149
|
};
|