Struct Multiproof 

pub struct Multiproof {
    pub leaves: u64,
    pub revealed: Vec<(u64, Vec<u8>)>,
    pub hidden: Vec<[u8; 32]>,
}

Opened leaves of one part and one hash per maximal unopened subtree, in left-to-right order (D7). The tree’s shape follows from leaves.

Fields

leaves: u64

How many leaves the part has.

revealed: Vec<(u64, Vec<u8>)>

The opened leaves with their positions, in increasing position order.

hidden: Vec<[u8; 32]>

The roots of the subtrees with no opened leaf.

Implementations

impl Multiproof

pub fn prove( hasher: &impl PartHasher, leaves: &[Leaf], keep: impl Fn(&Leaf) -> bool, ) -> Result<Self, Error>

Open the leaves keep selects, hiding each subtree that has none.

pub fn from_hashes(hashes: &[[u8; 32]], opened: Vec<Option<Vec<u8>>>) -> Self

Open the leaves given with their bytes, hiding each subtree that has none by its root over the part’s retained leaf hashes, without a key.

pub fn opened(&self) -> Result<Vec<Leaf>, Error>

Every opened leaf, decoded.

pub fn root(&self, hasher: &impl PartHasher) -> Result<[u8; 32], Error>

The root these openings and hashes reconstruct. Positions must be in range and increasing, and every hash must be used exactly once.

pub fn root_with_leaf_hashes( &self, hasher: &impl PartHasher, ) -> Result<([u8; 32], Vec<[u8; 32]>), Error>

Reconstruct the root and retain the hash of each revealed leaf, in revealed order, so later proofs can hide it without the audience key.

pub fn retain_opened(&self, hashes: &[[u8; 32]], keep: &[bool]) -> Self

Retain a subset of an authenticated proof’s openings, merging hidden siblings into maximal subtrees. hashes and keep correspond exactly to revealed; hashes come from root_with_leaf_hashes at authentication.

Trait Implementations

impl Clone for Multiproof

fn clone(&self) -> Multiproof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Multiproof

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

Formats the value using the given formatter.

impl PartialEq for Multiproof

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

impl StructuralPartialEq for Multiproof