SNARK Design Part III with Justin Thaler | a16z crypto research talks
Source: YouTube · a16z crypto · published Nov 18, 2022 · 1:40:08
This video provides a technical deep dive into SNARKs (Succinct Non-interactive Arguments of Knowledge), explaining how they enable efficient verification of computations by combining polynomial IOPs with polynomial commitment schemes 0:09-2:13, 6:48-7:31.
Key Takeaways:
• SNARKs allow a prover to validate a witness without sending the full data, transforming computer programs into circuits to generate succinct proofs, though no current system optimizes prover speed, verifier speed, and proof size simultaneously 2:29-3:35, 3:40-4:46.
• Desirable SNARK properties include transparency (no trusted setup) and post-quantum security, both of which are determined solely by the choice of polynomial commitment scheme 4:57-6:35, 12:59-13:25.
• The standard paradigm involves a Polynomial IOP for handling the proof logic and a Polynomial Commitment Scheme for cryptographically hiding large polynomial coefficients, ensuring the verifier only accesses limited data 7:40-10:00, 10:06-11:00.
• A core technique encodes circuit transcripts into low-degree polynomials acting as "distance-amplified" encodings, allowing the verifier to catch errors by sampling very few points due to the Schwartz-Zippel Lemma 27:35-36:06, 43:00-46:10.
The speaker concludes by examining a field-agnostic SNARK variant that prioritizes prover speed and post-quantum security, despite generating larger proof sizes 24:10-26:08.
Sources:
Generate CPE Credits
Generate a professional CPE document from this video's transcript.
Estimated credit: 1.5 CPE hours
Estimate uses the video runtime (1 hour ≈ 1 CPE, rounded to the nearest 0.5, minimum 0.5, maximum 2.0). The final amount can be lower after review, never higher.
Topic: Cybersecurity. Commonly maps to: Security and Risk Management, Security Operations. Exact CISSP domains are assigned during generation.
Free account. One generation at a time, with a daily limit.
CPEBuddy is independent and not affiliated with or endorsed by ISC2, ISACA, or any certification body. Exports are formatted for common CPE submissions; acceptance is at your certification body's discretion.
Transcript Preview
First 800 characters of the transcript
so I'm going to kind of in this talk give a more technical in-depth uh overview of how snarks actually work kind of under the hood um but I do want to talk to be self-contained so uh I'm gonna spend the first maybe five or ten minutes just kind of recapping um kind of my the first two talks I gave at a16z um which were much higher level um they were also like a month ago so I don't expect anyone to actually remember on them so yeah 10 minutes sort of recapping and then kind of diving into um the details uh to give a sense of how this technology actually works okay so um yeah a reminder of what a snark is so in a snark I'm an untrusted prover claims to know a witness satisfying some property so like a simple and prototypical um setting here would be that um the prover claims to know a pre-i…