"use strict";functionn(n){returnn>=0?n:-n}functione(n,e){if("number"==typeofn&&(n=BigInt(n)),"number"==typeofe&&(e=BigInt(e)),n<=0n||e<=0n)thrownewRangeError("a and b MUST be > 0");lett=0n,r=1n,o=1n,i=0n;for(;0n!==n;){consts=e/n,u=e%n,c=t-o*s,f=r-i*s;e=n,n=u,t=o,r=i,o=c,i=f}return{g:e,x:t,y:r}}functiont(e,t){letr="number"==typeofe?BigInt(n(e)):n(e),o="number"==typeoft?BigInt(n(t)):n(t);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}functionr(n,e){if("number"==typeofn&&(n=BigInt(n)),"number"==typeofe&&(e=BigInt(e)),e<=0n)thrownewRangeError("n must be > 0");constt=n%e;returnt<0n?t+e:t}functiono(n,t){consto=e(r(n,t),t);if(1n!==o.g)thrownewRangeError(`${n.toString()} does not have inverse modulo ${t.toString()}`);returnr(o.x,t)}functioni(n){lete=0n;for(consttofn.values()){e=(e<<8n)+BigInt(t)}returne}exports.toZn=void0,exports.modPow=void0,exports.modInv=void0,exports.min=void0,exports.max=void0,exports.lcm=void0,exports.gcd=void0,exports.eGcd=void0,exports.bitLength=void0,exports.abs=void0,exports.abs=n,exports.bitLength=function(n){if("number"==typeofn&&(n=BigInt(n)),1n===n)return1;lete=1;do{e++}while((n>>=1n)>1n);returne},exports.eGcd=e,exports.gcd=t,exports.lcm=function(e,r){return"number"==typeofe&&(e=BigInt(e)),"number"==typeofr&&(r=BigInt(r)),0n===e&&0n===r?BigInt(0):n(e/t(e,r)*r)},exports.max=function(n,e){returnn>=e?n:e},exports.min=function(n,e){returnn>=e?e:n},exports.modInv=o,exports.modPow=functione(t,i,s){if("number"==typeoft&&(t=BigInt(t)),"number"==typeofi&&(i=BigInt(i)),"number"==typeofs&&(s=BigInt(s)),s<=0n)thrownewRangeError("n must be > 0");if(1n===s)return0n;if(t=r(t,s),i<0n)returno(e(t,n(i),s),s);letu=1n;for(;i>0;)i%2n===1n&&(u=u*t%s),i/=2n,t=t**2n%s;returnu},exports.toZn=r;vars=require("crypto");functionu(n,e=!1){if(n<1)thrownewRangeError("byteLength MUST be > 0");returnnewPromise((function(t,r){s.randomBytes(n,(function(n,o){null!==n&&r(n),e&&(o[0]=128|o[0]),t(o)}))}))}functionc(n,e=!1){if(n<1)thrownewRangeError("byteLength MUST be > 0");{constt=s.randomBytes(n);returne&&(t[0]=128|t[0]),t}}functionf(n,e=!1){if(n<1)thrownewRangeError("bitLength MUST be > 0");constt=Math.ceil(n/8),r=n%8;returnnewPromise(((n,o)=>{u(t,!1).then((function(t){if(0!==r&&(t[0]=t[0]&2**r-1),e){constn=0!==r?2**(r-1):128;t[0]=t[0]|n}n(t)}))}))}functiona(n,e=!1){if(n<1)thrownewRangeError("bitLength MUST be > 0");constt=c(Math.ceil(n/8),!1),r=n%8;if(0!==r&&(t[0]=t[0]&2**r-1),e){constn=0!==r?2**(r-1):128;t[0]=t[0]|n}returnt}functiond(n,e=1n){if(n<=e)thrownewRangeError("Arguments MUST be: max > min");constt=n-e,r=exports.bitLength(t);leto;do{o=i(a(r))}while(o>t);returno+e}letp=!1;try{require("worker_threads"),p=!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 ")}functiong(n,e){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;constt=[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,