@gardenfi/utils 2.1.2-beta.10 → 2.1.2-beta.12
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 +20 -21
- package/dist/index114.cjs +1 -1
- package/dist/index114.js +2 -2
- package/dist/index118.cjs +1 -1
- package/dist/index118.js +3 -3
- package/dist/index119.cjs +1 -1
- package/dist/index119.js +3 -3
- package/dist/index185.cjs +1 -1
- package/dist/index185.js +2 -2
- package/dist/index187.cjs +1 -1
- package/dist/index187.js +1 -1
- package/dist/index25.cjs +1 -1
- package/dist/index25.js +2 -2
- package/dist/index260.cjs +1 -1
- package/dist/index260.js +98 -140
- package/dist/index261.cjs +2 -1
- package/dist/index261.js +134 -9
- package/dist/index262.cjs +1 -1
- package/dist/index262.js +140 -98
- package/dist/index263.cjs +1 -2
- package/dist/index263.js +9 -134
- package/dist/index280.cjs +2 -1
- package/dist/index280.js +18 -11
- package/dist/index281.cjs +1 -2
- package/dist/index281.js +13 -18
- package/dist/index282.cjs +1 -1
- package/dist/index282.js +11 -13
- package/dist/index292.cjs +1 -1
- package/dist/index292.js +11 -28
- package/dist/index293.cjs +1 -1
- package/dist/index293.js +18 -37
- package/dist/index294.cjs +1 -1
- package/dist/index294.js +28 -11
- package/dist/index295.cjs +1 -1
- package/dist/index295.js +37 -18
- package/dist/index296.cjs +1 -1
- package/dist/index296.js +1 -1
- package/dist/index297.cjs +1 -1
- package/dist/index297.js +7 -4
- package/dist/index298.cjs +1 -1
- package/dist/index298.js +60 -38
- package/dist/index299.cjs +1 -1
- package/dist/index299.js +77 -7
- package/dist/index300.cjs +1 -1
- package/dist/index300.js +4 -63
- package/dist/index301.cjs +1 -1
- package/dist/index301.js +181 -64
- package/dist/index302.cjs +1 -1
- package/dist/index302.js +5 -4
- package/dist/index303.cjs +1 -1
- package/dist/index303.js +40 -194
- package/dist/index311.cjs +1 -1
- package/dist/index311.js +4 -63
- package/dist/index312.cjs +1 -1
- package/dist/index312.js +102 -42
- package/dist/index313.cjs +1 -1
- package/dist/index313.js +63 -4
- package/dist/index314.cjs +1 -1
- package/dist/index314.js +5 -105
- package/dist/index315.cjs +1 -1
- package/dist/index315.js +45 -5
- package/dist/index5.cjs +1 -1
- package/dist/index5.js +19 -47
- package/dist/src/lib/digestKey/digestKey.d.ts +4 -2
- package/dist/src/lib/result.d.ts +13 -9
- package/package.json +1 -1
package/dist/index311.js
CHANGED
|
@@ -1,66 +1,7 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
import { assertSize as p } from "./index298.js";
|
|
5
|
-
const l = /* @__PURE__ */ new TextEncoder();
|
|
6
|
-
function E(e) {
|
|
7
|
-
return e instanceof Uint8Array ? e : typeof e == "string" ? y(e) : z(e);
|
|
8
|
-
}
|
|
9
|
-
function z(e) {
|
|
10
|
-
return e instanceof Uint8Array ? e : new Uint8Array(e);
|
|
11
|
-
}
|
|
12
|
-
function y(e, t = {}) {
|
|
13
|
-
const { size: r } = t;
|
|
14
|
-
let n = e;
|
|
15
|
-
r && (p(e, r), n = h(e, r));
|
|
16
|
-
let i = n.slice(2);
|
|
17
|
-
i.length % 2 && (i = `0${i}`);
|
|
18
|
-
const f = i.length / 2, a = new Uint8Array(f);
|
|
19
|
-
for (let s = 0, o = 0; s < f; s++) {
|
|
20
|
-
const d = b(i.charCodeAt(o++)), u = b(i.charCodeAt(o++));
|
|
21
|
-
if (d === void 0 || u === void 0)
|
|
22
|
-
throw new c(`Invalid byte sequence ("${i[o - 2]}${i[o - 1]}" in "${i}").`);
|
|
23
|
-
a[s] = d * 16 + u;
|
|
24
|
-
}
|
|
25
|
-
return a;
|
|
26
|
-
}
|
|
27
|
-
function C(e, t = {}) {
|
|
28
|
-
const { size: r } = t, n = l.encode(e);
|
|
29
|
-
return typeof r == "number" ? (g(n, r), x(n, r)) : n;
|
|
30
|
-
}
|
|
31
|
-
function x(e, t) {
|
|
32
|
-
return m(e, { dir: "right", size: t });
|
|
33
|
-
}
|
|
34
|
-
function U(e) {
|
|
35
|
-
return e.length;
|
|
36
|
-
}
|
|
37
|
-
class B extends c {
|
|
38
|
-
constructor({ givenSize: t, maxSize: r }) {
|
|
39
|
-
super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`), Object.defineProperty(this, "name", {
|
|
40
|
-
enumerable: !0,
|
|
41
|
-
configurable: !0,
|
|
42
|
-
writable: !0,
|
|
43
|
-
value: "Bytes.SizeOverflowError"
|
|
44
|
-
});
|
|
45
|
-
}
|
|
46
|
-
}
|
|
47
|
-
class O extends c {
|
|
48
|
-
constructor({ size: t, targetSize: r, type: n }) {
|
|
49
|
-
super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
|
|
50
|
-
enumerable: !0,
|
|
51
|
-
configurable: !0,
|
|
52
|
-
writable: !0,
|
|
53
|
-
value: "Bytes.SizeExceedsPaddingSizeError"
|
|
54
|
-
});
|
|
55
|
-
}
|
|
1
|
+
import { version as r } from "./index316.js";
|
|
2
|
+
function e() {
|
|
3
|
+
return r;
|
|
56
4
|
}
|
|
57
5
|
export {
|
|
58
|
-
|
|
59
|
-
B as SizeOverflowError,
|
|
60
|
-
E as from,
|
|
61
|
-
z as fromArray,
|
|
62
|
-
y as fromHex,
|
|
63
|
-
C as fromString,
|
|
64
|
-
x as padRight,
|
|
65
|
-
U as size
|
|
6
|
+
e as getVersion
|
|
66
7
|
};
|
package/dist/index312.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 l=require("./index294.cjs"),f=require("./index310.cjs"),c=require("./index295.cjs"),I=[],O=[],w=[],B=BigInt(0),a=BigInt(1),A=BigInt(2),S=BigInt(7),H=BigInt(256),T=BigInt(113);for(let i=0,t=a,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<<a^(t>>S)*T)%H,t&A&&(o^=a<<(a<<BigInt(r))-a);w.push(o)}const[m,E]=f.split(w,!0),y=(i,t,s)=>s>32?f.rotlBH(i,t,s):f.rotlSH(i,t,s),b=(i,t,s)=>s>32?f.rotlBL(i,t,s):f.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.anumber(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.aexists(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.aexists(this,!1),l.abytes(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.anumber(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(l.aoutput(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/index312.js
CHANGED
|
@@ -1,47 +1,107 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
1
|
+
import { anumber as d, aexists as k, abytes as B, aoutput as A } from "./index294.js";
|
|
2
|
+
import { rotlSH as H, rotlSL as m, rotlBH as S, rotlBL as T, split as F } from "./index310.js";
|
|
3
|
+
import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index295.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);
|
|
8
11
|
}
|
|
9
|
-
const
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
12
|
+
const [v, z] = /* @__PURE__ */ F(b, !0), O = (e, t, s) => s > 32 ? S(e, t, s) : H(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : m(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);
|
|
24
37
|
}
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
const
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
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
|
+
}
|
|
41
101
|
}
|
|
102
|
+
const G = (e, t, s) => X(() => new p(t, e, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
|
|
42
103
|
export {
|
|
43
|
-
p as
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
S as pad
|
|
104
|
+
p as Keccak,
|
|
105
|
+
D as keccakP,
|
|
106
|
+
Q as keccak_256
|
|
47
107
|
};
|
package/dist/index313.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 a=require("./index296.cjs"),y=require("./index262.cjs"),s=require("./index315.cjs"),z=require("./index303.cjs"),S=new TextEncoder;function x(e){return e instanceof Uint8Array?e:typeof e=="string"?h(e):g(e)}function g(e){return e instanceof Uint8Array?e:new Uint8Array(e)}function h(e,t={}){const{size:r}=t;let n=e;r&&(z.assertSize(e,r),n=y.padRight(e,r));let i=n.slice(2);i.length%2&&(i=`0${i}`);const d=i.length/2,f=new Uint8Array(d);for(let c=0,o=0;c<d;c++){const u=s.charCodeToBase16(i.charCodeAt(o++)),b=s.charCodeToBase16(i.charCodeAt(o++));if(u===void 0||b===void 0)throw new a.BaseError(`Invalid byte sequence ("${i[o-2]}${i[o-1]}" in "${i}").`);f[c]=u*16+b}return f}function m(e,t={}){const{size:r}=t,n=S.encode(e);return typeof r=="number"?(s.assertSize(n,r),l(n,r)):n}function l(e,t){return s.pad(e,{dir:"right",size:t})}function E(e){return e.length}class p extends a.BaseError{constructor({givenSize:t,maxSize:r}){super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeOverflowError"})}}class $ extends a.BaseError{constructor({size:t,targetSize:r,type:n}){super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=$;exports.SizeOverflowError=p;exports.from=x;exports.fromArray=g;exports.fromHex=h;exports.fromString=m;exports.padRight=l;exports.size=E;
|
package/dist/index313.js
CHANGED
|
@@ -1,7 +1,66 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
1
|
+
import { BaseError as c } from "./index296.js";
|
|
2
|
+
import { padRight as h } from "./index262.js";
|
|
3
|
+
import { charCodeToBase16 as b, assertSize as g, pad as m } from "./index315.js";
|
|
4
|
+
import { assertSize as p } from "./index303.js";
|
|
5
|
+
const l = /* @__PURE__ */ new TextEncoder();
|
|
6
|
+
function E(e) {
|
|
7
|
+
return e instanceof Uint8Array ? e : typeof e == "string" ? y(e) : z(e);
|
|
8
|
+
}
|
|
9
|
+
function z(e) {
|
|
10
|
+
return e instanceof Uint8Array ? e : new Uint8Array(e);
|
|
11
|
+
}
|
|
12
|
+
function y(e, t = {}) {
|
|
13
|
+
const { size: r } = t;
|
|
14
|
+
let n = e;
|
|
15
|
+
r && (p(e, r), n = h(e, r));
|
|
16
|
+
let i = n.slice(2);
|
|
17
|
+
i.length % 2 && (i = `0${i}`);
|
|
18
|
+
const f = i.length / 2, a = new Uint8Array(f);
|
|
19
|
+
for (let s = 0, o = 0; s < f; s++) {
|
|
20
|
+
const d = b(i.charCodeAt(o++)), u = b(i.charCodeAt(o++));
|
|
21
|
+
if (d === void 0 || u === void 0)
|
|
22
|
+
throw new c(`Invalid byte sequence ("${i[o - 2]}${i[o - 1]}" in "${i}").`);
|
|
23
|
+
a[s] = d * 16 + u;
|
|
24
|
+
}
|
|
25
|
+
return a;
|
|
26
|
+
}
|
|
27
|
+
function C(e, t = {}) {
|
|
28
|
+
const { size: r } = t, n = l.encode(e);
|
|
29
|
+
return typeof r == "number" ? (g(n, r), x(n, r)) : n;
|
|
30
|
+
}
|
|
31
|
+
function x(e, t) {
|
|
32
|
+
return m(e, { dir: "right", size: t });
|
|
33
|
+
}
|
|
34
|
+
function U(e) {
|
|
35
|
+
return e.length;
|
|
36
|
+
}
|
|
37
|
+
class B extends c {
|
|
38
|
+
constructor({ givenSize: t, maxSize: r }) {
|
|
39
|
+
super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`), Object.defineProperty(this, "name", {
|
|
40
|
+
enumerable: !0,
|
|
41
|
+
configurable: !0,
|
|
42
|
+
writable: !0,
|
|
43
|
+
value: "Bytes.SizeOverflowError"
|
|
44
|
+
});
|
|
45
|
+
}
|
|
46
|
+
}
|
|
47
|
+
class O extends c {
|
|
48
|
+
constructor({ size: t, targetSize: r, type: n }) {
|
|
49
|
+
super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
|
|
50
|
+
enumerable: !0,
|
|
51
|
+
configurable: !0,
|
|
52
|
+
writable: !0,
|
|
53
|
+
value: "Bytes.SizeExceedsPaddingSizeError"
|
|
54
|
+
});
|
|
55
|
+
}
|
|
4
56
|
}
|
|
5
57
|
export {
|
|
6
|
-
|
|
58
|
+
O as SizeExceedsPaddingSizeError,
|
|
59
|
+
B as SizeOverflowError,
|
|
60
|
+
E as from,
|
|
61
|
+
z as fromArray,
|
|
62
|
+
y as fromHex,
|
|
63
|
+
C as fromString,
|
|
64
|
+
x as padRight,
|
|
65
|
+
U as size
|
|
7
66
|
};
|
package/dist/index314.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 c=require("./index317.cjs"),e={checksum:new c.LruMap(8192)},s=e.checksum;exports.checksum=s;
|
package/dist/index314.js
CHANGED
|
@@ -1,107 +1,7 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
for (let e = 0, t = f, s = 1, n = 0; e < 24; e++) {
|
|
6
|
-
[s, n] = [n, (2 * s + 3 * n) % 5], y.push(2 * (5 * n + s)), L.push((e + 1) * (e + 2) / 2 % 64);
|
|
7
|
-
let o = M;
|
|
8
|
-
for (let r = 0; r < 7; r++)
|
|
9
|
-
t = (t << f ^ (t >> j) * q) % C, t & R && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
|
|
10
|
-
b.push(o);
|
|
11
|
-
}
|
|
12
|
-
const [v, z] = /* @__PURE__ */ F(b, !0), O = (e, t, s) => s > 32 ? S(e, t, s) : H(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : m(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);
|
|
1
|
+
import { LruMap as c } from "./index317.js";
|
|
2
|
+
const e = {
|
|
3
|
+
checksum: /* @__PURE__ */ new c(8192)
|
|
4
|
+
}, m = e.checksum;
|
|
103
5
|
export {
|
|
104
|
-
|
|
105
|
-
D as keccakP,
|
|
106
|
-
Q as keccak_256
|
|
6
|
+
m as checksum
|
|
107
7
|
};
|
package/dist/index315.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index313.cjs");function s(e,t){if(o.size(e)>t)throw new o.SizeOverflowError({givenSize:o.size(e),maxSize:t})}const n={zero:48,nine:57,A:65,F:70,a:97,f:102};function u(e){if(e>=n.zero&&e<=n.nine)return e-n.zero;if(e>=n.A&&e<=n.F)return e-(n.A-10);if(e>=n.a&&e<=n.f)return e-(n.a-10)}function z(e,t={}){const{dir:f,size:r=32}=t;if(r===0)return e;if(e.length>r)throw new o.SizeExceedsPaddingSizeError({size:e.length,targetSize:r,type:"Bytes"});const d=new Uint8Array(r);for(let i=0;i<r;i++){const a=f==="right";d[a?i:r-i-1]=e[a?i:e.length-i-1]}return d}exports.assertSize=s;exports.charCodeMap=n;exports.charCodeToBase16=u;exports.pad=z;
|
package/dist/index315.js
CHANGED
|
@@ -1,7 +1,47 @@
|
|
|
1
|
-
import {
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
1
|
+
import { size as d, SizeOverflowError as u, SizeExceedsPaddingSizeError as a } from "./index313.js";
|
|
2
|
+
function p(e, t) {
|
|
3
|
+
if (d(e) > t)
|
|
4
|
+
throw new u({
|
|
5
|
+
givenSize: d(e),
|
|
6
|
+
maxSize: t
|
|
7
|
+
});
|
|
8
|
+
}
|
|
9
|
+
const n = {
|
|
10
|
+
zero: 48,
|
|
11
|
+
nine: 57,
|
|
12
|
+
A: 65,
|
|
13
|
+
F: 70,
|
|
14
|
+
a: 97,
|
|
15
|
+
f: 102
|
|
16
|
+
};
|
|
17
|
+
function s(e) {
|
|
18
|
+
if (e >= n.zero && e <= n.nine)
|
|
19
|
+
return e - n.zero;
|
|
20
|
+
if (e >= n.A && e <= n.F)
|
|
21
|
+
return e - (n.A - 10);
|
|
22
|
+
if (e >= n.a && e <= n.f)
|
|
23
|
+
return e - (n.a - 10);
|
|
24
|
+
}
|
|
25
|
+
function S(e, t = {}) {
|
|
26
|
+
const { dir: z, size: i = 32 } = t;
|
|
27
|
+
if (i === 0)
|
|
28
|
+
return e;
|
|
29
|
+
if (e.length > i)
|
|
30
|
+
throw new a({
|
|
31
|
+
size: e.length,
|
|
32
|
+
targetSize: i,
|
|
33
|
+
type: "Bytes"
|
|
34
|
+
});
|
|
35
|
+
const o = new Uint8Array(i);
|
|
36
|
+
for (let r = 0; r < i; r++) {
|
|
37
|
+
const f = z === "right";
|
|
38
|
+
o[f ? r : i - r - 1] = e[f ? r : e.length - r - 1];
|
|
39
|
+
}
|
|
40
|
+
return o;
|
|
41
|
+
}
|
|
5
42
|
export {
|
|
6
|
-
|
|
43
|
+
p as assertSize,
|
|
44
|
+
n as charCodeMap,
|
|
45
|
+
s as charCodeToBase16,
|
|
46
|
+
S as pad
|
|
7
47
|
};
|
package/dist/index5.cjs
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=t=>({ok:!0,val:t}),n=void 0,s=(t,...e)=>{let i=t;return typeof t=="string"&&e&&e.length>0&&(i=[t,...e].map(r=>{if(r){if(r instanceof Error)return r.message;if(typeof r=="string")return r;if(r!=null&&r.toString)return r.toString()}}).filter(r=>r!==void 0).join(" ")),{ok:!1,val:void 0,error:i}};exports.Err=s;exports.Ok=o;exports.Void=n;
|
package/dist/index5.js
CHANGED
|
@@ -1,50 +1,22 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
}
|
|
17
|
-
get error() {
|
|
18
|
-
return u(this, o);
|
|
19
|
-
}
|
|
20
|
-
get val() {
|
|
21
|
-
return u(this, i);
|
|
22
|
-
}
|
|
23
|
-
}
|
|
24
|
-
s = new WeakMap(), i = new WeakMap(), o = new WeakMap();
|
|
25
|
-
const v = (t) => new c(!0, t), d = void 0, k = (t, ...r) => {
|
|
26
|
-
if (typeof t == "string" && r && r.length > 0) {
|
|
27
|
-
const n = [t, ...r].map((e) => {
|
|
28
|
-
if (e) {
|
|
29
|
-
if (e instanceof Error)
|
|
30
|
-
return e.message;
|
|
31
|
-
if (typeof e == "string")
|
|
32
|
-
return e;
|
|
33
|
-
if (e != null && e.toString)
|
|
34
|
-
return e.toString();
|
|
35
|
-
}
|
|
36
|
-
});
|
|
37
|
-
return new c(
|
|
38
|
-
!1,
|
|
39
|
-
null,
|
|
40
|
-
n.filter((e) => e !== void 0).join(" ")
|
|
41
|
-
);
|
|
42
|
-
}
|
|
43
|
-
return new c(!1, null, t);
|
|
1
|
+
const o = (t) => ({ ok: !0, val: t }), s = void 0, f = (t, ...e) => {
|
|
2
|
+
let i = t;
|
|
3
|
+
return typeof t == "string" && e && e.length > 0 && (i = [t, ...e].map((r) => {
|
|
4
|
+
if (r) {
|
|
5
|
+
if (r instanceof Error)
|
|
6
|
+
return r.message;
|
|
7
|
+
if (typeof r == "string")
|
|
8
|
+
return r;
|
|
9
|
+
if (r != null && r.toString)
|
|
10
|
+
return r.toString();
|
|
11
|
+
}
|
|
12
|
+
}).filter((r) => r !== void 0).join(" ")), {
|
|
13
|
+
ok: !1,
|
|
14
|
+
val: void 0,
|
|
15
|
+
error: i
|
|
16
|
+
};
|
|
44
17
|
};
|
|
45
18
|
export {
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
d as Void
|
|
19
|
+
f as Err,
|
|
20
|
+
o as Ok,
|
|
21
|
+
s as Void
|
|
50
22
|
};
|
|
@@ -1,9 +1,11 @@
|
|
|
1
|
+
import { Err, Ok } from '../result';
|
|
2
|
+
|
|
1
3
|
export declare class DigestKey {
|
|
2
4
|
private _digestKey;
|
|
3
5
|
private _userId;
|
|
4
6
|
constructor(digestKey: string);
|
|
5
|
-
static from(digestKey: string):
|
|
6
|
-
static generateRandom():
|
|
7
|
+
static from(digestKey: string): Err<string> | Ok<DigestKey>;
|
|
8
|
+
static generateRandom(): Err<string> | Ok<DigestKey>;
|
|
7
9
|
private static isValidDigestKey;
|
|
8
10
|
private static isValidPrivateKey;
|
|
9
11
|
private static generateRandomDigestKey;
|
package/dist/src/lib/result.d.ts
CHANGED
|
@@ -1,16 +1,20 @@
|
|
|
1
|
-
export
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
1
|
+
export type Ok<T> = {
|
|
2
|
+
ok: true;
|
|
3
|
+
val: T;
|
|
4
|
+
error?: undefined;
|
|
5
|
+
};
|
|
6
|
+
export type Err<E> = {
|
|
7
|
+
ok: false;
|
|
8
|
+
val?: undefined;
|
|
9
|
+
error: E;
|
|
10
|
+
};
|
|
11
|
+
export type Result<T, E> = Ok<T> | Err<E>;
|
|
12
|
+
export declare const Ok: <T>(val: T) => Ok<T>;
|
|
8
13
|
export type AsyncResult<T, E> = Promise<Result<T, E>>;
|
|
9
|
-
export declare const Ok: <T>(val: T) => Result<T, never>;
|
|
10
14
|
export declare const Void: undefined;
|
|
11
15
|
/**
|
|
12
16
|
* Constructs an error result with the given error value.
|
|
13
17
|
*
|
|
14
18
|
* If the error value is a string, it can be followed by any number of optional messages which will be concatenated
|
|
15
19
|
*/
|
|
16
|
-
export declare const Err: <E>(error: E, ...optionalMsg: (E extends string ? any : never)[]) =>
|
|
20
|
+
export declare const Err: <E>(error: E, ...optionalMsg: (E extends string ? any : never)[]) => Err<E>;
|