devcon 7 / from bottlenecks to breakthroughs optimizing zkevm provers
- YouTube
- Details
From Bottlenecks to Breakthroughs: Optimizing zkEVM Provers
Duration: 00:23:15
Speaker: Leo Jeong
Type: Talk
Expertise: Intermediate
Event: Devcon
Date: Nov 2024
In this session, we introduce how we optimized zkEVM provers in production to significantly reduce prover costs, a major expense in running zkEVM. Topics include diagnosing zkEVM bottlenecks using CPU and memory profiling, leveraging DAGs for parallelization, and efficient memory management with a memory pool, fine-tuned garbage collection, and in-memory swapping for gigantic memory usage. These optimizations reduced zkEVM prover runtime by 75%, representing a substantial performance gain.
- Related
Devcon
Talk
25:18
Beyond Ligero and Brakedown: Building a Fast Prover Based on List-Polynomial Commitments
Linear codes underlie one of the main approaches in zero-knowledge proofs and arguments, including works like FRI, Ligero, Brakedown and Orion. In this talk, we describe how to extend one of the protocols from Ligero and Brakedown to the regime of batched polynomial commitments, at the cost of a single extra operation in the verifier. Similarly to Redshift, we opt for increased efficiency via the list decoding regime. We also present an optimisation for using the resulting commitment with PIOPs.
Devcon
Talk
25:17
Keynote: Programmable Cryptography and Ethereum
Programmable Cryptography is a "second generation" of cryptographic primitives - primitives that allow arbitrary programs to be executed "inside of" or "on top of" cryptographic objects. Programmable cryptography provides three key affordances that complement and amplify the affordances of Ethereum--verifiability, confidentiality, and non-interactivity. We'll discuss how these technologies can reshape the Internet over the next 50 years.
Devcon
Talk
27:30
Leveraging High-Performance Computing for Efficient STARK Provers
Zero-Knowledge Proof (ZKP) protocols' applicability hinges on the prover's ability to efficiently generate proofs. This talk explores the computational aspects affecting ZKP performance, specifically focusing on STARK provers. We will analyze performance across high-performance and standard computing architectures and interpret results by examining key workload characteristics. From this understanding, we can project ZKP capabilities in future scenarios.
Devcon
Talk
19:46
Keynote: The Universal Cryptographic Adapter
The "secret" third affordance of Zero-Knowledge proof after 1) Privacy and 2) Succinctness is Interoperability. ZK enables us to continuously refactor data, aggregate it from different sources, and transforming it without loosing its integrity. Starting with the Zupass project, and now with the broader adoption of the POD and GPC format, 0xPARC has been exploring using ZK for data sovereignty and creating more interoperable data ecosystem. We will cover our learnings and progress in this talk.
Devcon
Talk
17:31
Multiparty Homomorphic Encryption from Ring-Learning-with-Errors
This talk will introduce Ring Learning with Errors (RLWE) based Multiparty Homomorphic Encryption (MHE).
Devcon
Talk
25:30
Keynote: The REAL state of L2s
The evolution of Layer 2 solutions has been pivotal in scaling blockchain technologies. This talk, led by L2BEAT founder Bartek Kiepuszewski, delves into the current landscape, recent advancements, and future potential of L2 ecosystems. It will try to address some myths and current challenges of the space. Some important changes to L2BEAT risk framework will also be announced.
Devcon
Talk
25:17
Digital pheromones: MPC for human connection & coordination
Recent MPC research from Cursive and PSE enables a new concept called "digital pheromones": the ability to produce lightweight, privacy-preserving signals that people can use to coordinate safely and efficiently. The primary result we will cover is Trinity, a new 2PC scheme with nearly ideal UX/DevX, built on the trio of PLONK, Garbled Circuits, and KZG Witness Encryption. We will do a live demo with attendees and explore what a future filled with digital pheromones will enable!
Devcon
Talk
26:33
Security of Fiat-Shamir transformation
Fiat-Shamir transformation underlies virtually every SNARK used in the Ethereum ecosystem as it makes interactive proofs non-interactive. In this talk, we discuss the security issues if the transformation is used incorrectly (e.g., parallel repetition of a ZKP defined over a small field; such protocols became very popular thanks to their efficiency), provide examples, show the security loss that the transformation brings, and the concrete security of ZKP. Finally, we discuss best practices for k
Devcon
Talk
24:31
Wizard: build your own P-IOP protocol in 15 min!
Wizard is a new open-source framework allowing you to write your own ZK proving scheme. Wizard is one of the backbones of Linea zkEVM's prover and it can be used to implement advanced protocols easily. In this session I will guide you through an implementation of Plonk using just a few lines of code.
Devcon
Talk
25:25
Programmable Cryptography and the future of the Internet
You rarely hear of issues at the networking layer of the Internet: networking companies are running utilities business: they are fungible and can be swapped if distrusted. Most of the value captured on the Internet -- and also most abuse -- happen at the Compute and Data layer of the Web. Ethereum gave us a glimpse of a fundamentally different architecture for Compute and Data than Client/Server architecture.We think the Internet is 1/3 complete, and that programmable cryptography can finish it.