bigint-crypto-utils/dist/index.node.cjs

"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,6