In this week’s episode, Anna Rose (https://twitter.com/annarrose) dives back into accumulation schemes with Benedikt Bünz (https://twitter.com/benediktbuenz) and Binyi Chen (https://twitter.com/Charles_Chen533) from Espresso Systems (https://espressosys.com/). 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 (https://docs.espressosys.com/cape)
Espresso Sequencer (https://hackmd.io/@EspressoSystems/EspressoSequencer)
Bulletproofs: Short Proofs for Confidential Transactions and More by Bünz, Bootle, Boneh, Poelstra, Wuille and Maxwell (https://eprint.iacr.org/2017/1066.pdf)
Verifiable Delay Functions by Boneh, Bonneau, Bünz and Fisch (https://eprint.iacr.org/2018/601.pdf)
HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates by Chen, Bünz, Boneh and Zhang (https://eprint.iacr.org/2022/1355)
Protostar: Generic Efficient Accumulation/Folding for Special-sound Protocols by Bünz and Chen (https://eprint.iacr.org/2023/620.pdf)
Proof-Carrying Data without Succinct Arguments by Bünz, Chiesa, Lin, Mishra and Spooner (https://eprint.iacr.org/2020/1618.pdf)
Proof-Carrying Data from Accumulation Schemes by Bünz, Chiesa, Mishra, and Spooner (https://eprint.iacr.org/2020/499)
Multivariate lookups based on logarithmic derivatives by Haböck (https://eprint.iacr.org/2022/1530.pdf)
Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments by Boneh, Drake, Fisch, Gabizon (https://eprint.iacr.org/2020/1536.pdf)
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency by Valiant (https://www.cs.purdue.edu/homes/pvaliant/uniqueCS.pdf)
Recursive Proof Composition without a Trusted Setup by Bowe, Grigg, and Hopwood (https://eprint.iacr.org/2019/1021.pdf)
Episode 40: Benedikt Bünz on Bulletproofs and Verifiable Delay Functions (https://zeroknowledge.fm/40-2/)
Episode 277: Nova and Beyond with Srinath Setty (https://zeroknowledge.fm/277-2/)
Check out the ZK Jobs Board here: ZK Jobs (https://jobsboard.zeroknowledge.fm/). Find your next job working in ZK!
Aztec Network (https://aztec.network/) is building a next-generation encrypted blockchain powered by Ethereum.
The team is proud to announce Noir (https://aztec.network/noir) - the world's first universal zk-language. Noir makes it safe and intuitive to write zk circuits and encrypted smart contracts, enabling novel use-cases like encrypted DeFi, private governance, and zk gaming.
As a universal language, Noir is domain-specific, but blockchain agnostic. Build powerful zk applications compatible with multiple proving systems and verify your program on any EVM chain.
Get started with Noir today at docs.aztec.network/noir (https://docs.aztec.network/noir)
If you like what we do:
* Find all our links here! @ZeroKnowledge | Linktree (https://linktr.ee/zeroknowledge)
* Subscribe to our podcast newsletter (https://zeroknowledge.substack.com)
* Follow us on Twitter @zeroknowledgefm (https://twitter.com/zeroknowledgefm)
* Join us on Telegram (https://zeroknowledge.fm/telegram)
* Catch us on YouTube (https://zeroknowledge.fm/)