Enum TapretNodePartner

pub enum TapretNodePartner {
    LeftNode(TapNodeHash),
    RightLeaf(LeafScript),
    RightBranch(TapretRightBranch),
}

Information proving step of a tapret path in determined way within a given tap tree.

The structure hosts proofs that the right-side partner at the taproot script tree node does not contain an alternative OP-RETURN commitment script.

Variants

LeftNode(TapNodeHash)

Tapret commitment is on the right side of the tree; i.e the node hashing partner can’t contain an alternative commitment.

RightLeaf(LeafScript)

Single script spending path was present before tapret commitment, which becomes a second leaf at level 1.

RightBranch(TapretRightBranch)

Multiple script spending paths were present; or a single script spending path should be hidden from revealing the script in the proof.

To prove that the 1-st level branch is not a script leafs containing an alternative OP_RETURN commitment we have to reveal the presence of two level 2 structures underneath.

Implementations

impl TapretNodePartner

pub fn right_branch(a: TapNodeHash, b: TapNodeHash) -> TapretNodePartner

Constructs right-side tapret branch proof structuring a and b children node hashes in the correct consensus order (i.e. lexicographically).

pub fn check_no_commitment(&self) -> bool

Checks that the sibling data does not contain another tapret commitment.

The check ensures that if the sibling data are present, their first 31 bytes are not equal to TAPRET_SCRIPT_COMMITMENT_PREFIX, and if the sibling is another node, the hash of its first child in the proof is smaller than the hash of the other.

pub fn check_ordering(&self, other_node: TapNodeHash) -> bool

Checks that the sibling has a correct ordering regarding some other node.

pub fn tap_node_hash(&self) -> TapNodeHash

Computes node hash of the partner node defined by this proof.

Trait Implementations

impl Clone for TapretNodePartner

fn clone(&self) -> TapretNodePartner

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TapretNodePartner

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TapretNodePartner

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for TapretNodePartner

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

Formats the value using the given formatter.

impl From<LeafScript> for TapretNodePartner

fn from(v: LeafScript) -> Self

Converts to this type from the input type.

impl Hash for TapretNodePartner

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 Ord for TapretNodePartner

fn cmp(&self, other: &TapretNodePartner) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for TapretNodePartner

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

fn partial_cmp(&self, other: &TapretNodePartner) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for TapretNodePartner

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StrictDecode for TapretNodePartner

fn strict_decode(reader: &mut impl TypedRead) -> Result<Self, DecodeError>

fn strict_read(reader: impl ReadRaw) -> Result<Self, DecodeError>

impl StrictDumb for TapretNodePartner

fn strict_dumb() -> Self

impl StrictEncode for TapretNodePartner

fn strict_encode<W: TypedWrite>(&self, writer: W) -> Result<W>

fn strict_write(&self, writer: impl WriteRaw) -> Result<(), Error>

impl StrictSum for TapretNodePartner

const ALL_VARIANTS: &'static [(u8, &'static str)]

fn variant_name(&self) -> &'static str

fn strict_check_variants()

fn variant_name_by_tag(tag: u8) -> Option<VariantName>

fn variant_ord(&self) -> u8

impl StrictType for TapretNodePartner

const STRICT_LIB_NAME: &'static str = LIB_NAME_BPCORE

fn strict_name() -> Option<TypeName>

impl StrictUnion for TapretNodePartner

fn strict_type_info() -> TypeInfo<Self>

impl Eq for TapretNodePartner

impl StructuralPartialEq for TapretNodePartner