PFGW latest well-tested version

[Xentar]

another round off error, Version 3.2.3:

-----------------------------------------------------------------------
Error occuring in PFGW at Sun Dec 27 09:41:59 2009
Expr = 19464*19^31895+1
Detected in MAXERR>0.45 (round off check) in prp_using_gwnum
Iteration: 107198/135501 ERROR: ROUND OFF 0.5>0.45

(Test aborted, try again using the -a1 switch)

[rogue]

I thought I posted this earlier, but must not have hit submit.

I have release PFGW 3.2.5. Here is a list of changes.

• Fixed b^n+1 check so that it uses fast modular reduction
• Some prime numbers silently fail (i.e. no errors detected) when testing for primality. To address this, PFGW will tell gwnum to use an irrational FFT for all tests.
• Added new options for PFGW scripts. It can now do primality tests. It will also differentiate between numbers that are PRP and numbers that are prime based upon those tests. Please read scriptfileformat.txt for more information on how to use these new features. Note that old PFGW scripts might not work correctly with this version of PFGW.
• PFGW scripts can now use forms (input as strings) for the PRP test. Previous releases handled decimal expansions only. With this release PFGW scripts can take advantage of fast modular reduction.

This release has significant changes for people using PFGW scripts (such as Conjectures 'R Us). Since scripts can now pass an expression (via a string) to the PRP comment, PFGW will output that expression, not its decimal expansion.

I have not modified the scriptify perl script or the documentation for it. I will leave those items to someone who knows perl.

Here are the links:
PFGW 3.2.5 for Windows
PFGW 3.2.5 for Linux
PFGW 3.2.5 for MacIntel

[mdettweiler]

Originally Posted by rogue

I thought I posted this earlier, but must not have hit submit.

Hmm, I saw it too. I even downloaded the latest version as soon as it showed up, so I'm sure it wasn't a fluke. Perhaps it was in a different thread?

Edit: Ah, right, that was it. There's two "PFGW 3.2.0 released" threads: one in the Software forum and one here. You previously posted it in the Software forum.

[Xentar]

Originally Posted by rogue

Some prime numbers silently fail (i.e. no errors detected) when testing for primality. To address this, PFGW will tell gwnum to use an irrational FFT for all tests.

I am not sure, if I understand this correctly. But how many tests are affected here? Do we have to recheck some / all tests?

Edit:
Ahhhhhhhhhh, help, what's happening here? Just upgraded from 3.2.3 to 3.2.5 and the new version does not accept my checkpoint in the ini file.. ?

***WARNING! file t16_b19.prp line 779870 does not match what is expected.
Expecting: 241036*19^32634+1
File contained: 253816 32634
Starting over at the beginning of the file

and then it starts from the beginning (line 1)

86634 15 trivially factors as: 3*5*31^2*601
254754 15 trivially factors as: 3*5*7*331*733
377694 15 trivially factors as: 3*5*37*68053
484654 15 trivially factors as: 5*61*131*1213
555174 15 trivially factors as: 3*5*127*151*193
746524 15 trivially factors as: 5*14930483

The input file I am using looks like

252188461193:P:1:19:257
86634 15
254754 15
377694 15
484654 15
555174 15
746524 15
299626 16

worked fine with the previous version..

Edit 2: I think the new version "forgot" how to convert this k n pair to the right format? Has it something to do with the script changes?

[rogue]

Originally Posted by Xentar

I am not sure, if I understand this correctly. But how many tests are affected here? Do we have to recheck some / all tests?

Edit:
Ahhhhhhhhhh, help, what's happening here? Just upgraded from 3.2.3 to 3.2.5 and the new version does not accept my checkpoint in the ini file.. ?
and then it starts from the beginning (line 1)

I was not aware of this, but apparently the save format is different because of the irrational FFT. I suggest deleting the pfr file before starting PFGW when upgrading. In other words, this will only affect a saved test.

Originally Posted by Xentar

worked fine with the previous version..

Edit 2: I think the new version "forgot" how to convert this k n pair to the right format? Has it something to do with the script changes?

I do not know what is causing this issue with NewPGen files, but it is most likely something I screwed up with the changes for script handling. I'll look at it tomorrow.

[rogue]

There was a bug in 3.2.5 with NewPGen file handling. It has been fixed in 3.2.6, which you can get here:

http://openpfgw.svn.sourceforge.net/...5.zip?view=log

I will post Mac/Linux updates only if users have NewPGen files they needs to process on those platforms.

[henryzz]

Originally Posted by rogue

There was a bug in 3.2.5 with NewPGen file handling. It has been fixed in 3.2.6, which you can get here:

http://openpfgw.svn.sourceforge.net/...5.zip?view=log

I will post Mac/Linux updates only if users have NewPGen files they needs to process on those platforms.

in theory people should be able to change to ABC file types for most things i would have thought

[Cybertronic]

Originally Posted by rogue

There was a bug in 3.2.5 with NewPGen file handling. It has been fixed in 3.2.6, which you can get here:

http://openpfgw.svn.sourceforge.net/...5.zip?view=log

I will post Mac/Linux updates only if users have NewPGen files they needs to process on those platforms.

Hello, can anynoe send me the windows version to nluhn at yahoo dot de ?
Thanks.

With this page, I have ever trouble.

[Xentar]

Originally Posted by henryzz

in theory people should be able to change to ABC file types for most things i would have thought

Are there any advantages, when I use this format? (Except the last little bug )

[Mini-Geek]

Originally Posted by Xentar

Are there any advantages, when I use this format?

With the ABC format you can use PFGW's special comment:

A "new" addition to the comment syntax in the ABC/ABC2/ABCD/PrZ format
specification is:   // {number_primes,$var,#} or // {number_comps,$var,#}
These will stop processing "matching" $var when $var is a prime.

e.g. "ABC $a*2^$b+1 // {number_primes,$a,1}" will stop searching the given k ($a) when 1 prime is found for it.

It's also far easier for a human to read that "ABC $a*2^$b-1" means k*2^n-1 than that "30000000000000:M:1:2:258" does, although the latter form does have the benefit of including the sieve depth.

No further benefits/drawbacks come to mind for either format...

Originally Posted by Cybertronic

Hello, can anynoe send me the windows version to nluhn at yahoo dot de ?
Thanks.

With this page, I have ever trouble.

Sending...

[rogue]

Originally Posted by Xentar

Are there any advantages, when I use this format? (Except the last little bug )

I wonder who still uses NewPGen for sieving. Most forms can be handled by one of Geoff Reynold's sieving programs because they are faster.