SoK: Understanding zk-SNARKs: The Gap Between Research and Practice
summary
Provides a concrete master recipe that converts a program into a zk-SNARK and classifies 40+ zk-SNARK schemes by their core techniques (QAP, PCP/PCS, polynomial commitment families), linking each class to practical properties like transparency, post-quantum resistance, proof size and verifier cost. Surveys 11 general-purpose libraries, measures compiler usability/compatibility and documents a virtual execution environment for running compilers. Finds hundreds of real vulnerabilities traceable to compiler/constraint-system gaps and argues researchers focus on proving systems while industry is bottlenecked by constraint compilers, offering documentation and standardization fixes.
AI-written summary · about
chapters (11)
- 0:00zk-SNARKs introduction
- 1:14Research gap and impact
- 2:38Participant groups and questions
- 3:41Master recipe framework
- 5:49Proving systems and QAPs
- 8:41Polynomial commitments and POPs
- 11:56Open-source zk-SNARKs libraries
- 13:03Compiler types and docs
- 15:42Recommendations and efficiency
- 16:07Compiler challenges and barriers
- 17:34Open-source future directions
related talks
48mzkSNARKs — Cryptographic Proofs for Scaling and Security Challenges
25mThe Next 700 ZKP Programming Languages
36mPanel Discussion
18mA Selection of Pairing Based zk-SNARKs
39mPrivacy and Evolution of SNARKs
56mCollaborative zk-SNARKs: Proving as One over Distributed Secrets
26mLeveraging Duality for Programming with zkSNARKs
23mSonic: Nearly Trustless SNARK Setups