Zero Knowledge

In this week’s episode, Anna Rose dives back into accumulation schemes with Benedikt Bünz and Binyi Chen from Espresso Systems. They discuss ProtoStar and how it compares to works such as Nova and HyperNova, as well as explore some definitions for commonly used terms in the accumulation literature. Here’s some additional links for this episode:Espresso Systems CAPE Espresso Sequencer Bulletproofs: Short Proofs for Confidential Transactions and More by Bünz, Bootle, Boneh, Poelstra, Wuille and Maxwell Verifiable Delay Functions by Boneh, Bonneau, Bünz and Fisch HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates by Chen, Bünz, Boneh and Zhang Protostar: Generic Efficient Accumulation/Folding for Special-sound Protocols by Bünz and Chen Proof-Carrying Data without Succinct Arguments by Bünz, Chiesa, Lin, Mishra and Spooner Proof-Carrying Data from Accumulation Schemes by Bünz, Chiesa, Mishra, and Spooner Multivariate lookups based on logarithmic derivatives by Haböck Halo Infinite: Proof-Carr