PFGW 4.0.4 (with gwnum v30.10) Released

[rogue]

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.

I have successfully rebuilt the Linux 64-bit PFGW with a "generic x86" version of GMP. This problem (and a related one discovered by Puzzle-Peter) appears to be gone. I hope to release the Linux version soon.

[rogue]

With Steven Harvey's help, the new build of PFGW 3.4.5 for Linux is available from sourceforge. This fixes the SIGILL issues that I am aware of.

[rogue]

I have released PFGW 3.4.8. Here is a list of changes from 3.4.6:

1)  Upgraded to gwnum v26.6.
2)  Fixed bug when using SET in script files.  It was tokening incorrectly.
3)  Try generic modular reduction if setup for special modular reduction fails.

You can get the latest version from here.

--Mark

[Xentar]

Originally Posted by rogue

1)  Upgraded to gwnum v26.6.

Anyone knows, how much faster this version is? Thanks.

[rogue]

Originally Posted by Xentar

Anyone knows, how much faster this version is? Thanks.

I believe that it supports additional FFT sizes for some architectures, plus a few bug fixes.

[Prime95]

Originally Posted by Xentar

Anyone knows, how much faster this version is?

No faster. Some bug fixes -- especially for little used architectures.

[rogue]

The only fix is to address a bug when using POWMOD in scripts.

You can get the latest version from here.

--Mark

[Xentar]

Small bug in Win64PFGW.exe, version 3.4.9:
When I try to use an input file pfgw.log, the application just closes without any error message.
When I use the command line software, I get the correct error message that this file name is not allowed.

[rogue]

Here is a list of changes:

• Added a NEXTPRIME() function for scripts. It will return the next prime after the given argument. This is guaranteed to return all primes below 2^64.
• Replaced primegen siever with my own. The primegen code misses some primes (notable primes that end with the digits "99999"). It was also limited to 32 bits. The new sieve can go up to 64 bits, but starts with a limit of 4e9. It will auto-increment the upper limit by 100 until it reaches 2^64. Outside of the small cost the occurs when the limit is auto-bumped, there is no longer a penalty for trial factoring above 2^31.
• Upped the limit for trivial factoring to 40 bits, i.e. input values 40 bits in size or less will be trivially factored. This will reduce the number of "composite" PRPs, numbers with are output as PRP by pfgw, but which actually have small factors. This typically affects small base 3 numbers.
• Note that some of these changes will have an impact on 32-bit machines, but the impact should be fairly small.
• With these changes, the pfglue an prmsieve are obsolete.
• Fixed a crash that was introduced into the GUI version in 3.4.10.

You can d/l from https://sourceforge.net/projects/openpfgw/.

[rogue]

Apparently I broke the factorial function in 3.5.0. I'll try to fix it ASAP.

[rogue]

I fixed a few bugs from 3.5.0 (ones that I introduced):

• Fixed a bug in trivial factoring as primeserver would return 3 when calling the new ByIndex() function with a 1.
• Fixed a bug with using ABC files and primorials as primeserver didn't re-initialize after processing the first line.
• Fixed a bug with the p() and nextprime() functions when used in scripts.

I strongly recommend that you get 3.5.1 (which is still a beta BTW) in case you are trying to use 3.5.0.

Right now only the Windows build is available. I hope to get the Mac and Linux ones up later today.