PFGW 4.0.4 (with gwnum v30.10) Released

[storm5510]

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

It is OK to display this but when it causes a full abort then it is a different story.

[rogue]

Originally Posted by numberMX

When I go to the Sourceforge page and download `pfgw_mac_4.0.1.7z`, then extract and run it...

> ./pfgw64 -v
PFGW Version 3.8.1.64BIT.20160603.Mac_Dev [GWNUM 28.6]

...it downloads version 3.8.1, not 4.0.1. It seems like the 4.0.1 download for Mac does not actually have version 4.0.1 in it.

I forgot to commit the source file with the version number before I did a build. I'm fairly certain it is 4.0.1. I will rebuild with the latest gwnum and update the version as soon as I can.

[rogue]

Originally Posted by storm5510

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

It is OK to display this but when it causes a full abort then it is a different story.

I do not know what you mean by "full abort".

[storm5510]

Originally Posted by rogue

I do not know what you mean by "full abort".

A full stop and exit to the command prompt.

The error was of my own doing. I didn't have the "$" in the input terms.

[a1call]

Hello,

* Is there a way to set a desired base for N-1 deterministic tests?

I went through the documentation and it only specifies -b switch for PRP tests.
I would like to use the same feature for N-1 deterministic tests so that I can have different instances for different bases run simultaneously.
Is there a way to do that?

Thanks in advance.

[rogue]

Originally Posted by a1call

Hello,

* Is there a way to set a desired base for N-1 deterministic tests?

I went through the documentation and it only specifies -b switch for PRP tests.
I would like to use the same feature for N-1 deterministic tests so that I can have different instances for different bases run simultaneously.
Is there a way to do that?

Thanks in advance.

Not at this time. What is the concern? If n-1 says "not prime", then another base isn't going to say it is. If n-1 says "is prime", then the possibility that another base yields "not prime" could only happen if there is a bug.

You might be able to use llr to prove primality. It uses a different algorithm than pfgw.

[a1call]

My understanding from N-1 Deterministic testing is that we test a found PRP in different bases until we find a base which satisfices:
PRP | base^(PRP-1)-1
&&
PRP !| base^((PRP-1)/q)-1
for all the prime factors q of PRP-1

Blindfolded Trial and error procedure of going through different bases in random is time consuming and it could be a time saver if we could have different instances for different bases run simultaneously for the same PRP.

Thank you for the reply.

[paulunderwood]

Originally Posted by a1call

My understanding from N-1 Deterministic testing is that we test a found PRP in different bases until we find a base which satisfices:
PRP | base^(PRP-1)-1
&&
PRP !| base^((PRP-1)/q)-1
for all the prime factors q of PRP-1

Blindfolded Trial and error procedure of going through different bases in random is time consuming and it could be a time saver if we could have different instances for different bases run simultaneously for the same PRP.

Thank you for the reply.

You state https://en.wikipedia.org/wiki/Lucas_primality_test

PFGW uses the BLS "improvement": https://primes.utm.edu/prove/prove3.html

[a1call]

Yes, I am aware that PFGW uses more advanced algorithms (which I don’t understand), but I am under the impression that the software still attempts some hit-and-miss on different bases to satisfy some conditions. If so, it would still be a time saver if we could run different instances processing different bases, simultaneously.
Currently I have been running a -t test for quite a few days on a slow computer.
The console states that it has tried N-1 for bases 11, 17, 23, and N+1 using discriminat 31.
Thank you for the reply.
ETA I stand corrected about referring to Lucas test s as N-1 test.

[Citrix]

Wanted to report a bug.

pfgw64.exe -q70368727400449 -f{ 2116,+-} -l -b11
PFGW Version 3.7.7.64BIT.20130722.Win_Dev [GWNUM 27.11]

Output logging to file pfgw.out
Sieve re-allocated with a limit of 657666906400000.
70368727400449 factors prime!: 70368727400449

70368727400449=8388607*8388607
It does not factor when there is a space after "f{ "

[S485122]

Originally Posted by Citrix

Wanted to report a bug.
...
It does not factor when there is a space after "f{ "

Don't ask for to lax parsing rules. After a time the program will not need you any more to do what your supposed to ask it to do. Spaces are important most of the time. And you should have written :

It does not factor when there is a space after "f{"

(you put a space after the curly brace :;-)