20191203, 09:00  #12  
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2^{3}·719 Posts 
When calling the siever directly 2^A is the sieve region. A=31 defaults to I=16 A=29 to I=15 etc. A=2*I1
I think that A=32 will be 2^16 by 2^16. It is twice the region of A=31 in any case. A=32 is more manageable than I=17 memory wise so it is an option for low q sieving to get more yield. sieve.adjust_strategy is different strategies for selection of I and J in 2^I by 2^J given A=I+J. It is described in las h Quote:
I would suggest some experimentation with this may be worthwhile. It may speed up some sizes for some q(which q might be an unanswered research question) Is it getting to the point where NFS@Home should be looking at switching to the CADO siever? Last fiddled with by henryzz on 20191203 at 09:01 

20191203, 11:26  #13  
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10100010011001_{2} Posts 
This post to the CADONFS list seems very slightly relevant.
Quote:


20191203, 17:56  #14 
Sep 2010
So Cal
2×5^{2} Posts 

20191203, 18:10  #15  
Sep 2010
So Cal
50_{10} Posts 
Quote:
Quote:


20191203, 18:49  #16 
Bemusing Prompter
"Danny"
Dec 2002
California
4421_{8} Posts 
The link just went down. I'm guessing it's due to high traffic.

20191203, 19:46  #17 
Jul 2018
19 Posts 
A copy of the announcement has been saved in the Internet Archive: http://web.archive.org/web/201912031...er/001139.html

20200810, 12:51  #18 
Oct 2018
2×3^{2} Posts 
Some additional details about the RSA240 factorization, as well as the discrete log done at the same time can be found at:
https://eprint.iacr.org/2020/697 
20200810, 16:35  #19  
"Curtis"
Feb 2005
Riverside, CA
2^{4}·281 Posts 
Quote:
Parameters were nearly the same as for RSA240, except for increasing sieve region from A=32 to A=33 (a doubling of sieve area, equivalent to using a mythical 17e on GGNFS). Still 2LP on one side, 3 on the other. Lim's were 2^31. Only 8.7G raw relations were needed, 6.1G unique!! They cite 2450 XeonGold2.1Ghz coreyears sieving, 250 coreyears matrix for 405M matrix size. Last fiddled with by VBCurtis on 20200810 at 16:36 

20200810, 18:39  #20 
Apr 2020
5×23 Posts 

20200810, 22:09  #21 
Sep 2008
Kansas
110001101100_{2} Posts 
That makes you think how big is the LA machine. Only a few people around here can accommodate a 40M matrix let alone a 405M matrix!!

20200811, 00:19  #22 
"Curtis"
Feb 2005
Riverside, CA
1190_{16} Posts 
Same way Greg does the supercomputing grids used by the CADO team for these factorizations can handle jobs such as a matrix distributed over many nodes. The paper includes a summary of the number of nodes used for each step of the RSA240 matrix.
I'm not aware of filtering being split over multiple nodes, so that is the part that needs the largestmemory machine, and that likely fit in 256GB (perhaps 384). 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
factored mp / (mp < 100.000.000 )  bhelmes  Data  3  20180928 18:31 
10^224 + 3 factored  2147483647  Factoring  0  20161231 16:22 
Factored vs. Completely factored  aketilander  Factoring  4  20120808 18:09 
F33 is factored !!  Raman  Factoring  4  20100401 13:57 
RSA100 factored!  ewmayer  Math  5  20030514 15:08 