Struct akd::proof_structs::LayerProof

pub struct LayerProof<H: Hasher> {
    pub label: NodeLabel,
    pub siblings: [Node<H>; 1],
    pub direction: Direction,
}

Proof value at a single layer of the tree Note that this is really a helper struct to hold the sibling path for a Merkle tree proof. When sending a sibling path, you need to know which direction to hash a node (left or right) since in a compressed tree, the label alone is not enough to derive the path. Thus, we include the direction at which to place the ancestor of the node for which a proof is being generated. The parent is the parent of the level in the tree at which you are. See documentation for MembershipProof to see how this is used.

Fields

label: NodeLabel

The parent’s label

siblings: [Node<H>; 1]

Siblings of the parent

direction: Direction

The direction

Trait Implementations

impl<H: Hasher> Clone for LayerProof<H>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H: Debug + Hasher> Debug for LayerProof<H>

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

Formats the value using the given formatter.

impl<H: PartialEq + Hasher> PartialEq<LayerProof<H>> for LayerProof<H>

fn eq(&self, other: &LayerProof<H>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H: Eq + Hasher> Eq for LayerProof<H>

impl<H: Hasher> StructuralEq for LayerProof<H>

impl<H: Hasher> StructuralPartialEq for LayerProof<H>