![]() |
![]() |
#1 |
(loop (#_fork))
Feb 2006
Cambridge, England
6,379 Posts |
![]()
I'm trying to run some polynomial selection on a C194 with an updated msieve, and it is choosing a much sparser set of initial coefficients (some ranges of 10000 c5 have no valid initial coefficient) and then wanting to run each coefficient for a hundred days! Maybe 1600 seconds was a bit short, but 8640000 seconds is implausibly long.
|
![]() |
![]() |
![]() |
#2 |
Apr 2010
32·17 Posts |
![]()
I guess this is because of a patch to yafu/msieve that I posted. I use this to factor smaller composites and did not care for composites above C160.
I've set the timeout so big to disable it because in my experience it's better to set the stage1_norm to a value that stage1 can finish in time. The high_coeff_multiplier is set to 360 because in my experience the overall chance to find a good poly is better with a smoother leading coefficiant. But most likely this is not the optimal value. |
![]() |
![]() |
![]() |
#3 |
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
2×3×1,753 Posts |
![]() |
![]() |
![]() |
![]() |
#4 |
Apr 2010
2318 Posts |
![]() |
![]() |
![]() |
![]() |
#5 |
Tribal Bullet
Oct 2004
2·3·19·31 Posts |
![]()
The configuration for large polyselect jobs does many fairly outlandish things; I guess it's worth revisiting how configuration works so that we can get sensible defaults even without user-specific configuration.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Polynomial selection | Max0526 | NFS@Home | 9 | 2017-05-20 08:57 |
Improved NFS polynomial selection | jasonp | Operation Kibibit | 5 | 2014-09-07 11:02 |
2^877-1 polynomial selection | fivemack | Factoring | 47 | 2009-06-16 00:24 |
Polynomial selection | CRGreathouse | Factoring | 2 | 2009-05-25 07:55 |
Strange behavior of polynomial selection | ET_ | Msieve | 5 | 2008-12-24 14:45 |