breez_sdk_liquid::bitcoin::util::taproot

Struct TaprootBuilder

pub struct TaprootBuilder { /* private fields */ }
Expand description

Builder for building taproot iteratively. Users can specify tap leaf or omitted/hidden branches in a depth-first search (DFS) walk order to construct this tree.

See Wikipedia for more details on DFS.

Implementations§

§

impl TaprootBuilder

pub fn new() -> TaprootBuilder

Creates a new instance of TaprootBuilder.

pub fn with_huffman_tree<I>( script_weights: I, ) -> Result<TaprootBuilder, TaprootBuilderError>
where I: IntoIterator<Item = (u32, Script)>,

Creates a new TaprootSpendInfo from a list of scripts (with default script version) and weights of satisfaction for that script.

The weights represent the probability of each branch being taken. If probabilities/weights for each condition are known, constructing the tree as a Huffman Tree is the optimal way to minimize average case satisfaction cost. This function takes as input an iterator of tuple(u32, &Script) where u32 represents the satisfaction weights of the branch. For example, [(3, S1), (2, S2), (5, S3)] would construct a TapTree that has optimal satisfaction weight when probability for S1 is 30%, S2 is 20% and S3 is 50%.

§Errors:
  • When the optimal Huffman Tree has a depth more than 128.
  • If the provided list of script weights is empty.
§Edge Cases:

If the script weight calculations overflow, a sub-optimal tree may be generated. This should not happen unless you are dealing with billions of branches with weights close to 2^32.

pub fn add_leaf_with_ver( self, depth: u8, script: Script, ver: LeafVersion, ) -> Result<TaprootBuilder, TaprootBuilderError>

Adds a leaf script at depth to the builder with script version ver. Errors if the leaves are not provided in DFS walk order. The depth of the root node is 0.

pub fn add_leaf( self, depth: u8, script: Script, ) -> Result<TaprootBuilder, TaprootBuilderError>

Adds a leaf script at depth to the builder with default script version. Errors if the leaves are not provided in DFS walk order. The depth of the root node is 0.

See TaprootBuilder::add_leaf_with_ver for adding a leaf with specific version.

pub fn add_hidden_node( self, depth: u8, hash: Hash, ) -> Result<TaprootBuilder, TaprootBuilderError>

Adds a hidden/omitted node at depth to the builder. Errors if the leaves are not provided in DFS walk order. The depth of the root node is 0.

pub fn is_finalizable(&self) -> bool

Checks if the builder has finalized building a tree.

pub fn has_hidden_nodes(&self) -> bool

Checks if the builder has hidden nodes.

pub fn finalize<C>( self, secp: &Secp256k1<C>, internal_key: XOnlyPublicKey, ) -> Result<TaprootSpendInfo, TaprootBuilder>
where C: Verification,

Creates a TaprootSpendInfo with the given internal key.

Returns the unmodified builder as Err if the builder is not finalizable. See also TaprootBuilder::is_finalizable

Trait Implementations§

§

impl Clone for TaprootBuilder

§

fn clone(&self) -> TaprootBuilder

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
§

impl Debug for TaprootBuilder

§

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

Formats the value using the given formatter. Read more
§

impl Default for TaprootBuilder

§

fn default() -> TaprootBuilder

Returns the “default value” for a type. Read more
§

impl From<TapTree> for TaprootBuilder

§

fn from(tree: TapTree) -> TaprootBuilder

Converts to this type from the input type.
§

impl Hash for TaprootBuilder

§

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

Feeds this value into the given Hasher. Read more
1.3.0 · source§

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

Feeds a slice of this type into the given Hasher. Read more
§

impl Ord for TaprootBuilder

§

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

This method returns an Ordering between self and other. Read more
1.21.0 · source§

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

Compares and returns the maximum of two values. Read more
1.21.0 · source§

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

Compares and returns the minimum of two values. Read more
1.50.0 · source§

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

Restrict a value to a certain interval. Read more
§

impl PartialEq for TaprootBuilder

§

fn eq(&self, other: &TaprootBuilder) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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 TaprootBuilder

§

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

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

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

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

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

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · source§

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

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

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

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

impl TryFrom<TaprootBuilder> for TapTree

§

fn try_from( builder: TaprootBuilder, ) -> Result<TapTree, <TapTree as TryFrom<TaprootBuilder>>::Error>

Constructs TapTree from a TaprootBuilder if it is complete binary tree.

§Returns

A TapTree iff the builder is complete, otherwise return IncompleteTapTree error with the content of incomplete builder instance.

§

type Error = IncompleteTapTree

The type returned in the event of a conversion error.
§

impl Eq for TaprootBuilder

§

impl StructuralPartialEq for TaprootBuilder

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

§

fn implicit( self, class: Class, constructed: bool, tag: u32, ) -> TaggedParser<'a, Implicit, Self, E>

source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
§

impl<Q, K> Comparable<K> for Q
where Q: Ord + ?Sized, K: Borrow<Q> + ?Sized,

§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> FromRef<T> for T
where T: Clone,

§

fn from_ref(input: &T) -> T

Converts to this type from a reference to the input type.
§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoRequest<T> for T

source§

fn into_request(self) -> Request<T>

Wrap the input message T in a tonic::Request
source§

impl<T> Same for T

source§

type Output = T

Should always be Self
source§

impl<T> ToOwned for T
where T: Clone,

source§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

impl<T> DartSafe for T

§

impl<T> TaskRetFutTrait for T
where T: Send,