Panel Discussion
summary
Survey of 2024 ZK work names specific systems and tradeoffs: evidence for LTIS fold lattice SNARKs as a new cryptographic direction offering post‑quantum guarantees and limited homomorphism, continued evolution of hash/code based STARK variants like Circle Stark, and revival of pairing proofs in polymath/ Gerudo/Parry smaller pairing SNARKs that reintroduce per‑circuit trusted setups. Practical tensions appear: folding vs small‑field incompatibility (folding needs homomorphic commitments), lookup techniques vary by commitment choice, ZK VMs + recursion enable general co‑processors, and prover markets, aggregation and security audits remain unresolved.
AI-written summary · about
chapters (18)
- 0:00ZK research in 2024
- 0:49Breakthroughs vs incremental progress
- 2:53Older techniques like GKR
- 3:57Lattice cryptography in ZK
- 5:45Polymath and smaller SNARKs
- 7:50Historical ZK techniques reused
- 9:00Paradigm shifts in ZK
- 10:02Folding vs small field systems
- 13:18ZK infrastructure and co-processors
- 16:27ZK VMs and proof recursion
- 19:41Verifiable computing in blockchains
- 21:07ZK supply chain and marketplaces
- 24:43Decentralized proof aggregation
- 25:46ZK adoption challenges
- 27:30Funding for ZK apps
- 29:16Apps vs infrastructure tools
- 31:45Q&A on ZK security
- 35:23Closing remarks
related talks
39mPrivacy and Evolution of SNARKs
18mA Selection of Pairing Based zk-SNARKs
18mSoK: Understanding zk-SNARKs: The Gap Between Research and Practice
56mCollaborative zk-SNARKs: Proving as One over Distributed Secrets
26mLeveraging Duality for Programming with zkSNARKs
41mThe Future Is Trustless: How ZkVMS And ZkTLS Transform Bug
48mzkSNARKs — Cryptographic Proofs for Scaling and Security Challenges
01h 00mThe Path to Shielded Programmability