ZKP Frontier Tracker 🎯
零知识证明 前沿热点追踪 🎯
Thu 星期四
07.24
2025
Revisiting the IPA-sumcheck connection https://eprint.iacr.org/2025/1325
Eagen and Gabizon re-examined the connection between IPA and sumcheck protocol in paper, proposing improvements to the performance of multilinear polynomial commitment schemes, including simplified Halo-style accumulation and reduced verifier complexity. Eagen和Gabizon在论文中重新审视了IPA与sumcheck协议的联系，提出了改进多线性多项式承诺性能的方法，包括简化的Halo-style累积和减少验证者复杂度的新技术。
Hyrax: A Polynomial Commitment Scheme with Sublinear Complexity https://alinush.github.io/hyrax
alinush introduced Hyrax, a polynomial commitment scheme with sublinear complexity, in blog, combining Pedersen vector commitment and Bulletproofs inner-product arguments (IPAs), achieving sublinear commitment and proof sizes and verification time. alinush在博客中介绍了Hyrax多项式承诺方案，结合Pedersen向量承诺和Bulletproofs内积论证(IPAs)，实现了次线性的承诺和证明大小及验证时间。