Struct Bare

pub struct Bare<Pk: MiniscriptKey> { /* private fields */ }

Create a Bare Descriptor. That is descriptor that is not wrapped in sh or wsh. This covers the Pk descriptor

Implementations

impl<Pk: MiniscriptKey> Bare<Pk>

pub fn new(ms: Miniscript<Pk, BareCtx>) -> Result<Self, Error>

Create a new raw descriptor

pub fn into_inner(self) -> Miniscript<Pk, BareCtx>

get the inner

pub fn as_inner(&self) -> &Miniscript<Pk, BareCtx>

get the inner

impl<Pk: MiniscriptKey + ToPublicKey> Bare<Pk>

pub fn spk(&self) -> Script

Obtain the corresponding script pubkey for this descriptor Non failing verion of DescriptorTrait::script_pubkey for this descriptor

pub fn inner_script(&self) -> Script

Obtain the underlying miniscript for this descriptor Non failing verion of DescriptorTrait::explicit_script for this descriptor

pub fn ecdsa_sighash_script_code(&self) -> Script

Obtain the pre bip-340 signature script code for this descriptor Non failing verion of DescriptorTrait::script_code for this descriptor

Trait Implementations

impl<Pk: Clone + MiniscriptKey> Clone for Bare<Pk>

fn clone(&self) -> Bare<Pk>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Pk: MiniscriptKey> Debug for Bare<Pk>

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

Formats the value using the given formatter.

impl<Pk: MiniscriptKey> DescriptorTrait<Pk> for Bare<Pk>

fn sanity_check(&self) -> Result<(), Error>

Whether the descriptor is safe Checks whether all the spend paths in the descriptor are possible on the bitcoin network under the current standardness and consensus rules Also checks whether the descriptor requires signauture on all spend paths And whether the script is malleable. In general, all the guarantees of miniscript hold only for safe scripts. All the analysis guarantees of miniscript only hold safe scripts. The signer may not be able to find satisfactions even if one exists

fn address(&self, _network: Network) -> Result<Address, Error>

where Pk: ToPublicKey,

Computes the Bitcoin address of the descriptor, if one exists Some descriptors like pk() don’t have any address. Errors:

fn script_pubkey(&self) -> Script

where Pk: ToPublicKey,

Computes the scriptpubkey of the descriptor

fn unsigned_script_sig(&self) -> Script

where Pk: ToPublicKey,

Computes the scriptSig that will be in place for an unsigned input spending an output with this descriptor. For pre-segwit descriptors, which use the scriptSig for signatures, this returns the empty script.

fn explicit_script(&self) -> Result<Script, Error>

where Pk: ToPublicKey,

Computes the “witness script” of the descriptor, i.e. the underlying script before any hashing is done. For Bare, Pkh and Wpkh this is the scriptPubkey; for ShWpkh and Sh this is the redeemScript; for the others it is the witness script. For Tr descriptors, this will error as there is no underlying script

fn get_satisfaction<S>( &self, satisfier: S, ) -> Result<(Vec<Vec<u8>>, Script), Error>

where Pk: ToPublicKey, S: Satisfier<Pk>,

Returns satisfying non-malleable witness and scriptSig with minimum weight to spend an output controlled by the given descriptor if it possible to construct one using the satisfier S.

fn get_satisfaction_mall<S>( &self, satisfier: S, ) -> Result<(Vec<Vec<u8>>, Script), Error>

where Pk: ToPublicKey, S: Satisfier<Pk>,

Returns satisfying, possibly malleable witness and scriptSig to spend an output controlled by the given descriptor if it possible to construct one using the satisfier S.

fn max_satisfaction_weight(&self) -> Result<usize, Error>

Computes an upper bound on the weight of a satisfying witness to the transaction. Assumes all ec-signatures are 73 bytes, including push opcode and sighash suffix. Includes the weight of the VarInts encoding the scriptSig and witness stack length. Returns Error when the descriptor is impossible to safisfy (ex: sh(OP_FALSE))

fn script_code(&self) -> Result<Script, Error>

where Pk: ToPublicKey,

Get the scriptCode of a transaction output.

fn satisfy<S>(&self, txin: &mut TxIn, satisfier: S) -> Result<(), Error>

where Pk: ToPublicKey, S: Satisfier<Pk>,

Attempts to produce a non-malleable satisfying witness and scriptSig to spend an output controlled by the given descriptor; add the data to a given TxIn output.

impl<Pk: MiniscriptKey> Display for Bare<Pk>

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

Formats the value using the given formatter.

impl<Pk: MiniscriptKey> ForEachKey<Pk> for Bare<Pk>

fn for_each_key<'a, F: FnMut(ForEach<'a, Pk>) -> bool>( &'a self, pred: F, ) -> bool

where Pk: 'a, Pk::Hash: 'a,

Run a predicate on every key in the descriptor, returning whether the predicate returned true for every key

fn for_any_key<'a, F: FnMut(ForEach<'a, Pk>) -> bool>(&'a self, pred: F) -> bool

where Pk: 'a, Pk::Hash: 'a,

Run a predicate on every key in the descriptor, returning whether the predicate returned true for any key

impl<Pk: MiniscriptKey> From<Bare<Pk>> for Descriptor<Pk>

fn from(inner: Bare<Pk>) -> Self

Converts to this type from the input type.

impl<Pk> FromStr for Bare<Pk>

where Pk: MiniscriptKey + FromStr, Pk::Hash: FromStr, <Pk as FromStr>::Err: ToString, <<Pk as MiniscriptKey>::Hash as FromStr>::Err: ToString,

type Err = Error

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl<Pk> FromTree for Bare<Pk>

where Pk: MiniscriptKey + FromStr, Pk::Hash: FromStr, <Pk as FromStr>::Err: ToString, <<Pk as MiniscriptKey>::Hash as FromStr>::Err: ToString,

fn from_tree(top: &Tree<'_>) -> Result<Self, Error>

Extract a structure from Tree representation

impl<Pk: Hash + MiniscriptKey> Hash for Bare<Pk>

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<Pk: MiniscriptKey> Liftable<Pk> for Bare<Pk>

fn lift(&self) -> Result<Policy<Pk>, Error>

Convert the object into an abstract policy

impl<Pk: Ord + MiniscriptKey> Ord for Bare<Pk>

fn cmp(&self, other: &Bare<Pk>) -> 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<Pk: PartialEq + MiniscriptKey> PartialEq for Bare<Pk>

fn eq(&self, other: &Bare<Pk>) -> 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<Pk: PartialOrd + MiniscriptKey> PartialOrd for Bare<Pk>

fn partial_cmp(&self, other: &Bare<Pk>) -> 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<P: MiniscriptKey, Q: MiniscriptKey> TranslatePk<P, Q> for Bare<P>

type Output = Bare<Q>

The associated output type. This must be Self

fn translate_pk<Fpk, Fpkh, E>( &self, translatefpk: Fpk, translatefpkh: Fpkh, ) -> Result<Self::Output, E>

where Fpk: FnMut(&P) -> Result<Q, E>, Fpkh: FnMut(&P::Hash) -> Result<Q::Hash, E>, Q: MiniscriptKey,

Translate a struct from one Generic to another where the translation for Pk is provided by translatefpk, and translation for PkH is provided by translatefpkh

fn translate_pk_infallible<Fpk, Fpkh>( &self, translatefpk: Fpk, translatefpkh: Fpkh, ) -> Self::Output

where Fpk: FnMut(&P) -> Q, Fpkh: FnMut(&P::Hash) -> Q::Hash,

Calls translate_pk with conversion functions that cannot fail

impl<Pk: Eq + MiniscriptKey> Eq for Bare<Pk>

impl<Pk: MiniscriptKey> StructuralPartialEq for Bare<Pk>