![]() |
![]() |
#23 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
89·113 Posts |
![]()
Excellent. I'll write to Markus - he could tweak his intake script.
I will also suggest him to automate the situation that someone would submit Pari-formatted cert, as well. Pari-formatted cert is an array of arrays, a naked object. Markus could do the conversion on his server side. |
![]() |
![]() |
![]() |
#24 | |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2×3×29×67 Posts |
![]() Quote:
My only complaint is that it seems the number to be tested must be given on the command line. It would be nice if it could be fed in via stdin. Yes, I know this is a trivial change to the source, which I will make and feed back to the devs. |
|
![]() |
![]() |
![]() |
#25 | |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2·3·29·67 Posts |
![]() Quote:
Progress so far: Code:
MPI with 5 workers initialised, of which 5 are local. GMP: include 6.2.1, lib 6.2.1 MPFR: include 4.1.0, lib 4.1.0 MPC: include 1.2.1, lib 1.2.1 MPFRCX: include 0.6.3, lib 0.6.3 PARI: include 2.13.3, lib 2.13.3 Could not open file 'cert1033.cert1' for reading. Writing to 'cert1033.cert1'. -- Time for class numbers up to Dmax=283248900: 696.9 (159.6) *** Warning: increasing stack size to 536870912. *** Warning: increasing stack size to 536870912. *** Warning: increasing stack size to 536870912. *** Warning: increasing stack size to 536870912. *** Warning: increasing stack size to 536870912. *** Warning: increasing stack size to 1073741824. *** Warning: increasing stack size to 1073741824. *** Warning: increasing stack size to 1073741824. *** Warning: increasing stack size to 1073741824. *** Warning: increasing stack size to 1073741824. *** Warning: increasing stack size to 2147483648. *** Warning: increasing stack size to 2147483648. *** Warning: increasing stack size to 2147483648. *** Warning: increasing stack size to 2147483648. *** Warning: increasing stack size to 2147483648. -- Time for primorial of B=2684354560: 269.2 (63.4) -- hmaxprime: 32 -- Size [0]: 33660 bits |
|
![]() |
![]() |
![]() |
#26 |
Sep 2002
Database er0rr
23·3·11·17 Posts |
![]()
Even I managed to get mpirun ecpp-mpi -g -n '(10^1031-1)/9' -c -f cert-1031 working, after downloading, compiling and installing mpfrcx-0.6.3; and configuring ecpp-mpi with the right flag to configure; and installing openmpi and setting PATH and LD_LIBRARY_PATH -- all on a Celeron laptop.
As soon as my current Primo run has finished I will prove a Mersenne cofactor ~26k digits. It will be interesting to see how much saturation occurs on my 64 core machine. Last fiddled with by paulunderwood on 2022-05-08 at 22:51 |
![]() |
![]() |
![]() |
#27 |
"Daniel Jackson"
May 2011
14285714285714285714
3×251 Posts |
![]()
I got every package to compile in Windows Bash, but when I run ecpp, I get "ecpp: error while loading shared libraries: libcm.so.0: cannot open shared object file: No such file or directory", and when I try to access the specified file via Windows, I get "The file cannot be accessed by the system". Googling the problem didn't help too much, but I did learn that the "file" (/usr/local/lib/libcm.so.0) in question is actually a broken symlink. How do I fix it?
Last fiddled with by Stargate38 on 2022-05-09 at 00:02 |
![]() |
![]() |
![]() |
#28 | |
Sep 2002
Database er0rr
23·3·11·17 Posts |
![]() Quote:
Code:
LD_LIBRARY_PATH=$LD_LIBRARY_PATH:/usr/local/lib export LD_LIBRARY_PATH Note ecpp, as opposed to ecpp-mpi, is single threaded. Your next step will be to get mpi running. Last fiddled with by paulunderwood on 2022-05-09 at 00:28 |
|
![]() |
![]() |
![]() |
#29 |
Jul 2003
So Cal
2·3·433 Posts |
![]()
Certification of a 10k digit prime, 2^33217+111, took 20 hours using 2x Xeon E5-2670 v2 cpus with a total of 20 cores and 40 hyperthreads.
|
![]() |
![]() |
![]() |
#30 |
"Daniel Jackson"
May 2011
14285714285714285714
3×251 Posts |
![]()
This is what happened when I tried running ecpp-mpi via "mpirun ecpp-mpi -g -n '10^1000+453' -c -f cert-1000" (The example provided in the accompanying PDF from their website):
Code:
----------------------------------------------------------------------------- It is a Very Bad Idea to run this program as root. LAM was designed to be run by individual users; it was *not* designed to be run as a root-level service where multiple users use the same LAM daemons in a client-server fashion. Especially with today's propensity for hackers to scan for root-owned network daemons, it could be tragic to run this program as root. While LAM is known to be quite stable, and LAM does not leave network sockets open for random connections after the initial setup, several factors should strike fear into system administrator's hearts if LAM were to be constantly running for all users to utilize: 1. LAM leaves a Unix domain socket open on each machine in the /tmp directory. So if someone breaks into root on one machine, they effectively have root on all machines that are connected via LAM. 2. Indeed, there must have been a .rhosts (or some other trust mechanism) for root which must have allowed you to run LAM on remote nodes. Depending on your local setup, this may not be safe. 3. LAM has never been checked for buffer overflows and other malicious input types of errors. We don't *think* that there are any buffer-overflow types of situations in LAM, we've never checked explicitly (hence, per Mr. Murphy, there are certainly some hiding somewhere). 4. LAM programs are not audited or tracked in any way. This could present a sneaky way to execute binaries without log trails (especially as root). Hence, it's a Very Bad Idea to run LAM as root. Please login as a different user and run LAM again. ----------------------------------------------------------------------------- Last fiddled with by Stargate38 on 2022-05-09 at 15:59 |
![]() |
![]() |
![]() |
#31 | |
Sep 2002
Database er0rr
23·3·11·17 Posts |
![]() Quote:
Code:
adduser stargate38 su stargate38 Last fiddled with by paulunderwood on 2022-05-09 at 16:49 |
|
![]() |
![]() |
![]() |
#32 |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2×3×29×67 Posts |
![]() |
![]() |
![]() |
![]() |
#33 | |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2·3·29·67 Posts |
![]() Quote:
I am running mpi-ecpp on a 6-core machine. Without additional information it fired up one master process and 5 workers. Because of hyperthreading two processes could be interleaved at relatively little cost on each physical processor. That said, each process will grab its own share of memory physical and virtual and you may not be able to run as many processes as processors, let alone twice that. I a'm not going to fiddle with a(n apparently) working invocation of mpi-ecpp but now wonder whether "mpi -np 7" might be a suitable incantation for a similar job, on the grounds that there may (just) be enough RAM available. The above assumes that the remaining machines on the local net are not set up to run mpi jobs. This is a valid assumption right now. Whether it is worth the effort of setting them up remains to be seen. |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
what is the best primality software? | bbb120 | Proth Prime Search | 75 | 2022-10-08 11:45 |
Fastest software for Mersenne primality test? | JonathanM | Information & Answers | 25 | 2020-06-16 02:47 |
APR-CL as primality proof | f1pokerspeed | FactorDB | 14 | 2014-01-09 21:06 |
Proof of Primality Test for Fermat Numbers | princeps | Math | 15 | 2012-04-02 21:49 |
PRIMALITY PROOF for Wagstaff numbers! | AntonVrba | Math | 96 | 2009-02-25 10:37 |