devcon 7 / how to do something to some state in some contract
Duration: 01:18:26
Speaker: José Pedro Sousa | zpedro
Type: Workshop
Expertise: Intermediate
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.
End-to-end internet games
For the past 1.5 years, I've been building fully onchain games–games where the entire state is onchain for some reason (have launched 7!). There is lots of cryptographic data floating around the internet. New primitives are allowing all this data to be interoperable with each other... and even verifiable on-chain. I'll discuss some of this tech (tls notary, app attest, zkml, etc.) and discuss what new wild games we can build with them.
Little Things We've learned About FHE
Recently, at PSE, we have been exploring the field of cryptography, specifically focusing on Fully Homomorphic Encryption (FHE). FHE enables secure interactions with encrypted data between different parties. In this presentation, we will introduce key concepts and essential information tailored for developers and application designers. This will help them quickly grasp the fundamentals without getting bogged down by complex mathematical details.
MPC Tooling or How to create MPC apps
Let's get into the state of the art of MPC development: we'll discuss different MPC schemes, current MPC tooling & how you can create MPC apps today. We'll cover the tech stack from a frontend level (e.g. MPC compilers) to a backend - and of course how we can combine them.
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.
Introduction to Multilateral Trade Credit Set-off in MPC
Multilateral Trade Credit Set-off is a process for collecting outstanding invoices from a network of firms and detecting cycles. A cycle is a circular pattern of due payments that connects businesses. Removing a cycle yields liquidity savings for the firms involved. This process is done by a central agency that collects the invoices and performs the netting. Instead, we leverage MPC to perform the set-ff while preserving the privacy of sensitive financial data of the firms
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).
Elliptic curves and SNARKs: past, present and future.
Elliptic curves are used in many proof systems. Some systems (e.g. Bulletproofs) use plain curves (e.g. ed25519). Some (e.g. Groth16, KZG-PLONK) use pairing-friendly curves (e.g. BLS12-381). Some recursive systems require pairing-friendly 2-cycle (e.g. MNT4/6) or 2-chains (e.g. BLS12-377/BW6-761). Some other recursive/folding systems require plain 2-cycle (e.g. Pasta). In this talk we will go through the difference between these curves and why there isn't a silver bullet curve for all scenarios.
Semaphore V4
Semaphore is a protocol enabling individuals to prove group membership and send messages (such as votes or endorsements) anonymously. The latest version enhances efficiency and simplifies the use of libraries and contracts. This presentation will cover the new features, project vision, and the importance and challanges of zero-knowledge technologies.