bigint-crypto-utils - npm Package Compare versions

Comparing version 3.0.3 to 3.0.4

lib/index.browser.bundle.iife.js

@@ -1,1 +0,1 @@
-var bigintCryptoUtils=function(n){"use strict";function t(n){return(n=BigInt(n))>=0n?n:-n}function e(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,i=1n,o=0n;for(;0n!==n;){const s=t/n,a=t%n,c=e-i*s,u=r-o*s;t=n,n=a,e=i,r=o,i=c,o=u}return{g:t,x:e,y:r}}function i(n,e){if(n=t(n),e=t(e),0n===n)return e;if(0n===e)return n;let r=0n;for(;!(1n&(n|e));)n>>=1n,e>>=1n,r++;for(;!(1n&n);)n>>=1n;do{for(;!(1n&e);)e>>=1n;if(n>e){const t=n;n=e,e=t}e-=n}while(e);return n<<r}function o(n,t){try{const e=r(a(n,t),t);return 1n!==e.g?NaN:a(e.x,t)}catch(n){return NaN}}function s(n,e,r){if(0n===(r=BigInt(r)))return NaN;if(1n===r)return BigInt(0);if(n=a(n,r),(e=BigInt(e))<0n)return o(s(n,t(e),r),r);let i=1n;for(;e>0;)e%2n===1n&&(i=i*n%r),e/=2n,n=n**2n%r;return i}function a(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function c(n,t=16,e=!1){return"number"==typeof n&&(n=BigInt(n)),new Promise((e,r)=>{const i=new Worker(m());i.onmessage=n=>{i.terminate(),e(n.data.isPrime)},i.onmessageerror=n=>{r(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function u(n,t=1n){if(n<=0n||t<0n||n<=t)throw new RangeError("inputs should be max > 0, min >= 0; max > min");const r=n-t,i=e(r);let o;do{o=w(g(i))}while(o>r);return o+t}function f(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=Math.ceil(n/8),r=n%8;return new Promise(n=>{l(e,!1).then((function(e){if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}n(e)}))})}function g(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=d(Math.ceil(n/8),!1),r=n%8;if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}return e}function l(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}}))}function d(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function w(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t<<BigInt(8))+n}return t}function m(){let n=`'use strict';const ${r.name}=${r.toString()};const ${o.name}=${o.toString()};const ${s.name}=${s.toString()};const ${a.name}=${a.toString()};const ${g.name}=${g.toString()};const ${d.name}=${d.toString()};const ${u.name}=${u.toString()};const ${c.name}=${h.toString()};${e.toString()}${w.toString()}`;return n+=`onmessage = ${async function(n){const t=await c(n.data.rnd,n.data.iterations);postMessage({isPrime:t,value:n.data.rnd,id:n.data.id})}.toString()};`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function h(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const e=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t<e.length&&e[t]<=n;t++){const r=e[t];if(n===r)return!0;if(n%r===0n)return!1}let r=0n;const i=n-1n;let o=i;for(;o%2n===0n;)o/=2n,++r;const a=i/2n**r;do{let t=s(u(i,2n),a,n);if(1n===t||t===i)continue;let e=1;for(;e<r&&(t=s(t,2n,n),t!==i);){if(1n===t)return!1;e++}if(t!==i)return!1}while(--t);return!0}let B=!1;return self.Worker&&(B=!0),n.abs=t,n.bitLength=e,n.eGcd=r,n.gcd=i,n.isProbablyPrime=c,n.lcm=function(n,e){return n=BigInt(n),e=BigInt(e),0n===n&&0n===e?BigInt(0):t(n*e)/i(n,e)},n.max=function(n,t){return(n=BigInt(n))>=(t=BigInt(t))?n:t},n.min=function(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n},n.modInv=o,n.modPow=s,n.prime=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!B){let e=0n;do{e=w(g(n,!0))}while(!h(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],i=(i,o)=>{if(i.isPrime){for(let n=0;n<r.length;n++)r[n].terminate();for(;r.length;)r.pop();e(i.value)}else{const e=w(g(n,!0));try{o.postMessage({rnd:e,iterations:t,id:i.id})}catch(n){}}};{const n=m();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),r.push(t)}}for(let e=0;e<r.length;e++)f(n,!0).then((function(n){const i=w(n);r[e].postMessage({rnd:i,iterations:t,id:e})}))})},n.primeSync=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=w(g(n,!0))}while(!h(e,t));return e},n.randBetween=u,n.randBits=f,n.randBitsSync=g,n.randBytes=l,n.randBytesSync=d,n.toZn=a,n}({});
+var bigintCryptoUtils=function(n){"use strict";function t(n){return(n=BigInt(n))>=0n?n:-n}function e(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const s=t/n,a=t%n,c=e-o*s,u=r-i*s;t=n,n=a,e=o,r=i,o=c,i=u}return{g:t,x:e,y:r}}function o(n,e){if(n=t(n),e=t(e),0n===n)return e;if(0n===e)return n;let r=0n;for(;!(1n&(n|e));)n>>=1n,e>>=1n,r++;for(;!(1n&n);)n>>=1n;do{for(;!(1n&e);)e>>=1n;if(n>e){const t=n;n=e,e=t}e-=n}while(e);return n<<r}function i(n,t){try{const e=r(a(n,t),t);return 1n!==e.g?NaN:a(e.x,t)}catch(n){return NaN}}function s(n,e,r){if(0n===(r=BigInt(r)))return NaN;if(1n===r)return BigInt(0);if(n=a(n,r),(e=BigInt(e))<0n)return i(s(n,t(e),r),r);let o=1n;for(;e>0;)e%2n===1n&&(o=o*n%r),e/=2n,n=n**2n%r;return o}function a(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function c(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0)throw RangeError("w MUST be >= 0");return new Promise((e,r)=>{const o=new Worker(d());o.onmessage=n=>{o.terminate(),e(n.data.isPrime)},o.onmessageerror=n=>{r(n)},o.postMessage({rnd:n,iterations:t,id:0})})}function u(n,t=1n){if(n<=0n||t<0n||n<=t)throw new RangeError("Arguments MUST be: max > 0 && min >=0 && max > min");const r=n-t,o=e(r);let i;do{i=m(g(o))}while(i>r);return i+t}function f(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=Math.ceil(n/8),r=n%8;return new Promise(n=>{l(e,!1).then((function(e){if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}n(e)}))})}function g(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=w(Math.ceil(n/8),!1),r=n%8;if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}return e}function l(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}}))}function w(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function m(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t<<BigInt(8))+n}return t}function d(){let n=`'use strict';const ${r.name}=${r.toString()};const ${i.name}=${i.toString()};const ${s.name}=${s.toString()};const ${a.name}=${a.toString()};const ${g.name}=${g.toString()};const ${w.name}=${w.toString()};const ${u.name}=${u.toString()};const ${c.name}=${h.toString()};${e.toString()}${m.toString()}`;return n+=`onmessage = ${async function(n){const t=await c(n.data.rnd,n.data.iterations);postMessage({isPrime:t,value:n.data.rnd,id:n.data.id})}.toString()};`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function h(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const e=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t<e.length&&e[t]<=n;t++){const r=e[t];if(n===r)return!0;if(n%r===0n)return!1}let r=0n;const o=n-1n;let i=o;for(;i%2n===0n;)i/=2n,++r;const a=o/2n**r;do{let t=s(u(o,2n),a,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=s(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(--t);return!0}let B=!1;return self.Worker&&(B=!0),n.abs=t,n.bitLength=e,n.eGcd=r,n.gcd=o,n.isProbablyPrime=c,n.lcm=function(n,e){return n=BigInt(n),e=BigInt(e),0n===n&&0n===e?BigInt(0):t(n*e)/o(n,e)},n.max=function(n,t){return(n=BigInt(n))>=(t=BigInt(t))?n:t},n.min=function(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n},n.modInv=i,n.modPow=s,n.prime=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!B){let e=0n;do{e=m(g(n,!0))}while(!h(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],o=(o,i)=>{if(o.isPrime){for(let n=0;n<r.length;n++)r[n].terminate();for(;r.length;)r.pop();e(o.value)}else{const e=m(g(n,!0));try{i.postMessage({rnd:e,iterations:t,id:o.id})}catch(n){}}};{const n=d();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>o(n.data,t),r.push(t)}}for(let e=0;e<r.length;e++)f(n,!0).then((function(n){const o=m(n);r[e].postMessage({rnd:o,iterations:t,id:e})}))})},n.primeSync=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=m(g(n,!0))}while(!h(e,t));return e},n.randBetween=u,n.randBits=f,n.randBitsSync=g,n.randBytes=l,n.randBytesSync=w,n.toZn=a,n}({});

lib/index.browser.bundle.mod.js

@@ -1,1 +0,1 @@
-function n(n){return(n=BigInt(n))>=0n?n:-n}function t(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const s=t/n,c=t%n,u=e-o*s,a=r-i*s;t=n,n=c,e=o,r=i,o=u,i=a}return{g:t,x:e,y:r}}function r(t,e){if(t=n(t),e=n(e),0n===t)return e;if(0n===e)return t;let r=0n;for(;!(1n&(t|e));)t>>=1n,e>>=1n,r++;for(;!(1n&t);)t>>=1n;do{for(;!(1n&e);)e>>=1n;if(t>e){const n=t;t=e,e=n}e-=t}while(e);return t<<r}function o(t,e){return t=BigInt(t),e=BigInt(e),0n===t&&0n===e?BigInt(0):n(t*e)/r(t,e)}function i(n,t){return(n=BigInt(n))>=(t=BigInt(t))?n:t}function s(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n}function c(n,t){try{const r=e(a(n,t),t);return 1n!==r.g?NaN:a(r.x,t)}catch(n){return NaN}}function u(t,e,r){if(0n===(r=BigInt(r)))return NaN;if(1n===r)return BigInt(0);if(t=a(t,r),(e=BigInt(e))<0n)return c(u(t,n(e),r),r);let o=1n;for(;e>0;)e%2n===1n&&(o=o*t%r),e/=2n,t=t**2n%r;return o}function a(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function f(n,t=16,e=!1){return"number"==typeof n&&(n=BigInt(n)),new Promise((e,r)=>{const o=new Worker(I());o.onmessage=n=>{o.terminate(),e(n.data.isPrime)},o.onmessageerror=n=>{r(n)},o.postMessage({rnd:n,iterations:t,id:0})})}function g(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!S){let e=0n;do{e=$(d(n,!0))}while(!b(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],o=(o,i)=>{if(o.isPrime){for(let n=0;n<r.length;n++)r[n].terminate();for(;r.length;)r.pop();e(o.value)}else{const e=$(d(n,!0));try{i.postMessage({rnd:e,iterations:t,id:o.id})}catch(n){}}};{const n=I();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>o(n.data,t),r.push(t)}}for(let e=0;e<r.length;e++)h(n,!0).then((function(n){const o=$(n);r[e].postMessage({rnd:o,iterations:t,id:e})}))})}function l(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=$(d(n,!0))}while(!b(e,t));return e}function w(n,e=1n){if(n<=0n||e<0n||n<=e)throw new RangeError("inputs should be max > 0, min >= 0; max > min");const r=n-e,o=t(r);let i;do{i=$(d(o))}while(i>r);return i+e}function h(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=Math.ceil(n/8),r=n%8;return new Promise(n=>{m(e,!1).then((function(e){if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}n(e)}))})}function d(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=B(Math.ceil(n/8),!1),r=n%8;if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}return e}function m(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}}))}function B(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function $(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t<<BigInt(8))+n}return t}function I(){let n=`'use strict';const ${e.name}=${e.toString()};const ${c.name}=${c.toString()};const ${u.name}=${u.toString()};const ${a.name}=${a.toString()};const ${d.name}=${d.toString()};const ${B.name}=${B.toString()};const ${w.name}=${w.toString()};const ${f.name}=${b.toString()};${t.toString()}${$.toString()}`;return n+=`onmessage = ${async function(n){const t=await f(n.data.rnd,n.data.iterations);postMessage({isPrime:t,value:n.data.rnd,id:n.data.id})}.toString()};`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function b(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const e=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t<e.length&&e[t]<=n;t++){const r=e[t];if(n===r)return!0;if(n%r===0n)return!1}let r=0n;const o=n-1n;let i=o;for(;i%2n===0n;)i/=2n,++r;const s=o/2n**r;do{let t=u(w(o,2n),s,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=u(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(--t);return!0}let S=!1;self.Worker&&(S=!0);export{n as abs,t as bitLength,e as eGcd,r as gcd,f as isProbablyPrime,o as lcm,i as max,s as min,c as modInv,u as modPow,g as prime,l as primeSync,w as randBetween,h as randBits,d as randBitsSync,m as randBytes,B as randBytesSync,a as toZn};
+function n(n){return(n=BigInt(n))>=0n?n:-n}function t(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const s=t/n,a=t%n,c=e-o*s,u=r-i*s;t=n,n=a,e=o,r=i,o=c,i=u}return{g:t,x:e,y:r}}function r(t,e){if(t=n(t),e=n(e),0n===t)return e;if(0n===e)return t;let r=0n;for(;!(1n&(t|e));)t>>=1n,e>>=1n,r++;for(;!(1n&t);)t>>=1n;do{for(;!(1n&e);)e>>=1n;if(t>e){const n=t;t=e,e=n}e-=t}while(e);return t<<r}function o(t,e){return t=BigInt(t),e=BigInt(e),0n===t&&0n===e?BigInt(0):n(t*e)/r(t,e)}function i(n,t){return(n=BigInt(n))>=(t=BigInt(t))?n:t}function s(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n}function a(n,t){try{const r=e(u(n,t),t);return 1n!==r.g?NaN:u(r.x,t)}catch(n){return NaN}}function c(t,e,r){if(0n===(r=BigInt(r)))return NaN;if(1n===r)return BigInt(0);if(t=u(t,r),(e=BigInt(e))<0n)return a(c(t,n(e),r),r);let o=1n;for(;e>0;)e%2n===1n&&(o=o*t%r),e/=2n,t=t**2n%r;return o}function u(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function f(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0)throw RangeError("w MUST be >= 0");return new Promise((e,r)=>{const o=new Worker($());o.onmessage=n=>{o.terminate(),e(n.data.isPrime)},o.onmessageerror=n=>{r(n)},o.postMessage({rnd:n,iterations:t,id:0})})}function g(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!I){let e=0n;do{e=S(m(n,!0))}while(!b(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],o=(o,i)=>{if(o.isPrime){for(let n=0;n<r.length;n++)r[n].terminate();for(;r.length;)r.pop();e(o.value)}else{const e=S(m(n,!0));try{i.postMessage({rnd:e,iterations:t,id:o.id})}catch(n){}}};{const n=$();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>o(n.data,t),r.push(t)}}for(let e=0;e<r.length;e++)h(n,!0).then((function(n){const o=S(n);r[e].postMessage({rnd:o,iterations:t,id:e})}))})}function l(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=S(m(n,!0))}while(!b(e,t));return e}function w(n,e=1n){if(n<=0n||e<0n||n<=e)throw new RangeError("Arguments MUST be: max > 0 && min >=0 && max > min");const r=n-e,o=t(r);let i;do{i=S(m(o))}while(i>r);return i+e}function h(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=Math.ceil(n/8),r=n%8;return new Promise(n=>{d(e,!1).then((function(e){if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}n(e)}))})}function m(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=B(Math.ceil(n/8),!1),r=n%8;if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}return e}function d(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}}))}function B(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function S(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t<<BigInt(8))+n}return t}function $(){let n=`'use strict';const ${e.name}=${e.toString()};const ${a.name}=${a.toString()};const ${c.name}=${c.toString()};const ${u.name}=${u.toString()};const ${m.name}=${m.toString()};const ${B.name}=${B.toString()};const ${w.name}=${w.toString()};const ${f.name}=${b.toString()};${t.toString()}${S.toString()}`;return n+=`onmessage = ${async function(n){const t=await f(n.data.rnd,n.data.iterations);postMessage({isPrime:t,value:n.data.rnd,id:n.data.id})}.toString()};`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function b(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const e=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t<e.length&&e[t]<=n;t++){const r=e[t];if(n===r)return!0;if(n%r===0n)return!1}let r=0n;const o=n-1n;let i=o;for(;i%2n===0n;)i/=2n,++r;const s=o/2n**r;do{let t=c(w(o,2n),s,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=c(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(--t);return!0}let I=!1;self.Worker&&(I=!0);export{n as abs,t as bitLength,e as eGcd,r as gcd,f as isProbablyPrime,o as lcm,i as max,s as min,a as modInv,c as modPow,g as prime,l as primeSync,w as randBetween,h as randBits,m as randBitsSync,d as randBytes,B as randBytesSync,u as toZn};

lib/index.browser.mod.js

@@ -8,6 +8,8 @@ import { bitLength, eGcd, modInv, modPow, toZn } from 'bigint-mod-arith'
  *
- * @param {number | bigint} w An integer to be tested for primality
+ * @param {number | bigint} w A positive integer to be tested for primality
  * @param {number} [iterations = 16] The number of iterations for the primality test. The value shall be consistent with Table C.1, C.2 or C.3
  * @param {boolean} [disableWorkers = false] Disable the use of workers for the primality test
  *
+ * @throws {RangeError} w MUST be >= 0
+ *
  * @returns {Promise<boolean>} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite)
@@ -19,2 +21,3 @@ */
   }
+  if (w < 0) throw RangeError('w MUST be >= 0')
   /* eslint-disable no-lone-blocks */
@@ -54,2 +57,4 @@ { // browser
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {Promise<bigint>} A promise that resolves to a bigint probable prime of bitLength bits.
@@ -124,2 +129,4 @@ */
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {bigint} A bigint probable prime of bitLength bits.
@@ -141,6 +148,8 @@ */
  *
+ * @throws {RangeError} Arguments MUST be: max > 0 && min >=0 && max > min
+ *
  * @returns {bigint} A cryptographically secure random bigint between [min,max]
  */
 function randBetween (max, min = 1n) {
-  if (max <= 0n || min < 0n || max <= min) throw new RangeError('inputs should be max > 0, min >= 0; max > min')
+  if (max <= 0n || min < 0n || max <= min) throw new RangeError('Arguments MUST be: max > 0 && min >=0 && max > min')
   const interval = max - min
@@ -162,2 +171,4 @@ const bitLen = bitLength(interval)
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {Promise<Buffer | Uint8Array>} A Promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits
@@ -191,2 +202,4 @@ */
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {Buffer | Uint8Array} A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits
@@ -217,2 +230,4 @@ */
  *
+ * @throws {RangeError} byteLength MUST be > 0
+ *
  * @returns {Promise<Buffer | Uint8Array>} A promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bytes
@@ -242,2 +257,4 @@ */
  *
+ * @throws {RangeError} byteLength MUST be > 0
+ *
  * @returns {Buffer | Uint8Array} A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bytes
@@ -244,0 +261,0 @@ */

lib/index.node.js

@@ -9,6 +9,8 @@ 'use strict'
  *
- * @param {number | bigint} w An integer to be tested for primality
+ * @param {number | bigint} w A positive integer to be tested for primality
  * @param {number} [iterations = 16] The number of iterations for the primality test. The value shall be consistent with Table C.1, C.2 or C.3
  * @param {boolean} [disableWorkers = false] Disable the use of workers for the primality test
  *
+ * @throws {RangeError} w MUST be >= 0
+ *
  * @returns {Promise<boolean>} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite)
@@ -20,2 +22,3 @@ */
   }
+  if (w < 0) throw RangeError('w MUST be >= 0')
   /* eslint-disable no-lone-blocks */
@@ -61,2 +64,4 @@ { // Node.js
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {Promise<bigint>} A promise that resolves to a bigint probable prime of bitLength bits.
@@ -132,2 +137,4 @@ */
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {bigint} A bigint probable prime of bitLength bits.
@@ -149,6 +156,8 @@ */
  *
+ * @throws {RangeError} Arguments MUST be: max > 0 && min >=0 && max > min
+ *
  * @returns {bigint} A cryptographically secure random bigint between [min,max]
  */
 function randBetween (max, min = 1n) {
-  if (max <= 0n || min < 0n || max <= min) throw new RangeError('inputs should be max > 0, min >= 0; max > min')
+  if (max <= 0n || min < 0n || max <= min) throw new RangeError('Arguments MUST be: max > 0 && min >=0 && max > min')
   const interval = max - min
@@ -170,2 +179,4 @@ const bitLen = bigintModArith.bitLength(interval)
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {Promise<Buffer | Uint8Array>} A Promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits
@@ -199,2 +210,4 @@ */
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {Buffer | Uint8Array} A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits
@@ -225,2 +238,4 @@ */
  *
+ * @throws {RangeError} byteLength MUST be > 0
+ *
  * @returns {Promise<Buffer | Uint8Array>} A promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bytes
@@ -253,2 +268,4 @@ */
  *
+ * @throws {RangeError} byteLength MUST be > 0
+ *
  * @returns {Buffer | Uint8Array} A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bytes
@@ -255,0 +272,0 @@ */

package.json

 {
   "name": "bigint-crypto-utils",
-  "version": "3.0.3",
+  "version": "3.0.4",
   "description": "Arbitrary precision modular arithmetic, cryptographically secure random numbers and strong probable prime generation/testing. It works in modern browsers, Angular, React, Node.js, etc. since it uses the native JS implementation of BigInt",
@@ -5,0 +5,0 @@ "keywords": [

README.md

@@ -138,2 +138,6 @@ [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
 </dd>
+<dt><a href="#isProbablyPrime">isProbablyPrime(w, [iterations], [disableWorkers])</a> ⇒ <code>Promise.&lt;boolean&gt;</code></dt>
+<dd><p>The test first tries if any of the first 250 small primes are a factor of the input number and then passes several
+iterations of Miller-Rabin Probabilistic Primality Test (FIPS 186-4 C.3.1)</p>
+</dd>
 <dt><a href="#lcm">lcm(a, b)</a> ⇒ <code>bigint</code></dt>
@@ -154,9 +158,2 @@ <dd><p>The least common multiple computed as abs(a*b)/gcd(a,b)</p>
 </dd>
-<dt><a href="#toZn">toZn(a, n)</a> ⇒ <code>bigint</code></dt>
-<dd><p>Finds the smallest positive element that is congruent to a in modulo n</p>
-</dd>
-<dt><a href="#isProbablyPrime">isProbablyPrime(w, [iterations], [disableWorkers])</a> ⇒ <code>Promise.&lt;boolean&gt;</code></dt>
-<dd><p>The test first tries if any of the first 250 small primes are a factor of the input number and then passes several
-iterations of Miller-Rabin Probabilistic Primality Test (FIPS 186-4 C.3.1)</p>
-</dd>
 <dt><a href="#prime">prime(bitLength, [iterations])</a> ⇒ <code>Promise.&lt;bigint&gt;</code></dt>
@@ -188,2 +185,5 @@ <dd><p>A probably-prime (Miller-Rabin), cryptographically-secure, random-number generator.
 </dd>
+<dt><a href="#toZn">toZn(a, n)</a> ⇒ <code>bigint</code></dt>
+<dd><p>Finds the smallest positive element that is congruent to a in modulo n</p>
+</dd>
 </dl>
@@ -237,2 +237,16 @@
 
+<a name="egcdReturn"></a>
+
+### egcdReturn : <code>Object</code>
+A triple (g, x, y), such that ax + by = g = gcd(a, b).
+
+**Kind**: global typedef  
+**Properties**
+
+| Name | Type |
+| --- | --- |
+| g | <code>bigint</code> | 
+| x | <code>bigint</code> | 
+| y | <code>bigint</code> | 
+
 <a name="gcd"></a>
@@ -251,2 +265,21 @@
 
+<a name="isProbablyPrime"></a>
+
+### isProbablyPrime(w, [iterations], [disableWorkers]) ⇒ <code>Promise.&lt;boolean&gt;</code>
+The test first tries if any of the first 250 small primes are a factor of the input number and then passes several
+iterations of Miller-Rabin Probabilistic Primality Test (FIPS 186-4 C.3.1)
+
+**Kind**: global function  
+**Returns**: <code>Promise.&lt;boolean&gt;</code> - A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite)  
+**Throws**:
+
+- <code>RangeError</code> w MUST be >= 0
+
+
+| Param | Type | Default | Description |
+| --- | --- | --- | --- |
+| w | <code>number</code> \| <code>bigint</code> |  | A positive integer to be tested for primality |
+| [iterations] | <code>number</code> | <code>16</code> | The number of iterations for the primality test. The value shall be consistent with Table C.1, C.2 or C.3 |
+| [disableWorkers] | <code>boolean</code> | <code>false</code> | Disable the use of workers for the primality test |
+
 <a name="lcm"></a>
@@ -318,30 +351,2 @@
 
-<a name="toZn"></a>
-
-### toZn(a, n) ⇒ <code>bigint</code>
-Finds the smallest positive element that is congruent to a in modulo n
-
-**Kind**: global function  
-**Returns**: <code>bigint</code> - The smallest positive representation of a in modulo n  
-
-| Param | Type | Description |
-| --- | --- | --- |
-| a | <code>number</code> \| <code>bigint</code> | An integer |
-| n | <code>number</code> \| <code>bigint</code> | The modulo |
-
-<a name="isProbablyPrime"></a>
-
-### isProbablyPrime(w, [iterations], [disableWorkers]) ⇒ <code>Promise.&lt;boolean&gt;</code>
-The test first tries if any of the first 250 small primes are a factor of the input number and then passes several
-iterations of Miller-Rabin Probabilistic Primality Test (FIPS 186-4 C.3.1)
-
-**Kind**: global function  
-**Returns**: <code>Promise.&lt;boolean&gt;</code> - A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite)  
-
-| Param | Type | Default | Description |
-| --- | --- | --- | --- |
-| w | <code>number</code> \| <code>bigint</code> |  | An integer to be tested for primality |
-| [iterations] | <code>number</code> | <code>16</code> | The number of iterations for the primality test. The value shall be consistent with Table C.1, C.2 or C.3 |
-| [disableWorkers] | <code>boolean</code> | <code>false</code> | Disable the use of workers for the primality test |
-
 <a name="prime"></a>
@@ -358,3 +363,7 @@
 **Returns**: <code>Promise.&lt;bigint&gt;</code> - A promise that resolves to a bigint probable prime of bitLength bits.  
+**Throws**:
 
+- <code>RangeError</code> bitLength MUST be > 0
+
+
 | Param | Type | Default | Description |
@@ -373,3 +382,7 @@ | --- | --- | --- | --- |
 **Returns**: <code>bigint</code> - A bigint probable prime of bitLength bits.  
+**Throws**:
 
+- <code>RangeError</code> bitLength MUST be > 0
+
+
 | Param | Type | Default | Description |
@@ -387,3 +400,7 @@ | --- | --- | --- | --- |
 **Returns**: <code>bigint</code> - A cryptographically secure random bigint between [min,max]  
+**Throws**:
 
+- <code>RangeError</code> Arguments MUST be: max > 0 && min >=0 && max > min
+
+
 | Param | Type | Default | Description |
@@ -401,3 +418,7 @@ | --- | --- | --- | --- |
 **Returns**: <code>Promise.&lt;(Buffer\|Uint8Array)&gt;</code> - A Promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits  
+**Throws**:
 
+- <code>RangeError</code> bitLength MUST be > 0
+
+
 | Param | Type | Default | Description |
@@ -415,3 +436,7 @@ | --- | --- | --- | --- |
 **Returns**: <code>Buffer</code> \| <code>Uint8Array</code> - A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits  
+**Throws**:
 
+- <code>RangeError</code> bitLength MUST be > 0
+
+
 | Param | Type | Default | Description |
@@ -429,3 +454,7 @@ | --- | --- | --- | --- |
 **Returns**: <code>Promise.&lt;(Buffer\|Uint8Array)&gt;</code> - A promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bytes  
+**Throws**:
 
+- <code>RangeError</code> byteLength MUST be > 0
+
+
 | Param | Type | Default | Description |
@@ -443,3 +472,7 @@ | --- | --- | --- | --- |
 **Returns**: <code>Buffer</code> \| <code>Uint8Array</code> - A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bytes  
+**Throws**:
 
+- <code>RangeError</code> byteLength MUST be > 0
+
+
 | Param | Type | Default | Description |
@@ -450,15 +483,14 @@ | --- | --- | --- | --- |
 
-<a name="egcdReturn"></a>
+<a name="toZn"></a>
 
-### egcdReturn : <code>Object</code>
-A triple (g, x, y), such that ax + by = g = gcd(a, b).
+### toZn(a, n) ⇒ <code>bigint</code>
+Finds the smallest positive element that is congruent to a in modulo n
 
-**Kind**: global typedef  
-**Properties**
+**Kind**: global function  
+**Returns**: <code>bigint</code> - The smallest positive representation of a in modulo n  
 
-| Name | Type |
-| --- | --- |
-| g | <code>bigint</code> | 
-| x | <code>bigint</code> | 
-| y | <code>bigint</code> | 
+| Param | Type | Description |
+| --- | --- | --- |
+| a | <code>number</code> \| <code>bigint</code> | An integer |
+| n | <code>number</code> \| <code>bigint</code> | The modulo |
 

types/index.d.ts

@@ -5,6 +5,8 @@ /**
  *
- * @param {number | bigint} w An integer to be tested for primality
+ * @param {number | bigint} w A positive integer to be tested for primality
  * @param {number} [iterations = 16] The number of iterations for the primality test. The value shall be consistent with Table C.1, C.2 or C.3
  * @param {boolean} [disableWorkers = false] Disable the use of workers for the primality test
  *
+ * @throws {RangeError} w MUST be >= 0
+ *
  * @returns {Promise<boolean>} A promise that resolves to a boolean that is either true (a probably prime number) or false (definitely composite)
@@ -23,2 +25,4 @@ */
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {Promise<bigint>} A promise that resolves to a bigint probable prime of bitLength bits.
@@ -34,2 +38,4 @@ */
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {bigint} A bigint probable prime of bitLength bits.
@@ -43,2 +49,4 @@ */
  *
+ * @throws {RangeError} Arguments MUST be: max > 0 && min >=0 && max > min
+ *
  * @returns {bigint} A cryptographically secure random bigint between [min,max]
@@ -53,2 +61,4 @@ */
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {Promise<Buffer | Uint8Array>} A Promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits
@@ -62,2 +72,4 @@ */
  *
+ * @throws {RangeError} bitLength MUST be > 0
+ *
  * @returns {Buffer | Uint8Array} A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits
@@ -72,2 +84,4 @@ */
  *
+ * @throws {RangeError} byteLength MUST be > 0
+ *
  * @returns {Promise<Buffer | Uint8Array>} A promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bytes
@@ -82,2 +96,4 @@ */
  *
+ * @throws {RangeError} byteLength MUST be > 0
+ *
  * @returns {Buffer | Uint8Array} A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bytes
@@ -84,0 +100,0 @@ */

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

74109

increased by2.78%

Lines of code

1357

increased by3.83%

Number of lines in readme file

483

increased by7.1%

No dependency changes