Paper 2023/1784
Succinct Arguments over Towers of Binary Fields
Abstract
We introduce an efficient SNARK for towers of binary fields. Adapting Brakedown (CRYPTO '23), we construct a multilinear polynomial commitment scheme suitable for polynomials over tiny fields, including that with just two elements. Our commitment scheme, unlike those of previous works, treats small-field polynomials with no embedding overhead. We further introduce binary-field adaptations of HyperPlonk (EUROCRYPT '23)'s product and permutation checks and of Lasso ('23)'s lookup. Our 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.
Note: Updated benchmarks, which now feature Keccak-f performance. Various further minor improvements.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- binary fieldstowers of fieldssuccinct arguments
- Contact author(s)
-
bdiamond @ irreducible com
jposen @ irreducible com - History
- 2024-10-05: last of 3 revisions
- 2023-11-17: received
- See all versions
- Short URL
- https://ia.cr/2023/1784
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1784,
author = {Benjamin E. Diamond and Jim Posen},
title = {Succinct Arguments over Towers of Binary Fields},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/1784},
year = {2023},
url = {https://eprint.iacr.org/2023/1784}
}
