diff --git a/dist/bundle.esm.js b/dist/bundle.esm.js
index c93de14..b19af12 100644
--- a/dist/bundle.esm.js
+++ b/dist/bundle.esm.js
@@ -1,4 +1,4 @@
-function n(n){return n>=0?n:-n}function t(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++;}while((n>>=1n)>1n);return t}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||t<=0n)throw new RangeError("a and b MUST be > 0");let r=0n,e=1n,o=1n,i=0n;for(;0n!==n;){const u=t/n,f=t%n,g=r-o*u,c=e-i*u;t=n,n=f,r=o,e=i,o=g,i=c;}return {g:t,x:r,y:e}}function e(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const r=n%t;return r<0n?r+t:r}function o(n,t){const o=r(e(n,t),t);if(1n!==o.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return e(o.x,t)}function i(n,t,r){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const i=r??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,r,u)=>{const f=i/r;return e(t+f*o(f,r)%i*n[u]%i,i)}),0n)}function u(t,r){let e="number"==typeof t?BigInt(n(t)):n(t),o="number"==typeof r?BigInt(n(r)):n(r);if(0n===e)return o;if(0n===o)return e;let i=0n;for(;0n===(1n&(e|o));)e>>=1n,o>>=1n,i++;for(;0n===(1n&e);)e>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(e>o){const n=e;e=o,o=n;}o-=e;}while(0n!==o);return e<<i}function f(t,r){return "number"==typeof t&&(t=BigInt(t)),"number"==typeof r&&(r=BigInt(r)),0n===t&&0n===r?BigInt(0):n(t/u(t,r)*r)}function g(n,t){return n>=t?n:t}function c(n,t){return n>=t?t:n}function a(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}function s(t,r,u,f){if("number"==typeof t&&(t=BigInt(t)),"number"==typeof r&&(r=BigInt(r)),"number"==typeof u&&(u=BigInt(u)),u<=0n)throw new RangeError("n must be > 0");if(1n===u)return 0n;if(t=e(t,u),r<0n)return o(s(t,n(r),u,f),u);if(void 0!==f)return function(n,t,r,e){const o=e.map((n=>n[0]**n[1])),u=e.map((n=>a([n]))),f=u.map(((r,e)=>s(n,t%r,o[e])));return i(f,o,r)}(t,r,u,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const r=String(n);void 0===t[r]?t[r]={p:BigInt(n),k:1n}:t[r].k+=1n;}else {const r=String(n[0]);void 0===t[r]?t[r]={p:BigInt(n[0]),k:BigInt(n[1])}:t[r].k+=BigInt(n[1]);}})),Object.values(t).map((n=>[n.p,n.k]))}(f));let g=1n;for(;r>0;)r%2n===1n&&(g=g*t%u),r/=2n,t=t**2n%u;return g}
+function n(n){return n>=0?n:-n}function t(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++;}while((n>>=1n)>1n);return t}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||t<=0n)throw new RangeError("a and b MUST be > 0");let r=0n,e=1n,o=1n,i=0n;for(;0n!==n;){const u=t/n,f=t%n,g=r-o*u,c=e-i*u;t=n,n=f,r=o,e=i,o=g,i=c;}return {g:t,x:r,y:e}}function e(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const r=n%t;return r<0n?r+t:r}function o(n,t){const o=r(e(n,t),t);if(1n!==o.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return e(o.x,t)}function i(n,t,r){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const i=r??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,r,u)=>{const f=i/r;return e(t+f*o(f,r)%i*n[u]%i,i)}),0n)}function u(t,r){let e="number"==typeof t?BigInt(n(t)):n(t),o="number"==typeof r?BigInt(n(r)):n(r);if(0n===e)return o;if(0n===o)return e;let i=0n;for(;0n===(1n&(e|o));)e>>=1n,o>>=1n,i++;for(;0n===(1n&e);)e>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(e>o){const n=e;e=o,o=n;}o-=e;}while(0n!==o);return e<<i}function f(t,r){return "number"==typeof t&&(t=BigInt(t)),"number"==typeof r&&(r=BigInt(r)),0n===t&&0n===r?BigInt(0):n(t/u(t,r)*r)}function g(n,t){return n>=t?n:t}function c(n,t){return n>=t?t:n}function m(n,t){const r=BigInt(t);return e(n.map((n=>BigInt(n)%r)).reduce(((n,t)=>n+t%r),0n),r)}function p(n,t){const r=BigInt(t);return e(n.map((n=>BigInt(n)%r)).reduce(((n,t)=>n*t%r),1n),r)}function a(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}function s(t,r,u,f){if("number"==typeof t&&(t=BigInt(t)),"number"==typeof r&&(r=BigInt(r)),"number"==typeof u&&(u=BigInt(u)),u<=0n)throw new RangeError("n must be > 0");if(1n===u)return 0n;if(t=e(t,u),r<0n)return o(s(t,n(r),u,f),u);if(void 0!==f)return function(n,t,r,e){const o=e.map((n=>n[0]**n[1])),u=e.map((n=>a([n]))),f=u.map(((r,e)=>s(n,t%r,o[e])));return i(f,o,r)}(t,r,u,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const r=String(n);void 0===t[r]?t[r]={p:BigInt(n),k:1n}:t[r].k+=1n;}else {const r=String(n[0]);void 0===t[r]?t[r]={p:BigInt(n[0]),k:BigInt(n[1])}:t[r].k+=BigInt(n[1]);}})),Object.values(t).map((n=>[n.p,n.k]))}(f));let g=1n;for(;r>0;)r%2n===1n&&(g=g*t%u),r/=2n,t=t**2n%u;return g}
 
 function fromBuffer(buf) {
     let ret = 0n;
@@ -530,4 +530,4 @@ function primeSync(bitLength, iterations = 16) {
     return rnd;
 }
 
-export { n as abs, t as bitLength, r as eGcd, u as gcd, isProbablyPrime, f as lcm, g as max, c as min, o as modInv, s as modPow, prime, primeSync, randBetween, randBits, randBitsSync, randBytes, randBytesSync, e as toZn };
+export { n as abs, t as bitLength, i as crt, r as eGcd, u as gcd, isProbablyPrime, f as lcm, g as max, c as min, m as modAdd, o as modInv, p as modMultiply, s as modPow, a as phi, prime, primeSync, randBetween, randBits, randBitsSync, randBytes, randBytesSync, e as toZn };
diff --git a/dist/bundle.esm.min.js b/dist/bundle.esm.min.js
index a9f955c..6387d69 100644
--- a/dist/bundle.esm.min.js
+++ b/dist/bundle.esm.min.js
@@ -1 +1 @@
-function n(n){return n>=0?n:-n}function t(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||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,u=t%n,a=e-o*s,c=r-i*s;t=n,n=u,e=o,r=i,o=a,i=c}return{g:t,x:e,y:r}}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const e=n%t;return e<0n?e+t:e}function o(n,t){const o=e(r(n,t),t);if(1n!==o.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return r(o.x,t)}function i(n,t,e){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const i=e??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,e,s)=>{const u=i/e;return r(t+u*o(u,e)%i*n[s]%i,i)}),0n)}function s(t,e){let r="number"==typeof t?BigInt(n(t)):n(t),o="number"==typeof e?BigInt(n(e)):n(e);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function u(t,e){return"number"==typeof t&&(t=BigInt(t)),"number"==typeof e&&(e=BigInt(e)),0n===t&&0n===e?BigInt(0):n(t/s(t,e)*e)}function a(n,t){return n>=t?n:t}function c(n,t){return n>=t?t:n}function f(t,e,s,u){if("number"==typeof t&&(t=BigInt(t)),"number"==typeof e&&(e=BigInt(e)),"number"==typeof s&&(s=BigInt(s)),s<=0n)throw new RangeError("n must be > 0");if(1n===s)return 0n;if(t=r(t,s),e<0n)return o(f(t,n(e),s,u),s);if(void 0!==u)return function(n,t,e,r){const o=r.map((n=>n[0]**n[1])),s=r.map((n=>function(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}([n]))),u=s.map(((e,r)=>f(n,t%e,o[r])));return i(u,o,e)}(t,e,s,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const e=String(n);void 0===t[e]?t[e]={p:BigInt(n),k:1n}:t[e].k+=1n}else{const e=String(n[0]);void 0===t[e]?t[e]={p:BigInt(n[0]),k:BigInt(n[1])}:t[e].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(u));let a=1n;for(;e>0;)e%2n===1n&&(a=a*t%s),e/=2n,t=t**2n%s;return a}function g(n){let t=0n;for(const e of n.values()){t=(t<<8n)+BigInt(e)}return t}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);if(n<=65536)self.crypto.getRandomValues(r);else for(let t=0;t<Math.ceil(n/65536);t++){const e=65536*t,o=e+65535<n?e+65535:n-1;self.crypto.getRandomValues(r.subarray(e,o))}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);if(n<=65536)self.crypto.getRandomValues(e);else for(let t=0;t<Math.ceil(n/65536);t++){const r=65536*t,o=r+65535<n?r+65535:n-1;self.crypto.getRandomValues(e.subarray(r,o))}return t&&(e[0]=128|e[0]),e}}function l(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,o)=>{m(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}n(e)}))}))}function b(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(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}return e}function h(n,e=1n){if(n<=e)throw new RangeError("Arguments MUST be: max > min");const r=n-e,o=t(r);let i;do{i=g(b(o))}while(i>r);return i+e}let w=!1;function p(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0n)throw RangeError("w MUST be >= 0");return new Promise(((e,r)=>{const o=new Worker(S());o.onmessage=n=>{void 0!==n?.data?._bcu?.isPrime&&(o.terminate(),e(n.data._bcu.isPrime))},o.onmessageerror=n=>{r(n)};const i={_bcu:{rnd:n,iterations:t,id:0}};o.postMessage(i)}))}function y(n,t){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=f(h(o,2n),s,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=f(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(0!=--t);return!0}function S(){let n=`\n  'use strict';\n  const ${e.name} = ${e.toString()};\n  const ${o.name} = ${o.toString()};\n  const ${f.name} = ${f.toString()};\n  const ${r.name} = ${r.toString()};\n  const ${b.name} = ${b.toString()};\n  const ${d.name} = ${d.toString()};\n  const ${h.name} = ${h.toString()};\n  const ${p.name} = ${y.toString()};\n  ${t.toString()};\n  ${g.toString()};`;return n+=`\n  onmessage = async function(msg) {\n    if (msg !== undefined && msg.data !== undefined && msg.data._bcu !== undefined && msg.data._bcu.id !== undefined && msg.data._bcu.iterations !== undefined && msg.data._bcu.rnd !== undefined) {\n      const msgToParent = {\n        _bcu: {\n          isPrime: await ${p.name}(msg.data._bcu.rnd, msg.data._bcu.iterations),\n          value: msg.data._bcu.rnd,\n          id: msg.data._bcu.id\n        }\n      };\n      postMessage(msgToParent);\n    }\n  }`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function $(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!w){let e=0n;do{e=g(b(n,!0))}while(!y(e,t));return new Promise((n=>{n(e)}))}return new Promise(((e,r)=>{const o=[],i=(r,i)=>{if(r._bcu.isPrime){for(let n=0;n<o.length;n++)o[n].terminate();for(;o.length>0;)o.pop();e(r._bcu.value)}else{const e=g(b(n,!0));try{const n={_bcu:{rnd:e,iterations:t,id:r._bcu.id}};i.postMessage(n)}catch(n){}}};{const n=S();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),o.push(t)}}for(let e=0;e<o.length;e++)l(n,!0).then((function(n){const r=g(n);o[e].postMessage({_bcu:{rnd:r,iterations:t,id:e}})})).catch(r)}))}function B(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=g(b(n,!0))}while(!y(e,t));return e}void 0!==self.Worker&&(w=!0);export{n as abs,t as bitLength,e as eGcd,s as gcd,p as isProbablyPrime,u as lcm,a as max,c as min,o as modInv,f as modPow,$ as prime,B as primeSync,h as randBetween,l as randBits,b as randBitsSync,m as randBytes,d as randBytesSync,r as toZn};
+function n(n){return n>=0?n:-n}function t(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||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,u=t%n,a=e-o*s,c=r-i*s;t=n,n=u,e=o,r=i,o=a,i=c}return{g:t,x:e,y:r}}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const e=n%t;return e<0n?e+t:e}function o(n,t){const o=e(r(n,t),t);if(1n!==o.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return r(o.x,t)}function i(n,t,e){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const i=e??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,e,s)=>{const u=i/e;return r(t+u*o(u,e)%i*n[s]%i,i)}),0n)}function s(t,e){let r="number"==typeof t?BigInt(n(t)):n(t),o="number"==typeof e?BigInt(n(e)):n(e);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function u(t,e){return"number"==typeof t&&(t=BigInt(t)),"number"==typeof e&&(e=BigInt(e)),0n===t&&0n===e?BigInt(0):n(t/s(t,e)*e)}function a(n,t){return n>=t?n:t}function c(n,t){return n>=t?t:n}function f(n,t){const e=BigInt(t);return r(n.map((n=>BigInt(n)%e)).reduce(((n,t)=>n+t%e),0n),e)}function g(n,t){const e=BigInt(t);return r(n.map((n=>BigInt(n)%e)).reduce(((n,t)=>n*t%e),1n),e)}function m(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}function d(t,e,s,u){if("number"==typeof t&&(t=BigInt(t)),"number"==typeof e&&(e=BigInt(e)),"number"==typeof s&&(s=BigInt(s)),s<=0n)throw new RangeError("n must be > 0");if(1n===s)return 0n;if(t=r(t,s),e<0n)return o(d(t,n(e),s,u),s);if(void 0!==u)return function(n,t,e,r){const o=r.map((n=>n[0]**n[1])),s=r.map((n=>m([n]))),u=s.map(((e,r)=>d(n,t%e,o[r])));return i(u,o,e)}(t,e,s,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const e=String(n);void 0===t[e]?t[e]={p:BigInt(n),k:1n}:t[e].k+=1n}else{const e=String(n[0]);void 0===t[e]?t[e]={p:BigInt(n[0]),k:BigInt(n[1])}:t[e].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(u));let a=1n;for(;e>0;)e%2n===1n&&(a=a*t%s),e/=2n,t=t**2n%s;return a}function l(n){let t=0n;for(const e of n.values()){t=(t<<8n)+BigInt(e)}return t}function b(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(r);else for(let t=0;t<Math.ceil(n/65536);t++){const e=65536*t,o=e+65535<n?e+65535:n-1;self.crypto.getRandomValues(r.subarray(e,o))}t&&(r[0]=128|r[0]),e(r)}}))}function h(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(e);else for(let t=0;t<Math.ceil(n/65536);t++){const r=65536*t,o=r+65535<n?r+65535:n-1;self.crypto.getRandomValues(e.subarray(r,o))}return t&&(e[0]=128|e[0]),e}}function w(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,o)=>{b(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}n(e)}))}))}function p(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=h(Math.ceil(n/8),!1),r=n%8;if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}return e}function y(n,e=1n){if(n<=e)throw new RangeError("Arguments MUST be: max > min");const r=n-e,o=t(r);let i;do{i=l(p(o))}while(i>r);return i+e}let B=!1;function I(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0n)throw RangeError("w MUST be >= 0");return new Promise(((e,r)=>{const o=new Worker($());o.onmessage=n=>{void 0!==n?.data?._bcu?.isPrime&&(o.terminate(),e(n.data._bcu.isPrime))},o.onmessageerror=n=>{r(n)};const i={_bcu:{rnd:n,iterations:t,id:0}};o.postMessage(i)}))}function S(n,t){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=d(y(o,2n),s,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=d(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(0!=--t);return!0}function $(){let n=`\n  'use strict';\n  const ${e.name} = ${e.toString()};\n  const ${o.name} = ${o.toString()};\n  const ${d.name} = ${d.toString()};\n  const ${r.name} = ${r.toString()};\n  const ${p.name} = ${p.toString()};\n  const ${h.name} = ${h.toString()};\n  const ${y.name} = ${y.toString()};\n  const ${I.name} = ${S.toString()};\n  ${t.toString()};\n  ${l.toString()};`;return n+=`\n  onmessage = async function(msg) {\n    if (msg !== undefined && msg.data !== undefined && msg.data._bcu !== undefined && msg.data._bcu.id !== undefined && msg.data._bcu.iterations !== undefined && msg.data._bcu.rnd !== undefined) {\n      const msgToParent = {\n        _bcu: {\n          isPrime: await ${I.name}(msg.data._bcu.rnd, msg.data._bcu.iterations),\n          value: msg.data._bcu.rnd,\n          id: msg.data._bcu.id\n        }\n      };\n      postMessage(msgToParent);\n    }\n  }`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function R(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!B){let e=0n;do{e=l(p(n,!0))}while(!S(e,t));return new Promise((n=>{n(e)}))}return new Promise(((e,r)=>{const o=[],i=(r,i)=>{if(r._bcu.isPrime){for(let n=0;n<o.length;n++)o[n].terminate();for(;o.length>0;)o.pop();e(r._bcu.value)}else{const e=l(p(n,!0));try{const n={_bcu:{rnd:e,iterations:t,id:r._bcu.id}};i.postMessage(n)}catch(n){}}};{const n=$();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),o.push(t)}}for(let e=0;e<o.length;e++)w(n,!0).then((function(n){const r=l(n);o[e].postMessage({_bcu:{rnd:r,iterations:t,id:e}})})).catch(r)}))}function M(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=l(p(n,!0))}while(!S(e,t));return e}void 0!==self.Worker&&(B=!0);export{n as abs,t as bitLength,i as crt,e as eGcd,s as gcd,I as isProbablyPrime,u as lcm,a as max,c as min,f as modAdd,o as modInv,g as modMultiply,d as modPow,m as phi,R as prime,M as primeSync,y as randBetween,w as randBits,p as randBitsSync,b as randBytes,h as randBytesSync,r as toZn};
diff --git a/dist/bundle.iife.js b/dist/bundle.iife.js
index 89e8812..2377ed2 100644
--- a/dist/bundle.iife.js
+++ b/dist/bundle.iife.js
@@ -1 +1 @@
-var bigintCryptoUtils=function(n){"use strict";function t(n){return n>=0?n:-n}function e(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||t<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const u=t/n,s=t%n,a=e-o*u,c=r-i*u;t=n,n=s,e=o,r=i,o=a,i=c}return{g:t,x:e,y:r}}function o(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const e=n%t;return e<0n?e+t:e}function i(n,t){const e=r(o(n,t),t);if(1n!==e.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return o(e.x,t)}function u(n,t,e){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const r=e??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,e,u)=>{const s=r/e;return o(t+s*i(s,e)%r*n[u]%r,r)}),0n)}function s(n,e){let r="number"==typeof n?BigInt(t(n)):t(n),o="number"==typeof e?BigInt(t(e)):t(e);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function a(n,e,r,s){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),"number"==typeof r&&(r=BigInt(r)),r<=0n)throw new RangeError("n must be > 0");if(1n===r)return 0n;if(n=o(n,r),e<0n)return i(a(n,t(e),r,s),r);if(void 0!==s)return function(n,t,e,r){const o=r.map((n=>n[0]**n[1])),i=r.map((n=>function(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}([n]))),s=i.map(((e,r)=>a(n,t%e,o[r])));return u(s,o,e)}(n,e,r,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const e=String(n);void 0===t[e]?t[e]={p:BigInt(n),k:1n}:t[e].k+=1n}else{const e=String(n[0]);void 0===t[e]?t[e]={p:BigInt(n[0]),k:BigInt(n[1])}:t[e].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(s));let c=1n;for(;e>0;)e%2n===1n&&(c=c*n%r),e/=2n,n=n**2n%r;return c}function c(n){let t=0n;for(const e of n.values()){t=(t<<8n)+BigInt(e)}return t}function f(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(r);else for(let t=0;t<Math.ceil(n/65536);t++){const e=65536*t,o=e+65535<n?e+65535:n-1;self.crypto.getRandomValues(r.subarray(e,o))}t&&(r[0]=128|r[0]),e(r)}}))}function g(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(e);else for(let t=0;t<Math.ceil(n/65536);t++){const r=65536*t,o=r+65535<n?r+65535:n-1;self.crypto.getRandomValues(e.subarray(r,o))}return t&&(e[0]=128|e[0]),e}}function m(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,o)=>{f(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==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=g(Math.ceil(n/8),!1),r=n%8;if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}return e}function l(n,t=1n){if(n<=t)throw new RangeError("Arguments MUST be: max > min");const r=n-t,o=e(r);let i;do{i=c(d(o))}while(i>r);return i+t}let b=!1;function h(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0n)throw RangeError("w MUST be >= 0");return new Promise(((e,r)=>{const o=new Worker(p());o.onmessage=n=>{void 0!==n?.data?._bcu?.isPrime&&(o.terminate(),e(n.data._bcu.isPrime))},o.onmessageerror=n=>{r(n)};const i={_bcu:{rnd:n,iterations:t,id:0}};o.postMessage(i)}))}function w(n,t){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 u=o/2n**r;do{let t=a(l(o,2n),u,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=a(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(0!=--t);return!0}function p(){let n=`\n  'use strict';\n  const ${r.name} = ${r.toString()};\n  const ${i.name} = ${i.toString()};\n  const ${a.name} = ${a.toString()};\n  const ${o.name} = ${o.toString()};\n  const ${d.name} = ${d.toString()};\n  const ${g.name} = ${g.toString()};\n  const ${l.name} = ${l.toString()};\n  const ${h.name} = ${w.toString()};\n  ${e.toString()};\n  ${c.toString()};`;return n+=`\n  onmessage = async function(msg) {\n    if (msg !== undefined && msg.data !== undefined && msg.data._bcu !== undefined && msg.data._bcu.id !== undefined && msg.data._bcu.iterations !== undefined && msg.data._bcu.rnd !== undefined) {\n      const msgToParent = {\n        _bcu: {\n          isPrime: await ${h.name}(msg.data._bcu.rnd, msg.data._bcu.iterations),\n          value: msg.data._bcu.rnd,\n          id: msg.data._bcu.id\n        }\n      };\n      postMessage(msgToParent);\n    }\n  }`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}return void 0!==self.Worker&&(b=!0),n.abs=t,n.bitLength=e,n.eGcd=r,n.gcd=s,n.isProbablyPrime=h,n.lcm=function(n,e){return"number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),0n===n&&0n===e?BigInt(0):t(n/s(n,e)*e)},n.max=function(n,t){return n>=t?n:t},n.min=function(n,t){return n>=t?t:n},n.modInv=i,n.modPow=a,n.prime=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!b){let e=0n;do{e=c(d(n,!0))}while(!w(e,t));return new Promise((n=>{n(e)}))}return new Promise(((e,r)=>{const o=[],i=(r,i)=>{if(r._bcu.isPrime){for(let n=0;n<o.length;n++)o[n].terminate();for(;o.length>0;)o.pop();e(r._bcu.value)}else{const e=c(d(n,!0));try{const n={_bcu:{rnd:e,iterations:t,id:r._bcu.id}};i.postMessage(n)}catch(n){}}};{const n=p();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),o.push(t)}}for(let e=0;e<o.length;e++)m(n,!0).then((function(n){const r=c(n);o[e].postMessage({_bcu:{rnd:r,iterations:t,id:e}})})).catch(r)}))},n.primeSync=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=c(d(n,!0))}while(!w(e,t));return e},n.randBetween=l,n.randBits=m,n.randBitsSync=d,n.randBytes=f,n.randBytesSync=g,n.toZn=o,n}({});
+var bigintCryptoUtils=function(n){"use strict";function t(n){return n>=0?n:-n}function e(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||t<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const u=t/n,s=t%n,c=e-o*u,a=r-i*u;t=n,n=s,e=o,r=i,o=c,i=a}return{g:t,x:e,y:r}}function o(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const e=n%t;return e<0n?e+t:e}function i(n,t){const e=r(o(n,t),t);if(1n!==e.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return o(e.x,t)}function u(n,t,e){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const r=e??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,e,u)=>{const s=r/e;return o(t+s*i(s,e)%r*n[u]%r,r)}),0n)}function s(n,e){let r="number"==typeof n?BigInt(t(n)):t(n),o="number"==typeof e?BigInt(t(e)):t(e);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function c(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}function a(n,e,r,s){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),"number"==typeof r&&(r=BigInt(r)),r<=0n)throw new RangeError("n must be > 0");if(1n===r)return 0n;if(n=o(n,r),e<0n)return i(a(n,t(e),r,s),r);if(void 0!==s)return function(n,t,e,r){const o=r.map((n=>n[0]**n[1])),i=r.map((n=>c([n]))),s=i.map(((e,r)=>a(n,t%e,o[r])));return u(s,o,e)}(n,e,r,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const e=String(n);void 0===t[e]?t[e]={p:BigInt(n),k:1n}:t[e].k+=1n}else{const e=String(n[0]);void 0===t[e]?t[e]={p:BigInt(n[0]),k:BigInt(n[1])}:t[e].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(s));let f=1n;for(;e>0;)e%2n===1n&&(f=f*n%r),e/=2n,n=n**2n%r;return f}function f(n){let t=0n;for(const e of n.values()){t=(t<<8n)+BigInt(e)}return t}function g(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(r);else for(let t=0;t<Math.ceil(n/65536);t++){const e=65536*t,o=e+65535<n?e+65535:n-1;self.crypto.getRandomValues(r.subarray(e,o))}t&&(r[0]=128|r[0]),e(r)}}))}function m(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(e);else for(let t=0;t<Math.ceil(n/65536);t++){const r=65536*t,o=r+65535<n?r+65535:n-1;self.crypto.getRandomValues(e.subarray(r,o))}return t&&(e[0]=128|e[0]),e}}function d(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,o)=>{g(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}n(e)}))}))}function l(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=m(Math.ceil(n/8),!1),r=n%8;if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}return e}function b(n,t=1n){if(n<=t)throw new RangeError("Arguments MUST be: max > min");const r=n-t,o=e(r);let i;do{i=f(l(o))}while(i>r);return i+t}let h=!1;function w(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0n)throw RangeError("w MUST be >= 0");return new Promise(((e,r)=>{const o=new Worker(y());o.onmessage=n=>{void 0!==n?.data?._bcu?.isPrime&&(o.terminate(),e(n.data._bcu.isPrime))},o.onmessageerror=n=>{r(n)};const i={_bcu:{rnd:n,iterations:t,id:0}};o.postMessage(i)}))}function p(n,t){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 u=o/2n**r;do{let t=a(b(o,2n),u,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=a(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(0!=--t);return!0}function y(){let n=`\n  'use strict';\n  const ${r.name} = ${r.toString()};\n  const ${i.name} = ${i.toString()};\n  const ${a.name} = ${a.toString()};\n  const ${o.name} = ${o.toString()};\n  const ${l.name} = ${l.toString()};\n  const ${m.name} = ${m.toString()};\n  const ${b.name} = ${b.toString()};\n  const ${w.name} = ${p.toString()};\n  ${e.toString()};\n  ${f.toString()};`;return n+=`\n  onmessage = async function(msg) {\n    if (msg !== undefined && msg.data !== undefined && msg.data._bcu !== undefined && msg.data._bcu.id !== undefined && msg.data._bcu.iterations !== undefined && msg.data._bcu.rnd !== undefined) {\n      const msgToParent = {\n        _bcu: {\n          isPrime: await ${w.name}(msg.data._bcu.rnd, msg.data._bcu.iterations),\n          value: msg.data._bcu.rnd,\n          id: msg.data._bcu.id\n        }\n      };\n      postMessage(msgToParent);\n    }\n  }`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}return void 0!==self.Worker&&(h=!0),n.abs=t,n.bitLength=e,n.crt=u,n.eGcd=r,n.gcd=s,n.isProbablyPrime=w,n.lcm=function(n,e){return"number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),0n===n&&0n===e?BigInt(0):t(n/s(n,e)*e)},n.max=function(n,t){return n>=t?n:t},n.min=function(n,t){return n>=t?t:n},n.modAdd=function(n,t){const e=BigInt(t);return o(n.map((n=>BigInt(n)%e)).reduce(((n,t)=>n+t%e),0n),e)},n.modInv=i,n.modMultiply=function(n,t){const e=BigInt(t);return o(n.map((n=>BigInt(n)%e)).reduce(((n,t)=>n*t%e),1n),e)},n.modPow=a,n.phi=c,n.prime=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!h){let e=0n;do{e=f(l(n,!0))}while(!p(e,t));return new Promise((n=>{n(e)}))}return new Promise(((e,r)=>{const o=[],i=(r,i)=>{if(r._bcu.isPrime){for(let n=0;n<o.length;n++)o[n].terminate();for(;o.length>0;)o.pop();e(r._bcu.value)}else{const e=f(l(n,!0));try{const n={_bcu:{rnd:e,iterations:t,id:r._bcu.id}};i.postMessage(n)}catch(n){}}};{const n=y();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),o.push(t)}}for(let e=0;e<o.length;e++)d(n,!0).then((function(n){const r=f(n);o[e].postMessage({_bcu:{rnd:r,iterations:t,id:e}})})).catch(r)}))},n.primeSync=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=f(l(n,!0))}while(!p(e,t));return e},n.randBetween=b,n.randBits=d,n.randBitsSync=l,n.randBytes=g,n.randBytesSync=m,n.toZn=o,n}({});
diff --git a/dist/bundle.umd.js b/dist/bundle.umd.js
index a0d12ed..e745cb6 100644
--- a/dist/bundle.umd.js
+++ b/dist/bundle.umd.js
@@ -1 +1 @@
-!function(n,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((n="undefined"!=typeof globalThis?globalThis:n||self).bigintCryptoUtils={})}(this,(function(n){"use strict";function t(n){return n>=0?n:-n}function e(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||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,u=t%n,c=e-o*s,a=r-i*s;t=n,n=u,e=o,r=i,o=c,i=a}return{g:t,x:e,y:r}}function o(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const e=n%t;return e<0n?e+t:e}function i(n,t){const e=r(o(n,t),t);if(1n!==e.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return o(e.x,t)}function s(n,t,e){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const r=e??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,e,s)=>{const u=r/e;return o(t+u*i(u,e)%r*n[s]%r,r)}),0n)}function u(n,e){let r="number"==typeof n?BigInt(t(n)):t(n),o="number"==typeof e?BigInt(t(e)):t(e);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function c(n,e,r,u){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),"number"==typeof r&&(r=BigInt(r)),r<=0n)throw new RangeError("n must be > 0");if(1n===r)return 0n;if(n=o(n,r),e<0n)return i(c(n,t(e),r,u),r);if(void 0!==u)return function(n,t,e,r){const o=r.map((n=>n[0]**n[1])),i=r.map((n=>function(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}([n]))),u=i.map(((e,r)=>c(n,t%e,o[r])));return s(u,o,e)}(n,e,r,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const e=String(n);void 0===t[e]?t[e]={p:BigInt(n),k:1n}:t[e].k+=1n}else{const e=String(n[0]);void 0===t[e]?t[e]={p:BigInt(n[0]),k:BigInt(n[1])}:t[e].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(u));let a=1n;for(;e>0;)e%2n===1n&&(a=a*n%r),e/=2n,n=n**2n%r;return a}function a(n){let t=0n;for(const e of n.values()){t=(t<<8n)+BigInt(e)}return t}function f(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(r);else for(let t=0;t<Math.ceil(n/65536);t++){const e=65536*t,o=e+65535<n?e+65535:n-1;self.crypto.getRandomValues(r.subarray(e,o))}t&&(r[0]=128|r[0]),e(r)}}))}function g(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(e);else for(let t=0;t<Math.ceil(n/65536);t++){const r=65536*t,o=r+65535<n?r+65535:n-1;self.crypto.getRandomValues(e.subarray(r,o))}return t&&(e[0]=128|e[0]),e}}function d(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,o)=>{f(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==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=g(Math.ceil(n/8),!1),r=n%8;if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}return e}function l(n,t=1n){if(n<=t)throw new RangeError("Arguments MUST be: max > min");const r=n-t,o=e(r);let i;do{i=a(m(o))}while(i>r);return i+t}let b=!1;function h(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0n)throw RangeError("w MUST be >= 0");return new Promise(((e,r)=>{const o=new Worker(p());o.onmessage=n=>{void 0!==n?.data?._bcu?.isPrime&&(o.terminate(),e(n.data._bcu.isPrime))},o.onmessageerror=n=>{r(n)};const i={_bcu:{rnd:n,iterations:t,id:0}};o.postMessage(i)}))}function w(n,t){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(l(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(0!=--t);return!0}function p(){let n=`\n  'use strict';\n  const ${r.name} = ${r.toString()};\n  const ${i.name} = ${i.toString()};\n  const ${c.name} = ${c.toString()};\n  const ${o.name} = ${o.toString()};\n  const ${m.name} = ${m.toString()};\n  const ${g.name} = ${g.toString()};\n  const ${l.name} = ${l.toString()};\n  const ${h.name} = ${w.toString()};\n  ${e.toString()};\n  ${a.toString()};`;return n+=`\n  onmessage = async function(msg) {\n    if (msg !== undefined && msg.data !== undefined && msg.data._bcu !== undefined && msg.data._bcu.id !== undefined && msg.data._bcu.iterations !== undefined && msg.data._bcu.rnd !== undefined) {\n      const msgToParent = {\n        _bcu: {\n          isPrime: await ${h.name}(msg.data._bcu.rnd, msg.data._bcu.iterations),\n          value: msg.data._bcu.rnd,\n          id: msg.data._bcu.id\n        }\n      };\n      postMessage(msgToParent);\n    }\n  }`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}void 0!==self.Worker&&(b=!0),n.abs=t,n.bitLength=e,n.eGcd=r,n.gcd=u,n.isProbablyPrime=h,n.lcm=function(n,e){return"number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),0n===n&&0n===e?BigInt(0):t(n/u(n,e)*e)},n.max=function(n,t){return n>=t?n:t},n.min=function(n,t){return n>=t?t:n},n.modInv=i,n.modPow=c,n.prime=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!b){let e=0n;do{e=a(m(n,!0))}while(!w(e,t));return new Promise((n=>{n(e)}))}return new Promise(((e,r)=>{const o=[],i=(r,i)=>{if(r._bcu.isPrime){for(let n=0;n<o.length;n++)o[n].terminate();for(;o.length>0;)o.pop();e(r._bcu.value)}else{const e=a(m(n,!0));try{const n={_bcu:{rnd:e,iterations:t,id:r._bcu.id}};i.postMessage(n)}catch(n){}}};{const n=p();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),o.push(t)}}for(let e=0;e<o.length;e++)d(n,!0).then((function(n){const r=a(n);o[e].postMessage({_bcu:{rnd:r,iterations:t,id:e}})})).catch(r)}))},n.primeSync=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=a(m(n,!0))}while(!w(e,t));return e},n.randBetween=l,n.randBits=d,n.randBitsSync=m,n.randBytes=f,n.randBytesSync=g,n.toZn=o}));
+!function(n,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((n="undefined"!=typeof globalThis?globalThis:n||self).bigintCryptoUtils={})}(this,(function(n){"use strict";function t(n){return n>=0?n:-n}function e(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||t<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const u=t/n,s=t%n,c=e-o*u,a=r-i*u;t=n,n=s,e=o,r=i,o=c,i=a}return{g:t,x:e,y:r}}function o(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const e=n%t;return e<0n?e+t:e}function i(n,t){const e=r(o(n,t),t);if(1n!==e.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return o(e.x,t)}function u(n,t,e){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const r=e??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,e,u)=>{const s=r/e;return o(t+s*i(s,e)%r*n[u]%r,r)}),0n)}function s(n,e){let r="number"==typeof n?BigInt(t(n)):t(n),o="number"==typeof e?BigInt(t(e)):t(e);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function c(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}function a(n,e,r,s){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),"number"==typeof r&&(r=BigInt(r)),r<=0n)throw new RangeError("n must be > 0");if(1n===r)return 0n;if(n=o(n,r),e<0n)return i(a(n,t(e),r,s),r);if(void 0!==s)return function(n,t,e,r){const o=r.map((n=>n[0]**n[1])),i=r.map((n=>c([n]))),s=i.map(((e,r)=>a(n,t%e,o[r])));return u(s,o,e)}(n,e,r,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const e=String(n);void 0===t[e]?t[e]={p:BigInt(n),k:1n}:t[e].k+=1n}else{const e=String(n[0]);void 0===t[e]?t[e]={p:BigInt(n[0]),k:BigInt(n[1])}:t[e].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(s));let f=1n;for(;e>0;)e%2n===1n&&(f=f*n%r),e/=2n,n=n**2n%r;return f}function f(n){let t=0n;for(const e of n.values()){t=(t<<8n)+BigInt(e)}return t}function g(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(r);else for(let t=0;t<Math.ceil(n/65536);t++){const e=65536*t,o=e+65535<n?e+65535:n-1;self.crypto.getRandomValues(r.subarray(e,o))}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);if(n<=65536)self.crypto.getRandomValues(e);else for(let t=0;t<Math.ceil(n/65536);t++){const r=65536*t,o=r+65535<n?r+65535:n-1;self.crypto.getRandomValues(e.subarray(r,o))}return t&&(e[0]=128|e[0]),e}}function m(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,o)=>{g(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}n(e)}))}))}function l(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(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}return e}function b(n,t=1n){if(n<=t)throw new RangeError("Arguments MUST be: max > min");const r=n-t,o=e(r);let i;do{i=f(l(o))}while(i>r);return i+t}let h=!1;function p(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0n)throw RangeError("w MUST be >= 0");return new Promise(((e,r)=>{const o=new Worker(y());o.onmessage=n=>{void 0!==n?.data?._bcu?.isPrime&&(o.terminate(),e(n.data._bcu.isPrime))},o.onmessageerror=n=>{r(n)};const i={_bcu:{rnd:n,iterations:t,id:0}};o.postMessage(i)}))}function w(n,t){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 u=o/2n**r;do{let t=a(b(o,2n),u,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=a(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(0!=--t);return!0}function y(){let n=`\n  'use strict';\n  const ${r.name} = ${r.toString()};\n  const ${i.name} = ${i.toString()};\n  const ${a.name} = ${a.toString()};\n  const ${o.name} = ${o.toString()};\n  const ${l.name} = ${l.toString()};\n  const ${d.name} = ${d.toString()};\n  const ${b.name} = ${b.toString()};\n  const ${p.name} = ${w.toString()};\n  ${e.toString()};\n  ${f.toString()};`;return n+=`\n  onmessage = async function(msg) {\n    if (msg !== undefined && msg.data !== undefined && msg.data._bcu !== undefined && msg.data._bcu.id !== undefined && msg.data._bcu.iterations !== undefined && msg.data._bcu.rnd !== undefined) {\n      const msgToParent = {\n        _bcu: {\n          isPrime: await ${p.name}(msg.data._bcu.rnd, msg.data._bcu.iterations),\n          value: msg.data._bcu.rnd,\n          id: msg.data._bcu.id\n        }\n      };\n      postMessage(msgToParent);\n    }\n  }`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}void 0!==self.Worker&&(h=!0),n.abs=t,n.bitLength=e,n.crt=u,n.eGcd=r,n.gcd=s,n.isProbablyPrime=p,n.lcm=function(n,e){return"number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),0n===n&&0n===e?BigInt(0):t(n/s(n,e)*e)},n.max=function(n,t){return n>=t?n:t},n.min=function(n,t){return n>=t?t:n},n.modAdd=function(n,t){const e=BigInt(t);return o(n.map((n=>BigInt(n)%e)).reduce(((n,t)=>n+t%e),0n),e)},n.modInv=i,n.modMultiply=function(n,t){const e=BigInt(t);return o(n.map((n=>BigInt(n)%e)).reduce(((n,t)=>n*t%e),1n),e)},n.modPow=a,n.phi=c,n.prime=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!h){let e=0n;do{e=f(l(n,!0))}while(!w(e,t));return new Promise((n=>{n(e)}))}return new Promise(((e,r)=>{const o=[],i=(r,i)=>{if(r._bcu.isPrime){for(let n=0;n<o.length;n++)o[n].terminate();for(;o.length>0;)o.pop();e(r._bcu.value)}else{const e=f(l(n,!0));try{const n={_bcu:{rnd:e,iterations:t,id:r._bcu.id}};i.postMessage(n)}catch(n){}}};{const n=y();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),o.push(t)}}for(let e=0;e<o.length;e++)m(n,!0).then((function(n){const r=f(n);o[e].postMessage({_bcu:{rnd:r,iterations:t,id:e}})})).catch(r)}))},n.primeSync=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=f(l(n,!0))}while(!w(e,t));return e},n.randBetween=b,n.randBits=m,n.randBitsSync=l,n.randBytes=g,n.randBytesSync=d,n.toZn=o}));
diff --git a/dist/index.browser.esm.js b/dist/index.browser.esm.js
index a9f955c..6387d69 100644
--- a/dist/index.browser.esm.js
+++ b/dist/index.browser.esm.js
@@ -1 +1 @@
-function n(n){return n>=0?n:-n}function t(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||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,u=t%n,a=e-o*s,c=r-i*s;t=n,n=u,e=o,r=i,o=a,i=c}return{g:t,x:e,y:r}}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const e=n%t;return e<0n?e+t:e}function o(n,t){const o=e(r(n,t),t);if(1n!==o.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return r(o.x,t)}function i(n,t,e){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const i=e??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,e,s)=>{const u=i/e;return r(t+u*o(u,e)%i*n[s]%i,i)}),0n)}function s(t,e){let r="number"==typeof t?BigInt(n(t)):n(t),o="number"==typeof e?BigInt(n(e)):n(e);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function u(t,e){return"number"==typeof t&&(t=BigInt(t)),"number"==typeof e&&(e=BigInt(e)),0n===t&&0n===e?BigInt(0):n(t/s(t,e)*e)}function a(n,t){return n>=t?n:t}function c(n,t){return n>=t?t:n}function f(t,e,s,u){if("number"==typeof t&&(t=BigInt(t)),"number"==typeof e&&(e=BigInt(e)),"number"==typeof s&&(s=BigInt(s)),s<=0n)throw new RangeError("n must be > 0");if(1n===s)return 0n;if(t=r(t,s),e<0n)return o(f(t,n(e),s,u),s);if(void 0!==u)return function(n,t,e,r){const o=r.map((n=>n[0]**n[1])),s=r.map((n=>function(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}([n]))),u=s.map(((e,r)=>f(n,t%e,o[r])));return i(u,o,e)}(t,e,s,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const e=String(n);void 0===t[e]?t[e]={p:BigInt(n),k:1n}:t[e].k+=1n}else{const e=String(n[0]);void 0===t[e]?t[e]={p:BigInt(n[0]),k:BigInt(n[1])}:t[e].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(u));let a=1n;for(;e>0;)e%2n===1n&&(a=a*t%s),e/=2n,t=t**2n%s;return a}function g(n){let t=0n;for(const e of n.values()){t=(t<<8n)+BigInt(e)}return t}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);if(n<=65536)self.crypto.getRandomValues(r);else for(let t=0;t<Math.ceil(n/65536);t++){const e=65536*t,o=e+65535<n?e+65535:n-1;self.crypto.getRandomValues(r.subarray(e,o))}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);if(n<=65536)self.crypto.getRandomValues(e);else for(let t=0;t<Math.ceil(n/65536);t++){const r=65536*t,o=r+65535<n?r+65535:n-1;self.crypto.getRandomValues(e.subarray(r,o))}return t&&(e[0]=128|e[0]),e}}function l(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,o)=>{m(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}n(e)}))}))}function b(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(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}return e}function h(n,e=1n){if(n<=e)throw new RangeError("Arguments MUST be: max > min");const r=n-e,o=t(r);let i;do{i=g(b(o))}while(i>r);return i+e}let w=!1;function p(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0n)throw RangeError("w MUST be >= 0");return new Promise(((e,r)=>{const o=new Worker(S());o.onmessage=n=>{void 0!==n?.data?._bcu?.isPrime&&(o.terminate(),e(n.data._bcu.isPrime))},o.onmessageerror=n=>{r(n)};const i={_bcu:{rnd:n,iterations:t,id:0}};o.postMessage(i)}))}function y(n,t){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=f(h(o,2n),s,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=f(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(0!=--t);return!0}function S(){let n=`\n  'use strict';\n  const ${e.name} = ${e.toString()};\n  const ${o.name} = ${o.toString()};\n  const ${f.name} = ${f.toString()};\n  const ${r.name} = ${r.toString()};\n  const ${b.name} = ${b.toString()};\n  const ${d.name} = ${d.toString()};\n  const ${h.name} = ${h.toString()};\n  const ${p.name} = ${y.toString()};\n  ${t.toString()};\n  ${g.toString()};`;return n+=`\n  onmessage = async function(msg) {\n    if (msg !== undefined && msg.data !== undefined && msg.data._bcu !== undefined && msg.data._bcu.id !== undefined && msg.data._bcu.iterations !== undefined && msg.data._bcu.rnd !== undefined) {\n      const msgToParent = {\n        _bcu: {\n          isPrime: await ${p.name}(msg.data._bcu.rnd, msg.data._bcu.iterations),\n          value: msg.data._bcu.rnd,\n          id: msg.data._bcu.id\n        }\n      };\n      postMessage(msgToParent);\n    }\n  }`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function $(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!w){let e=0n;do{e=g(b(n,!0))}while(!y(e,t));return new Promise((n=>{n(e)}))}return new Promise(((e,r)=>{const o=[],i=(r,i)=>{if(r._bcu.isPrime){for(let n=0;n<o.length;n++)o[n].terminate();for(;o.length>0;)o.pop();e(r._bcu.value)}else{const e=g(b(n,!0));try{const n={_bcu:{rnd:e,iterations:t,id:r._bcu.id}};i.postMessage(n)}catch(n){}}};{const n=S();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),o.push(t)}}for(let e=0;e<o.length;e++)l(n,!0).then((function(n){const r=g(n);o[e].postMessage({_bcu:{rnd:r,iterations:t,id:e}})})).catch(r)}))}function B(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=g(b(n,!0))}while(!y(e,t));return e}void 0!==self.Worker&&(w=!0);export{n as abs,t as bitLength,e as eGcd,s as gcd,p as isProbablyPrime,u as lcm,a as max,c as min,o as modInv,f as modPow,$ as prime,B as primeSync,h as randBetween,l as randBits,b as randBitsSync,m as randBytes,d as randBytesSync,r as toZn};
+function n(n){return n>=0?n:-n}function t(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||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,u=t%n,a=e-o*s,c=r-i*s;t=n,n=u,e=o,r=i,o=a,i=c}return{g:t,x:e,y:r}}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const e=n%t;return e<0n?e+t:e}function o(n,t){const o=e(r(n,t),t);if(1n!==o.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return r(o.x,t)}function i(n,t,e){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const i=e??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,e,s)=>{const u=i/e;return r(t+u*o(u,e)%i*n[s]%i,i)}),0n)}function s(t,e){let r="number"==typeof t?BigInt(n(t)):n(t),o="number"==typeof e?BigInt(n(e)):n(e);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function u(t,e){return"number"==typeof t&&(t=BigInt(t)),"number"==typeof e&&(e=BigInt(e)),0n===t&&0n===e?BigInt(0):n(t/s(t,e)*e)}function a(n,t){return n>=t?n:t}function c(n,t){return n>=t?t:n}function f(n,t){const e=BigInt(t);return r(n.map((n=>BigInt(n)%e)).reduce(((n,t)=>n+t%e),0n),e)}function g(n,t){const e=BigInt(t);return r(n.map((n=>BigInt(n)%e)).reduce(((n,t)=>n*t%e),1n),e)}function m(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}function d(t,e,s,u){if("number"==typeof t&&(t=BigInt(t)),"number"==typeof e&&(e=BigInt(e)),"number"==typeof s&&(s=BigInt(s)),s<=0n)throw new RangeError("n must be > 0");if(1n===s)return 0n;if(t=r(t,s),e<0n)return o(d(t,n(e),s,u),s);if(void 0!==u)return function(n,t,e,r){const o=r.map((n=>n[0]**n[1])),s=r.map((n=>m([n]))),u=s.map(((e,r)=>d(n,t%e,o[r])));return i(u,o,e)}(t,e,s,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const e=String(n);void 0===t[e]?t[e]={p:BigInt(n),k:1n}:t[e].k+=1n}else{const e=String(n[0]);void 0===t[e]?t[e]={p:BigInt(n[0]),k:BigInt(n[1])}:t[e].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(u));let a=1n;for(;e>0;)e%2n===1n&&(a=a*t%s),e/=2n,t=t**2n%s;return a}function l(n){let t=0n;for(const e of n.values()){t=(t<<8n)+BigInt(e)}return t}function b(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(r);else for(let t=0;t<Math.ceil(n/65536);t++){const e=65536*t,o=e+65535<n?e+65535:n-1;self.crypto.getRandomValues(r.subarray(e,o))}t&&(r[0]=128|r[0]),e(r)}}))}function h(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);if(n<=65536)self.crypto.getRandomValues(e);else for(let t=0;t<Math.ceil(n/65536);t++){const r=65536*t,o=r+65535<n?r+65535:n-1;self.crypto.getRandomValues(e.subarray(r,o))}return t&&(e[0]=128|e[0]),e}}function w(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,o)=>{b(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}n(e)}))}))}function p(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=h(Math.ceil(n/8),!1),r=n%8;if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}return e}function y(n,e=1n){if(n<=e)throw new RangeError("Arguments MUST be: max > min");const r=n-e,o=t(r);let i;do{i=l(p(o))}while(i>r);return i+e}let B=!1;function I(n,t=16,e=!1){if("number"==typeof n&&(n=BigInt(n)),n<0n)throw RangeError("w MUST be >= 0");return new Promise(((e,r)=>{const o=new Worker($());o.onmessage=n=>{void 0!==n?.data?._bcu?.isPrime&&(o.terminate(),e(n.data._bcu.isPrime))},o.onmessageerror=n=>{r(n)};const i={_bcu:{rnd:n,iterations:t,id:0}};o.postMessage(i)}))}function S(n,t){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=d(y(o,2n),s,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=d(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(0!=--t);return!0}function $(){let n=`\n  'use strict';\n  const ${e.name} = ${e.toString()};\n  const ${o.name} = ${o.toString()};\n  const ${d.name} = ${d.toString()};\n  const ${r.name} = ${r.toString()};\n  const ${p.name} = ${p.toString()};\n  const ${h.name} = ${h.toString()};\n  const ${y.name} = ${y.toString()};\n  const ${I.name} = ${S.toString()};\n  ${t.toString()};\n  ${l.toString()};`;return n+=`\n  onmessage = async function(msg) {\n    if (msg !== undefined && msg.data !== undefined && msg.data._bcu !== undefined && msg.data._bcu.id !== undefined && msg.data._bcu.iterations !== undefined && msg.data._bcu.rnd !== undefined) {\n      const msgToParent = {\n        _bcu: {\n          isPrime: await ${I.name}(msg.data._bcu.rnd, msg.data._bcu.iterations),\n          value: msg.data._bcu.rnd,\n          id: msg.data._bcu.id\n        }\n      };\n      postMessage(msgToParent);\n    }\n  }`,function(n){n=`(() => {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function R(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!B){let e=0n;do{e=l(p(n,!0))}while(!S(e,t));return new Promise((n=>{n(e)}))}return new Promise(((e,r)=>{const o=[],i=(r,i)=>{if(r._bcu.isPrime){for(let n=0;n<o.length;n++)o[n].terminate();for(;o.length>0;)o.pop();e(r._bcu.value)}else{const e=l(p(n,!0));try{const n={_bcu:{rnd:e,iterations:t,id:r._bcu.id}};i.postMessage(n)}catch(n){}}};{const n=$();for(let t=0;t<self.navigator.hardwareConcurrency-1;t++){const t=new Worker(n);t.onmessage=n=>i(n.data,t),o.push(t)}}for(let e=0;e<o.length;e++)w(n,!0).then((function(n){const r=l(n);o[e].postMessage({_bcu:{rnd:r,iterations:t,id:e}})})).catch(r)}))}function M(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=l(p(n,!0))}while(!S(e,t));return e}void 0!==self.Worker&&(B=!0);export{n as abs,t as bitLength,i as crt,e as eGcd,s as gcd,I as isProbablyPrime,u as lcm,a as max,c as min,f as modAdd,o as modInv,g as modMultiply,d as modPow,m as phi,R as prime,M as primeSync,y as randBetween,w as randBits,p as randBitsSync,b as randBytes,h as randBytesSync,r as toZn};
diff --git a/dist/index.d.ts b/dist/index.d.ts
index 3e5f7a4..9ca045f 100644
--- a/dist/index.d.ts
+++ b/dist/index.d.ts
@@ -16,6 +16,20 @@ declare function abs(a: number | bigint): number | bigint;
  */
 declare function bitLength(a: number | bigint): number;
 
+/**
+ * Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime (no two divisors share a common factor other than 1). Provided that n_i are pairwise coprime, and a_i any integers, this function returns a solution for the following system of equations:
+    x ≡ a_1 mod n_1
+    x ≡ a_2 mod n_2
+    ⋮
+    x ≡ a_k mod n_k
+ *
+ * @param remainders the array of remainders a_i. For example [17n, 243n, 344n]
+ * @param modulos the array of modulos n_i. For example [769n, 2017n, 47701n]
+ * @param modulo the product of all modulos. Provided here just to save some operations if it is already known
+ * @returns x
+ */
+declare function crt(remainders: bigint[], modulos: bigint[], modulo?: bigint): bigint;
+
 interface Egcd {
     g: bigint;
     x: bigint;
@@ -73,6 +87,14 @@ declare function max(a: number | bigint, b: number | bigint): number | bigint;
  */
 declare function min(a: number | bigint, b: number | bigint): number | bigint;
 
+/**
+ * Modular addition of (a_1 + ... + a_r) mod n
+ * @param addends an array of the numbers a_i to add. For example [3, 12353251235n, 1243, -12341232545990n]
+ * @param n the modulo
+ * @returns The smallest positive integer that is congruent with (a_1 + ... + a_r) mod n
+ */
+declare function modAdd(addends: Array<number | bigint>, n: number | bigint): bigint;
+
 /**
  * Modular inverse.
  *
@@ -85,6 +107,14 @@ declare function min(a: number | bigint, b: number | bigint): number | bigint;
  */
 declare function modInv(a: number | bigint, n: number | bigint): bigint;
 
+/**
+* Modular addition of (a_1 * ... * a_r) mod n
+ * @param factors an array of the numbers a_i to multiply. For example [3, 12353251235n, 1243, -12341232545990n]
+ * @param n the modulo
+ * @returns The smallest positive integer that is congruent with (a_1 * ... * a_r) mod n
+ */
+declare function modMultiply(factors: Array<number | bigint>, n: number | bigint): bigint;
+
 type PrimePower = [number | bigint, number | bigint];
 type PrimeFactor = number | bigint | PrimePower;
 /**
@@ -101,6 +131,15 @@ type PrimeFactor = number | bigint | PrimePower;
  */
 declare function modPow(b: number | bigint, e: number | bigint, n: number | bigint, primeFactorization?: PrimeFactor[]): bigint;
 
+type PrimeFactorization = Array<[bigint, bigint]>;
+/**
+ * A function that computes the Euler's totien function of a number n, whose prime power factorization is known
+ *
+ * @param primeFactorization an array of arrays containing the prime power factorization of a number n. For example, for n = (p1**k1)*(p2**k2)*...*(pr**kr), one should provide [[p1, k1], [p2, k2], ... , [pr, kr]]
+ * @returns phi((p1**k1)*(p2**k2)*...*(pr**kr))
+ */
+declare function phi(primeFactorization: PrimeFactorization): bigint;
+
 /**
  * Finds the smallest positive element that is congruent to a in modulo n
  *
@@ -215,4 +254,4 @@ declare function randBytes(byteLength: number, forceLength?: boolean): Promise<U
  */
 declare function randBytesSync(byteLength: number, forceLength?: boolean): Uint8Array | Buffer;
 
-export { abs, bitLength, eGcd, gcd, isProbablyPrime, lcm, max, min, modInv, modPow, prime, primeSync, randBetween, randBits, randBitsSync, randBytes, randBytesSync, toZn };
+export { Egcd, PrimeFactor, PrimeFactorization, PrimePower, abs, bitLength, crt, eGcd, gcd, isProbablyPrime, lcm, max, min, modAdd, modInv, modMultiply, modPow, phi, prime, primeSync, randBetween, randBits, randBitsSync, randBytes, randBytesSync, toZn };
diff --git a/dist/index.node.cjs b/dist/index.node.cjs
index da9c226..d56f877 100644
--- a/dist/index.node.cjs
+++ b/dist/index.node.cjs
@@ -1,2 +1 @@
-"use strict";function n(n){return n>=0?n:-n}function e(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let e=1;do{e++}while((n>>=1n)>1n);return e}function t(n,e){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),n<=0n||e<=0n)throw new RangeError("a and b MUST be > 0");let t=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const u=e/n,s=e%n,c=t-o*u,f=r-i*u;e=n,n=s,t=o,r=i,o=c,i=f}return{g:e,x:t,y:r}}function r(n,e){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),e<=0n)throw new RangeError("n must be > 0");const t=n%e;return t<0n?t+e:t}function o(n,e){const o=t(r(n,e),e);if(1n!==o.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${e.toString()}`);return r(o.x,e)}function i(n,e,t){if(n.length!==e.length)throw new RangeError("The remainders and modulos arrays should have the same length");const i=t??e.reduce(((n,e)=>n*e),1n);return e.reduce(((e,t,u)=>{const s=i/t;return r(e+s*o(s,t)%i*n[u]%i,i)}),0n)}function u(e,t){let r="number"==typeof e?BigInt(n(e)):n(e),o="number"==typeof t?BigInt(n(t)):n(t);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function s(e,t,u,c){if("number"==typeof e&&(e=BigInt(e)),"number"==typeof t&&(t=BigInt(t)),"number"==typeof u&&(u=BigInt(u)),u<=0n)throw new RangeError("n must be > 0");if(1n===u)return 0n;if(e=r(e,u),t<0n)return o(s(e,n(t),u,c),u);if(void 0!==c)return function(n,e,t,r){const o=r.map((n=>n[0]**n[1])),u=r.map((n=>function(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,e)=>e*n),1n)}([n]))),c=u.map(((t,r)=>s(n,e%t,o[r])));return i(c,o,t)}(e,t,u,function(n){const e={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const t=String(n);void 0===e[t]?e[t]={p:BigInt(n),k:1n}:e[t].k+=1n}else{const t=String(n[0]);void 0===e[t]?e[t]={p:BigInt(n[0]),k:BigInt(n[1])}:e[t].k+=BigInt(n[1])}})),Object.values(e).map((n=>[n.p,n.k]))}(c));let f=1n;for(;t>0;)t%2n===1n&&(f=f*e%u),t/=2n,e=e**2n%u;return f}function c(n){let e=0n;for(const t of n.values()){e=(e<<8n)+BigInt(t)}return e}var f=require("crypto");function a(n,e=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(t,r){f.randomBytes(n,(function(n,o){null!==n&&r(n),e&&(o[0]=128|o[0]),t(o)}))}))}function g(n,e=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const t=f.randomBytes(n);return e&&(t[0]=128|t[0]),t}}function h(n,e=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const t=Math.ceil(n/8),r=n%8;return new Promise(((n,o)=>{a(t,!1).then((function(t){if(0!==r&&(t[0]=t[0]&2**r-1),e){const n=0!==r?2**(r-1):128;t[0]=t[0]|n}n(t)}))}))}function d(n,e=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const t=g(Math.ceil(n/8),!1),r=n%8;if(0!==r&&(t[0]=t[0]&2**r-1),e){const n=0!==r?2**(r-1):128;t[0]=t[0]|n}return t}function p(n,t=1n){if(n<=t)throw new RangeError("Arguments MUST be: max > min");const r=n-t,o=e(r);let i;do{i=c(d(o))}while(i>r);return i+t}let l=!1;try{require("worker_threads"),l=!0}catch(r){console.log("[bigint-crypto-utils] WARNING:\nThis node version doesn't support worker_threads. You should enable them in order to greatly speedup the generation of big prime numbers.\n  · With Node >=11 it is enabled by default (consider upgrading).\n  · With Node 10, starting with 10.5.0, you can enable worker_threads at runtime executing node --experimental-worker ")}function b(n,e){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const t=[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 e=0;e<t.length&&t[e]<=n;e++){const r=t[e];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 u=o/2n**r;do{let e=s(p(o,2n),u,n);if(1n===e||e===o)continue;let t=1;for(;t<r&&(e=s(e,2n,n),e!==o);){if(1n===e)return!1;t++}if(e!==o)return!1}while(0!=--e);return!0}if(l)try{var m=require("worker_threads");if(!m.isMainThread&&null!==m.parentPort){const n=m.parentPort;n.on("message",(function(e){if(void 0!==e?._bcu?.iterations&&void 0!==e?._bcu?.rnd){const t={_bcu:{isPrime:b(e._bcu.rnd,e._bcu.iterations),value:e._bcu.rnd,id:e._bcu.id}};n.postMessage(t)}}))}}catch(n){}var w=require("os");try{var y=require("worker_threads")}catch{}exports.abs=n,exports.bitLength=e,exports.eGcd=t,exports.gcd=u,exports.isProbablyPrime=function(n,e=16,t=!1){if("number"==typeof n&&(n=BigInt(n)),n<0n)throw RangeError("w MUST be >= 0");return new Promise(!t&&l?(t,r)=>{const o=new m.Worker(__filename);o.on("message",(n=>{void 0!==n?._bcu?.isPrime&&(o.terminate().catch(r),t(n._bcu.isPrime))})),o.on("error",r);const i={_bcu:{rnd:n,iterations:e,id:0}};o.postMessage(i)}:t=>{t(b(n,e))})},exports.lcm=function(e,t){return"number"==typeof e&&(e=BigInt(e)),"number"==typeof t&&(t=BigInt(t)),0n===e&&0n===t?BigInt(0):n(e/u(e,t)*t)},exports.max=function(n,e){return n>=e?n:e},exports.min=function(n,e){return n>=e?e:n},exports.modInv=o,exports.modPow=s,exports.prime=function(n,e=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!l){let t=0n;do{t=c(d(n,!0))}while(!b(t,e));return new Promise((n=>{n(t)}))}return new Promise(((t,r)=>{const o=[],i=(r,i)=>{if(r._bcu.isPrime){for(let n=0;n<o.length;n++)o[n].terminate();for(;o.length>0;)o.pop();t(r._bcu.value)}else{const t=c(d(n,!0));try{const n={_bcu:{rnd:t,iterations:e,id:r._bcu.id}};i.postMessage(n)}catch(n){}}};for(let n=0;n<w.cpus().length-1;n++){const n=new y.Worker(__filename);n.on("message",(e=>i(e,n))),o.push(n)}for(let t=0;t<o.length;t++)h(n,!0).then((function(n){const r=c(n);o[t].postMessage({_bcu:{rnd:r,iterations:e,id:t}})})).catch(r)}))},exports.primeSync=function(n,e=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let t=0n;do{t=c(d(n,!0))}while(!b(t,e));return t},exports.randBetween=p,exports.randBits=h,exports.randBitsSync=d,exports.randBytes=a,exports.randBytesSync=g,exports.toZn=r;
-//# sourceMappingURL=data:application/json;charset=utf-8;base64,{"version":3,"file":"index.node.cjs","sources":["../node_modules/bigint-mod-arith/dist/index.node.esm.js","../src/ts/fromBuffer.ts","../src/ts/randBytes.ts","../src/ts/randBits.ts","../src/ts/randBetween.ts","../src/ts/workerUtils.ts","../src/ts/isProbablyPrime.ts","../src/ts/prime.ts"],"sourcesContent":null,"names":["n","t","BigInt","r","RangeError","e","o","i","u","f","g","c","x","y","toString","length","reduce","s","map","a","forEach","String","p","k","Object","values","fromBuffer","buf","ret","crypto","require","randBytes","byteLength","forceLength","Promise","resolve","reject","randomBytes","err","randBytesSync","randBits","bitLength","Math","ceil","bitLengthMod8","then","rndBytes","mask","randBitsSync","randBetween","max","min","interval","bitLen","rnd","_useWorkers","console","log","_isProbablyPrime","w","iterations","firstPrimes","d","aux","m","z","modPow","j","workerThreads","parentPort","on","data","undefined","_bcu","msg","isPrime","value","id","postMessage","error","os","disableWorkers","worker","Worker","__filename","terminate","catch","workerList","_onmessage","newWorker","pop","msgToWorker","cpus","push"],"mappings":"aAAA,SAASA,EAAEA,GAAG,OAAOA,GAAG,EAAEA,GAAGA,CAAC,CAAC,SAASC,EAAED,GAAG,GAAG,iBAAiBA,IAAIA,EAAEE,OAAOF,IAAI,KAAKA,EAAE,OAAO,EAAE,IAAIC,EAAE,EAAE,GAAGA,WAAWD,IAAI,IAAI,IAAI,OAAOC,CAAC,CAAC,SAASE,EAAEH,EAAEC,GAAG,GAAG,iBAAiBD,IAAIA,EAAEE,OAAOF,IAAI,iBAAiBC,IAAIA,EAAEC,OAAOD,IAAID,GAAG,IAAIC,GAAG,GAAG,MAAM,IAAIG,WAAW,uBAAuB,IAAID,EAAE,GAAGE,EAAE,GAAGC,EAAE,GAAGC,EAAE,GAAG,KAAK,KAAKP,GAAG,CAAC,MAAMQ,EAAEP,EAAED,EAAES,EAAER,EAAED,EAAEU,EAAEP,EAAEG,EAAEE,EAAEG,EAAEN,EAAEE,EAAEC,EAAEP,EAAED,EAAEA,EAAES,EAAEN,EAAEG,EAAED,EAAEE,EAAED,EAAEI,EAAEH,EAAEI,CAAC,CAAC,MAAM,CAACD,EAAET,EAAEW,EAAET,EAAEU,EAAER,EAAE,CAAC,SAASA,EAAEL,EAAEC,GAAG,GAAG,iBAAiBD,IAAIA,EAAEE,OAAOF,IAAI,iBAAiBC,IAAIA,EAAEC,OAAOD,IAAIA,GAAG,GAAG,MAAM,IAAIG,WAAW,iBAAiB,MAAMD,EAAEH,EAAEC,EAAE,OAAOE,EAAE,GAAGA,EAAEF,EAAEE,CAAC,CAAC,SAASG,EAAEN,EAAEC,GAAG,MAAMK,EAAEH,EAAEE,EAAEL,EAAEC,GAAGA,GAAG,GAAG,KAAKK,EAAEI,EAAE,MAAM,IAAIN,WAAW,GAAGJ,EAAEc,2CAA2Cb,EAAEa,cAAc,OAAOT,EAAEC,EAAEM,EAAEX,EAAE,CAAC,SAASM,EAAEP,EAAEC,EAAEE,GAAG,GAAGH,EAAEe,SAASd,EAAEc,OAAO,MAAM,IAAIX,WAAW,iEAAiE,MAAMG,EAAEJ,GAAGF,EAAEe,QAAM,CAAGhB,EAAEC,IAAID,EAAEC,GAAG,IAAI,OAAOA,EAAEe,QAAQ,CAACf,EAAEE,EAAEK,KAAK,MAAMC,EAAEF,EAAEJ,EAAE,OAAOE,EAAEJ,EAAEQ,EAAEH,EAAEG,EAAEN,GAAGI,EAAEP,EAAEQ,GAAGD,EAAEA,EAAG,GAAE,GAAG,CAAC,SAASC,EAAEP,EAAEE,GAAG,IAAIE,EAAE,iBAAiBJ,EAAEC,OAAOF,EAAEC,IAAID,EAAEC,GAAGK,EAAE,iBAAiBH,EAAED,OAAOF,EAAEG,IAAIH,EAAEG,GAAG,GAAG,KAAKE,EAAE,OAAOC,EAAE,GAAG,KAAKA,EAAE,OAAOD,EAAE,IAAIE,EAAE,GAAG,KAAK,MAAM,IAAIF,EAAEC,KAAKD,IAAI,GAAGC,IAAI,GAAGC,IAAI,KAAK,MAAM,GAAGF,IAAIA,IAAI,GAAG,EAAE,CAAC,KAAK,MAAM,GAAGC,IAAIA,IAAI,GAAG,GAAGD,EAAEC,EAAE,CAAC,MAAMN,EAAEK,EAAEA,EAAEC,EAAEA,EAAEN,CAAC,CAACM,GAAGD,CAAC,OAAO,KAAKC,GAAG,OAAOD,GAAGE,CAAC,CAAqd,SAASU,EAAEhB,EAAEE,EAAEK,EAAEC,GAAG,GAAG,iBAAiBR,IAAIA,EAAEC,OAAOD,IAAI,iBAAiBE,IAAIA,EAAED,OAAOC,IAAI,iBAAiBK,IAAIA,EAAEN,OAAOM,IAAIA,GAAG,GAAG,MAAM,IAAIJ,WAAW,iBAAiB,GAAG,KAAKI,EAAE,OAAO,GAAG,GAAGP,EAAEI,EAAEJ,EAAEO,GAAGL,EAAE,GAAG,OAAOG,EAAEW,EAAEhB,EAAED,EAAEG,GAAGK,EAAEC,GAAGD,GAAG,QAAG,IAASC,EAAE,OAAO,SAAST,EAAEC,EAAEE,EAAEE,GAAG,MAAMC,EAAED,EAAEa,KAAKlB,GAAGA,EAAE,IAAIA,EAAE,KAAKQ,EAAEH,EAAEa,KAAKlB,GAA1Y,SAAWA,GAAG,OAAOA,EAAEkB,KAAKlB,GAAGA,EAAE,KAAKA,EAAE,GAAG,KAAKA,EAAE,GAAG,MAAMgB,QAAM,CAAGhB,EAAEC,IAAIA,EAAED,GAAG,GAAG,CAA2TmB,CAAE,CAACnB,MAAMS,EAAED,EAAEU,KAAG,CAAGf,EAAEE,IAAIY,EAAEjB,EAAEC,EAAEE,EAAEG,EAAED,MAAM,OAAOE,EAAEE,EAAEH,EAAEH,EAAE,CAArH,CAAuHF,EAAEE,EAAEK,EAAE,SAASR,GAAG,MAAMC,EAAE,CAAE,EAAC,OAAOD,EAAEoB,SAASpB,IAAI,GAAG,iBAAiBA,GAAG,iBAAiBA,EAAE,CAAC,MAAMG,EAAEkB,OAAOrB,QAAG,IAASC,EAAEE,GAAGF,EAAEE,GAAG,CAACmB,EAAEpB,OAAOF,GAAGuB,EAAE,IAAItB,EAAEE,GAAGoB,GAAG,EAAE,KAAK,CAAC,MAAMpB,EAAEkB,OAAOrB,EAAE,SAAI,IAASC,EAAEE,GAAGF,EAAEE,GAAG,CAACmB,EAAEpB,OAAOF,EAAE,IAAIuB,EAAErB,OAAOF,EAAE,KAAKC,EAAEE,GAAGoB,GAAGrB,OAAOF,EAAE,GAAG,CAAE,IAAGwB,OAAOC,OAAOxB,GAAGiB,KAAKlB,GAAG,CAACA,EAAEsB,EAAEtB,EAAEuB,IAAI,CAArS,CAAuSd,IAAI,IAAIC,EAAE,GAAG,KAAKP,EAAE,GAAGA,EAAE,KAAK,KAAKO,EAAEA,EAAET,EAAEO,GAAGL,GAAG,GAAGF,EAAEA,GAAG,GAAGO,EAAE,OAAOE,CAAC,CCAl5E,SAAUgB,EAAYC,GAC1B,IAAIC,EAAM,GACV,IAAK,MAAMrB,KAAKoB,EAAIF,SAAU,CAE5BG,GAAOA,GAAO,IADH1B,OAAOK,EAEnB,CACD,OAAOqB,CACT,CCPiB,IAAIC,EAASC,QAAa,mBAY3BC,EAAWC,EAAoBC,GAAc,GAC3D,GAAID,EAAa,EAAG,MAAM,IAAI5B,WAAW,0BAEzC,OAAO,IAAI8B,SAAQ,SAAUC,EAASC,GAElCP,EAAOQ,YAAYL,GAAY,SAAUM,EAAKX,GAChC,OAARW,GAAcF,EAAOE,GAErBL,IAAaN,EAAI,GAAc,IAATA,EAAI,IAC9BQ,EAAQR,EACV,GAiBJ,GACF,UAagBY,EAAeP,EAAoBC,GAAuB,GACxE,GAAID,EAAa,EAAG,MAAM,IAAI5B,WAAW,0BAGxB,CACf,MAAMuB,EAAME,EAAOQ,YAAYL,GAG/B,OADIC,IAAaN,EAAI,GAAc,IAATA,EAAI,IACvBA,CAgBR,CAEH,UCnEgBa,EAAUC,EAAmBR,GAAuB,GAClE,GAAIQ,EAAY,EAAG,MAAM,IAAIrC,WAAW,yBAExC,MAAM4B,EAAaU,KAAKC,KAAKF,EAAY,GACnCG,EAAgBH,EAAY,EAElC,OAAO,IAAIP,SAAQ,CAACC,EAASC,KAC3BL,EAAUC,GAAY,GAAOa,MAAK,SAAUC,GAK1C,GAJsB,IAAlBF,IAEFE,EAAS,GAAKA,EAAS,GAAM,GAAKF,EAAgB,GAEhDX,EAAa,CACf,MAAMc,EAA0B,IAAlBH,EAAuB,IAAMA,EAAgB,GAAK,IAChEE,EAAS,GAAKA,EAAS,GAAKC,CAC7B,CACDZ,EAAQW,EACV,GAAE,GAEN,UAWgBE,EAAcP,EAAmBR,GAAuB,GACtE,GAAIQ,EAAY,EAAG,MAAM,IAAIrC,WAAW,yBAExC,MACM0C,EAAWP,EADEG,KAAKC,KAAKF,EAAY,IACE,GACrCG,EAAgBH,EAAY,EAKlC,GAJsB,IAAlBG,IAEFE,EAAS,GAAKA,EAAS,GAAM,GAAKF,EAAgB,GAEhDX,EAAa,CACf,MAAMc,EAA0B,IAAlBH,EAAuB,IAAMA,EAAgB,GAAK,IAChEE,EAAS,GAAKA,EAAS,GAAKC,CAC7B,CACD,OAAOD,CACT,UC5CgBG,EAAaC,EAAaC,EAAc,IACtD,GAAID,GAAOC,EAAK,MAAM,IAAI/C,WAAW,gCACrC,MAAMgD,EAAWF,EAAMC,EACjBE,EAASZ,EAAUW,GACzB,IAAIE,EACJ,EAAG,CAEDA,EAAM5B,EADMsB,EAAaK,UAElBC,EAAMF,GACf,OAAOE,EAAMH,CACf,CCjBA,IAAII,GAAc,EAGhB,IACEzB,QAAa,kBACbyB,GAAc,CACf,CAAuB,MAAOlD,GAC7BmD,QAAQC,IAAI,uWAIb,CC+Da,SAAAC,EAAkBC,EAAWC,GAK3C,GAAU,KAAND,EAAU,OAAO,EAChB,GAAiB,MAAR,GAAJA,IAAwB,KAANA,EAAU,OAAO,EAK7C,MAAME,EAAc,CAClB,GACA,GACA,GACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,OAGF,IAAK,IAAItD,EAAI,EAAGA,EAAIsD,EAAY9C,QAAW8C,EAAYtD,IAAMoD,EAAIpD,IAAK,CACpE,MAAMe,EAAIuC,EAAYtD,GACtB,GAAIoD,IAAMrC,EAAG,OAAO,EACf,GAAIqC,EAAIrC,IAAM,GAAI,OAAO,CAC/B,CAqBD,IAAIH,EAAI,GACR,MAAM2C,EAAIH,EAAI,GACd,IAAII,EAAMD,EACV,KAAOC,EAAM,KAAO,IAClBA,GAAO,KACL5C,EAGJ,MAAM6C,EAAIF,EAAK,IAAM3C,EAErB,EAAG,CAED,IAAI8C,EAAIC,EADEjB,EAAYa,EAAG,IACPE,EAAGL,GACrB,GAAU,KAANM,GAAYA,IAAMH,EAAG,SACzB,IAAIK,EAAI,EACR,KAAOA,EAAIhD,IACT8C,EAAIC,EAAOD,EAAG,GAAIN,GACdM,IAAMH,IAFE,CAGZ,GAAU,KAANG,EAAU,OAAO,EACrBE,GACD,CACD,GAAIF,IAAMH,EAAG,OAAO,CACrB,OAAyB,KAAfF,GAEX,OAAO,CACT,CAkCA,GAAmBL,EACjB,IACE,IAAIa,EAAgBtC,QAAa,kBAEjC,IADmBsC,EAA0B,cACA,OAA7BA,EAAcC,WAAqB,CACjD,MAAMA,EAAaD,EAAcC,WACjCA,EAAWC,GAAG,WAAW,SAAUC,GACjC,QAA+BC,IAA3BD,GAAME,MAAMb,iBAAgDY,IAApBD,GAAME,MAAMnB,IAAmB,CACzE,MACMoB,EAAuB,CAC3BD,KAAM,CACJE,QAHYjB,EAAiBa,EAAKE,KAAKnB,IAAKiB,EAAKE,KAAKb,YAItDgB,MAAOL,EAAKE,KAAKnB,IACjBuB,GAAIN,EAAKE,KAAKI,KAGlBR,EAAWS,YAAYJ,EACxB,CACH,GACD,CACF,CAAC,MAAOK,GAAS,CC1bH,IAAIC,EAAKlD,QAAa,MAErC,IACE,IAAIsC,EAAgBtC,QAAa,iBAClC,CAAC,MAAQ,wFDSN,SAA2B6B,EAAkBC,EAAqB,GAAIqB,GAA0B,GAIpG,GAHiB,iBAANtB,IACTA,EAAIzD,OAAOyD,IAETA,EAAI,GAAI,MAAMvD,WAAW,kBAG3B,OACS,IAAI8B,SADR+C,GAAkB1B,EACF,CAACpB,EAASC,KAC3B,MAAM8C,EAAS,IAAId,EAAce,OAAOC,YAExCF,EAAOZ,GAAG,WAAYC,SACQC,IAAxBD,GAAME,MAAME,UACdO,EAAOG,YAAYC,MAAMlD,GACzBD,EAAQoC,EAAKE,KAAKE,SACnB,IAGHO,EAAOZ,GAAG,QAASlC,GAEnB,MAAMsC,EAAuB,CAC3BD,KAAM,CACJnB,IAAKK,EACLC,aACAiB,GAAI,IAGRK,EAAOJ,YAAYJ,EAAI,EAGLvC,IAClBA,EAAQuB,EAAiBC,EAAaC,GAAY,EA4B1D,cN9E+tC,SAAW3D,EAAEE,GAAG,MAAM,iBAAiBF,IAAIA,EAAEC,OAAOD,IAAI,iBAAiBE,IAAIA,EAAED,OAAOC,IAAI,KAAKF,GAAG,KAAKE,EAAED,OAAO,GAAGF,EAAEC,EAAEO,EAAEP,EAAEE,GAAGA,EAAE,cAAC,SAAWH,EAAEC,GAAG,OAAOD,GAAGC,EAAED,EAAEC,CAAC,cAAC,SAAWD,EAAEC,GAAG,OAAOD,GAAGC,EAAEA,EAAED,CAAC,2DO2Bx4CyC,EAAmBmB,EAAqB,IAC7D,GAAInB,EAAY,EAAG,MAAM,IAAIrC,WAAW,yBAGxC,IAAKmD,EAAa,CAChB,IAAID,EAAM,GACV,GACEA,EAAM5B,EAAWsB,EAAaP,GAAW,WACjCiB,EAAiBJ,EAAKM,IAChC,OAAO,IAAI1B,SAASC,IAAcA,EAAQmB,EAAI,GAC/C,CAED,OAAO,IAAIpB,SAAQ,CAACC,EAASC,KAC3B,MAAMmD,EAAyC,GACzCC,EAAa,CAACd,EAAsBe,KACxC,GAAIf,EAAID,KAAKE,QAAS,CAEpB,IAAK,IAAIR,EAAI,EAAGA,EAAIoB,EAAWxE,OAAQoD,IACrCoB,EAAWpB,GAAGkB,YAEhB,KAAOE,EAAWxE,OAAS,GACzBwE,EAAWG,MAEbvD,EAAQuC,EAAID,KAAKG,MAClB,KAAM,CACL,MACMtB,EAAM5B,EADAsB,EAAaP,GAAW,IAEpC,IACE,MAAMkD,EAA+B,CACnClB,KAAM,CACJnB,MACAM,aACAiB,GAAIH,EAAID,KAAKI,KAGjBY,EAAUX,YAAYa,EACvB,CAAC,MAAOZ,GAER,CACF,GAUD,IAAK,IAAIxE,EAAI,EAAGA,EAAIyE,EAAGY,OAAO7E,OAAS,EAAGR,IAAK,CAC7C,MAAMkF,EAAY,IAAIrB,EAAce,OAAOC,YAC3CK,EAAUnB,GAAG,WAAYI,GAAyBc,EAAWd,EAAKe,KAClEF,EAAWM,KAAKJ,EACjB,CAEH,IAAK,IAAIlF,EAAI,EAAGA,EAAIgF,EAAWxE,OAAQR,IACrCiC,EAASC,GAAW,GAAMI,MAAK,SAAUlB,GACvC,MAAM2B,EAAM5B,EAAWC,GACvB4D,EAAWhF,GAAGuE,YAAY,CACxBL,KAAM,CACJnB,MACAM,aACAiB,GAAItE,IAGV,IAAG+E,MAAMlD,EACV,GAEL,6BAa2BK,EAAmBmB,EAAqB,IACjE,GAAInB,EAAY,EAAG,MAAM,IAAIrC,WAAW,yBACxC,IAAIkD,EAAM,GACV,GACEA,EAAM5B,EAAWsB,EAAaP,GAAW,WACjCiB,EAAiBJ,EAAKM,IAChC,OAAON,CACT","x_google_ignoreList":[0]}
+"use strict";function n(n){return n>=0?n:-n}function e(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let e=1;do{e++}while((n>>=1n)>1n);return e}function t(n,e){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),n<=0n||e<=0n)throw new RangeError("a and b MUST be > 0");let t=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const u=e/n,s=e%n,c=t-o*u,f=r-i*u;e=n,n=s,t=o,r=i,o=c,i=f}return{g:e,x:t,y:r}}function r(n,e){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),e<=0n)throw new RangeError("n must be > 0");const t=n%e;return t<0n?t+e:t}function o(n,e){const o=t(r(n,e),e);if(1n!==o.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${e.toString()}`);return r(o.x,e)}function i(n,e,t){if(n.length!==e.length)throw new RangeError("The remainders and modulos arrays should have the same length");const i=t??e.reduce(((n,e)=>n*e),1n);return e.reduce(((e,t,u)=>{const s=i/t;return r(e+s*o(s,t)%i*n[u]%i,i)}),0n)}function u(e,t){let r="number"==typeof e?BigInt(n(e)):n(e),o="number"==typeof t?BigInt(n(t)):n(t);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function s(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,e)=>e*n),1n)}function c(e,t,u,f){if("number"==typeof e&&(e=BigInt(e)),"number"==typeof t&&(t=BigInt(t)),"number"==typeof u&&(u=BigInt(u)),u<=0n)throw new RangeError("n must be > 0");if(1n===u)return 0n;if(e=r(e,u),t<0n)return o(c(e,n(t),u,f),u);if(void 0!==f)return function(n,e,t,r){const o=r.map((n=>n[0]**n[1])),u=r.map((n=>s([n]))),f=u.map(((t,r)=>c(n,e%t,o[r])));return i(f,o,t)}(e,t,u,function(n){const e={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const t=String(n);void 0===e[t]?e[t]={p:BigInt(n),k:1n}:e[t].k+=1n}else{const t=String(n[0]);void 0===e[t]?e[t]={p:BigInt(n[0]),k:BigInt(n[1])}:e[t].k+=BigInt(n[1])}})),Object.values(e).map((n=>[n.p,n.k]))}(f));let a=1n;for(;t>0;)t%2n===1n&&(a=a*e%u),t/=2n,e=e**2n%u;return a}function f(n){let e=0n;for(const t of n.values()){e=(e<<8n)+BigInt(t)}return e}var a=require("crypto");function g(n,e=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(t,r){a.randomBytes(n,(function(n,o){null!==n&&r(n),e&&(o[0]=128|o[0]),t(o)}))}))}function p(n,e=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const t=a.randomBytes(n);return e&&(t[0]=128|t[0]),t}}function d(n,e=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const t=Math.ceil(n/8),r=n%8;return new Promise(((n,o)=>{g(t,!1).then((function(t){if(0!==r&&(t[0]=t[0]&2**r-1),e){const n=0!==r?2**(r-1):128;t[0]=t[0]|n}n(t)}))}))}function h(n,e=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const t=p(Math.ceil(n/8),!1),r=n%8;if(0!==r&&(t[0]=t[0]&2**r-1),e){const n=0!==r?2**(r-1):128;t[0]=t[0]|n}return t}function l(n,t=1n){if(n<=t)throw new RangeError("Arguments MUST be: max > min");const r=n-t,o=e(r);let i;do{i=f(h(o))}while(i>r);return i+t}let m=!1;try{require("worker_threads"),m=!0}catch(r){console.log("[bigint-crypto-utils] WARNING:\nThis node version doesn't support worker_threads. You should enable them in order to greatly speedup the generation of big prime numbers.\n  · With Node >=11 it is enabled by default (consider upgrading).\n  · With Node 10, starting with 10.5.0, you can enable worker_threads at runtime executing node --experimental-worker ")}function b(n,e){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const t=[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 e=0;e<t.length&&t[e]<=n;e++){const r=t[e];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 u=o/2n**r;do{let e=c(l(o,2n),u,n);if(1n===e||e===o)continue;let t=1;for(;t<r&&(e=c(e,2n,n),e!==o);){if(1n===e)return!1;t++}if(e!==o)return!1}while(0!=--e);return!0}if(m)try{var w=require("worker_threads");if(!w.isMainThread&&null!==w.parentPort){const n=w.parentPort;n.on("message",(function(e){if(void 0!==e?._bcu?.iterations&&void 0!==e?._bcu?.rnd){const t={_bcu:{isPrime:b(e._bcu.rnd,e._bcu.iterations),value:e._bcu.rnd,id:e._bcu.id}};n.postMessage(t)}}))}}catch(n){}var y=require("os");try{var B=require("worker_threads")}catch{}exports.abs=n,exports.bitLength=e,exports.crt=i,exports.eGcd=t,exports.gcd=u,exports.isProbablyPrime=function(n,e=16,t=!1){if("number"==typeof n&&(n=BigInt(n)),n<0n)throw RangeError("w MUST be >= 0");return new Promise(!t&&m?(t,r)=>{const o=new w.Worker(__filename);o.on("message",(n=>{void 0!==n?._bcu?.isPrime&&(o.terminate().catch(r),t(n._bcu.isPrime))})),o.on("error",r);const i={_bcu:{rnd:n,iterations:e,id:0}};o.postMessage(i)}:t=>{t(b(n,e))})},exports.lcm=function(e,t){return"number"==typeof e&&(e=BigInt(e)),"number"==typeof t&&(t=BigInt(t)),0n===e&&0n===t?BigInt(0):n(e/u(e,t)*t)},exports.max=function(n,e){return n>=e?n:e},exports.min=function(n,e){return n>=e?e:n},exports.modAdd=function(n,e){const t=BigInt(e);return r(n.map((n=>BigInt(n)%t)).reduce(((n,e)=>n+e%t),0n),t)},exports.modInv=o,exports.modMultiply=function(n,e){const t=BigInt(e);return r(n.map((n=>BigInt(n)%t)).reduce(((n,e)=>n*e%t),1n),t)},exports.modPow=c,exports.phi=s,exports.prime=function(n,e=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!m){let t=0n;do{t=f(h(n,!0))}while(!b(t,e));return new Promise((n=>{n(t)}))}return new Promise(((t,r)=>{const o=[],i=(r,i)=>{if(r._bcu.isPrime){for(let n=0;n<o.length;n++)o[n].terminate();for(;o.length>0;)o.pop();t(r._bcu.value)}else{const t=f(h(n,!0));try{const n={_bcu:{rnd:t,iterations:e,id:r._bcu.id}};i.postMessage(n)}catch(n){}}};for(let n=0;n<y.cpus().length-1;n++){const n=new B.Worker(__filename);n.on("message",(e=>i(e,n))),o.push(n)}for(let t=0;t<o.length;t++)d(n,!0).then((function(n){const r=f(n);o[t].postMessage({_bcu:{rnd:r,iterations:e,id:t}})})).catch(r)}))},exports.primeSync=function(n,e=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let t=0n;do{t=f(h(n,!0))}while(!b(t,e));return t},exports.randBetween=l,exports.randBits=d,exports.randBitsSync=h,exports.randBytes=g,exports.randBytesSync=p,exports.toZn=r;
diff --git a/dist/index.node.esm.js b/dist/index.node.esm.js
index 7b96b95..e1e2052 100644
--- a/dist/index.node.esm.js
+++ b/dist/index.node.esm.js
@@ -1,2 +1 @@
-import{fileURLToPath as n}from"url";function t(n){return n>=0?n:-n}function e(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||t<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const u=t/n,s=t%n,a=e-o*u,c=r-i*u;t=n,n=s,e=o,r=i,o=a,i=c}return{g:t,x:e,y:r}}function o(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const e=n%t;return e<0n?e+t:e}function i(n,t){const e=r(o(n,t),t);if(1n!==e.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return o(e.x,t)}function u(n,t,e){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const r=e??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,e,u)=>{const s=r/e;return o(t+s*i(s,e)%r*n[u]%r,r)}),0n)}function s(n,e){let r="number"==typeof n?BigInt(t(n)):t(n),o="number"==typeof e?BigInt(t(e)):t(e);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function a(n,e){return"number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),0n===n&&0n===e?BigInt(0):t(n/s(n,e)*e)}function c(n,t){return n>=t?n:t}function f(n,t){return n>=t?t:n}function g(n,e,r,s){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),"number"==typeof r&&(r=BigInt(r)),r<=0n)throw new RangeError("n must be > 0");if(1n===r)return 0n;if(n=o(n,r),e<0n)return i(g(n,t(e),r,s),r);if(void 0!==s)return function(n,t,e,r){const o=r.map((n=>n[0]**n[1])),i=r.map((n=>function(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}([n]))),s=i.map(((e,r)=>g(n,t%e,o[r])));return u(s,o,e)}(n,e,r,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const e=String(n);void 0===t[e]?t[e]={p:BigInt(n),k:1n}:t[e].k+=1n}else{const e=String(n[0]);void 0===t[e]?t[e]={p:BigInt(n[0]),k:BigInt(n[1])}:t[e].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(s));let a=1n;for(;e>0;)e%2n===1n&&(a=a*n%r),e/=2n,n=n**2n%r;return a}function m(n){let t=0n;for(const e of n.values()){t=(t<<8n)+BigInt(e)}return t}var h=await import("crypto");function l(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){h.randomBytes(n,(function(n,o){null!==n&&r(n),t&&(o[0]=128|o[0]),e(o)}))}))}function b(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=h.randomBytes(n);return t&&(e[0]=128|e[0]),e}}function d(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,o)=>{l(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}n(e)}))}))}function w(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(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}return e}function p(n,t=1n){if(n<=t)throw new RangeError("Arguments MUST be: max > min");const r=n-t,o=e(r);let i;do{i=m(w(o))}while(i>r);return i+t}let y=!1;try{await import("worker_threads"),y=!0}catch(o){console.log("[bigint-crypto-utils] WARNING:\nThis node version doesn't support worker_threads. You should enable them in order to greatly speedup the generation of big prime numbers.\n  · With Node >=11 it is enabled by default (consider upgrading).\n  · With Node 10, starting with 10.5.0, you can enable worker_threads at runtime executing node --experimental-worker ")}function B(t,e=16,r=!1){if("number"==typeof t&&(t=BigInt(t)),t<0n)throw RangeError("w MUST be >= 0");return new Promise(!r&&y?(r,o)=>{const i=new _.Worker(n(import.meta.url));i.on("message",(n=>{void 0!==n?._bcu?.isPrime&&(i.terminate().catch(o),r(n._bcu.isPrime))})),i.on("error",o);const u={_bcu:{rnd:t,iterations:e,id:0}};i.postMessage(u)}:n=>{n(I(t,e))})}function I(n,t){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 u=o/2n**r;do{let t=g(p(o,2n),u,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=g(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(0!=--t);return!0}if(y)try{var _=await import("worker_threads");if(!_.isMainThread&&null!==_.parentPort){const n=_.parentPort;n.on("message",(function(t){if(void 0!==t?._bcu?.iterations&&void 0!==t?._bcu?.rnd){const e={_bcu:{isPrime:I(t._bcu.rnd,t._bcu.iterations),value:t._bcu.rnd,id:t._bcu.id}};n.postMessage(e)}}))}}catch(n){}var v=await import("os");try{var M=await import("worker_threads")}catch{}function E(t,e=16){if(t<1)throw new RangeError("bitLength MUST be > 0");if(!y){let n=0n;do{n=m(w(t,!0))}while(!I(n,e));return new Promise((t=>{t(n)}))}return new Promise(((r,o)=>{const i=[],u=(n,o)=>{if(n._bcu.isPrime){for(let n=0;n<i.length;n++)i[n].terminate();for(;i.length>0;)i.pop();r(n._bcu.value)}else{const r=m(w(t,!0));try{const t={_bcu:{rnd:r,iterations:e,id:n._bcu.id}};o.postMessage(t)}catch(n){}}};for(let t=0;t<v.cpus().length-1;t++){const t=new M.Worker(n(import.meta.url));t.on("message",(n=>u(n,t))),i.push(t)}for(let n=0;n<i.length;n++)d(t,!0).then((function(t){const r=m(t);i[n].postMessage({_bcu:{rnd:r,iterations:e,id:n}})})).catch(o)}))}function R(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=m(w(n,!0))}while(!I(e,t));return e}export{t as abs,e as bitLength,r as eGcd,s as gcd,B as isProbablyPrime,a as lcm,c as max,f as min,i as modInv,g as modPow,E as prime,R as primeSync,p as randBetween,d as randBits,w as randBitsSync,l as randBytes,b as randBytesSync,o as toZn};
-//# sourceMappingURL=data:application/json;charset=utf-8;base64,{"version":3,"file":"index.node.esm.js","sources":["../node_modules/bigint-mod-arith/dist/index.node.esm.js","../src/ts/fromBuffer.ts","../src/ts/randBytes.ts","../src/ts/randBits.ts","../src/ts/randBetween.ts","../src/ts/workerUtils.ts","../src/ts/isProbablyPrime.ts","../src/ts/prime.ts"],"sourcesContent":null,"names":["n","t","BigInt","r","RangeError","e","o","i","u","f","g","c","x","y","toString","length","reduce","s","map","a","forEach","String","p","k","Object","values","fromBuffer","buf","ret","crypto","import","randBytes","byteLength","forceLength","Promise","resolve","reject","randomBytes","err","randBytesSync","randBits","bitLength","Math","ceil","bitLengthMod8","then","rndBytes","mask","randBitsSync","randBetween","max","min","interval","bitLen","rnd","_useWorkers","console","log","isProbablyPrime","w","iterations","disableWorkers","worker","workerThreads","Worker","fileURLToPath","url","on","data","undefined","_bcu","isPrime","terminate","catch","msg","id","postMessage","_isProbablyPrime","firstPrimes","d","aux","m","z","modPow","j","parentPort","value","error","os","prime","workerList","_onmessage","newWorker","pop","msgToWorker","cpus","push","primeSync"],"mappings":"oCAAA,SAASA,EAAEA,GAAG,OAAOA,GAAG,EAAEA,GAAGA,CAAC,CAAC,SAASC,EAAED,GAAG,GAAG,iBAAiBA,IAAIA,EAAEE,OAAOF,IAAI,KAAKA,EAAE,OAAO,EAAE,IAAIC,EAAE,EAAE,GAAGA,WAAWD,IAAI,IAAI,IAAI,OAAOC,CAAC,CAAC,SAASE,EAAEH,EAAEC,GAAG,GAAG,iBAAiBD,IAAIA,EAAEE,OAAOF,IAAI,iBAAiBC,IAAIA,EAAEC,OAAOD,IAAID,GAAG,IAAIC,GAAG,GAAG,MAAM,IAAIG,WAAW,uBAAuB,IAAID,EAAE,GAAGE,EAAE,GAAGC,EAAE,GAAGC,EAAE,GAAG,KAAK,KAAKP,GAAG,CAAC,MAAMQ,EAAEP,EAAED,EAAES,EAAER,EAAED,EAAEU,EAAEP,EAAEG,EAAEE,EAAEG,EAAEN,EAAEE,EAAEC,EAAEP,EAAED,EAAEA,EAAES,EAAEN,EAAEG,EAAED,EAAEE,EAAED,EAAEI,EAAEH,EAAEI,CAAC,CAAC,MAAM,CAACD,EAAET,EAAEW,EAAET,EAAEU,EAAER,EAAE,CAAC,SAASA,EAAEL,EAAEC,GAAG,GAAG,iBAAiBD,IAAIA,EAAEE,OAAOF,IAAI,iBAAiBC,IAAIA,EAAEC,OAAOD,IAAIA,GAAG,GAAG,MAAM,IAAIG,WAAW,iBAAiB,MAAMD,EAAEH,EAAEC,EAAE,OAAOE,EAAE,GAAGA,EAAEF,EAAEE,CAAC,CAAC,SAASG,EAAEN,EAAEC,GAAG,MAAMK,EAAEH,EAAEE,EAAEL,EAAEC,GAAGA,GAAG,GAAG,KAAKK,EAAEI,EAAE,MAAM,IAAIN,WAAW,GAAGJ,EAAEc,2CAA2Cb,EAAEa,cAAc,OAAOT,EAAEC,EAAEM,EAAEX,EAAE,CAAC,SAASM,EAAEP,EAAEC,EAAEE,GAAG,GAAGH,EAAEe,SAASd,EAAEc,OAAO,MAAM,IAAIX,WAAW,iEAAiE,MAAMG,EAAEJ,GAAGF,EAAEe,QAAM,CAAGhB,EAAEC,IAAID,EAAEC,GAAG,IAAI,OAAOA,EAAEe,QAAQ,CAACf,EAAEE,EAAEK,KAAK,MAAMC,EAAEF,EAAEJ,EAAE,OAAOE,EAAEJ,EAAEQ,EAAEH,EAAEG,EAAEN,GAAGI,EAAEP,EAAEQ,GAAGD,EAAEA,EAAG,GAAE,GAAG,CAAC,SAASC,EAAEP,EAAEE,GAAG,IAAIE,EAAE,iBAAiBJ,EAAEC,OAAOF,EAAEC,IAAID,EAAEC,GAAGK,EAAE,iBAAiBH,EAAED,OAAOF,EAAEG,IAAIH,EAAEG,GAAG,GAAG,KAAKE,EAAE,OAAOC,EAAE,GAAG,KAAKA,EAAE,OAAOD,EAAE,IAAIE,EAAE,GAAG,KAAK,MAAM,IAAIF,EAAEC,KAAKD,IAAI,GAAGC,IAAI,GAAGC,IAAI,KAAK,MAAM,GAAGF,IAAIA,IAAI,GAAG,EAAE,CAAC,KAAK,MAAM,GAAGC,IAAIA,IAAI,GAAG,GAAGD,EAAEC,EAAE,CAAC,MAAMN,EAAEK,EAAEA,EAAEC,EAAEA,EAAEN,CAAC,CAACM,GAAGD,CAAC,OAAO,KAAKC,GAAG,OAAOD,GAAGE,CAAC,CAAC,SAASE,EAAER,EAAEE,GAAG,MAAM,iBAAiBF,IAAIA,EAAEC,OAAOD,IAAI,iBAAiBE,IAAIA,EAAED,OAAOC,IAAI,KAAKF,GAAG,KAAKE,EAAED,OAAO,GAAGF,EAAEC,EAAEO,EAAEP,EAAEE,GAAGA,EAAE,CAAC,SAASO,EAAEV,EAAEC,GAAG,OAAOD,GAAGC,EAAED,EAAEC,CAAC,CAAC,SAASU,EAAEX,EAAEC,GAAG,OAAOD,GAAGC,EAAEA,EAAED,CAAC,CAAoR,SAASiB,EAAEhB,EAAEE,EAAEK,EAAEC,GAAG,GAAG,iBAAiBR,IAAIA,EAAEC,OAAOD,IAAI,iBAAiBE,IAAIA,EAAED,OAAOC,IAAI,iBAAiBK,IAAIA,EAAEN,OAAOM,IAAIA,GAAG,GAAG,MAAM,IAAIJ,WAAW,iBAAiB,GAAG,KAAKI,EAAE,OAAO,GAAG,GAAGP,EAAEI,EAAEJ,EAAEO,GAAGL,EAAE,GAAG,OAAOG,EAAEW,EAAEhB,EAAED,EAAEG,GAAGK,EAAEC,GAAGD,GAAG,QAAG,IAASC,EAAE,OAAO,SAAST,EAAEC,EAAEE,EAAEE,GAAG,MAAMC,EAAED,EAAEa,KAAKlB,GAAGA,EAAE,IAAIA,EAAE,KAAKQ,EAAEH,EAAEa,KAAKlB,GAA1Y,SAAWA,GAAG,OAAOA,EAAEkB,KAAKlB,GAAGA,EAAE,KAAKA,EAAE,GAAG,KAAKA,EAAE,GAAG,MAAMgB,QAAM,CAAGhB,EAAEC,IAAIA,EAAED,GAAG,GAAG,CAA2TmB,CAAE,CAACnB,MAAMS,EAAED,EAAEU,KAAG,CAAGf,EAAEE,IAAIY,EAAEjB,EAAEC,EAAEE,EAAEG,EAAED,MAAM,OAAOE,EAAEE,EAAEH,EAAEH,EAAE,CAArH,CAAuHF,EAAEE,EAAEK,EAAE,SAASR,GAAG,MAAMC,EAAE,CAAE,EAAC,OAAOD,EAAEoB,SAASpB,IAAI,GAAG,iBAAiBA,GAAG,iBAAiBA,EAAE,CAAC,MAAMG,EAAEkB,OAAOrB,QAAG,IAASC,EAAEE,GAAGF,EAAEE,GAAG,CAACmB,EAAEpB,OAAOF,GAAGuB,EAAE,IAAItB,EAAEE,GAAGoB,GAAG,EAAE,KAAK,CAAC,MAAMpB,EAAEkB,OAAOrB,EAAE,SAAI,IAASC,EAAEE,GAAGF,EAAEE,GAAG,CAACmB,EAAEpB,OAAOF,EAAE,IAAIuB,EAAErB,OAAOF,EAAE,KAAKC,EAAEE,GAAGoB,GAAGrB,OAAOF,EAAE,GAAG,CAAE,IAAGwB,OAAOC,OAAOxB,GAAGiB,KAAKlB,GAAG,CAACA,EAAEsB,EAAEtB,EAAEuB,IAAI,CAArS,CAAuSd,IAAI,IAAIC,EAAE,GAAG,KAAKP,EAAE,GAAGA,EAAE,KAAK,KAAKO,EAAEA,EAAET,EAAEO,GAAGL,GAAG,GAAGF,EAAEA,GAAG,GAAGO,EAAE,OAAOE,CAAC,CCAl5E,SAAUgB,EAAYC,GAC1B,IAAIC,EAAM,GACV,IAAK,MAAMrB,KAAKoB,EAAIF,SAAU,CAE5BG,GAAOA,GAAO,IADH1B,OAAOK,EAEnB,CACD,OAAOqB,CACT,CCPiB,IAAIC,QAAeC,OAAO,mBAY3BC,EAAWC,EAAoBC,GAAc,GAC3D,GAAID,EAAa,EAAG,MAAM,IAAI5B,WAAW,0BAEzC,OAAO,IAAI8B,SAAQ,SAAUC,EAASC,GAElCP,EAAOQ,YAAYL,GAAY,SAAUM,EAAKX,GAChC,OAARW,GAAcF,EAAOE,GAErBL,IAAaN,EAAI,GAAc,IAATA,EAAI,IAC9BQ,EAAQR,EACV,GAiBJ,GACF,UAagBY,EAAeP,EAAoBC,GAAuB,GACxE,GAAID,EAAa,EAAG,MAAM,IAAI5B,WAAW,0BAGxB,CACf,MAAMuB,EAAME,EAAOQ,YAAYL,GAG/B,OADIC,IAAaN,EAAI,GAAc,IAATA,EAAI,IACvBA,CAgBR,CAEH,UCnEgBa,EAAUC,EAAmBR,GAAuB,GAClE,GAAIQ,EAAY,EAAG,MAAM,IAAIrC,WAAW,yBAExC,MAAM4B,EAAaU,KAAKC,KAAKF,EAAY,GACnCG,EAAgBH,EAAY,EAElC,OAAO,IAAIP,SAAQ,CAACC,EAASC,KAC3BL,EAAUC,GAAY,GAAOa,MAAK,SAAUC,GAK1C,GAJsB,IAAlBF,IAEFE,EAAS,GAAKA,EAAS,GAAM,GAAKF,EAAgB,GAEhDX,EAAa,CACf,MAAMc,EAA0B,IAAlBH,EAAuB,IAAMA,EAAgB,GAAK,IAChEE,EAAS,GAAKA,EAAS,GAAKC,CAC7B,CACDZ,EAAQW,EACV,GAAE,GAEN,UAWgBE,EAAcP,EAAmBR,GAAuB,GACtE,GAAIQ,EAAY,EAAG,MAAM,IAAIrC,WAAW,yBAExC,MACM0C,EAAWP,EADEG,KAAKC,KAAKF,EAAY,IACE,GACrCG,EAAgBH,EAAY,EAKlC,GAJsB,IAAlBG,IAEFE,EAAS,GAAKA,EAAS,GAAM,GAAKF,EAAgB,GAEhDX,EAAa,CACf,MAAMc,EAA0B,IAAlBH,EAAuB,IAAMA,EAAgB,GAAK,IAChEE,EAAS,GAAKA,EAAS,GAAKC,CAC7B,CACD,OAAOD,CACT,UC5CgBG,EAAaC,EAAaC,EAAc,IACtD,GAAID,GAAOC,EAAK,MAAM,IAAI/C,WAAW,gCACrC,MAAMgD,EAAWF,EAAMC,EACjBE,EAASZ,EAAUW,GACzB,IAAIE,EACJ,EAAG,CAEDA,EAAM5B,EADMsB,EAAaK,UAElBC,EAAMF,GACf,OAAOE,EAAMH,CACf,CCjBA,IAAII,GAAc,EAGhB,UACQzB,OAAO,kBACbyB,GAAc,CACf,CAAuB,MAAOlD,GAC7BmD,QAAQC,IAAI,uWAIb,CCEG,SAAUC,EAAiBC,EAAkBC,EAAqB,GAAIC,GAA0B,GAIpG,GAHiB,iBAANF,IACTA,EAAIzD,OAAOyD,IAETA,EAAI,GAAI,MAAMvD,WAAW,kBAG3B,OACS,IAAI8B,SADR2B,GAAkBN,EACF,CAACpB,EAASC,KAC3B,MAAM0B,EAAS,IAAIC,EAAcC,OAAOC,cAAUC,MAElDJ,EAAOK,GAAG,WAAYC,SACQC,IAAxBD,GAAME,MAAMC,UACdT,EAAOU,YAAYC,MAAMrC,GACzBD,EAAQiC,EAAKE,KAAKC,SACnB,IAGHT,EAAOK,GAAG,QAAS/B,GAEnB,MAAMsC,EAAuB,CAC3BJ,KAAM,CACJhB,IAAKK,EACLC,aACAe,GAAI,IAGRb,EAAOc,YAAYF,EAAI,EAGLvC,IAClBA,EAAQ0C,EAAiBlB,EAAaC,GAAY,EA4B1D,CAEgB,SAAAiB,EAAkBlB,EAAWC,GAK3C,GAAU,KAAND,EAAU,OAAO,EAChB,GAAiB,MAAR,GAAJA,IAAwB,KAANA,EAAU,OAAO,EAK7C,MAAMmB,EAAc,CAClB,GACA,GACA,GACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,OAGF,IAAK,IAAIvE,EAAI,EAAGA,EAAIuE,EAAY/D,QAAW+D,EAAYvE,IAAMoD,EAAIpD,IAAK,CACpE,MAAMe,EAAIwD,EAAYvE,GACtB,GAAIoD,IAAMrC,EAAG,OAAO,EACf,GAAIqC,EAAIrC,IAAM,GAAI,OAAO,CAC/B,CAqBD,IAAIH,EAAI,GACR,MAAM4D,EAAIpB,EAAI,GACd,IAAIqB,EAAMD,EACV,KAAOC,EAAM,KAAO,IAClBA,GAAO,KACL7D,EAGJ,MAAM8D,EAAIF,EAAK,IAAM5D,EAErB,EAAG,CAED,IAAI+D,EAAIC,EADElC,EAAY8B,EAAG,IACPE,EAAGtB,GACrB,GAAU,KAANuB,GAAYA,IAAMH,EAAG,SACzB,IAAIK,EAAI,EACR,KAAOA,EAAIjE,IACT+D,EAAIC,EAAOD,EAAG,GAAIvB,GACduB,IAAMH,IAFE,CAGZ,GAAU,KAANG,EAAU,OAAO,EACrBE,GACD,CACD,GAAIF,IAAMH,EAAG,OAAO,CACrB,OAAyB,KAAfnB,GAEX,OAAO,CACT,CAkCA,GAAmBL,EACjB,IACE,IAAIQ,QAAsBjC,OAAO,kBAEjC,IADmBiC,EAA0B,cACA,OAA7BA,EAAcsB,WAAqB,CACjD,MAAMA,EAAatB,EAAcsB,WACjCA,EAAWlB,GAAG,WAAW,SAAUC,GACjC,QAA+BC,IAA3BD,GAAME,MAAMV,iBAAgDS,IAApBD,GAAME,MAAMhB,IAAmB,CACzE,MACMoB,EAAuB,CAC3BJ,KAAM,CACJC,QAHYM,EAAiBT,EAAKE,KAAKhB,IAAKc,EAAKE,KAAKV,YAItD0B,MAAOlB,EAAKE,KAAKhB,IACjBqB,GAAIP,EAAKE,KAAKK,KAGlBU,EAAWT,YAAYF,EACxB,CACH,GACD,CACF,CAAC,MAAOa,GAAS,CC1bH,IAAIC,QAAW1D,OAAO,MAErC,IACE,IAAIiC,QAAsBjC,OAAO,iBAClC,CAAC,MAAQ,UAiBI2D,EAAOhD,EAAmBmB,EAAqB,IAC7D,GAAInB,EAAY,EAAG,MAAM,IAAIrC,WAAW,yBAGxC,IAAKmD,EAAa,CAChB,IAAID,EAAM,GACV,GACEA,EAAM5B,EAAWsB,EAAaP,GAAW,WACjCoC,EAAiBvB,EAAKM,IAChC,OAAO,IAAI1B,SAASC,IAAcA,EAAQmB,EAAI,GAC/C,CAED,OAAO,IAAIpB,SAAQ,CAACC,EAASC,KAC3B,MAAMsD,EAAyC,GACzCC,EAAa,CAACjB,EAAsBkB,KACxC,GAAIlB,EAAIJ,KAAKC,QAAS,CAEpB,IAAK,IAAIa,EAAI,EAAGA,EAAIM,EAAW3E,OAAQqE,IACrCM,EAAWN,GAAGZ,YAEhB,KAAOkB,EAAW3E,OAAS,GACzB2E,EAAWG,MAEb1D,EAAQuC,EAAIJ,KAAKgB,MAClB,KAAM,CACL,MACMhC,EAAM5B,EADAsB,EAAaP,GAAW,IAEpC,IACE,MAAMqD,EAA+B,CACnCxB,KAAM,CACJhB,MACAM,aACAe,GAAID,EAAIJ,KAAKK,KAGjBiB,EAAUhB,YAAYkB,EACvB,CAAC,MAAOP,GAER,CACF,GAUD,IAAK,IAAIhF,EAAI,EAAGA,EAAIiF,EAAGO,OAAOhF,OAAS,EAAGR,IAAK,CAC7C,MAAMqF,EAAY,IAAI7B,EAAcC,OAAOC,cAAUC,MACrD0B,EAAUzB,GAAG,WAAYO,GAAyBiB,EAAWjB,EAAKkB,KAClEF,EAAWM,KAAKJ,EACjB,CAEH,IAAK,IAAIrF,EAAI,EAAGA,EAAImF,EAAW3E,OAAQR,IACrCiC,EAASC,GAAW,GAAMI,MAAK,SAAUlB,GACvC,MAAM2B,EAAM5B,EAAWC,GACvB+D,EAAWnF,GAAGqE,YAAY,CACxBN,KAAM,CACJhB,MACAM,aACAe,GAAIpE,IAGV,IAAGkE,MAAMrC,EACV,GAEL,UAagB6D,EAAWxD,EAAmBmB,EAAqB,IACjE,GAAInB,EAAY,EAAG,MAAM,IAAIrC,WAAW,yBACxC,IAAIkD,EAAM,GACV,GACEA,EAAM5B,EAAWsB,EAAaP,GAAW,WACjCoC,EAAiBvB,EAAKM,IAChC,OAAON,CACT","x_google_ignoreList":[0]}
+import{fileURLToPath as n}from"url";function t(n){return n>=0?n:-n}function e(n){if("number"==typeof n&&(n=BigInt(n)),1n===n)return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),n<=0n||t<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const u=t/n,s=t%n,a=e-o*u,c=r-i*u;t=n,n=s,e=o,r=i,o=a,i=c}return{g:t,x:e,y:r}}function o(n,t){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof t&&(t=BigInt(t)),t<=0n)throw new RangeError("n must be > 0");const e=n%t;return e<0n?e+t:e}function i(n,t){const e=r(o(n,t),t);if(1n!==e.g)throw new RangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);return o(e.x,t)}function u(n,t,e){if(n.length!==t.length)throw new RangeError("The remainders and modulos arrays should have the same length");const r=e??t.reduce(((n,t)=>n*t),1n);return t.reduce(((t,e,u)=>{const s=r/e;return o(t+s*i(s,e)%r*n[u]%r,r)}),0n)}function s(n,e){let r="number"==typeof n?BigInt(t(n)):t(n),o="number"==typeof e?BigInt(t(e)):t(e);if(0n===r)return o;if(0n===o)return r;let i=0n;for(;0n===(1n&(r|o));)r>>=1n,o>>=1n,i++;for(;0n===(1n&r);)r>>=1n;do{for(;0n===(1n&o);)o>>=1n;if(r>o){const n=r;r=o,o=n}o-=r}while(0n!==o);return r<<i}function a(n,e){return"number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),0n===n&&0n===e?BigInt(0):t(n/s(n,e)*e)}function c(n,t){return n>=t?n:t}function f(n,t){return n>=t?t:n}function g(n,t){const e=BigInt(t);return o(n.map((n=>BigInt(n)%e)).reduce(((n,t)=>n+t%e),0n),e)}function m(n,t){const e=BigInt(t);return o(n.map((n=>BigInt(n)%e)).reduce(((n,t)=>n*t%e),1n),e)}function h(n){return n.map((n=>n[0]**(n[1]-1n)*(n[0]-1n))).reduce(((n,t)=>t*n),1n)}function d(n,e,r,s){if("number"==typeof n&&(n=BigInt(n)),"number"==typeof e&&(e=BigInt(e)),"number"==typeof r&&(r=BigInt(r)),r<=0n)throw new RangeError("n must be > 0");if(1n===r)return 0n;if(n=o(n,r),e<0n)return i(d(n,t(e),r,s),r);if(void 0!==s)return function(n,t,e,r){const o=r.map((n=>n[0]**n[1])),i=r.map((n=>h([n]))),s=i.map(((e,r)=>d(n,t%e,o[r])));return u(s,o,e)}(n,e,r,function(n){const t={};return n.forEach((n=>{if("bigint"==typeof n||"number"==typeof n){const e=String(n);void 0===t[e]?t[e]={p:BigInt(n),k:1n}:t[e].k+=1n}else{const e=String(n[0]);void 0===t[e]?t[e]={p:BigInt(n[0]),k:BigInt(n[1])}:t[e].k+=BigInt(n[1])}})),Object.values(t).map((n=>[n.p,n.k]))}(s));let a=1n;for(;e>0;)e%2n===1n&&(a=a*n%r),e/=2n,n=n**2n%r;return a}function l(n){let t=0n;for(const e of n.values()){t=(t<<8n)+BigInt(e)}return t}var b=await import("crypto");function p(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){b.randomBytes(n,(function(n,o){null!==n&&r(n),t&&(o[0]=128|o[0]),e(o)}))}))}function w(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=b.randomBytes(n);return t&&(e[0]=128|e[0]),e}}function y(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,o)=>{p(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}n(e)}))}))}function B(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(0!==r&&(e[0]=e[0]&2**r-1),t){const n=0!==r?2**(r-1):128;e[0]=e[0]|n}return e}function I(n,t=1n){if(n<=t)throw new RangeError("Arguments MUST be: max > min");const r=n-t,o=e(r);let i;do{i=l(B(o))}while(i>r);return i+t}let _=!1;try{await import("worker_threads"),_=!0}catch(o){console.log("[bigint-crypto-utils] WARNING:\nThis node version doesn't support worker_threads. You should enable them in order to greatly speedup the generation of big prime numbers.\n  · With Node >=11 it is enabled by default (consider upgrading).\n  · With Node 10, starting with 10.5.0, you can enable worker_threads at runtime executing node --experimental-worker ")}function v(t,e=16,r=!1){if("number"==typeof t&&(t=BigInt(t)),t<0n)throw RangeError("w MUST be >= 0");return new Promise(!r&&_?(r,o)=>{const i=new E.Worker(n(import.meta.url));i.on("message",(n=>{void 0!==n?._bcu?.isPrime&&(i.terminate().catch(o),r(n._bcu.isPrime))})),i.on("error",o);const u={_bcu:{rnd:t,iterations:e,id:0}};i.postMessage(u)}:n=>{n(M(t,e))})}function M(n,t){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 u=o/2n**r;do{let t=d(I(o,2n),u,n);if(1n===t||t===o)continue;let e=1;for(;e<r&&(t=d(t,2n,n),t!==o);){if(1n===t)return!1;e++}if(t!==o)return!1}while(0!=--t);return!0}if(_)try{var E=await import("worker_threads");if(!E.isMainThread&&null!==E.parentPort){const n=E.parentPort;n.on("message",(function(t){if(void 0!==t?._bcu?.iterations&&void 0!==t?._bcu?.rnd){const e={_bcu:{isPrime:M(t._bcu.rnd,t._bcu.iterations),value:t._bcu.rnd,id:t._bcu.id}};n.postMessage(e)}}))}}catch(n){}var R=await import("os");try{var k=await import("worker_threads")}catch{}function S(t,e=16){if(t<1)throw new RangeError("bitLength MUST be > 0");if(!_){let n=0n;do{n=l(B(t,!0))}while(!M(n,e));return new Promise((t=>{t(n)}))}return new Promise(((r,o)=>{const i=[],u=(n,o)=>{if(n._bcu.isPrime){for(let n=0;n<i.length;n++)i[n].terminate();for(;i.length>0;)i.pop();r(n._bcu.value)}else{const r=l(B(t,!0));try{const t={_bcu:{rnd:r,iterations:e,id:n._bcu.id}};o.postMessage(t)}catch(n){}}};for(let t=0;t<R.cpus().length-1;t++){const t=new k.Worker(n(import.meta.url));t.on("message",(n=>u(n,t))),i.push(t)}for(let n=0;n<i.length;n++)y(t,!0).then((function(t){const r=l(t);i[n].postMessage({_bcu:{rnd:r,iterations:e,id:n}})})).catch(o)}))}function P(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");let e=0n;do{e=l(B(n,!0))}while(!M(e,t));return e}export{t as abs,e as bitLength,u as crt,r as eGcd,s as gcd,v as isProbablyPrime,a as lcm,c as max,f as min,g as modAdd,i as modInv,m as modMultiply,d as modPow,h as phi,S as prime,P as primeSync,I as randBetween,y as randBits,B as randBitsSync,p as randBytes,w as randBytesSync,o as toZn};
diff --git a/docs/API.md b/docs/API.md
index e42499b..6fb5546 100644
--- a/docs/API.md
+++ b/docs/API.md
@@ -2,18 +2,32 @@
 
 ## Table of contents
 
+### Interfaces
+
+- [Egcd](interfaces/Egcd.md)
+
+### Type Aliases
+
+- [PrimeFactor](API.md#primefactor)
+- [PrimeFactorization](API.md#primefactorization)
+- [PrimePower](API.md#primepower)
+
 ### Functions
 
 - [abs](API.md#abs)
 - [bitLength](API.md#bitlength)
+- [crt](API.md#crt)
 - [eGcd](API.md#egcd)
 - [gcd](API.md#gcd)
 - [isProbablyPrime](API.md#isprobablyprime)
 - [lcm](API.md#lcm)
 - [max](API.md#max)
 - [min](API.md#min)
+- [modAdd](API.md#modadd)
 - [modInv](API.md#modinv)
+- [modMultiply](API.md#modmultiply)
 - [modPow](API.md#modpow)
+- [phi](API.md#phi)
 - [prime](API.md#prime)
 - [primeSync](API.md#primesync)
 - [randBetween](API.md#randbetween)
@@ -23,6 +37,24 @@
 - [randBytesSync](API.md#randbytessync)
 - [toZn](API.md#tozn)
 
+## Type Aliases
+
+### PrimeFactor
+
+Ƭ **PrimeFactor**: `number` \| `bigint` \| [`PrimePower`](API.md#primepower)
+
+___
+
+### PrimeFactorization
+
+Ƭ **PrimeFactorization**: [`bigint`, `bigint`][]
+
+___
+
+### PrimePower
+
+Ƭ **PrimePower**: [`number` \| `bigint`, `number` \| `bigint`]
+
 ## Functions
 
 ### abs
@@ -65,9 +97,35 @@ The bit length
 
 ___
 
+### crt
+
+▸ **crt**(`remainders`, `modulos`, `modulo?`): `bigint`
+
+Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime (no two divisors share a common factor other than 1). Provided that n_i are pairwise coprime, and a_i any integers, this function returns a solution for the following system of equations:
+   x ≡ a_1 mod n_1
+   x ≡ a_2 mod n_2
+   ⋮
+   x ≡ a_k mod n_k
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `remainders` | `bigint`[] | the array of remainders a_i. For example [17n, 243n, 344n] |
+| `modulos` | `bigint`[] | the array of modulos n_i. For example [769n, 2017n, 47701n] |
+| `modulo?` | `bigint` | the product of all modulos. Provided here just to save some operations if it is already known |
+
+#### Returns
+
+`bigint`
+
+x
+
+___
+
 ### eGcd
 
-▸ **eGcd**(`a`, `b`): `Egcd`
+▸ **eGcd**(`a`, `b`): [`Egcd`](interfaces/Egcd.md)
 
 An iterative implementation of the extended euclidean algorithm or extended greatest common divisor algorithm.
 Take positive integers a, b as input, and return a triple (g, x, y), such that ax + by = g = gcd(a, b).
@@ -85,7 +143,7 @@ RangeError if a or b are <= 0
 
 #### Returns
 
-`Egcd`
+[`Egcd`](interfaces/Egcd.md)
 
 A triple (g, x, y), such that ax + by = g = gcd(a, b).
 
@@ -202,6 +260,27 @@ Minimum of numbers a and b
 
 ___
 
+### modAdd
+
+▸ **modAdd**(`addends`, `n`): `bigint`
+
+Modular addition of (a_1 + ... + a_r) mod n
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `addends` | (`number` \| `bigint`)[] | an array of the numbers a_i to add. For example [3, 12353251235n, 1243, -12341232545990n] |
+| `n` | `number` \| `bigint` | the modulo |
+
+#### Returns
+
+`bigint`
+
+The smallest positive integer that is congruent with (a_1 + ... + a_r) mod n
+
+___
+
 ### modInv
 
 ▸ **modInv**(`a`, `n`): `bigint`
@@ -227,6 +306,28 @@ The inverse modulo n
 
 ___
 
+### modMultiply
+
+▸ **modMultiply**(`factors`, `n`): `bigint`
+
+Modular addition of (a_1 * ... * a_r) mod n
+ *
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `factors` | (`number` \| `bigint`)[] | an array of the numbers a_i to multiply. For example [3, 12353251235n, 1243, -12341232545990n] * |
+| `n` | `number` \| `bigint` | the modulo * |
+
+#### Returns
+
+`bigint`
+
+The smallest positive integer that is congruent with (a_1 * ... * a_r) mod n
+
+___
+
 ### modPow
 
 ▸ **modPow**(`b`, `e`, `n`, `primeFactorization?`): `bigint`
@@ -244,7 +345,7 @@ RangeError if n <= 0
 | `b` | `number` \| `bigint` | base |
 | `e` | `number` \| `bigint` | exponent |
 | `n` | `number` \| `bigint` | modulo |
-| `primeFactorization?` | `PrimeFactor`[] | an array of the prime factors, for example [5n, 5n, 13n, 27n], or prime powers as [p, k], for instance [[5, 2], [13, 1], [27, 1]]. If the prime factorization is provided the chinese remainder theorem is used to greatly speed up the exponentiation. |
+| `primeFactorization?` | [`PrimeFactor`](API.md#primefactor)[] | an array of the prime factors, for example [5n, 5n, 13n, 27n], or prime powers as [p, k], for instance [[5, 2], [13, 1], [27, 1]]. If the prime factorization is provided the chinese remainder theorem is used to greatly speed up the exponentiation. |
 
 #### Returns
 
@@ -254,6 +355,26 @@ b**e mod n
 
 ___
 
+### phi
+
+▸ **phi**(`primeFactorization`): `bigint`
+
+A function that computes the Euler's totien function of a number n, whose prime power factorization is known
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `primeFactorization` | [`PrimeFactorization`](API.md#primefactorization) | an array of arrays containing the prime power factorization of a number n. For example, for n = (p1**k1)*(p2**k2)*...*(pr**kr), one should provide [[p1, k1], [p2, k2], ... , [pr, kr]] |
+
+#### Returns
+
+`bigint`
+
+phi((p1**k1)*(p2**k2)*...*(pr**kr))
+
+___
+
 ### prime
 
 ▸ **prime**(`bitLength`, `iterations?`): `Promise`<`bigint`\>
diff --git a/src/ts/index.ts b/src/ts/index.ts
index 3157d7e..29e543f 100644
--- a/src/ts/index.ts
+++ b/src/ts/index.ts
@@ -1,4 +1,4 @@
-export { abs, bitLength, eGcd, gcd, lcm, max, min, modInv, modPow, toZn } from 'bigint-mod-arith'
+export * from 'bigint-mod-arith'
 
 export { isProbablyPrime } from './isProbablyPrime.js'
 export { prime, primeSync } from './prime.js'