• Advertisement

Archived

This topic is now archived and is closed to further replies.

Good performance on a infinite number system?

This topic is 5082 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

I''ve wrote a small (virtual) infinite number system (don''t know how to call it exactly) (only addition and multiplying with unsigned not floating point numbers). I''ve ran a test but don''t know if my performance is good or bad. Does somebody has wrote an infinite number system too and have some performance measuraments? I''ve calculated 2^131072 (=2^1024^128) in 61906 ms (39457 digits) and 2^65536 (=2^1024^64) in 15341 ms (19729 digits). Is this a bad or good performance? My test system is a P4 1,7Ghz, 100 mhz FSB with 512 MB PC800 RAM. Does somebody know how to difine such numbers?

Share this post


Link to post
Share on other sites
Advertisement
if you supply me with the code for it ill run some tests on my machine so we can compare notes if you like.

[edited by - vaneger on March 21, 2004 6:00:55 PM]

Share this post


Link to post
Share on other sites
Something like this?

They''re usually affectionately called bignums, and the more precise term is arbitrary precision arithmetic.

Share this post


Link to post
Share on other sites

  • Advertisement