@gardenfi/utils 3.1.1-beta.1 → 3.1.1-beta.11
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index10.cjs +1 -1
- package/dist/index10.js +4 -4
- package/dist/index17.cjs +1 -1
- package/dist/index17.js +26 -16
- package/dist/index204.cjs +1 -1
- package/dist/index204.js +1 -1
- package/dist/index205.cjs +1 -1
- package/dist/index205.js +1 -1
- package/dist/index217.cjs +1 -1
- package/dist/index217.js +101 -212
- package/dist/index218.cjs +1 -1
- package/dist/index218.js +16 -108
- package/dist/index219.cjs +1 -1
- package/dist/index219.js +206 -198
- package/dist/index220.cjs +1 -1
- package/dist/index220.js +106 -101
- package/dist/index221.cjs +1 -1
- package/dist/index221.js +203 -13
- package/dist/index222.cjs +1 -1
- package/dist/index222.js +1 -1
- package/dist/index223.cjs +1 -1
- package/dist/index223.js +1 -1
- package/dist/index23.cjs +1 -1
- package/dist/index23.js +12 -26
- package/dist/index24.cjs +1 -1
- package/dist/index24.js +59 -8
- package/dist/index25.cjs +16 -1
- package/dist/index25.js +113 -12
- package/dist/index250.cjs +1 -1
- package/dist/index250.js +2 -2
- package/dist/index251.cjs +1 -1
- package/dist/index251.js +2 -2
- package/dist/index26.cjs +1 -1
- package/dist/index26.js +30 -59
- package/dist/index27.cjs +1 -16
- package/dist/index27.js +27 -111
- package/dist/index28.cjs +1 -1
- package/dist/index28.js +7 -29
- package/dist/index30.cjs +1 -1
- package/dist/index30.js +3 -3
- package/dist/src/lib/fetcher/fetcher.d.ts +1 -0
- package/dist/src/lib/retry.d.ts +3 -1
- package/package.json +1 -1
package/dist/index220.js
CHANGED
|
@@ -1,106 +1,111 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
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;
|
|
87
|
-
}
|
|
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);
|
|
1
|
+
import { crypto as o } from "./index224.js";
|
|
2
|
+
/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
3
|
+
function s(e) {
|
|
4
|
+
return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
|
|
5
|
+
}
|
|
6
|
+
function c(e) {
|
|
7
|
+
if (!Number.isSafeInteger(e) || e < 0)
|
|
8
|
+
throw new Error("positive integer expected, got " + e);
|
|
9
|
+
}
|
|
10
|
+
function i(e, ...t) {
|
|
11
|
+
if (!s(e))
|
|
12
|
+
throw new Error("Uint8Array expected");
|
|
13
|
+
if (t.length > 0 && !t.includes(e.length))
|
|
14
|
+
throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
|
|
15
|
+
}
|
|
16
|
+
function g(e) {
|
|
17
|
+
if (typeof e != "function" || typeof e.create != "function")
|
|
18
|
+
throw new Error("Hash should be wrapped by utils.createHasher");
|
|
19
|
+
c(e.outputLen), c(e.blockLen);
|
|
20
|
+
}
|
|
21
|
+
function d(e, t = !0) {
|
|
22
|
+
if (e.destroyed)
|
|
23
|
+
throw new Error("Hash instance has been destroyed");
|
|
24
|
+
if (t && e.finished)
|
|
25
|
+
throw new Error("Hash#digest() has already been called");
|
|
26
|
+
}
|
|
27
|
+
function b(e, t) {
|
|
28
|
+
i(e);
|
|
29
|
+
const r = t.outputLen;
|
|
30
|
+
if (e.length < r)
|
|
31
|
+
throw new Error("digestInto() expects output buffer of length at least " + r);
|
|
32
|
+
}
|
|
33
|
+
function m(e) {
|
|
34
|
+
return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
|
|
35
|
+
}
|
|
36
|
+
function x(...e) {
|
|
37
|
+
for (let t = 0; t < e.length; t++)
|
|
38
|
+
e[t].fill(0);
|
|
39
|
+
}
|
|
40
|
+
function A(e) {
|
|
41
|
+
return new DataView(e.buffer, e.byteOffset, e.byteLength);
|
|
42
|
+
}
|
|
43
|
+
function E(e, t) {
|
|
44
|
+
return e << 32 - t | e >>> t;
|
|
45
|
+
}
|
|
46
|
+
const a = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
|
|
47
|
+
function l(e) {
|
|
48
|
+
return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
|
|
49
|
+
}
|
|
50
|
+
function y(e) {
|
|
51
|
+
for (let t = 0; t < e.length; t++)
|
|
52
|
+
e[t] = l(e[t]);
|
|
53
|
+
return e;
|
|
54
|
+
}
|
|
55
|
+
const U = a ? (e) => e : y;
|
|
56
|
+
function p(e) {
|
|
57
|
+
if (typeof e != "string")
|
|
58
|
+
throw new Error("string expected");
|
|
59
|
+
return new Uint8Array(new TextEncoder().encode(e));
|
|
60
|
+
}
|
|
61
|
+
function w(e) {
|
|
62
|
+
return typeof e == "string" && (e = p(e)), i(e), e;
|
|
63
|
+
}
|
|
64
|
+
function B(...e) {
|
|
65
|
+
let t = 0;
|
|
66
|
+
for (let n = 0; n < e.length; n++) {
|
|
67
|
+
const f = e[n];
|
|
68
|
+
i(f), t += f.length;
|
|
97
69
|
}
|
|
98
|
-
|
|
99
|
-
|
|
70
|
+
const r = new Uint8Array(t);
|
|
71
|
+
for (let n = 0, f = 0; n < e.length; n++) {
|
|
72
|
+
const u = e[n];
|
|
73
|
+
r.set(u, f), f += u.length;
|
|
100
74
|
}
|
|
75
|
+
return r;
|
|
76
|
+
}
|
|
77
|
+
class L {
|
|
78
|
+
}
|
|
79
|
+
function H(e) {
|
|
80
|
+
const t = (n) => e().update(w(n)).digest(), r = e();
|
|
81
|
+
return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
|
|
82
|
+
}
|
|
83
|
+
function V(e = 32) {
|
|
84
|
+
if (o && typeof o.getRandomValues == "function")
|
|
85
|
+
return o.getRandomValues(new Uint8Array(e));
|
|
86
|
+
if (o && typeof o.randomBytes == "function")
|
|
87
|
+
return Uint8Array.from(o.randomBytes(e));
|
|
88
|
+
throw new Error("crypto.getRandomValues must be defined");
|
|
101
89
|
}
|
|
102
|
-
const y = /* @__PURE__ */ u(() => new E());
|
|
103
90
|
export {
|
|
104
|
-
|
|
105
|
-
|
|
91
|
+
L as Hash,
|
|
92
|
+
i as abytes,
|
|
93
|
+
d as aexists,
|
|
94
|
+
g as ahash,
|
|
95
|
+
c as anumber,
|
|
96
|
+
b as aoutput,
|
|
97
|
+
l as byteSwap,
|
|
98
|
+
y as byteSwap32,
|
|
99
|
+
x as clean,
|
|
100
|
+
B as concatBytes,
|
|
101
|
+
H as createHasher,
|
|
102
|
+
A as createView,
|
|
103
|
+
s as isBytes,
|
|
104
|
+
a as isLE,
|
|
105
|
+
V as randomBytes,
|
|
106
|
+
E as rotr,
|
|
107
|
+
U as swap32IfBE,
|
|
108
|
+
w as toBytes,
|
|
109
|
+
m as u32,
|
|
110
|
+
p as utf8ToBytes
|
|
106
111
|
};
|
package/dist/index221.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"})
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const w=BigInt(0),m=BigInt(1);function y(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function d(t){if(!y(t))throw new Error("Uint8Array expected")}function I(t,e){if(typeof e!="boolean")throw new Error(t+" boolean expected, got "+e)}function N(t){const e=t.toString(16);return e.length&1?"0"+e:e}function h(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?w:BigInt("0x"+t)}const U=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",_=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function E(t){if(d(t),U)return t.toHex();let e="";for(let r=0;r<t.length;r++)e+=_[t[r]];return e}const u={_0:48,_9:57,A:65,F:70,a:97,f:102};function B(t){if(t>=u._0&&t<=u._9)return t-u._0;if(t>=u.A&&t<=u.F)return t-(u.A-10);if(t>=u.a&&t<=u.f)return t-(u.a-10)}function A(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(U)return Uint8Array.fromHex(t);const e=t.length,r=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const n=new Uint8Array(r);for(let o=0,i=0;o<r;o++,i+=2){const a=B(t.charCodeAt(i)),f=B(t.charCodeAt(i+1));if(a===void 0||f===void 0){const c=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+c+'" at index '+i)}n[o]=a*16+f}return n}function k(t){return h(E(t))}function O(t){return d(t),h(E(Uint8Array.from(t).reverse()))}function T(t,e){return A(t.toString(16).padStart(e*2,"0"))}function F(t,e){return T(t,e).reverse()}function M(t,e,r){let n;if(typeof e=="string")try{n=A(e)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else if(y(e))n=Uint8Array.from(e);else throw new Error(t+" must be hex string or Uint8Array");const o=n.length;if(typeof r=="number"&&o!==r)throw new Error(t+" of length "+r+" expected, got "+o);return n}function v(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];d(o),e+=o.length}const r=new Uint8Array(e);for(let n=0,o=0;n<t.length;n++){const i=t[n];r.set(i,o),o+=i.length}return r}const b=t=>typeof t=="bigint"&&w<=t;function H(t,e,r){return b(t)&&b(e)&&b(r)&&e<=t&&t<r}function R(t,e,r,n){if(!H(e,r,n))throw new Error("expected valid "+t+": "+r+" <= n < "+n+", got "+e)}function j(t){let e;for(e=0;t>w;t>>=m,e+=1);return e}const V=t=>(m<<BigInt(t))-m,p=t=>new Uint8Array(t),x=t=>Uint8Array.from(t);function z(t,e,r){if(typeof t!="number"||t<2)throw new Error("hashLen must be a number");if(typeof e!="number"||e<2)throw new Error("qByteLen must be a number");if(typeof r!="function")throw new Error("hmacFn must be a function");let n=p(t),o=p(t),i=0;const a=()=>{n.fill(1),o.fill(0),i=0},f=(...s)=>r(o,n,...s),c=(s=p(0))=>{o=f(x([0]),s),n=f(),s.length!==0&&(o=f(x([1]),s),n=f())},S=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let s=0;const l=[];for(;s<e;){n=f();const g=n.slice();l.push(g),s+=n.length}return v(...l)};return(s,l)=>{a(),c(s);let g;for(;!(g=l(S()));)c();return a(),g}}const C={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",stringOrUint8Array:t=>typeof t=="string"||y(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,e)=>e.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function D(t,e,r={}){const n=(o,i,a)=>{const f=C[i];if(typeof f!="function")throw new Error("invalid validator function");const c=t[o];if(!(a&&c===void 0)&&!f(c,t))throw new Error("param "+String(o)+" is invalid. Expected "+i+", got "+c)};for(const[o,i]of Object.entries(e))n(o,i,!1);for(const[o,i]of Object.entries(r))n(o,i,!0);return t}function L(t){const e=new WeakMap;return(r,...n)=>{const o=e.get(r);if(o!==void 0)return o;const i=t(r,...n);return e.set(r,i),i}}exports.aInRange=R;exports.abool=I;exports.abytes=d;exports.bitLen=j;exports.bitMask=V;exports.bytesToHex=E;exports.bytesToNumberBE=k;exports.bytesToNumberLE=O;exports.concatBytes=v;exports.createHmacDrbg=z;exports.ensureBytes=M;exports.hexToBytes=A;exports.hexToNumber=h;exports.inRange=H;exports.isBytes=y;exports.memoized=L;exports.numberToBytesBE=T;exports.numberToBytesLE=F;exports.numberToHexUnpadded=N;exports.validateObject=D;
|
package/dist/index221.js
CHANGED
|
@@ -1,19 +1,209 @@
|
|
|
1
|
-
import { hmac as c } from "./index222.js";
|
|
2
|
-
import { randomBytes as m, concatBytes as n } from "./index218.js";
|
|
3
|
-
import { weierstrass as a } from "./index250.js";
|
|
4
1
|
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
2
|
+
const w = /* @__PURE__ */ BigInt(0), p = /* @__PURE__ */ BigInt(1);
|
|
3
|
+
function b(t) {
|
|
4
|
+
return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
|
|
5
|
+
}
|
|
6
|
+
function h(t) {
|
|
7
|
+
if (!b(t))
|
|
8
|
+
throw new Error("Uint8Array expected");
|
|
9
|
+
}
|
|
10
|
+
function k(t, n) {
|
|
11
|
+
if (typeof n != "boolean")
|
|
12
|
+
throw new Error(t + " boolean expected, got " + n);
|
|
13
|
+
}
|
|
14
|
+
function F(t) {
|
|
15
|
+
const n = t.toString(16);
|
|
16
|
+
return n.length & 1 ? "0" + n : n;
|
|
17
|
+
}
|
|
18
|
+
function E(t) {
|
|
19
|
+
if (typeof t != "string")
|
|
20
|
+
throw new Error("hex string expected, got " + typeof t);
|
|
21
|
+
return t === "" ? w : BigInt("0x" + t);
|
|
22
|
+
}
|
|
23
|
+
const U = (
|
|
24
|
+
// @ts-ignore
|
|
25
|
+
typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function"
|
|
26
|
+
), S = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
|
|
27
|
+
function x(t) {
|
|
28
|
+
if (h(t), U)
|
|
29
|
+
return t.toHex();
|
|
30
|
+
let n = "";
|
|
31
|
+
for (let e = 0; e < t.length; e++)
|
|
32
|
+
n += S[t[e]];
|
|
33
|
+
return n;
|
|
34
|
+
}
|
|
35
|
+
const u = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
|
|
36
|
+
function m(t) {
|
|
37
|
+
if (t >= u._0 && t <= u._9)
|
|
38
|
+
return t - u._0;
|
|
39
|
+
if (t >= u.A && t <= u.F)
|
|
40
|
+
return t - (u.A - 10);
|
|
41
|
+
if (t >= u.a && t <= u.f)
|
|
42
|
+
return t - (u.a - 10);
|
|
43
|
+
}
|
|
44
|
+
function B(t) {
|
|
45
|
+
if (typeof t != "string")
|
|
46
|
+
throw new Error("hex string expected, got " + typeof t);
|
|
47
|
+
if (U)
|
|
48
|
+
return Uint8Array.fromHex(t);
|
|
49
|
+
const n = t.length, e = n / 2;
|
|
50
|
+
if (n % 2)
|
|
51
|
+
throw new Error("hex string expected, got unpadded hex of length " + n);
|
|
52
|
+
const r = new Uint8Array(e);
|
|
53
|
+
for (let o = 0, i = 0; o < e; o++, i += 2) {
|
|
54
|
+
const a = m(t.charCodeAt(i)), f = m(t.charCodeAt(i + 1));
|
|
55
|
+
if (a === void 0 || f === void 0) {
|
|
56
|
+
const c = t[i] + t[i + 1];
|
|
57
|
+
throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
|
|
58
|
+
}
|
|
59
|
+
r[o] = a * 16 + f;
|
|
60
|
+
}
|
|
61
|
+
return r;
|
|
62
|
+
}
|
|
63
|
+
function O(t) {
|
|
64
|
+
return E(x(t));
|
|
65
|
+
}
|
|
66
|
+
function V(t) {
|
|
67
|
+
return h(t), E(x(Uint8Array.from(t).reverse()));
|
|
68
|
+
}
|
|
69
|
+
function T(t, n) {
|
|
70
|
+
return B(t.toString(16).padStart(n * 2, "0"));
|
|
71
|
+
}
|
|
72
|
+
function C(t, n) {
|
|
73
|
+
return T(t, n).reverse();
|
|
74
|
+
}
|
|
75
|
+
function M(t, n, e) {
|
|
76
|
+
let r;
|
|
77
|
+
if (typeof n == "string")
|
|
78
|
+
try {
|
|
79
|
+
r = B(n);
|
|
80
|
+
} catch (i) {
|
|
81
|
+
throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
|
|
82
|
+
}
|
|
83
|
+
else if (b(n))
|
|
84
|
+
r = Uint8Array.from(n);
|
|
85
|
+
else
|
|
86
|
+
throw new Error(t + " must be hex string or Uint8Array");
|
|
87
|
+
const o = r.length;
|
|
88
|
+
if (typeof e == "number" && o !== e)
|
|
89
|
+
throw new Error(t + " of length " + e + " expected, got " + o);
|
|
90
|
+
return r;
|
|
91
|
+
}
|
|
92
|
+
function H(...t) {
|
|
93
|
+
let n = 0;
|
|
94
|
+
for (let r = 0; r < t.length; r++) {
|
|
95
|
+
const o = t[r];
|
|
96
|
+
h(o), n += o.length;
|
|
97
|
+
}
|
|
98
|
+
const e = new Uint8Array(n);
|
|
99
|
+
for (let r = 0, o = 0; r < t.length; r++) {
|
|
100
|
+
const i = t[r];
|
|
101
|
+
e.set(i, o), o += i.length;
|
|
102
|
+
}
|
|
103
|
+
return e;
|
|
104
|
+
}
|
|
105
|
+
const y = (t) => typeof t == "bigint" && w <= t;
|
|
106
|
+
function I(t, n, e) {
|
|
107
|
+
return y(t) && y(n) && y(e) && n <= t && t < e;
|
|
108
|
+
}
|
|
109
|
+
function R(t, n, e, r) {
|
|
110
|
+
if (!I(n, e, r))
|
|
111
|
+
throw new Error("expected valid " + t + ": " + e + " <= n < " + r + ", got " + n);
|
|
112
|
+
}
|
|
113
|
+
function j(t) {
|
|
114
|
+
let n;
|
|
115
|
+
for (n = 0; t > w; t >>= p, n += 1)
|
|
116
|
+
;
|
|
117
|
+
return n;
|
|
118
|
+
}
|
|
119
|
+
const z = (t) => (p << BigInt(t)) - p, d = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
|
|
120
|
+
function D(t, n, e) {
|
|
121
|
+
if (typeof t != "number" || t < 2)
|
|
122
|
+
throw new Error("hashLen must be a number");
|
|
123
|
+
if (typeof n != "number" || n < 2)
|
|
124
|
+
throw new Error("qByteLen must be a number");
|
|
125
|
+
if (typeof e != "function")
|
|
126
|
+
throw new Error("hmacFn must be a function");
|
|
127
|
+
let r = d(t), o = d(t), i = 0;
|
|
128
|
+
const a = () => {
|
|
129
|
+
r.fill(1), o.fill(0), i = 0;
|
|
130
|
+
}, f = (...s) => e(o, r, ...s), c = (s = d(0)) => {
|
|
131
|
+
o = f(A([0]), s), r = f(), s.length !== 0 && (o = f(A([1]), s), r = f());
|
|
132
|
+
}, v = () => {
|
|
133
|
+
if (i++ >= 1e3)
|
|
134
|
+
throw new Error("drbg: tried 1000 values");
|
|
135
|
+
let s = 0;
|
|
136
|
+
const l = [];
|
|
137
|
+
for (; s < n; ) {
|
|
138
|
+
r = f();
|
|
139
|
+
const g = r.slice();
|
|
140
|
+
l.push(g), s += r.length;
|
|
141
|
+
}
|
|
142
|
+
return H(...l);
|
|
143
|
+
};
|
|
144
|
+
return (s, l) => {
|
|
145
|
+
a(), c(s);
|
|
146
|
+
let g;
|
|
147
|
+
for (; !(g = l(v())); )
|
|
148
|
+
c();
|
|
149
|
+
return a(), g;
|
|
10
150
|
};
|
|
11
151
|
}
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
152
|
+
const _ = {
|
|
153
|
+
bigint: (t) => typeof t == "bigint",
|
|
154
|
+
function: (t) => typeof t == "function",
|
|
155
|
+
boolean: (t) => typeof t == "boolean",
|
|
156
|
+
string: (t) => typeof t == "string",
|
|
157
|
+
stringOrUint8Array: (t) => typeof t == "string" || b(t),
|
|
158
|
+
isSafeInteger: (t) => Number.isSafeInteger(t),
|
|
159
|
+
array: (t) => Array.isArray(t),
|
|
160
|
+
field: (t, n) => n.Fp.isValid(t),
|
|
161
|
+
hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
|
|
162
|
+
};
|
|
163
|
+
function P(t, n, e = {}) {
|
|
164
|
+
const r = (o, i, a) => {
|
|
165
|
+
const f = _[i];
|
|
166
|
+
if (typeof f != "function")
|
|
167
|
+
throw new Error("invalid validator function");
|
|
168
|
+
const c = t[o];
|
|
169
|
+
if (!(a && c === void 0) && !f(c, t))
|
|
170
|
+
throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
|
|
171
|
+
};
|
|
172
|
+
for (const [o, i] of Object.entries(n))
|
|
173
|
+
r(o, i, !1);
|
|
174
|
+
for (const [o, i] of Object.entries(e))
|
|
175
|
+
r(o, i, !0);
|
|
176
|
+
return t;
|
|
177
|
+
}
|
|
178
|
+
function W(t) {
|
|
179
|
+
const n = /* @__PURE__ */ new WeakMap();
|
|
180
|
+
return (e, ...r) => {
|
|
181
|
+
const o = n.get(e);
|
|
182
|
+
if (o !== void 0)
|
|
183
|
+
return o;
|
|
184
|
+
const i = t(e, ...r);
|
|
185
|
+
return n.set(e, i), i;
|
|
186
|
+
};
|
|
15
187
|
}
|
|
16
188
|
export {
|
|
17
|
-
|
|
18
|
-
|
|
189
|
+
R as aInRange,
|
|
190
|
+
k as abool,
|
|
191
|
+
h as abytes,
|
|
192
|
+
j as bitLen,
|
|
193
|
+
z as bitMask,
|
|
194
|
+
x as bytesToHex,
|
|
195
|
+
O as bytesToNumberBE,
|
|
196
|
+
V as bytesToNumberLE,
|
|
197
|
+
H as concatBytes,
|
|
198
|
+
D as createHmacDrbg,
|
|
199
|
+
M as ensureBytes,
|
|
200
|
+
B as hexToBytes,
|
|
201
|
+
E as hexToNumber,
|
|
202
|
+
I as inRange,
|
|
203
|
+
b as isBytes,
|
|
204
|
+
W as memoized,
|
|
205
|
+
T as numberToBytesBE,
|
|
206
|
+
C as numberToBytesLE,
|
|
207
|
+
F as numberToHexUnpadded,
|
|
208
|
+
P as validateObject
|
|
19
209
|
};
|
package/dist/index222.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index220.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;
|
package/dist/index222.js
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./
|
|
1
|
+
import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index220.js";
|
|
2
2
|
class r extends d {
|
|
3
3
|
constructor(t, i) {
|
|
4
4
|
super(), this.finished = !1, this.destroyed = !1, u(t);
|
package/dist/index223.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index220.cjs");function p(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function g(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class d extends f.Hash{constructor(t,s,i,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.buffer=new Uint8Array(t),this.view=f.createView(this.buffer)}update(t){f.aexists(this),t=f.toBytes(t),f.abytes(t);const{view:s,buffer:i,blockLen:n}=this,r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=f.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){f.aexists(this),f.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,f.clean(this.buffer.subarray(e)),this.padOffset>n-e&&(this.process(i,0),e=0);for(let c=e;c<n;c++)s[c]=0;p(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=f.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,a=this.get();if(l>a.length)throw new Error("_sha2: outputLen bigger than state");for(let c=0;c<l;c++)h.setUint32(4*c,a[c],r)}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:r,destroyed:e,pos:h}=this;return t.destroyed=e,t.finished=r,t.length=n,t.pos=h,n%s&&t.buffer.set(i),t}clone(){return this._cloneInto()}}const w=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);exports.Chi=g;exports.HashMD=d;exports.Maj=b;exports.SHA256_IV=w;exports.setBigUint64=p;
|
package/dist/index223.js
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./
|
|
1
|
+
import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index220.js";
|
|
2
2
|
function y(o, t, s, n) {
|
|
3
3
|
if (typeof o.setBigUint64 == "function")
|
|
4
4
|
return o.setBigUint64(t, s, n);
|
package/dist/index23.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("./index156.cjs"),c=require("./index158.cjs");function r(e){const{key:t="wallet",name:l="Wallet Client",transport:n}=e;return i.createClient({...e,key:t,name:l,transport:n,type:"walletClient"}).extend(c.walletActions)}exports.createWalletClient=r;
|
package/dist/index23.js
CHANGED
|
@@ -1,29 +1,15 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
*
|
|
13
|
-
* @param {() => Promise<T>} fn - The function to retry
|
|
14
|
-
* @return {Promise<T>} a Promise that resolves to the result of the function
|
|
15
|
-
*/
|
|
16
|
-
async retry(e) {
|
|
17
|
-
let t = 0, r;
|
|
18
|
-
for (; t < this.maxRetries + 1; )
|
|
19
|
-
try {
|
|
20
|
-
return await e();
|
|
21
|
-
} catch (a) {
|
|
22
|
-
t++, r = a, await s(this.delay * t);
|
|
23
|
-
}
|
|
24
|
-
throw r;
|
|
25
|
-
}
|
|
1
|
+
import { createClient as i } from "./index156.js";
|
|
2
|
+
import { walletActions as o } from "./index158.js";
|
|
3
|
+
function m(t) {
|
|
4
|
+
const { key: e = "wallet", name: l = "Wallet Client", transport: n } = t;
|
|
5
|
+
return i({
|
|
6
|
+
...t,
|
|
7
|
+
key: e,
|
|
8
|
+
name: l,
|
|
9
|
+
transport: n,
|
|
10
|
+
type: "walletClient"
|
|
11
|
+
}).extend(o);
|
|
26
12
|
}
|
|
27
13
|
export {
|
|
28
|
-
|
|
14
|
+
m as createWalletClient
|
|
29
15
|
};
|
package/dist/index24.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const j=require("./index161.cjs"),E=require("./index162.cjs"),H=require("./index66.cjs"),U=require("./index163.cjs"),_=require("./index159.cjs");function k(v,r={}){const{batch:o,fetchFn:l,fetchOptions:u,key:h="http",methods:q,name:d="HTTP JSON-RPC",onFetchRequest:y,onFetchResponse:f,retryDelay:R,raw:w}=r;return({chain:n,retryCount:S,timeout:m})=>{const{batchSize:C=1e3,wait:b=0}=typeof o=="object"?o:{},T=r.retryCount??S,c=m??r.timeout??1e4,e=n==null?void 0:n.rpcUrls.default.http[0];if(!e)throw new E.UrlRequiredError;const a=U.getHttpRpcClient(e,{fetchFn:l,fetchOptions:u,onRequest:y,onResponse:f,timeout:c});return _.createTransport({key:h,methods:q,name:d,async request({method:B,params:F}){const i={method:B,params:F},{schedule:O}=H.createBatchScheduler({id:e,wait:b,shouldSplitBatch(t){return t.length>C},fn:t=>a.request({body:t}),sort:(t,g)=>t.id-g.id}),P=async t=>o?O(t):[await a.request({body:t})],[{error:s,result:p}]=await P(i);if(w)return{error:s,result:p};if(s)throw new j.RpcRequestError({body:i,error:s,url:e});return p},retryCount:T,retryDelay:R,timeout:c,type:"http"},{fetchOptions:u,url:e})}}exports.http=k;
|
package/dist/index24.js
CHANGED
|
@@ -1,10 +1,61 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
};
|
|
1
|
+
import { RpcRequestError as P } from "./index161.js";
|
|
2
|
+
import { UrlRequiredError as U } from "./index162.js";
|
|
3
|
+
import { createBatchScheduler as _ } from "./index66.js";
|
|
4
|
+
import { getHttpRpcClient as j } from "./index163.js";
|
|
5
|
+
import { createTransport as k } from "./index159.js";
|
|
6
|
+
function v(x, r = {}) {
|
|
7
|
+
const { batch: o, fetchFn: h, fetchOptions: u, key: m = "http", methods: a, name: f = "HTTP JSON-RPC", onFetchRequest: y, onFetchResponse: d, retryDelay: R, raw: w } = r;
|
|
8
|
+
return ({ chain: n, retryCount: q, timeout: C }) => {
|
|
9
|
+
const { batchSize: S = 1e3, wait: b = 0 } = typeof o == "object" ? o : {}, F = r.retryCount ?? q, c = C ?? r.timeout ?? 1e4, e = n == null ? void 0 : n.rpcUrls.default.http[0];
|
|
10
|
+
if (!e)
|
|
11
|
+
throw new U();
|
|
12
|
+
const p = j(e, {
|
|
13
|
+
fetchFn: h,
|
|
14
|
+
fetchOptions: u,
|
|
15
|
+
onRequest: y,
|
|
16
|
+
onResponse: d,
|
|
17
|
+
timeout: c
|
|
18
|
+
});
|
|
19
|
+
return k({
|
|
20
|
+
key: m,
|
|
21
|
+
methods: a,
|
|
22
|
+
name: f,
|
|
23
|
+
async request({ method: T, params: B }) {
|
|
24
|
+
const i = { method: T, params: B }, { schedule: E } = _({
|
|
25
|
+
id: e,
|
|
26
|
+
wait: b,
|
|
27
|
+
shouldSplitBatch(t) {
|
|
28
|
+
return t.length > S;
|
|
29
|
+
},
|
|
30
|
+
fn: (t) => p.request({
|
|
31
|
+
body: t
|
|
32
|
+
}),
|
|
33
|
+
sort: (t, O) => t.id - O.id
|
|
34
|
+
}), H = async (t) => o ? E(t) : [
|
|
35
|
+
await p.request({
|
|
36
|
+
body: t
|
|
37
|
+
})
|
|
38
|
+
], [{ error: s, result: l }] = await H(i);
|
|
39
|
+
if (w)
|
|
40
|
+
return { error: s, result: l };
|
|
41
|
+
if (s)
|
|
42
|
+
throw new P({
|
|
43
|
+
body: i,
|
|
44
|
+
error: s,
|
|
45
|
+
url: e
|
|
46
|
+
});
|
|
47
|
+
return l;
|
|
48
|
+
},
|
|
49
|
+
retryCount: F,
|
|
50
|
+
retryDelay: R,
|
|
51
|
+
timeout: c,
|
|
52
|
+
type: "http"
|
|
53
|
+
}, {
|
|
54
|
+
fetchOptions: u,
|
|
55
|
+
url: e
|
|
56
|
+
});
|
|
57
|
+
};
|
|
58
|
+
}
|
|
8
59
|
export {
|
|
9
|
-
|
|
60
|
+
v as http
|
|
10
61
|
};
|
package/dist/index25.cjs
CHANGED
|
@@ -1 +1,16 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index248.cjs"),M=require("./index44.cjs"),h=require("./index249.cjs");function R(r){const{chainId:o,domain:s,expirationTime:l,issuedAt:m=new Date,nonce:a,notBefore:f,requestId:w,resources:g,scheme:i,uri:c,version:d}=r;{if(o!==Math.floor(o))throw new e.SiweInvalidMessageFieldError({field:"chainId",metaMessages:["- Chain ID must be a EIP-155 chain ID.","- See https://eips.ethereum.org/EIPS/eip-155","",`Provided value: ${o}`]});if(!(E.test(s)||F.test(s)||b.test(s)))throw new e.SiweInvalidMessageFieldError({field:"domain",metaMessages:["- Domain must be an RFC 3986 authority.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${s}`]});if(!A.test(a))throw new e.SiweInvalidMessageFieldError({field:"nonce",metaMessages:["- Nonce must be at least 8 characters.","- Nonce must be alphanumeric.","",`Provided value: ${a}`]});if(!h.isUri(c))throw new e.SiweInvalidMessageFieldError({field:"uri",metaMessages:["- URI must be a RFC 3986 URI referring to the resource that is the subject of the signing.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${c}`]});if(d!=="1")throw new e.SiweInvalidMessageFieldError({field:"version",metaMessages:["- Version must be '1'.","",`Provided value: ${d}`]});if(i&&!P.test(i))throw new e.SiweInvalidMessageFieldError({field:"scheme",metaMessages:["- Scheme must be an RFC 3986 URI scheme.","- See https://www.rfc-editor.org/rfc/rfc3986#section-3.1","",`Provided value: ${i}`]});const t=r.statement;if(t!=null&&t.includes(`
|
|
2
|
+
`))throw new e.SiweInvalidMessageFieldError({field:"statement",metaMessages:["- Statement must not include '\\n'.","",`Provided value: ${t}`]})}const $=M.getAddress(r.address),v=i?`${i}://${s}`:s,I=r.statement?`${r.statement}
|
|
3
|
+
`:"",S=`${v} wants you to sign in with your Ethereum account:
|
|
4
|
+
${$}
|
|
5
|
+
|
|
6
|
+
${I}`;let n=`URI: ${c}
|
|
7
|
+
Version: ${d}
|
|
8
|
+
Chain ID: ${o}
|
|
9
|
+
Nonce: ${a}
|
|
10
|
+
Issued At: ${m.toISOString()}`;if(l&&(n+=`
|
|
11
|
+
Expiration Time: ${l.toISOString()}`),f&&(n+=`
|
|
12
|
+
Not Before: ${f.toISOString()}`),w&&(n+=`
|
|
13
|
+
Request ID: ${w}`),g){let t=`
|
|
14
|
+
Resources:`;for(const u of g){if(!h.isUri(u))throw new e.SiweInvalidMessageFieldError({field:"resources",metaMessages:["- Every resource must be a RFC 3986 URI.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${u}`]});t+=`
|
|
15
|
+
- ${u}`}n+=t}return`${S}
|
|
16
|
+
${n}`}const E=/^([a-zA-Z0-9]([a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?\.)+[a-zA-Z]{2,}(:[0-9]{1,5})?$/,F=/^(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)(:[0-9]{1,5})?$/,b=/^localhost(:[0-9]{1,5})?$/,A=/^[a-zA-Z0-9]{8,}$/,P=/^([a-zA-Z][a-zA-Z0-9+-.]*)$/;exports.createSiweMessage=R;
|