Enum miniscript::BareCtx

pub enum BareCtx {}

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

impl Clone for BareCtx

fn clone(&self) -> BareCtx

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BareCtx

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

Formats the value using the given formatter.

impl Hash for BareCtx

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 BareCtx

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

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<BareCtx> for BareCtx

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

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

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.

impl PartialOrd<BareCtx> for BareCtx

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

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

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl ScriptContext for BareCtx

type Key = PublicKey

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

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.

fn check_pk<Pk: MiniscriptKey>(pk: &Pk) -> Result<(), ScriptContextError>

Each context has slightly different rules on what Pks are allowed in descriptors Legacy/Bare does not allow x_only keys Segwit does not allow uncompressed keys and x_only keys Tapscript does not allow uncompressed keys

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.

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.

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

Other top level checks that are context specific

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.

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

fn name_str() -> &'static str

Local helper function to display error messages with context

fn sig_type() -> SigType

The type of signature required for satisfaction

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.

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.

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

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

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

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

Check whether the top-level is type B

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

Check top level consensus rules.

impl Eq for BareCtx

impl StructuralEq for BareCtx

impl StructuralPartialEq for BareCtx