![]() |
|
|
#56 | |
|
Mar 2006
479 Posts |
Quote:
I can definitely publish the source code for the verifier. I'd like to try and clean up some of the code (maybe making it faster in the process?) before I release it though. Right now my program takes about 1.4 times longer than Primo to verify a certificate. |
|
|
|
|
|
|
#57 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
622410 Posts |
|
|
|
|
|
|
#58 | |
|
Jun 2003
Ottawa, Canada
3·17·23 Posts |
Quote:
So I think it would be very useful if someone wrote a portable one that could be compiled and run on UNIX or Windows that could use multiple cores or even cluster nodes (via MPI or something). That would make proving easier if using multiple cores was automatic and some bigger numbers could be proven if someone throws it at a system with lots of cores or a big cluster. |
|
|
|
|
|
|
#59 | |
|
Mar 2006
479 Posts |
Quote:
|
|
|
|
|
|
|
#60 |
|
Mar 2006
479 Posts |
Okay, I've posted my Primo Verifier C code in the following thread:
http://www.mersenneforum.org/showthread.php?t=14086 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Twin Prime Conjecture Proof | Steve One | Miscellaneous Math | 53 | 2019-03-18 00:34 |
| Proof of Legendre's conjecture, that there is always a prime between n^2 and (n+1)^2 | MarcinLesniak | Miscellaneous Math | 41 | 2018-03-29 16:30 |
| A proof for the worlds largest prime | ModeEric | Information & Answers | 21 | 2017-11-29 14:46 |
| Proof Claimed for Deep Connection between Prime Numbers | Jeff Gilchrist | Math | 1 | 2012-09-11 14:42 |
| A proof for the Twin Prime Conjecture | Carl Fischbach | Miscellaneous Math | 7 | 2009-06-24 05:52 |