ZK Whiteboard Sessions - S2M7: FRI and Proximity Proofs (Part.1) with Dan Boneh скачать в хорошем качестве

ZK Whiteboard Sessions - S2M7: FRI and Proximity Proofs (Part.1) with Dan Boneh

Full ZK Whiteboard Sessions - Season 1 playlist here:    • ZK Whiteboard Sessions - S1   Full ZK Whiteboard Sessions - Season 2 playlist here:    • ZK Whiteboard Sessions - S2   — In this module (Part.1), Prof. Dan Boneh, applied cryptography and computer security professor at Stanford University, provides a comprehensive overview of FRI (Fast Reed-Solomon Interactive Oracle Proofs of Proximity) and its foundations in cryptography. Prof. Boneh begins with essential background on linear codes and Interactive Oracle Proofs (IOPs), then demonstrates how to compile a Polynomial-IOP into a SNARK using Reed-Solomon IOP of Proximity, before diving into distance preserving transformations with detailed examples of batch RS-IOPP and folding. What you’ll learn: 0:00:00 Introduction and What is FRI? 0:01:45 Background on Linear Codes 0:13:40 ↳ The classic MDS Code: Reed-Solomon 0:21:10 Background on IOPs 0:25:12 ↳ IOP to SNARK: the BCS compiler 0:28:42 ↳ IOP of Proximity 0:33:53 Compiling a Poly-IOP to a SNARK using a Reed-Solomon IOP of Proximity 0:40:42 ↳ Quotienting 0:46:05 ↳ Poly-IOP to IOP 0:56:50 Distance Preserving Transformations 0:58:20 ↳ Example 1: Batch RS-IOPP 1:00:20 ↳ The BCIKS Proximity Gap Theorem 1:04:30 ↳ Example 2: Folding 1:16:00 Summary of Part 1 Below is an accompanying reading list: Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Eli Ben-Sasson, Iddo Bentov, Yinon Horesh and Michael Riabzev, 2018): https://drops.dagstuhl.de/entities/do... Worst-case to average case reductions for the distance to a code (Eli Ben-Sasson, Swastik Kopparty and Shubhangi Saraf, 2018): https://www.math.toronto.edu/swastik/... DEEP-FRI: Sampling Outside the Box Improves Soundness (Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, and Shubhangi Saraf, 2019): https://eprint.iacr.org/2019/336 Proximity Gaps for Reed-Solomon Codes (Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, and Shubhangi Saraf, 2020): https://eprint.iacr.org/2020/654 Circle STARKs (Ulrich Haböck, David Levit and Shahar Papini, 2024): https://eprint.iacr.org/2024/278 STIR: Reed–Solomon Proximity Testing with Fewer Queries (Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, and Eylon Yogev, 2024): https://eprint.iacr.org/2024/390 WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification (Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, and Eylon Yogev, 2024): https://eprint.iacr.org/2024/1586 Brakedown: Linear-time and field-agnostic SNARKs for R1CS (Alexander Golovnev, Jonathan Lee, Srinath Setty, Justin Thaler and Riad S. Wahby, 2021): https://eprint.iacr.org/2021/1043 Orion: Zero Knowledge Proof with Linear Prover Time (Tiancheng Xie, Yupeng Zhang, and Dawn Song, 2022): https://eprint.iacr.org/2022/1010 BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes (Hadas Zeilberger, Binyi Chen and Ben Fisch, 2023): https://eprint.iacr.org/2023/1705 Blaze: Fast SNARKs from Interleaved RAA Codes (Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum and Hadas Zeilberger, 2024): https://eprint.iacr.org/2024/1609 — ZK Whiteboard Sessions is a weekly video educational series focused on the building blocks of ZK. Season 2 is presented by ZK Hack and supported by a grant from the ZK Grants Round 2024, a grant initiative that was co-funded by the Ethereum Foundation, Aztec, Polygon, Scroll, Taiko, and zkSync. Add your email to our mailing list to be notified - https://whiteboard.zkhack.dev Help us improve and translate the subtitles in your language: https://github.com/ZK-Hack/zk-whitebo... Follow along with the series: Join the conversation on Discord:   / discord   Twitter:   / __zkhack__   Website: https://whiteboard.zkhack.dev/