modular arithmetic on bignums is slow

ID	Created	Type	mocl Version	Dev OS	Target	Status
#60	by tom on 2014-09-05 (1871 days ago)	enhancement	14.08	Mac OS X	iOS	open

Description

Summary: bignum library is not optimized in MOCL

Steps to Reproduce: Test case sent.

Expected Results:

Actual Results:

Notes:

Generating a large prime in mocl can take several minutes vs under a second in SBCL.  Previous ticket indicates modular multiplication and division are the culprit

Comments

Previous discussion at https://wukix.com/support/ticket/59

- Wukix, 1871 days ago

FYI comparing desktop vs. desktop (OS X vs. OS X) instead of desktop vs. mobile I get about 11 seconds average on mocl (release mode build) vs. about 0.3 seconds average on SBCL. Still not great but at least gives a clearer picture of the gap.

- Wukix, 1870 days ago