speed improvement

Anonymous — Sun, 26 Aug 2007 18:14:30 -0000

use gmpy.next_prime.

example:

def next_good_u(old_u, log_n):

u = 1
while u < old_u:
for _ in xrange(log_n):
#u += 2
#while not isprime(u):
# u += 2
u = long(next_prime(u))
return u

and in mainloop too.

factorization of 2**345+1 took around 50s und now it only takes 23s!!! (on 2GHz, python2.4.4, gmp4.1.2)

evaluate input

Anonymous — Thu, 23 Aug 2007 23:35:08 -0000

I think it is usefull to evaluate the input, so you can factorize numbers directly.

whithout evaluate:
calculate the number: 3**127+1
pyecm 3930061525912861057173624287137506221892737197425280369698988

with evaluate:
pyecm 3**127+1

it would be much easier to use.