Struct Blake3HashSuite 

pub struct Blake3HashSuite;

Blake3 HashSuite: Blake3 leaves and a Blake3 compression function for inner nodes.

Both parallel compute paths use the portable auto-vectorized kernel, not the scalar loop:

• Leaves within one 1024-byte chunk are hashed by the batch kernel.
• Larger leaves fall back to the scalar adapter that walks the tree.
• Every inner-node level folds its node pairs through the batched two-to-one compression.

The batch width is fixed at 16 lanes for both paths:

• The throughput sweet spot on NEON in the portable-kernel benchmark.
• The width the AVX2 / AVX-512 vectorizer fills.
• 4 and 8 lanes both measure slower.

Trait Implementations

impl Clone for Blake3HashSuite

fn clone(&self) -> Blake3HashSuite

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Blake3HashSuite

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Blake3HashSuite

fn default() -> Blake3HashSuite

Returns the “default value” for a type.

impl HashSuite for Blake3HashSuite

type LeafHash = Hasher

Sequential hash used to compute leaf digests during verification.

type Compression = Blake3Compression

Sequential 2-to-1 compression used to fold inner Merkle nodes during verification.

type ParLeafHash = PortableBlake3ParallelDigest<16>

Parallel counterpart of Self::LeafHash used during proving.

type ParCompression = PortableBlake3ParallelCompression<16>

Parallel counterpart of Self::Compression used during proving.