Bill Allombert on Fri, 15 Mar 2024 11:56:31 +0100


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

Re: New primelimit-process? (apparently much Time-consuming)


On Fri, Mar 15, 2024 at 11:14:03AM +0100, Gottfried Helms wrote:
> Dear community -
> 
>  I just tried the gp2.16.2 (64 bit) (developers) version and
>  was surprised about a very long loading time of the system.
> 
> --------------------------------------------------------------
> This took about 5 secs to load: (using gp 2.16.2):
> ==============================================================
> GPRC Done.
>   ***   Warning: increasing stack size to 16000000.
>   ***   Warning: increasing stack size to 32000000.
>         GP/PARI CALCULATOR Version 2.16.2 (development 29293-74f0f882e6)
>           amd64 running mingw (x86-64/GMP-6.1.2 kernel) 64-bit version
>            compiled: Mar 13 2024, gcc version 10-win32 20210110 (GCC)
>                             threading engine: single
>                 (readline v8.0 disabled, extended help enabled)
> (...)
>      parisizemax = 1000000000, primelimit = 10000000


Indeed, we added a fast trial division code that need to compute the
product of all the primes less than primelimit at startup.

For primelimit = 2^20 it is fine, but for 10^7 it is a bit slow.
We will address that before the release.

Cheers,
Bill.