[Openmcl-devel] Bignum speed

[Waldek Hebisch]

Are there any plans to speed up large integer arithmetic?
Currently it looks that large integer multiplication in
Closure CL is much slower that in some other Lisp implementations.
I understand that in typical applications speed of large
integer operations is irrelevant.  However, for computer
algebra systems like FriCAS large integer integer arithmetic
is very important.  Closure CL is quite fast on some operations
and on average on FriCAS testsuite is second one (after sbcl),
however on some realistic computation Closure CL is the slowest
(when compared to sbcl, clisp, ecl and gcl) -- the reson
seem to be very poor large integer performance.

-- 
                              Waldek Hebisch
hebisch at math.uni.wroc.pl