Crate proof_of_history
source ·Expand description
A demo implementation of Proof of History, generic over the hashing implementation.
Modules
- This crate provides traits which describe functionality of cryptographic hash functions and Message Authentication algorithms.
Structs
- A simple wrapper around the
tick
function that stores the output of the previous tick and automatically supplies it to thetick
function on each call tonext
ornext_with_data
.
Functions
- Computes a cryptographic hash of the given data using the specified digest algorithm. This pure function represents a tick operation in the proof of history.
- Creates an infinite iterator that produces a continuous sequence of ticks. Each tick is generated based on the output of the previous tick, creating a chained hash sequence.
- Verifies the validity of a given sequence of ticks using parallel processing. This function checks if each tick correctly follows from its predecessor in the sequence.