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

bugzilla-daemon at libre-soc.org bugzilla-daemon at libre-soc.org
Fri May 17 09:22:27 BST 2024


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

--- Comment #10 from Jacob Lifshay <programmerjake at gmail.com> ---
I got the formal proof for gfbinv to work!

https://git.libre-soc.org/?p=nmigen-gf.git;a=shortlog;h=35e5f677384814056e63e17e4c5005366017cebf

commit 35e5f677384814056e63e17e4c5005366017cebf
Author: Jacob Lifshay <programmerjake at gmail.com>
Date:   Fri May 17 01:16:04 2024 -0700

    hdl/test/test_gfbinv: add formal proof for gfbinv

commit a3c473b0521038e02f67a899fcaf1795ce3ff295
Author: Jacob Lifshay <programmerjake at gmail.com>
Date:   Fri May 17 01:15:12 2024 -0700

    test DecodeReducingPolynomial exhaustively for small XLEN

commit 1b041671a37502608fe577110193398f18b7fee8
Author: Jacob Lifshay <programmerjake at gmail.com>
Date:   Fri May 17 01:10:57 2024 -0700

    change decode_reducing_polynomial definition so it can encode x^XLEN + x +
1

    also adds a test that all degree <= XLEN irreducible polynomials can be
encoded

commit 9d615801f85b1878bc46548bca1479c73438bf8c
Author: Jacob Lifshay <programmerjake at gmail.com>
Date:   Fri May 17 01:09:11 2024 -0700

    gf_reference/is_irreducible.py: move is_irreducible() to a separate file

commit 68ba5fe8e3ec9f4bd322110e1fc0e4f75906c6df
Author: Jacob Lifshay <programmerjake at gmail.com>
Date:   Thu May 16 22:02:45 2024 -0700

    hdl/clmul: split clmuladd hdl out into separate function for ease of use in
formal proofs

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


More information about the libre-soc-bugs mailing list