Re: Mersenne: Why is trial factoring of small exponents slower than large ones?

2003-02-12 Thread Eric Hahn
G W Reynolds wrote: I am using mprime 22.12 on a pentium 166 MMX to do trial factoring. For the exponents currently being assigned from primenet it takes this machine about 12 minutes to factor from 2^57 to 2^58. I thought I would try factoring some small exponents (under 1,000,000) from the

P-1 (was Re: Mersenne: Why is trial factoring [....])

2003-02-12 Thread Eric Hahn
Brian Beesley wrote: If you have a reasonable amount of memory on your system I'd reccomend running P-1 on selected exponents just above 1 million - use the pminus1 database file to direct your work. Otherwise ECM on small exponents, or trial factoring on those exponents which have not been done

Mersenne: RE: Mersenne Digest V1 #1045

2003-02-12 Thread Stephan T. Lavavej
[George Woltman] Big SSE2 FFTs now take the L2 cache size into account. P4 Celeron (128KB L2 cache) is faster for FFTs between 512K and 2M. P4 Northwood (512KB L2 cache) is faster for FFTs larger than 1M. Great! I specifically remember asking about L2 cache effects months ago, and being told