The list is for contributors to OpenPFGW to discuss their ideas, notify other developers of updates or difficulties, and to generally coordinate the development effort.
... On the contrary, it cripples b^n+c, making it 3 times slower than b^n-c. In neither case did I find any error; ... David (after 2500 tests on each form,
... I found the problem. It only affects b^n-c forms. I won't release a patched version yet in case you (or someone else) discovers other problems. This is
Why does a^b+c not use special modular reduction? $ pfgw -V -N -q"10^10000+137" PFGW Version 20090928.x86_Dev (Beta 'caveat utilitor') [GWNUM 25.13] Generic