[Libre-soc-bugs] [Bug 785] Implement gfb* instructions for GF(2^n) instructions

[bugzilla-daemon at libre-soc.org]

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

--- Comment #14 from Jacob Lifshay <programmerjake at gmail.com> ---
(In reply to Luke Kenneth Casson Leighton from comment #13)
> (In reply to Jacob Lifshay from comment #12)
> > gfbmul/gfbmadd's formal proof works too!
> > 
> > Since Bob hasn't responded about when our deadline is, should we consider
> > this done due to running out of time and submit the RFPs?
> 
> ohh yes.
> 
> will have to go at the higher-up bugreport otherwise it will need an
> update to the json file, and we don't have time.
> 
> chasing the chain... this one:
> https://bugs.libre-soc.org/show_bug.cgi?id=772

turns out the formal proofs were supposed to be under bug #840, so we're moving
just the formal proofs to that bug, everything else (hdl implementations and
unit tests for gfbinv/gfbmul/gfbmadd) stays under this bug.

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