# Pushing the Limits of Proof Systems with Benedikt Bünz

Page: https://stenobird.com/podcast/zero-knowledge-1048106/pushing-the-limits-of-proof-systems-with-benedikt-b-nz
Text version: https://stenobird.com/podcast/zero-knowledge-1048106/pushing-the-limits-of-proof-systems-with-benedikt-b-nz.md
Podcast: [Zero Knowledge](https://stenobird.com/podcast/zero-knowledge-1048106)
Published: 2026-06-24T13:00:00+00:00
Episode link: https://zeroknowledge.fm/podcast/404
Audio file: https://episodes.captivate.fm/episode/1547fbc4-c697-4e2b-a9ce-e77d85d6698a.mp3
Processing state: not_requested
JSON: https://stenobird.com/v1/public/podcasts/zero-knowledge-1048106/episodes/pushing-the-limits-of-proof-systems-with-benedikt-b-nz
Duration seconds: 4135

## Resource

In this episode, Anna and Kobi speak with Benedikt Bünz , Chief Scientist at Espresso Systems and Professor at NYU. They start with a quick update on Espresso's architecture, its role in delivering fast finality across chains, and the challenges of building high-throughput blockchain infrastructure. The conversation then turns to Benedikt’s recent research on folding schemes, hash-based proof systems such as Arc and Warp, and Golden, a non-interactive distributed key generation protocol for threshold signatures. The episode later explores Flock, a new proof system for standard hash functions such as Blake3 and SHA-256 that exceeds Ethereum's post-quantum proving targets without relying on specialized hash functions. They conclude by discussing proof system performance, post-quantum cryptography, and the use of AI-assisted development in cryptographic engineering.   Related Links Bulletproofs — Short Proofs for Confidential Transactions and More Protostar — Generic Efficient Accumulation/Folding for Special-Sound Protocols HyperPlonk — Plonk with Linear-Time Prover and High-Degree Custom Gates Nova — Recursive Zero-Knowledge Arguments from Folding Schemes Arc — Accumulation for Reed–Solomon Codes Linear-Time Accumulation Schemes Golden: Lightweight Non-Interactive Distributed Key Generation Flock: Fast Proving for Batch Boolean Computations TensorSwitch — Nearly Optimal Polynomial Commitments from Tensor Codes Bolt: Faster SNARKs from Sketched Codes Ligero — Lightweight Sublinear Arguments Without Trusted Setup Systems and Infrastructure Espresso Systems Documentation CAPE (Configurable Asset Privacy for Ethereum) Monero Additional Reading Vitalik Buterin — The Splurge: Post-Quantum Ethereum Accumulation without Homomorphism Neo and SuperNeo: Post-Quantum Folding w…

## Actions

- request_transcript: `POST https://stenobird.com/v1/public/podcasts/zero-knowledge-1048106/episodes/pushing-the-limits-of-proof-systems-with-benedikt-b-nz/transcription-requests` — Idempotently request low-priority transcript generation for this episode.
- read_markdown: `GET https://stenobird.com/podcast/zero-knowledge-1048106/pushing-the-limits-of-proof-systems-with-benedikt-b-nz.md` — Read the agent-friendly Markdown representation of this episode resource.

A page view does not enqueue transcription. Agents should invoke `request_transcript` explicitly when they need this episode processed.

## Transcript

Full transcripts are not published on public pages unless there is a clear rights basis.