"Binius’s FPGA prototypes have shown that binary field multiplications can be performed in one clock cycle, making them exponentially more efficient than traditional prime field operations like Mersenne-31, which require 49 clock cycles"

"Binius’s FPGA prototypes have shown that binary field multiplications can be performed in one clock cycle, making them exponentially more efficient than traditional prime field operations like Mersenne-31, which require 49 clock cycles"

https://0xmilica.com/post/binius/

Damn, that's pretty fucking wild actually

Interested in ZK, FHE, PUFs, hardware, system design, ai safety, and smart contact security.

True. Just skimmed the article, did they say which FPGA they did this on? In any case an FPGA is pretty easy to get a hold of, so not at client side mobile proofs yet, but an enthusiast building a power efficient proving node at home territory