Re: [Gcl-devel] Re: large primes

[Paul F. Dietz]

> Robert Boyer <address@hidden> writes:
>
>
> > According to one place on the web
> > (http://primes.utm.edu/primes/search.php?Number=100) the largest known
> > prime is:
> >
> >  (- (expt 2 25964951) 1)
> >
> > GCL can compute this (in a rather long 7 seconds), but then causes a
> > segmentation fault trying to print it.


There's been some work recently printing large bignums in SBCL.
The naive algorithm they had been using ran out of memory, so IIUC
they went to a divide-and-conquer algorithm.

        Paul