20130218, 21:04  #133 
Tribal Bullet
Oct 2004
6716_{8} Posts 
Dubslow, not too sure; the choice of smaller leading rational coefficients is a code issue for Msieve, as these are always made as large as possible due to estimate by Thorsten Kleinjung in his 2006 Math. Comp. paper. By the time we get to RSA1024 I'm convinced we'll need a version of stage 1 that controls the size of the top 4 algebraic coefficients, not just the top 3, since with large skew it will become too rare to find a polynomial that is good at random.
Paul has also asked me to pass on his thanks for everyone's compute cycles, even though we didn't beat their best polynomial. Both CADO and Msieve have needed bug fixes to work correctly for problems this large, and that wouldn't have happened if you had not helped out. 
20130903, 18:11  #134  
Sep 2010
Scandinavia
1001100111_{2} Posts 
Quote:


20130903, 22:08  #135 
Tribal Bullet
Oct 2004
3534_{10} Posts 
We don't know how to do that at all, so it's not just a matter of code.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Volunteers needed  axn  GPU Computing  28  20120528 12:05 
call for volunteers: RSA768 polynomial selection  jasonp  Operation Kibibit  200  20111105 21:31 
Call for help  Wacky  NFSNET Discussion  13  20050714 00:25 
Volunteers needed!  Xyzzy  Hardware  23  20030418 23:27 
We need two volunteers...  Xyzzy  PrimeNet  8  20030227 02:26 