Quote from: n4ru on July 10, 2013, 01:25:17 PM

Quote from: 8bitPunk on July 10, 2013, 10:09:25 AM

Quote from: rethaw on July 10, 2013, 09:41:00 AM

You tested the centers, you need to test the chain results. In Sunny's paper it describes how to get them, or here:

http://en.wikipedia.org/wiki/Cunningham_chain

You are quite right. However, the first probable prime still fails.
The positive result is:

Code:

Primality testing 65004063504559525007738276505391185322137155270201199057971076511954045665048965173722209501026611156768988779138868408914387452650147975793533060274322762631 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Running N-1 test using base 7
Running N+1 test using discriminant 19, base 1+sqrt(19)
Calling N-1 BLS with factored part 49.24% and helper 2.29% (150.19% proof)
65004063504559525007738276505391185322137155270201199057971076511954045665048965173722209501026611156768988779138868408914387452650147975793533060274322762631 is prime! (0.0250s+0.0033s)

does this mean it's not actually generating valid primes?

As I understand the primecoin paper, it accepts pseudoprimes for making a block.. as a true check of primality would take too long for nodes to verify.