Crate winter_verifier
source ·Expand description
This crate contains Winterfell STARK verifier.
This verifier can be used to verify STARK proofs generated by the Winterfell STARK prover.
Usage
To verify a proof that a computation was executed correctly, you’ll need to do the following:
- Define an algebraic intermediate representation (AIR) for you computation. This can be done by implementing Air trait.
- Execute verify() function and supply the AIR of your computation together with the StarkProof and related public inputs as parameters.
Performance
Proof verification is extremely fast and is nearly independent of the complexity of the computation being verified. In vast majority of cases proofs can be verified in 3 - 5 ms on a modern mid-range laptop CPU (using a single core).
There is one exception, however: if a computation requires a lot of sequence
assertions
(see Assertion for more info), the verification time will grow linearly in the number of
asserted values. But for the impact to be noticeable, the number of asserted values would
need to be in tens of thousands. And even for hundreds of thousands of asserted values, the
verification time should not exceed 50 ms.
Re-exports
Structs
Enums
Traits
Self
.Self
.Self
from bytes.Self
into bytes.