Struct ParallelSha256Digest 

pub struct ParallelSha256Digest;

Batches fixed-length SHA-256 leaves through the multi-lane kernel.

With a fixed leaf length, the leaf size picks the route:

    up to 55 bytes : one batched block compression, padding folded into the block
    longer         : a batched multi-block hash, one shared block count

Without a fixed length a batch cannot share a block count, so that path falls back to hashing one leaf at a time.

Trait Implementations

impl Clone for ParallelSha256Digest

fn clone(&self) -> ParallelSha256Digest

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ParallelSha256Digest

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

Formats the value using the given formatter.

impl Default for ParallelSha256Digest

fn default() -> ParallelSha256Digest

Returns the “default value” for a type.

impl ParallelDigest for ParallelSha256Digest

type Digest = Sha256

The corresponding non-parallelized hash function.

fn new() -> Self

Create new hasher instance with empty state.

fn digest<I: IntoIterator<Item: SerializeBytes>>( &self, source: impl IndexedParallelIterator<Item = I>, out: &mut [MaybeUninit<Output<Sha256>>], )

Calculate the digest of multiple hashes by processing a parallel iterator of iterators.

fn digest_with_const_len<I: IntoIterator<Item: FixedSizeSerializeBytes>>( &self, n_items_per_input: usize, source: impl IndexedParallelIterator<Item = I>, out: &mut [MaybeUninit<Output<Sha256>>], )

Like digest, but specialized for the case where every leaf is built from exactly n_items_per_input items of a FixedSizeSerializeBytes type, so that each leaf has the same, compile-time-derivable byte length.