Expand description
Batched hash and Merkle tree construction for a Binius prover.
Proving folds whole Merkle layers at once, so every hash here takes a batch of independent messages per call and runs it through whatever vector kernel the target has.
Nothing a verifier links against depends on this crate. Every batched path is pinned byte-for-byte to the sequential one it stands in for, which is what lets the two sides of a proof commit to the same tree.
Re-exports§
pub use binary_merkle_tree::BinaryMerkleTree;pub use blake3::PortableBlake3ParallelCompression;pub use blake3::PortableBlake3ParallelDigest;pub use parallel_compression::ParallelCompressionAdaptor;pub use parallel_compression::ParallelPseudoCompression;pub use parallel_digest::MultiDigest;pub use parallel_digest::ParallelDigest;pub use parallel_digest::ParallelDigestAdapter;pub use parallel_digest::ParallelMultidigestImpl;pub use sha256::ParallelSha256Compression;pub use sha256::ParallelSha256Digest;pub use suite::ParallelHashSuite;
Modules§
- binary_
merkle_ tree - blake3
- Blake3 hash and compression functions for use in Merkle tree constructions.
- parallel_
compression - parallel_
digest - sha256
- Batched SHA-256 leaf hashing and inner-node compression.
- suite
- The batched counterpart of the verifier’s hash pair.