Struct PortableBlake3MultiDigest 

pub struct PortableBlake3MultiDigest<const N: usize> { /* private fields */ }

Portable multi-lane Blake3 leaf digest over N messages, hashed a block at a time.

One chunk, so the chaining value stays at counter 0 and needs no CV stack. Each message is any length up to CHUNK_LEN; all N lanes must share that length.

A block is compressed only once the next block’s first byte arrives, so the trailing block is deferred to finalization, where it alone carries CHUNK_END | ROOT.

Trait Implementations

impl<const N: usize> Clone for PortableBlake3MultiDigest<N>

fn clone(&self) -> PortableBlake3MultiDigest<N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const N: usize> Default for PortableBlake3MultiDigest<N>

fn default() -> Self

Returns the “default value” for a type.

impl<const N: usize> MultiDigest<N> for PortableBlake3MultiDigest<N>

type Digest = Hasher

The corresponding non-parallelized hash function.

fn new() -> Self

Create new hasher instance with empty state.

fn update(&mut self, data: [&[u8]; N])

Process data, updating the internal state. The number of rows in data must be equal to parallel_instances().

fn finalize_into(self, out: &mut [MaybeUninit<Output<Self::Digest>>; N])

Write result into provided array and consume the hasher instance.

fn finalize_into_reset( &mut self, out: &mut [MaybeUninit<Output<Self::Digest>>; N], )

Write result into provided array and reset the hasher instance.

fn reset(&mut self)

Reset hasher instance to its initial state.

fn digest(data: [&[u8]; N], out: &mut [MaybeUninit<Output<Self::Digest>>; N])

Compute hash of data. All slices in the data must have the same length.

fn new_with_prefix(data: impl AsRef<[u8]>) -> Self

Create new hasher instance which has processed the provided data.

fn chain_update(self, data: [&[u8]; N]) -> Self

Process input data in a chained manner.