- [DP23] Succinct Arguments over Towers of Binary Fields
- [DP24a] Proximity Testing with Logarithmic Randomness
- [DP24b] Polylogarithmic Proofs for Multilinears over Binary Towers
- [AMPS24] Vision Mark-32: ZK-Friendly Hash Function Over Binary Tower Fields
- [Hab24] Basefold in the List Decoding Regime
- [BDT24] The Sum-Check Protocol over Fields of Small Characteristic
- [DT24] Constraint-Packing and the Sum-Check Protocol over Binary Tower Fields
- Binius: a Hardware-Optimized SNARK
- FRI-Binius: Improved Polynomial Commitments for Binary Towers
- Binius: highly efficient proofs over binary fields by Vitalik Buterin
- Binary Tower Fields are the Future of Verifiable Computing
- Integer Multiplication in Binius
- Vision Mark-32: A ZK-Friendly Hash Function Over Binary Tower Fields
- KZG vs FRI vs Binius: Comparing Polynomial Commitment Schemes for SNARKs, STARKs, and Beyond
- Episode 303: A Dive into Binius with Ulvetanna
- Binius: A Hardware-Optimized SNARK ft. Jim Posen, Ulvetanna | D/INFRA SUMMIT
- Starting to study Binius by LambdaClass
- ZK11: Binius: a Hardware-Optimized SNARK - Jim Posen
- Jim Posen: FRI-Binius: Polynomial Commitments for Tiny Binary Fields
- FRI-Binius: Polynomial Commitments for Tiny Binary Fields - Jim Posen - Web3 Summit 2024 Berlin
- Succinct Arguments over Towers of Binary Fields by Ben Diamond
- zkStudyClub - Succinct Arguments over Towers of Binary Fields Ben Diamond & Jim Posen