Struct MultiKeyProof 

pub struct MultiKeyProof {
    pub root: Option<Cid>,
    pub keys: Vec<Vec<u8>>,
    pub path: Vec<Node>,
}

Shared root proof for multiple keys.

The path vector stores each proof node at most once. Verification follows the root-to-leaf route for every key through this node set and preserves the original key order in MultiKeyProofVerification::results.

Fields

root: Option<Cid>

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

keys: Vec<Vec<u8>>

Keys being proven, in caller-requested order.

path: Vec<Node>

De-duplicated nodes needed to prove all keys. Empty when root is None or keys is empty.

Implementations

impl MultiKeyProof

pub fn verify(&self) -> MultiKeyProofVerification

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>, keys: Vec<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 MultiKeyProof::to_bundle_bytes.

Trait Implementations

impl Clone for MultiKeyProof

fn clone(&self) -> MultiKeyProof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MultiKeyProof

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

Formats the value using the given formatter.

impl PartialEq for MultiKeyProof

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for MultiKeyProof