Function ip

test/compute-engine/number-theory.test.ts:508–509

(n: bigint)

      ce.box(['RandomPrime', 24, 28]).evaluate().operator
    ).toEqual('RandomPrime');
  });
});

describe('large primes use the Miller-Rabin path (n ≥ 2^32)', () => {
  const bn = (e: any[]) => BigInt(ce.box(e).evaluate().toString());