20140723, 20:10  #133 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
23×271 Posts 
This is a binary that has the other problem as well? There is something odd about your compiles. I would try to compile a Linux binary for you myself but various things would need to be a later version on your system.
BTW you should be able to use the binary I posted above within wine. Last fiddled with by henryzz on 20140723 at 20:10 
20140724, 15:06  #134  
Jun 2009
2BC_{16} Posts 
Quote:
I know the system is outdated, but I am not the one to decide about updating it... 

20140725, 16:49  #135 
Jun 2009
2^{2}·5^{2}·7 Posts 
Updating do gcc 4.4.7 did not change anything.
When I try to replace the mulmod function with the assembler version, I get a lot of "line xxx: stray \240" messages. What's that? 
20140725, 19:28  #136  
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
1100001011001_{2} Posts 
Quote:
For the asm look at the following link. Search for 240 and read from there. I would type it in rather than copy it. http://forums.whirlpool.net.au/archive/435288 Your linux is 64bit right? 32bits would be a possible reason for problems. Last fiddled with by henryzz on 20140725 at 19:30 

20140728, 14:39  #137  
Jun 2009
2^{2}×5^{2}×7 Posts 
Quote:
Yes, it's 64bit. 

20140811, 10:37  #138 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
23×271 Posts 
I think I have fixed the bug in the gmp version. Replace mpz_tdiv_ui with mpz_fdiv_ui in two places. This was meaning I was getting for example 3 mod 7 rather than 4 mod 7. In some places this would be fine but not there apparently.
I would suggest testing this with any new polynomials you try for a while. I think the old code would work with positive coefficients of P(s) and Q(s) but not negative. 
20140812, 10:16  #139 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
14131_{8} Posts 
I have also found the issue with the extra inputs I added.
Please change Code:
scanf("%lld",&bound_small_primes); and scanf("%lld",&smallPrimes); Code:
scanf("%d",&bound_small_primes); and scanf("%d",&smallPrimes); Apologies for how long it took for me to find this. c isn't a language I am overly fluent in although I am getting better. I have attached fixed source for both gmp and not. Please test before relying on it to work. Last fiddled with by henryzz on 20140812 at 10:19 
20140812, 12:17  #140 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
23×271 Posts 
Found three triples during testing
2238819531*((15*2^12461)^3+2*(15*2^12461)^2)3*(15*2^12461)6 1/+1/+5 Only +5 proven. 509488329*((177*2^10321)^3+2*(177*2^10321)^2)3*(177*2^10321)6 1/+1/+5 All proven 1914682779*((177*2^10321)^3+2*(177*2^10321)^2)3*(177*2^10321)6 1/+1/+5 All proven I have only tested ~21% of the second file so far so hopefully more will be found. Last fiddled with by henryzz on 20140812 at 12:35 
20140812, 12:44  #141 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
23·271 Posts 
Found the gmp bug was in stage 2 as well. Corrected source attached.

20140812, 14:19  #142 
Jun 2009
2^{2}×5^{2}×7 Posts 

20150426, 12:14  #143 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
6233_{10} Posts 
Here is a binary for polysieve2 with all the latest fixes.
I have also included the final prime for each 10_tuple upto 1e16 of the form 0 2 6 12 14 20 24 26 30 32. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
How/Where to get Jens Kruse Andersen's prime constellation sieve?  Stargate38  And now for something completely different  2  20170428 00:08 
Efficiently finding a linear progression in data  fivemack  Math  27  20151212 18:42 
GPU Prime Sieve  tapion64  GPU Computing  7  20140410 06:15 
Sieve depth vs. prime probability  Unregistered  Information & Answers  2  20100525 20:51 
Prime in Riesel Sieve Project  Sloth  Prime Sierpinski Project  1  20060510 02:02 