SNARK Flipper. FLIP & Prove multiple instances efficiently

on YouTube ↗17m

" summary

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 into one with logarithmic communication and verifier checks. The final verification uses a tailored committed-relaxed Groth16 (one extra pairing in the SRS) and the flip verifier performs two pairings to validate the final commitment key. Result: proof size stays small, verifier work is logarithmic in N, and total prover time drops substantially versus SNARKPack aggregation.

AI-written summary · about

" chapters (10)

1. 0:00Introduction
2. 1:26What is a SNARK
3. 2:30Filecoin’s SNARK aggregation
4. 3:57FLIP protocol
5. 7:10Nova-style folding
6. 10:28Optimizing verifier workload
7. 11:32Committed Groth16
8. 14:01Summary
9. 15:47Future directions
10. 16:30Q&A

" related talks

• 25mHigh-Speed zkSNARKs without Trusted SetupSrinath Setty · 4th ZKProof Workshop (Home Edition)
• 57mPractical Groth16 AggregationAnca Nitulescu, Nicolas Gailly · 4th ZKProof Workshop (Home Edition)
• 26mzk-SHARKs: Combining Succinct Verification and Public Coin SetupMadars Virza · 2nd ZKProof Workshop 2019
• 25mLegoSNARK: Modular Design and Composition of Succinct Zero Knowledge ProofsDario Fiore · 2nd ZKProof Workshop 2019
• 20mSNARKs from the sum-check protocolJustin Thaler · 4th ZKProof Workshop (Home Edition)
• 59mCommit-and-Prove Zero-Knowledge Proof Systems and ExtensionsJiwon Lee · 4th ZKProof Workshop (Home Edition)
• 27mProofs of proofs: incremental verifiability from recursion and accumulationNick Spooner · 4th ZKProof Workshop (Home Edition)
• 44mBilinear Pairings-based Zero-Knowledge ProofsJens Groth · 2nd ZKProof Workshop 2019