20161210, 07:01  #1 
Dec 2016
2·3^{2} Posts 
What should the "q" value increase to for GNFS/SNFS computations?
Yesterday I started a large SNFS and I'm just wondering how long it's going to take.
I just did a C100 with SNFS and the sieving range was 510k to 590k. What should the range look like for larger numbers, in increments of 10 digits? Will the range be larger for GNFS? 
20161210, 07:50  #2 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
22160_{8} Posts 
The script will take care of everything. q values should not concern you; they will be variable for different runs and will depend on the project's complexity. Different sievers will be chosen by the script, too; their rate of sieving might seem sometimes logical to the untrained eye and sometimes unexpectedly slower (on the next project)  but you should trust the script.
Here are the fairly good rules of thumb:  for SNFS, with every 9 additional digits of SNFS difficulty, the overall runtime will double (or, which is the same, runtime will be 10x for every 30 digits)  for GNFS, with every 5 additional digits of length(N), the overall runtime will double Remember just these two and you will be in good shape. Examples: a 120digit SNFS complexity project might take 1 corehour on your computer. Then you can assume that a 150digit SNFS complexity project will take 10 hours, a 180digit SNFS complexity project will take 100 hours, and a 210digit SNFS complexity project will take 1000 hours (~40 coredays). Ok? You can estimate how hard a GNFS project will be by taking length of the input number N, and converting to (N30)*1.8 = similarly hard SNFS complexity. For example, a 130digit GNFS is approximately as hard as a 180SNFSdigit difficulty SNFS (from the estimate above, ~100 corehours). 
20161210, 08:42  #3  
Dec 2016
18_{10} Posts 
Quote:
I did a C165 SNFS in ~5h30m yesterday and the one I'm currently doing is a C201, so ~16 times longer = about 3 days 16 hours. That's quite a lot less than I was expecting actually. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
GQQ: a "deterministic" "primality" test in O(ln n)^2  Chair Zhuang  Miscellaneous Math  21  20180326 22:33 
Stockfish game: "Move 8 poll", not "move 3.14159 discussion"  MooMoo2  Other Chess Games  5  20161022 01:55 
AouessareEl HaddouchiEssaaidi "test": "if Mp has no factor, it is prime!"  wildrabbitt  Miscellaneous Math  11  20150306 08:17 
Would Minimizing "iterations between results file" may reveal "is not prime" earlier?  nitai1999  Software  7  20040826 18:12 