![]() |
[QUOTE=pepi37;496813]And last
If sieve passed 54105949591 ( or very close up to this value) then will be no output and program just terminate. If sieve depth is lower then that value, program gives output as should do.[/QUOTE] What inputs did you use? Similar to fbncsieve, it will stop sieving at sqrt(k*b^n) as terms above that value are prime. |
[QUOTE=rogue;496822]What inputs did you use? Similar to fbncsieve, it will stop sieving at sqrt(k*b^n) as terms above that value are prime.[/QUOTE]
I test same with newpgen and he continue to sieve, so that i not problem |
[QUOTE=pepi37;496832]I test same with newpgen and he continue to sieve, so that i not problem[/QUOTE]
Please provide me the command line options you are using and an input files. |
[QUOTE=rogue;496839]Please provide me the command line options you are using and an input files.[/QUOTE]
twinsieve -P600000000000 -i1.npg -o11.npg -Ofactor.txt -fN Also look at problem with -r option when you got insane number of factors |
[QUOTE=pepi37;496840]twinsieve -P600000000000 -i1.npg -o11.npg -Ofactor.txt -fN
Also look at problem with -r option when you got insane number of factors[/QUOTE] I need the file 1.npg. |
[QUOTE=rogue;496844]I need the file 1.npg.[/QUOTE]
Create with twinsieve -P100000000 -k2 -K100000 -b2 -n1778899 -fN -r then result rename to 1.npg :) Just increase first value to 100000000000 and you got all problems you need: there is no output file ( if you do test on Newpgen ( or TwinGenX then you still got output with 67 candidates left) Your twinsieve will produce no output,. Try this twinsieve -P100000000000 -k2 -K100000 -W4 -b2 -n1778899 -fN -r P.S I cannot see twinsieve in makefile [I]PROGS=afsieve mfsieve gfndsieve fbncsieve fkbnsieve pixsieve xyyxsieve cksieve kbbsieve gcwsieve psieve[/I] |
Still no hope to have a MMpsieve working in the near future, isn't it? :smile:
|
[QUOTE=ET_;496903]Still no hope to have a MMpsieve working in the near future, isn't it? :smile:[/QUOTE]
Sorry, I've been busy, but now that you have nudged me, I can spend some time on it. I need to fix the issues with twinsieve first. |
[QUOTE=rogue;496904]Sorry, I've been busy, but now that you have nudged me, I can spend some time on it. I need to fix the issues with twinsieve first.[/QUOTE]
Sure, no hurry and maximum collaboration. Thanks! |
It looks like I found another bug in pixsieve. It seems to stop shortly after p=24068943967, which is well short of 2^52:
[CODE]C:\Users\Dylan\Desktop\prime finding\sieves\mtsieve>pixsieve -W 12 -w 10000 -P29e9 -i e_100k-1M_primecan.txt -o e_100k-1M_primecan.txt pixsieve v2.5, a program to find factors of substrings of a decimal string Sieve started: 24000000131 < p < 29e9 with 21189 terms (100015 <= length <= 999966) (expecting 166 factors) p=24068943967, 3.942K p/sec, 0 factors found, 1.4% done. ETC 2018-09-29 22:24 C:\Users\Dylan\Desktop\prime finding\sieves\mtsieve>[/CODE] This behavior persists regardless of whether I use the GPU or not: [CODE]C:\Users\Dylan\Desktop\prime finding\sieves\mtsieve>pixsieve -G 1 -D 1 -P29e9 -i e_100k-1M_primecan.txt -o e_100k-1M_primecan.txt pixsieve v2.5, a program to find factors of substrings of a decimal string GPU primes per worker is 61440 Sieve started: 24000000131 < p < 29e9 with 21189 terms (100015 <= length <= 999966) (expecting 166 factors) p=24067958093, 8.058K p/sec, 0 factors found, 1.4% done. ETC 2018-09-29 12:51 C:\Users\Dylan\Desktop\prime finding\sieves\mtsieve>[/CODE] |
[QUOTE=Dylan14;497056]It looks like I found another bug in pixsieve. It seems to stop shortly after p=24068943967, which is well short of 2^52:
[CODE]C:\Users\Dylan\Desktop\prime finding\sieves\mtsieve>pixsieve -W 12 -w 10000 -P29e9 -i e_100k-1M_primecan.txt -o e_100k-1M_primecan.txt pixsieve v2.5, a program to find factors of substrings of a decimal string Sieve started: 24000000131 < p < 29e9 with 21189 terms (100015 <= length <= 999966) (expecting 166 factors) p=24068943967, 3.942K p/sec, 0 factors found, 1.4% done. ETC 2018-09-29 22:24 C:\Users\Dylan\Desktop\prime finding\sieves\mtsieve>[/CODE] This behavior persists regardless of whether I use the GPU or not: [CODE]C:\Users\Dylan\Desktop\prime finding\sieves\mtsieve>pixsieve -G 1 -D 1 -P29e9 -i e_100k-1M_primecan.txt -o e_100k-1M_primecan.txt pixsieve v2.5, a program to find factors of substrings of a decimal string GPU primes per worker is 61440 Sieve started: 24000000131 < p < 29e9 with 21189 terms (100015 <= length <= 999966) (expecting 166 factors) p=24067958093, 8.058K p/sec, 0 factors found, 1.4% done. ETC 2018-09-29 12:51 C:\Users\Dylan\Desktop\prime finding\sieves\mtsieve>[/CODE][/QUOTE] IF this is from the latest release, then I know the problem and it will be fixed. I introduced a bug in mtsieve 1.8.0 |
| All times are UTC. The time now is 04:17. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.