![]() |
![]() |
#1 |
Aug 2008
Good old Germany
3×47 Posts |
![]()
What is work type "LL Test with no factoring"?
Are these test with no factoring done so far? Or test with factoring, TF and P-1, done allready? And are there Doblechecks included? |
![]() |
![]() |
![]() |
#2 |
A Sunny Moo
Aug 2007
USA (GMT-5)
141518 Posts |
![]()
"LL Test with no factoring" means that the server will try, if it can, to give you a test that's already had all of its prefactoring (TF and P-1) done in advance. Ideally, this would be the case for all tests assigned as LL, in which case the regular LL worktype would behave identically. However, in practice, because there's not enough people helping with P-1, most first-pass LL assignments still have P-1 and the last few bits of TF left to be done. Regular LL assignments will first finish these, and then start the actual LL if no factor is found. "LL Test with no factoring", however, will skip straight to the LL test regardless of whether there is more TF or P-1 to be done. This is rather inefficient (since if a factor could have been found by TF or P-1, a weeks-long LL test would be saved), but it is nonetheless made available to give the option to folks who, for whatever reason, don't want to do any prefactoring whatsoever even if it potentially means wasting their time on an unneeded LL test.
|
![]() |
![]() |
![]() |
#3 |
Aug 2008
Good old Germany
3×47 Posts |
![]()
Thanks a lot for this really detailed explanation. A good reason for "LL-NF" would be using CUDALucas for example. ;)
|
![]() |
![]() |
![]() |
#4 |
A Sunny Moo
Aug 2007
USA (GMT-5)
3·2,083 Posts |
![]()
Indeed. Now that you mention it, I believe that was the primary reason LL-NF even exists in the first place--for CUDALucas and other programs like it (Mlucas, Glucas, MacLucasFFTW) that can do LL but not TF or P-1.
|
![]() |
![]() |
![]() |
#5 |
Aug 2008
Good old Germany
3·47 Posts |
![]()
It would be good, if we can have this worktype at the manual assignments.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
GQQ: a "deterministic" "primality" test in O(ln n)^2 | Chair Zhuang | Miscellaneous Math | 21 | 2018-03-26 22:33 |
Aouessare-El Haddouchi-Essaaidi "test": "if Mp has no factor, it is prime!" | wildrabbitt | Miscellaneous Math | 11 | 2015-03-06 08:17 |
Refurb. Mac emits "Bad CPU type in executable" error | ewmayer | Hardware | 15 | 2014-08-11 22:03 |
"factoring" vs "factorizing" | ixfd64 | Factoring | 4 | 2012-10-16 04:07 |
P-1 B1/B2 selection with "Test=" vs "Pfactor=" | James Heinrich | Software | 2 | 2005-03-19 21:58 |