[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

Luke Kenneth Casson Leighton <lkcl at lkcl.net> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
         Resolution|---                         |FIXED
       The table of|jacob=2000                  |jacob=1000
  payments (in EUR)|                            |lkcl=1000
     for this task;|                            |
        TOML format|                            |
             Status|IN_PROGRESS                 |RESOLVED

--- Comment #64 from Luke Kenneth Casson Leighton <lkcl at lkcl.net> ---
(In reply to Jacob Lifshay from comment #63)
> (In reply to Jacob Lifshay from comment #61)

> >     powmod asm tests pass!
> 
> so, now that this is all working, I think we can push all improvements of
> the bigint mul algorithm into the bigint mul remap bug #1155 

ok.

> and declare
> this bug complete and merge the branch.

ok

> Also, I think we should assign some money to luke for the review and
> feedback (and also because he needs money).
> 
> Luke, what do you think?

good idea. the bigmul remap is quite straightforward, there is a
step-by-step procedure to follow. let's get RFPs in and move to
bug #1155, and examine the assembler here for patterns.

ed25519 also has patterns but they are carry-save ones (modulo wrap
on the index sums, (x+y)%N rather than just x+y)

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