01-30, 12:10–12:30 (Europe/Zurich), Beam Stage
In this talk, we explore several efficiency aspects at the interplay between the technical features of zero-knowledge cryptographic primitives and the architectural needs of building a layer 2. We tackle questions such as when to choose Plonk, Groth16 or FRI, and whether one can combine the advantages of these seemingly competing proof systems in order to efficiently support features such as proof aggregation. We also dive into several low-level aspects of the Linea L2, from the workings of the polynomial commitments to the design of efficient PIOPs.
This is a high level talk, but with several in-depth explorations of specific use-case scenarios of zero-knowledge proof systems.
We go over the pros and cons of Plonk, Groth16 and FRI-related cryptographic primitives, and explain how these can be combined in order to achieve various performance/economic features of the L2.
If time allows, we will also briefly describe the properties of upcoming lattice-based proof systems.
Bogdan is a researcher in cryptography at Consensys, where he works on efficient arguments of knowledge for the Linea layer 2, with a focus on both research and engineering aspects. In Spring 2023, he obtained his PhD in Computer Science from ETH Zurich. During his PhD, his main research interests were on foundational cryptography, mainly focused on zero-knowledge, but also delving into topics such as advanced encryption primitives and signatures.