[Libre-soc-bugs] [Bug 869] Formal verification of fadd for just round-nearest-ties-to-even without exception flags/traps

[bugzilla-daemon at libre-soc.org]

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

--- Comment #2 from Luke Kenneth Casson Leighton <lkcl at lkcl.net> ---
(In reply to Jacob Lifshay from comment #1)
> I implemented correct NaN propagation for the fadd pipeline, so this task is
> complete. considering that this whole task was only 2 days of work, I think
> eur 1500 is probably too much,

no, it really isn't.  you find these "easy" but they're extremely
challenging, and we lost a contributor two years ago because of
underpayment.

please don't publicly devalue the work that you're doing. i was
quoted around EUR 80,000 for a formal correctness proof of IEEE754FP
from an Industry source at market rates.

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