Struct akd::proof_structs::NonMembershipProof [−][src]
pub struct NonMembershipProof<H: Hasher> {
pub label: NodeLabel,
pub longest_prefix: NodeLabel,
pub longest_prefix_children_labels: [NodeLabel; 2],
pub longest_prefix_children_values: [H::Digest; 2],
pub longest_prefix_membership_proof: MembershipProof<H>,
}
Expand description
Merkle Patricia proof of non-membership for a NodeLabel
in the tree
at a given epoch.
Fields
label: NodeLabel
The label in question
longest_prefix: NodeLabel
The longest prefix in the tree
longest_prefix_children_labels: [NodeLabel; 2]
The children of the longest prefix
longest_prefix_children_values: [H::Digest; 2]
The values of the longest prefix children
longest_prefix_membership_proof: MembershipProof<H>
The membership proof of the longest prefix
Trait Implementations
Auto Trait Implementations
impl<H> RefUnwindSafe for NonMembershipProof<H> where
<H as Hasher>::Digest: RefUnwindSafe,
impl<H> Send for NonMembershipProof<H>
impl<H> Sync for NonMembershipProof<H>
impl<H> Unpin for NonMembershipProof<H> where
<H as Hasher>::Digest: Unpin,
impl<H> UnwindSafe for NonMembershipProof<H> where
<H as Hasher>::Digest: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more