[[!inline pagenames="gf_reference/gfbmadd.py" raw="yes"]]
```
+the main entry point for our hardware implementation of both gfbmul and gfbmadd can be found at:
+
+[nmigen-gf.git/src/nmigen_gf/hdl/gfbmadd.py:419](https://git.libre-soc.org/?p=nmigen-gf.git;a=blob;f=src/nmigen_gf/hdl/gfbmadd.py;h=d3fce843304672ac007db6dcc2b395f9ea126335;hb=bc0c03b3df2fa19189aaa2b61a101cdc8ebf1beb#l419)
+
+[tests and formal proofs](https://git.libre-soc.org/?p=nmigen-gf.git;a=blob;f=src/nmigen_gf/hdl/test/test_gfbmadd.py;h=b2a9f5604198df36152b69d48e5136e46ea9adc0;hb=bc0c03b3df2fa19189aaa2b61a101cdc8ebf1beb)
+
## `gfbtmadd` -- Binary Galois Field `GF(2^m)` Twin Multiply-Add (for FFT)
Used in combination with SV FFT REMAP to perform a full `GF(2^m)` Discrete
[[!inline pagenames="gf_reference/gfbinv.py" raw="yes"]]
```
+The main entry point in our hardware implementation can be found at:
+
+[nmigen-gf.git/src/nmigen_gf/hdl/gfbinv.py:386](https://git.libre-soc.org/?p=nmigen-gf.git;a=blob;f=src/nmigen_gf/hdl/gfbinv.py;h=712c2a64ead603abc81d45d8aac104e9de92f77d;hb=bc0c03b3df2fa19189aaa2b61a101cdc8ebf1beb#l386)
+
+[tests and formal proofs](https://git.libre-soc.org/?p=nmigen-gf.git;a=blob;f=src/nmigen_gf/hdl/test/test_gfbinv.py;h=c85131344d9a208f42f73ff58a4512988f044cb9;hb=bc0c03b3df2fa19189aaa2b61a101cdc8ebf1beb)
+
# Instructions for Prime Galois Fields `GF(p)`
## `GFPRIME` SPR -- Prime Modulus For `gfp*` Instructions