![]() |
![]() |
#1 |
Oct 2005
Italy
3×113 Posts |
![]()
I can run some software on some IBM AIX servers.
Until now the only program I can build and run successfully is glucas. All the others have compile problems, etc. Are there any other software that can be compiled and run (in a simple way !!!) for IBM AIX (powerpc) to do some prime search ? I am looking for some software for sieve and/or search of primes; also "small" primes would be good. Last fiddled with by pacionet on 2010-08-30 at 09:20 |
![]() |
![]() |
![]() |
#3 |
Oct 2005
Italy
3·113 Posts |
![]()
Yes, I remember some difficulties to compile it.
Anyway I am searching some software for a different kind of primes, for Mersenne I am using glucas. I didn't think that compile and build on this platform was so annoying ! |
![]() |
![]() |
![]() |
#4 |
A Sunny Moo
Aug 2007
USA (GMT-5)
3·2,083 Posts |
![]()
You may want to check out Phrot, which is based on Glucas and can do:
-PRP tests on all k*b^n+-c numbers -Proth tests (a full primality test) on k*2^n+1 -PRP tests on Generalized Fermat numbers Note that any positive results returned by the PRP tests will need to be proven prime separately; aside from k*2^n+1, which Phrot can prove directly, you'll need to prove the primes with another program such as LLR or PFGW on an x86 machine. However, for most searches that would only be a small fraction of the overall computing time. |
![]() |
![]() |
![]() |
#5 |
Oct 2005
Italy
1010100112 Posts |
![]()
After some time spending trying to install Phrot i find some errors during compiling (it seems that it misses libm functions (sqrt, etc.))
It seems that I should install a particular libm which is not in standard AIX 5.3 distribution ... quite frustrating !!! |
![]() |
![]() |
![]() |
#6 | |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2D8816 Posts |
![]() Quote:
Paul |
|
![]() |
![]() |
![]() |
#7 |
"Mark"
Apr 2003
Between here and the
2·592 Posts |
![]()
It could be a 32-bit vs 64-bit issue.
|
![]() |
![]() |
![]() |
#8 |
Oct 2005
Italy
5238 Posts |
![]()
After some modifications:
1) export OBJECT_MODE=64 2) Adding -maix64 to compile flags 3) Commentig this line of mathtypes.h, because of conflicting definition //typedef long long int64; I got the following error: Code:
gcc -maix64 -lm -Wall \ -ffast-math \ -o phrot.g5 \ phrot.c \ -O3 -DY_MEM_THRESHOLD=8192 -DY_KILL_BRANCHES -DY_VECTORIZE \ -I../glucas ../glucas/libyeafft.a In file included from phrot.c:57: mathtypes.h:7: warning: ignoring #pragma warn phrot.c: In function 'doPRPTest': phrot.c:886: warning: format '%lli' expects type 'long long int', but argument 3 has type 'int64' phrot.c:995: warning: format '%lli' expects type 'long long int', but argument 3 has type 'int64' ld: 0711-317 ERROR: Undefined symbol: Y_NTHREADS ld: 0711-317 ERROR: Undefined symbol: Y_2NN ld: 0711-317 ERROR: Undefined symbol: Y_BS ld: 0711-317 ERROR: Undefined symbol: Y_DI ld: 0711-317 ERROR: Undefined symbol: Y_DJ ld: 0711-317 ERROR: Undefined symbol: Y_IR ld: 0711-317 ERROR: Undefined symbol: Y_NC ld: 0711-317 ERROR: Undefined symbol: Y_2N0 ld: 0711-345 Use the -bloadmap or -bnoquiet option to obtain more information. collect2: ld returned 8 exit status make: *** [phrot.g5] Error 1 Last fiddled with by pacionet on 2010-08-31 at 10:11 |
![]() |
![]() |
![]() |
#9 |
Oct 2005
Italy
3·113 Posts |
![]()
Solved with :
1) ar rc libyeafft.a *.o instead of ar rc libyeafft.a [drty]*.o as in Proth documentation and changing Makefile gcc -maix64 -lm -lpthread ${GCC_MARCH} -Wall Still got this warnings phrot.c:886: warning: format '%lli' expects type 'long long int', but argument 3 has type 'int64' phrot.c:995: warning: format '%lli' expects type 'long long int', but argument 3 has type 'int64' Now I try to run some self test (if any) to test Proth working |
![]() |
![]() |
![]() |
#10 | |
Jan 2008
France
59610 Posts |
![]() Quote:
Last fiddled with by ldesnogu on 2010-08-31 at 10:56 |
|
![]() |
![]() |
![]() |
#11 |
Oct 2005
Italy
3·113 Posts |
![]()
Mmmmm...
Now I builded successfully Phrot (no errors or warning) but I got the following result bash-3.2$ phrot.g5 -q 5028*10^83982+1 Phil Carmody's Phrot (0.72) Input 5028*10^83982+1 : Actually testing 5028*1000000^13997+1 (witness=3 13998/28672 limbs) 5028*10^83982+1 is composite LLR64=0000000000000001. (e=0.00000 (0.0824785~0@0.000) t=133.91s) On this proven prime number: http://primes.utm.edu/primes/page.php?id=79257 I fear that the problem is in maththypes.h //typedef long long int64; while in <inttypes.h> #ifdef __64BIT__ typedef long int64; #else /* _ILP32 */ #if defined(_LONG_LONG) typedef signed long long int64; #endif #endif If i don't comment the line //typedef long long int64; I got the following error: In file included from phrot.c:57: mathtypes.h:9: error: conflicting types for 'int64' /usr/include/inttypes.h:622: error: previous declaration of 'int64' was here |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
mac software? | miumiu2134 | Software | 1 | 2013-05-29 10:22 |
Best Software? | Unregistered | Homework Help | 0 | 2008-10-07 01:00 |
New forum software... | Xyzzy | Forum Feedback | 61 | 2006-01-03 18:19 |
Software | TTn | PSearch | 0 | 2004-05-04 13:16 |
New software... | Xyzzy | Lounge | 112 | 2003-10-16 13:23 |