Re: PARI/GP wasm64 64-bit version

"Ruud H.G. van Tol" <[email protected]> Fri, 23 Jan 2026 13:00:25 +0100
Newsgroups gmane.comp.mathematics.pari.user
Message-ID <[email protected]>
On 2026-01-23 11:58, Bill Allombert wrote:
 > I have made an experimental wasm64 build of PARI/GP available:
 > <https://pari.math.u-bordeaux.fr/gpexpwasm64.html>
 > This is nearly twice faster as the 32bit version.
 >
 > I tested firefox 140 and chromium 144.
 > Please tell me if this is work in your browser.

For me it works:

Brave 1.86.142 (Official Build) (arm64)
Chromium: 144.0.7559.97

? default(timer)
%11 = 1

? prime(2^31)
time = 7,540 ms.
%12 = 50685770167

? prime(2^32)
time = 15,390 ms.
%13 = 104484802057

? prime(2^30)
time = 3,678 ms.
%14 = 24563311309

? prime(2^29)
time = 1,780 ms.
%15 = 11891268401

? prime(2^28)
time = 869 ms.
%16 = 5750079047

? prime(2^32)
time = 15,346 ms.
%17 = 104484802057

- - - - - - - - - - - - -

On the 32-bit dev-version page:

? prime(2^31)
   ***   at top-level: prime(2^31)
   ***                       ^-----
   ***   overflow in t_INT-->long assignment.

? prime(2^25)
time = 572 ms.
%4 = 645155197

? prime(2^26)
time = 715 ms.
%5 = 1339484197

? prime(2^27)
time = 1,477 ms.
%6 = 2777105129

? prime(2^28) times out

-- Ruud