如果你重视零知识证明技术信息的实效性和信息源质量的意义,不想娱乐至死、短视投机、无关广告、推荐算法、劣币驱逐良币的泥沙裹挟迷失,请多支持我们(包括给予赞助支持),让这一汨清流继续流淌~
In this module, Tracy Livengood and Justin Thaler provide a comprehensive introduction to the sum-check protocol and why it is so powerful, beginning with a catch-up on polynomials (univariate, multivariate, multilinear) as well as the important concept of multilinear extensions, and introduce the “equality” function. They go on to explain the mechanics of the sum-check protocol, detailing its goals and process, before walking us through the rounds of the protocol and demonstrating how it is applied. They then highlight the advantages of sum-check over other SNARK systems, and sketch the Spartan polynomial IOP. Toward the end, they delve into the Goldwasser, Kalai and Rothblum (GKR) protocol and discuss the trade-offs between this system and Spartan.
@ignaciohagopian wrote an article explaining the rationale and the mechanics of the specific fast Fourier transform (FFT) defined in the Circle STARKs paper.
Open sourced ZK-SecreC, a zero knowledge toolkit for building large proofs on computation. Imagine proving to someone that your health records don't have a diagnosis or that you have been staying in some are without leaking the source data.
If you’d like to receive updates via email, click subscribe. Stay informed and never miss a post!
And our YouTube channel
如果觉得我的文章对您有用,请随意打赏。你的支持将鼓励我继续创作!