20221014, 03:17  #45  
Apr 2020
1110110110_{2} Posts 
Quote:
What surprised me about 2,1109+ was not that GNFS seemed harder than expected but that SNFS seemed easier than expected. I had naively been comparing degree6 GNFS polys with degree6 SNFS polys using the msieve MurphyE score, which uses values for the sieve region and factor base bound that are far too small for a job this size. It was not at all hard to find a GNFS poly that beat the msieve Escore of the SNFS poly. However, the SNFS poly sieved much faster. I then used CADO to produce MurphyE scores with more realistic parameters and this correctly showed the SNFS poly as the clear winner. Let's see how 2,1091+ goes with 35bit large primes. 2,1109+ is 5 digits larger so maybe 60% more difficult? 

20221016, 15:50  #46 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
2^{3}·643 Posts 
2,1091+ sieving has begun. Think I'll turn on my machine to at least make a small contribution to this effort.

20221102, 20:25  #47 
Jul 2003
So Cal
5075_{8} Posts 
2,2390L is done. Approximately 3.8 billion raw relations yielded 2.4 billion unique relations. These produced a 96.4M matrix, which took about 55 hours to solve on four nVidia A100's. The factors were found on the 18th (!) dependency after 58.5 hours. Of these, 11 dependencies failed because of the "bad" algebraic polynomial and 6 simply failed to find the factors.

20221102, 22:21  #48 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
1010000011000_{2} Posts 
For 2,1091+ how high will we be going for the Q range, 5000M? We are very close to the 2000M, did turn on my laptop ( you might have noticed a mini tiny peak, sorry about the server shake) and each wu now takes longer to be processed.

20221102, 22:55  #49 
Jul 2003
So Cal
2,621 Posts 

20221102, 23:03  #50 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
2^{3}·643 Posts 

20221102, 23:56  #51 
Jul 2003
So Cal
101000111101_{2} Posts 
Exactly.

20221103, 19:34  #52 
"Bob Silverman"
Nov 2003
North of Boston
2^{3}×3×313 Posts 

20221103, 21:24  #53 
Jul 2003
So Cal
2,621 Posts 
That most definitely is the case here. I make the factor bases smaller than optimal to keep memory use under 1GB/core. This is a hard limit for numerous contributors to the project.

20221109, 10:41  #54  
"Bob Silverman"
Nov 2003
North of Boston
2^{3}·3·313 Posts 
Quote:


20221113, 07:10  #55 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
2^{3}·643 Posts 
Greg, did you manage to get 2,1091+ into LA stage?

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Recommended bases and efforts  gd_barnes  Conjectures 'R Us  190  20230226 09:01 
Doublecheck efforts; S66/S79 to start with  gd_barnes  Conjectures 'R Us  16  20140807 02:11 
Cunningham ECM Now Futile?  R.D. Silverman  GMPECM  4  20120425 02:45 
ECM efforts mistake?  10metreh  mersennewiki  1  20081228 13:31 
ECM Efforts  R.D. Silverman  Factoring  63  20050624 13:41 