20180601, 07:02  #45 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
2^{2}×11×107 Posts 
C193_194xx723_13 complete
Code:
Fri Jun 01 03:08:20 2018 p67 factor: 2753638177475221936289540926431715709718268228057683656745239296463 Fri Jun 01 03:08:20 2018 p126 factor: 868089586342800554478400027452634546066331816298590736409139756490987251040504996644207750674345753871018025603989237066929183 https://pastebin.com/M13zzvd7 
20180601, 10:59  #46 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
2^{2}×11×107 Posts 
Let me try C242_14831_59, hope it fits 16GB. Which td should I use, 130?

20180601, 12:56  #47  
(loop (#_fork))
Feb 2006
Cambridge, England
2^{2}·7·227 Posts 
Quote:
(I have a script which does the binary search to get to the nearest 2, but I think it almost always isn't worth going that far  except for truly enormous jobs, the time saved by optimal choice of density is less than the cost of even one extra filtering run) 

20180601, 12:59  #48 
(loop (#_fork))
Feb 2006
Cambridge, England
2^{2}×7×227 Posts 
Mea culpa
M127_k24 is entirely my fault for having taken a good GNFS polynomial then submitted it for sieving on the rational rather than the algebraic side. As penance, I'll do the postprocessing, starting in four days when my next postprocessor becomes free.

20180601, 17:52  #49  
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
4708_{10} Posts 
Quote:


20180602, 08:07  #50 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
2^{2}·11·107 Posts 
C242_14831_59 failed with td=140 and td=110, trying 100.

20180602, 11:34  #51 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
11144_{8} Posts 

20180602, 13:08  #52 
Sep 2009
977_{10} Posts 
Alright, but the upper end of the range is already at 400M, whereas the management page recommends an ending Q of only 362M

20180602, 14:47  #53 
Sep 2008
Kansas
2^{2}×773 Posts 

20180602, 15:02  #54 
(loop (#_fork))
Feb 2006
Cambridge, England
2^{2}·7·227 Posts 
That is badly oversieved, I would cut off the last hundred million lines and try the filtering again.

20180602, 15:35  #55  
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
4708_{10} Posts 
Quote:
Why wasn’t this composite sieved with 31 bits, aiming for ~210M unique relations? It was possible in the past. Something is escaping me since all the 32 bits on 14e need relations to be cutoff during the filtering stage. Will the 32 bits (14e siever) be quicker on postprocessing? 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
2018 15e postprocessing reservations and results  fivemack  NFS@Home  221  20190104 13:08 
16e Post Processing Progress  pinhodecarlos  NFS@Home  8  20181128 13:45 
Crash doing large postprocessing job  wombatman  Msieve  22  20131204 01:37 
Update on 7^254+1 post processing  dleclair  NFSNET Discussion  4  20050405 09:51 
Post processing for 2,757  xilman  NFSNET Discussion  3  20031106 14:23 