PLONK - Permutations Over Lagrange-Bases for Oecumenical Noninteractive Arguments of Knowledge

Explore the PLONK (Permutations over Lagrange-Bases for Oecumenical Noninteractive arguments of Knowledge) protocol in this 37-minute lecture by Ariel Gabizon from Protocol Labs. Dive into the components of recent universal SNARKs, focusing on probabilistically checkable and interactive proof systems. Learn about Plonk in two sips, copy checks with permutations, and the Bayer-Groth12 method for reducing permutation checks to products. Examine idealized polynomials protocols, H-ranged polynomials protocols, and their applications in checking permutations and products. Gain insights into the latest developments in cryptographic proof systems and their potential applications in blockchain technology and privacy-preserving computations.

Intro
Plonk in two sips
Copy checks with permutations
[Bayer-Groth12] - perm checks with products
Bayer-Groth12 - reducing permutation checks to products
Idealized Polynomials Protocols
H-ranged Polynomials Protocols
H-ranged protocol using polynomial protocol
Checking permutations with H-ranged protocols
Checking products with H-ranged protocols