ZK Whiteboard Sessions - Module One: What is a SNARK? by Dan Boneh

Ғылым және технология

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.zkhack.dev/module-...
_______
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.zkhack.dev
Follow along with the series:
- Join the conversation on Discord: / discord
- Twitter: @__zkhack__
- Website: whiteboard.zkhack.dev/

Пікірлер: 29

  • @wangscarpets9735
    @wangscarpets9735 Жыл бұрын

    Very good. Consider this succinct presentation verified.

  • @taopaille-paille4992
    @taopaille-paille4992 Жыл бұрын

    Dan Boneh is the best cryptography teacher of all time

  • @zkmalik
    @zkmalik Жыл бұрын

    This is the best video for developers starting out with Zero knowledge systems! Thank you !!!!

  • @asmitadhungana3790
    @asmitadhungana3790 Жыл бұрын

    Clear as water! 👌 Much appreciate the clear delivery, Prof. Dan Boneh.

  • @roshanparajuli
    @roshanparajuli Жыл бұрын

    This was great!

  • @yongkangchia1993
    @yongkangchia1993 Жыл бұрын

    this is seriously good

  • @tonnytrumpet734
    @tonnytrumpet7345 ай бұрын

    Still have no idea how can this work, but at least I got the intuition how it works, thank you !

  • @plusplus4591
    @plusplus45914 ай бұрын

    very good

  • @SimohammedBenjanoui
    @SimohammedBenjanoui6 ай бұрын

    Very informative

  • @thomasmarchand2894
    @thomasmarchand2894 Жыл бұрын

    Thank you very much for these clear explanations.

  • @martin-lee168
    @martin-lee168 Жыл бұрын

    Good video

  • @blockchainprogrammer
    @blockchainprogrammer9 ай бұрын

    very informative

  • @hhh-pc7cm
    @hhh-pc7cm Жыл бұрын

    Awesome

  • @xuansangha3885
    @xuansangha38858 ай бұрын

    Great

  • @basilestarynkevitch2421
    @basilestarynkevitch2421 Жыл бұрын

    BTW, Snark was also an inference engine by Jean-Louis Laurière in the 1980s. He published papers in *Artificial Intelligence* about it.

  • @itswazowski

    @itswazowski

    9 ай бұрын

    wow this is wild lol

  • @faiqkhan7545
    @faiqkhan7545 Жыл бұрын

    @18:33 what does it mean logarithmic in size of n ? What is logarithmic size ?

  • @byblos94

    @byblos94

    Жыл бұрын

    en.wikipedia.org/wiki/Time_complexity#Logarithmic_time

  • @ErhanTezcan
    @ErhanTezcan Жыл бұрын

    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.

  • @zeroknowledgefm

    @zeroknowledgefm

    Жыл бұрын

    We are running a Study club around the video in the ZK Hack discord- join us here discord.gg/DSmBbcZHHq

  • @AdarshKumar-vy8tp
    @AdarshKumar-vy8tp Жыл бұрын

    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?

  • @rohittripathy4856

    @rohittripathy4856

    11 ай бұрын

    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.

  • @user-zc7hz3vp8l
    @user-zc7hz3vp8l6 ай бұрын

    Nyse

  • @ebaizel
    @ebaizel Жыл бұрын

    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

  • @zeroknowledgefm

    @zeroknowledgefm

    Жыл бұрын

    We had the same question - maybe join the ZK Hack discord and ask in the ZK Whiteboard group discord.gg/JZRwf4C39B

  • @beback_

    @beback_

    Жыл бұрын

    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.

  • @portport
    @portport Жыл бұрын

    Gm

  • @user-yd2jz5gn7j

    @user-yd2jz5gn7j

    3 ай бұрын

    Gm

  • @zes7215
    @zes7215 Жыл бұрын

    @piotrros wrong, no such thing as interesting or fx or etc or not, cepuxuax, say, can say any nmw and any s perfect

Келесі