mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2007-06-23, 15:59   #1
T.Rex
 
T.Rex's Avatar
 
Feb 2004
France

2·457 Posts
Default Fast ECPP

Where can I download Fast ECPP (a multithreaded version of ECPP) by F. Morain ? executable and source code.

I only have been able to find an old version. Not sure that it works on fresh Linux ...

I'd like to prove the primality of a number with 12866 digits. How long ?

Tony
T.Rex is offline   Reply With Quote
Old 2007-06-25, 10:42   #2
T.Rex
 
T.Rex's Avatar
 
Feb 2004
France

2·457 Posts
Default

No one knows Fast ECPP ?
I thought Mr Silverman could help here ...

T.
T.Rex is offline   Reply With Quote
Old 2007-06-25, 12:37   #3
VolMike
 
VolMike's Avatar
 
Jun 2007
Moscow,Russia

7·19 Posts
Default

Hm.. I neither find new version, nor undestand how old works on Windows.
There is no executable files. How can I test this library?
VolMike
VolMike is offline   Reply With Quote
Old 2007-06-25, 12:39   #4
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

22×5×373 Posts
Default

Quote:
Originally Posted by T.Rex View Post
No one knows Fast ECPP ?
I thought Mr Silverman could help here ...

T.

I have not used ECPP nor coded it. I can help with APR-CL if desired.
R.D. Silverman is offline   Reply With Quote
Old 2007-06-25, 13:00   #5
T.Rex
 
T.Rex's Avatar
 
Feb 2004
France

2×457 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
I have not used ECPP nor coded it. I can help with APR-CL if desired.
WHy not ? Good idea. I'd like to spend CPU power to prove the primality of a number of about 12700 digits. Based on the few papers I quickly read about FastECPP, it would take about one year ... I've sent emails to some authors of FastECPP, waiting for answers.
Based on the complexity of APR-CL, it seems it would take about 3.10^10 operations. But I miss details.
So, is there a free version of APR-CL (or APRT-CL) I could download, compile and use ? I googled and found nuts. Reading some pages, it seems some versions can handle a limited number of digits. A parallelized version would be nice ...
So, I would really appreciate your help,
Thanks,
Tony
T.Rex is offline   Reply With Quote
Old 2007-06-25, 13:27   #6
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

22·5·373 Posts
Default

Quote:
Originally Posted by T.Rex View Post
WHy not ? Good idea. I'd like to spend CPU power to prove the primality of a number of about 12700 digits. Based on the few papers I quickly read about FastECPP, it would take about one year ... I've sent emails to some authors of FastECPP, waiting for answers.
Based on the complexity of APR-CL, it seems it would take about 3.10^10 operations. But I miss details.
So, is there a free version of APR-CL (or APRT-CL) I could download, compile and use ? I googled and found nuts. Reading some pages, it seems some versions can handle a limited number of digits. A parallelized version would be nice ...
So, I would really appreciate your help,
Thanks,
Tony
I coded APR-CL (in Fortran no less!) many years ago. (about 20).
It was written in a dialect of Fortran (for an Alliant FX-80) for which
a compiler no longer exists. Furthermore, the code would be slow by
current standards, even if run on modern computers because it does not
incorporate many improvements that have been found since then. (by
Bosma, Mihailescu, et. al.). Indeed, the code is backed up on an
EXABYTE tape (this was before CD's !!) and I do not have access to an
EXABYTE reader [does anyone anymore?] Finally, quite a bit of work
would be needed to accomodate 12K digits. The code was written to
handle < 1K digits.

Preda has a public version that he has made available in the past. You
might try asking him for his code. Henri Cohen might be another source.

You could also ask Francois for ECPP code.

I thought you wanted help with the theory......I don't have any code to give
out.

Another option: assume GRH and apply Bach's Theorem to Miller-Rabin.
This would yield an embarassingly parallel algorithm that requires no datacomm between processors..........
R.D. Silverman is offline   Reply With Quote
Old 2007-06-25, 16:42   #7
T.Rex
 
T.Rex's Avatar
 
Feb 2004
France

16228 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
I coded APR-CL (in Fortran no less!) many years ago. (about 20). ...
Seems not appropriate for 12700 digits .
Quote:
Preda has a public version that he has made available in the past. You might try asking him for his code. Henri Cohen might be another source.
Yes. Good idea.
Quote:
You could also ask Francois for ECPP code.
Already done. Waiting for an answer. My guess is that he already is in vacations. I should ask again in September !
Quote:
I thought you wanted help with the theory......I don't have any code to give out.
I do not have enough time to try to redo what others have already done. Maybe in 16 years, once retired !

Thanks,
Tony
T.Rex is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
ECPP-DJ danaj Computer Science & Computational Number Theory 59 2020-10-10 04:57
New ECPP record mjm Computer Science & Computational Number Theory 33 2020-02-13 14:50
Do normal adults give themselves an allowance? (...to fast or not to fast - there is no question!) jasong jasong 35 2016-12-11 00:57
ECPP on Windows? CRGreathouse Software 10 2015-09-14 12:32
Looking for ECPP software nuggetprime Software 14 2010-03-07 17:09

All times are UTC. The time now is 08:37.

Sat Dec 5 08:37:58 UTC 2020 up 2 days, 4:49, 0 users, load averages: 1.25, 1.50, 1.81

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.