Revisiting the IPA-sumcheck connection | Ariel Gabizon, Aztec Labs
Автор: Yale Applied Cryptography Laboratory
Загружено: 2025-09-10
Просмотров: 148
Описание:
Abstract: Inner Product Arguments (IPA) [BCC+16,BBB+17] are a family of proof systems with O(log n) sized proofs, O(n) time verifiers, and transparent setup. Bootle, Chiesa and Sotiraki [BCS21] observed that an IPA can be viewed as a sumcheck protocol [LFKN92] where the summed polynomial is allowed to have coefficients in a group rather than a field. We leverage this viewpoint to improve the performance of multi-linear polynomial commitments based on IPA. Specifically, - We introduce a simplified variant of Halo-style accumulation that works for multilinear evaluation claims, rather than only univariate ones as in [BGH19,BCMS20]. - We show that the size n MSM the IPA verifier performs can be replaced by a ``group variant'' of basefold[ZCF23]. This reduces the verifier complexity from O(n) to O(λ*log^2 n).
Link: https://ia.cr/2025/1325
Bio: Ariel is currently Chief Scientist at Aztec Labs. He holds a PhD in Theoretical Computer Science from the Weizmann Institute. He transitioned from pure theory to applied ZK working in Eli Ben-Sasson's lab on STARKs. Joined Zcash in 2016 to help with the first-ever SNARK trusted setup and real-life deployment and working in the applied ZK space since. Co-author of PlonK.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
