Struct MpcTree 

pub struct MpcTree {
    pub leaves: Vec<MpcLeaf>,
}

Multi-Protocol Commitment tree

Fields

leaves: Vec<MpcLeaf>

Leaves in deterministic order

Implementations

impl MpcTree

pub fn new(leaves: Vec<MpcLeaf>) -> Self

Create a new MPC tree from leaves

pub fn from_pairs(pairs: &[(ProtocolId, Hash)]) -> Self

Create from (protocol_id, commitment) pairs

pub fn root(&self) -> Hash

Compute the MPC root hash

Uses a deterministic Merkle tree construction. For a single leaf, the root is the leaf hash. For multiple leaves, pairs are hashed together bottom-up.

pub fn prove(&self, protocol_id: ProtocolId) -> Option<MpcProof>

Build a merkle proof for a specific protocol

Returns None if the protocol_id is not in this tree.

pub fn protocol_count(&self) -> usize

Get the number of protocols in this tree

pub fn contains_protocol(&self, protocol_id: ProtocolId) -> bool

Check if a protocol is present in this tree

pub fn push(&mut self, protocol_id: ProtocolId, commitment: Hash)

Add a protocol to the tree

Trait Implementations

impl Clone for MpcTree

fn clone(&self) -> MpcTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MpcTree

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

Formats the value using the given formatter.

impl Hash for MpcTree

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for MpcTree

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

impl StructuralPartialEq for MpcTree