ZKProof 8 Talks: Videos, Slides and Papers

ZKProof 8 took place in Rome, Italy, on May 9–10, 2026. The program featured 42 accepted papers on zero-knowledge proofs, presented alongside keynotes and invited talks. This page collects every talk from the workshop, grouped by topic.

Each talk has its own page with the video recording, the slides, a link to the accepted paper and a written summary of the talk. Talk pages are being published progressively, and the titles below become links as they go live.

Topics: Lattice-based proof systems and folding · Codes, IOPs and hash-based SNARKs · Sumcheck, folding and recursion · Pairing-based SNARKs, Plonk and security foundations · zkVMs, tooling and formal verification · Applications of zero-knowledge proofs

Watch all recordings on YouTube →

Lattice-based proof systems and folding

Post-quantum approaches to SNARKs, commitments and folding schemes built from lattice assumptions.

Symphony: Scalable SNARKs in the Random Oracle Model from Lattice-Based High-Arity Folding

Binyi Chen (Stanford University)

ProtogaLattice: Constant-Round Lattice-based Folding for General Polynomial Relations

Anca Nitulescu (IOG), Maxime Plançon, David Balbás

Improving LatticeFold+ with ℓ2-norm Checks

Michał Osadnik (Aalto University)

Cyclo: Lightweight Lattice-based Folding via Partial Range Checks

Albert Garreta (Nethermind), Helger Lipmaa (University of Tartu), Urmas Luhaäär (University of Tartu), Michal Osadnik (Aalto University)

ABBA: Lattice-based Commitments from Commutators

Alberto Centelles (Imperial College London, ICME Labs), Andrew Mendelsohn (Imperial College London)

Zinc+: SNARKs for Polynomial Rings

Alexander Abdugafarov (Nethermind Research), Albert Garreta (Nethermind Research), Michal Osadnik (Aalto University), Psi Vesely (Yale University), Ilia Vlasov (Nethermind Research), Kai Zhe Zheng (Nethermind Research, Massachusetts Institute of Technology)

Coming Back from the Knowledge kRISIS: Building Arguments from kPRISIS

Jonathan Bootle (UC Berkeley, IBM Research – Zurich), Ziyi Guan (EPFL), Christian Knabenhans (EPFL)

Codes, IOPs and hash-based SNARKs

Error-correcting codes, proximity testing and interactive oracle proofs behind fast, transparent hash-based proof systems.

All Polynomial Generators Preserve Distance with Mutual Correlated Agreement

Sarah Bordage (EPFL), Alessandro Chiesa (EPFL), Ziyi Guan (EPFL), Ignacio Manzur (EPFL)

On Reed–Solomon Proximity Gaps Conjectures

Elizabeth Crites (Parity Technologies), Alistair Stewart (Parity Technologies)

Zero-Knowledge IOPPs for Constrained Interleaved Codes

Giacomo Fenzi (EPFL), Alessandro Chiesa (EPFL), Guy Weissenberg (EPFL)

Joint Talk: A Simplified Round-by-round Soundness Proof of FRI & Lean Formalization

Nicolas Mohnblatt (ZKSecurity), Benedikt Wagner (Ethereum Foundation), Albert Garreta (Nethermind), Yoichi Hirai (ZKSecurity)

TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes

Benedikt Bünz (NYU), Giacomo Fenzi (EPFL), Ron Rothblum (Succinct), William Wang (New York University)

ERA Codes: Linear-Time Encodable Field-Agnostic Codes for SNARKs

Anubhav Baweja (University of Pennsylvania), Giacomo Fenzi (EPFL), Pratyush Mishra (University of Pennsylvania), Tushar Mopuri (University of Pennsylvania)

Bolt: Faster SNARKs from Sketched Codes

Kobi Gurkan (Bain Capital Crypto), Andrija Novakovic (Bain Capital Crypto), Ron Rothblum (Succinct)

A New Framework for Constructing Hash-Based Proof Systems with Efficient Prover Time and Query Complexity

Anubhav Baweja (University of Pennsylvania), Pratyush Mishra (University of Pennsylvania), Tushar Mopuri (University of Pennsylvania), Matan Shtepel (Carnegie Mellon University)

Code-based Scalable Collaborative SNARKs

Christodoulos Pappas (The Hong Kong University of Science and Technology & Lagrange Labs), Dimitrios Papadopoulos (Hong Kong University of Science & Technology & Lagrange Labs), Charalampos Papamanthou (Yale University & Lagrange Labs)

Time-Space Tradeoffs For Probabilistic Proofs

Alessandro Chiesa (EPFL), Ziyi Guan (EPFL), Omer Paneth (Tel Aviv University), Nicholas Spooner (Cornell University)

Sumcheck, folding and recursion

Faster sumcheck provers, accumulation and folding schemes, incremental verifiable computation and polynomial commitments.

Time-Space Trade-Offs for Sumcheck

Anubhav Baweja (University of Pennsylvania), Alessandro Chiesa (EPFL), Elisabetta Fedele (ETH Zurich), Giacomo Fenzi (EPFL), Pratyush Mishra (UPenn), Tushar Mopuri (University of Pennsylvania), Andrew Zitek-Estrada (EPFL)

Speeding Up Sum-Check Proving

Quang Dao (Carnegie Mellon University), Zachary DeStefano (NYU), Suyash Bagad (Ingonyama), Yuval Domb (Ingonyama), Justin Thaler (Georgetown University)

Revisiting the IPA-sumcheck connection

Liam Eagen (ideal), Ariel Gabizon (Aztec Labs)

Linear-Time Accumulation Schemes

Benedikt Bünz (NYU), Alessandro Chiesa (EPFL), Giacomo Fenzi (EPFL), William Wang (New York University)

KZH-Fold: Accountable Voting from Sublinear Accumulation

Hossein Hafezi (New York University), Benedikt Bünz (NYU), Arantxa Zapico (Ethereum Foundation), George Kadianakis (Ethereum Foundation)

General Techniques for Unbounded-Depth IVC in the AGM (and More)

Matteo Campanelli (Offchain Labs), Dario Fiore (IMDEA Software Institute), Mahak Pancholi (IMDEA Software Institute)

Dynamic zk-SNARKs (with applications to sparse zk-SNARKs and IVC)

Weijie Wang (Yale University), Charalampos Papamanthou (Yale University & Lagrange Labs), Shravan Srinivasan (Lagrange Labs), Dimitrios Papadopoulos (Hong Kong University of Science and Technology & Lagrange Labs)

Relaxed Modular PCS from Arbitrary PCS and Applications to SNARKs for Integers

Alireza Shirzad (University of Pennsylvania), Sriram Sridhar (University of California, Berkeley), Dimitrios Papadopoulos (Hong Kong University of Science and Technology and Lagrange Labs), Charalampos Papamanthou (Yale University and Lagrange Labs)

Pairing-based SNARKs, Plonk and security foundations

Succinct arguments from pairings, the security of Plonk, and the theory behind Fiat–Shamir, knowledge soundness and composability.

Pairing-Based SNARGs with Two Group Elements

Gal Arnon (Bocconi University), Jesko Dujmovic (Northeastern University), Eylon Yogev (Bar-Ilan University)

Plonk is Simulation Extractable in ROM Under Falsifiable Assumptions

Helger Lipmaa (University of Tartu)

Plonk Without Random Oracles

Georg Fuchsbauer (TU Wien), Marek Sefranek (TU Wien)

What a Wonderful World: zkSNARKs in the Algebraic Group Model are Universally Composable

Gaspard Anthoine (IMDEA Software Institute, Universidad Politécnica de Madrid), Dario Fiore (IMDEA Software Institute), Mahak Pancholi (IMDEA Software Institute)

A Fiat–Shamir Transformation from Duplex Sponges

Michele Orrù (CNRS), Alessandro Chiesa (EPFL)

Non-Malleable Reductions of Knowledge

Lili Tong (EURECOM), Antonio Faonio (EURECOM)

zkVMs, tooling and formal verification

Making zero-knowledge proofs practical: zkVM performance, low-memory provers, outsourced proving and tools for verifying ZK programs.

Efficient Recursion for the Jolt zkVM

Quang Dao (Carnegie Mellon University), Sagar Dhawan (a16z crypto research), Markos Georghiades (a16z crypto research), Justin Thaler (a16z crypto research & Georgetown University), Andrew Tretyakov (a16z crypto research), Michael Zhu (a16z crypto research)

Evaluating Compiler Optimization Impacts on zkVM Performance

Thomas Gassmann (ETH Zurich), Stefanos Chaliasos (Imperial College London), Thodoris Sotiropoulos (ETH Zurich), Zhendong Su (ETH Zurich)

Scribe: Low-memory SNARKs via Read-Write Streaming

Anubhav Baweja (University of Pennsylvania), Pratyush Mishra (University of Pennsylvania), Tushar Mopuri (University of Pennsylvania), Karan Newatia (University of Pennsylvania), Steve Wang (University of Pennsylvania)

Single-Server Private Outsourcing of zk-SNARKs

Kasra Abbaszadeh (University of Maryland), Hossein Hafezi (New York University), Jonathan Katz (Google), Sarah Meiklejohn (University College London / Google)

zkLean: A DSL for ZK statement verification

James Parker (Galois, Inc.), Valentin Robert (Galois, Inc.), Elizaveta Pertseva (Stanford), Benoit Razet (Galois, Inc.), Carl Kwan (Top Yield Limited), Ben Hamlin (Galois, Inc.), Brett Decker (Galois, Inc.)

Language-Agnostic Detection of Computation-Constraint Inconsistencies in ZKP Programs via Value Inference

Arman Kolozyan (Max Planck Institute for Security and Privacy), Bram Vandenbogaerde (Vrije Universiteit Brussel), Janwillem Swalens (Nokia Bell Labs), Lode Hoste (Nokia Bell Labs), Stefanos Chaliasos (UCL Centre for Blockchain Technologies & zkSecurity), Coen De Roover (Vrije Universiteit Brussel)

Applications of zero-knowledge proofs

Zero-knowledge proofs in deployed systems: private authentication, verifiable databases and verifiable computation on encrypted data.

Analysis and Vulnerabilities in zkLogin

Sofia Celi (Brave & University of Bristol), Hamed Haddadi (Imperial College London & Brave Software), Kyle Den Hartog (Brave)

Using existing credentials and MPC-in-the-Head for browser-based private authentication to blockchain

Andres Ojamaa (Cybernetica AS), Martin Pettai (Cybernetica AS), Martin Suomalainen (Cybernetica AS), Peeter Laud (Cybernetica AS)

TruthTable: A Verifiable Query Engine

Bharath Namboothiry (University of Pennsylvania), Alireza Shirzad (University of Pennsylvania), Spencer Solit (Seismic Systems), Ryan Marcus (University of Pennsylvania), Pratyush Mishra (University of Pennsylvania)

Laminate: Succinct SIMD-Friendly Verifiable FHE

Kabir Peshawaria (Boston University), Zeyu Liu (Yale University), Ben Fisch (Yale University), Eran Tromer (Boston University)

Batch, Pack, and Prove: More Efficient Verifiable Computation for CKKS

Ignacio Cascudo (IMDEA Software), Anamaria Costache (École Polytechnique), Daniele Cozzo (IMDEA Software Institute), Dario Fiore (IMDEA Software Institute), Antonio Guimarães (IMDEA Software Institute), Eduardo Soria Vazquez (Technology Innovation Institute)

More from ZKProof 8

See the speakers, program committee, photos and venue of ZKProof 8, or explore talks from earlier ZKProof workshops.

ZKProof 8 in Rome →All ZKProof events →