Our Research
Binius is the product of a research effort driven by Irreducible. Our paper, Succinct Arguments over Towers of Binary Fields, introduced a novel approach to succinct argument construction that holds unique advantages in computational efficiency.
Binary fields have a long history in the field of cryptography and are used in standards like the Advanced Encryption Standard (AES) and the Galois Message Authentication Code (GMAC). Our work applies the remarkable properties of binary fields to the problem of verifiable computing.
November 2023
Succinct Arguments over Towers of Binary Fields paper published and initial code release
February 2024
SNARK for Keccak-256 hash function
What’s Next
Binius is still under active development and has many more chapters to add to its roadmap.
Irreducible’s proving service will feature flagship support for Binius, accelerated by our FPGA server clusters.
Binary field arithmetic allows for compact circuit designs that operate at high clock frequencies. As a result, our custom digital logic tears through binary field operations far more efficiently than CPU and GPU processors can.
