mtsieve

[rogue]

Originally Posted by Citrix

Since 8+2=10

You can do it by 2 bitshift operations, 1 addition, 3-4 compare operations, 1 subtraction. Still faster than fkbnsieve for each individual n.

True, but I have avoided writing code that uses different logic for different bases.

If someone wants to hack the code to improve performance for a specific base or edge case, they are welcome to do so. The source code is freely available and can be built with tools that are free.

If someone has an algorithm that improves performance that is not specific to a base or edge case, then I would definitely consider updating the code base.

[pepi37]

k1b2sieve.exe -P 100000000 -n1778899 -N2778899 -c1 -C2
k2b2sieve v1.0, a program to find factors of 2^n+c numbers for variable n and c


cosmetic bug
when you start k1b2sieve.exe first line say k2b2sieve v1.0


so or it is k1 or it is k2 :)


Also ( as nearly in any of your sieves in this package:) when you terminate sieve , and wait... got nothing for results. :(
To explain: I start sieve with parameters above, wait ten minutes, terminate it with CTRL+C and when program exit there is no sieve file

[rogue]

Originally Posted by pepi37

k1b2sieve.exe -P 100000000 -n1778899 -N2778899 -c1 -C2
k2b2sieve v1.0, a program to find factors of 2^n+c numbers for variable n and c


cosmetic bug
when you start k1b2sieve.exe first line say k2b2sieve v1.0


so or it is k1 or it is k2 :)


Also ( as nearly in any of your sieves in this package:) when you terminate sieve , and wait... got nothing for results. :(
To explain: I start sieve with parameters above, wait ten minutes, terminate it with CTRL+C and when program exit there is no sieve file

Try version 1.1. I think that is the version in the current distribution on source forge.

[hunson]

Hey,


I recently found a twinprime which is big enough to submit it to C. Caldwell's prime pages. I used twinsieve.exe for the sieving and LLR for the proof so I want to give all programmers credit for the find, I tried to create a new proof code for [me, LLR and twinsieve] but I am struggling to find twinsieve.exe or mtsieve as existing codes. Have I overlooked something or is there no code jet ?
Short question: What proofer-account should I use when I want to give credit to twinsieve/mtsieve ?


Thanks in advance.

[paulunderwood]

Originally Posted by hunson

Hey,


I recently found a twinprime which is big enough to submit it to C. Caldwell's prime pages. I used twinsieve.exe for the sieving and LLR for the proof so I want to give all programmers credit for the find, I tried to create a new proof code for [me, LLR and twinsieve] but I am struggling to find twinsieve.exe or mtsieve as existing codes. Have I overlooked something or is there no code jet ?
Short question: What proofer-account should I use when I want to give credit to twinsieve/mtsieve ?


Thanks in advance.

I think it is this one: https://primes.utm.edu/bios/page.php?id=449

[rogue]

No prover code for mtsieve. I've asked about either creating a new one or switching MultiSieve over to mtsieve.

[hunson]

Sorry I have to ask again: Did you ask someone to change MultiSieve.exe to mtsieve respectively create a new prover code for mtsieve?
If there is a change, how do we know about it?


regards,


hunson

[rogue]

Originally Posted by hunson

Sorry I have to ask again: Did you ask someone to change MultiSieve.exe to mtsieve respectively create a new prover code for mtsieve?
If there is a change, how do we know about it?

For now use MultiSieve, but I have a question to the owners of Prime Pages about it.

[paulunderwood]

Originally Posted by hunson

Hey,


I recently found a twinprime which is big enough to submit it to C. Caldwell's prime pages. I used twinsieve.exe for the sieving and LLR for the proof so I want to give all programmers credit for the find, I tried to create a new proof code for [me, LLR and twinsieve] but I am struggling to find twinsieve.exe or mtsieve as existing codes. Have I overlooked something or is there no code jet ?
Short question: What proofer-account should I use when I want to give credit to twinsieve/mtsieve ?


Thanks in advance.

The comment to your twin primes should be "Twin (p)" and "Twin (p+2)" -- you need to submit both. The UTM parser is very finickety.

Congrats!

[hunson]

I was afraid that I had to do that. Thanks for the clarification, but in my defence there is no obvious documentation :) Now I submitted the p+2 form too.

[paulunderwood]

Originally Posted by hunson

I was afraid that I had to do that. Thanks for the clarification, but in my defence there is no obvious documentation :) Now I submitted the p+2 form too.

It is not intuitive. WIBNI there was some kind of drop-down selector for the types?

Unless Chris Caldwell spots the error or someone notifies him of it, your entry will not be right and it will not register on the top20 of twins,