ZKProof 6 in Berlin
2024-05-22..2024-05-24
Berlin, Germany
| title | author | length |
|---|---|---|
| Introductory Remarks | 06m | |
Opening remarks set the event frame: a three‑day ZKProof 6 in Berlin with an agenda online, gratitude to sponsors and AV teams, and a community that traces… | ||
| KEYNOTE Building Succinct Arguments from Ideal Hash Functions | Alessandro Chiesa | 30m |
Construction shows succinct arguments from the random oracle model using PCPs and IOPs, committing PCP strings with a Merkle tree whose root is λ bits and… | ||
| The Evolution of ZKProof.org | Jonathan S. Rouach, Mary Maller | 20m |
A history of concrete steps toward standardizing zero knowledge work since 2018 with volunteer working groups producing specifications for proving languages… | ||
| STIR: Reed-Solomon Proximity Testing with Fewer Queries | Eylon Yogev | 34m |
A new IOPP called STIR replaces FRI and preserves log D rounds and O(L) proof length while cutting query complexity roughly in half: for D=2^20, rate 1/4 and… | ||
| SoK: Private Programmability on Blockchain Systems | Ying Tong Lai, Daniel Benarroch | 32m |
Claim: zero-knowledge schemes verify a computation but do not perform live execution, so private interactive apps need a three-phase model: independent ZK… | ||
| Aggios: Scalable Aggregator-Based Voting | Doron Zarchy | 31m |
Aggios proposes an aggregator-based election where voters send ballots to chosen aggregators, aggregators publish blinded polynomial commitments and ZK… | ||
| Panel Discussion Day 1 | Daniel Benarroch | 41m |
A live panel experiments with a rotating format and dives into concrete privacy trade-offs: central banks request thresholds on turnover and a privacy budget… | ||
| Compliance for Digital Assets | Pablo Kogan | 31m |
Proposal adds enhanced viewing keys to Orchard/Orsa: each transfer includes an extra consensus-verified encrypted field containing spent and new diversified… | ||
| Zk-ACTUS: Towards Verifiable Financial Contracts | Mark Greenslade | 15m |
Proposes ZK-ACTUS: apply zero‑knowledge proofs to the ACTUS algorithmic contract standard to make financial contracts verifiable on-chain; prototypes a… | ||
| SNARK Flipper. FLIP & Prove multiple instances efficiently | Nikitas Paslis | 17m |
Flip folds many committed relaxed R1CS instances and their witnesses using inner pairing products and Nova-style folding so a single prover combines N proofs… | ||
| Jolt: SNARKs for virtual machines via lookups | Arasu Arun, Michael Zhu | 28m |
Jolt represents CPUs as tiny circuits that do only lookup checks into multilinear polynomial subtables instead of executing every instruction branch, using the… | ||
| nothing matches | ||