Developer Velocity,
Breakthrough Performance

Valida provides verifiable computation in a virtual machine that is maximally easy-to-use. With Valida, devs can write programs in standard Rust, C, and C++ code, allowing novel applications to reach escape velocity sooner

Build with VALIDA
Core Development Teams

Why build with Valida?

Polygon Plonky3

Polygon Plonky3 is a modular toolkit for implementing Polynomial IOPs such as PLONK and STARKs. Configurable by hash function and finite field, Polygon Plonky3 provides breakthrough performance across a wide range of blockchain applications

Github

Valida LLVM

Domain specific languages increase development time and make codebases more complex to maintain. Valida is source-language agnostic, allowing developers to write in standard Rust, C, and C++

Github

Low-cost Proving

Valida achieves breakthrough computational efficiency using specialized chips to handle specific operations, allowing developers to optimize performance and resource usage for particular hardware setups

Open Source

Licensed with MIT/Apache 2.0, the Valida VM is entirely open source, allowing developers to leverage all future performance and efficiency contributions made to the codebases

Valida LLVM

With a RISC-inspired instruction set, the Valida VM simplifies targeting conventional programming languages. On the backend, the LLVM IR is compiled down to the Valida ISA. The Valida prover, built with Plonky3, then outputs verifiable proofs of programs written in standard Rust, Go, C, and C++, with minimal to no changes in source code required

Build with VALIDA

Efficient Arithmetization

Modularity, in the form of precompiled cryptographic operations, represents an entirely novel approach to zkVM design. These precompiles reduce the cost of proof generation by avoiding any runtime penalties and unused operations. The Valida VM doesn't contain any general-purpose registers or dedicated stack; instead, it operates directly on memory. Newer lookup arguments reduce trace overhead, and the VM can be extended to include any arbitrary number of user-defined instructions.

Valida minimizes computational resources and simplifies development timelines, effectively lowering the real-world costs required to go from idea to production-ready

Development & Contributors

The development of Valida grew out of discussions around a single question: What zkVM architecture would best optimize both developer productivity and performance? The earliest iteration of the Valida VM codebase was written by Daniel Lubarov and Max Gillett, with Michael Liao contributing the skeleton of the current LLVM Valida compiler. The Lita Foundation is building and maintaining Valida zkVM and its compiler toolchain, with Polygon Labs maintaining Plonky3.

Morgan Thomas
Lita
Ventali Tan
Lita
Tess Dore
Lita
Mamy Ratsimbazafy
Lita
Marty Stampf
Lita
Lewis Rewell
Lita
Marcin Bugaj
Lita
Hadas Zeilberger
Lita
Plonky3
Polygon

Founding Team

Lita Foundation
Max Gillett
Daniel Lubarov
Polygon Co-founder