VDF, which stands for this verifiable delay function, the goal is to execute some delay function and also produce a proof that it was executed. So when the NOVA paper came out, there was a lot of interest in using it to realize a VDF because it provided a less expensive way than prior recursion schemes. The subject protocol is a powerful tool. It's an interactive proof. We do plan to implement hypernova, provide a reference implementation for it in the near future.
In today’s episode, Anna Rose and Nico Mohnblatt interview Srinath Setty, Principal Researcher at Microsoft Research and author of notable works such as Spartan, Nova, SuperNova, and HyperNova. This discussion covers Setty's early work and how this led to him working on SNARKs, folding schemes and sumcheck protocols, as well as his views on the future trajectory of the ZK space.
Given the current chatter around Nova-style accumulation schemes, this interview offers a chance to explore the perspective of a key contributor behind these developments.
Here’s some additional links for this episode:
- Pepper Project Publications
- Depot: Cloud storage with minimal trust by Mahajan, Setty, Lee, Clement, Alvisi, Dahlin, and Walfish
- Resolving the conflict between generality and plausibility in verified computation by Setty, Braun, Vu, Blumberg, Parno, and Walfish
- Proving the correct execution of concurrent services in zero-knowledge (extended version) by Setty, Angel, Gupta and Lee
- Replicated state machines without replicated execution by Lee, Nikitin and Setty
- Quadratic Span Programs and Succinct NIZKs without PCPs by Gennaro, Gentry, Parno and Raykova
- Pinocchio: Nearly Practical Verifiable Computation by Parno, Howell, Gentry and Raykova
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency by Valiant
- Succinct Non-Interactive Arguments via Linear Interactive Proofs by Bitansky, Chiesa, Ishai, Ostrovsky and Paneth
- Open VDF: Accelerating the Nova SNARK-based VDF Article
- Episode 274: SNARKs: A Trilogy with Ariel Gabizon
- ZK Study Club: Supernova Srinath Setty - MS Research
Check out the ZK Jobs Board here: ZK Jobs. Find your next job working in ZK!
Zero-knowledge is changing the world and until now, building ZK applications meant learning new, chain-specific languages and complex cryptography. But no more!
With SnarkyJS, the easiest to use zk SDK, developers can add the magic of zk to their apps using TypeScript!
Whether you're targeting Mina, the leading zk-native blockchain, or off-chain applications, SnarkyJS from O(1) Labs has you covered. With support for infinite recursion, in-browser proving, and so much more, the full power of zk is available to everyone.
Visit [snarkyjs.o1labs.org](snarkyjs.o1labs.org) to get started.
If you like what we do:
