Struct KeyProof 

pub struct KeyProof {
    pub root: Option<Cid>,
    pub key: Vec<u8>,
    pub path: Vec<Node>,
}

Root-to-leaf proof for one key.

Fields

root: Option<Cid>

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

key: Vec<u8>

Key being proven.

path: Vec<Node>

Nodes from root to leaf. Empty only when root is None.

Implementations

impl KeyProof

pub fn verify(&self) -> KeyProofVerification

Verify this proof without consulting a store.

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

Return the nodes in this proof as deterministic encoded bytes.

pub fn from_node_bytes( root: Option<Cid>, key: impl Into<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 KeyProof::to_bundle_bytes.

Trait Implementations

impl Clone for KeyProof

fn clone(&self) -> KeyProof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KeyProof

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

Formats the value using the given formatter.

impl PartialEq for KeyProof

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for KeyProof