pub enum BareCtx {}
Expand description

Bare ScriptContext To be used as raw script pubkeys In general, it is not recommended to use Bare descriptors as they as strongly limited by standardness policies.

Trait Implementations§

source§

impl Clone for BareCtx

source§

fn clone(&self) -> BareCtx

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
source§

impl Debug for BareCtx

source§

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

Formats the value using the given formatter. Read more
source§

impl Hash for BareCtx

source§

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

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
source§

impl Ord for BareCtx

source§

fn cmp(&self, other: &BareCtx) -> 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 + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for BareCtx

source§

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

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

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.
source§

impl PartialOrd for BareCtx

source§

fn partial_cmp(&self, other: &BareCtx) -> 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

This method 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

This method 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

This method 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

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

impl ScriptContext for BareCtx

§

type Key = PublicKey

The consensus key associated with the type. Must be a parseable key
source§

fn check_terminal_non_malleable<Pk: MiniscriptKey>( _frag: &Terminal<Pk, Self> ) -> Result<(), ScriptContextError>

Depending on ScriptContext, fragments can be malleable. For Example, under Legacy context, PkH is malleable because it is possible to estimate the cost of satisfaction because of compressed keys This is currently only used in compiler code for removing malleable compilations. This does NOT recursively check if the children of the fragment are valid or not. Since the compilation proceeds in a leaf to root fashion, a recursive check is unnecessary.
source§

fn check_global_consensus_validity<Pk: MiniscriptKey>( ms: &Miniscript<Pk, Self> ) -> Result<(), ScriptContextError>

Depending on script Context, some of the Terminals might not be valid under the current consensus rules. Or some of the script resource limits may have been exceeded. These miniscripts would never be accepted by the Bitcoin network and hence it is safe to discard them For example, in Segwit Context with MiniscriptKey as bitcoin::PublicKey uncompressed public keys are non-standard and thus invalid. In LegacyP2SH context, scripts above 520 bytes are invalid. Post Tapscript upgrade, this would have to consider other nodes. This does NOT recursively check the miniscript fragments.
source§

fn check_local_consensus_validity<Pk: MiniscriptKey>( ms: &Miniscript<Pk, Self> ) -> Result<(), ScriptContextError>

Consensus rules at the Miniscript satisfaction time. It is possible that some paths of miniscript may exceed resource limits and our current satisfier and lifting analysis would not work correctly. For example, satisfaction path(Legacy/Segwitv0) may require more than 201 opcodes.
source§

fn other_top_level_checks<Pk: MiniscriptKey>( ms: &Miniscript<Pk, Self> ) -> Result<(), Error>

Other top level checks that are context specific
source§

fn max_satisfaction_size<Pk: MiniscriptKey>( ms: &Miniscript<Pk, Self> ) -> Option<usize>

Depending on script context, the size of a satifaction witness may slightly differ.
source§

fn pk_len<Pk: MiniscriptKey>(pk: &Pk) -> usize

Get the len of public key when serialized based on context Note that this includes the serialization prefix. Returns 34/66 for Bare/Legacy based on key compressedness 34 for Segwitv0, 33 for Tap
source§

fn name_str() -> &'static str

Local helper function to display error messages with context
source§

fn sig_type() -> SigType

The type of signature required for satisfaction
source§

fn check_witness<Pk: MiniscriptKey>( _witness: &[Vec<u8>] ) -> Result<(), ScriptContextError>

Check whether the given satisfaction is valid under the ScriptContext For example, segwit satisfactions may fail if the witness len is more 3600 or number of stack elements are more than 100.
source§

fn check_global_policy_validity<Pk: MiniscriptKey>( _ms: &Miniscript<Pk, Self> ) -> Result<(), ScriptContextError>

Depending on script Context, some of the script resource limits may have been exceeded under the current bitcoin core policy rules These miniscripts would never be accepted by the Bitcoin network and hence it is safe to discard them. (unless explicitly disabled by non-standard flag) For example, in Segwit Context with MiniscriptKey as bitcoin::PublicKey scripts over 3600 bytes are invalid. Post Tapscript upgrade, this would have to consider other nodes. This does NOT recursively check the miniscript fragments.
source§

fn check_local_policy_validity<Pk: MiniscriptKey>( _ms: &Miniscript<Pk, Self> ) -> Result<(), ScriptContextError>

Policy rules at the Miniscript satisfaction time. It is possible that some paths of miniscript may exceed resource limits and our current satisfier and lifting analysis would not work correctly. For example, satisfaction path in Legacy context scriptSig more than 1650 bytes
source§

fn check_global_validity<Pk: MiniscriptKey>( ms: &Miniscript<Pk, Self> ) -> Result<(), ScriptContextError>

Check the consensus + policy(if not disabled) rules that are not based satisfaction
source§

fn check_local_validity<Pk: MiniscriptKey>( ms: &Miniscript<Pk, Self> ) -> Result<(), ScriptContextError>

Check the consensus + policy(if not disabled) rules including the ones for satisfaction
source§

fn top_level_type_check<Pk: MiniscriptKey>( ms: &Miniscript<Pk, Self> ) -> Result<(), Error>

Check whether the top-level is type B
source§

fn top_level_checks<Pk: MiniscriptKey>( ms: &Miniscript<Pk, Self> ) -> Result<(), Error>

Check top level consensus rules.
source§

impl Eq for BareCtx

source§

impl StructuralEq for BareCtx

source§

impl StructuralPartialEq for BareCtx

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
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> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

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> ToOwned for T
where T: Clone,

§

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>,

§

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>,

§

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.