Struct RangeProof 

pub struct RangeProof {
    pub root: Option<Cid>,
    pub start: Vec<u8>,
    pub end: Option<Vec<u8>>,
    pub path: Vec<Node>,
}

Complete proof for all entries in a key range.

The path vector stores every node needed to verify that all keys in [start, end) have been included and that no other matching keys are omitted.

Fields

root: Option<Cid>

Root CID the node set claims to prove against, or None for an empty tree.

start: Vec<u8>

Inclusive range start.

end: Option<Vec<u8>>

Exclusive range end. None means unbounded.

path: Vec<Node>

De-duplicated nodes needed to prove the full range.

Implementations

impl RangeProof

pub fn verify(&self) -> RangeProofVerification

Verify this proof without consulting a store.

pub fn path_node_bytes(&self) -> Vec<Vec<u8>>

Return the de-duplicated proof nodes as deterministic encoded bytes.

pub fn from_node_bytes( root: Option<Cid>, start: impl Into<Vec<u8>>, end: Option<Vec<u8>>, path_node_bytes: Vec<Vec<u8>>, ) -> Result<Self, Error>

Rebuild a typed proof from encoded path nodes.

pub fn to_bundle_bytes(&self) -> Result<Vec<u8>, Error>

Serialize this proof as a versioned, deterministic binary bundle.

pub fn from_bundle_bytes(bytes: &[u8]) -> Result<Self, Error>

Decode a proof from bytes produced by RangeProof::to_bundle_bytes.

Trait Implementations

impl Clone for RangeProof

fn clone(&self) -> RangeProof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RangeProof

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

Formats the value using the given formatter.

impl PartialEq for RangeProof

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RangeProof