Rate-1 BARGs via fully-local SSB hash families

on YouTube ↗46m

" summary

Defines and builds a fully-local SSB hash family whose local openings are poly(lambda) and verifiable against a succinct digest, so openings do not grow with the number of bound bits. Uses RAM-SNARGs + reorganized chunked hashing (Merkle root verification) to turn any nontrivial non-interactive batch argument into a rate-1 BARG: final hash length equals one witness plus poly(lambda), and the proof is witness-sized. Delivers working applications: multi-hop aggregate signatures and incrementally verifiable computation with polylog T proof time.

AI-written summary · about

" chapters (9)

1. 0:00Introduction to bargs
2. 3:52Motivation for rate-one bargs
3. 6:46Construction intuition
4. 10:44Implementing RAM snarks
5. 14:05Challenges with SSB hashes
6. 21:00Fully local SSB hash family
7. 28:37Boosting to polylog bargs
8. 31:02Achieving rate-one bargs
9. 37:21Applications and IVC

" related talks

• 01h 10mBatch Arguments and Their ApplicationsOmer Paneth · Proofs (Simons Institute)
• 01h 15mProofs - TheoryYael Tauman Kalai · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 07mBatch Arguments for NP and SNARGs for P from LWEAbhishek Jain · Quantum and Lattices Joint Reunion Workshop
• 58mSNARGs for P/poly from SISHoeteck Wee · Proofs (Simons Institute)
• 46mSignatures 1David Joseph, Edoardo Signorini · RSA Conference 2024
• 01h 08mTowards SNARGs for NP from Standard AssumptionsZhengzhong Jin · Proofs (Simons Institute)
• 23mSonic: Nearly Trustless SNARK SetupsSean Bowe · Zcon1: Zero to Privacy Hero 2019
• 52mFaster, Smaller, Weaker, DarkerBenedikt Bunz · Proofs, Consensus, and Decentralizing Society Reunion 2020