Succinct Arguments over Towers of Binary Fields

We introduce an efficient SNARK for towers of binary fields. Adapting Brakedown (CRYPTO \u2723), we construct a multilinear polynomial commitment scheme suitable for polynomials over tiny fields, including that with 2 elements. Our commitment scheme, unlike those of previous works, treats small-field polynomials with zero embedding overhead. We further introduce binary-field adaptations of HyperPlonk\u27s (EUROCRYPT \u2723) product and permutation checks, as well as of Lasso\u27s lookup. Our scheme\u27s binary PLONKish variant captures standard hash functions—like Keccak-256 and Grøstl—extremely efficiently. With recourse to thorough performance benchmarks, we argue that our scheme can efficiently generate precisely those Keccak-256-proofs which critically underlie modern efforts to scale Ethereum