![]() |
![]() |
#463 | |
Dec 2011
After milion nines:)
56E16 Posts |
![]() Quote:
https://sourceforge.net/projects/mts....6.7z/download |
|
![]() |
![]() |
![]() |
#464 |
"Mark"
Apr 2003
Between here and the
140378 Posts |
![]()
I updated the html months ago, but apparently never posted it. The mtsieve home page has been updated.
|
![]() |
![]() |
![]() |
#465 |
Einyen
Dec 2003
Denmark
3×17×59 Posts |
![]()
fkbnsieve v1.3 (mtsieve 2.0.6) works, but seems very slow compared to when I used it before. The p=3 step is running very slowly even with c-ranges of a few million only removing a few thousands factors per second.
Code:
fkbnsieve.exe -c 1 -C 1000000 -P 400000000 -s "1*2^65+c" Primes tested: 21336332. Factors found: 972437. Remaining terms: 27563. Time: 48.53 seconds. fkbnsieve.exe -c 1 -C 2000000 -P 400000000 -s "1*2^65+c" Primes tested: 21336332. Factors found: 1944946. Remaining terms: 55054. Time: 190.56 seconds. fkbnsieve.exe -c 1 -C 4000000 -P 400000000 -s "1*2^65+c" Primes tested: 21336332. Factors found: 3889879. Remaining terms: 110121. Time: 758.98 seconds. fkbnsieve v1.1: fkbnsieve.exe -c 1 -C 4000000 -P 400000000 -s "1*2^65+c" Primes tested: 21336328. Factors found: 972437. Remaining terms: 27563. Time: 1.73 seconds. This last one taking 758.98s takes only 1.73s in fkbnsieve v1.1 (mtsieve 1.8.4) I'll just use fkbnsieve v1.1 for now, but I wanted to report it in case it is a bug. Last fiddled with by ATH on 2020-11-29 at 06:57 |
![]() |
![]() |
![]() |
#466 | |
"Mark"
Apr 2003
Between here and the
52×13×19 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#467 |
Dec 2011
After milion nines:)
2·5·139 Posts |
![]()
I cannot find fkbnsieve.exe in latest release ( in 7z file)
Also can srsieve2 sieve in parallel few sequences or just one by one? Last fiddled with by pepi37 on 2020-11-29 at 21:30 |
![]() |
![]() |
![]() |
#468 |
"Curtis"
Feb 2005
Riverside, CA
23×577 Posts |
![]()
If by "in parallel" you mean multi-threaded, yep.
|
![]() |
![]() |
![]() |
#469 |
Dec 2011
After milion nines:)
25568 Posts |
![]() |
![]() |
![]() |
![]() |
#470 |
"Mark"
Apr 2003
Between here and the
52·13·19 Posts |
![]() |
![]() |
![]() |
![]() |
#471 | |
"Mark"
Apr 2003
Between here and the
11000000111112 Posts |
![]() Quote:
In short, this will only impact you for small p. Once p > maxC - minC, the speed will be the same. |
|
![]() |
![]() |
![]() |
#472 |
Dec 2011
After milion nines:)
2×5×139 Posts |
![]() |
![]() |
![]() |
![]() |
#473 |
Dec 2011
After milion nines:)
2·5·139 Posts |
![]()
Rogue one suggestion for all sieve programs in mtsieve package.
When using with -I -A ( apply factors and exit) add simple logic to check is factors really factors. I accidentally make wrong copy paste and srsieve2 remove candidate regardless fact ( because error) that was not good factor for that candidate. |
![]() |
![]() |