We curated a list of resources below, aiming to provide a knowledge base and to cover developer needs. We will add more sections soon, such as project evaluations. We are also open to advise projects, provide reviews, and co-author research publications.

• Developer Learning Materials on Valida zkVM
  Lita Foundation
  A collection of essential materials, tips, and insights to streamline your learning process on Valida, accompanied by direct links to relevant GitHub issues
• Plonky3 / Valida Review Notes
  Lita Foundation
  Review criteria for Plonky3 and Valida MVP focus on functional completeness, computational robustness, algorithmic efficiency, and compatibility across systems
• Valida zkVM Design
  Delendum Research & Lita Foundation
  Valida: a STARK-based VM focused on code reuse, performance, and modularity
• ZK System Benchmarking
  Delendum Research
  comparing the performance of different zero-knowledge proof libraries
• Cross-chain Future
  Iso Lab
  Beyond making asset transfer cross-chain trustless, fast, and secure, what else should we do to connect the blockchains and help developers build the cross-chain future?
• Decentralization of ZK Rollups
  Ibrahim Yusufali
  ZK Rollups face three major challenges: MEV equality, decentralization of block building and incentive alignment for all network participants. We will be analyzing proposed solutions to these chall...
• zk-SNARK Aggregation
  Ole Spjeldnæs
  Popular zk-SNARK aggregation constructions and some potentially interesting approaches
• Part I: What to build next in Zero Knowledge?
  Delendum Research
  What are the problems that haven’t been solved in blockchain and how can we leverage zero-knowledge proof as a tool to solve these problems?
• A Brief Taxonomy of Circuit Compilation Strategies
  Christopher Goes
  If most general-purpose applications of ZKPs will require general-purpose programmable privacy, what compiler stack can allow developers to safely write programs and also produce efficient outputs?
• Formal Verification of ZK Constraint Systems
  Morgan Thomas and Ventali Tan
  How do we formally verify that an arithmetic circuit, as used by a zero knowledge proof system, has the desired characteristics, such as soundness, completeness and zero knowledge? Soundness of a p...
• Efficient Signatures for ZKPs
  Daniel Lubarov
  Verifying digital signatures is a problem that arises in a variety of ZK related projects, from Zcash to zkEVMs. Here we will discuss some different options for signature schemes, and strategies fo...
• ZK in Identity
  Shashank Agrawal
  In the blockchain world, identity could manifest in multiple ways. A real-world identity like a person or an organization can take different forms on one or more blockchains, and an identity on the...
• Field Selection for Recursive SNARKs
  Gautam Botrel
  Many thanks to Carol Xie, Daniel Lubarov, Shashank Agrawal, Ventali Tan, Youssef El Housni & Ariel Gabizon for feedback.