![]() |
![]() |
#45 |
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
10011000101012 Posts |
![]() 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 |
![]() |
![]() |
#46 |
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
5×977 Posts |
![]()
Let me try C242_14831_59, hope it fits 16GB. Which td should I use, 130?
|
![]() |
![]() |
#47 | |
(loop (#_fork))
Feb 2006
Cambridge, England
13·491 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) |
|
![]() |
![]() |
#48 |
(loop (#_fork))
Feb 2006
Cambridge, England
18EF16 Posts |
![]()
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 post-processing, starting in four days when my next post-processor becomes free.
|
![]() |
![]() |
#49 | |
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
5·977 Posts |
![]() Quote:
|
|
![]() |
![]() |
#50 |
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
5×977 Posts |
![]()
C242_14831_59 failed with td=140 and td=110, trying 100.
|
![]() |
![]() |
#51 |
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
488510 Posts |
![]() |
![]() |
![]() |
#52 |
Sep 2009
3D116 Posts |
![]()
Alright, but the upper end of the range is already at 400M, whereas the management page recommends an ending Q of only 362M
![]() |
![]() |
![]() |
#53 |
Sep 2008
Kansas
CF316 Posts |
![]() |
![]() |
![]() |
#54 |
(loop (#_fork))
Feb 2006
Cambridge, England
143578 Posts |
![]()
That is badly over-sieved, I would cut off the last hundred million lines and try the filtering again.
|
![]() |
![]() |
#55 | |
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
131516 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 post-processing? |
|
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
2018 15e post-processing reservations and results | fivemack | NFS@Home | 221 | 2019-01-04 13:08 |
16e Post Processing Progress | pinhodecarlos | NFS@Home | 8 | 2018-11-28 13:45 |
Crash doing large post-processing job | wombatman | Msieve | 22 | 2013-12-04 01:37 |
Update on 7^254+1 post processing | dleclair | NFSNET Discussion | 4 | 2005-04-05 09:51 |
Post processing for 2,757- | xilman | NFSNET Discussion | 3 | 2003-11-06 14:23 |