OlaVM is a STARK-based ZK-friendly ZKVM, it is built on a small finite field called Goldilocks field. As the most important component of the Ola system, OlaVM is mainly used to execute a program and generate a valid proof for the programmable scalable case and the programmable private case.
Warning: This repository shouldn't be used for production case, as it is still in development phase and has not been audited, so it might contain many bugs and security holes..
OlaVM is a Turing complete VM, which means that it can execute any computation on it and at the same time it could generate a valid proof for it. For getting a smaller proof time, we have many powerful designs that are relevant with ZK-friendly.
- if you want to know more about ZK-friendly and VM designs, check out the doc/olavm;
- if you want to know more about the circuit design, check out circuit crate;
- if you want to know more about the performance of OlaVM, check out Performance section;
- if you want to know more about STARKS, check out References section;
There are a lot of tricks to get a very ZK-friendly ZKVM in OlaVM. We would like to highlight some of them:
-
Algebraic RISC. The property of the instruction set of OlaVM is Algebraic RISC: "Algebraic" refers to the supported operations are field operation, "RISC" refers to the minimality of the instruction set. We can achieve a concise transition constraint based on this, see circuit/cpu to learn more;
-
Small finite field. The word defined in OlaVM is a finite field, Goldilocks. The prime of Goldilocks is p = 2^64 - 2^32 + 1, which is less than 64 bits. The computation based on these field elements could be expected to be much faster than other large finite fields;
-
Builtins. Since the cyclic group size is limited, it would be better if the trace table could contain as many transactions as possible. This means that if there are some computation cost a large trace lines in transaction logic, we should remove them from the main trace table and add a special sub-trace table to store them, this is the reason that introduce builtins, like hash, bitwise operation and so on, check the doc/olavm for more details;
-
Prophets. It is designed for non-deterministic computation, which means "implementation is expensive, verification is cheap". So to some extent Prophets is more like an external helper. It helps you compute the results of some non-deterministic computation, and then you verify the results using the instruction sets, should note that this verification is done by the VM, not by constraints which is different with builtins, see the doc/olavm for more details;
| Features | Status |
|---|---|
| Algebraic RISC | |
| Small finite field | |
| Builtins - bitwise | |
| Builtins - rangecheck | |
| Builtins - cmp | |
| Builtins - poseidon | |
| Storage | |
| Cross-contract call | |
| Prover optimization | |
| Builtins - ecdsa | |
| Prophet libs | |
| u32/u64/u256 lib | |
| Support privacy |
This project consists of several crates:
| Crate | Description |
|---|---|
| core | Define instruction structure and instruction sets |
| circuits | 1. Constraints for instruction sets, builtins, memory; 2. Generate proof |
| executor | Execute the programme and generate the execution trace for the Ola-prover |
| client | Some commands can be used by developers |
| plonky2 | A SNARK implementation based on techniques from PLONK and FRI techniques |
| infrastructure | Write the execution trace to an Excel file |
Many optimizations have not yet been applied, and we expect to see some speed improvements as we devote more time to performance optimization. The benchmarks below should only be used as a rough guide to expected future performance.
| Algorithm | Execution Instructions | Lines in CPU Table | Mac(8-cpu 16GB-Mem) Execution and Generate trace Time | Mac(10-cpu 32GB-Mem) Prove Time | Linux(64-cpu 128GB-Mem) Execution and Generate Trace Time | Linux(64-cpu 128GB-Mem) Prove Time |
|---|---|---|---|---|---|---|
| Calculate the 47th Fibonacci number 1000 times. | 866115 | 2^20 | 0.275s, 0.571s | 80.524s | 0.315s, 0.95s | 39.767 s |
| Calculate the sqrt of 1,073,741,824 16000 times. | 544113 | 2^20 | 0.892s, 0.572s | 65.758s | 1.185s, 0.955s | 29.935 s |
Overall, we don't expect the benchmarks to change significantly, but there will definitely be some deviation from the numbers below in the future.
A few general notes on performance:
Software:
- Support the fastest hash algorithm, Blake3 Hash
$\color{Green}{Done}$ - Support parallel FFT
$\color{Green}{Done}$ - Support parallel polynomial evaluation
$\color{Green}{Done}$ - Support parallel proof
Hardware:
- Integrate GPU accelerated FFT
- Integrate GPU accelerated polynomial evaluation
- Integrate FPGA accelerated FFT
- Integrate FPGA accelerated polynomial evaluation
OlaVM runs based on the Goldilocks field and uses STARK to generate proofs for the inner layer and more will use Plonky2 to generate recursive proofs for inner proofs. There are some resources to learn more about it.
- Goldilocks field used in Winterfell
- Goldilocks field used in plonky2
- Goldilocks field used in Polygon-Hermez
- Goldilocks field and extension Goldilocks
- U32 implementation in Goldilocks
- Plonky2 whitepaper
- Part-0: Introduction
- Part-1: STARK Overview
- Part-2: Basic Tools
- Part-3: FRI
- Part-4: The STARK Polynomial IOP
- Part-5: A Rescue-Prime STARK
- Part-6: Speeding Things Up
Sin7Y's STARK explanation:
This project is under MIT licensed.