Function factorWithRho

src/compute-engine/numerics/primes.ts:286–297

* Complete the factorization of an odd `n ≥ 1` into `result`, using * Miller–Rabin to recognize prime cofactors and Pollard rho to split * composite ones. Callers strip the small factors first (rho is only * economical past the trial-division range).

(n: bigint, result: Map<bigint, number>)

  for (let c = 1n; ; c++) {
    let x = 2n;
    let y = 2n;
    let ys = 2n;
    let q = 1n;
    let g = 1n;
    let r = 1n;
    while (g === 1n) {
      x = y;
      for (let i = 0n; i < r; i++) {
        y = (y * y + c) % n;
        guard();
      }
      for (let k = 0n; k < r && g === 1n; k += m) {
        ys = y;
        const lim = r - k < m ? r - k : m;
        for (let i = 0n; i < lim; i++) {