Mersenne: Request for help (especially ECM)

[George Woltman]

P-1 and ECM factoring is fairly complex code with several different
paths based upon how much memory is available. I'd like to develop a
fast QA suite for P-1 and ECM factoring. I intend to hardwire the test cases
into prime95 (or read the data from a QA file) so that I can run them with
several different memory settings without having to change local.ini memory
settings.

To make this test relatively fast I need one or two dozen fairly smooth P-1 test
cases for exponents in the 1,000,000 to 10,000,000 range. This shouldn't
be hard to compute. I can do it, but lets see if a volunteer would like to
send me some in the next day or two.

A harder problem is finding some smooth ECM curves to test. I do not
have tools to compute group orders. If someone can help by finding a
couple of dozen smooth ECM test cases for exponents between 1000
and 500000, I would be most grateful.

With your help this long overdue test suite can lead to version 22.13 and 22.14
next week!

_________________________________________________________________________
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers