ไม่สามารถเล่นวิดีโอนี้
ขออภัยในความไม่สะดวก
ZK Whiteboard Sessions - Module One: What is a SNARK? by Dan Boneh
ฝัง
- เผยแพร่เมื่อ 19 ส.ค. 2024
- Full playlist here: • ZK Whiteboard Sessions
_______
In the first Module of our introductory series, we learn about the initial set of building blocks in zero knowledge - a SNARK and how different proving systems work. We will cover what a SNARK is, how they are used and how they are built. This is the first of 3 modules by Dan Boneh - Professor of Computer Science and Electrical Engineering, Stanford University.
Visit the website to find the reading list for this module: whiteboard.zkh...
_______
ZK Whiteboard Sessions is a weekly educational video series focused on the building blocks of ZK. Produced by ZK Hack and powered by Polygon. Add your email to our mailing list to be notified - whiteboard.zkh...
Follow along with the series:
- Join the conversation on Discord: / discord
- Twitter: @__zkhack__
- Website: whiteboard.zkh...
Very good. Consider this succinct presentation verified.
Dan Boneh is the best cryptography teacher of all time
This is the best video for developers starting out with Zero knowledge systems! Thank you !!!!
Clear as water! 👌
Much appreciate the clear delivery, Prof. Dan Boneh.
Still have no idea how can this work, but at least I got the intuition how it works, thank you !
Very informative
This was great!
this is seriously good
Thank you very much for these clear explanations.
very informative
very good
BTW, Snark was also an inference engine by Jean-Louis Laurière in the 1980s. He published papers in *Artificial Intelligence* about it.
wow this is wild lol
Good video
Awesome
Great
Nyse
can we define knowledge soundness (33:40) as "Pr[V(Sv, x, pi) = accept] - Pr[C(x, w) = 0] > epsilon" for some negligible epsilon? I think it would kind of make things a bit clearer, informally too: the probability that you can fool the verifier for some witness w must be at most negligibly different than the probability that this witness w is a valid witness for the circuit.
We are running a Study club around the video in the ZK Hack discord- join us here discord.gg/DSmBbcZHHq
@18:33 what does it mean logarithmic in size of n ?
What is logarithmic size ?
en.wikipedia.org/wiki/Time_complexity#Logarithmic_time
Why does the Prover have to read the entire circuit as mentioned at 26:21? The input to the Prover is *not* the Circuit C directly, but rather S_p, x & w. Circuit C is required to produce S_p & S_v instead. Am I missing something?
The prover will need to process the entire circuit even after knowledge of S_p, otherwise he cannot create the proof. S_p and S_v are in some way compression of the circuit. Role of S_p is to reformulate the answer that the circuit processing gave in such a way that verifier can use S_v to make meaning.
Is it correct that an Extractor can not extract a witness in a Zero Knowledge SNARK? Seems like that would defeat the purpose of ZK
We had the same question - maybe join the ZK Hack discord and ask in the ZK Whiteboard group discord.gg/JZRwf4C39B
The extractor is a “fictional” algorithm, in that it has some extra powers (cooperation from the prover or setup) that won’t exist in a real setting. So you get to have your cake and eat it too, arguing knowledge while maintaining zero knowledge.
Gm
Gm
@piotrros wrong, no such thing as interesting or fx or etc or not, cepuxuax, say, can say any nmw and any s perfect