https://dinfra.xyz

d/Infra SummitA one-day summit uniting builders and researchers of trust-minimized and decentralized infrastructure. February 27th, 2024. Denver, CO.d/Infra Summit A one-day summit uniting builders and researchers of trust-minimized and decentralized infrastructure. February 27th, 2024. Denver, CO. Watch Program Redefining Trust-Minimized Innovation We build in the spirit of d/acc, a concept pioneered by Vitalik Buterin in his take on “Techno-optimism,” and from which our event takes its namesake. Join us in exploring new approaches to trust-minimized, decentralized, resilient, and defensive digital infrastructure. The summit will focus on a diverse spread of topics, including core technologies such as zero-knowledge proofs, multi-party computation, fully homomorphic encryption, distributed systems, consensus algorithms, as well as individual-empowering infrastructures such as light clients and account abstraction. In the spirit of d/acc, we advocate for the advancement and adoption of these cutting-edge innovations that enable decentralization and trust-minimization. Speakers Vitalik Buterin Ethereum (Virtual Attendence) Ryan Cao Modulus Labs Ben Fisch Espresso Systems & Yale Jim Posen Ulvetanna Aniket Kate Purdue University & Supra Oracles Roman Dvorkin Fireblocks Josh Bowen Astria Daniel Olshansky Grove Inc. & Pocket Network Nichanan Kesonpat 1kx Ahmed Al-Balaghi Biconomy John Ennis Safe Adam Egyed Alchemy Valeriy Zamaraiev 1kx Michael Rosenberg University of Maryland Ismael Hishon-Rezaizade Lagrange Pascal Paillier Zama Dominik Schmid Polygon Miden Bobbin Threadbare Polygon Miden Porter Adams Matter Labs Derek Rein WalletConnect Remi Gai Inco Network Shumo Chu Nebra Miguel de Vega Nillion Wei Dai 1kx Denis Firsov Matter Labs Leo Fan Cysic Brian Retford RiscZero Roman Walch TACEO Koh Wei Jie Geometry Research Tal Derei Penumbra Labs and Lehigh University David Garrett Fabric Cryptography Michael Gao Fabric Cryptography Boyu Sun Snarkify John Bartlett Snarkify Pranay Valson Covalent Chris Cassano Lit Protocol Herbert Chang Event Schedule February 27th, 2024 Talks & Panels Time Speaker Title 9:00AM Organizers Opening Remarks zkSNARKs 9:10AM Jim Posen (Ulvetanna) Binius: A Hardware-Optimized SNARK Abstract. Binius is a novel succinct argument (SNARK) constructed over towers of binary fields. The core innovation is a new polynomial commitment scheme where committing to field elements as small as single bits is no more expensive than committing to the same amount of information represented with larger field elements. We expect that a complete implementation of Binius will achieve an order of magnitude or better improvement in prover performance over popular proof systems currently in use, even though using 64- or 32-bit fields like starky and RISC Zero, because of its unique ability to efficiently arithmetize bitwise operations. This approach shines especially for the critical use case of verifying classic and widely deployed hash functions like Keccak-256 and SHA-256. Efficient arithmetization of traditional hash functions unlocks the recursion composition of Binius proofs without relying on less battle-tested and slower arithmetization-optimized hash functions like Poseidon. This talk covers the fundamental ideas behind Binius and a performance comparison of Ulvetanna's software and hardware implementations of primitive SNARK operations in Binius with the analogous operations in prime field-based SNARKs. 9:30AM Michael Rosenberg (UMD) HEKATON: A Horizontally Scalable zkSNARK Abstract. Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs) have great potential for a wide range of applications. However, existing zkSNARKs face barriers in prover time, space complexity, and structured reference string (SRS) size, making them impractical for use in real-world scenarios with large computations. In this work, we introduce HEKATON, a zkSNARK that overcomes these barriers and can efficiently handle arbitrarily-large computations. HEKATON can operate across diverse computing environments, from single-core low-memory devices to large compute clusters, and has an SRS size that scales sublinearly relative to the computation being proved. Concretely, HEKATON can prove computations of size 2^35 gates in under an hour on a powerful cluster, and can prove computations of size 2^32 gates in under 10 hours on a low-memory desktop-class machine. 9:50AM Ryan Cao (Modulus) Production-Scale ZKML: Verifiable Decision Forest Inference Abstract. We present the largest ever instantiation of ZKML in production via GKR proving of large-scale decision forest inference for verifiable NFT price oracles, in collaboration with Upshot. Through a combination of dataparallel GKR over a structured improvement to [ZFZ+2020]'s circuit, we are able to create GKR proofs for a decision forest of 128 trees, each of height 9, over a set of 128 inputs, each with 64 features, in under 54 seconds. Notably, this represents a per-tree-per-sample inference time of just over 0.003s, representing a mere 150x prover-side blowup with respect to running the computation on CPU! 10:10AM Ismael Hishon-Rezaizadeh (Lagrange) Recproofs: Digest Translation for Efficient Verifiable Queries over Blockchain Data Abstract. In this talk we discuss the application of RecProofs, a Merkle-based vector commitment that computes a batch proof of a subset of k leaves in a Merkle tree of an arbitrary arity using recursive SNARKs. Our construction folds the computation of the subset hash inside the computation of Merkle verification via canonical hashing. The proof can be efficiently updated whenever either the leaves I or set M changes. Updatable proofs find applications in the blockchain space when a proof needs to be computed and efficiently maintained over a moving stream of blocks (e.g., moving average). In our updated benchmarks, we show that our approach significantly outperforms previous approaches in terms of updates and due to its naturally parrelizable nature also outperforms other approaches in terms of aggregation time. In this talk, we will also discuss recent innovations that extend RecProofs to Merkle Patricia tries. We’ll present new benchmarks for digest transformations, an emerging solution where a cryptographic proof argues that the Merkle digests C1 and C2 computed using hash functions H1 (e.g., SHA-2) and H2 (e.g., Poseidon), respectively, corresponds to the same n values, which can change over time.  Our benchmark argue that in the blockchain context computing over large numbers of storage slots can be done with lower aggregation time through first using digest translation as a preprocessing step. Preprocessing with digest translation removes the need for continually computing over ZK unfriendly hash functions (e.g., Keccak) and serializations (e.g., RLP encodings) when working with frequent queries over the same dataset. The benchmarks we present will demonstrate this approach both for onchain variables of large ranges of historical blocks and onchain mappings. 10:30AM Break (10min) Light Clients & Trust-Minimized RPCs 10:40AM Roman Dvorkin (Fireblocks) Building a Trustless Light Client Assistant in Your Browser Abstract. Ever wondered about the accuracy of Etherscan balances? Questioned an online token price? We often say “Don’t trust, verify”, but centralized data sources continue to be trusted by most. Light clients, while not widely understood by the public, have matured beyond theoretical concepts and are ready for practical use. Implementing light clients can address significant trust challenges in our ecosystem, as we demonstrate in an open-source solution based on light client technology we developed. In the process of building this solution, we tried available light client implementations, fixed bugs in them, collaborated with the dev teams and pushed for further standardization and improvements. This experience has revealed the great potential of light clients, and how by incorporating them into applications we can enable use cases that seem almost magical. In this talk we share practical insights gained along the way, aiming to inspire more people to build with light clients. 11:00AM Daniel Olshansky (Grove & POKT) Relay Mining through Decentralized Gateways Abstract. A Remote Procedure Call (RPC) between an Application and API Gateway relies on trust assumptions. The subsequent RPC between an API Gateway and the backing service relies on performance and integrity guarantees. When request counts reach the scale of hundreds of millions, or billions, they cannot be all stored on-chain. Relay Mining provides a solution that leverages cryptographic attestation and probabilistic guarantees to align incentives on how RPC requests can be rolled up to scale and serve billions of RPC requests. Alongside it, trust delegation across a decentralized set of gateways provides more optionality on how this network is accessed. 11:20AM Pranay Valson (Covalent) Ethereum Wayback Machine: Unfettered access to historical transaction data in a post-rollup & post-dank sharding world Abstract. We propose the Ethereum Wayback Machine (EWM), a protocol for verifiable access to blockchain data. The EWM is a set of open‐source specifications, source code and data artifacts for programmatic access to historical, archival transaction data without centralized rent‐seeking intermediaries. As Ethereum moves towards a rollup‐centric roadmap, there has been a proliferation of rollup technologies and applications atop, enabled by the increased execution and throughput limits of rollups. The new limits in effect lead to an increase in the state growth, making way for technologies like data availability protocols and others to combat the state growth. In this new world, access to historical data becomes harder, less secure and more centralized. The EWM as a component of the Covalent Network is the indispensable ally in ensuring long‐term data availability of blockchain transaction data. 11:35AM Valeriy Zamaraiev (1kx) Accounting and Settlement in Distributed Systems Abstract. With the proliferation of blockchain infrastructure projects, especially DePIN projects, accounting and settlement (often also called billing) in permissionless distributed systems has become a key design question for many 1kx portcos. We discuss the dimensions of this design space, including p2p vs p2n, settlement timelines, possible non-determinism, security assumptions, decentralization, compatibility and interoperability. We also present the concept of hierarchical accrual and discuss how it can help scale accounting in distributed systems. Consensus & Shared Sequencing 11:50AM Ben Fisch (Espresso & Yale) Mechanism design for decentralized shared sequencing Abstract. Decentralized shared sequencing is the d/acc vision for Ethereum's rollup-centric future. Rollups have brought massive improvements to the user experience on Ethereum, but in many ways at the sacrifice of security. Transactions on rollups are cheaper with near instant confirmations, however, this has come along with, and is partly due to, reliance on centralized sequencers. Rollups are also fragmenting the liquidity and interoperability of Ethereum applications. The lack of native interactions between applications across different rollups has lead to increased reliance on custodial bridging services and has amplified the security risks of reorgs. Decentralized shared sequencing promises to fix this, increasing security and interoperability among rollups, but faces one tough hurdle: incentivizing rollups to join it. This is a conundrum in many cases of d/acc technology, where the greatest benefits to social welfare are realized as an emergent property of mass adoption, but the immediate incentive to first-movers is more abstract (e.g., green energy, cybersecurity best practices, pandemic defenses, responsible AI). In the case of decentralized shared sequencing, strong network effects mean early and late joiners face very different economic decisions. Early rollup adopters need to be convinced they are generating greater revenue using the shared sequencer than operating their own, whereas later stage adopters may find it impossible to attract users without joining. In this talk we will present on an economic mechanism for shared sequencing designed to address these issues. 12:10PM Josh Bowen (Astria) Shared Sequencers are Incentivized Relays Abstract. In this talk we'll give a high-level overview of the design of Astria's Shared Sequencer Network, the properties it provides, and the similarities between it and a theoretical network of incentivized PBS/MEV relays. We'll build a first principles understanding for why Astria’s network is designed the way it is and the various tradeoffs we've made for both business and technical reasons. We’ll discuss the open questions that must be solved by the burgeoning modular ecosystem, the ways we believe Astria solves some of these, and the problems which we’ve explicitly defined as non-goals for the Astria network. Attendees are assumed to already have a high level understanding of both rollups and the current structure of the Ethereum L1 PBS/MEV supply chain. 12:30PM Lunch Break (50min) zkSNARKs, Part II 1:20PM Denis Firsov (Matter Labs) How do we use formal methods to harden ZK-rollups Abstract. ZK-Rollups hold the promise of enhancing blockchain scalability without compromising security. However they are built on top of intricate cryptographic protocols and complex smart contract logic. Their security crucially hinges on the proof-system verifier, which should not accept any wrong proof (the soundness property), but also relies on implementing a correct VM semantics to secure smart contracts on L1. Convincing ourselves of the security of such a complex system is a daunting task but with the right methodology and tools we can formally verify many critical components and make the rest at least formally verifiABLE (eventually one day). 1:40PM David Garrett (Fabric) Designing a Verifiable Processing Unit (VPU): a case study in hardware software codesign Abstract. The VPU is a general-purpose, massively parallel processor for cryptography, including zkSNARKs, zkSTARKs, and FHE. It’s built with the FC100, an ASIC designed with our custom instruction set architecture for diverse cryptographic workloads. By optimizing for large-integer prime field math, and including the capability to move large amounts of data, the VPU is designed to handle the rapidly evolving landscape of cryptography. This talk dives into how HW/SW codesign works and best practices learned from designing AI chips for accelerating similarly diverse workloads. Fabric’s design process puts the hardware, software, and cryptography teams together in a common framework to optimize the entire problem, and it lays the groundwork to map any of the future cryptography workloads to the VPU. 2:00PM Wei Dai (1kx, Moderator), Herbert Chang, Michael Gao (Fabric), Leo Fan (Cysic), Brian Retford (RiscZero) Panel: ASICs and Cryptography — The Past, Present and Future Account Abstraction 2:40PM Derek Rein (WalletConnect) Redefining the Signing Experience through Session Keys Abstract. Session Keys will play a crucial role in improving dapp usability, such as skipping confirmations while the user is online (sign once and make many interactions in a game), and executing transactions while the user is offline (DCA or automated NFT mints). By issuing temporary keys limited in time and scope, we also reduce the blast radius of potential attacks while providing an anxiety-free UX for users. In this session we will cover how this can work in action via offchain session management and a new standard we are pushing to usher in the era of Session Keys. We will also compare this approach to session management with account modules and welcome discussion here. Disclaimer: some of this can also be done for EOAs which we are exploring but the talk focus is on Session Keys for Smart Contract Accounts. 3:00PM Itai Turbahn (Dynamic) The crypto-enabled company Abstract. We are in the midst of a revolution. For the first time since the start of crypto as an industry, we are witnessing the rise of a technical stack that is will make every company a crypto-enabled company. Through new and improved technical tools, companies can create incredible new experiences that combine fintech, social interactions, and loyalty, all without users ever knowing they are leveraging crypto rails. Whether it’s global contractor payments, cross-app “venmo-like” platforms, access to previously illiquid assets, social-financial apps and games, ticketing platforms or physical-digital experiences, there are a myriad of experiences that developers are now able to easily build. Through simple crypto rails, founders can abstract away the financial and identity parts of their stack, focusing instead on customer experience, compliance and growth. In this talk, I want to describe a few use cases we are seeing from our vantage point at Dynamic. We see this revolution happen today in the form of new types of startups that deliver magical experiences while abstracting away crypto. We are also seeing seedlings of web2 companies identifying this stack, and starting to think through incorporating crypto elements in their tech start through these tools. 3:20PM Nichanan Kesonpat (1kx, Moderator), Ahmed Al-Balaghi (Biconomy), John Ennis (Safe), Adam Egyed (Alchemy) Panel: On Building Modular Smart Accounts: Key Learnings and Design Considerations Abstract. Modular account abstraction allows developers to build self-contained components that extend the functionality of the user’s account, turning wallets into platforms for innovation and new distribution channels for web3 products and services. This panel will discuss the key learnings and ongoing challenges in building an module ecosystem that is secure, extensible, and interoperable. We will hear from Safe who has the most mature modular account implementation in production, and co-authors of emergent modular account standards EIP-6900 and EIP-7579. 4:00PM Break (10min) MPC & FHE 4:10PM Pascal Paillier (Zama) Threshold TFHE and its application to blockchain Abstract. In this talk we first present the specific TFHE homomorphic encryption scheme. This scheme is unique in supporting lookup tables, but also raises some challenges when turning it into a threshold version. We present solutions to these challenges, including a robust secret sharing scheme that works efficiently over rings in order to realize a threshold version of TFHE and proofs of knowledge for proving correct encryptions. A solution to these challenges is required for building a confidential blockchain using homomorphic encryption. Finally, we talk about the additional steps required for using a threshold decryption protocol securely in a blockchain application and the remaining open problems, including preventing share leakage. 4:30PM Aniket Kate (Purdue University & Supra Oracles) Building Threshold Cryptosystems & MPC Applications over Blockchains Securely Abstract. Many threshold cryptosystems (or MPC) in practice rely on broadcast channels for security and termination. A broadcast channel can only be built over point-to-point synchronous channels (and not otherwise). However, the Internet cannot be considered to be synchronous for latency-sensitive MPC applications such as distributed random beacons and threshold wallets. Some contemporary solutions leverage blockchains as broadcast channels. However, blockchains (i.e., state machine replication (SMR) systems) only ensure that any two honest parties store the same prefix of messages in their logs. This makes blockchain unsuitable as true broadcast channels. Indeed, some validators can force an honest sender's message to not appear on a blockchain in time. This talk advocates an alternative but natural design approach for building MPC. Thanks to recent tremendous growth in the blockchain space, we now have SMRs that offer sub-second latency and throughput beyond 100K msg/sec. We propose to employ blockchains for building MPC solutions; however, we treat blockchains as SMRs and not as broadcast channels. The talk will first focus on publicly verifiable secret sharing (PVSS), which is highly suitable for this setting. We will then demonstrate how the PVSS and SMR combination allows us to develop distributed key generation for ECDSA, EdDSA, and BLS signatures. As we need MPC capability for threshold ECDSA/EdDSA signatures, we will then present how to build these solutions using threshold additive-homomorphic encryption as a gadget. Finally, we will discuss the vision and challenges of converting any broadcast-based MPC to one using an SMR. 4:50PM Miguel de Vega Rodrigo (Nillion) Wavelet-based Function Secret Sharing for LLMs: A New Approach to Approximate Lookup Table Methods Abstract. The private evaluation of complex public nonlinear functions can be achieved by sampling them in a lookup table (LUT) and performing an inner product with a private one-hot vector, which leads to simpler cryptographic protocols. In a 2-party MPC setting, function secret sharing (FSS) can efficiently compress the additive share of a 2^n bit one-hot vector down to O(n) bits. However, this approach incurs the cost of O(2^n) pseudo-random generator calls, setting a practical limit on n at around 20 bits. Some applications, notably private Large Language Model (LLM) inference, do not require an exact representation of the LUT. Wavelet theory is a well-known digital signal processing technique that represents samples of a function at different resolution scales. One of its applications is compression (e.g. it is part of JPEG2000), but it is rarely seen in cryptography. We introduce the use of wavelets to approximate and compress LUTs, significantly reducing the size of the required one-hot vector. We illustrate their use in 2PC FSS and show how they can potentially reduce both communication and computational complexity in private LLM inference scenarios. Moreover, our technique is complementary to standard FSS methods. 5:10PM Roman Walch (TACEO) Large-Scale MPC: Decentralized Iris Code Membership Abstract. Proof of Personhood is one of the core ideas behind the Worldcoin project. An integral part of this proof is the biometric uniqueness service where an iris code is checked against many others stored in a centralized database. However, iris codes could be reversible to an image that resembles a human eye which would infringe privacy of individuals. Furthermore, the centralized database holder could abuse the power to censor individuals, since it alone controls the database that new signups are compared to. Consequently, one requires to trust the central entity to not misuse its database. In this project we explore efficient methods to decentralize the database of existing iris codes using Multiparty computation (MPC), significantly improving privacy and censorship resilience. The main challenge with an MPC-based iris code membership protocol stems from 1) mixed operations over both larger rings and bits for hamming distance calculation and threshold comparisons and 2) the large database (3+ million) of iris codes which leads to huge communication between the MPC parties. After extensive experiments with state-of-the-art MPC protocols, we designed and implemented a dedicated MPC protocol for decentralized membership inference of iris code. Our final protocol, which is based on semi-honest and malicious variants of ABY3, can compare an iris code with 12800 bits to a database of 100k such codes in 0.2s for a semi-honest variant while only transmitting 0.6 MB of data, and in 1s for a malicious secure variant while transmitting only 4.6 MB of data. Closing Keynote 5:30PM Vitalik Buterin Virtual Keynote Workshops Time Host Title 9:10AM Bowen You & Liam McDonald (Fairblock) A modular ecosystem for privacy-enabled applications through threshold IBE and FHE 10:05AM Dominik Schmid & Bobbin Threadbare (Polygon Miden) Scalability and Privacy on Polygon Miden: The Hybrid On-chain and Off-chain State Model Lack of privacy and scalability are some of the most pressing and difficult-to-solve blockchain challenges. Both can be addressed by moving account data off-chain and verifying correct state transitions of individual accounts using ZKPs. However, this is a new paradigm for blockchains, and it requires a new smart contract model where communication between contracts is asynchronous. As a part of this workshop, we will give an overview of the hybrid on-chain/off-chain blockchain model on the example of Polygon Miden. We will describe the basic operating principles of this model, go over its pros and cons, and dive into the choices we made when implementing it in Polygon Miden. This will be followed by a hands-on session where participants will create off-chain accounts, deploy them to the Polygon Miden devnet, and move assets between their accounts by issuing and consuming notes. We will also build a simple dapp in to further illustrate the core concepts of the system. This will require some coding in Miden Assembly – but it will be fun! 11:00AM Porter Adams (Matter Labs) High performance Cryptography Engineering This workshop will explain the engineering tricks we’ve used to speed up zkSync’s Boojum prover. There are many talks on the theoretical computational complexity of various cryptography algorithms, but theory isn't always reality. We need ZK to be efficient in practice, and this means optimizing the code at every level. As zkSync co-founder Alex Vlasov says, "We must fight for the constants". We assume you have at least a little background in Rust programming, algorithms, and cryptography. The goal of this workshop is to teach you lessons that you can use to make your own cryptography code more performant. All of the examples are things we have learned from building our own proof system. 11:30AM Ryan Cao (Modulus) GKR for Gigachads: Building ZKML Circuits in Remainder We present the first-ever sneak peek on creating ZKML circuits within a GKR framework, all within Modulus' hyper-optimized Remainder proof system. This workshop is not for the faint of heart -- participants will speedrun the theoretical basics of circuit-building within GKR, then dive head-first into a performance-focused codebase and put that theory right to practice, writing circuits which compose the basic building blocks of machine learning systems. 12:30PM Lunch Break (50min) 1:20PM Remi Gai (Inco) Develop next frontier dApps with Fully Homomorphic Encryption Public blockchains, characterized by their transparent ledgers, establish trust and verification among users. However, this transparency restricts the practicality of certain decentralized applications (DApps) that require confidentiality, such as on-chain private voting, hidden card games, and private payments. Traditionally, efforts to bring confidentiality to blockchain technology have concentrated on two main approaches: secure enclaves and zero-knowledge cryptography. Recent breakthroughs in Fully Homomorphic Encryption (FHE) introduces a novel solution category to the blockchain confidentiality problem. FHE permits a range of encrypted operations — including addition, multiplication, division, and comparative functions like checking for equality and greater or lesser values — without revealing the underlying data. This innovation opens up new possibilities, especially in fields such as gaming, enterprise solutions, and Decentralized Finance (DeFi), by ensuring data remains secure and private even during processing. Inco Network is a modular, confidential computing network that enables the development of next-frontier decentralized applications (dApps), and provides confidentiality to existing blockchains. In our workshop, we'll cover: Overview of blockchain confidentiality and uniqueness of fully homomorphic encryption (FHE) Novel use cases Build on our testnet or directly from an existing chain with our Confidentiality-as-a-service (CaaS), and demos 2:00PM Shumo Chu (Nebra) Accelerating Proof Singularity with NEBRA Blockchain protocols and applications are increasingly proof-based. We are approaching the “proof singularity”, a world in which the base layer, a.k.a. Ethereum, will primarily verify proofs and proof aggregations extends base layers capabilities. NEBRA accelerates the proof singularity by lowering the cost and increasing the throughput of on-chain ZKP verification. Our key technology is Universal Proof Aggregation, which aggregates proofs from different circuits. This brings economy of scale and composability to proof settlement. The workshop will consist the follow parts: Overview and Intro of NEBRA Technical talks and demos from NEBRA partners Code demo of building on NEBRA UPA 3:30PM Tal Derei (Penumbra & Lehigh), Koh Wei Jie (Geometry Research) Accelerating client-side cryptography with WebGPU WebGPU is a relatively modern API which allows developers to leverage the power of users’ GPUs to run parallel code. This is promising for computationally heavy operations, such as multi-scalar multiplications. This workshop will guide you through how to write WebGPU code for a highly parallelised task. We’ll provide a code scaffold, hands-on guidance, and insights on the nuances and tradeoffs that developers must consider when working with WebGPU to accelerate cryptographic operations. 4:10PM Boyu Sun & John Bartlett (Snarkify) Scaling ZK Provers with Snarkify: GPU Acceleration & Serverless Platform Embark on a deep dive with Snarkify in our focused workshop, structured into two insightful parts: 1. Cutting-Edge GPU Acceleration: Enhancing the efficiency of proof systems is vital for the broader adoption of ZKPs in cryptography. At Snarkify, we’ve developed a CUDA-based GPU acceleration library, named cuSnark, to address performance bottlenecks in proof systems. We will detail the technical aspects of our current GPU acceleration progress as well as discuss the performance enhancements observed in various real-world halo2-based applications. 2. Streamlining with the Snarkify Serverless Platform: Experience the seamless integration and scalability of the Snarkify serverless platform, designed to facilitate the effortless deployment and expansion of provers. From hands-off DevOps to adaptable billing, we’ll demonstrate how Snarkify empowers users to scale from a single prover to an expansive array with minimal effort. A concise demo will showcase the platform’s capabilities and user-friendly features. 4:50PM Chris Cassano (Lit Protocol) Easy wallet onboarding with Lit This workshop will take you through how Lit Protocol works, and how to use it for various decentralized cryptography operations. You'll learn how to encrypt / decrypt data with Access Control Conditions, how to create signatures, and how to use Lit Actions to create logic that can control how/when/what can be decrypted or signed using the Lit Network threshold keys. You'll learn how to make Oracles that can fetch any data on the web and sign it, or verify any data and only sign it under certain conditions. You can use what you learned in this workshop to make all kinds of useful things, including bridging, token wrapping, oracles, easy onboarding systems, private decentralized serverless functions, chain and curve agnostic wallets, wallets with customizable auth logic, etc.enen1727461265https://dinfra.xyz

Edit your site?

What are you doing?