Struct CheckpointChainFrontier 

pub struct CheckpointChainFrontier { /* private fields */ }

Append-only frontier of the checkpoint-chain Merkle tree.

Holds one root per perfect subtree covering the leaves so far, largest first, which is enough to compute the RFC 6962 tree head and to extend it. Appending is amortized O(1) hashes and the root costs O(log n), so a long-lived writer never rehashes the whole chain to issue one checkpoint.

Implementations

impl CheckpointChainFrontier

pub fn empty() -> Self

Frontier over no leaves.

pub fn from_leaves(chain_leaf_hashes: &[Hash]) -> Self

Rebuild from every chain leaf in order. O(n); used once when a writer seeds or resyncs its head, never on the per-checkpoint path.

pub fn leaf_count(&self) -> u64

Number of chain leaves covered.

pub fn append(&mut self, chain_leaf_hash: Hash)

Extend by one chain leaf, merging equal-span neighbours so the spans stay strictly decreasing powers of two.

pub fn root(&self) -> Option<Hash>

RFC 6962 tree head over the covered leaves, or None when empty.

Folds right-associatively, which is the same shape the recursive definition produces for a tree whose right edge is incomplete.

Trait Implementations

impl Clone for CheckpointChainFrontier

fn clone(&self) -> CheckpointChainFrontier

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CheckpointChainFrontier

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

Formats the value using the given formatter.

impl Default for CheckpointChainFrontier

fn default() -> CheckpointChainFrontier

Returns the “default value” for a type.

impl Eq for CheckpointChainFrontier

impl PartialEq for CheckpointChainFrontier

fn eq(&self, other: &CheckpointChainFrontier) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for CheckpointChainFrontier