[Libre-soc-bugs] [Bug 1044] SVP64 implementation of pow(x,y,z)

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=1044

--- Comment #26 from Jacob Lifshay <programmerjake at gmail.com> ---
(In reply to Jacob Lifshay from comment #25)
> actually, picking the average number of divmod calls of 384, it comes out to
> ~2 million operations!
> 384 * 256 * 20 = 1966080

for a sense of scale, i'd guess that if we were to use all the optimization
techniques and fastest algorithms (montgomery multiplication, maybe karatsuba),
it could be done in under ~20k operations.

-- 
You are receiving this mail because:
You are on the CC list for the bug.