@tktb-tess/util-fns 0.1.0

package/README.md

@@ -0,0 +1,3 @@
+# tess-math-fns
+
+個人的に使う用の便利関数ライブラリ

package/dist/bundle.js

@@ -0,0 +1,2 @@
+const n=(n,t)=>{if(n.length!==t.length)return!1;for(let r=0;r<n.length;r++)if(n[r]!==t[r])return!1;return!0},t=n=>new Promise(t=>{setTimeout(()=>{t()},n)}),r=n=>(...t)=>()=>n(...t),e=n=>{const t=[];let r=[],e="",o=!1;for(let i=0;i<n.length;i++){const s=n[i];'"'!==s||0!==i&&"\\"===n[i-1]?","!==s||o?"\n"!==s||o?e+=s:(r.push(e.trim()),t.push(r),r=[],e=""):(r.push(e.trim()),e=""):o=!o}return r.push(e.trim()),t.push(r),t},o=async(n,t)=>{const r=Buffer.from(n,"utf8");return crypto.subtle.digest(t,r).then(n=>Buffer.from(n))},i=n=>{let t=n.toString(16);return 1&t.length&&(t="0"+t),Buffer.from(t,"hex")},s=n=>{const t=n.toString("hex")||"00";return BigInt("0x"+t)},u=(n,t)=>Math.floor(Math.random()*(t-n)+n),f=(n,t)=>{const r=n%t;return r<0n?r+t:r},a=(...n)=>n.map(n=>BigInt(n)),g=(n,t=!1)=>{if(!Number.isFinite(n))throw Error("`length` is not a valid number");if(n<=0)throw Error("`length` must be positive");const r=Math.ceil(n/32),e=crypto.getRandomValues(new Uint32Array(r));let o=Array.from(e,n=>n.toString(2).padStart(32,"0")).join("");return o=o.slice(0,n),t&&(o=o.replace(/^./,"1")),BigInt("0b"+o)},h=(n,t)=>{if(n>=t)throw Error("RangeError");const r=t-n,e=r.toString(2).length;return n+(()=>{for(let n=0;n<1e5;n++){const n=g(e);if(n>=c(2n,BigInt(e),r))return n%r}throw Error("Failed to generate a random bigint")})()},c=(n,t,r)=>{if(r<1n)throw Error("`mod` must be positive");if(t<0n)throw Error("`power` must not be negative");for(;n<0n;)n+=r;if(1n===r)return 0n;if(n%r===1n||n%r===0n)return n;if(n===r-1n)return 1n&t?r-1n:1n;let e=1n;for(;t>0n;)1n&t&&(e=e*n%r),n=n*n%r,t>>=1n;return e},l=(n,t)=>{if(0n===n&&0n===t)return{x:0n,y:0n,gcd:0n};if(0n===n)return t>0n?{x:0n,y:-1n,gcd:t}:{x:0n,y:1n,gcd:-t};if(0n===t)return n>0n?{x:1n,y:0n,gcd:n}:{x:-1n,y:0n,gcd:-n};let[r,e,o]=[1n,0n,n],[i,s,u]=[0n,-1n,t];for(;;){const n=o/u,t=o-n*u;if(0n===t)break;[r,i]=[i,r-n*i],[e,s]=[s,e-n*s],[o,u]=[u,t]}return u<0n&&(i*=-1n,s*=-1n,u*=-1n),{x:i,y:s,gcd:u}},d=n=>{if(n<0n)throw Error("'n_' must be non-negative");if(0n===n)return 1n;const t=(n,r)=>{if(n>=r)return 1n;const e=(r-n)/2n;if(BigInt((r-2n).toString(2).length)*e<63n){let t=n;for(let e=n+2n;e<r;e+=2n)t*=e;return t}const o=n+e|1n;return t(n,o)*t(o,r)},r=n-BigInt(n.toString(2).match(/1/g)?.length??0),e=(n=>{let r=3n,e=1n,o=1n;for(let i=BigInt(n.toString(2).length)-1n-1n;i>-1n;--i){const s=1n+(n>>i)|1n;o*=t(r,s),r=s,e*=o}return e})(n);return e<<r},m=(n,t)=>BigInt.asUintN(32,n>>(31n&t)|n<<(31n&-t)),b=(n,t)=>n>>>(31&t)|n<<(31&-t),p=(n,t)=>{if(t<1n||t%2n==0n)throw Error("`n` is invalid");for(;n<0n;)n+=t;n%=t;let r=1n;for(;0n!==n;){for(;n%2n==0n;){n/=2n;const e=t%8n;3n!==e&&5n!==e||(r*=-1n)}[n,t]=[t,n],n%4n==3n&&t%4n==3n&&(r*=-1n),n%=t}return 1n===t?r:0n},w=n=>{if(n<0n)return!1;if(0n===n)return!0;let t=1n,r=n;for(;t+1n<r;){const e=(t+r)/2n;e**2n<n?t=e:r=e}return n===t**2n||n===(t+1n)**2n},y=[0x853c49e6748fea9bn,0xda3e39cb94b95bdbn];class B{#n=new BigUint64Array(2);get[Symbol.toStringTag](){return B.name}static getSeed(){return crypto.getRandomValues(new BigUint64Array(2))}constructor(n){n&&n[0]&&n[1]?(this.#n[1]=n[1]<<1n|1n,this.step(),this.#n[0]=n[0],this.step()):(this.#n[0]=y[0],this.#n[1]=y[1])}step(){this.#n[0]&&this.#n[1]&&(this.#n[0]=6364136223846793005n*this.#n[0]+this.#n[1])}get value(){const n=this.#n[0];if(!n)throw Error("empty state");const t=n>>59n,r=BigInt.asUintN(32,(n^n>>18n)>>27n);return b(Number(r),Number(t))}getRand(){return this.step(),this.value}getBoundedRand(n){const t=4294967296;if(n>t)throw Error("bound exceeded limit (2^32)");const r=t%n;for(;;){const t=this.getRand();if(t>=r)return t%n}}async*genRands(n,t){for(let r=0;r<n;r++)yield t?this.getBoundedRand(t):this.getRand()}}const E=(n,t)=>f(1n==(1n&n)?n+t>>1n:n>>1n,t),x=(n,t,r,e)=>{if(n%2n!=1n)throw Error("`n` must be odd");let o=n+1n,i=0n;for(;o%2n==0n;)o>>=1n,i+=1n;const[s,u]=((n,t,r,e)=>{let o=1n,i=r;const s=n.toString(2).slice(1);for(const n of s)[o,i]=[f(o*i,t),E(i*i+e*o*o,t)],"1"===n&&([o,i]=[E(r*o+i,t),E(e*o+r*i,t)]);return[o,i]})(o,n,r,t);let a=u;if(0n===s)return!0;e=c(e,o,n);for(let t=0n;t<i;t++){if(0n===a)return!0;a=f(a*a-2n*e,n),e=c(e,2n,n)}return!1},S=n=>{if(n<=1n)return!1;if(n%2n==0n)return 2n===n;const t=[2n,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];for(const r of t)if(n%r===0n)return n===r;if(!(n=>{if(n<=1n)return!1;if(n%2n==0n)return 2n===n;let t=n-1n,r=0n;for(;t%2n==0n;)t>>=1n,r+=1n;const[e,o]=[t,r];let i=c(2n,e,n);if(1n===i)return!0;for(let t=0n;t<o;t++){if(i===n-1n)return!0;i=i*i%n}return!1})(n))return!1;const[r,e]=(n=>{let t=5n,r=p(t,n);for(;r>0n;){if(t=t>0n?t+2n:t-2n,t*=-1n,-15n===t&&w(n))return[0n,0n];r=p(t,n)}return[t,r]})(n);if(0n===e)return!1;return x(n,r,1n,(1n-r)/4n)},I=(n,t)=>{if(t<2n)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const r=h(n,t);if(S(r))return r}throw Error("noPrimesFound")},R=(n,t=!1)=>{if(n<2)throw Error("noPrimesFound");for(let r=0;r<1e5;r++){const r=g(n,t);if(S(r))return r}throw Error("noPrimesFound")};export{i as BItoBuffer,B as PCGMinimal,S as bailliePSW,s as bufferToBI,l as exEuclidean,d as factorial,o as getHash,g as getRandBIByBitLength,h as getRandBIByRange,R as getRandPrimeByBitLength,I as getRandPrimeByRange,u as getRndInt,n as isEqArray,w as isSquare,p as jacobiSymbol,r as lazify,c as modPow,e as parseCSV,f as residue,b as rot32,m as rot32BI,t as sleep,a as toBigInt};
+//# sourceMappingURL=bundle.js.map

package/dist/bundle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bundle.js","sources":["../src/util.ts","../src/math.ts","../src/pcg-minimal.ts","../src/baillie-psw.ts"],"sourcesContent":[null,null,null,null],"names":["isEqArray","arr1","arr2","length","i","sleep","delay","Promise","resolve","setTimeout","lazify","func","args","parseCSV","csv","rows","row","currentField","isInsideOfQuote","char","push","trim","getHash","async","str","algorithm","utf8","Buffer","from","crypto","subtle","digest","then","hash","BItoBuffer","n","toString","bufferToBI","buf","BigInt","getRndInt","min","max","Math","floor","random","residue","mod","ans","toBigInt","nums","map","getRandBIByBitLength","fixed","Number","isFinite","Error","div","ceil","u32Arr","getRandomValues","Uint32Array","result","Array","padStart","join","slice","replace","getRandBIByRange","diff","bitLength","res","modPow","base","power","exEuclidean","a","b","x","y","gcd","x_1","y_1","c_1","x_2","y_2","c_2","q","c_nxt","factorial","oddProd","num_odds","mid","two_exp","match","odd_part","L_i","tmp","U_i","oddPart","rot32BI","value","rot","asUintN","rot32","jacobiSymbol","nMod8","isSquare","initialState","PCGMinimal","state","BigUint64Array","Symbol","toStringTag","name","getSeed","constructor","seeds","this","step","prev","shifted","getRand","getBoundedRand","bound","limit","threshold","r","genRands","div2Mod","lucasSPP","D","P","Q","d","s","U","V_","k","V","digits","digit","UVSubscript","bailliePSW","smallPrimes","p","d_","s_","millerRabinAtBase2","j","DChooser","getRandPrimeByRange","count","getRandPrimeByBitLength"],"mappings":"MAKaA,EAAY,CAAIC,EAAWC,KACtC,GAAID,EAAKE,SAAWD,EAAKC,OAAQ,OAAO,EAEtC,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAKE,OAAQC,IAC/B,GAAIH,EAAKG,KAAOF,EAAKE,GAAI,OAAO,EAGlC,OAAO,GASEC,EAASC,GACb,IAAIC,QAAeC,IACxBC,WAAW,KACTD,KACCF,KAKMI,EACoBC,GAC/B,IAAIC,IACJ,IACED,KAAQC,GAQCC,EAAYC,IACvB,MAAMC,EAAmB,GACzB,IAAIC,EAAgB,GAChBC,EAAe,GACfC,GAAkB,EAEtB,IAAK,IAAId,EAAI,EAAGA,EAAIU,EAAIX,OAAQC,IAAK,CACnC,MAAMe,EAAOL,EAAIV,GAEJ,MAATe,GAAuB,IAANf,GAA0B,OAAfU,EAAIV,EAAI,GAGpB,MAATe,GAAiBD,EAIR,OAATC,GAAkBD,EAQ3BD,GAAgBE,GANhBH,EAAII,KAAKH,EAAaI,QACtBN,EAAKK,KAAKJ,GACVA,EAAM,GACNC,EAAe,KAPfD,EAAII,KAAKH,EAAaI,QACtBJ,EAAe,IAJfC,GAAmBA,CAevB,CAMA,OAHAF,EAAII,KAAKH,EAAaI,QACtBN,EAAKK,KAAKJ,GAEHD,GASIO,EAAUC,MAAOC,EAAaC,KACzC,MAAMC,EAAOC,OAAOC,KAAKJ,EAAK,QAC9B,OAAOK,OAAOC,OACXC,OAAON,EAAWC,GAClBM,KAAMC,GAASN,OAAOC,KAAKK,KAGnBC,EAAcC,IACzB,IAAIX,EAAMW,EAAEC,SAAS,IAErB,OADiB,EAAbZ,EAAIrB,SAAYqB,EAAM,IAAMA,GACzBG,OAAOC,KAAKJ,EAAK,QAGba,EAAcC,IACzB,MAAMd,EAAMc,EAAIF,SAAS,QAAU,KACnC,OAAOG,OAAO,KAAOf,IC5FVgB,EAAY,CAACC,EAAaC,IAC9BC,KAAKC,MAAMD,KAAKE,UAAYH,EAAMD,GAAOA,GASrCK,EAAU,CAACX,EAAWY,KACjC,MAAMC,EAAMb,EAAIY,EAChB,OAAOC,EAAM,GAAKA,EAAMD,EAAMC,GAQnBC,EAAW,IAAIC,IACnBA,EAAKC,IAAKhB,GAAMI,OAAOJ,IAUnBiB,EAAuB,CAACjD,EAAgBkD,GAAQ,KAC3D,IAAKC,OAAOC,SAASpD,GAAS,MAAMqD,MAAM,kCAC1C,GAAIrD,GAAU,EAAG,MAAMqD,MAAM,6BAE7B,MAAMC,EAAMd,KAAKe,KAAKvD,EAAS,IACzBwD,EAAS9B,OAAO+B,gBAAgB,IAAIC,YAAYJ,IACtD,IAAIK,EAASC,MAAMnC,KAAK+B,EAASxB,GAAMA,EAAEC,SAAS,GAAG4B,SAAS,GAAI,MAAMC,KACtE,IAKF,OAHAH,EAASA,EAAOI,MAAM,EAAG/D,GACrBkD,IAAOS,EAASA,EAAOK,QAAQ,KAAM,MAElC5B,OAAO,KAAOuB,IASVM,EAAmB,CAAC3B,EAAaC,KAC5C,GAAID,GAAOC,EAAK,MAAMc,MAAM,cAC5B,MAAMa,EAAO3B,EAAMD,EACb6B,EAAYD,EAAKjC,SAAS,GAAGjC,OAanC,OAAOsC,EAXK,MAEV,IAAK,IAAIrC,EAAI,EAAGA,EADF,IACaA,IAAK,CAC9B,MAAMmE,EAAMnB,EAAqBkB,GACjC,GAAIC,GAAOC,EAAO,GAAIjC,OAAO+B,GAAYD,GACvC,OAAOE,EAAMF,CAEjB,CACA,MAAMb,MAAM,qCACb,EATW,IAqBDgB,EAAS,CAACC,EAAcC,EAAe3B,KAClD,GAAIA,EAAM,GAAI,MAAMS,MAAM,0BAC1B,GAAIkB,EAAQ,GAAI,MAAMlB,MAAM,gCAE5B,KAAOiB,EAAO,IAAIA,GAAQ1B,EAC1B,GAAY,KAARA,EAAY,OAAO,GACvB,GAAI0B,EAAO1B,IAAQ,IAAM0B,EAAO1B,IAAQ,GAAI,OAAO0B,EACnD,GAAIA,IAAS1B,EAAM,GAAI,OAAe,GAAR2B,EAAa3B,EAAM,GAAK,GAEtD,IAAIe,EAAS,GACb,KAAOY,EAAQ,IACD,GAARA,IAAYZ,EAAUA,EAASW,EAAQ1B,GAC3C0B,EAAQA,EAAOA,EAAQ1B,EACvB2B,IAAU,GAGZ,OAAOZ,GAYIa,EAAc,CAACC,EAAWC,KAErC,GAAU,KAAND,GAAkB,KAANC,EAAU,MAAO,CAAEC,EAAG,GAAIC,EAAG,GAAIC,IAAK,IACtD,GAAU,KAANJ,EACF,OAAOC,EAAI,GAAK,CAAEC,EAAG,GAAIC,GAAI,GAAIC,IAAKH,GAAM,CAAEC,EAAG,GAAIC,EAAG,GAAIC,KAAMH,GACpE,GAAU,KAANA,EACF,OAAOD,EAAI,GAAK,CAAEE,EAAG,GAAIC,EAAG,GAAIC,IAAKJ,GAAM,CAAEE,GAAI,GAAIC,EAAG,GAAIC,KAAMJ,GAEpE,IAAKK,EAAKC,EAAKC,GAAO,CAAC,GAAI,GAAIP,IAC1BQ,EAAKC,EAAKC,GAAO,CAAC,IAAK,GAAIT,GAEhC,OAAa,CACX,MAAMU,EAAIJ,EAAMG,EACVE,EAAQL,EAAMI,EAAID,EAExB,GAAc,KAAVE,EAAc,OAEjBP,EAAKG,GAAO,CAACA,EAAKH,EAAMM,EAAIH,IAC5BF,EAAKG,GAAO,CAACA,EAAKH,EAAMK,EAAIF,IAC5BF,EAAKG,GAAO,CAACA,EAAKE,EACrB,CASA,OANIF,EAAM,KACRF,IAAQ,GACRC,IAAQ,GACRC,IAAQ,IAGH,CAAER,EAAGM,EAAKL,EAAGM,EAAKL,IAAKM,IASnBG,EAAatD,IACxB,GAAIA,EAAI,GAAI,MAAMqB,MAAM,6BACxB,GAAU,KAANrB,EAAU,OAAO,GAQrB,MAAMuD,EAAU,CAACjD,EAAaC,KAC5B,GAAID,GAAOC,EAAK,OAAO,GAEvB,MACMiD,GAAYjD,EAAMD,GAAO,GAE/B,GAHiBF,QAAQG,EAAM,IAAIN,SAAS,GAAGjC,QAGhCwF,EAAW,IAAK,CAC7B,IAAI7B,EAASrB,EACb,IAAK,IAAIrC,EAAIqC,EAAM,GAAIrC,EAAIsC,EAAKtC,GAAK,GACnC0D,GAAU1D,EAEZ,OAAO0D,CACT,CAEA,MAAM8B,EAAOnD,EAAMkD,EAAY,GAG/B,OAFcD,EAAQjD,EAAKmD,GACZF,EAAQE,EAAKlD,IA0BxBmD,EAAU1D,EAAII,OAAOJ,EAAEC,SAAS,GAAG0D,MAAM,OAAO3F,QAAU,GAC1D4F,EAlBU,CAAC5D,IACf,IAAI6D,EAAM,GACRlC,EAAS,GACTmC,EAAM,GAGR,IAAK,IAAI7F,EAFCmC,OAAOJ,EAAEC,SAAS,GAAGjC,QAAU,GAExB,GAAIC,GAAK,KAAMA,EAAG,CACjC,MAAM8F,EAAkB,IAAV/D,GAAK/B,GAAW,GAE9B6F,GAAOP,EAAQM,EAAKE,GACpBF,EAAME,EACNpC,GAAUmC,CACZ,CAEA,OAAOnC,GAIQqC,CAAQhE,GAEzB,OAAO4D,GAAYF,GASRO,EAAU,CAACC,EAAeC,IAC9B/D,OAAOgE,QAAQ,GAAKF,IAAgB,IAANC,GAAeD,IAAiB,KAANC,IASpDE,EAAQ,CAACH,EAAeC,IAC3BD,KAAiB,GAANC,GAAcD,IAAiB,IAANC,GAQjCG,EAAe,CAAC7B,EAAWzC,KACtC,GAAIA,EAAI,IAAMA,EAAI,IAAO,GACvB,MAAMqB,MAAM,kBAEd,KAAOoB,EAAI,IACTA,GAAKzC,EAEPyC,GAAKzC,EAEL,IAAI2B,EAAS,GACb,KAAa,KAANc,GAAU,CACf,KAAOA,EAAI,IAAO,IAAI,CACpBA,GAAK,GACL,MAAM8B,EAAQvE,EAAI,GACJ,KAAVuE,GAA0B,KAAVA,IAClB5C,IAAW,GAEf,EACCc,EAAGzC,GAAK,CAACA,EAAGyC,GAETA,EAAI,IAAO,IAAMzC,EAAI,IAAO,KAC9B2B,IAAW,IAEbc,GAAKzC,CACP,CAEA,OAAa,KAANA,EAAW2B,EAAS,IAQhB6C,EAAYxE,IACvB,GAAIA,EAAI,GAAI,OAAO,EACnB,GAAU,KAANA,EAAU,OAAO,EACrB,IAAI2C,EAAI,GACJC,EAAI5C,EACR,KAAO2C,EAAI,GAAKC,GAAG,CACjB,MAAMa,GAAOd,EAAIC,GAAK,GAElBa,GAAO,GAAKzD,EACd2C,EAAIc,EAEJb,EAAIa,CAER,CACA,OAAOzD,IAAM2C,GAAK,IAAM3C,KAAO2C,EAAI,KAAO,ICtRtC8B,EAAe,CAAC,oBAAqB,qBAQ7B,MAAOC,EACVC,GAAS,IAAIC,eAAe,GAErC,IAAKC,OAAOC,eACV,OAAOJ,EAAWK,IACpB,CAGA,cAAOC,GACL,OAAOtF,OAAO+B,gBAAgB,IAAImD,eAAe,GACnD,CAKA,WAAAK,CAAYC,GAENA,GAASA,EAAM,IAAMA,EAAM,IAC7BC,MAAKR,EAAO,GAAMO,EAAM,IAAM,GAAM,GACpCC,KAAKC,OACLD,MAAKR,EAAO,GAAKO,EAAM,GACvBC,KAAKC,SAELD,MAAKR,EAAO,GAAKF,EAAa,GAC9BU,MAAKR,EAAO,GAAKF,EAAa,GAElC,CAGA,IAAAW,GACMD,MAAKR,EAAO,IAAMQ,MAAKR,EAAO,KAChCQ,MAAKR,EAAO,GApCA,qBAoCKQ,MAAKR,EAAO,GAAiBQ,MAAKR,EAAO,GAE9D,CAGA,SAAIT,GACF,MAAMmB,EAAOF,MAAKR,EAAO,GACzB,IAAKU,EAAM,MAAMhE,MAAM,eACvB,MAAM8C,EAAMkB,GAAQ,IACdC,EAAUlF,OAAOgE,QAAQ,IAAKiB,EAAQA,GAAQ,MAAS,KAC7D,OAAOhB,EAAMlD,OAAOmE,GAAUnE,OAAOgD,GACvC,CAKA,OAAAoB,GAEE,OADAJ,KAAKC,OACED,KAAKjB,KACd,CAGA,cAAAsB,CAAeC,GAEb,MAAMC,EAAQ,WAEd,GAAID,EAAQC,EAAO,MAAMrE,MAAM,+BAE/B,MAAMsE,EAAYD,EAAQD,EAE1B,OAAa,CACX,MAAMG,EAAIT,KAAKI,UACf,GAAIK,GAAKD,EAAW,OAAOC,EAAIH,CACjC,CACF,CAOA,cAAOI,CAAST,EAAcK,GAC5B,IAAK,IAAIxH,EAAI,EAAGA,EAAImH,EAAMnH,UAClBwH,EAAQN,KAAKK,eAAeC,GAASN,KAAKI,SAEpD,EClEF,MAgDMO,EAAU,CAACnD,EAAW3C,IACFW,EAAL,KAAR,GAAJgC,GAA0BA,EAAI3C,GAAM,GAAiB2C,GAAK,GAAlB3C,GAmC3C+F,EAAW,CAAC/F,EAAWgG,EAAWC,EAAWC,KAClD,GAAIlG,EAAI,IAAO,GAAI,MAAMqB,MAAM,mBAC/B,IAAI8E,EAAInG,EAAI,GACRoG,EAAI,GAER,KAAOD,EAAI,IAAO,IACjBA,IAAM,GACNC,GAAK,GAIN,MAAOC,EAAGC,GAnCS,EAACC,EAAWvG,EAAWiG,EAAWD,KACrD,IAAIK,EAAI,GACJG,EAAIP,EACR,MAAMQ,EAASF,EAAEtG,SAAS,GAAG8B,MAAM,GAEnC,IAAK,MAAM2E,KAASD,GAClBJ,EAAGG,GAAK,CAAC7F,EAAQ0F,EAAIG,EAAGxG,GAAI8F,EAAQU,EAAIA,EAAIR,EAAIK,EAAIA,EAAGrG,IAE1C,MAAV0G,KACFL,EAAGG,GAAK,CAACV,EAAQG,EAAII,EAAIG,EAAGxG,GAAI8F,EAAQE,EAAIK,EAAIJ,EAAIO,EAAGxG,KAI1D,MAAO,CAACqG,EAAGG,IAsBKG,CAAYR,EAAGnG,EAAGiG,EAAGD,GACrC,IAAIQ,EAAIF,EAIR,GAAU,KAAND,EAAU,OAAO,EAErBH,EAAI7D,EAAO6D,EAAGC,EAAGnG,GAEjB,IAAK,IAAI/B,EAAI,GAAIA,EAAImI,EAAGnI,IAAK,CAE5B,GAAU,KAANuI,EAAU,OAAO,EAErBA,EAAI7F,EAAQ6F,EAAIA,EAAI,GAAKN,EAAGlG,GAC5BkG,EAAI7D,EAAO6D,EAAG,GAAIlG,EACnB,CACA,OAAO,GAQK4G,EAAc5G,IAC1B,GAAIA,GAAK,GAAI,OAAO,EACpB,GAAIA,EAAI,IAAO,GAAI,OAAa,KAANA,EAG1B,MAAM6G,EAAiC,CACtC,GACA,GACA,GACA,GACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,MAGD,IAAK,MAAMC,KAAKD,EACf,GAAI7G,EAAI8G,IAAM,GACb,OAAO9G,IAAM8G,EAIf,IA/J0B,CAAC9G,IAC3B,GAAIA,GAAK,GAAI,OAAO,EACpB,GAAIA,EAAI,IAAO,GAAI,OAAa,KAANA,EAC1B,IAAI+G,EAAK/G,EAAI,GACTgH,EAAK,GAET,KAAOD,EAAK,IAAO,IAClBA,IAAO,GACPC,GAAM,GAEP,MAAOb,EAAGC,GAAK,CAACW,EAAIC,GAGpB,IAAIpE,EAAIP,EADE,GACQ8D,EAAGnG,GAErB,GAAU,KAAN4C,EAAU,OAAO,EAErB,IAAK,IAAI3E,EAAI,GAAIA,EAAImI,EAAGnI,IAAK,CAC5B,GAAI2E,IAAM5C,EAAI,GAAI,OAAO,EACzB4C,EAAKA,EAAIA,EAAK5C,CACf,CACA,OAAO,GA0IFiH,CAAmBjH,GAEvB,OAAO,EAGR,MAAOgG,EAAGkB,GA5IM,CAAClH,IACjB,IAAIgG,EAAI,GACJkB,EAAI5C,EAAa0B,EAAGhG,GAExB,KAAOkH,EAAI,IAAI,CAId,GAHAlB,EAAIA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAC1BA,IAAM,IAEK,MAAPA,GAAcxB,EAASxE,GAG1B,MAAO,CAAC,GAAI,IAEbkH,EAAI5C,EAAa0B,EAAGhG,EACrB,CACA,MAAO,CAACgG,EAAGkB,IA6HIC,CAASnH,GACxB,GAAU,KAANkH,EAAU,OAAO,EAIrB,OAAOnB,EAAS/F,EAAGgG,EAAG,IAFX,GAAKA,GAAK,KAYToB,EAAsB,CAAC9G,EAAaC,KAEhD,GAAIA,EAAM,GACT,MAAMc,MAAM,iBAEb,IAAK,IAAIgG,EAAQ,EAAGA,EAJN,IAIqBA,IAAS,CAC3C,MAAMP,EAAI7E,EAAiB3B,EAAKC,GAChC,GAAIqG,EAAWE,GAAI,OAAOA,CAC3B,CAEA,MAAMzF,MAAM,kBASAiG,EAA0B,CAACnF,EAAmBjB,GAAQ,KAElE,GAAIiB,EAAY,EACf,MAAMd,MAAM,iBAEb,IAAK,IAAIgG,EAAQ,EAAGA,EAJN,IAIqBA,IAAS,CAC3C,MAAMP,EAAI7F,EAAqBkB,EAAWjB,GAC1C,GAAI0F,EAAWE,GAAI,OAAOA,CAC3B,CAEA,MAAMzF,MAAM"}

package/dist/types/baillie-psw.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Baillie-PSW素数判定法
+ * @param n 判定したい整数
+ * @returns
+ */
+export declare const bailliePSW: (n: bigint) => boolean;
+/**
+ * 指定範囲内の確率的素数を返す
+ * @param min 下限
+ * @param max 上限
+ * @returns
+ */
+export declare const getRandPrimeByRange: (min: bigint, max: bigint) => bigint;
+/**
+ * 指定ビットの確率的素数を返す
+ * @param bitLength ビット長
+ * @param fixed true: 固定長, false (デフォルト値): `length` ビット以下の可変ビット長
+ * @returns
+ */
+export declare const getRandPrimeByBitLength: (bitLength: number, fixed?: boolean) => bigint;
+//# sourceMappingURL=baillie-psw.d.ts.map

package/dist/types/baillie-psw.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"baillie-psw.d.ts","sourceRoot":"","sources":["../../src/baillie-psw.ts"],"names":[],"mappings":"AAuIA;;;;GAIG;AACH,eAAO,MAAM,UAAU,GAAI,GAAG,MAAM,YAoDnC,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,GAAI,KAAK,MAAM,EAAE,KAAK,MAAM,WAW3D,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,GAAI,WAAW,MAAM,EAAE,eAAa,WAWvE,CAAC"}

package/dist/types/main.d.ts

@@ -0,0 +1,6 @@
+import { isEqArray, sleep, lazify, parseCSV, getHash, BItoBuffer, bufferToBI } from './util';
+import { getRndInt, residue, toBigInt, getRandBIByBitLength, getRandBIByRange, modPow, exEuclidean, factorial, rot32, rot32BI, jacobiSymbol, isSquare } from './math';
+import PCGMinimal from './pcg-minimal';
+import { bailliePSW, getRandPrimeByBitLength, getRandPrimeByRange } from './baillie-psw';
+export { isEqArray, sleep, lazify, parseCSV, getHash, BItoBuffer, bufferToBI, getRndInt, residue, toBigInt, getRandBIByBitLength, getRandBIByRange, modPow, exEuclidean, factorial, rot32, rot32BI, jacobiSymbol, isSquare, bailliePSW, getRandPrimeByBitLength, getRandPrimeByRange, PCGMinimal, };
+//# sourceMappingURL=main.d.ts.map

package/dist/types/main.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.d.ts","sourceRoot":"","sources":["../../src/main.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,SAAS,EACT,KAAK,EACL,MAAM,EACN,QAAQ,EACR,OAAO,EACP,UAAU,EACV,UAAU,EACX,MAAM,QAAQ,CAAC;AAChB,OAAO,EACL,SAAS,EACT,OAAO,EACP,QAAQ,EACR,oBAAoB,EACpB,gBAAgB,EAChB,MAAM,EACN,WAAW,EACX,SAAS,EACT,KAAK,EACL,OAAO,EACP,YAAY,EACZ,QAAQ,EACT,MAAM,QAAQ,CAAC;AAEhB,OAAO,UAAU,MAAM,eAAe,CAAC;AACvC,OAAO,EACL,UAAU,EACV,uBAAuB,EACvB,mBAAmB,EACpB,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,SAAS,EACT,KAAK,EACL,MAAM,EACN,QAAQ,EACR,OAAO,EACP,UAAU,EACV,UAAU,EACV,SAAS,EACT,OAAO,EACP,QAAQ,EACR,oBAAoB,EACpB,gBAAgB,EAChB,MAAM,EACN,WAAW,EACX,SAAS,EACT,KAAK,EACL,OAAO,EACP,YAAY,EACZ,QAAQ,EACR,UAAU,EACV,uBAAuB,EACvB,mBAAmB,EACnB,UAAU,GACX,CAAC"}

package/dist/types/math.d.ts

@@ -0,0 +1,90 @@
+/**
+ * min以上, max未満の整数を返す
+ * @param min
+ * @param max
+ * @returns 範囲内の整数乱数
+ */
+export declare const getRndInt: (min: number, max: number) => number;
+/**
+ * 剰余、ただし正の範囲の値を返す
+ * @param n
+ * @param mod
+ * @returns
+ */
+export declare const residue: (n: bigint, mod: bigint) => bigint;
+/**
+ * number を bigint に変換
+ * @param nums
+ * @returns
+ */
+export declare const toBigInt: (...nums: number[]) => bigint[];
+/**
+ * `length` ビットの乱数 or `length` ビット以下の乱数を出力する
+ * @param length ビット長
+ * @param fixed true: 固定長, false (デフォルト値): `length` ビット以下の可変ビット長
+ *
+ */
+export declare const getRandBIByBitLength: (length: number, fixed?: boolean) => bigint;
+/**
+ * `min` 以上 `max` 未満の乱数を返す
+ * @param min 下限
+ * @param max 上限
+ * @returns `min` 以上 `max` 未満の乱数
+ */
+export declare const getRandBIByRange: (min: bigint, max: bigint) => bigint;
+/**
+ * 冪剰余を計算する
+ * @param base 底
+ * @param power 指数
+ * @param mod 法
+ * @returns 冪剰余
+ */
+export declare const modPow: (base: bigint, power: bigint, mod: bigint) => bigint;
+/**
+ * 拡張ユークリッドの互除法 \
+ * 参考: https://qiita.com/angel_p_57/items/56a902cbd1fe519747bd
+ *
+ * @description `ax - by = gcd(a, b)`
+ * @param a
+ * @param b
+ * @returns `{x, y, gcd(a, b)}`
+ */
+export declare const exEuclidean: (a: bigint, b: bigint) => {
+    x: bigint;
+    y: bigint;
+    gcd: bigint;
+};
+/**
+ * 階乗を計算する \
+ * 参考: https://qiita.com/AkariLuminous/items/1b2e964ebabde9419224
+ * @param n_ 整数
+ * @returns 引数の階乗
+ */
+export declare const factorial: (n: bigint) => bigint;
+/**
+ * 32ビット回転 (bigint)
+ * @param value 値
+ * @param rot 回転数
+ * @returns
+ */
+export declare const rot32BI: (value: bigint, rot: bigint) => bigint;
+/**
+ * 32ビット回転
+ * @param value 値
+ * @param rot 回転数
+ * @returns
+ */
+export declare const rot32: (value: number, rot: number) => number;
+/**
+ * ヤコビ記号
+ * @param a 正の整数
+ * @param n 正の奇数
+ */
+export declare const jacobiSymbol: (a: bigint, n: bigint) => bigint;
+/**
+ * 平方数かの判定
+ * @param n
+ * @returns
+ */
+export declare const isSquare: (n: bigint) => boolean;
+//# sourceMappingURL=math.d.ts.map

package/dist/types/math.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.d.ts","sourceRoot":"","sources":["../../src/math.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,KAAK,MAAM,EAAE,KAAK,MAAM,WAEjD,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,OAAO,GAAI,GAAG,MAAM,EAAE,KAAK,MAAM,WAG7C,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,QAAQ,GAAI,GAAG,MAAM,MAAM,EAAE,aAEzC,CAAC;AAGF;;;;;GAKG;AACH,eAAO,MAAM,oBAAoB,GAAI,QAAQ,MAAM,EAAE,eAAa,WAajE,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,GAAI,KAAK,MAAM,EAAE,KAAK,MAAM,WAiBxD,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,MAAM,GAAI,MAAM,MAAM,EAAE,OAAO,MAAM,EAAE,KAAK,MAAM,WAiB9D,CAAC;AAEF;;;;;;;;GAQG;AACH,eAAO,MAAM,WAAW,GAAI,GAAG,MAAM,EAAE,GAAG,MAAM;;;;CA8B/C,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,GAAG,MAAM,WAwDlC,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,OAAO,GAAI,OAAO,MAAM,EAAE,KAAK,MAAM,WAEjD,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,KAAK,GAAI,OAAO,MAAM,EAAE,KAAK,MAAM,WAE/C,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,YAAY,GAAI,GAAG,MAAM,EAAE,GAAG,MAAM,WA2BhD,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,QAAQ,GAAI,GAAG,MAAM,YAejC,CAAC"}

package/dist/types/pcg-minimal.d.ts

@@ -0,0 +1,30 @@
+/**
+ * PCG-XSH-RR (Permuted congruential generator) 乱数のクラス
+ */
+export default class PCGMinimal {
+    #private;
+    get [Symbol.toStringTag](): string;
+    /** シード値の配列を返す */
+    static getSeed(): BigUint64Array<ArrayBuffer>;
+    /**
+     * @param seeds 64bit整数の配列 (長さ2以上), 省略した場合, 常に同じ値によって初期化される
+     */
+    constructor(seeds?: BigUint64Array<ArrayBuffer>);
+    /** 内部状態を1サイクル進める */
+    step(): void;
+    /** 32bit 乱数を返す (内部状態は変わらない) */
+    get value(): number;
+    /** 内部状態を1進め、乱数を返す \
+     *  普通はこれを使う
+     */
+    getRand(): number;
+    /** `bound` 以下の乱数を返す */
+    getBoundedRand(bound: number): number;
+    /**
+     * step の値だけ乱数を生成するジェネレーター関数
+     * @param step
+     * @param bound
+     */
+    genRands(step: number, bound?: number): AsyncGenerator<number, void, unknown>;
+}
+//# sourceMappingURL=pcg-minimal.d.ts.map

package/dist/types/pcg-minimal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pcg-minimal.d.ts","sourceRoot":"","sources":["../../src/pcg-minimal.ts"],"names":[],"mappings":"AAQA;;GAEG;AACH,MAAM,CAAC,OAAO,OAAO,UAAU;;IAG7B,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,WAEvB;IAED,iBAAiB;IACjB,MAAM,CAAC,OAAO;IAId;;OAEG;gBACS,KAAK,CAAC,EAAE,cAAc,CAAC,WAAW,CAAC;IAa/C,oBAAoB;IACpB,IAAI;IAMJ,+BAA+B;IAC/B,IAAI,KAAK,WAMR;IAED;;OAEG;IACH,OAAO;IAKP,uBAAuB;IACvB,cAAc,CAAC,KAAK,EAAE,MAAM;IAc5B;;;;OAIG;IACI,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM;CAK7C"}

package/dist/types/util.d.ts

@@ -0,0 +1,30 @@
+/**
+ * 配列が等しいかどうかの真偽値を返す
+ * @returns
+ */
+export declare const isEqArray: <T>(arr1: T[], arr2: T[]) => boolean;
+/**
+ * スリープ
+ * @param delay スリープ時間 (ms)
+ * @returns
+ */
+export declare const sleep: (delay: number) => Promise<void>;
+/** 遅延評価関数化する */
+export declare const lazify: <ArgT extends unknown[], RetT>(func: (...args: ArgT) => RetT) => (...args: ArgT) => () => RetT;
+/**
+ * CSVをパースする \
+ * クォート対応
+ * @param csv CSV
+ * @returns 2次元配列
+ */
+export declare const parseCSV: (csv: string) => string[][];
+/**
+ * 文字列のハッシュ値を返す
+ * @param str 文字列
+ * @param algorithm アルゴリズム
+ * @returns ハッシュ値
+ */
+export declare const getHash: (str: string, algorithm: AlgorithmIdentifier) => Promise<Buffer<ArrayBuffer>>;
+export declare const BItoBuffer: (n: bigint) => Buffer<ArrayBuffer>;
+export declare const bufferToBI: (buf: Buffer) => bigint;
+//# sourceMappingURL=util.d.ts.map

package/dist/types/util.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../../src/util.ts"],"names":[],"mappings":"AACA;;;GAGG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,YAShD,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,KAAK,GAAI,OAAO,MAAM,kBAMlC,CAAC;AAEF,gBAAgB;AAChB,eAAO,MAAM,MAAM,GAChB,IAAI,SAAS,OAAO,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,IAAI,EAAE,IAAI,KAAK,IAAI,MAC3D,GAAG,MAAM,IAAI,eAEC,CAAC;AAElB;;;;;GAKG;AACH,eAAO,MAAM,QAAQ,GAAI,KAAK,MAAM,eAiCnC,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,OAAO,GAAU,KAAK,MAAM,EAAE,WAAW,mBAAmB,iCAKxE,CAAC;AAEF,eAAO,MAAM,UAAU,GAAI,GAAG,MAAM,wBAInC,CAAC;AAEF,eAAO,MAAM,UAAU,GAAI,KAAK,MAAM,WAGrC,CAAC"}

package/package.json

@@ -0,0 +1,27 @@
+{
+  "name": "@tktb-tess/util-fns",
+  "version": "0.1.0",
+  "main": "dist/bundle.js",
+  "type": "module",
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "rollup -c"
+  },
+  "author": "Tessyrrhaqt",
+  "license": "MIT",
+  "description": "個人的に使う用の便利関数ライブラリ",
+  "devDependencies": {
+    "@rollup/plugin-commonjs": "^28.0.6",
+    "@rollup/plugin-node-resolve": "^16.0.1",
+    "@rollup/plugin-terser": "^0.4.4",
+    "@rollup/plugin-typescript": "^12.1.4",
+    "@types/node": "^24.3.0",
+    "npm-check-updates": "^18.0.2",
+    "rollup": "^4.47.1",
+    "tslib": "^2.8.1",
+    "tsx": "^4.20.4",
+    "typescript": "^5.9.2"
+  }
+}

package/rollup.config.js

@@ -0,0 +1,14 @@
+import typescript from '@rollup/plugin-typescript';
+import terser from '@rollup/plugin-terser';
+import commonjs from '@rollup/plugin-commonjs';
+import nodeResolve from '@rollup/plugin-node-resolve';
+
+export default {
+  input: 'src/main.ts',
+  output: {
+    file: 'dist/bundle.js',
+    format: 'es',
+    sourcemap: true,
+  },
+  plugins: [typescript(), terser(), commonjs(), nodeResolve()],
+};

package/src/baillie-psw.ts

@@ -0,0 +1,231 @@
+import {
+	modPow,
+	jacobiSymbol,
+	isSquare,
+	residue,
+	getRandBIByBitLength,
+	getRandBIByRange
+} from './math';
+
+/**
+ * translated from python codes in
+ * https://github.com/armchaircaver/Baillie-PSW/blob/623b2541b8c659dcb4312a3ddc6c00802e34f1a1/baillie_psw.py
+ *
+ */
+
+/**
+ * Miller-Rabin テスト (底2)
+ * @param n 判定する整数
+ * 
+ * @returns
+ */
+const millerRabinAtBase2 = (n: bigint) => {
+	if (n <= 1n) return false;
+	if (n % 2n === 0n) return n === 2n;
+	let d_ = n - 1n;
+	let s_ = 0n;
+
+	while (d_ % 2n === 0n) {
+		d_ >>= 1n;
+		s_ += 1n;
+	}
+	const [d, s] = [d_, s_];
+
+	const a = 2n;
+	let y = modPow(a, d, n);
+
+	if (y === 1n) return true;
+
+	for (let i = 0n; i < s; i++) {
+		if (y === n - 1n) return true;
+		y = (y * y) % n;
+	}
+	return false;
+};
+
+const DChooser = (n: bigint): [bigint, bigint] => {
+	let D = 5n;
+	let j = jacobiSymbol(D, n);
+
+	while (j > 0n) {
+		D = D > 0n ? D + 2n : D - 2n;
+		D *= -1n;
+
+		if (D === -15n && isSquare(n)) {
+			//The value of D isn't 0, but we are just communicating
+			// that we have found a square
+			return [0n, 0n];
+		}
+		j = jacobiSymbol(D, n);
+	}
+	return [D, j];
+};
+
+/**
+ * `n` を法として `x` を2で割った値 (`n` は奇数を想定)
+ * @param x
+ * @param n
+ * @returns
+ */
+const div2Mod = (x: bigint, n: bigint) => {
+	return (x & 1n) === 1n ? residue((x + n) >> 1n, n) : residue(x >> 1n, n);
+};
+
+/**
+ * ここ何してるのかわからん
+ * @param k
+ * @param n
+ * @param P
+ * @param D
+ * @returns
+ */
+const UVSubscript = (k: bigint, n: bigint, P: bigint, D: bigint): [bigint, bigint] => {
+	let U = 1n;
+	let V = P;
+	const digits = k.toString(2).slice(1);
+
+	for (const digit of digits) {
+		[U, V] = [residue(U * V, n), div2Mod(V * V + D * U * U, n)];
+
+		if (digit === '1') {
+			[U, V] = [div2Mod(P * U + V, n), div2Mod(D * U + P * V, n)];
+		}
+	}
+
+	return [U, V];
+};
+
+/**
+ * Lucasの強素数判定法
+ * @param n
+ * @param D
+ * @param P
+ * @param Q
+ * @returns
+ */
+const lucasSPP = (n: bigint, D: bigint, P: bigint, Q: bigint) => {
+	if (n % 2n !== 1n) throw Error('`n` must be odd');
+	let d = n + 1n;
+	let s = 0n;
+
+	while (d % 2n === 0n) {
+		d >>= 1n;
+		s += 1n;
+	}
+	//console.log('d:', d, 's:', s);
+
+	const [U, V_] = UVSubscript(d, n, P, D);
+	let V = V_;
+
+	//console.log('U:', U, 'V:', V);
+
+	if (U === 0n) return true;
+
+	Q = modPow(Q, d, n);
+
+	for (let i = 0n; i < s; i++) {
+		//console.log(i, V, Q);
+		if (V === 0n) return true;
+
+		V = residue(V * V - 2n * Q, n);
+		Q = modPow(Q, 2n, n);
+	}
+	return false;
+};
+
+/**
+ * Baillie-PSW素数判定法
+ * @param n 判定したい整数
+ * @returns
+ */
+export const bailliePSW = (n: bigint) => {
+	if (n <= 1n) return false;
+	if (n % 2n === 0n) return n === 2n;
+
+	// 小さな素数で試し割り
+	const smallPrimes: readonly bigint[] = [
+		2n,
+		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
+	];
+
+	for (const p of smallPrimes) {
+		if (n % p === 0n) {
+			return n === p;
+		}
+	}
+
+	if (!millerRabinAtBase2(n)) {
+		// console.log(n, 'Miller-Rabin', false);
+		return false;
+	}
+
+	const [D, j] = DChooser(n);
+	if (j === 0n) return false;
+
+	const Q = (1n - D) / 4n;
+	//console.log('n:', n, 'D:', D, 'P:', 1n, 'Q:', Q);
+	return lucasSPP(n, D, 1n, Q);
+	// console.log(n, 'Lucas-Strong', res);
+};
+
+/**
+ * 指定範囲内の確率的素数を返す
+ * @param min 下限
+ * @param max 上限
+ * @returns
+ */
+export const getRandPrimeByRange = (min: bigint, max: bigint) => {
+	const LIMIT = 100000;
+	if (max < 2n) {
+		throw Error('noPrimesFound');
+	}
+	for (let count = 0; count < LIMIT; count++) {
+		const p = getRandBIByRange(min, max);
+		if (bailliePSW(p)) return p;
+	}
+
+	throw Error('noPrimesFound');
+};
+
+/**
+ * 指定ビットの確率的素数を返す
+ * @param bitLength ビット長
+ * @param fixed true: 固定長, false (デフォルト値): `length` ビット以下の可変ビット長
+ * @returns
+ */
+export const getRandPrimeByBitLength = (bitLength: number, fixed = false) => {
+	const LIMIT = 100000;
+	if (bitLength < 2) {
+		throw Error('noPrimesFound');
+	}
+	for (let count = 0; count < LIMIT; count++) {
+		const p = getRandBIByBitLength(bitLength, fixed);
+		if (bailliePSW(p)) return p;
+	}
+
+	throw Error('noPrimesFound');
+};

package/src/main.ts

@@ -0,0 +1,56 @@
+import {
+  isEqArray,
+  sleep,
+  lazify,
+  parseCSV,
+  getHash,
+  BItoBuffer,
+  bufferToBI,
+} from './util';
+import {
+  getRndInt,
+  residue,
+  toBigInt,
+  getRandBIByBitLength,
+  getRandBIByRange,
+  modPow,
+  exEuclidean,
+  factorial,
+  rot32,
+  rot32BI,
+  jacobiSymbol,
+  isSquare,
+} from './math';
+
+import PCGMinimal from './pcg-minimal';
+import {
+  bailliePSW,
+  getRandPrimeByBitLength,
+  getRandPrimeByRange,
+} from './baillie-psw';
+
+export {
+  isEqArray,
+  sleep,
+  lazify,
+  parseCSV,
+  getHash,
+  BItoBuffer,
+  bufferToBI,
+  getRndInt,
+  residue,
+  toBigInt,
+  getRandBIByBitLength,
+  getRandBIByRange,
+  modPow,
+  exEuclidean,
+  factorial,
+  rot32,
+  rot32BI,
+  jacobiSymbol,
+  isSquare,
+  bailliePSW,
+  getRandPrimeByBitLength,
+  getRandPrimeByRange,
+  PCGMinimal,
+};

package/src/math.ts

@@ -0,0 +1,283 @@
+/**
+ * min以上, max未満の整数を返す
+ * @param min
+ * @param max
+ * @returns 範囲内の整数乱数
+ */
+export const getRndInt = (min: number, max: number) => {
+  return Math.floor(Math.random() * (max - min) + min);
+};
+
+/**
+ * 剰余、ただし正の範囲の値を返す
+ * @param n
+ * @param mod
+ * @returns
+ */
+export const residue = (n: bigint, mod: bigint) => {
+  const ans = n % mod;
+  return ans < 0n ? ans + mod : ans;
+};
+
+/**
+ * number を bigint に変換
+ * @param nums
+ * @returns
+ */
+export const toBigInt = (...nums: number[]) => {
+  return nums.map((n) => BigInt(n));
+};
+
+
+/**
+ * `length` ビットの乱数 or `length` ビット以下の乱数を出力する
+ * @param length ビット長
+ * @param fixed true: 固定長, false (デフォルト値): `length` ビット以下の可変ビット長
+ *
+ */
+export const getRandBIByBitLength = (length: number, fixed = false) => {
+  if (!Number.isFinite(length)) throw Error('`length` is not a valid number');
+  if (length <= 0) throw Error('`length` must be positive');
+
+  const div = Math.ceil(length / 32);
+  const u32Arr = crypto.getRandomValues(new Uint32Array(div));
+  let result = Array.from(u32Arr, (n) => n.toString(2).padStart(32, '0')).join(
+    ''
+  );
+  result = result.slice(0, length);
+  if (fixed) result = result.replace(/^./, '1');
+  // console.log(result);
+  return BigInt('0b' + result);
+};
+
+/**
+ * `min` 以上 `max` 未満の乱数を返す
+ * @param min 下限
+ * @param max 上限
+ * @returns `min` 以上 `max` 未満の乱数
+ */
+export const getRandBIByRange = (min: bigint, max: bigint) => {
+  if (min >= max) throw Error('RangeError');
+  const diff = max - min;
+  const bitLength = diff.toString(2).length;
+
+  const res = (() => {
+    const limit = 100000;
+    for (let i = 0; i < limit; i++) {
+      const res = getRandBIByBitLength(bitLength);
+      if (res >= modPow(2n, BigInt(bitLength), diff)) {
+        return res % diff;
+      }
+    }
+    throw Error('Failed to generate a random bigint');
+  })();
+
+  return min + res;
+};
+
+/**
+ * 冪剰余を計算する
+ * @param base 底
+ * @param power 指数
+ * @param mod 法
+ * @returns 冪剰余
+ */
+export const modPow = (base: bigint, power: bigint, mod: bigint) => {
+  if (mod < 1n) throw Error('`mod` must be positive');
+  if (power < 0n) throw Error('`power` must not be negative');
+
+  while (base < 0n) base += mod;
+  if (mod === 1n) return 0n;
+  if (base % mod === 1n || base % mod === 0n) return base;
+  if (base === mod - 1n) return power & 1n ? mod - 1n : 1n;
+
+  let result = 1n;
+  while (power > 0n) {
+    if (power & 1n) result = (result * base) % mod;
+    base = (base * base) % mod;
+    power >>= 1n;
+    // console.log(base, power, mod);
+  }
+  return result;
+};
+
+/**
+ * 拡張ユークリッドの互除法 \
+ * 参考: https://qiita.com/angel_p_57/items/56a902cbd1fe519747bd
+ *
+ * @description `ax - by = gcd(a, b)`
+ * @param a
+ * @param b
+ * @returns `{x, y, gcd(a, b)}`
+ */
+export const exEuclidean = (a: bigint, b: bigint) => {
+  // a, b に 0 がある場合の処理
+  if (a === 0n && b === 0n) return { x: 0n, y: 0n, gcd: 0n };
+  if (a === 0n)
+    return b > 0n ? { x: 0n, y: -1n, gcd: b } : { x: 0n, y: 1n, gcd: -b };
+  if (b === 0n)
+    return a > 0n ? { x: 1n, y: 0n, gcd: a } : { x: -1n, y: 0n, gcd: -a };
+
+  let [x_1, y_1, c_1] = [1n, 0n, a];
+  let [x_2, y_2, c_2] = [0n, -1n, b];
+
+  while (true) {
+    const q = c_1 / c_2;
+    const c_nxt = c_1 - q * c_2;
+
+    if (c_nxt === 0n) break;
+
+    [x_1, x_2] = [x_2, x_1 - q * x_2];
+    [y_1, y_2] = [y_2, y_1 - q * y_2];
+    [c_1, c_2] = [c_2, c_nxt];
+  }
+
+  // GCD が負の場合 -1 倍する
+  if (c_2 < 0n) {
+    x_2 *= -1n;
+    y_2 *= -1n;
+    c_2 *= -1n;
+  }
+
+  return { x: x_2, y: y_2, gcd: c_2 };
+};
+
+/**
+ * 階乗を計算する \
+ * 参考: https://qiita.com/AkariLuminous/items/1b2e964ebabde9419224
+ * @param n_ 整数
+ * @returns 引数の階乗
+ */
+export const factorial = (n: bigint) => {
+  if (n < 0n) throw Error(`'n_' must be non-negative`);
+  if (n === 0n) return 1n;
+
+  /**
+   * min 以上 max 「未満」 の奇数の積を返す
+   * @param min 最小値
+   * @param max 最大値
+   * @returns min 以上 max 未満 の奇数の積
+   */
+  const oddProd = (min: bigint, max: bigint): bigint => {
+    if (min >= max) return 1n;
+
+    const max_bits = BigInt((max - 2n).toString(2).length);
+    const num_odds = (max - min) / 2n;
+
+    if (max_bits * num_odds < 63n) {
+      let result = min;
+      for (let i = min + 2n; i < max; i += 2n) {
+        result *= i;
+      }
+      return result;
+    }
+
+    const mid = (min + num_odds) | 1n;
+    const lower = oddProd(min, mid);
+    const higher = oddProd(mid, max);
+    return lower * higher;
+  };
+
+  /**
+   * 階乗の奇数部分を計算する
+   * @param n 整数
+   * @returns 奇数部の積
+   */
+  const oddPart = (n: bigint) => {
+    let L_i = 3n,
+      result = 1n,
+      tmp = 1n;
+    const m = BigInt(n.toString(2).length) - 1n;
+
+    for (let i = m - 1n; i > -1n; --i) {
+      const U_i = ((n >> i) + 1n) | 1n;
+
+      tmp *= oddProd(L_i, U_i);
+      L_i = U_i;
+      result *= tmp;
+    }
+
+    return result;
+  };
+
+  const two_exp = n - BigInt(n.toString(2).match(/1/g)?.length ?? 0);
+  const odd_part = oddPart(n);
+
+  return odd_part << two_exp;
+};
+
+/**
+ * 32ビット回転 (bigint)
+ * @param value 値
+ * @param rot 回転数
+ * @returns
+ */
+export const rot32BI = (value: bigint, rot: bigint) => {
+  return BigInt.asUintN(32, (value >> (rot & 31n)) | (value << (-rot & 31n)));
+};
+
+/**
+ * 32ビット回転
+ * @param value 値
+ * @param rot 回転数
+ * @returns
+ */
+export const rot32 = (value: number, rot: number) => {
+  return (value >>> (rot & 31)) | (value << (-rot & 31));
+};
+
+/**
+ * ヤコビ記号
+ * @param a 正の整数
+ * @param n 正の奇数
+ */
+export const jacobiSymbol = (a: bigint, n: bigint) => {
+  if (n < 1n || n % 2n === 0n) {
+    throw Error('`n` is invalid');
+  }
+  while (a < 0n) {
+    a += n;
+  }
+  a %= n;
+
+  let result = 1n;
+  while (a !== 0n) {
+    while (a % 2n === 0n) {
+      a /= 2n;
+      const nMod8 = n % 8n;
+      if (nMod8 === 3n || nMod8 === 5n) {
+        result *= -1n;
+      }
+    }
+    [a, n] = [n, a];
+
+    if (a % 4n === 3n && n % 4n === 3n) {
+      result *= -1n;
+    }
+    a %= n;
+  }
+
+  return n === 1n ? result : 0n;
+};
+
+/**
+ * 平方数かの判定
+ * @param n
+ * @returns
+ */
+export const isSquare = (n: bigint) => {
+  if (n < 0n) return false;
+  if (n === 0n) return true;
+  let x = 1n;
+  let y = n;
+  while (x + 1n < y) {
+    const mid = (x + y) / 2n;
+
+    if (mid ** 2n < n) {
+      x = mid;
+    } else {
+      y = mid;
+    }
+  }
+  return n === x ** 2n || n === (x + 1n) ** 2n;
+};

package/src/pcg-minimal.ts

@@ -0,0 +1,89 @@
+import { rot32 } from './math';
+
+/** シードなし時の静的初期化定数 */
+const initialState = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn] as const;
+
+/** 乗数 */
+const increment = 0x5851f42d4c957f2dn;
+
+/**
+ * PCG-XSH-RR (Permuted congruential generator) 乱数のクラス
+ */
+export default class PCGMinimal {
+  readonly #state = new BigUint64Array(2);
+
+  get [Symbol.toStringTag]() {
+    return PCGMinimal.name;
+  }
+
+  /** シード値の配列を返す */
+  static getSeed() {
+    return crypto.getRandomValues(new BigUint64Array(2));
+  }
+
+  /**
+   * @param seeds 64bit整数の配列 (長さ2以上), 省略した場合, 常に同じ値によって初期化される
+   */
+  constructor(seeds?: BigUint64Array<ArrayBuffer>) {
+
+    if (seeds && seeds[0] && seeds[1]) {
+      this.#state[1] = (seeds[1] << 1n) | 1n;
+      this.step();
+      this.#state[0] = seeds[0];
+      this.step();
+    } else {
+      this.#state[0] = initialState[0];
+      this.#state[1] = initialState[1];
+    }
+  }
+
+  /** 内部状態を1サイクル進める */
+  step() {
+    if (this.#state[0] && this.#state[1]) {
+      this.#state[0] = this.#state[0] * increment + this.#state[1];
+    }
+  }
+
+  /** 32bit 乱数を返す (内部状態は変わらない) */
+  get value() {
+    const prev = this.#state[0];
+    if (!prev) throw Error('empty state');
+    const rot = prev >> 59n;
+    const shifted = BigInt.asUintN(32, (prev ^ (prev >> 18n)) >> 27n);
+    return rot32(Number(shifted), Number(rot));
+  }
+
+  /** 内部状態を1進め、乱数を返す \
+   *  普通はこれを使う
+   */
+  getRand() {
+    this.step();
+    return this.value;
+  }
+
+  /** `bound` 以下の乱数を返す */
+  getBoundedRand(bound: number) {
+    /** 32bit 上限 */
+    const limit = 0x100000000;
+
+    if (bound > limit) throw Error('bound exceeded limit (2^32)');
+
+    const threshold = limit % bound;
+
+    while (true) {
+      const r = this.getRand();
+      if (r >= threshold) return r % bound;
+    }
+  }
+
+  /**
+   * step の値だけ乱数を生成するジェネレーター関数
+   * @param step
+   * @param bound
+   */
+  async *genRands(step: number, bound?: number) {
+    for (let i = 0; i < step; i++) {
+      yield bound ? this.getBoundedRand(bound) : this.getRand();
+    }
+  }
+}

package/src/util.ts

@@ -0,0 +1,100 @@
+
+/**
+ * 配列が等しいかどうかの真偽値を返す
+ * @returns
+ */
+export const isEqArray = <T>(arr1: T[], arr2: T[]) => {
+  if (arr1.length !== arr2.length) return false;
+  else {
+    for (let i = 0; i < arr1.length; i++) {
+      if (arr1[i] !== arr2[i]) return false;
+    }
+
+    return true;
+  }
+};
+
+/**
+ * スリープ
+ * @param delay スリープ時間 (ms)
+ * @returns
+ */
+export const sleep = (delay: number) => {
+  return new Promise<void>((resolve) => {
+    setTimeout(() => {
+      resolve();
+    }, delay);
+  });
+};
+
+/** 遅延評価関数化する */
+export const lazify =
+  <ArgT extends unknown[], RetT>(func: (...args: ArgT) => RetT) =>
+  (...args: ArgT) =>
+  () =>
+    func(...args);
+
+/**
+ * CSVをパースする \
+ * クォート対応
+ * @param csv CSV
+ * @returns 2次元配列
+ */
+export const parseCSV = (csv: string) => {
+  const rows: string[][] = [];
+  let row: string[] = [];
+  let currentField = '';
+  let isInsideOfQuote = false;
+
+  for (let i = 0; i < csv.length; i++) {
+    const char = csv[i];
+
+    if (char === '"' && (i === 0 || csv[i - 1] !== '\\')) {
+      // ダブルクォート（not エスケープ）に入った/出た時にトグル
+      isInsideOfQuote = !isInsideOfQuote;
+    } else if (char === ',' && !isInsideOfQuote) {
+      // クォート内でないコンマ
+      row.push(currentField.trim()); // フィールドを列配列に追加
+      currentField = ''; // クリア
+    } else if (char === '\n' && !isInsideOfQuote) {
+      // クォート内でない改行
+      row.push(currentField.trim()); // フィールドを列配列に追加
+      rows.push(row); // 列配列を2次元配列に追加
+      row = []; // 列配列, フィールドをクリア
+      currentField = '';
+    } else {
+      // フィールドに文字を追加
+      currentField += char;
+    }
+  }
+
+  // 最後のセルと行を追加
+  row.push(currentField.trim());
+  rows.push(row);
+
+  return rows;
+};
+
+/**
+ * 文字列のハッシュ値を返す
+ * @param str 文字列
+ * @param algorithm アルゴリズム
+ * @returns ハッシュ値
+ */
+export const getHash = async (str: string, algorithm: AlgorithmIdentifier) => {
+  const utf8 = Buffer.from(str, 'utf8');
+  return crypto.subtle
+    .digest(algorithm, utf8)
+    .then((hash) => Buffer.from(hash));
+};
+
+export const BItoBuffer = (n: bigint) => {
+  let str = n.toString(16);
+  if (str.length & 1) str = '0' + str;
+  return Buffer.from(str, 'hex');
+};
+
+export const bufferToBI = (buf: Buffer) => {
+  const str = buf.toString('hex') || '00';
+  return BigInt('0x' + str);
+};

package/tsconfig.json

@@ -0,0 +1,22 @@
+{
+  // Visit https://aka.ms/tsconfig to read more about this file
+  "compilerOptions": {
+    "module": "esnext",
+    "target": "esnext",
+    "sourceMap": true,
+    "declaration": true,
+    "declarationMap": true,
+    "declarationDir": "dist/types",
+    "noUncheckedIndexedAccess": true,
+    "exactOptionalPropertyTypes": true,
+    "emitDeclarationOnly": true,
+    "strict": true,
+    "verbatimModuleSyntax": true,
+    "isolatedModules": true,
+    "noUncheckedSideEffectImports": true,
+    "moduleDetection": "force",
+    "skipLibCheck": true,
+    "moduleResolution": "bundler"
+  },
+  "include": ["src/**/*.ts"]
+}