MCODE: Fastest way to multiply

[PeterP]

I found this article on Quanta Magazine (my favorite guilty pleasure read). For the MCODE gurus here, it seems one might be able to 'update' the OS routine for multiplication when doing large multiplications, ie for Prime Search or for multi-precision algorithms, or Pi-Spigots, etc.

I wonder what time-improvement one could get using an updated "*" in FOCAL programs for large numbers. This could be implemented in the 41CL for example.

It was just generally a fascinating read to learn something as basic as multiplication can still be improved.

Cheers

PeterP