Charles Greathouse on Wed, 27 May 2015 17:17:18 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: Experimental 64-bit windows GP binary

The new version works for me on Windows 7 64-bit. For some operations it's a bit faster (~15%) but with others it's much faster. For example,


takes 3,552 ms on this version but 16,283 ms on the 32-bit version (4.5x).

Adapting your earlier program for computing the constant I asked about (thanks!), the 64-bit version takes 319 ms and 11,176 ms to find 10,000 and 100,000 digits respectively, while the 32-bit version requires 1,121 ms and 33,723 ms (3x).

Transcendental operations at high precision (100k digits) are also about 3x faster:


(similar to a computation I did some years back for was 7,525 ms vs. 21,470 ms.

Factorization is a reversal: while there's a small speedup in some cases, in most cases it takes half again as long.


takes 15,046 ms vs. 10,298 ms. Similarly


takes 24,394 ms vs. 15,647 ms. This seems to be entirely due to MPQS; the 64-bit version is faster at


than the 32-bit version: 618+10,262 ms vs. 592+15,278 ms.

Charles Greathouse
Case Western Reserve University

On Tue, May 26, 2015 at 4:57 PM, Bill Allombert <> wrote:
Dear PARI developers,

Following a contribution of Eric Driver, we have managed
to build an experimental 64-bit windows binary that pass all the tests.
It is available at:
It includes GNU GMP and readline support.
Please test! (and see how much it is faster than the 32-bit version).

I like to thanks Eric for starting this project and doing most of the work.

Hopefully, we will be able to generate daily 64-bit windows binaries in the

The code is available in the GIT branch bill-win64, but you also need
to apply Eric script: