Re: forprimestep 50000 times slower than needed

On Sun, Jan 07, 2024 at 10:51:55PM +0100, Loïc Grenié wrote:
>      On a related note, I observe that
> ? my(n=8);forprimestep(p=nextprime(10^8),10^8+10^n,10^n,print(p))
> 100000007
> ? my(n=9);forprimestep(p=nextprime(10^8),10^8+10^n,10^n,print(p))
> ?
> 
>     while I would have expected both lines to print 100000007.

Oups — I did not recheck this — and I was hit by this bug on “the
final pre-production step”!!!  Fortunately, I had a (vague) memory of
you reporting this, which helped to reduce debugging to ∼1 hour…

  Reported:  https://pari.math.u-bordeaux.fr/cgi-bin/bugreport.cgi?bug=2531

A lot of thanks,
Ilya