Expand description
Hash and compression functions a Binius verifier depends on.
Everything here is sequential and reference-driven: one block compression per node, one digest per leaf, no vector kernels and no thread pool.
The batched and architecture-specific kernels a prover wants live in the prover-side crate, so nothing a verifier links against depends on them.
Re-exports§
pub use blake3::Blake3Compression;pub use blake3::Blake3HashSuite;pub use compress::CompressionFunction;pub use sha256::Sha256Compression;pub use sha256::Sha256HashSuite;pub use suite::HashSuite;
Modules§
- blake3
- Blake3 leaf hash and two-to-one compression for Merkle tree constructions.
- compress
- These interfaces are taken from p3_symmetric in Plonky3.
- sha256
- SHA-256 leaf hash and two-to-one compression for Merkle tree constructions.
- suite
- The hash pair a Merkle commitment is built from.
Structs§
- Hash
Buffer - Adapter that wraps [
Digest] references and exposes the [BufMut] interface.
Functions§
- hash_
serialize - Hashes a sequence of serializable items.
Type Aliases§
- StdCompression
- The standard two-to-one compression pairs with the standard digest.
- StdDigest
- The standard digest is SHA-256.
- StdHash
Suite - The standard hash suite pairs the standard digest with the standard compression.