Expand description

Proof of Work

The classic proof of work system based on a cryptogarphic hash function, in this case Blake3. To be explicit, a proof of work for some bytes : &[u8] and cost : u32 is a nonce : [u8; NONCE_SIZE] such that the Blake3 hash of nonce appended to bytes has at least cost leading zeros.

This crate provides functionality for searching and verifying this sort of proof of work.

Enums

Errors which can occur in searching for a proof of work.

Constants

Functions

Compute the number of leading zeros of the given byte array.

Proof search

Proof verification