PFGW 4.0.4 (with gwnum v30.10) Released - Page 6

rogue · 2010-11-26, 14:10

Quote:

Originally Posted by Batalov

Was this ever requested before? Could I possibly help? (with a disclaimer that familiarizing with the code could take much more time than "just doing it" for an experienced developer, i.e. Mark

)

No. Yes.

You are welcome to try. You can d/l the source (via svn) for free, but I would need to authorize you to make any updates.

Unfortunately any changes to the primality proving side as easier said than done. If you start digging into the code, you will understand what I mean. PFGW often takes a rather circuitous route to get between points A and B and it does it using a design pattern that I am not familiar with.

Batalov · 2010-11-26, 20:11

I'll try to grok it. It could "take the term of my natural life" though. :-)

rogue · 2010-11-27, 00:12

There has been a request on one of the Yahoo groups (the openpfgw group, IIRC) to introduce some simple P-1/P+1/Rho factoring into PFGW. If you are interested in contributing to PFGW, that would be a more useful place to apply any programming time.

Outside of that I have two strong desires for PFGW's future. The first is to re-design the code to use more common design patterns. That would ultimately make it easier to make enhancements to PFGW, enhancements that include newer/faster primality tests. The second is to rewrite the U/I using something like gtk. This would help me to eliminate the requirements to use Visual Studio to build the software and it would allow me to provide a U/I to non-Windows users.

A weak desire is to make it easier to replace gwnum with another FFT. The only reason for that is to port PFGW to other CPUs (such as CUDA). The problem is that I would need to write a number of APIs for those FFT libraries because PFGW would need them. Writing those APIs is not trivial.

Shaopu Lin · 2011-01-19, 16:35

When pfgw 3.4.4. read a NewPGen format sieveing file on OpenSUSE 11.3, it crashed.

Code:

math@linux-39b2:~/桌面/other/test> pfgw -t 10000.txt
PFGW Version 3.4.4.64BIT.20101104.x86_Dev [GWNUM 26.4]

NewPGen file: k*2^10000+1 

***WARNING! file 10000.txt may have already been fully processed.

Primality testing 127*2^10000+1 [N-1, Brillhart-Lehmer-Selfridge]

Signal SIGILL caught
math@linux-39b2:~/桌面/other/test>

rogue · 2011-01-19, 17:44

Quote:

Originally Posted by Shaopu Lin

When pfgw 3.4.4. read a NewPGen format sieveing file on OpenSUSE 11.3, it crashed.

Code:

math@linux-39b2:~/桌面/other/test> pfgw -t 10000.txt
PFGW Version 3.4.4.64BIT.20101104.x86_Dev [GWNUM 26.4]

NewPGen file: k*2^10000+1 

***WARNING! file 10000.txt may have already been fully processed.

Primality testing 127*2^10000+1 [N-1, Brillhart-Lehmer-Selfridge]

Signal SIGILL caught
math@linux-39b2:~/桌面/other/test>

It works on Windows. I'll try it on a *nix system tonight.

Harvey563 · 2011-01-20, 03:29

on an Atom running ubuntu 10.4, I get

steven@steven-eee:~/op342/test$ ./pfgw 10000-1.txt -l10000-1out.txt
PFGW Version 3.4.4.32BIT.20101104.x86_Dev [GWNUM 26.4]

Output logging to file 10000-1out.txt
NewPGen file: k*2^10000+1
127*2^10000+1 is composite: RES64: [F831E49FDA74FDB3] (1.3944s+0.0003s)
141*2^10000+1 is composite: RES64: [E5CDBE3B23D2E417] (1.2715s+0.0009s)
217*2^10000+1 is composite: RES64: [0187EDB548EA035D] (1.2599s+0.0007s)
265*2^10000+1 is composite: RES64: [E0784ADBE50718C7] (1.2446s+0.0004s)
343*2^10000+1 is composite: RES64: [B53BF83C47E20882] (1.2591s+0.0006s)
375*2^10000+1 is composite: RES64: [84F83BC014FEE987] (1.2593s+0.0004s)
393*2^10000+1 is composite: RES64: [534BC93F2FB9239B] (1.2550s+0.0004s)
477*2^10000+1 is composite: RES64: [6A1A303314623288] (1.2476s+0.0007s)
541*2^10000+1 is composite: RES64: [85336ADE71F31EDA] (1.3223s+0.0006s)
^C
Ctrl-C detected, shutting down the program.
steven@steven-eee:~/op342/test$ ./pfgw 10000-1.txt -l10000-1out.txt -V
PFGW Version 3.4.4.32BIT.20101104.x86_Dev [GWNUM 26.4]

Output logging to file 10000-1out.txt
NewPGen file: k*2^10000+1
Special modular reduction using all-complex FFT length 768 on 127*2^10000+1
127*2^10000+1 is composite: RES64: [F831E49FDA74FDB3] (1.3388s+0.0003s)
Special modular reduction using all-complex FFT length 768 on 141*2^10000+1
141*2^10000+1 is composite: RES64: [E5CDBE3B23D2E417] (1.3815s+0.0004s)
Special modular reduction using all-complex FFT length 768 on 217*2^10000+1
217*2^10000+1 is composite: RES64: [0187EDB548EA035D] (1.2886s+0.0005s)
Special modular reduction using all-complex FFT length 768 on 265*2^10000+1
265*2^10000+1 is composite: RES64: [E0784ADBE50718C7] (1.2683s+0.0007s)
Special modular reduction using all-complex FFT length 768 on 343*2^10000+1
343*2^10000+1 is composite: RES64: [B53BF83C47E20882] (1.2694s+0.0006s)
Special modular reduction using all-complex FFT length 768 on 375*2^10000+1
375*2^10000+1 is composite: RES64: [84F83BC014FEE987] (1.2608s+0.0007s)
Special modular reduction using all-complex FFT length 768 on 393*2^10000+1
393*2^10000+1 is composite: RES64: [534BC93F2FB9239B] (1.2940s+0.0004s)
Special modular reduction using all-complex FFT length 768 on 477*2^10000+1
477*2^10000+1 is composite: RES64: [6A1A303314623288] (1.3039s+0.0004s)
Special modular reduction using all-complex FFT length 768 on 541*2^10000+1
541*2^10000+1 is composite: RES64: [85336ADE71F31EDA] (1.2566s+0.0007s)
Special modular reduction using all-complex FFT length 768 on 583*2^10000+1
583*2^10000+1 is composite: RES64: [2852A86B4389567E] (1.2928s+0.0004s)
Special modular reduction using all-complex FFT length 768 on 607*2^10000+1
607*2^10000+1 is composite: RES64: [A95AE0579513952F] (1.3135s+0.0004s)
Special modular reduction using all-complex FFT length 768 on 613*2^10000+1
613*2^10000+1 is composite: RES64: [69102F36CB862BD1] (1.2713s+0.0004s)
Special modular reduction using all-complex FFT length 768 on 715*2^10000+1
^CP: 715*2^10000+1 1/10009
Ctrl-C detected, shutting down the program.
steven@steven-eee:~/op342/test$ ^C
steven@steven-eee:~/op342/test$ ./pfgw -t 10000-1.txt -l10000-1out.txt -V
PFGW Version 3.4.4.32BIT.20101104.x86_Dev [GWNUM 26.4]

Output logging to file 10000-1out.txt
NewPGen file: k*2^10000+1
Resuming input file 10000-1.txt at line 14

Primality testing 715*2^10000+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 768 on 715*2^10000+1
715*2^10000+1 is composite (1.4255s+0.0003s)
Primality testing 721*2^10000+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 768 on 721*2^10000+1
721*2^10000+1 is composite (1.3449s+0.0004s)
Primality testing 733*2^10000+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 768 on 733*2^10000+1
733*2^10000+1 is composite (1.3633s+0.0007s)
Primality testing 753*2^10000+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 11
Special modular reduction using all-complex FFT length 768 on 753*2^10000+1
^C1: 753*2^10000+1 2500/10011 mro=0.0009765625
Ctrl-C detected, shutting down the program.
steven@steven-eee:~/op342/test$

So I opine, it's not a bug.

Harvey563 · 2011-01-20, 03:45

After I posted the previous, I realized that the "bug" was in the 64 bit version.

Here's my 64 bit result.

steven@steven-eee:~$ telnet XXXXXXXXX
Trying 24.121.XXX.44...
Connected to harvey563.xxx.xxx.
Escape character is '^]'.
Ubuntu 10.04.1 LTS

steven-desktop login: steven
Password:
Last login: Mon Dec 27 12:13:43 MST 2010 from XXXXXXXXX
Linux steven-desktop 2.6.32-27-generic #49-Ubuntu SMP Thu Dec 2 00:51:09 UTC 2010 x86_64 GNU/Linux
Ubuntu 10.04.1 LTS

steven@steven-desktop:~/op342/test$ ./spfgw -t -q"127*2^100000+1"
PFGW Version 3.4.4.64BIT.20101104.x86_Dev [GWNUM 26.4]

Primality testing 127*2^100000+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
127*2^100000+1 is composite (14.0850s+0.0001s)

steven@steven-desktop:~/op342/test$ ./spfgw -t -q"127*2^100000+1" -V
PFGW Version 3.4.4.64BIT.20101104.x86_Dev [GWNUM 26.4]

Primality testing 127*2^100000+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex FFT length 6K on 127*2^100000+1
127*2^100000+1 is composite (13.6814s+0.0001s)

QED

rogue · 2011-02-15, 23:20

I have finished up changes for PFGW 3.4.5. Here is a list of changes:

1) Updated to gwnum v26.5
2) Fixed memory leaks in 64-bit builds
3) Fixed other known memory leaks
4) Fixed assertion failure in Win64 builds
5) Fix ^C on *nix so that it writes a checkpoint before shutting down.
6) Disallow use of "pfgw.log" and "pfgw.ini" as input files.

I'm not certain that all of the versions (Windows, MacIntel, and Linux) uploaded correctly, so if you run into a problem, please let me know. You can get the latest version from here.

--Mark

Syd · 2011-02-16, 10:23

There seems to be a problem in the linux-64bit version when using the -e switch.

#./pfgw64 -t -s0 -e100000 -q"(10^18533-7)/3"
PFGW Version 3.4.5.64BIT.20110215.x86_Dev [GWNUM 26.5]

Primality testing (10^18533-7)/3 [N-1, Brillhart-Lehmer-Selfridge]

Signal SIGILL caught

The 32bit-version works fine, same if I leave out -e100000.

rogue · 2011-02-16, 13:57

Quote:

Originally Posted by Syd

There seems to be a problem in the linux-64bit version when using the -e switch.

#./pfgw64 -t -s0 -e100000 -q"(10^18533-7)/3"
PFGW Version 3.4.5.64BIT.20110215.x86_Dev [GWNUM 26.5]

Primality testing (10^18533-7)/3 [N-1, Brillhart-Lehmer-Selfridge]

Signal SIGILL caught

The 32bit-version works fine, same if I leave out -e100000.

This is specific to Linux. I suspect that Steven built GMP specific to a CPU, such as a Core 2 rather than for a generic x86 architecture.

rogue · 2011-03-08, 13:36

I have finished up changes for PFGW 3.4.6. Here is a list of changes:

Code:

1)  Use gwnum for POWMOD script function when numbers are larger than 650 bits.
2)  Added -C switch to give better control over output for the console version.
     -C takes a single argument:
        quiet - the least amount of output, only gives status updates
        normal - output status updates and newlines after PRPs and primes (default)
        GFFactors - output factors when using -g switch
        verbose - output result of all tests and output factors found
     The default behavior of the console version is -Cnormal, which is same as the
     default behavior of WinPFGW.  Use -Cverbose to get the previous behavior of the 
     console version.
3)  Due to addition of -C switch, pfgw will now output test results for all lines
     from simple input files with two exceptions.  It will not override -Cverbose
     and it will not output factors.

You can get the latest version from here.

--Mark

2011-01-20, 03:29	#61
Harvey563 Apr 2004 11·17 Posts	my results on an Atom running ubuntu 10.4, I get steven@steven-eee:~/op342/test$ ./pfgw 10000-1.txt -l10000-1out.txt PFGW Version 3.4.4.32BIT.20101104.x86_Dev [GWNUM 26.4] Output logging to file 10000-1out.txt NewPGen file: k2^10000+1 1272^10000+1 is composite: RES64: [F831E49FDA74FDB3] (1.3944s+0.0003s) 1412^10000+1 is composite: RES64: [E5CDBE3B23D2E417] (1.2715s+0.0009s) 2172^10000+1 is composite: RES64: [0187EDB548EA035D] (1.2599s+0.0007s) 2652^10000+1 is composite: RES64: [E0784ADBE50718C7] (1.2446s+0.0004s) 3432^10000+1 is composite: RES64: [B53BF83C47E20882] (1.2591s+0.0006s) 3752^10000+1 is composite: RES64: [84F83BC014FEE987] (1.2593s+0.0004s) 3932^10000+1 is composite: RES64: [534BC93F2FB9239B] (1.2550s+0.0004s) 4772^10000+1 is composite: RES64: [6A1A303314623288] (1.2476s+0.0007s) 5412^10000+1 is composite: RES64: [85336ADE71F31EDA] (1.3223s+0.0006s) ^C Ctrl-C detected, shutting down the program. steven@steven-eee:~/op342/test$ ./pfgw 10000-1.txt -l10000-1out.txt -V PFGW Version 3.4.4.32BIT.20101104.x86_Dev [GWNUM 26.4] Output logging to file 10000-1out.txt NewPGen file: k2^10000+1 Special modular reduction using all-complex FFT length 768 on 1272^10000+1 1272^10000+1 is composite: RES64: [F831E49FDA74FDB3] (1.3388s+0.0003s) Special modular reduction using all-complex FFT length 768 on 1412^10000+1 1412^10000+1 is composite: RES64: [E5CDBE3B23D2E417] (1.3815s+0.0004s) Special modular reduction using all-complex FFT length 768 on 2172^10000+1 2172^10000+1 is composite: RES64: [0187EDB548EA035D] (1.2886s+0.0005s) Special modular reduction using all-complex FFT length 768 on 2652^10000+1 2652^10000+1 is composite: RES64: [E0784ADBE50718C7] (1.2683s+0.0007s) Special modular reduction using all-complex FFT length 768 on 3432^10000+1 3432^10000+1 is composite: RES64: [B53BF83C47E20882] (1.2694s+0.0006s) Special modular reduction using all-complex FFT length 768 on 3752^10000+1 3752^10000+1 is composite: RES64: [84F83BC014FEE987] (1.2608s+0.0007s) Special modular reduction using all-complex FFT length 768 on 3932^10000+1 3932^10000+1 is composite: RES64: [534BC93F2FB9239B] (1.2940s+0.0004s) Special modular reduction using all-complex FFT length 768 on 4772^10000+1 4772^10000+1 is composite: RES64: [6A1A303314623288] (1.3039s+0.0004s) Special modular reduction using all-complex FFT length 768 on 5412^10000+1 5412^10000+1 is composite: RES64: [85336ADE71F31EDA] (1.2566s+0.0007s) Special modular reduction using all-complex FFT length 768 on 5832^10000+1 5832^10000+1 is composite: RES64: [2852A86B4389567E] (1.2928s+0.0004s) Special modular reduction using all-complex FFT length 768 on 6072^10000+1 6072^10000+1 is composite: RES64: [A95AE0579513952F] (1.3135s+0.0004s) Special modular reduction using all-complex FFT length 768 on 6132^10000+1 6132^10000+1 is composite: RES64: [69102F36CB862BD1] (1.2713s+0.0004s) Special modular reduction using all-complex FFT length 768 on 7152^10000+1 ^CP: 7152^10000+1 1/10009 Ctrl-C detected, shutting down the program. steven@steven-eee:~/op342/test$ ^C steven@steven-eee:~/op342/test$ ./pfgw -t 10000-1.txt -l10000-1out.txt -V PFGW Version 3.4.4.32BIT.20101104.x86_Dev [GWNUM 26.4] Output logging to file 10000-1out.txt NewPGen file: k2^10000+1 Resuming input file 10000-1.txt at line 14 Primality testing 7152^10000+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 768 on 7152^10000+1 7152^10000+1 is composite (1.4255s+0.0003s) Primality testing 7212^10000+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 768 on 7212^10000+1 7212^10000+1 is composite (1.3449s+0.0004s) Primality testing 7332^10000+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 768 on 7332^10000+1 7332^10000+1 is composite (1.3633s+0.0007s) Primality testing 7532^10000+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 11 Special modular reduction using all-complex FFT length 768 on 7532^10000+1 ^C1: 7532^10000+1 2500/10011 mro=0.0009765625 Ctrl-C detected, shutting down the program. steven@steven-eee:~/op342/test$ So I opine, it's not a bug. Last fiddled with by Harvey563 on 2011-01-20 at 03:33 Reason: add -t switch

2011-01-20, 03:45	#62
Harvey563 Apr 2004 273₈ Posts	64bit After I posted the previous, I realized that the "bug" was in the 64 bit version. Here's my 64 bit result. steven@steven-eee:~$ telnet XXXXXXXXX Trying 24.121.XXX.44... Connected to harvey563.xxx.xxx. Escape character is '^]'. Ubuntu 10.04.1 LTS steven-desktop login: steven Password: Last login: Mon Dec 27 12:13:43 MST 2010 from XXXXXXXXX Linux steven-desktop 2.6.32-27-generic #49-Ubuntu SMP Thu Dec 2 00:51:09 UTC 2010 x86_64 GNU/Linux Ubuntu 10.04.1 LTS steven@steven-desktop:~/op342/test$ ./spfgw -t -q"1272^100000+1" PFGW Version 3.4.4.64BIT.20101104.x86_Dev [GWNUM 26.4] Primality testing 1272^100000+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 1272^100000+1 is composite (14.0850s+0.0001s) steven@steven-desktop:~/op342/test$ ./spfgw -t -q"1272^100000+1" -V PFGW Version 3.4.4.64BIT.20101104.x86_Dev [GWNUM 26.4] Primality testing 1272^100000+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 6K on 1272^100000+1 127*2^100000+1 is composite (13.6814s+0.0001s) QED

2011-02-15, 23:20	#63
rogue "Mark" Apr 2003 Between here and the 3×2,447 Posts	PFGW 3.4.5 has been released I have finished up changes for PFGW 3.4.5. Here is a list of changes: 1) Updated to gwnum v26.5 2) Fixed memory leaks in 64-bit builds 3) Fixed other known memory leaks 4) Fixed assertion failure in Win64 builds 5) Fix ^C on *nix so that it writes a checkpoint before shutting down. 6) Disallow use of "pfgw.log" and "pfgw.ini" as input files. I'm not certain that all of the versions (Windows, MacIntel, and Linux) uploaded correctly, so if you run into a problem, please let me know. You can get the latest version from here. --Mark

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
A possible bug in LLR/PFGW while using GWNUM (no bug in P95)	Batalov	Software	77	2015-04-14 09:01
PFGW 3.2.0 has been Released	rogue	Software	94	2010-09-14 21:39
PFGW 3.2.3 has been Released	rogue	Software	10	2009-10-28 07:07
PFGW 3.2.1 has been released	rogue	Software	5	2009-08-10 01:43
PFGW 3.1.0 has been Released	rogue	Software	25	2009-07-21 18:13

2010-11-26, 20:11	#57
Batalov "Serge" Mar 2008 San Diego, Calif. 3²×7×163 Posts	I'll try to grok it. It could "take the term of my natural life" though. :-)

2010-11-27, 00:12	#58
rogue "Mark" Apr 2003 Between here and the 1CAD₁₆ Posts	There has been a request on one of the Yahoo groups (the openpfgw group, IIRC) to introduce some simple P-1/P+1/Rho factoring into PFGW. If you are interested in contributing to PFGW, that would be a more useful place to apply any programming time. Outside of that I have two strong desires for PFGW's future. The first is to re-design the code to use more common design patterns. That would ultimately make it easier to make enhancements to PFGW, enhancements that include newer/faster primality tests. The second is to rewrite the U/I using something like gtk. This would help me to eliminate the requirements to use Visual Studio to build the software and it would allow me to provide a U/I to non-Windows users. A weak desire is to make it easier to replace gwnum with another FFT. The only reason for that is to port PFGW to other CPUs (such as CUDA). The problem is that I would need to write a number of APIs for those FFT libraries because PFGW would need them. Writing those APIs is not trivial.

2011-02-16, 10:23	#64
Syd Sep 2008 Krefeld, Germany 230₁₀ Posts	There seems to be a problem in the linux-64bit version when using the -e switch. #./pfgw64 -t -s0 -e100000 -q"(10^18533-7)/3" PFGW Version 3.4.5.64BIT.20110215.x86_Dev [GWNUM 26.5] Primality testing (10^18533-7)/3 [N-1, Brillhart-Lehmer-Selfridge] Signal SIGILL caught The 32bit-version works fine, same if I leave out -e100000.