Struct MerkleTree 

pub struct MerkleTree {
    pub leaves: Vec<String>,
    pub nodes: Vec<String>,
}

Binary Merkle tree whose leaves are CID strings.

Hash function

Leaf hashes are FNV-1a(cid.as_bytes()). Internal nodes use FNV-1a(left_hex ++ right_hex). When a level has an odd number of nodes the last node is duplicated (standard Bitcoin/IPFS convention).

All hash values are stored and returned as 16-character lowercase hex strings.

Fields

leaves: Vec<String>

Original CID strings used as leaves (in the order they were supplied).

nodes: Vec<String>

All tree nodes stored level-by-level, leaves first.

Layout: [ leaf_hashes … | level-1 hashes … | … | root ]

Implementations

impl MerkleTree

pub fn build(cids: &[String]) -> Self

Build a Merkle tree from a slice of CID strings.

Returns an empty tree (no nodes, no root) when cids is empty.

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

Return the Merkle root as a hex string, or None for an empty tree.

pub fn proof_for(&self, index: usize) -> Option<Vec<String>>

Return the Merkle proof for the leaf at index.

The proof is a list of sibling hashes from leaf level up to (but not including) the root. Returns None if index is out of range or the tree is empty.

pub fn verify_proof( leaf: &str, index: usize, proof: &[String], root: &str, ) -> bool

Verify a Merkle proof.

• leaf — the raw CID string whose membership is being verified
• index — zero-based position of the leaf in the original list
• proof — sibling hashes returned by MerkleTree::proof_for
• root — expected Merkle root hex string

Returns true iff the recomputed root matches root.

Trait Implementations

impl Clone for MerkleTree

fn clone(&self) -> MerkleTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MerkleTree

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for MerkleTree

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for MerkleTree

impl PartialEq for MerkleTree

fn eq(&self, other: &MerkleTree) -> 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 Serialize for MerkleTree

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for MerkleTree