Struct MerkleDigest 

pub struct MerkleDigest {
    pub entries: Vec<DigestEntry>,
    pub root_hash: u64,
}

A compact, sortable digest of local state suitable for peer comparison.

Entries are always kept sorted by key so that diff_keys is deterministic and independent of insertion order.

Fields

entries: Vec<DigestEntry>

Sorted (by key) snapshot of local state entries.

root_hash: u64

XOR-fold of all per-entry (key_hash XOR value_hash XOR version) tuples.

Implementations

impl MerkleDigest

pub fn from_sorted(entries: Vec<DigestEntry>) -> Self

Compute a MerkleDigest from an already-sorted list of entries.

Assumes entries is sorted by key; callers must ensure this invariant.

pub fn matches(&self, other: &MerkleDigest) -> bool

Returns true when both digests share the same root hash, meaning all keys, values, and versions are identical.

pub fn diff_keys(&self, other: &MerkleDigest) -> Vec<String>

Return the set of keys that differ between self and other.

A key is included when:

• It exists in one digest but not the other.
• It exists in both but value_hash or version differ.

Trait Implementations

impl Clone for MerkleDigest

fn clone(&self) -> MerkleDigest

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MerkleDigest

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

Formats the value using the given formatter.

impl Eq for MerkleDigest

impl PartialEq for MerkleDigest

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for MerkleDigest