Changes for version 0.11

  • is_prob_prime is faster at finding composites.
  • rewrote Lucas inner loop for ~20% speedup.
  • The previous two changes make is_prob_prime a bit faster, which means a small speedup to almost all functions.
  • Lower is_prime proving effort. Proves ~30% of 128-bit primes instead of 50%, but runs about 4x faster.
  • Change ECPP to factor all strategy with backtracking. Not much difference below 200 digits, but a big help after that. Certificates are identical.

Modules

Utilities related to prime numbers and factoring, using GMP