Ensuring Computational Integrity with LuminAIR.
LuminAIR’s primary objective is to cryptographically prove that a computational graph has been executed correctly.
This proof allows verifiers to validate the computation’s integrity using significantly fewer resources than re-executing the graph.
The process is powered by the StwoCompiler
and the Stwo prover, enabling efficient proof generation and verification.
Stwo is a next-generation implementation of the Circle STARK protocol, written in Rust.
Developed by Starkware, it is an ultra-efficient ZK prover designed for scalable succinct proofs. Stwo unlocks the potential of the highly efficient prime field M31, benefiting the entire ZK-proof ecosystem.
The StwoCompiler
plays a critical role in transforming and optimizing computational graphs.
It assigns each operator in the graph to its corresponding AIR component, preparing the graph for proof generation using the Stwo prover.
The LuminAIR prover integrates directly with the Stwo library to:
The LuminAIR prover currently supports a SIMD backend, allowing parallelized proof generation on devices equipped with SIMD capabilities.
For smaller traces or devices without SIMD support, a fallback to CpuBackend
ensures compatibility.
In the roadmap, LuminAIR plans to support Icicle-Stwo, an implementation of Stwo by Ingonyama that enables CUDA-based GPU acceleration. This will significantly enhance proof generation speed for large-scale computation
The LuminAIR verifier, written in Rust, validates proofs generated by the prover. It ensures:
To expand its trustlessness, LuminAIR plans to implement additional verifier backends:
WASM Verifier: A WebAssembly implementation will allow proofs to be verified directly in web browsers, enabling trustless verification by a client.
Onchain Verification: