Not with Prime95 version 24. It now support 2^k and 3*2^k FFT lengths on both SSE2 and non-SSE2 machines for 2^n+1 numbers. So it is much better to work only on 2^791+1 now.

Alex

I'm using GMP-ECM... It takes 3.5 minutes per curve...

Which cpu type are you using?

I'll give a try to 2,951+

[QUOTE=akruppa]Which cpu type are you using?[/QUOTE]A 2.4GHz AMD64...

I will do some work on 2,1342L together with 2,1342M (working on 2^1342+1 should make good use of Prime95's length 64 FFT), but I will do 50 digit curves because 2,1342M has already been tested to 45 digits.

Done 1000 curves (45 digit) for 2,951+
I'll do at least 1000 more.

600 curves done for 969. Reported nowhere but here.

[edit: typo corrected]

For 2,791+

3184 curves using B1=11e6 & B2=25577181640...

The required number of curves I posted above was for B2=100*B1; when using the GMP-ECM default B2, the numbers are lower. In terms of fractions, the required work is now

P791: 0.07 (319 GMP-ECM curves or 736 with Prime95)
P951: 0.98 (4512 or 10420)
P969: 0.41 (1887 or 4357)
P993: 0.98 (4512 or 10420)

Alex

[QUOTE=akruppa]P791: 0.07 (319 GMP-ECM curves or 736 with Prime95)[/QUOTE]I'll finish this up if nobody else is working on it...