Paper 2022/1105 Original: eprint.iacr.org/2022/1105 ↗
Arithmetization of Σ¹₁ relations with polynomial bounds in Halo 2
Abstract
Previously [4], Orbis Labs presented a method for compiling (“arithmetizing”) relations, expressed as Σ¹₁ formulas in the language of rings, into Halo 2 [1, 2, 3] arithmetic circuits. In this research, we extend this method to support polynomial quantifier bounds, in addition to constant quantifier bounds. This allows for more efficient usage of rows in the resulting circuit.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2022-08-26: last updated
- 2022-08-26: published
- Short URL
- https://ia.cr/2022/1105
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/1105,
author = {Anthony Hart and Morgan Thomas},
title = {Arithmetization of Σ¹₁ relations with polynomial bounds in Halo 2},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/1105},
year = {2022},
url = {https://eprint.iacr.org/2022/1105}
}