devcon 7 / circle stark gpu acceleration an analysis of performance and implementation
Duration: 00:22:21
Speaker: Daniel, Julian Arnesino
Type: Talk
Expertise: Beginner
Event: Devcon
Date: Nov 2024
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.
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.
Introduction to hash-based proof systems
Over the last decade, ZK has been gaining attention due to its applications in verifiable private computation and the scalability of blockchains. The development of general-purpose zkvms powered with STARK/hash-based proof systems have made writing provable applications simpler, abstracting developers from the details of ZK. In this talk, we will explain the basics of hash-based proof systems, different arithmetization schemes and how to prove computations without needing a trusted setup.
Folding STARKs with the Mova folding scheme
We will present a new folding scheme that is 5 to 10 times more efficient than Nova, and 2.5 to 4 times more efficient than Hypernova. We will then explain how to use the scheme so as to construct a folding scheme for STARK proofs.
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.
STARK proofs ELI5
Let's face it, ZK proofs are intimidating. But they don't have to be! ZK proofs are complex not because of the depth math they use, but because of the large number of fields of mathematics they leverage features from. In this talk, we'll break down STARK proofs into simple blocks and colorful analogies so that you get a good high level overview of how they work
The Supreme Ruler of the World
VK rules the world. ZK rules the world, too, like a straightedge wielded with eyes closed. Rulers rule in simple ways: by lining things up and by checking they're all in line. Bring your high school math to learn straightedges called SumCheck and SumCalc and begin to appreciate ZK in simple geometric terms. No moon math. We'll visit lines, cubes and polynomials, to see how they can be used to deduce and to generate, to check and to delegate.
Behind Zupass: Applied Cryptography For Consumers
Recent advancements in cryptography on consumer devices (like your mobile phone) and progress in developer tooling (Semaphore, SnarkJS) have led to the emergence of open-source projects such as Zupass, a personal "cryptographic computer" helping power Devcon. This talk dives into the technical challenges behind scaling ZKPs to 10,000+ consumer devices and the history behind the project, from its inception at Zuzalu to its usage at recent Ethereum events (Devconnect, ProgCrypto, ETHBerlin).
Scalable multi-party FHE with Phantom-zone
The talk introduces "phantom-zone", a framework to write scalable consumer facing MPC apps using multi-party FHE. Starting with what's multi-party FHE, talk gives a demo of non-trivial MPC app. Followed by introduction to programming model of MPC apps using multi-party FHE inside phantom-zone. Then the talk dives deep into primitives to realise multi-party FHE and ends with advanced FHE gadgets that further enhance multi-party FHE.
Privacy-Preserving Groups
This talk will explore the concept of privacy-preserving groups and the challenges associated with managing them. It will cover different ideas to add anti-sybil mechanisms to enhance group security and trust. The presentation will also highlight real-world projects working on it and provide practical use cases to illustrate their application and impact.