9 Apr
2012
9 Apr
'12
9:50 p.m.
See previous long e-mail. <snip>
I experimented with FFTs.
<snip>
My program crashed for a million digit square-root calculation.
Was stack overflow, as expected. * 10^6 digit10, naive FFT, base-10: time =3.0s * 10^6 digit10, MPFR: time = 0.23sLot's of information here. But in short, big digits require allocator, as in your other back-end classes. Duh! Best regards, Chris.