This crate contains modules with cryptographic operations needed in STARK proof generation and verification.
Hash module defines a set of hash functions available for cryptographic operations. Currently, the following hash functions are supported:
Rescue hash function is implemented according to the Rescue Prime specifications with the following exception:
* We set the number of rounds to 7, which implies a 40% security margin instead of the 50% margin used in the specifications (a 50% margin rounds up to 8 rounds). The primary motivation for this is that having the number of rounds be one less than a power of two simplifies AIR design for computations involving the hash function.
* When hashing a sequence of elements, we do not append Fp(1) followed by Fp(0) elements to the end of the sequence as padding. Instead, we initialize one of the capacity elements to the number of elements to be hashed, and pad the sequence with Fp(0) elements only. This ensures that output of the hash function is the same when we hash 8 field elements to compute a 2-to-1 hash using merge() function (e.g., for building a Merkle tree) and when we hash 8 field elements as a sequence of elements using hash_elements() function. However, this also means that our instantiation of Rescue Prime cannot be used in a stream mode as the number of elements to be hashed must be known upfront.
The parameters used to instantiate the function are: * Field: 62-bit prime field with modulus 2^62 - 111 * 2^39 + 1. * State width: 12 field elements. * Capacity size: 4 field elements. * Number of founds: 7. * S-Box degree: 3.
The above parameters target 124-bit security level. The digest consists of four field elements and it can be serialized into 31 bytes (248 bits).
One of the core operations performed during STARK proof generation is construction of Merkle trees. We care greatly about building these trees as quickly as possible, and thus, for the purposes of STARK protocol, 2-to-1 hash operation (e.g., computing a hash of two 32-byte values) is especially important. The table below contains rough benchmarks for computing a 2-to-1 hash for all currently implemented hash functions.
| CPU | BLAKE3256 | SHA3256 | RP62_248 | | ------------------------ | :--------: | :------: | :------: | | Core i9-9980KH @ 2.4 GHz | 66 ns | 400 ns | 6.6 us | | Core i5-7300U @ 2.6 GHz | 81 ns | 540 ns | 9.5 us | | Core i5-4300U @ 1.9 GHz | 106 ns | 675 ns | 13.9 us |
As can be seen from the table, BLAKE3 is by far the fastest hash function, while our implementation of Rescue Prime is roughly 100x slower than BLAKE3 and about 17x slower than SHA3.
Merkle module contains an implementation of a Merkle tree which supports batch proof generation and verification. Batch proofs are based on the Octopus algorithm described here.
This crate can be compiled with the following features:
std - enabled by default and relies on the Rust standard library.concurrent - implies std and also enables multi-threaded execution for some of the crate functions.no_std does not rely on the Rust standard library and enables compilation to WebAssembly.To compile with no_std, disable default features via --no-default-features flag.
When compiled with concurrent feature enabled, the following operations will be executed in multiple threads:
MerkleTree::new() - i.e., a Merkle tree will be constructed in multiple threads.The number of threads can be configured via RAYON_NUM_THREADS environment variable, and usually defaults to the number of logical cores on the machine.
This project is MIT licensed.