Allowing for arbitrary growth of numbers using tomsfastmath?

[Ron Aaron]

Hello -

I'm currently using TFM in 8th (http://8th-dev.com/) as the "overflow" from regular integers.  It's fast, and works great with TomCrypt as well as an SSL library I'm using. 

Great product, thank you!

But some of my users want to work with integers which exceed the limits of TFM, which are set at compile-time.  If I could set the TFM limits at run-time, that would satisfy all my users' needs, since I could simply provide a way for them to say, "I want to have 10000 digits available".

Is there a way to accomplish this?

The alternative would be to switch to LTM instead, but then anything using big-math would be slower, and the memory usage would be more erratic.

Thanks for any help!