"GP in your browser" is quite powerful

[hermann@stamm-wilbrandt.de]

I tried before, but today realized that you somehow get a session(!).
Define a variable in one command, use it again in another.

I did want to compute number of digits of largest known prime =1 (mod 
4).
And that really worked with stable webassembly version!
https://pari.math.u-bordeaux.fr/gpwasm.html
But I had to press 5x Wait button to continue computation.
I was surprised because I did that not in a big Intel/AMD browser,
but in Chromium on 4GB RAM Raspberry Pi400 computer.
Correctly 11,887,192 digits get reported in 2nd window after 2nd 
command.

1st window:
  *** _^s: Warning: increasing stack size to 8000000.
  *** polcyclo: Warning: increasing stack size to 16000000.
  *** polcyclo: Warning: increasing stack size to 32000000.
  *** digits: Warning: increasing stack size to 8000000.
  *** digits: Warning: increasing stack size to 16000000.
  *** digits: Warning: increasing stack size to 32000000.
  *** digits: Warning: increasing stack size to 64000000.
  *** digits: Warning: increasing stack size to 128000000.
  *** digits: Warning: increasing stack size to 256000000.
  *** digits: Warning: increasing stack size to 512000000.

2nd window:
? p=polcyclo(3,-465859^1048576);
? #digits(p)

%2 = 11887192

3rd window:
#digits(p)


I tried on stable version as well, but that did run out of memory:
https://pari.math.u-bordeaux.fr/gp.html

1st window:
  *** _^s: Warning: increasing stack size to 8000000.
  *** polcyclo: Warning: increasing stack size to 16000000.
  *** polcyclo: Warning: increasing stack size to 32000000.
  *** digits: Warning: increasing stack size to 8000000.
  *** digits: Warning: increasing stack size to 16000000.
Aborted(OOM)

2nd window:
? p=polcyclo(3,-465859^1048576);
? #digits(p)

3rd window:
  #digits(p)


Regards,

Hermann.