I have re-released the OS X build of PFGW 3.4.0. Apparently the 32-bit version has problems with the static-linked GMP and the 64-bit version wasn't working correctly. I suspect a linker bug in the one case and a compiler bug in the other as the other. For the 64-bit version I didn't use any optimizations with PFGW itself (gwnum and GMP are still optimized) and it is appears to be faster.

I'm very close to having a 64-bit linux build posted. Hopefully tomorrow.

Okay, I've tried testing 289184*5^477336-1 with both LLR 3.8.1 and 3.8.2 to see if the mysterious slowdown exists in LLR as well.
[code]
$ ./cllr381.exe -d -q289184*5^477336-1
Base prime factor(s) taken : 5
Starting N+1 prime test of 289184*5^477336-1
Using zero-padded FFT length 128K, a = 3

289184*5^477336-1 is not prime. RES64: 08B0E31C3A9EFF00. OLD64: 077A0603FB8C61BF Time : 3958.254 sec.

$ ./cllr.exe -d -q289184*5^477336-1
Base prime factor(s) taken : 5
Starting N+1 prime test of 289184*5^477336-1
Using zero-padded Core2 type-3 FFT length 128K, Pass1=128, Pass2=1K, a = 3

289184*5^477336-1 is not prime. RES64: 08B0E31C3A9EFF00. OLD64: 077A0603FB8C61BF Time : 3858.415 sec.
[/code]
Oddly enough, LLR did turn out to be faster by a significant amount. (That'll teach me to use 20 seconds' worth of ms/iter. figures as data points. :rolleyes:)

Next, I'll repeat the test with Prime95 25.11 and 26.2 to see whether it has a slowdown or not.

A 64-bit Linux build is finally available thanks to Steven Harvey. You can d/l the latest releases from [URL="http://sourceforge.net/projects/openpfgw/"]here[/URL].

I get an error with Debian running pfgw64 testing 100000000000*2731#+1 :smile:

[CODE]-----------------------------------------------------------------------
Error occuring in PFGW at Tue Oct 12 00:56:51 2010
Expr = 100000000000*2731#+1
Detected in gw_test_illegal_sumout() in prp_using_gwnum
Iteration: 1/3911 ERROR: ILLEGAL SUMOUT
PFGW will automatically rerun the test with -a1
-----------------------------------------------------------------------
Error occuring in PFGW at Tue Oct 12 00:56:51 2010
Expr = 100000000000*2731#+1
Detected in gw_test_illegal_sumout() in prp_using_gwnum
Iteration: 1/3911 ERROR: ILLEGAL SUMOUT
PFGW will automatically rerun the test with -a2
-----------------------------------------------------------------------
Error occuring in PFGW at Tue Oct 12 00:56:51 2010
Expr = 100000000000*2731#+1
Detected in gw_test_illegal_sumout() in prp_using_gwnum
Iteration: 1/3911 ERROR: ILLEGAL SUMOUT
PFGW will automatically rerun the test with -a3
-----------------------------------------------------------------------
Error occuring in PFGW at Tue Oct 12 00:56:51 2010
Expr = 100000000000*2731#+1
Detected in gw_test_illegal_sumout() in prp_using_gwnum
Iteration: 1/3911 ERROR: ILLEGAL SUMOUT
PFGW will automatically rerun the test with -a4
-----------------------------------------------------------------------
Error occuring in PFGW at Tue Oct 12 00:56:51 2010
Expr = 100000000000*2731#+1
Detected in gw_test_illegal_sumout() in prp_using_gwnum
Iteration: 1/3911 ERROR: ILLEGAL SUMOUT
PFGW will automatically rerun the test with -a5
-----------------------------------------------------------------------
Error occuring in PFGW at Tue Oct 12 00:56:51 2010
Expr = 100000000000*2731#+1
Detected in gw_test_illegal_sumout() in prp_using_gwnum
Iteration: 1/3911 ERROR: ILLEGAL SUMOUT
PFGW will automatically rerun the test with -a6[/CODE]

pfgw32 is okay on the same 64 bit Debian box

[QUOTE=paulunderwood;233184]I get an error with Debian running pfgw64 testing 100000000000*2731#+1 :smile:

pfgw32 is okay on the same 64 bit Debian box[/QUOTE]

George is aware of the problem (linux 64-bit only) and has a fix. I'll be building a new release with gwnum v26.3 in the next week.

I started running some base 3 work and got this:[CODE]PFGW Version 3.4.1.64BIT.20100927.Win_Dev [GWNUM 26.2]

Factoring numbers to 100% of normal.

Script File
trial factoring to 49598
820000000*3^1-1 factors prime!: 2459999999
Primality testing 820000002-1 [N-1/N+1, Brillhart-Lehmer-Selfridge]
small number, factored
820000002-1 is factored (0.0005s+0.0085s)
trial factoring to 49598
820000004*3^1-1 has factors: 7
trial factoring to 65536
820000004*3^2-1 has factors: 5
trial factoring to 65536
Switching to Exponentiating using GMP
820000004*3^3-1 is 3-PRP! (0.0001s+0.0053s)
Primality testing 820000004*3^3-1 [N+1, Brillhart-Lehmer-Selfridge]
trial factoring to 65536
Running N+1 test using discriminant 5, base 1+sqrt(5)
Error 1002 initializing FFT code:[/CODE]
The 32 bit binary works fine.

[QUOTE=henryzz;233554]I started running some base 3 work and got this:[CODE]PFGW Version 3.4.1.64BIT.20100927.Win_Dev [GWNUM 26.2]

Factoring numbers to 100% of normal.

Script File
trial factoring to 49598
820000000*3^1-1 factors prime!: 2459999999
Primality testing 820000002-1 [N-1/N+1, Brillhart-Lehmer-Selfridge]
small number, factored
820000002-1 is factored (0.0005s+0.0085s)
trial factoring to 49598
820000004*3^1-1 has factors: 7
trial factoring to 65536
820000004*3^2-1 has factors: 5
trial factoring to 65536
Switching to Exponentiating using GMP
820000004*3^3-1 is 3-PRP! (0.0001s+0.0053s)
Primality testing 820000004*3^3-1 [N+1, Brillhart-Lehmer-Selfridge]
trial factoring to 65536
Running N+1 test using discriminant 5, base 1+sqrt(5)
Error 1002 initializing FFT code:[/CODE]
The 32 bit binary works fine.[/QUOTE]

I'll see if that is fixed wit gwnum v26.3.

[QUOTE=rogue;233654]I'll see if that is fixed wit gwnum v26.3.[/QUOTE]

Works with the latest gwnum.

I just upgraded my quad to PFGW 3.4.0 (32-bit) and am pleased to say that I got a very nice 25% (!) speed boost over 3.3.6! Tests that took about 1630 seconds on 3.3.6 are now taking 1230 seconds. This is on base 6, near n=350K; I also get a speedup of similar magnitude with LLR 3.8.2 (vs. 3.8.0) on base 2 numbers around n=920K. It would seem that this CPU (Intel Q6600) benefits particularly well from the improvements in gwnum v26.

BTW @Mark and George: my apologies for not getting back to you sooner regarding my testing Prime95 on my dualcore to see if the mysterious base 5 slowdown occurs in there as well. As detailed in tests that I've already posted earlier in this thread, the slowdown going from gwnum v25>26 occurred in PFGW but not LLR; I'll try Prime95 as soon as I get the chance.

PFGW 3.4.2 Released
 

You can d/l the latest release for Windows, MacIntel, and Linux from here: [url]http://sourceforge.net/projects/openpfgw/[/url]

The changes include:
[list][*]Updated to gwnum v26.4 to fix various issues, including one on 64-bit Linux and one with 64-bit builds on zero-padded two pass rational FFTs.[*]Addressed many compiler warnings when building with gcc.[*]Added carriage return after "GFN testing completed" message in pfgw.log.[*]Remove ability to change CPU setting via pfgw.ini. gwnum should be smarter than any user when specifying the CPU settings. This also addresses a crash that occurs on MacIntel during primality proofs as the SSE2 flag was turned off which told gwnum to execute non-SSE2 code, which isn't built into gwnum on MacIntel (Apple only supports Core 2 and later CPUs on MacIntel).[/list]

:tu:

Would it be possible to have "static" versions to overcome some problems? Please see: [url]http://tech.groups.yahoo.com/group/primeform/message/10725[/url]