functionn(n){returnn>=0?n:-n}functiont(n){if("number"==typeofn&&(n=BigInt(n)),1n===n)return1;lett=1;do{t++}while((n>>=1n)>1n);returnt}functione(n,t){if("number"==typeofn&&(n=BigInt(n)),"number"==typeoft&&(t=BigInt(t)),n<=0n||t<=0n)thrownewRangeError("a and b MUST be > 0");lete=0n,r=1n,o=1n,i=0n;for(;0n!==n;){constu=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}}functionr(t,e){letr="number"==typeoft?BigInt(n(t)):n(t),o="number"==typeofe?BigInt(n(e)):n(e);if(0n===r)returno;if(0n===o)returnr;leti=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){constn=r;r=o,o=n}o-=r}while(0n!==o);returnr<<i}functiono(t,e){return"number"==typeoft&&(t=BigInt(t)),"number"==typeofe&&(e=BigInt(e)),0n===t&&0n===e?BigInt(0):n(t/r(t,e)*e)}functioni(n,t){returnn>=t?n:t}functionu(n,t){returnn>=t?t:n}functions(n,t){if("number"==typeofn&&(n=BigInt(n)),"number"==typeoft&&(t=BigInt(t)),t<=0n)thrownewRangeError("n must be > 0");conste=n%t;returne<0n?e+t:e}functiona(n,t){constr=e(s(n,t),t);if(1n!==r.g)thrownewRangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);returns(r.x,t)}functionc(t,e,r){if("number"==typeoft&&(t=BigInt(t)),"number"==typeofe&&(e=BigInt(e)),"number"==typeofr&&(r=BigInt(r)),r<=0n)thrownewRangeError("n must be > 0");if(1n===r)return0n;if(t=s(t,r),e<0n)returna(c(t,n(e),r),r);leto=1n;for(;e>0;)e%2n===1n&&(o=o*t%r),e/=2n,t=t**2n%r;returno}functionf(n){lett=0n;for(consteofn.values()){t=(t<<8n)+BigInt(e)}returnt}varg=awaitimport("crypto");functionb(n,t=!1){if(n<1)thrownewRangeError("byteLength MUST be > 0");returnnewPromise((function(e,r){g.randomBytes(n,(function(n,o){null!==n&&r(n),t&&(o[0]=128|o[0]),e(o)}))}))}functionh(n,t=!1){if(n<1)thrownewRangeError("byteLength MUST be > 0");{conste=g.randomBytes(n);returnt&&(e[0]=128|e[0]),e}}functiond(n,t=!1){if(n<1)thrownewRangeError("bitLength MUST be > 0");conste=Math.ceil(n/8),r=n%8;returnnewPromise(((n,o)=>{b(e,!1).then((function(e){if(0!==r&&(e[0]=e[0]&2**r-1),t){constn=0!==r?2**(r-1):128;e[0]=e[0]|n}n(e)}))}))}functionm(n,t=!1){if(n<1)thrownewRangeError("bitLength MUST be > 0");conste=h(Math.ceil(n/8),!1),r=n%8;if(0!==r&&(e[0]=e[0]&2**r-1),t){constn=0!==r?2**(r-1):128;e[0]=e[0]|n}returne}functionl(n,e=1n){if(n<=e)thrownewRangeError("Arguments MUST be: max > min");constr=n-e,o=t(r);leti;do{i=f(m(o))}while(i>r);returni+e}letw=!1;try{awaitimport("worker_threads"),w=!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 ")}functionp(n,t=16,e=!1){if("number"==typeofn&&(n=BigInt(n)),n<0n)throwRangeError("w MUST be >= 0");returnnewPromise(!e&&w?(e,r)=>{consto=new_.Worker("./dist/esm/index.node.js");o.on("message",(n=>{void0!==n?._bcu?.isPrime&&(o.terminate().catch(r),e(n._bcu.isPrime))})),o.on("error",r);consti={_bcu:{rnd:n,iterations:t,id:0}};o.postMessage(i)}:e=>{e(y(n,t))})}functiony(n,t){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;conste=[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,91